Towards long term monitoring of electrodermal activity in daily life

Manic depression, also known as bipolar disorder, is a common and severe form of mental disorder. The European research project MONARCA aims at developing and validating mobile technologies for multi-parametric, long term monitoring of physiological and behavioral information relevant to bipolar disorder. One aspect of MONARCA is to investigate the long term monitoring of Electrodermal activity (EDA) to support the diagnosis and treatment of bipolar disorder patients. EDA is known as an indicator of the emotional state and the stress level of a person. To realize a long-term monitoring of the EDA, the integration of the sensor system in the shoe or sock is a promising approach. This paper presents a first step towards such a sensor system. In a feasibility study including 8 subjects, we investigate the correlation between EDA measurements at the fingers, which is the most established sensing site, with measurements of the EDA at the feet. The results indicate that 88% of the evoked skin conductance responses (SCRs) occur at both sensing sites. When using an action movie as psychophysiologically activating stimulus, we have found weaker reactivity in the foot than in the hand EDA. The results also suggest that the influence of moderate physical activity on EDA measurements is low and has a similar effect for both recording sites. This suggests that the foot recording location is suitable for recordings in daily life even in the presence of moderate movement.     

Visual Inspection of Multivariate Graphs

Most graph visualization techniques focus on the structure of graphs and do not offer support for dealing with node attributes and edge labels. To enable users to detect relations and patterns in terms of data associated with nodes and edges, we present a technique where this data plays a more central role. Nodes and edges are clustered based on associated data. Via direct manipulation users can interactively inspect and query the graph. Questions that can be answered include, “which edge types are activated by specific node attributes?” and, “how and from where can I reach specific types of nodes?” To validate our approach we contrast it with current practice. We also provide several examples where our method was used to study transition graphs that model real‐world systems.     

Matrix Interpretations for Proving Termination of Term Rewriting

We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every rewrite step causes a decrease, but instead of the usual natural numbers we use vectors of natural numbers, ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by linear mappings represented by matrices. This method allows us to prove termination and relative termination. A modification of the latter, in which strict steps are only allowed at the top, turns out to be helpful in combination with the dependency pair transformation. By bounding the dimension and the matrix coefficients, the search problem becomes finite. Our implementation transforms it to a Boolean satisfiability problem (SAT), to be solved by a state-of-the-art SAT solver.     

Understanding unforeseen production downtimes in manufacturing processes using log data-driven causal reasoning

Journal of Intelligent Manufacturing - In discrete manufacturing, the knowledge about causal relationships makes it possible to avoid unforeseen production downtimes by identifying their root...     

Relaxing high-dimensional constraints in the direct solution space method for early phase development

Early phase distributed system design can be accomplished using solution spaces that provide an interval of permissible values for each functional parameter. The feasibility property guarantees fulfillment of all design requirements for all possible realizations. Flexibility denotes the size measure of the intervals, with higher flexibility benefiting the design process. Two methods are available for solution space identification. The direct method solves a computationally cheap optimization problem. The indirect method employs a sampling approach that requires a relaxation of the feasibility property through re-formulation as a chance constraint. Even for high probabilities of fulfillment, \(P>0.99\), this results in substantial increases in flexibility, which offsets the risk of infeasibility. This work implements the chance constraint formulation into the direct method for linear constraints by showing that its problem statement can be understood as a linear robust optimization problem. Approximations of chance constraints from the literature are transferred into the context of solution spaces. From this, we derive a theoretical value for the safety parameter \(\varOmega\). A further modification is presented for use cases, where some intervals are already predetermined. A problem from vehicle safety is used to compare the modified direct and indirect methods and discuss suitable choices of \(\varOmega\). We find that the modified direct method is able to identify solution spaces with similar flexibility, while maintaining its cost advantage.     

Process optimization in the self-reacting friction stir welding of aluminum 6061-T6

Self-reacting friction stir welding (SR-FSW), also called bobbin-tool friction stir welding (BT-FSW), is a solid state welding process similar to friction stir welding (FSW) except that the tool has two opposing shoulders instead of the shoulder and a backing plate found in FSW. The tool configuration results in greater heat input and a symmetrical weld macrostructure. A significant amount of information has been published in the literature concerning traditional FSW while little has been published about SR-FSW. An optimization experiment was performed using a factorial design to evaluate the effect of process parameters on the weld temperature, surface and internal quality, and mechanical properties of self-reacting friction stir welded aluminum alloy 6061-T6 butt joints. The parameters evaluated were tool rotational speed, traverse speed, and tool plunge force. A correlation between weld temperature, defect formation (specifically galling and void formation), and mechanical properties was found. Optimum parameters were determined for the welding of 8-mm-thick 6061-T6 plate.     

Controlled counter-flow motion of magnetic bead chains rolling along microchannels

We demonstrate controlled transport of superparamagnetic beads in the opposite direction of a laminar flow. A permanent magnet assembles 200 nm magnetic particles into about 200 μm long bead chains that are aligned in parallel to the magnetic field lines. Due to a magnetic field gradient, the bead chains are attracted towards the wall of a microfluidic channel. A rotation of the permanent magnet results in a rotation of the bead chains in the opposite direction to the magnet. Due to friction on the surface, the bead chains roll along the channel wall, even in counter-flow direction, up to at a maximum counter-flow velocity of 8 mm s⁻¹. Based on this approach, magnetic beads can be accurately manoeuvred within microfluidic channels. This counter-flow motion can be efficiently be used in Lab-on-a-Chip systems, e.g. for implementing washing steps in DNA purification.     

On predictive accuracy and risk minimization in pairwise label ranking

We study the problem of label ranking, a machine learning task that consists of inducing a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by pairwise comparison (RPC), first induces pairwise order relations (preferences) from suitable training data, using a natural extension of so-called pairwise classification. A ranking is then derived from a set of such relations by means of a ranking procedure. In this paper, we first elaborate on a key advantage of such a decomposition, namely the fact that it allows the learner to adapt to different loss functions without re-training, by using different ranking procedures on the same predicted order relations. In this regard, we distinguish between two types of errors, called, respectively, ranking error and position error. Focusing on the position error, which has received less attention so far, we then propose a ranking procedure called ranking through iterated choice as well as an efficient pairwise implementation thereof. Apart from a theoretical justification of this procedure, we offer empirical evidence in favor of its superior performance as a risk minimizer for the position error.