نتایج جستجو برای: sings and symbols

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

Journal: :The EMBO journal 2014
Marco J Herold Andreas Strasser

The death receptors FAS, TRAIL-Rs and TNFR1 play critical roles in programmed cell death, particularly in the immune system. Upon ligation of death receptors, caspase-8 is activated within the so-called ‘Death Induced Signalling Complex’ (DISC) but the mechanisms that mediate and modulate the activation of caspase-8 are still not fully understood. This is an important issue because caspase-8 is...

Journal: :international journal of human capital in urban management 0
m. khakzand school of architecture and environmental design, iran university of science and technology, tehran, iran s. babaei school of architecture and urbanism, islamic azad university, qazvin branch, qazvin, iran

this paper explores the developing of how designers can search for inspiration source which provided in the form of traditional elements and archetypes and also their role on idea generation in design from building to urban measure. in order to clarify of this, current study focuses on the far-east region as an ancient part of the world in which there is a huge number of symbols like well known...

1996
Xuanyin Xia Dekai Wu

We describe a novel parsing strategy we are employing for Chinese. We believe progress in Chinese parsing technology has been slowed by the excessive ambiguity that typically arises in pure context-free grammars. This problem has inspired a modified formalism that enhances our ability to write and maintain robust large grammars, by constraining productions with left/right contexts and/or nonter...

2013
Yiting Deng Jerome P. Reiter Siyu Zheng

Panel studies typically suffer from attrition, which reduces sample size and can result in biased inferences. It is impossible to know whether or not the attrition causes bias from the observed panel data alone. Refreshment samples—new, randomly sampled respondents given the questionnaire at the same time as a subsequent wave of the panel—offer information that can be used to diagnose and adjus...

2009
Marco Kuhlmann Giorgio Satta

An open problem in dependency parsing is the accurate and efficient treatment of non-projective structures. We propose to attack this problem using chart-parsing algorithms developed for mildly contextsensitive grammar formalisms. In this paper, we provide two key tools for this approach. First, we show how to reduce nonprojective dependency parsing to parsing with Linear Context-Free Rewriting...

2016
Cecilia Odé

A manual transcription system using unambiguous symbols that express experimentally verified forms and contextual functions of Russian intonation is under development: ToRI (Transcription of Russian Intonation). ToRI, inspired by ToDI [1], will be implemented on the Internet as an interactive research tool and learning module. For theoretical and language-specific reasons ToRI will differ consi...

2012
Francisco Claude Gonzalo Navarro

We introduce the first grammar-compressed representation of a sequence that supports searches in time that depends only logarithmically on the size of the grammar. Given a text T [1..u] that is represented by a (context-free) grammar of n (terminal and nonterminal) symbols and size N (measured as the sum of the lengths of the right hands of the rules), a basic grammar-based representation of T ...

2009
Tinne Smets Mette L. Rurup Luc Deliens

Objectives: To study the reported medical practice of euthanasia in Belgium since implementation of the euthanasia law. Research Design: Analysis of the anonymous database of all euthanasia cases reported to the Federal Control and Evaluation Committee Euthanasia. Subjects: All euthanasia cases reported by physicians for review between implementation of the euthanasia law on September 22nd, 200...

2010
Zsolt Gazdag

In this work two special types of random context grammars are investigated. In one of these grammars one can apply a context-free rule to a nonterminal A only if the current sentential form does not contain a particular nonterminal associated toA. The other grammar works in the opposite direction, it requires the presence of the associated nonterminal to apply the rule. Here we show that these ...

2001
Kouichi Hirata Hiroshi Sakamoto

This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular pattern languages. For the former, we mainly show that DNF formulas are pwm-reducible to CFGs that is sequential or that contains at most one nonterminal. For the latter, we show that both bounded finite unions of regu...

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

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