280 research outputs found

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

    Get PDF
    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

    Multiclass Sparse Centroids With Application to Fast Time Series Classification

    Get PDF
    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

    A robust MPC approach for the rebalancing of mobility on demand systems

    Get PDF
    A control-oriented model for mobility-on-demand systems is here proposed. The system is first described through dynamical stochastic state-space equations, and then suitably simplified in order to obtain a controloriented model, on which two control strategies based on Model Predictive Control are designed. The first strategy aims at keeping the expected value of the number of vehicles parked in stations within prescribed bounds; the second strategy specifically accounts for stochastic fluctuations around the expected value. The model includes the possibility of weighting the control effort, leading to control solutions that may trade off efficiency and cost. The models and control strategies are validated over a dataset of logged trips of ToBike, the bike-sharing systems in the city of Turin, Italy

    Random convex programs for distributed multi-agent consensus

    Get PDF
    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

    A model predictive control approach to optimally devise a two-dose vaccination rollout: A case study on COVID-19 in Italy

    Get PDF
    The COVID-19 pandemic has led to the unprecedented challenge of devising massive vaccination rollouts, toward slowing down and eventually extinguishing the diffusion of the virus. The two-dose vaccination procedure, speed requirements, and the scarcity of doses, suitable spaces, and personnel, make the optimal design of such rollouts a complex problem. Mathematical modeling, which has already proved to be determinant in the early phases of the pandemic, can again be a powerful tool to assist public health authorities in optimally planning the vaccination rollout. Here, we propose a novel epidemic model tailored to COVID-19, which includes the effect of nonpharmaceutical interventions and a concurrent two-dose vaccination campaign. Then, we leverage nonlinear model predictive control to devise optimal scheduling of first and second doses, accounting both for the healthcare needs and for the socio-economic costs associated with the epidemics. We calibrate our model to the 2021 COVID-19 vaccination campaign in Italy. Specifically, once identified the epidemic parameters from officially reported data, we numerically assess the effectiveness of the obtained optimal vaccination rollouts for the two most used vaccines. Determining the optimal vaccination strategy is nontrivial, as it depends on the efficacy and duration of the first-dose partial immunization, whereby the prioritization of first doses and the delay of second doses may be effective for vaccines with sufficiently strong first-dose immunization. Our model and optimization approach provide a flexible tool that can be adopted to help devise the current COVID-19 vaccination campaign, and increase preparedness for future epidemics

    Data-driven extraction of uniformly stable and passive parameterized macromodels

    Get PDF
    A Robust algorithm for the extraction of reduced-order behavioral models from sampled frequency responses is proposed. The system under investigation can be any Linear and Time Invariant structure, although the main emphasis is on devices that are relevant for Signal and Power Integrity and RF design, such as electrical interconnects and integrated passive components. We assume that the device under modeling is parameterized by one or more design variables, which can be related to geometry or materials. Therefore, we seek for multivariate macromodels that reproduce the dynamic behavior over a predefined frequency band, with an explicit embedded dependence of the model equations on these external parameters. Such parameterized macromodels may be used to construct component libraries and prove very useful in fast system-level numerical simulations in time or frequency domain, including optimization, what-if, and sensitivity analysis. The main novel contribution is the formulation of a finite set of convex constraints that are applied during model identification, which provide sufficient conditions for uniform model stability and passivity throughout the parameter space. Such constraints are characterized by an explicit control allowing for a trade-off between model accuracy and runtime, thanks to some special properties of Bernstein polynomials. In summary, we solve the longstanding problem of multivariate stability and passivity enforcement in data-driven model order reduction, which insofar has been tackled only via either overconservative or heuristic and possibly unreliable methods

    Survival and Neural Models for Private Equity Exit Prediction

    Get PDF
    Within the Private Equity (PE) market, the event of a private company undertaking an Initial Public Offering (IPO) is usually a very high-return one for the investors in the company. For this reason, an effective predictive model for the IPO event is considered as a valuable tool in the PE market, an endeavor in which publicly available quantitative information is generally scarce. In this paper, we describe a data-analytic procedure for predicting the probability with which a company will go public in a given forward period of time. The proposed method is based on the interplay of a neural network (NN) model for estimating the overall event probability, and Survival Analysis (SA) for further modeling the probability of the IPO event in any given interval of time. The proposed neuro-survival model is tuned and tested across nine industrial sectors using real data from the Thomson Reuters Eikon PE database

    From Uncertainty Data to Robust Policies for Temporal Logic Planning

    Full text link
    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
    • …
    corecore