Search results for "Stent"

Towards a conceptual representation of actions

2000

An autonomous robot involved in missions should be able to generate, update and process its own actions. It is not plausible that the meaning of the actionsus ed by the robot isgiv en form the outside of the system itself. Rather, this meaning should be anchored to the world through the perceptual abilitiesof the robot. We present an approach to conceptual action representation based on a "conceptual" level that actsasan intermediate level between symbolsand data coming form sensors. Symbolic representations are interpreted by mapping them on the conceptual level through a mapping mechanism based on artificial neural networks.

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 …

On the Efficiency of Affine Invariant Multivariate Rank Tests

1998

AbstractIn this paper the asymptotic Pitman efficiencies of the affine invariant multivariate analogues of the rank tests based on the generalized median of Oja are considered. Formulae for asymptotic relative efficiencies are found and, under multivariate normal and multivariatetdistributions, relative efficiencies with respect to Hotelling'sT2test are calculated.

Animals in translation: why there is meaning (but probably no message) in animal communication

2010

Nota minima sul comodato c.d. ad pompam vel ostentationem

2016

On the basis of the exegesis of certain texts in the Justinian’s Digest, namely 13.6.3.6 (Ulp. 28 ad ed.), 12.1.18.1 (Ulp. 7 disp.), 13.6.4 (Gai. 1 de verb. obl.), 46.3.67 (Marc. 13 dig.), the Author formulates some considerations on the commodatum so-called ad pompam vel ostentationem, pointing out that the applications related to that anomalous commodatum were more complex and not merely confined to the idea of exhibiting id quod usu non consumitur for ‘pomp’, id est (by doing) ‘ostentation’. The basic idea of the Author is that Ulpian has specifically designated two terms, ‘pompa vel ostentatio’, to refer to two different (but not opposing) application spheres, in an attempt to synthesis…

Optimal rates of convergence for persistence diagrams in Topological Data Analysis

2013

Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a statistical approach. We show that the use of persistent homology can be naturally considered in general statistical frameworks and persistence diagrams can be used as statistics with interesting convergence properties. Some numerical experiments are performed in various contexts to illustrate our results.