Search results for "QUANTIFICATION"
showing 10 items of 157 documents
Apprehending ganglioside diversity: a comprehensive methodological approach
2015
Gangliosides make a wide family of glycosphingolipids ubiquitously expressed in mammalian tissues and particularly abundant in the brain and nervous system. They exhibit a huge diversity due to structural variations in both their oligosaccharidic chain and ceramide moiety, which represent a real analytical challenge. Since their discovery in the 1940s, methods have persistently improved until the emergence of Liquid Chromatography/Mass Spectrometry (LC/MS) which offers a high level of specificity and sensitivity and is suitable with high-throughput profiling studies. We describe here a comprehensive approach relying on various techniques and aiming at fully characterizing gangliosides in bi…
Frames for fusions of modal logics
2018
Let us consider multimodal logics and . We assume that is characterised by a class of connected frames, and there exists an -frame with a so-called -starting point. Similarly, the logic is characterised by a class of connected frames, and there exists an -frame with a -starting point. Using isomorphic copies of the frames and , we construct a connected frame which characterises the fusion . The frame thus obtained has some useful properties. Among others, is countable if both and are countable, and there is a special world of the frame such that any formula is valid in the frame if and only if it is valid at the point . We also describe a similar construction where we assume the existence o…
Correspondences Between 2-Brauer Characters of Solvable Groups
2010
Let G be a finite solvable group and let p be a prime. Let P ∈ Syl p (G) and N = N G (P). We prove that there exists a natural bijection between the 2-Brauer irreducible characters of p′-degree of G and those of N G (P).
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
2007
For any AND-OR formula of size N, there exists a bounded-error N1/2+o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximately balanced," formulas can be evaluated in O(radicN) queries, which is optimal. It follows that the (2-o(1))th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy.
A NOTE ON THE ASYMPTOTIC PROBABILITIES OF EXISTENTIAL SECOND-ORDER MINIMAL GÖDEL SENTENCES WITH EQUALITY
1995
The minimal Gödel class is the class of first-order prenex sentences whose quantifier prefix consists of two universal quantifiers followed by just one existential quantifier. We prove that asymptotic probabilities of existential second-order sentences, whose first-order part is in the minimal Gödel class, form a dense subset of the unit interval.
On languages factorizing the free monoid
1996
A language X⊂A* is called factorizing if there exists a language Y⊂A* such that XY = A* This work was partially supported by ESPRIT-EBRA project ASMICS contact 6317 and project 40% MURST “Algoritmi, Modelli di Calcolo e Strutture Informative”. and the product is unambiguous. First we give a combinatorial characterization of factorizing languages. Further we prove that it is decidable whether a regular language X is factorizing and we construct an automaton recognizing the corresponding language Y. For finite languages we show that it suffices to consider words of bounded length. A complete characterization of factorizing languages with three words and explicit regular expression for the co…
On finding common neighborhoods in massive graphs
2003
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We prove lower bounds on the resources needed to solve this problem on resource-bounded models of computation. In streaming models, in which algorithms can access the input only a constant number of times and only sequentially, we show that, even with randomization, any algorithm that determines if there exists any pair of vertices with a large common neighborhood must essentially store and process the input graph off line. In sampling models, in which algorithms can only query an oracle for the common neighborhoods of specified vertex pairs, we show that any algorithm must …
A motion planning algorithm for the invalid initial state disassembly problem
2015
Sampling-based motion planners are able to plan disassembly paths at high performance. They are limited by the fact that the input triangle sets of the static and dynamic object need to be free of collision in the initial and all following states. In real world applications, like the disassembly planning in car industry, this often does not hold true. Beside data inaccuracy, this is mainly caused by the modeling of flexible parts as rigid bodies, especially fixture elements like clips. They cause the invalid initial state disassembly problem. In the literature there exists no algorithm that is able to calculate a reasonable disassembly path for an invalid initial state. Our novel algorithm …
Quantification and automatized adaptive detection of in vivo and in vitro neuronal bursts based on signal complexity.
2015
In this paper, we propose employing entropy values to quantify action potential bursts in electrophysiological measurements from the brain and neuronal cultures. Conventionally in the electrophysiological signal analysis, bursts are quantified by means of conventional measures such as their durations, and number of spikes in bursts. Here our main aim is to device metrics for burst quantification to provide for enhanced burst characterization. Entropy is a widely employed measure to quantify regularity/complexity of time series. Specifically, we investigate the applicability and differences of spectral entropy and sample entropy in the quantification of bursts in in vivo rat hippocampal meas…
Gaussian Process Regression (GPR) Representation in Predictive Model Markup Language (PMML)
2017
International audience; This paper describes Gaussian process regression (GPR) models presented in predictive model markup language (PMML). PMML is an extensible-markup-language (XML) -based standard language used to represent data-mining and predictive analytic models, as well as pre- and post-processed data. The previous PMML version, PMML 4.2, did not provide capabilities for representing probabilistic (stochastic) machine-learning algorithms that are widely used for constructing predictive models taking the associated uncertainties into consideration. The newly released PMML version 4.3, which includes the GPR model, provides new features: confidence bounds and distribution for the pred…