نتایج جستجو برای: called elision and conciseness

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شاهد - دانشکده فنی و مهندسی 1387

abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...

2017
Melisachew Wudage Chekol Valeria Fionda Giuseppe Pirrò

We research the problem of querying RDF archives. In this setting novel data management challenges emerge in terms of support for time-traversing structured queries. We formalize an extension of SPARQL, called SPARQ–LTL, which incorporates primitives inspired by linear temporal logic. We give formal semantics for SPARQ–LTL and devise query rewriting strategies from SPARQ– LTL into SPARQL. The u...

Journal: :Library Trends 2002
Hildrun Kretschmer

BASEDO N GESTALTHEORY, the author assumes the existence of afieldforce equilibrium to explain how, according to the conciseness principle, mathematically precise gestalts could exist in coauthorship networks. A simple mathematical function is developed for the description of these gestalts which can encompass complementary tendencies (as in the principle ofYin and Yang) in their dynamic interpl...

2007
Zoë Abrams Arpita Ghosh Erik Vee

We study keyword auctions in a model where each advertiser has a value for every slot, which is not necessarily proportional to the number of clicks the advertiser expects to receive in that slot. In our model, advertisers need not only derive values from clicks on their ad, nor do they need to value clicks in all slots equally. This model encompasses a variety of advertising objectives, includ...

Journal: :Journal of Automata, Languages and Combinatorics 2005
Patricia Bouyer Fabrice Chevalier

In this paper we study conciseness of various extensions of timed automata, and prove that several features like diagonal constraints or updates lead to exponentially more concise timed models.

2001
Cécile Fougeron Jean-Philippe Goldman Ulrich H. Frauenfelder

This study aims to determine whether the production of the lexical variants created by the phonological processes of liaison and schwa deletion in French are conditioned by factors linked to lexical recognition. We hypothesise that the realisation of these variants would be favoured for words which are lexically “salient” in term of frequency and in their lexical neighbourhoods. This claim was ...

2007
Audrey Bürki Cécile Fougeron Cédric Gendrot

This paper examines the nature of the process involved in optional schwa elision in French. More specifically, it aims at testing whether this process is gradual or categorical, on the basis of an analysis of the distribution of the duration of over 4000 schwas extracted from a large corpus of continuous speech. The distribution observed is bimodal, with absent schwas (at 0 ms duration) on one ...

Journal: :Confluência 2021

This brief study, developed in the field of sandhi description, intends to evaluate elision French unstressed pronouns me, te and se after verbal imperatives. It is based necessary consideration syntactic chain words accentuation sentence.

2012
Maarten de Mol Arend Rensink James J. Hunt

This paper introduces an approach for adding graph transformationbased functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class declarations. Other ingredients are a custom transformation language, called CHART, and a compiler from CHART...

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

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