Log in

Relevant bibliographies by topics / Derivation tree

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Derivation tree'

Author: Grafiati

Published: 4 June 2021

Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Derivation tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Derivation tree"

1

KAFLE, BISHOKSAN, JOHN P. GALLAGHER, and PIERRE GANTY. "Tree dimension in verification of constrained Horn clauses." Theory and Practice of Logic Programming 18, no. 2 (2018): 224–51. http://dx.doi.org/10.1017/s1471068418000030.

Full text

Abstract:

AbstractIn this paper, we show how the notion of tree dimension can be used in the verification of constrained Horn clauses (CHCs). The dimension of a tree is a numerical measure of its branching complexity and the concept here applies to Horn clause derivation trees. Derivation trees of dimension zero correspond to derivations using linear CHCs, while trees of higher dimension arise from derivations using non-linear CHCs. We show how to instrument CHCs predicates with an extra argument for the dimension, allowing a CHC verifier to reason about bounds on the dimension of derivations. Given a set of CHCsP, we define a transformation ofPyielding adimension-boundedset of CHCsP≤k. The set of derivations forP≤kconsists of the derivations forPthat have dimension at mostk. We also show how to construct a set of clauses denotedP>kwhose derivations have dimension exceedingk. We then present algorithms using these constructions to decompose a CHC verification problem. One variation of this decomposition considers derivations of successively increasing dimension. The paper includes descriptions of implementations and experimental results.

APA, Harvard, Vancouver, ISO, and other styles

2

MATSUZAKI, KIMINORI, ZHENJIANG HU, KAZUHIKO KAKEHI, and MASATO TAKEICHI. "SYSTEMATIC DERIVATION OF TREE CONTRACTION ALGORITHMS." Parallel Processing Letters 15, no. 03 (2005): 321–36. http://dx.doi.org/10.1142/s0129626405002246.

Full text

Abstract:

While tree contraction algorithms play an important role in efficient tree computation in parallel, it is difficult to develop such algorithms due to the strict conditions imposed on contracting operators. In this paper, we propose a systematic method of deriving efficient tree contraction algorithms from recursive functions on trees. We identify a general recursive form that can be parallelized into efficient tree contraction algorithms, and present a derivation strategy for transforming general recursive functions to the parallelizable form. We illustrate our approach by deriving a novel parallel algorithm for the maximum connected-set sum problem on arbitrary trees, the tree-version of the well-known maximum segment sum problem.

APA, Harvard, Vancouver, ISO, and other styles

3

Gibbons, Jeremy. "Functional Pearls." Journal of Functional Programming 6, no. 3 (1996): 535–62. http://dx.doi.org/10.1017/s0956796800001842.

Full text

Abstract:

AbstractThetree-drawing problemis to produce a ‘tidy’ mapping from elements of a tree to points in the plane. In this paper, we derive an efficient algorithm for producing tidy drawings of trees. The specification, the starting point for the derivations, consists of a collection of intuitively appealingcriteriasatisfied by tidy drawings. The derivation shows constructively that these criteria completely determine the drawing. Indeed, the criteria completely determine a simple but inefficient algorithm for drawing a tree, which can be transformed into an efficient algorithm using just standard techniques and a small number of inventive steps.The algorithm consists of anupwards accumulationfollowed by adownwards accumulationon the tree, and is further evidence of the utility of these two higher-order tree operations.

APA, Harvard, Vancouver, ISO, and other styles

4

Forostyanova, Maria. "Test derivation based on tree FSMs and tree automata." Proceedings of the Institute for System Programming of RAS 26, no. 6 (2014): 67–76. http://dx.doi.org/10.15514/ispras-2014-26(6)-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tomuro, Noriko, and Steven L. Lytinen. "Nonminimal Derivations in Unification-based Parsing." Computational Linguistics 27, no. 2 (2001): 277–85. http://dx.doi.org/10.1162/089120101750300535.

Full text

Abstract:

Shieber's abstract parsing algorithm (Shieber 1992) for unification grammars is an extension of Earley's algorithm (Earley 1970) for context-free grammars to feature structures. In this paper, we show that, under certain conditions, Shieber's algorithm produces what we call a nonminimal derivation: a parse tree which contains additional features that are not in the licensing productions. While Shieber's definition of parse tree allows for such nonminimal derivations, we claim that they should be viewed as invalid. We describe the sources of the nonminimal derivation problem, and propose a precise definition of minimal parse tree, as well as a modification to Shieber's algorithm which ensures minimality, although at some computational cost.

APA, Harvard, Vancouver, ISO, and other styles

6

GARDENT, CLAIRE, BENJAMIN GOTTESMAN, and LAURA PEREZ-BELTRACHINI. "Using regular tree grammars to enhance sentence realisation." Natural Language Engineering 17, no. 2 (2011): 185–201. http://dx.doi.org/10.1017/s1351324911000076.

Full text

Abstract:

AbstractFeature-based regular tree grammars (FRTG) can be used to generate the derivation trees of a feature-based tree adjoining grammar (FTAG). We make use of this fact to specify and implement both an FTAG-based sentence realiser and a benchmark generator for this realiser. We argue furthermore that the FRTG encoding enables us to improve on other proposals based on a grammar of TAG derivation trees in several ways. It preserves the compositional semantics that can be encoded in feature-based TAGs; it increases efficiency and restricts overgeneration; and it provides a uniform resource for generation, benchmark construction and parsing.

APA, Harvard, Vancouver, ISO, and other styles

7

S, ASOKAN, and VANITHA MUTHU P. "Mathematical Modeling on Network Fractional Routing Through Derivation Tree." International Journal of Advanced Research in Computer Science and Software Engineering 7, no. 11 (2017): 191. http://dx.doi.org/10.23956/ijarcsse.v7i11.441.

Full text

Abstract:

Abstract:A Derivation Tree is one of the most important optimization techniques to help decision making in Network. A Derivation Tree problem calls for optimizing linear functions of variables called objective function. The objective function minimizes the total overflow from source node to sink node. We will prove fractional Routing Capacity for some solvable network using Derivation Tree.Keywords - capacity, flow, fractional routing, Derivation Tree.

APA, Harvard, Vancouver, ISO, and other styles

8

Sharma, Leena, Kent Kwoh, Jungwha (Julia) Lee, et al. "Development and validation of risk stratification trees for incident slow gait speed in persons at high risk for knee osteoarthritis." Annals of the Rheumatic Diseases 78, no. 10 (2019): 1412–19. http://dx.doi.org/10.1136/annrheumdis-2019-215353.

Full text

Abstract:

ObjectivesDisability prevention strategies are more achievable before osteoarthritis disease drives impairment. It is critical to identify high-risk groups, for strategy implementation and trial eligibility. An established measure, gait speed is associated with disability and mortality. We sought to develop and validate risk stratification trees for incident slow gait in persons at high risk for knee osteoarthritis, feasible in community and clinical settings.MethodsOsteoarthritis Initiative (derivation cohort) and Multicenter Osteoarthritis Study (validation cohort) participants at high risk for knee osteoarthritis were included. Outcome was incident slow gait over up to 10-year follow-up. Derivation cohort classification and regression tree analysis identified predictors from easily assessed variables and developed risk stratification models, then applied to the validation cohort. Logistic regression compared risk group predictive values; area under the receiver operating characteristic curves (AUCs) summarised discrimination ability.Results1870 (derivation) and 1279 (validation) persons were included. The most parsimonious tree identified three risk groups, from stratification based on age and WOMAC Function. A 7-risk-group tree also included education, strenuous sport/recreational activity, obesity and depressive symptoms; outcome occurred in 11%, varying 0%–29 % (derivation) and 2%–23 % (validation) depending on risk group. AUCs were comparable in the two cohorts (7-risk-group tree, 0.75, 95% CI 0.72 to 0.78 (derivation); 0.72, 95% CI 0.68 to 0.76 (validation)).ConclusionsIn persons at high risk for knee osteoarthritis, easily acquired data can be used to identify those at high risk of incident functional impairment. Outcome risk varied greatly depending on tree-based risk group membership. These trees can inform individual awareness of risk for impaired function and define eligibility for prevention trials.

APA, Harvard, Vancouver, ISO, and other styles

9

Gardent, Claire, and Shashi Narayan. "Multiple Adjunction in Feature-Based Tree-Adjoining Grammar." Computational Linguistics 41, no. 1 (2015): 41–70. http://dx.doi.org/10.1162/coli_a_00217.

Full text

Abstract:

In parsing with Tree Adjoining Grammar (TAG), independent derivations have been shown by Schabes and Shieber (1994) to be essential for correctly supporting syntactic analysis, semantic interpretation, and statistical language modeling. However, the parsing algorithm they propose is not directly applicable to Feature-Based TAGs (FB-TAG). We provide a recognition algorithm for FB-TAG that supports both dependent and independent derivations. The resulting algorithm combines the benefits of independent derivations with those of Feature-Based grammars. In particular, we show that it accounts for a range of interactions between dependent vs. independent derivation on the one hand, and syntactic constraints, linear ordering, and scopal vs. nonscopal semantic dependencies on the other hand.

APA, Harvard, Vancouver, ISO, and other styles

10

DASSOW, JÜRGEN, RALF STIEBE, and BIANCA TRUTHE. "GENERATIVE CAPACITY OF SUBREGULARLY TREE CONTROLLED GRAMMARS." International Journal of Foundations of Computer Science 21, no. 05 (2010): 723–40. http://dx.doi.org/10.1142/s0129054110007520.

Full text

Abstract:

Tree controlled grammars are context-free grammars where the associated language only contains those terminal words which have a derivation where the word of any level of the corresponding derivation tree belongs to a given regular language. We present some results on the power of such grammars where we restrict the regular languages to some known subclasses of the family of regular languages.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Derivation tree"

1

Jax, Tim [Verfasser]. "A Rooted-Tree Based Derivation of ROW-Type Methods with Non-Exact Jacobian Entries for Index-One DAEs / Tim Jax." Wuppertal : Universitätsbibliothek Wuppertal, 2020. http://d-nb.info/1214389651/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ošmera, Lubomír. "Skákající jazykové modely." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403132.

Full text

Abstract:

The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other properties of new models and makes comparison with existing computer science models. Then thesis demontrates practical applications, specifically amino acid and protein detections inside DNA sequence and makes comparision with existing tools in DNA computing for example Mark´s probabilistic models.

APA, Harvard, Vancouver, ISO, and other styles

3

Olsson, Per-Magnus. "Methods for Network Optimization and Parallel Derivative-free Optimization." Doctoral thesis, Linköpings universitet, Optimeringslära, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-104110.

Full text

Abstract:

This thesis is divided into two parts that each is concerned with a specific problem. The problem under consideration in the first part is to find suitable graph representations, abstractions, cost measures and algorithms for calculating placements of unmanned aerial vehicles (UAVs) such that they can keep one or several static targets under constant surveillance. Each target is kept under surveillance by a surveillance UAV, which transmits information, typically real time video, to a relay UAV. The role of the relay UAV is to retransmit the information to another relay UAV, which retransmits it again to yet another UAV. This chain of retransmission continues until the information eventually reaches an operator at a base station. When there is a single target, then all Pareto-optimal solutions, i.e. all relevant compromises between quality and the number of UAVs required, can be found using an efficient new algorithm. If there are several targets, the problem becomes a variant of the Steiner tree problem and to solve this problem we adapt an existing algorithm to find an initial tree. Once it is found, we can further improve it using a new algorithm presentedin this thesis. The second problem is optimization of time-consuming problems where the objective function is seen as a black box, where the input parameters are sent and a function valueis returned. This has the important implication that no gradient or Hessian information is available. Such problems are common when simulators are used to perform advanced calculations such as crash test simulations of cars, dynamic multibody simulations etc. It is common that a single function evaluation takes several hours. Algorithms for solving such problems can be broadly divided into direct search algorithms and model building algorithms. The first kind evaluates the objective function directly, whereas the second kind builds a model of the objective function, which is then optimized in order to find a new point where it is believed that objective function has agood value. Then the objective function is evaluated in that point. Since the objective function is very time-consuming, it is common to focus on minimizing the number of function evaluations. However, this completely disregards the possibility to perform calculations in parallel and to exploit this we investigate different ways parallelization can be used in model-building algorithms. Some of the ways to do this is to use several starting points, generate several new points in each iteration, new ways of predicting a point’s value and more. We have implemented the parallel extensions in one of the state of the art algorithms for derivative-free optimization and report results from testing on synthetic benchmarksas well as from solving real industrial problems.

APA, Harvard, Vancouver, ISO, and other styles

4

Koutný, Jiří. "Gramatiky s omezenými derivačními stromy." Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-261261.

Full text

Abstract:

V této disertační práci jsou studovány teoretické vlastnosti gramatik s omezenými derivačními stromy. Po uvedení současného stavu poznání v této oblasti je výzkum zaměřen na tři základní typy omezení derivačních stromů. Nejprve je představeno zcela nové téma, které je založeno na omezení řezů a je zkoumána vyjadřovací síla takto omezené gramatiky. Poté je zkoumáno několik nových vlastností omezení kladeného na cestu derivačních stromů. Zejména je studován vliv vymazávacích pravidel na vyjadřovací sílu gramatik s omezenou cestou a pro tyto gramatiky jsou zavedeny dvě normální formy. Následně je popsána nová souvislost mezi gramatikami s omezenou cestou a některými pseudouzly. Dále je prezentován protiargument k vyjadřovací síle tohoto modelu, která byla dosud považována za dobře známou vlastnost. Nakonec je zavedeno zobecnění modelu s omezenou cestou na ne jednu, ale několik cest. Tento model je následně studován zejména z hlediska vlastností vkládání, uzávěrových vlastností a vlastností syntaktické analýzy.

APA, Harvard, Vancouver, ISO, and other styles

5

Yuen, Fei-lung, and 袁飛龍. "Pricing options and equity-indexed annuities in regime-switching models by trinomial tree method." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45595616.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Twarog, Marek B. "Pricing security derivatives under the forward measure." Link to electronic thesis, 2007. http://www.wpi.edu/Pubs/ETD/Available/etd-053007-142223/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gandhi, Harith Suman. "Important Extrema of Time Series: Theory and Applications." [Tampa, Fla.] : University of South Florida, 2004. http://purl.fcla.edu/fcla/etd/SFE0000317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Soukup, Ondřej. "Formální modely distribuovaného výpočtu." Doctoral thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-412589.

Full text

Abstract:

Tato disertační práce představuje derivační stromy několika různých typů gramatik ve zobecněné Kurodově normální formě; jmenovitě obecné a regulárně řízené gramatiky, gramatiky s rozptýleným kontextem a spolupracující distribuované gramatické systémy. Definuje jednoduché stromové rysy založené na kontextových vlastnostech jednotlivých diskutovaných gramatik a dokazuje, že pokud existuje limitující konstanta k taková, že každá věta generovaného jazyka L odpovídá řetězci listových uzlů derivačního stromu, ve kterém je výskyt definovaných stromových rysů omezen konstantou k, jazyk L je ve skutečnosti bezkontextový. Tato práce dále ukazuje, že dosažený výsledek představuje silný nástroj důkazu bezkontextovosti jazyka. Vše je doplněno příklady praktického využití nástroje.

APA, Harvard, Vancouver, ISO, and other styles

9

Madeira, Marcelo Gomes. "Comparação de tecnicas de analise de risco aplicadas ao desenvolvimento de campos de petroleo." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/263732.

Full text

Abstract:

Orientadores: Denis Jose Schiozer, Eliana L. Ligero<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecanica, Instituto de Geociencias<br>Made available in DSpace on 2018-08-04T09:02:20Z (GMT). No. of bitstreams: 1 Madeira_MarceloGomes_M.pdf: 1487066 bytes, checksum: 39d5e48bf728f51d3c85f7d5ef207d41 (MD5) Previous issue date: 2005<br>Resumo: Os processos de tomada de decisões em campos de petróleo estão associados a grandes riscos provenientes de incertezas geológicas, econômicas e tecnológicas e altos investimentos. Nas fases de avaliação e desenvolvimento dos campos, torna-se necessário modelar o processo de recuperação com confiabilidade aumentando o esforço computacional. Uma forma de acelerar o processo é através de simplificações sendo algumas discutidas neste trabalho: técnica de quantificação do risco (Monte Carlo, árvore de derivação), redução no número de atributos, tratamento simplificado de atributos e simplificação da modelagem do reservatório. Ênfase especial está sendo dada à (1) comparação entre Monte Carlo e árvore de derivação e (2) desenvolvimento de modelos rápidos através de planejamento de experimentos e superfície de resposta. Trabalhos recentes estão sendo apresentados sobre estas técnicas, mas normalmente mostrando aplicações e não comparação entre alternativas. O objetivo deste trabalho é comparar estas técnicas levando em consideração a confiabilidade, a precisão dos resultados e aceleração do processo. Estas técnicas são aplicadas a um campo marítimo e os resultados mostram que (1) é possível reduzir significativamente o número de simulações do fluxo mantendo a precisão dos resultados e que (2) algumas simplificações podem afetar o processo de decisão<br>Abstract: Petroleum field decision-making process is associated to high risks due to geological, economic and technological uncertainties, and high investments, mainly in the appraisal and development phases of petroleum fields where it is necessary to model the recovery process with higher precision increasing the computational time. One way to speedup the process is by simplifying the process; some simplifications are discussed in this work: technique to quantify the risk (Monte Carlo and derivative tree), reduction of number of attributes, simplification of the treatment of attributes and simplification of the reservoir modeling process. Special emphasis is given to (1) comparison between Monte Carlo and derivative tree techniques and (2) development of fast models through experimental design and response surface method. Some works are being presented about these techniques but normally they show applications and no comparison among alternatives is presented. The objective of this work is to compare these techniques taking into account the reliability, precision of the results and speedup of the process. These techniques are applied to an offshore field and the results show that it is possible to reduce significantly the number of flow simulation maintaining the precision of the results. It is also possible to show that some simplifications can yield different results affecting the decision process<br>Mestrado<br>Reservatórios e Gestão<br>Mestre em Ciências e Engenharia de Petróleo

APA, Harvard, Vancouver, ISO, and other styles

10

Narmack, Kirilll. "Dynamic Speed Adaptation for Curves using Machine Learning." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-233545.

Full text

Abstract:

The vehicles of tomorrow will be more sophisticated, intelligent and safe than the vehicles of today. The future is leaning towards fully autonomous vehicles. This degree project provides a data driven solution for a speed adaptation system that can be used to compute a vehicle speed for curves, suitable for the underlying driving style of the driver, road properties and weather conditions. A speed adaptation system for curves aims to compute a vehicle speed suitable for curves that can be used in Advanced Driver Assistance Systems (ADAS) or in Autonomous Driving (AD) applications. This degree project was carried out at Volvo Car Corporation. Literature in the field of speed adaptation systems and factors affecting the vehicle speed in curves was reviewed. Naturalistic driving data was both collected by driving and extracted from Volvo's data base and further processed. A novel speed adaptation system for curves was invented, implemented and evaluated. This speed adaptation system is able to compute a vehicle speed suitable for the underlying driving style of the driver, road properties and weather conditions. Two different artificial neural networks and two mathematical models were used to compute the desired vehicle speed in curves. These methods were compared and evaluated.<br>Morgondagens fordon kommer att vara mer sofistikerade, intelligenta och säkra än dagens fordon. Framtiden lutar mot fullständigt autonoma fordon. Detta examensarbete tillhandahåller en datadriven lösning för ett hastighetsanpassningssystem som kan beräkna ett fordons hastighet i kurvor som är lämpligt för förarens körstil, vägens egenskaper och rådande väder. Ett hastighetsanpassningssystem för kurvor har som mål att beräkna en fordonshastighet för kurvor som kan användas i Advanced Driver Assistance Systems (ADAS) eller Autonomous Driving (AD) applikationer. Detta examensarbete utfördes på Volvo Car Corporation. Litteratur kring hastighetsanpassningssystem samt faktorer som påverkar ett fordons hastighet i kurvor studerades. Naturalistisk bilkörningsdata samlades genom att köra bil samt extraherades från Volvos databas och bearbetades. Ett nytt hastighetsanpassningssystem uppfanns, implementerades samt utvärderades. Hastighetsanpassningssystemet visade sig vara kapabelt till att beräkna en lämplig fordonshastighet för förarens körstil under rådande väderförhållanden och vägens egenskaper. Två olika artificiella neuronnätverk samt två matematiska modeller användes för att beräkna fordonets hastighet. Dessa metoder jämfördes och utvärderades.

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Derivation tree"

1

McMinn, J. W. Derivation of prism factors for quantifying tree crown competition. U.S. Dept. of Agriculture, Forest Service, Southeastern Forest Experiment Station, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Grender, Julie Myers. Theory and derivation for Weibull parameter probability weighted moment estimators. U.S. Dept. of Agriculture, Forest Service, Southern Forest Experiment Station, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Campos, Rodrigo Pedraza. Tres visiones acerca de los productos financieros derivados en México. Coordinación de Servicios Editoriales, Facultad de Ciencias, UNAM, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Glasserman, Paul, and Mark Nathan Broadie. Hedging with trees: Advances in pricing and risk managing derivatives. Risk, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Baulieu, Laurent, John Iliopoulos, and Roland Sénéor. Applications. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198788393.003.0013.

Full text

Abstract:

Physical applications. Introduction of the scattering amplitude and cross sections. The phase space integrals. Explicit calculations of QED processes in the tree approximation. Derivation of the Feynman rules for general field theories.

APA, Harvard, Vancouver, ISO, and other styles

6

Tree of Codes. Visual Editions, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

G, Larson Richard, and United States. National Aeronautics and Space Administration., eds. Labeled trees and the efficient computation of derivations. National Aeronautics and Space Administration, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

(Editor), Mark Broadie, and Paul Glasserman (Editor), eds. Hedging With Trees Advances in Pricing and Risk Managing Derivatives. Risk Books, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wenzel, Ulrich, Thorsten Wiech, and Udo Helmchen. The effect of hypertension on renal vasculature and structure. Edited by Neil Turner. Oxford University Press, 2015. http://dx.doi.org/10.1093/med/9780199592548.003.0211.

Full text

Abstract:

The concept of hypertensive nephrosclerosis was introduced by Volhard and Fahr in 1914 and has been extensively used in the literature since then, but its existence is controversial. While it is indisputable that malignant hypertension is a cause of end-stage renal disease (ESRD), there remains controversy as to whether the so-called benign nephrosclerosis can also lead to ESRD.Pressure, if it is great enough, will eventually disrupt any structure. Obviously, this is also true of blood pressure. It is therefore not surprising that an experimentally induced great increase in pressure disrupts the integrity of the blood-vessel wall. Such vascular lesions may be caused or at least influenced by several factors: humoral factors such as angiotensin II, catecholamines, mineralocorticoids, and vasopressin may increase vascular permeability, thereby damaging the vessel walls independently of, or superimposed upon, elevated blood pressure.Nephrosclerosis (literally, hardening of the kidney, Greek derivation: nephros, kidney; sclerosis, hardening) refers to diseases with predominant pathological changes occurring in the pre-glomerular vasculature and secondary changes involving the glomeruli and interstitium. Therefore, it is appropriate to describe first those vascular lesions, which, at least under defined experimental conditions, are believed to be caused solely by the presence of hypertension.

APA, Harvard, Vancouver, ISO, and other styles

10

Cheng, Russell. Standard Asymptotic Theory. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198505044.003.0003.

Full text

Abstract:

This book relies on maximum likelihood (ML) estimation of parameters. Asymptotic theory assumes regularity conditions hold when the ML estimator is consistent. Typically an additional third derivative condition is assumed to ensure that the ML estimator is also asymptotically normally distributed. Standard asymptotic results that then hold are summarized in this chapter; for example, the asymptotic variance of the ML estimator is then given by the Fisher information formula, and the log-likelihood ratio, the Wald and the score statistics for testing the statistical significance of parameter estimates are all asymptotically equivalent. Also, the useful profile log-likelihood then behaves exactly as a standard log-likelihood only in a parameter space of just one dimension. Further, the model can be reparametrized to make it locally orthogonal in the neighbourhood of the true parameter value. The large exponential family of models is briefly reviewed where a unified set of regular conditions can be obtained.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Derivation tree"

1

Berghammer, Rudolf, Burghard von Karger, and Andreas Wolf. "Relation-algebraic derivation of spanning tree algorithms." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054283.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Graf, Thomas. "Closure Properties of Minimalist Derivation Tree Languages." In Logical Aspects of Computational Linguistics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22221-4_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Esparza, Javier, and Michael Luttenberger. "Solving Fixed-Point Equations by Derivation Tree Analysis." In Algebra and Coalgebra in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22944-2_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Büchse, Matthias, Andreas Maletti, and Heiko Vogler. "Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars." In Developments in Language Theory. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31653-1_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Bin, George S. Avrunin, Lori A. Clarke, and Leon J. Osterweil. "Automatic Fault Tree Derivation from Little-JIL Process Definitions." In Software Process Change. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11754305_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Anderson, David. "A Tree Derivation Procedure for Multivalent and Paraconsistent Inference." In Lecture Notes in Electrical Engineering. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-85437-3_67.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Graf, Thomas. "Locality and the Complexity of Minimalist Derivation Tree Languages." In Formal Grammar. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32024-8_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Forstenlechner, Stefan, Miguel Nicolau, David Fagan, and Michael O’Neill. "Grammar Design for Derivation Tree Based Genetic Programming Systems." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30668-1_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Shin, Hee Jae, Do Hyun Bae, and Jin Suk Kim. "Derivation of Coverage in Sensor Network Using a Quad-Tree Partitioning Scheme." In Convergence and Hybrid Information Technology. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32645-5_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Zhang, Yuanping, and Mordecai J. Golin. "Further Applications of Chebyshev Polynomials in the Derivation of Spanning Tree Formulas for Circulant Graphs." In Mathematics and Computer Science II. Birkhäuser Basel, 2002. http://dx.doi.org/10.1007/978-3-0348-8211-8_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Derivation tree"

1

Schabes, Yves, and Stuart M. Shieber. "An alternative conception of tree-adjoining derivation." In the 30th annual meeting. Association for Computational Linguistics, 1992. http://dx.doi.org/10.3115/981967.981989.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jelinek, F., J. Lafferty, D. Magerman, R. Mercer, A. Ratnaparkhi, and S. Roukos. "Decision tree parsing using a hidden derivation model." In the workshop. Association for Computational Linguistics, 1994. http://dx.doi.org/10.3115/1075812.1075873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Altun, Kerem, Bu¨lent E. Platin, and Tuna Balkan. "Systematic State Equation Derivation for Linear Systems Using the Normal Tree Method." In ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-41237.

Full text

Abstract:

A systematic method to derive the state equations of a linear system starting from its linear graph is proposed. The normal tree is used in the analysis, which is a method to determine the dependencies between energy storage elements in the system. An algorithm to list all normal trees of a system graph is developed, which enables the determination of energy-based state variable sets and corresponding state equations. A computer program is developed to realize these algorithms, which derives the state equations of a system, given its linear graph.

APA, Harvard, Vancouver, ISO, and other styles

4

Butler, Michael. "Calculational Derivation of Algorithms on Tree-based Pointer Structures." In Proceedings of the BCS-FACS 7th Refinement Workshop. BCS Learning & Development, 1996. http://dx.doi.org/10.14236/ewic/rw1996.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tian, Wei, Yi Lin, Yajing Liu, and Zheng Niu. "Derivation of tree stem structural parameters from static terrestrial laser scanning data." In SPIE Asia Pacific Remote Sensing, edited by Upendra N. Singh and Kazuhiro Asai. SPIE, 2014. http://dx.doi.org/10.1117/12.2068571.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Nandhini, S., and G. Muralidharan. "Derivation of activated carbon from tamarindus indica tree bark for supercapacitor applications." In DAE SOLID STATE PHYSICS SYMPOSIUM 2018. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5113379.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zuo, Zhengkang, Yue Fang, Qing Huang, Yunyan Liao, Yuan Wang, and Changjing Wang. "Non-recursive Algorithm Derivation and Formal Proof of Binary Tree Traversal Class Problems." In 2020 IEEE 20th International Conference on Software Quality, Reliability and Security Companion (QRS-C). IEEE, 2020. http://dx.doi.org/10.1109/qrs-c51114.2020.00113.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhou, Bowen, Xiaodan Zhu, Bing Xiang, and Yuqing Gao. "Prior derivation models for formally syntax-based translation using linguistically syntactic parsing and tree kernels." In the Second Workshop. Association for Computational Linguistics, 2008. http://dx.doi.org/10.3115/1626269.1626272.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ru¨de, Erich, and Rainer Hamann. "Derivation or Ship System Safety Criteria by Means of Risk-Based Ship System Safety Analysis." In ASME 2008 27th International Conference on Offshore Mechanics and Arctic Engineering. ASMEDC, 2008. http://dx.doi.org/10.1115/omae2008-57248.

Full text

Abstract:

Nowadays an increasing popularity of alternative designs can be observed challenging the IMO Regulations of SOLAS (International Convention for the Safety Of Life At Sea). Examples are passenger ships with larger main vertical zones, novel types of survival crafts and new materials. This desire for innovative solutions combined with the society’s need for increasingly safer transport is expected to be satisfied by risk-based ship design and approval. The process of alternative ship design and arrangements, as described in MSC/Circ.1002 and MSC.1/Circ.1212, requires a risk analysis to demonstrate that the risk contribution of the novel design is less or equal to the present design. Thus the application of this process can also be regarded as risk-based design. The application of risk-based design is driven by the need for continuous improvement of the efficiency leading to lower costs for design, manufacturing or operation, because it offers the required frame for the development of new innovative solutions. IACS defines safety as absence of unacceptable levels of risk to life, limb and health. Risk is defined as a measure of likelihood that an undesirable event will occur together with a measure of the resulting consequence within a specified time, i.e., the combination of the frequency or probability and the severity of the consequence. Risk-based design involves risk assessment and risk evaluation criteria that can be defined, for instance, on basis of historical data or the ALARP process (As Low As Reasonably Practicable) combined with cost-benefit analysis. In this paper the definition of a risk evaluation criterion for systems by means of ALARP and cost-benefit analysis is presented and illustrated by a sample design of a ship fuel oil system. The risk contribution tree used for the analysis is composed of fault trees and event trees. A cost-benefit analysis is applied to establish a target system risk criterion in form of a target system failure probability. Problems related to the discrete structure of systems are discussed. The work shows that different risk analysis methods are required to describe the escalation chain from a component failure to a potential accident and its consequences.

APA, Harvard, Vancouver, ISO, and other styles

10

Kuslits, Márton, and Dieter Bestle. "Symbolic Linearized Equations for Nonholonomic Multibody Systems With Closed-Loop Kinematics." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85823.

Full text

Abstract:

Multibody systems and associated equations of motion may be distinguished in many ways: holonomic and nonholonomic, linear and nonlinear, tree-structured and closed-loop kinematics, symbolic and numeric equations of motion. The present paper deals with a symbolic derivation of nonlinear equations of motion for nonholonomic multibody systems with closed-loop kinematics, where any generalized coordinates and velocities may be used for describing their kinematics. Loop constraints are taken into account by algebraic equations and Lagrange multipliers. The paper then focuses on the derivation of the corresponding linear equations of motion by eliminating the Lagrange multipliers and applying a computationally efficient symbolic linearization procedure. As demonstration example, a vehicle model with differential steering is used where validity of the approach is shown by comparing the behavior of the linearized equations with their nonlinear counterpart via simulations.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!