نتایج جستجو برای: limited context

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

Vijaya Rekha Rekha

In this paper, we have proposed a study on controllability and optimal harvestingof a prey predator model and mathematical non linear formation of the equation equilibriumpoint of Routh harvest stability analysis. The problem of determining the optimal harvestpolicy is solved by invoking Pontryagin0s maximum principle dynamic optimization of theharvest policy is studied by taking the combined h...

1984
Tetsunosuke Fujisaki

A description will be given of a procedure to asslgn the most likely probabilitles to each of the rules of a given context-free grammar. The grammar developed by S. Kuno at Harvard University was picked as the basis and was successfully augmented with rule probabilities. A brief exposition of the method with some preliminary results, whenused as a device for disamblguatingparsing English texts ...

Journal: :Wireless Sensor Network 2010
Barbara T. Korel Simon G. M. Koo

Context awareness in Body Sensor Networks (BSNs) has the significance of associating physiological user activity and the environment to the sensed signals of the user. The context information derived from a BSN can be used in pervasive healthcare monitoring for relating importance to events and specifically for accurate episode detection. In this paper, we address the issue of context-aware sen...

1996
Géraud Sénizergues

Let ? be some context-free graph. We give suucient conditions on a semi-group of bisimulations H ensuring that the quotient Hn? is context-free. Using these suucient conditions we show that the quotient Aut(?)n? of ? by its full group of automorphisms is always context-free. We then give examples showing optimality (in some sense) of the above result.

2002
Dexter Kozen

If A is a context-free language over a two-letter alphabet, then the set of all words obtained by sorting words in A and the set of all permutations of words in A are context-free. This is false over alphabets of three or more letters. Thus these problems illustrate a difference in behavior between twoand three-letter alphabets. The following problem appeared on a recent exam at Cornell: Let be...

Journal: :international journal of health policy and management 2014
joseph r. betancourt aswita tan-mcgrory

the article by cheri wilson, “patient safety and healthcare quality: the case for language access”, highlights 
the challenges of providing culturally and linguistically appropriate services (clas) to patients with 
limited english proficiency (lep). as the us pursues high-value, high-performance healthcare, our ability 
to meet the needs of our most vulnerable will determine whether we succeed...

Journal: :journal of sciences, islamic republic of iran 2013
m. banijamali s. hosseinkhani j. fuladi

pyruvate kinase is a key enzyme in glycolytic pathway that catalyzes the transphosphorylation between phosphoenolpyruvate and adp to yield atp and pyruvate. geobacillus stearothermophillus has a stable pyruvate kinase with determined crystal structure that composed of four separate domains. given that limited proteolysis experiments can be successfully used to probe conformational features of p...

2010
Michael Nebeling Michael Grossniklaus Stefania Leone Moira C. Norrie

Context-awareness is a requirement in many modern web applications. \Vhile most model-driven web engineering approaches have been extended vvith support for adaptivity, state-of-the-art dew lopment platforms generally provide only limited means for the specification of adaptation and often completely lack a notion of context. \Ve propose a domain-specific language for context-aware web applicat...

2001
Karin Müller

We investigated the applicability of probabilistic context-free grammars to syllabi cation and grapheme-to-phoneme conversion. The results show that the standard probability model of context-free grammars performs very well in predicting syllable boundaries. However, our results indicate that the standard probability model does not solve grapheme-to-phoneme conversion su ciently although, we va...

2004
Gabriel G. Infante López Maarten de Rijke

We present a measure for evaluating Probabilistic Context Free Grammars (PCFG) based on their ambiguity resolution capabilities. Probabilities in a PCFG can be seen as a filtering mechanism: For an ambiguous sentence, the trees bearing maximum probability are single out, while all others are discarded. The level of ambiguity is related to the size of the singled out set of trees. Under our meas...

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

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