Search results for "Polygon"
showing 10 items of 282 documents
Operational Quantification of Continuous-Variable Correlations
2007
We quantify correlations (quantum and/or classical) between two continuous variable modes in terms of how many correlated bits can be extracted by measuring the sign of two local quadratures. On Gaussian states, such `bit quadrature correlations' majorize entanglement, reducing to an entanglement monotone for pure states. For non-Gaussian states, such as photonic Bell states, ideal and real de-Gaussified photon-subtracted states, and mixtures of pure Gaussian states, the bit correlations are shown to be a {\em monotonic} function of the negativity. This yields a feasible, operational way to quantitatively measure non-Gaussian entanglement in current experiments by means of direct homodyne d…
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
Exacus: Efficient and Exact Algorithms for Curves and Surfaces
2005
We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.
Classification of European bog vegetation of the Oxycocco-Sphagnetea class
2022
Aims: Classification of European bog vegetation (Oxycocco-Sphagnetea class); identification of diagnostic species for the class and vegetation subgroups (orders and alliances); development of an expert system for automatic classification of vegetation plots; and production of distribution maps of the Oxycocco-Sphagnetea class and its alliances. Location: Europe. Methods: A data set of vegetation-plot records was compiled to include various bog types over most of the European continent. An unsupervised classification (beta-flexible linkage method, Sørensen distance measure) and detrended correspondence analysis (DCA) ordination were applied. Formal definitions of syntaxa based on species pre…
Monogamy Inequality for Distributed Gaussian Entanglement
2007
We show that for all n-mode Gaussian states of continuous variable systems, the entanglement shared among n parties exhibits the fundamental monogamy property. The monogamy inequality is proven by introducing the Gaussian tangle, an entanglement monotone under Gaussian local operations and classical communication, which is defined in terms of the squared negativity in complete analogy with the case of n-qubit systems. Our results elucidate the structure of quantum correlations in many-body harmonic lattice systems.
Further monotonicity and convexity properties of the zeros of cylinder functions
1992
AbstractLet cvk be the kth positive zero of the cylinder function Cv(x,α)=Jv(x) cos α−Yv sin α, 0⩽α<π, where Jv(x) and Yv(x) are the Bessel functions of the first and the second kind, respectively. We prove that the function v(d2cvkddv2+δ)cvk increases with v⩾0 for suitable values of δ and k−απ⩾ 0.7070… . From this result under the same conditions we deduce, among other things, that cvk+12δv2 is convex as a function of v⩾0. Moreover, we show some monotonicity properties of the function c2vkv. Our results improve known results.
Cytotoxicity and modes of action of 4'-hydroxy-2',6'-dimethoxychalcone and other flavonoids toward drug-sensitive and multidrug-resistant cancer cell…
2014
Abstract Introduction Resistance of cancer to chemotherapy is a main cause in treatment failure. Naturally occurring chalcones possess a wide range of biological activities including anti-cancer effects. In this work, we evaluated the antiproliferative activity of three chalcones [4′-hydroxy-2′,6′-dimethoxychalcone ( 1 ), cardamomin ( 2 ), 2′,4′-dihydroxy-3′,6′-dimethoxychalcone ( 3 )], and four flavanones [( S )-(–)-pinostrobin ( 4 ), ( S )-(–)-onysilin ( 5 ) and alpinetin ( 6 )] toward nine cancer cell lines amongst which were multidrug resistant (MDR) types. Methods The resazurin reduction assay was used to detect the antiproliferative activity of the studied samples whilst flow cytometr…
Biosystematic studies on the genus Polygonatum (Convallariaceae) IV. Molecular phylogenetic analysis based on restriction site mapping of the chlorop…
1997
Phylogenetic relationships of 14 species and one variety of the genus Polygonatum as well as three species of the genus Disporopsis and Heteropolygonatum roseolum were analyzed based on mapped restriction site variation in a PCR-amplified chloroplast genome region, trnK. In agreement with earlier taxonomic treatments it was found that Disporopsis and Heteropolygonatum should be distinguished from Polygonatum at generic level, and that P. sect. Polygonatum can be recognized as a monophyletic group. Earlier series concepts in P. sect. Polygonatum based on chromosome number and characteristics of staminal filaments are not supported by the molecular data. The molecular data suggest that satell…
Positive Versions of Polynomial Time
1998
Abstract We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems, which we denote by posP . By a well-known result of Razborov, posP is a proper subclass of the class of monotone problems in P . We exhibit complete problems for posP via weak logical reductions, as we do for other logically defined classes of problems. Our work is a continuation of research undertaken by Grigni and Sipser, and subsequently Stewart; indeed, we introduce the notion of a positive deterministic Turing machine and consequently solve a problem posed by Grigni and Sipser.
Model approximation for two-dimensional Markovian jump systems with state-delays and imperfect mode information
2014
Published version of an article in the journal: Multidimensional Systems and Signal Processing. Also available from the publisher at: http://dx.doi.org/10.1007/s11045-013-0276-x This paper is concerned with the problem of {Mathematical expression} model approximation for a class of two-dimensional (2-D) discrete-time Markovian jump linear systems with state-delays and imperfect mode information. The 2-D system is described by the well-known Fornasini-Marchesini local state-space model, and the imperfect mode information in the Markov chain simultaneously involves the exactly known, partially unknown and uncertain transition probabilities. By using the characteristics of the transition proba…