Stereo‐Consistent Contours in Object Space

Notebook scribbles, art or technical illustrations—line drawings are a simplistic method to visually communicate information. Automated line drawings often originate from virtual 3D models, but one cannot trivially experience their three‐dimensionality. This paper introduces a novel concept to produce stereo‐consistent line drawings of virtual 3D objects. Some contour lines do not only depend on an objects geometry, but also on the position of the observer. To accomplish consistency between multiple view positions, our approach exploits geometrical characteristics of 3D surfaces in object space. Established techniques for stereo‐consistent line drawings operate on rendered pixel images. In contrast, our pipeline operates in object space using vector geometry, which yields many advantages: The position of the final viewpoint(s) is flexible within a certain window even after the contour generation, e.g. a stereoscopic image pair is only one possible application. Such windows can be concatenated to simulate contours observed from an arbitrary camera path. Various types of popular contour generators can be handled equivalently, occlusions are natively supported and stylization based on geometry characteristics is also easily possible.     

Job-shop scheduling in a body shop

We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain operations of different jobs are not allowed to be processed at the same time and after processing an operation of a certain job a machine might be unavailable for a given time for operations of other jobs. As main results we will show that for three jobs and four machines the special case where only one machine is used by more than one job is already $\mathcal NP $ -hard. This also implies that the single machine scheduling problem that asks for a makespan minimal schedule of three chains of operations with delays between the operations of a chain is $\mathcal NP $ -hard. On the positive side, we present a polynomial algorithm for the two job case and a pseudo-polynomial algorithm together with an FPTAS  for an arbitrary but constant number of jobs. Hence for a constant number of jobs we fully settle the complexity status of the problem.     

A seamless ground truth detection for enhancing localization on mobile robots

Robot localization mechanism is an essential feature to determine the position of the corresponding robot within an environment, particularly in the field of Standard Platform League (SPL) at the RoboCup. Despite the available input from the onboard sensors, the ground truth information is necessary for a real-time localization system. This study proposes an efficient color-based segmentation scheme using an overhead projective camera with an autonomous calibration procedure. This enhances the system robustness against lighting changes and different labeling setups for the field environment. The experimental results show that the proposed method localizes and recognizes objects with a detection rate of 96.4%.     

Analyses of activity design in geometry in the light of student actions

Abstract

The goal of this study is to show that inquiry activities in a dynamic geometry environment, intentionally designed to confront students with contradictions and uncertainties, push them towards explanations that include deductive elements. Three different but dependent aspects of the activities are characterized and analysed: The epistemological, which includes all possible inquiry paths; the didactic, which involves only those paths that reflect the intention of the designer; and the cognitive, which accounts for actual student actions (conjectures and explanations) and their analyses. The research conclusions are based on the interplay among these three aspects. The analysis of students’ investigations and the analysis of their explanations fulfil, to a broad extent, the design goals.     

On finite dimensional realization theory of discrete time nonlinear systems

We characterize finite dimensional realizability of discrete time nonlinear systems which have a Volterra series development with separable structure of the Volterra kernels.     

Consumer credit risk: Individual probability estimates using machine learning

Consumer credit scoring is often considered a classification task where clients receive either a good or a bad credit status. Default probabilities provide more detailed information about the creditworthiness of consumers, and they are usually estimated by logistic regression. Here, we present a general framework for estimating individual consumer credit risks by use of machine learning methods. Since a probability is an expected value, all nonparametric regression approaches which are consistent for the mean are consistent for the probability estimation problem. Among others, random forests (RF), k-nearest neighbors (kNN), and bagged k-nearest neighbors (bNN) belong to this class of consistent nonparametric regression approaches. We apply the machine learning methods and an optimized logistic regression to a large dataset of complete payment histories of short-termed installment credits. We demonstrate probability estimation in Random Jungle, an RF package written in C++ with a generalized framework for fast tree growing, probability estimation, and classification. We also describe an algorithm for tuning the terminal node size for probability estimation. We demonstrate that regression RF outperforms the optimized logistic regression model, kNN, and bNN on the test data of the short-term installment credits.     

Effect of cathodic protection on macrocell currents: A viable method to monitor and control the efficiency of CP?

Corrosion protection of steel reinforcement in concrete structures by cathodic protection (CP) is a cost effective, reliable, and widely accepted method to stop and prevent the corrosion of the steel reinforcement. The efficiency of CP is usually monitored by the “24 h, 100 mV depolarization criterion,” a purely empirical criterion whose implementation is cost and labor intensive and that does not allow online control of CP. Within an extended research project on CP applied to concrete members of a highway bridge exposed to penetrating moisture, three sets of macrocells (MC), each composed of five MC sensors, were installed in conjunction with concrete resistance sensors and silver/silver chloride reference cells. Chloride profiles were determined from the cored or drilled powder originating from the installation of sensors and from drilling cores. Corrosion currents, steel potentials, and concrete resistance were monitored over a period of 1 year before, after installing the CP systems (which remained switched off for half a year for evaluating the effect of the conductive coating), and after start-up of the CP systems. The CP systems applied consist of a moisture resistant conductive coating. As expected CP has a pronounced effect on local MC currents: Anodic MC currents were reduced or changed into cathodic currents, whereas cathodic currents were only weakly influenced. By adjusting the applied protection current all anodic MC currents may be changed into cathodic MC currents. Results indicate that the 100 mV depolarization criterion is a conservative criterion in atmospherically exposed concrete; it is not reliable in strongly wetted concrete. There was no consistent correlation between the CP induced changes in the local MC currents and 24 h depolarization values indicating that large potential shifts induced by CP do not necessarily imply overprotection. Results show that monitoring MC currents before, during, and after CP operation allows to demonstrate in a transparent way the effect of CP on the corrosion of the steel reinforcement. Online monitoring of MC currents is proposed as a viable and comprehensible method to monitor and control the efficiency of CP.     

Redox control of exofacial protein thiols/disulfides by protein disulfide isomerase

Protein disulfide isomerase (PDI) facilitates proper folding and disulfide bonding of nascent proteins in the endoplasmic reticulum and is secreted by cells and associates with the cell surface. We examined the consequence of over- or underexpression of PDI in HT1080 fibrosarcoma cells for the redox state of cell-surface protein thiols/disulfides. Overexpression of PDI resulted in 3.6-4. 2-fold enhanced secretion of PDI and 1.5-1.7-fold increase in surface-bound PDI. Antisense-mediated underexpression of PDI caused 38-53% decreased secretion and 10-33% decrease in surface-bound PDI. Using 5,5'-dithio-bis(2-nitrobenzoic acid) to measure surface protein thiols, a 41-50% increase in surface thiols was observed in PDI-overexpressing cells, whereas a 29-33% decrease was observed in underexpressing cells. Surface thiol content was strongly correlated with cellular (r = 0.998) and secreted (r = 0.969) PDI levels. The pattern of exofacial protein thiols was examined by labeling with the membrane-impermeable thiol reactive compound, 3-(N-maleimidylpropionyl)biocytin. Fourteen identifiable proteins on HT1080 cells were labeled with 3-(N-maleimidylpropionyl)biocytin. The intensity of labeling of 11 proteins was increased with overexpression of PDI, whereas the intensity of labeling of 3 of the 11 proteins was clearly decreased with underexpression of PDI. These findings indicated that secreted PDI was controlling the redox state of existing exofacial protein thiols or reactive disulfide bonds.