نتایج جستجو برای: probabilistic quasi uniformity

تعداد نتایج: 165409  

2009
Dipanjan Das Noah A. Smith

We present a novel approach to deciding whether two sentences hold a paraphrase relationship. We employ a generative model that generates a paraphrase of a given sentence, and we use probabilistic inference to reason about whether two sentences share the paraphrase relationship. The model cleanly incorporates both syntax and lexical semantics using quasi-synchronous dependency grammars (Smith a...

2003
DANIEL LENZ

We review recent results which relate spectral theory of discrete one-dimensional Schrödinger operators over strictly ergodic systems to uniform existence of the Lyapunov exponent. In combination with suitable ergodic theorems this allows one to establish Cantor spectrum of Lebesgue measure zero for a large class of quasicrystal Schrödinger operators. The results can also be used to study non-u...

2005
Jürgen Bierbrauer

(t,m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use in numerical integration. They can be equivalently described in terms of ordered orthogonal arrays, a class of finite geometrical structures generalizing orthogonal arrays. This establishes a link between quasi-Monte Carlo methods and coding theory. In the present paper we prove an asymptotic Gil...

Journal: :iranian journal of fuzzy systems 2012
eun-seok kim seung-ho ahn dae heui park

in this paper, we investigate the l-fuzzy proximities and the relationships betweenl-fuzzy topologies, l-fuzzy topogenous order and l-fuzzy uniformity. first, we show that the category of-fuzzy topological spaces can be embedded in the category of l-fuzzy quasi-proximity spaces as a coreective full subcategory. second, we show that the category of l -fuzzy proximity spaces is isomorphic to the ...

2001
Michael S. Branicky Steven M. LaValle Kari Olson Libo Yang

We propose the use of quasi-random sampling techniques for path planning in high-dimensional conng-uration spaces. Following similar trends from related numerical computation elds, we show several advantages ooered by these techniques in comparison to random sampling. Our ideas are evaluated in the context of the probabilistic roadmap (PRM) framework. Two quasi-random variants of PRM-based plan...

1999
L. SCHUEREMANS

In historical buildings, the load bearing capacity is often doubtful due to deterioration processes or external actions. To decide whether or not these structural elements need to be strengthened, a probabilistic method is searched for. Indeed, as none of the parameters is known exactly material characteristics, imposed loads due to the new or altered destination of the building, uniformity of ...

2014
Christoph Beierle Markus Höhnerbach Marcus Marto

In a relational setting, the maximum entropy model of a set of probabilistic conditionals can be defined referring to the full set of ground instances of the conditionals. The logic FO-PCL uses the notion of parametric uniformity to ensure that the full grounding of the conditionals can be avoided, thereby greatly simplifying the maximum entropy model computation. In this paper, we describe a s...

2017
Junji Li Na Lu Xulian Shi Yi Qiao Liang Chen Mengqin Duan Yong Hou Qinyu Ge Yuhan Tao Jing Tu Zuhong Lu

Whole genome amplification (WGA) plays an important role in sample preparation of low-input templates for high-throughput sequencing. Multiple displacement amplification (MDA), a popular isothermal WGA methods, suffers a major hurdle of highly uneven amplification. Optimizations have been made in the past by separating the reagents into numbers of tiny chambers or droplets in microfluidic devic...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید