Search results for "Discrete"
showing 10 items of 2205 documents
Variational Approximations for Generalized Linear Latent Variable Models
2017
Generalized linear latent variable models (GLLVMs) are a powerful class of models for understanding the relationships among multiple, correlated responses. Estimation, however, presents a major challenge, as the marginal likelihood does not possess a closed form for nonnormal responses. We propose a variational approximation (VA) method for estimating GLLVMs. For the common cases of binary, ordinal, and overdispersed count data, we derive fully closed-form approximations to the marginal log-likelihood function in each case. Compared to other methods such as the expectation-maximization algorithm, estimation using VA is fast and straightforward to implement. Predictions of the latent variabl…
A segmentation algorithm for noisy images
2005
International audience; This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a partition of a weighted image neighborhood hypergraph. To overcome the computational difficulty of directly solving this problem, a multilevel hypergraph partitioning has been used. To evaluate the algorithm, we have studied how noise affects the performance of the algorithm. The alpha-stable noise is considered and its effects on the algorithm are studied. Key words : graph, hypergraph, neighborhood hypergraph, multilevel hypergraph partitioning, image segmentation and noise removal.
Event-triggered robust adaptive control for discrete time uncertain systems with unmodelled dynamics and disturbances
2019
In practice, modelling errors caused by high-order unmodelled dynamics and external disturbances are unavoidable. How to ensure the robustness of an adaptive controller with respect to such modelling errors is always a critical concern. In this study, the authors consider the design of event-triggered robust adaptive control for a class of discrete-time uncertain systems which involve such modelling errors and also are allowed to be non-minimum phase. Unlike some existing event-triggered control schemes, the developed controllers do not require that the measurement errors meet the corresponding input-to-state stable condition. Global stability of the closed-loop system which means that all …
Robustness with Respect to Delay Uncertainties of a Predictor-Observer Based Discrete-Time Controller
2006
This paper focuses on the delay-dependent stability problem of a discrete-time prediction scheme to stabilize possible unstable continuous-time systems. The delay-dependent stability condition is expressed in terms of LMIs. The separation principle between the proposed predictor and a state observer is also proved. The closed-loop system is shown to be robust with respect to uncertainties in the knowledge on the plant parameters, the delay and the sampling period. The proposed scheme has been tested in a real-time application to control the roll angle in a prototype of a quad-rotor mini-helicopter.
Time-varying Sampled-data Observer with Asynchronous Measurements
2019
International audience; In this paper a time-varying observer for a linear continuous-time plant with asynchronous sampled measurements is proposed. The observer is contextualized in the hybrid systems framework providing an elegant setting for the proposed solution. In particular some theoretical tools are provided, in terms of LMIs, certifying asymptotic stability of a certain compact set where the estimation error is zero. We consider sampled asynchronous measurements that occur at arbitrary times in a certain window with an upper and lower bound. The design procedure, that we propose for the selection of the time-varying gain, is based on a constructive algorithm that is guaranteed to f…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
Automatic Location of Sources of Electrical Activation from Electroanatomical Maps
2016
Electro-anatomical mapping is a widely used technique used by electrophysiologists to understand patient's activation pattern. The system measures activation time at different locations but does not provide information on underlying electrical pathways or triggering points, such as Purkinje-myocardial junctions or ectopic foci. We present a method to estimate the locations of Purkinje-myocardial junctions from a discrete set of endocardial samples. Using less than 1000 endocardial samples it can recover locations and activation times of the most influencing Purkinje myocardial junctions from Purkinje trees of up to 500 junctions. A simulation study revealed that using the estimated Purkinje…
Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness
2018
We define a graph rewriting system that is easily understandable by humans, but rich enough to allow very general queries to molecule databases. It is based on the substitution of a single node in a node- and edge-labeled graph by an arbitrary graph, explicitly assigning new endpoints to the edges incident to the replaced node. For these graph rewriting systems, we are interested in the subgraph-matching problem. We show that the problem is NP-complete, even on graphs that are stars. As a positive result, we give an algorithm which is polynomial if both rules and query graph have bounded degree and bounded cut size. We demonstrate that molecular graphs of practically relevant molecules in d…