نتایج جستجو برای: tree shaped pathways

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

1999
Regis B. Miller

References 2–4 he fibrous nature of wood strongly influences how it is used. Wood is primarily composed of hollow, elongate, spindle-shaped cells that are arranged parallel to each other along the trunk of a tree. When lumber and other products are cut from the tree, the characteristics of these fibrous cells and their arrangement affect such properties as strength and shrinkage as well as the ...

Journal: :Appl. Math. Lett. 2001
Mike A. Steel Jotun Hein

Stochastic models that allow site substitutions, insertions and deletions provide a useful framework for a statistical approach to DNA sequence evolution. Such a model, and recursions to calculate the probability of evolving two sequences, have been known for almost a decade. In this paper we show how the pairwise recursions can be generalised to a 3-sequence tree, and more generally to a r-seq...

2014

Heteromeles arbutifolia (from yellow fruit), "TOYON" Versatile, Calif. native, water-efficient small tree/large shrub w/ toothed, glossy green leaves, large clusters of white flowers in summer, showy red berries in winter; some may produce yellow berries. [9] (H*B*W*C*) Homalanthus populifolius, "QUEENSLAND POPLAR" Small, Aust. rainforest tree that is surprisingly hardy; fast-growing w/ handsom...

1997
Justinian P. Rosca

One serious problem of standard Genetic Programming (GP) is that evolved structures appear to drift towards large and slow forms on average. This paper presents a novel analysis of the role played by variable complexity in the selection and survival of GP expressions. It deenes a particular property of GP representations, called rooted tree-schema, that sheds light on the role of variable compl...

2010
Wuu Yang

The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be considered as a generalization of string parsing. We propose a new generalized LR (GLR) parser, which extends the LR parser stack with a parser cactus. GLR explores all plausible parsing steps to find the least-cost matching. GL...

Journal: :iranian journal of basic medical sciences 0
song liu department of respiratory medicine, xinhua hospital affiliated to shanghai jiao tong university school of medicine, shanghai, china, 200092 zhonghua wang department of medical oncology, fudan university shanghai cancer center; department of oncology, shanghai medical college, fudan university, shanghai, china, 200032 kui chen department of neurology, beijing friendship hospital, capital medical university, beijing, china, 100050 kui chen department of neurology, beijing friendship hospital, capital medical university, beijing, china, 100050 jinyuan sun department of respiratory medicine, xinhua hospital affiliated to shanghai jiao tong university school of medicine, shanghai, china, 200092 lianping ren department of respiratory medicine, xinhua hospital affiliated to shanghai jiao tong university school of medicine, shanghai, china, 200092

objective(s):intermittent hypoxia (ih), caused by obstructive sleep apnea (osa), could cause hippocampus or neuron damage through multiple signaling pathways, while the underlying mechanisms are still unclear. thus, the present study aimed to explore the effect of ih on the biological functions of microglia cells. materials and methods:cell proliferation of bv2 cells after exposure to ih were o...

Journal: :CoRR 2014
Stanislav Kikot Roman Kontchakov Vladimir V. Podolskii Michael Zakharyaschev

We investigate the size of first-order rewritings of conjunctive queries over OWL 2 QL ontologies of depth 1 and 2 by means of hypergraph programs computing Boolean functions. Both positive and negative results are obtained. Conjunctive queries over ontologies of depth 1 have polynomial-size nonrecursive datalog rewritings; tree-shaped queries have polynomial positive existential rewritings; ho...

Journal: :CoRR 2016
Mark Reynolds

Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. We present a n...

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

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