Search results for " optimization."
showing 10 items of 2333 documents
Separatrix reconstruction to identify tipping points in an eco-epidemiological model
2018
Many ecological systems exhibit tipping points such that they suddenly shift from one state to another. These shifts can be devastating from an ecological point of view, and additionally have severe implications for the socio-economic system. They can be caused by overcritical perturbations of the state variables such as external shocks, disease emergence, or species removal. It is therefore important to be able to quantify the tipping points. Here we present a study of the tipping points by considering the basins of attraction of the stable equilibrium points. We address the question of finding the tipping points that lie on the separatrix surface, which partitions the space of system traj…
Observer-based control design for a class of nonlinear systems subject to unknown inputs: LMI approach
2015
This paper deals with the problem of observer-based controller design for a class of nonlinear systems subject to unknown inputs. A novel method is presented to design a controller using estimated state variables which guarantees all the state variables of the closed-loop system converge to the vicinity of the origin and stay there forever. This is done via satisfying several sufficient conditions in terms of nonlinear matrix inequalities. In light of linear algebra, particularly matrix decompositions, the achieved conditions will be converted to a Linear Matrix Inequality (LMI) problem to facilitate the procedure of computing the observer and controller gains. Finally, the effectiveness of…
Voltage Profile Improvement for Soc Son's Low-Voltage Grid with High Penetration of PV Systems by Optimizing the Location of SVC Devices
2018
This paper presents a method that is applied to optimize the placement of Static VAR compensators in a real low-voltage grid in the Vietnamese territory. In this way, the voltage profile of the distribution grid turns to be improved. A heuristic method, the Binary Particle Swarm Optimization, is used to find a solution to this problem within the Matlab environment. A case study that considers a high penetration of rooftop PV systems in a branch of Soc Son distribution grid is implemented to show the efficiency of the optimization method for this specific application.
Transitions between imperfectly ordered crystalline structures: A phase switch Monte Carlo study
2012
A model for two-dimensional colloids confined laterally by ``structured boundaries'' (i.e., ones that impose a periodicity along the slit) is studied by Monte Carlo simulations. When the distance $D$ between the confining walls is reduced at constant particle number from an initial value ${D}_{0}$, for which a crystalline structure commensurate with the imposed periodicity fits, to smaller values, a succession of phase transitions to imperfectly ordered structures occur. These structures have a reduced number of rows parallel to the boundaries (from $n$ to $n\ensuremath{-}1$ to $n\ensuremath{-}2$, etc.) and are accompanied by an almost periodic strain pattern, due to ``soliton staircases'' …
A Comparison of Formulae for Calculating Cost-Efficient Sample Sizes of Case-Control Studies with an Internal Validation Scheme
2000
When a case-control study is planned to include an internal validation study, the sample size of the study and the proportion of validated observations has to be calculated. There are a variety of alternative methods to accomplish this. In this article some possible procedures will be compared in order to clarify whether considerable differences in the suggested optimal designs occur, dependent on the used method.
Asymptotic optimality of myopic information-based strategies for Bayesian adaptive estimation
2016
This paper presents a general asymptotic theory of sequential Bayesian estimation giving results for the strongest, almost sure convergence. We show that under certain smoothness conditions on the probability model, the greedy information gain maximization algorithm for adaptive Bayesian estimation is asymptotically optimal in the sense that the determinant of the posterior covariance in a certain neighborhood of the true parameter value is asymptotically minimal. Using this result, we also obtain an asymptotic expression for the posterior entropy based on a novel definition of almost sure convergence on "most trials" (meaning that the convergence holds on a fraction of trials that converge…
Hölder Continuity up to the Boundary of Minimizers for Some Integral Functionals with Degenerate Integrands
2007
We study qualitative properties of minimizers for a class of integral functionals, defined in a weighted space. In particular we obtain Hölder regularity up to the boundary for the minimizers of an integral functional of high order by using an interior local regularity result and a modified Moser method with special test function.
A fast and recursive algorithm for clustering large datasets with k-medians
2012
Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. Borrowing ideas from MacQueen (1967) who introduced a sequential version of the $k$-means algorithm, a new class of recursive stochastic gradient algorithms designed for the $k$-medians loss criterion is proposed. By their recursive nature, these algorithms are very fast and are well adapted to deal with large samples of data that are allowed to arrive sequentially. It is proved that the stochastic gradient algorithm converges almost surely to the set of stationary points of the underlying loss criterion. A particular attention is paid to the averaged versions, which…
On-line Construction of Two-Dimensional Suffix Trees
1999
AbstractWe say that a data structure is builton-lineif, at any instant, we have the data structure corresponding to the input we have seen up to that instant. For instance, consider the suffix tree of a stringx[1,n]. An algorithm building iton-lineis such that, when we have read the firstisymbols ofx[1,n], we have the suffix tree forx[1,i]. We present a new technique, which we refer to asimplicit updates, based on which we obtain: (a) an algorithm for theon-lineconstruction of the Lsuffix tree of ann×nmatrixA—this data structure is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations forLZ1-typeon-line losslessimage compression m…
Parametric estimation of non-crossing quantile functions
2021
Quantile regression (QR) has gained popularity during the last decades, and is now considered a standard method by applied statisticians and practitioners in various fields. In this work, we applied QR to investigate climate change by analysing historical temperatures in the Arctic Circle. This approach proved very flexible and allowed to investigate the tails of the distribution, that correspond to extreme events. The presence of quantile crossing, however, prevented using the fitted model for prediction and extrapolation. In search of a possible solution, we first considered a different version of QR, in which the QR coefficients were described by parametric functions. This alleviated th…