Quantum spin Hall effect in bound states in continuum

Moving the polarization of the incident wave along a meridian of the Poincaré sphere, experimentally we show that the coupling with the fundamental Bloch's surface waves of the mode, provide a spatially coherent, macroscopic spinmomentum locked propagation along the symmetry axes of the PhCM. This novel mechanism of light-spin manipulation enables a versatile implementation of spin-optical structures that may pave the way to novel strategies for light spin technology and photonic multiplatform implementations

A review of the role of ultrasound biomicroscopy in glaucoma associated with rare diseases of the anterior segment

Ultrasound biomicroscopy is a non-invasive imaging technique, which allows high-resolution evaluation of the anatomical features of the anterior segment of the eye regardless of optical media transparency. This technique provides diagnostically significant information in vivo for the cornea, anterior chamber, chamber angle, iris, posterior chamber, zonules, ciliary body, and lens, and is of great value in assessment of the mechanisms of glaucoma onset. The purpose of this paper is to review the use of ultrasound biomicroscopy in the diagnosis and management of rare diseases of the anterior segment such as mesodermal dysgenesis of the neural crest, iridocorneal endothelial syndrome, phakomatoses, and metabolic disorders

Separable Multipartite Mixed States - Operational Asymptotically Necessary and Sufficient Conditions

We introduce an operational procedure to determine, with arbitrary probability and accuracy, optimal entanglement witness for every multipartite entangled state. This method provides an operational criterion for separability which is asymptotically necessary and sufficient. Our results are also generalized to detect all different types of multipartite entanglement.Comment: 4 pages, 2 figures, submitted to Physical Review Letters. Revised version with new calculation

From Uncertainty Data to Robust Policies for Temporal Logic Planning

We consider the problem of synthesizing robust disturbance feedback policies for systems performing complex tasks. We formulate the tasks as linear temporal logic specifications and encode them into an optimization framework via mixed-integer constraints. Both the system dynamics and the specifications are known but affected by uncertainty. The distribution of the uncertainty is unknown, however realizations can be obtained. We introduce a data-driven approach where the constraints are fulfilled for a set of realizations and provide probabilistic generalization guarantees as a function of the number of considered realizations. We use separate chance constraints for the satisfaction of the specification and operational constraints. This allows us to quantify their violation probabilities independently. We compute disturbance feedback policies as solutions of mixed-integer linear or quadratic optimization problems. By using feedback we can exploit information of past realizations and provide feasibility for a wider range of situations compared to static input sequences. We demonstrate the proposed method on two robust motion-planning case studies for autonomous driving

Age class structure in SIRD models for the COVID-19 - An analysis of Tennessee data

The COVID-19 pandemic is bringing disruptive effects on the healthcare system, economy and social life of countries all over the world. Even though the elder portion of the population is the most severely affected by the coronavirus disease, the counter-measures introduced so far by the governments do not take into account age structure, and the restrictions act uniformly on the population irrespectively of age. In this paper, we introduce a SIRD model with age classes for studying the impact on the epidemic evolution of lockdown policies applied heterogeneously on the different age groups of the population. The proposed model is then applied to COVID-19 data from the state of Tennessee. The simulation results suggest that a selective lockdown, while having a lighter socioeconomic impact, may bring benefits in terms of reduction of the mortality rate that are comparable to the ones obtained by a uniform lockdown

Algorithm Engineering in Robust Optimization

Robust optimization is a young and emerging field of research having received a considerable increase of interest over the last decade. In this paper, we argue that the the algorithm engineering methodology fits very well to the field of robust optimization and yields a rewarding new perspective on both the current state of research and open research directions. To this end we go through the algorithm engineering cycle of design and analysis of concepts, development and implementation of algorithms, and theoretical and experimental evaluation. We show that many ideas of algorithm engineering have already been applied in publications on robust optimization. Most work on robust optimization is devoted to analysis of the concepts and the development of algorithms, some papers deal with the evaluation of a particular concept in case studies, and work on comparison of concepts just starts. What is still a drawback in many papers on robustness is the missing link to include the results of the experiments again in the design

Multiclass Sparse Centroids With Application to Fast Time Series Classification

In this article, we propose an efficient multiclass classification scheme based on sparse centroids classifiers. The proposed strategy exhibits linear complexity with respect to both the number of classes and the cardinality of the feature space. The classifier we introduce is based on binary space partitioning, performed by a decision tree where the assignation law at each node is defined via a sparse centroid classifier. We apply the presented strategy to the time series classification problem, showing by experimental evidence that it achieves performance comparable to that of state-of-the-art methods, but with a significantly lower classification time. The proposed technique can be an effective option in resource-constrained environments where the classification time and the computational cost are critical or, in scenarios, where real-time classification is necessary

Random convex programs for distributed multi-agent consensus

We consider convex optimization problems with N randomly drawn convex constraints. Previous work has shown that the tails of the distribution of the probability that the optimal solution subject to these constraints will violate the next random constraint, can be bounded by a binomial distribution. In this paper we extend these results to the violation probability of convex combinations of optimal solutions of optimization problems with random constraints and different cost objectives. This extension has interesting applications to distributed multi-agent consensus algorithms in which the decision vectors of the agents are subject to random constraints and the agents' goal is to achieve consensus on a common value of the decision vector that satisfies the constraints. We give explicit bounds on the tails of the probability that the agents' decision vectors at an arbitrary iteration of the consensus protocol violate further constraint realizations. In a numerical experiment we apply these results to a model predictive control problem in which the agents aim to achieve consensus on a control sequence subject to random terminal constraints