Search results for "Crete"
showing 10 items of 2495 documents
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.
A Mechanical Approach for Evaluating the Distribution of Confinement Pressure in FRP-Wrapped Rectangular Columns
2019
In recent decades, fiber reinforced polymer (FRP) wrapping has become a common technique to retrofit reinforced concrete (RC) columns. Numerous research works have sought to verify analytically and experimentally its effectiveness in terms of enhancement of axial load bearing capacity and ductility. These studies highlighted that in the case of sharp-cornered sections, the maximum allowable confinement pressure is limited by premature failure at corners and, consequently, stress in the FRP, as well as the distribution of the confinement pressure, is not uniform. The prediction of this phenomenon is not straightforward, and existing theoretical studies propose complex numerical simulations, …
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…
A time-varying observer for linear systems with asynchronous discrete-time measurements
2017
International audience; In this paper we propose a time-varying observer for a linear continuous-time plant with asynchronous discrete-time measurements. The proposed 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. Moreover the case of asynchronous measurements is considered, i.e. when the measurements are not provided in well defined time instants, but they occur at an arbitrary time in a certain time interval. A design procedure based on the numerical solution of …
On the minimal number of singular fibers with non-compact Jacobians for families of curves over P1
2016
Abstract Let f : X → P 1 be a non-isotrivial family of semi-stable curves of genus g ≥ 1 defined over an algebraically closed field k. Denote by s nc the number of the singular fibers whose Jacobians are non-compact. We prove that s nc ≥ 5 if k = C and g ≥ 5 ; we also prove that s nc ≥ 4 if char ( k ) > 0 and the relative Jacobian of f is non-smooth.
Measuring spectrally-resolved information transfer.
2020
Information transfer, measured by transfer entropy, is a key component of distributed computation. It is therefore important to understand the pattern of information transfer in order to unravel the distributed computational algorithms of a system. Since in many natural systems distributed computation is thought to rely on rhythmic processes a frequency resolved measure of information transfer is highly desirable. Here, we present a novel algorithm, and its efficient implementation, to identify separately frequencies sending and receiving information in a network. Our approach relies on the invertible maximum overlap discrete wavelet transform (MODWT) for the creation of surrogate data in t…
Identifying Prognostic SNPs in Clinical Cohorts: Complementing Univariate Analyses by Resampling and Multivariable Modeling
2016
Clinical cohorts with time-to-event endpoints are increasingly characterized by measurements of a number of single nucleotide polymorphisms that is by a magnitude larger than the number of measurements typically considered at the gene level. At the same time, the size of clinical cohorts often is still limited, calling for novel analysis strategies for identifying potentially prognostic SNPs that can help to better characterize disease processes. We propose such a strategy, drawing on univariate testing ideas from epidemiological case-controls studies on the one hand, and multivariable regression techniques as developed for gene expression data on the other hand. In particular, we focus on …