Facets of the Fully Mixed Nash Equilibrium Conjecture

In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE\mathsf{FMNE} Conjecture, in selfish routing for the special case of n identical users over two (identical) parallel links. We introduce a new measure of Social Cost, defined as the expectation of the square of the maximum congestion on a link; we call it Quadratic Maximum Social Cost. A Nash equilibrium is a stable state where no user can improve her (expected) latency by switching her mixed strategy; a worst-case Nash equilibrium is one that maximizes Quadratic Maximum Social Cost. In the fully mixed Nash equilibrium, all mixed strategies achieve full support.     

Modeling and control of the doubly fed induction generator wind turbine

The present paper deals with the modeling of wind turbine generation systems. The model of a doubly fed induction generator, along with the corresponding converter, crow bar protection and electrical grid is described. The different level control strategies both in normal operation and under voltage dig conditions are discussed, including speed control, torque and reactive power control for the rotor-side converter, reactive and DC voltage control for the grid-side converter and the corresponding current loops control. The results obtained with simulations are compared to experimental data obtained from voltage sags provoked to real wind turbines.     

A novel HMM-based learning framework for improving dynamic wireless push system performance

A new machine learning framework is introduced in this paper, based on the hidden Markov model (HMM), designed to provide scheduling in dynamic wireless push systems. In realistic wireless systems, the clients’ intentions change dynamically; hence a cognitive scheduling scheme is needed to estimate the desirability of the connected clients. The proposed scheduling scheme is enhanced with self-organized HMMs, supporting the network with an estimated expectation of the clients’ intentions, since the system’s environment characteristics alter dynamically and the base station (server side) has no a priori knowledge of such changes. Compared to the original pure scheme, the proposed machine learning framework succeeds in predicting the clients’ information desires and overcomes the limitation of the original static scheme, in terms of mean delay and system efficiency.     

Spectral registration of noisy sonar data for underwater 3D mapping

3D mapping is very challenging in the underwater domain, especially due to the lack of high resolution, low noise sensors. A new spectral registration method is presented that can determine the spatial 6 DOF transformation between pairs of very noisy 3D scans with only partial overlap. The approach is hence suited to cope with sonar as the predominant underwater sensor. The spectral registration method is based on Phase Only Matched Filtering (POMF) on non-trivially resampled spectra of the 3D data.     

Tracking control for boundary controlled parabolic PDEs with varying parameters: Combining backstepping and differential flatness

The combination of backstepping-based state-feedback control and flatness-based trajectory planning and feedforward control is considered for the design of an exponentially stabilizing tracking controller for a linear diffusion-convection-reaction system with spatially and temporally varying parameters and nonlinear boundary input. For this, in a first step the backstepping transformation is utilized to determine a state-feedback controller, which transforms the original distributed-parameter system into an appropriately chosen exponentially stable distributed-parameter target system of a significantly simpler structure. In a second step, the flatness property of the target system is exploited in order to determine the feedforward controller, which allows us to realize the tracking of suitably prescribed trajectories for the system output. This results in a systematic procedure for the design of an exponentially stabilizing tracking controller for the considered general linear diffusion-convection-reaction system with varying parameters, whose applicability and tracking performance is evaluated in simulation studies.     

Simplicial powers of graphs

In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a graph G=(V_G,E_G) is the k-simplicial power of a graph H=(V_H,E_H) (H a root graph of G) if V_G is the set of all simplicial vertices of H, and for all distinct vertices x and y in V_G, xyE_G if and only if the distance in H between x and y is at most k. This concept generalizes k-leaf powers introduced by Nishimura, Ragde and Thilikos which were motivated by the search for underlying phylogenetic trees; k-leaf powers are the k-simplicial powers of trees. Recently, a lot of work has been done on k-leaf powers and their roots as well as on their variants phylogenetic roots and Steiner roots. For k≤5, k-leaf powers can be recognized in linear time, and for k≤4, structural characterizations are known. For k≥6, the recognition and characterization problems of k-leaf powers are still open. Since trees and block graphs (i.e., connected graphs whose blocks are cliques) have very similar metric properties, it is natural to study k-simplicial powers of block graphs. We show that leaf powers of trees and simplicial powers of block graphs are closely related, and we study simplicial powers of other graph classes containing all trees such as ptolemaic graphs and strongly chordal graphs.     

Changes in the microstructure of materials and their impact on reliability: experiments and modeling

Several types of microstructural changes in microelectronic solder materials are briefly discussed, namely the formation of intermetallics, Kirkendall voiding, spinodal decomposition, and coarsening. Moreover, a theoretical framework, based on the entropy principle, is developed by means of which constitutive equations can be derived that are necessary to understand and simulate such processes. The resulting equations are specialized to binary alloys and then investigated numerically. Finally, simulations of spinodal decomposition and coarsening are performed for the eutectic solder AgCu. The theoretical predictions are compared with experiments.

---

Pupil detection for head-mounted eye tracking in the wild: an evaluation of the state of the art

Robust and accurate detection of the pupil position is a key building block for head-mounted eye tracking and prerequisite for applications on top, such as gaze-based human–computer interaction or attention analysis. Despite a large body of work, detecting the pupil in images recorded under real-world conditions is challenging given significant variability in the eye appearance (e.g., illumination, reflections, occlusions, etc.), individual differences in eye physiology, as well as other sources of noise, such as contact lenses or make-up. In this paper we review six state-of-the-art pupil detection methods, namely ElSe (Fuhl et al. in Proceedings of the ninth biennial ACM symposium on eye tracking research & applications, ACM. New York, NY, USA, pp 123–130, 2016), ExCuSe (Fuhl et al. in Computer analysis of images and patterns. Springer, New York, pp 39–51, 2015), Pupil Labs (Kassner et al. in Adjunct proceedings of the 2014 ACM international joint conference on pervasive and ubiquitous computing (UbiComp), pp 1151–1160, 2014. doi: 10.1145/2638728.2641695), SET (Javadi et al. in Front Neuroeng 8, 2015), Starburst (Li et al. in Computer vision and pattern recognition-workshops, 2005. IEEE Computer society conference on CVPR workshops. IEEE, pp 79–79, 2005), and ?wirski (?wirski et al. in Proceedings of the symposium on eye tracking research and applications (ETRA). ACM, pp 173–176, 2012. doi: 10.1145/2168556.2168585). We compare their performance on a large-scale data set consisting of 225,569 annotated eye images taken from four publicly available data sets. Our experimental results show that the algorithm ElSe (Fuhl et al. 2016) outperforms other pupil detection methods by a large margin, offering thus robust and accurate pupil positions on challenging everyday eye images.