نتایج جستجو برای: faithfulness farrah

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

Journal: :Physical review 2021

A conceptually simple and experimentally prevalent class of entanglement witnesses, known as fidelity detects via a state's with pure reference state. While existence proofs guarantee that suitable witness can be constructed for every entangled state, such assurances do not apply to witnesses. Recent results have found states cannot detected by witness, unfaithful states, are exceedingly common...

1998
Daniel Albro

This paper proposes an expansion of set of primitive constraints available within the Primitive Optimality Theory framework (Eisner, 1997a). This expansion consists of the addition of a new family of constraints—existential implicational constraints, which allow the specification of faithfulness constraints that can be satisfied at a distance—and the definition of two ways to combine simple con...

2003
Lutz Straßburger

System NEL is a conservative extension of multiplicative exponential linear logic (MELL) by a self-dual non-commutative connective called seq which lives between the par and the times. In this paper, I will show that system NEL is undecidable by encoding two counter machines into NEL. Although the encoding is quite simple, the proof of the faithfulness is a little intricate because there is no ...

Journal: :Electr. Notes Theor. Comput. Sci. 2003
Lutz Straßburger

System NEL is a conservative extension of multiplicative exponential linear logic (extended by the rules mix and nullary mix) by a self-dual noncommutative connective called seq which has an intermediate position between the connectives par and times. In this paper, I will show that system NEL is undecidable by encoding two counter machines into NEL. Although the encoding is simple, the proof o...

2010
A. Capozzoli C. Curcio G. D’Elia A. Di Vico A. Liseno P. Vinetti

We present an algorithm for the fast tomography of vegetation, based on a Radon mathematical setting and on the combined use of advanced processing algorithms (NonUniform FFTs) and hardware resources (Graphic Processing Units GPUs). The algorithm performance is firstly numerically estimated, showing the favorable trade off between faithfulness and speed, and highlighting the convenience of the ...

2007
Jacques Durand Julien Eychenne

Virtually all the literature on French Schwa assumes that schwa deletion and epenthesis are categorical phenomena. This paper is an attempt to challenge this traditional view. After reviewing the evidence in favour of the non-categorical nature of (word-final) schwa, we propose a novel account framed within representational Optimality Theory (OT). It is argued that non-categorical schwa emerges...

2008
Jiwon Yun Natasha Abner

In the above examples, only nominal inflection shows opacity (i.e. it resists general phonological processes (2) or allows additional phonological contrasts (4)). Thus previous approaches commonly assume that nouns have a special status in phonology and propose constraints that are only effective for evaluation of nouns so as to explain opacity in nominal inflection. Such constraints include No...

2003
Luca Vigan

We present a theoretical and practical approach to the modular natural deduction presentation of modal logics and their implementation in a logical framework. Our work treats a large and well-known class of modal logics (including K, D, T , B, S4, S4:2, KD45, S5) in a uniform way with respect to soundness and completeness for semantics, and faithfulness and adequacy of the implementation. Moreo...

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

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