Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Dependency.
Dissertationen zum Thema „Dependency“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Dependency" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Wang, Rong-Tsorng. „Reliability with multivariate dependency, Markov dependence and Martingales“. Thesis, University of Sussex, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.322905.
Der volle Inhalt der Quelle
2
Huber, NIcole M. „DEPENDENT PERSONALITY INVENTORY (DPI): A SCALE TO ASSESS DEPENDENT PERSONALITY SUBTYPES BASED ON DSM-IV-TR CRITERIA“. Cleveland, Ohio : Cleveland State University, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=csu1200081883.
Der volle Inhalt der QuelleAnnotation:
Thesis (M.A.)--Cleveland State University, 2007.Abstract. Title from PDF t.p. (viewed on May 8, 2008). Includes bibliographical references (p. 35-39). Available online via the OhioLINK ETD Center. Also available in print.
3
Suchatvejapoom, Tanyaporn. „Conceptual dependency“. DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1985. http://digitalcommons.auctr.edu/dissertations/1535.
Der volle Inhalt der Quelle
4
Cardó, Carles 1975. „Algebraic dependency grammar“. Doctoral thesis, Universitat Politècnica de Catalunya, 2018. http://hdl.handle.net/10803/463326.
Der volle Inhalt der QuelleAnnotation:
We propose a mathematical formalism called Algebraic Dependency Grammar with applications to formal linguistics and to formal language theory. Regarding formal linguistics we aim to address the problem of grammaticality with special attention to cross-linguistic cases. In the field of formal language theory this formalism provides a new perspective allowing an algebraic classification of languages. Notably our approach suggests the existence of so-called anti-classes of languages associated to certain classes of languages.
Our notion of a dependency grammar is as of a definition of a set of well-constructed dependency trees (we call this algebraic governance) and a relation which associates word-orders to dependency trees (we call this algebraic linearization).
In relation to algebraic governance, we define a manifold which is a set of dependency trees satisfying an agreement condition throughout a pattern, which is the algebraic form of a collection of syntactic addresses over the dependency tree. A boolean condition on the words formalizes the notion of agreement.
In relation to algebraic linearization, first we observe that the notion of projectivity is quintessentially that certain substructures of a dependency tree always form an interval in its linearization. So we have to establish well what is a substructure; we see again that patterns proportion the key, generalizing the notion of projectivity with recursive linearization procedures.
Combining the above modules we have the formalism: an algebraic dependency grammar is a manifold together with a linearization.
Notice that patterns sustain both manifolds and linearizations. We study their interrelation in terms of a new algebraic classification of classes of languages.
We highlight the main contributions of the thesis. Regarding mathematical linguistics, algebraic dependency grammar considers trees and word-order different modules in the architecture, which allows description of languages with varied word-order. Ellipses are permitted; this issue is usually avoided because it makes some formalisms non-decidable.
We differentiate linguistic phenomena structurally by their algebraic description. Algebraic dependency grammar permits observance of affinity between linguistic constructions which seem superficially different.
Regarding formal language theory, a new system for understanding a very large family of languages is presented which permits observation of languages in broader contexts. We identify a new class named anti-context-free languages containing constructions structurally symmetric to context-free languages. Informally we could say that context-free languages are well-parenthesized, while anti-context-free languages are cross-serial-parenthesized. For example copy languages and respectively languages are anti-context-free.Es proposa un formalisme matemàtic anomenat Gramàtica de Dependències Algebraica amb aplicacions a la lingüística formal i a la teoria de llenguatges formals. Pel que fa a la lingüística formal es pretén abordar el problema de la gramaticalitat, amb un èmfasi especial en la transversalitat, això és, que el formalisme sigui apte per a un bon nombre de llengües. En el camp dels llenguatges formals aquest formalisme proporciona una nova perspectiva que permet una classificació algebraica dels llenguatges. Aquest enfocament suggereix a més a més l'existència de les aquí anomenades anti-classes de llenguatges associades a certes classes de llenguatges. La nostra idea d'una gramàtica de dependències és en un conjunt de sintagmes ben construïts (d'això en diem recció algebraica) i una relació que associa ordres de paraules als sintagmes d'aquest conjunt (d'això en diem linearització algebraica). Pel que fa a la recció algebraica, introduïm el concepte de varietat sintàctica com el conjunt de sintagmes que satisfan una concordança sobre un determinat patró. Un patró és un conjunt d'adreces sintàctiques descrit algebraicament. La concordança es formalitza a través d'una condició booleana sobre el vocabulari. En relació amb linearització algebraica, en primer lloc, observem que l'essencial de la noció clàssica de projectivitat rau en el fet que certes subestructures d'un arbre de dependències formen sempre un interval en la seva linearització. Així doncs, primer hem d'establir bé que vol dir subestructura. Un cop més veiem que els patrons en proporcionen la clau, tot generalitzant la noció de projectivitat a través d'un procediment recursiu de linearització. Tot unint els dos mòduls anteriors ja tenim el nostre formalisme a punt: una gramàtica de dependències algebraica és una varietat sintàctica juntament amb una linearització. Notem que els patrons són a la base de tots dos mòduls: varietats i linearitzacions, així que resulta del tot natural estudiar-ne la interrelació en termes d'un nou sistema de classificació algebraica de classes de llenguatges. Destaquem les principals contribucions d'aquesta tesi. Pel que fa a la matemàtica lingüística, la gramàtica de dependències algebraica considera els arbres i l'ordre de les paraules diferents mòduls dins l'arquitectura la qual cosa permet de descriure llenguatges amb una gran varietat d'ordre. L'ús d'el·lipsis és permès; aquesta qüestió és normalment evitada en altres formalismes per tal com la possibilitat d'el·lipsis fa que els models es tornin no decidibles. El nostre model també ens permet classificar estructuralment fenòmens lingüístics segons la seva descripció algebraica, així com de copsar afinitats entre construccions que semblen superficialment diferents. Pel que fa a la teoria dels llenguatges formals, presentem un nou sistema de classificació que ens permet d'entendre els llenguatges en un context més ampli. Identifiquem una nova classe que anomenem llenguatges anti-lliures-de-context que conté construccions estructuralment simètriques als llenguatges lliures de context. Informalment podríem dir que els llenguatges lliures de context estan ben parentetitzats, mentre que els anti-lliures-de-context estan parentetitzats segons dependències creuades en sèrie. En són mostres d'aquesta classe els llenguatges còpia i els llenguatges respectivament.
5
Moon, Eunyoung. „Essays on dependency“. Thesis, University of Essex, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.571503.
Der volle Inhalt der QuelleAnnotation:
This research considers social networks in informal insurance and mechanism design issues related to consumption externalities. Chapter 2 examines informal insurance networks. Defining an income-sharing arrangement as a link, I show that pairwise stable networks are regular and the degree depends on the relative value of income. Although the complete network is efficient, either high risk or high risk aversion weakens the incentive to add a link so that full risk sharing is less likely to be pairwise stable at the high level of risk. However, if the group size is large enough, the complete network is always pairwise stable regardless of the income-risk ratio. Additionally, asymmetric network structures may arise for heterogeneous agents. Chapter 3 and 4 consider consumption externalities. In Chapter 3, I develop an efficient allocation mechanism when there are consumption externalities. To implement an efficient outcome, the payment function of an incentive compatible mechanism separately reflects individual agents' valuation as well as the externalities. A seller's perspective leads Chapter 4 by comparing two prevalent selling mechanisms - English auction and posted-price selling. An English auction, of which the price is determined through buyers' competition, yields higher expected revenue under low externalities, whereas a posted-price selling, of which the price is set by the seller, is better for the seller at the high level of externalities.
6
Sun, Huiling. „System dependency modelling“. Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/34918.
Der volle Inhalt der QuelleAnnotation:
It is common for modern engineering systems to feature dependency relationships between its components. The existence of these dependencies render the fault tree analysis (FTA) and its efficient implementation, the Binary Decision Diagram (BDD) approach, inappropriate in predicting the system failure probability. Whilst the Markov method provides an alternative means of analysis of systems of this nature, it is susceptible to state space explosion problems for large, or even moderate sized systems. Within this thesis, a process is proposed to improve the applicability of the Markov analysis. With this process, the smallest independent sections (modules) which contain each dependency type are identified in a fault tree and analysed by the most efficient method. Thus, BDD and the Markov analysis are applied in a combined way to improve the analysis efficiency. The BDD method is applied to modules which contain no dependency, and the Markov analysis applied to modules in which dependencies exist. Different types of dependency which can arise in an engineering system assessment are identified. Algorithms for establishing a Markov model have also been developed for each type of dependency. Three types of system are investigated in this thesis in the context of dependency modelling: the continuously-operating system, the active-on-demand system and the phased-mission system. Different quantification techniques have been developed for each type of system to obtain the system failure probability and other useful predictive measures. Investigation is also carried out into the use of BDD in assessing non-repairable systems involving dependencies. General processes have been established to enable the quantification.
7
Kim, Doo Sik. „A cross-national study on economic development, economic dependency, cultural dependency, and internal structural mechanisms : modernization or dependency /“. The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487325740717624.
Der volle Inhalt der Quelle
8
Jiang, Yan. „Logical dependency in quantification“. Thesis, University College London (University of London), 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306968.
Der volle Inhalt der Quelle
9
Adams, Allison. „Dependency Parsing and Dialogue Systems : an investigation of dependency parsing for commercial application“. Thesis, Uppsala universitet, Institutionen för lingvistik och filologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-324859.
Der volle Inhalt der QuelleAnnotation:
In this thesis, we investigate dependency parsing for commercial application, namely for future integration in a dialogue system. To do this, we conduct several experiments on dialogue data to assess parser performance on this domain, and to improve this performance over a baseline. This work makes the following contributions: first, the creation and manual annotation of a gold-standard data set for dialogue data; second, a thorough error analysis of the data set, comparing neural network parsing to traditional parsing methods on this domain; and finally, various domain adaptation experiments show how parsing on this data set can be improved over a baseline. We further show that dialogue data is characterized by questions in particular, and suggest a method for improving overall parsing on these constructions.
10
McClintock, Andrew S. „The Application of Mindfulness for Interpersonal Dependency: Effects of a Brief Intervention“. Ohio University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1350934561.
Der volle Inhalt der Quelle
11
Candiotes, Alexander George. „A comparative study of the primary tax rebate system in South Africa in relation to Brazil and Australia“. Diss., University of Pretoria, 2012. http://hdl.handle.net/2263/26702.
Der volle Inhalt der QuelleAnnotation:
The South African primary rebate is governed by Section 6 of the Income Tax Act (58 of 1962). This primary tax rebate entitles taxpayers to a tax-free income portion up to a certain level depending on the rebate amount (also referred to as the tax threshold). The concept of tax thresholds in a tax system in essence adhere to the first tax canon of Smith (1776:676), which suggests that individuals should pay taxes in proportion to each person’s ability to pay tax. The implication of this tax canon is that individuals who have a limited or no ability to pay tax should only be subject to pay tax in relation to their ability. Therefore, before tax can be levied, an amount for the necessities-of-life must be deducted from the taxpayer’s income (Vivian, 2006:85). The primary rebate system thus gives individuals a tax-free income portion which is supposed to first compensate for an individual’s necessities-of-life expenses or put differently the costs to survive. The main purpose of the present study is to critically analyse and compare the fairness of the primary rebates in South Africa in relation to other countries. To meet the main purpose a comparison was done between South Africa’s primary rebate and related government grant programs to that of Brazil and Australia. It was found that South Africa rebate system creates significant vertical and horizontal unfairness and that it compares poorly to the fairer multiple rebate and government grant systems of Brazil and Australia. Accordingly it was recommended that the unified primary rebate system of South Africa is reviewed and brought in line with the multiple rebate systems implemented in countries such as Brazil and Australia.Dissertation (MCom)--University of Pretoria, 2012.
Taxation
unrestricted
12
Bauckmann, Jana. „Dependency discovery for data integration“. Phd thesis, Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6664/.
Der volle Inhalt der QuelleAnnotation:
Data integration aims to combine data of different sources and to provide users with a unified view on these data. This task is as challenging as valuable. In this thesis we propose algorithms for dependency discovery to provide necessary information for data integration. We focus on inclusion dependencies (INDs) in general and a special form named conditional inclusion dependencies (CINDs): (i) INDs enable the discovery of structure in a given schema. (ii) INDs and CINDs support the discovery of cross-references or links between schemas.
An IND “A in B” simply states that all values of attribute A are included in the set of values of attribute B. We propose an algorithm that discovers all inclusion dependencies in a relational data source. The challenge of this task is the complexity of testing all attribute pairs and further of comparing all of each attribute pair's values.
The complexity of existing approaches depends on the number of attribute pairs, while ours depends only on the number of attributes. Thus, our algorithm enables to profile entirely unknown data sources with large schemas by discovering all INDs. Further, we provide an approach to extract foreign keys from the identified INDs.
We extend our IND discovery algorithm to also find three special types of INDs: (i) Composite INDs, such as “AB in CD”, (ii) approximate INDs that allow a certain amount of values of A to be not included in B, and (iii) prefix and suffix INDs that represent special cross-references between schemas.
Conditional inclusion dependencies are inclusion dependencies with a limited scope defined by conditions over several attributes. Only the matching part of the instance must adhere the dependency. We generalize the definition of CINDs distinguishing covering and completeness conditions and define quality measures for conditions. We propose efficient algorithms that identify covering and completeness conditions conforming to given quality thresholds. The challenge for this task is twofold: (i) Which (and how many) attributes should be used for the conditions? (ii) Which attribute values should be chosen for the conditions? Previous approaches rely on pre-selected condition attributes or can only discover conditions applying to quality thresholds of 100%.
Our approaches were motivated by two application domains: data integration in the life sciences and link discovery for linked open data. We show the efficiency and the benefits of our approaches for use cases in these domains.Datenintegration hat das Ziel, Daten aus unterschiedlichen Quellen zu kombinieren und Nutzern eine einheitliche Sicht auf diese Daten zur Verfügung zu stellen. Diese Aufgabe ist gleichermaßen anspruchsvoll wie wertvoll. In dieser Dissertation werden Algorithmen zum Erkennen von Datenabhängigkeiten vorgestellt, die notwendige Informationen zur Datenintegration liefern. Der Schwerpunkt dieser Arbeit liegt auf Inklusionsabhängigkeiten (inclusion dependency, IND) im Allgemeinen und auf der speziellen Form der Bedingten Inklusionsabhängigkeiten (conditional inclusion dependency, CIND): (i) INDs ermöglichen das Finden von Strukturen in einem gegebenen Schema. (ii) INDs und CINDs unterstützen das Finden von Referenzen zwischen Datenquellen. Eine IND „A in B“ besagt, dass alle Werte des Attributs A in der Menge der Werte des Attributs B enthalten sind. Diese Arbeit liefert einen Algorithmus, der alle INDs in einer relationalen Datenquelle erkennt. Die Herausforderung dieser Aufgabe liegt in der Komplexität alle Attributpaare zu testen und dabei alle Werte dieser Attributpaare zu vergleichen. Die Komplexität bestehender Ansätze ist abhängig von der Anzahl der Attributpaare während der hier vorgestellte Ansatz lediglich von der Anzahl der Attribute abhängt. Damit ermöglicht der vorgestellte Algorithmus unbekannte Datenquellen mit großen Schemata zu untersuchen. Darüber hinaus wird der Algorithmus erweitert, um drei spezielle Formen von INDs zu finden, und ein Ansatz vorgestellt, der Fremdschlüssel aus den erkannten INDs filtert. Bedingte Inklusionsabhängigkeiten (CINDs) sind Inklusionsabhängigkeiten deren Geltungsbereich durch Bedingungen über bestimmten Attributen beschränkt ist. Nur der zutreffende Teil der Instanz muss der Inklusionsabhängigkeit genügen. Die Definition für CINDs wird in der vorliegenden Arbeit generalisiert durch die Unterscheidung von überdeckenden und vollständigen Bedingungen. Ferner werden Qualitätsmaße für Bedingungen definiert. Es werden effiziente Algorithmen vorgestellt, die überdeckende und vollständige Bedingungen mit gegebenen Qualitätsmaßen auffinden. Dabei erfolgt die Auswahl der verwendeten Attribute und Attributkombinationen sowie der Attributwerte automatisch. Bestehende Ansätze beruhen auf einer Vorauswahl von Attributen für die Bedingungen oder erkennen nur Bedingungen mit Schwellwerten von 100% für die Qualitätsmaße. Die Ansätze der vorliegenden Arbeit wurden durch zwei Anwendungsbereiche motiviert: Datenintegration in den Life Sciences und das Erkennen von Links in Linked Open Data. Die Effizienz und der Nutzen der vorgestellten Ansätze werden anhand von Anwendungsfällen in diesen Bereichen aufgezeigt.
13
Kreps, Christian John Manfred. „Extraction, movement and dependency theory“. Thesis, University College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300589.
Der volle Inhalt der Quelle
14
ROCHA, RENATO SAYAO CRYSTALLINO DA. „A DEPENDENCY TREE ARC FILTER“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35858@1.
Der volle Inhalt der QuelleAnnotation:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
A tarefa de Processamento de Linguagem Natural consiste em analisar linguagens naturais de forma computacional, facilitando o desenvolvimento de programas capazes de utilizar dados falados ou escritos. Uma das tarefas mais importantes deste campo é a Análise de Dependência. Tal tarefa consiste em analisar a estrutura gramatical de frases visando extrair aprender dados sobre suas relações de dependência. Em uma sentença, essas relações se apresentam em formato de árvore, onde todas as palavras são interdependentes. Devido ao seu uso em uma grande variedade de aplicações como Tradução Automática e Identificação de Papéis Semânticos, diversas pesquisas com diferentes abordagens são feitas nessa área visando melhorar a acurácia das árvores previstas. Uma das abordagens em questão consiste em encarar o problema como uma tarefa de classificação de tokens e dividi-la em três classificadores diferentes, um para cada sub-tarefa, e depois juntar seus resultados de forma incremental. As sub-tarefas consistem em classificar, para cada par de palavras que possuam relação paidependente, a classe gramatical do pai, a posição relativa entre os dois e a distância relativa entre as palavras. Porém, observando pesquisas anteriores nessa abordagem, notamos que o gargalo está na terceira sub-tarefa, a predição da distância entre os tokens. Redes Neurais Recorrentes são modelos que nos permitem trabalhar utilizando sequências de vetores, tornando viáveis problemas de classificação onde tanto a entrada quanto a saída do problema são sequenciais, fazendo delas uma escolha natural para o problema. Esse trabalho utiliza-se de Redes Neurais Recorrentes, em específico Long Short-Term Memory, para realizar a tarefa de predição da distância entre palavras que possuam relações de dependência como um problema de classificação sequence-to-sequence. Para sua avaliação empírica, este trabalho segue a linha de pesquisas anteriores e utiliza os dados do corpus em português disponibilizado pela Conference on Computational Natural Language Learning 2006 Shared Task. O modelo resultante alcança 95.27 por cento de precisão, resultado que é melhor do que o obtido por pesquisas feitas anteriormente para o modelo incremental.
The Natural Language Processing task consists of analyzing the grammatical structure of a sentence written in natural language aiming to learn, identify and extract information related to its dependency structure. This data can be structured like a tree, since every word in a sentence has a head-dependent relation to another word from the same sentence. Since Dependency Parsing is used in many applications like Machine Translation, Semantic Role Labeling and Part-Of-Speech Tagging, researchers aiming to improve the accuracy on their models are approaching this task in many different ways. One of the approaches consists in looking at this task as a token classification problem, using different classifiers for each sub-task and joining them in an incremental way. These sub-tasks consist in classifying, for each head-dependent pair, the Part-Of-Speech tag of the head, the relative position between the two words and the distance between them. However, previous researches using this approach show that the bottleneck lies in the distance classifier. Recurrent Neural Networks are a kind of Neural Network that allows us to work using sequences of vectors, allowing for classification problems where both our input and output are sequences, making them a great choice for the problem at hand. This work studies the use of Recurrent Neural Networks, in specific Long Short-Term Memory networks, for the head-dependent distance classifier sub-task as a sequence-to-sequence classification problem. To evaluate its efficiency, this work follows the line of previous researches and makes use of the Portuguese corpus of the Conference on Computational Natural Language Learning 2006 Shared Task. The resulting model attains 95.27 percent precision, which is better than the previous results obtained using incremental models.
15
Koo, Terry (Terry Y. ). „Advances in discriminative dependency parsing“. Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/60102.
Der volle Inhalt der QuelleAnnotation:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 167-176).
Achieving a greater understanding of natural language syntax and parsing is a critical step in producing useful natural language processing systems. In this thesis, we focus on the formalism of dependency grammar as it allows one to model important head modifier relationships with a minimum of extraneous structure. Recent research in dependency parsing has highlighted the discriminative structured prediction framework (McDonald et al., 2005a; Carreras, 2007; Suzuki et al., 2009), which is characterized by two advantages: first, the availability of powerful discriminative learning algorithms like log-linear and max-margin models (Lafferty et al., 2001; Taskar et al., 2003), and second, the ability to use arbitrarily-defined feature representations. This thesis explores three advances in the field of discriminative dependency parsing. First, we show that the classic Matrix-Tree Theorem (Kirchhoff, 1847; Tutte, 1984) can be applied to the problem of non-projective dependency parsing, enabling both log-linear and max-margin parameter estimation in this setting. Second, we present novel third-order dependency parsing algorithms that extend the amount of context available to discriminative parsers while retaining computational complexity equivalent to existing second-order parsers. Finally, we describe a simple but effective method for augmenting the features of a dependency parser with information derived from standard clustering algorithms; our semi-supervised approach is able to deliver consistent benefits regardless of the amount of available training data.
by Terry Koo.
Ph.D.
16
Williams, Michael R. R. „Alcohol dependency and individual differences“. Thesis, University of Warwick, 2013. http://wrap.warwick.ac.uk/57979/.
Der volle Inhalt der QuelleAnnotation:
This research dissertation is carried out on behalf of the Stauros Foundation, a Christian agency which endeavours to offer pastoral care and support to people with an alcohol dependency problem. The sample population consisted of 207 individuals who completed a questionnaire that covered five categories of interest, for example, background biographical, alcohol and family background, drinking habits, effects of drinking habits and perceived pastoral needs.
17
Viana, Luiz Alberto do Carmo. „Dependency constrained minimum spanning tree“. Universidade Federal do CearÃ, 2016. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=17302.
Der volle Inhalt der QuelleAnnotation:
FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgicoIntroduzimos o problema de Ãrvore Geradora com DependÃncias MÃnima, AGDM(G,D,w), definido sobre um grafo G(V,E) e um digrafo D(E,A), cujos vÃrtices sÃo as arestas de G e cujos arcos definem dependÃncias entre tais arestas. O problema consiste em encontrar, dentre as Ãrvores geradoras do grafo G(V,E) que satisfaÃam as restriÃÃes de dependÃncia impostas pelo digrafo de entrada D(E,A), uma que tenha custo mÃnimo, segundo a ponderaÃÃo w das arestas de G. As restriÃÃes de dependÃncia exigem que uma aresta e de G sà pode fazer parte de uma soluÃÃo se for uma fonte em D ou se fizer parte da soluÃÃo alguma outra aresta à tal que o arco (e′, e) esteja em D. Provamos que decidir se hà soluÃÃo viÃvel para AGDM(G,D,w) à um problema NP-completo, mesmo quando G à um cacto cordal e D à a uniÃo de arborescÃncias de altura no mÃximo 2. Sua NP-completude tambÃm à mostrada ainda que G seja bipartido, as restriÃÃes de dependÃncia ocorram apenas entre arestas adjacentes de G e formem arborescÃncias de altura no mÃximo 2. Resultados idÃnticos sÃo obtidos para as variantes do problema onde, nas restriÃÃes de dependÃncia, substitui-se o requisito âalgumaâ por âexatamente umaâ ou âtodaâ. Para resolver o problema, apresentamos algumas formulaÃÃes de programaÃÃo inteira e desigualdades vÃlidas. Propomos uma estratÃgia para reduzir a dimensÃo do problema, excluindo arestas de G com base na estrutura de D. Avaliamos os modelos e algoritmos propostos usando instÃncias geradas aleatoriamente. Resultados computacionais sÃo reportados.
We introduce the Dependency Constrained Minimum Spanning Tree Problem, DCMST(G,D,w), defined over a graph G(V,E) and a digraph D(E,A), whose vertices are the edges of G and whose arcs describe dependency relations between these edges. Such problem consists of finding, among the spanning trees of G(V,E) satisfying the dependency constraints imposed by D(E,A), that one whose cost is minimum, according to a edgeweight function w. The dependency constraints impose that an edge e of G can be part of a solution either if it is a source in D or if some other edge e′, such that the arc (e′, e) is in D, is part of it as well. We prove that deciding whether there is a feasible solution to DCMST(G,D,w) is an NP-complete problem, even if G is a chordal cactus and D is a union of arborescences of height at most 2. NP-completeness also applies if G is bipartite, the dependency constraints occur only between adjacent edges of G and their related arcs describe arborescences whose height is at most 2. The same results are obtained for the problem variants which demand that, instead of âsomeâ, âexactly oneâor âallâdependencies be part of a solution. To solve the problem, we introduce some integer programming formulations and some valid inequalities. We propose a strategy to reduce the problem dimension by excluding some edges of G according to the structure of D. We evaluate the introduced models and algorithms using randomly generated instances. Computational results are reported.
18
Love-Geffen, Tracey E. „The processing of dependency relationships /“. Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC IP addresses, 1998. http://wwwlib.umi.com/cr/ucsd/fullcit?p9904728.
Der volle Inhalt der Quelle
19
Logan, Ann P. „Co-dependency characteristics in nurses /“. Staten Island, N.Y. : [s.n.], 1990. http://library.wagner.edu/theses/nursing/1990/thesis_nur_1990_logan_codep.pdf.
Der volle Inhalt der Quelle
20
Ng, Dominick. „Evaluating Parsers with Dependency Constraints“. Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14550.
Der volle Inhalt der QuelleAnnotation:
Many syntactic parsers now score over 90% on English in-domain evaluation, but the remaining errors have been challenging to address and difficult to quantify. Standard parsing metrics provide a consistent basis for comparison between parsers, but do not illuminate what errors remain to be addressed. This thesis develops a constraint-based evaluation for dependency and Combinatory Categorial Grammar (CCG) parsers to address this deficiency. We examine the constrained and cascading impact, representing the direct and indirect effects of errors on parsing accuracy. This identifies errors that are the underlying source of problems in parses, compared to those which are a consequence of those problems. Kummerfeld et al. (2012) propose a static post-parsing analysis to categorise groups of errors into abstract classes, but this cannot account for cascading changes resulting from repairing errors, or limitations which may prevent the parser from applying a repair. In contrast, our technique is based on enforcing the presence of certain dependencies during parsing, whilst allowing the parser to choose the remainder of the analysis according to its grammar and model. We draw constraints for this process from gold-standard annotated corpora, grouping them into abstract error classes such as NP attachment, PP attachment, and clause attachment. By applying constraints from each error class in turn, we can examine how parsers respond when forced to correctly analyse each class. We show how to apply dependency constraints in three parsers: the graph-based MSTParser (McDonald and Pereira, 2006) and the transition-based ZPar (Zhang and Clark, 2011b) dependency parsers, and the C&C CCG parser (Clark and Curran, 2007b). Each is widely-used and influential in the field, and each generates some form of predicate-argument dependencies. We compare the parsers, identifying common sources of error, and differences in the distribution of errors between constrained and cascaded impact. Our work allows us to contrast the implementations of each parser, and how they respond to constraint application. Using our analysis, we experiment with new features for dependency parsing, which encode the frequency of proposed arcs in large-scale corpora derived from scanned books. These features are inspired by and extend on the work of Bansal and Klein (2011). We target these features at the most notable errors, and show how they address some, but not all of the difficult attachments across newswire and web text. CCG parsing is particularly challenging, as different derivations do not always generate different dependencies. We develop dependency hashing to address semantically redundant parses in n-best CCG parsing, and demonstrate its necessity and effectiveness. Dependency hashing substantially improves the diversity of n-best CCG parses, and improves a CCG reranker when used for creating training and test data. We show the intricacies of applying constraints to C&C, and describe instances where applying constraints causes the parser to produce a worse analysis. These results illustrate how algorithms which are relatively straightforward for constituency and dependency parsers are non-trivial to implement in CCG. This work has explored dependencies as constraints in dependency and CCG parsing. We have shown how dependency hashing can efficiently eliminate semantically redundant CCG n-best parses, and presented a new evaluation framework based on enforcing the presence of dependencies in the output of the parser. By otherwise allowing the parser to proceed as it would have, we avoid the assumptions inherent in other work. We hope this work will provide insights into the remaining errors in parsing, and target efforts to address those errors, creating better syntactic analysis for downstream applications.
21
Aw, Ee Ling Grace. „Modeling dependency: application to currency“. Thesis, Curtin University, 2011. http://hdl.handle.net/20.500.11937/392.
Der volle Inhalt der QuelleAnnotation:
The primary purpose of this dissertation is to investigate the behavior of the elements of the foreign exchange market, the largest financial market in the world. Whilst the market itself is not new, the concept of currency as an alternative asset, is. Apart from growing awareness of the attractiveness of foreign exchange as an asset class, the recent huge growth in foreign investing combined with record high levels of currency volatility raised the importance and immediacy of foreign exchange risk. This dissertation applies several copulas to model the dependency between a chosen currency pair, and employs a superior goodness-of-fit test recently proposed in the copula literature. Applying the selected copula (from the goodness-of-fit test) for the calculation of Value at Risk, it is shown that the selected copula offers superior protection to the organization with only one-third the failure rate compared to the classical correlation-based Value at Risk. In addition, regression techniques are applied on interbank foreign exchange intraday trades to investigate the factors behind the massive volume of foreign exchange trades. Volatility and investments in foreign equity are found to be the key reasons driving foreign exchange trades in 1998; in 2008, the ‘carry’ trade became the most prominent factor.
22
Persson, Oskar, und Samuel Svensson. „Exploring methods for dependency management in multi-repositories : Design science research at Saab Training and simulation“. Thesis, Jönköping University, JTH, Avdelningen för datavetenskap, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-54102.
Der volle Inhalt der QuelleAnnotation:
Dependency problems for developers are like sneezing for people with pollen allergies during the spring, an everyday problem. This is especially true when working in multi-repositories. The dependency problems that occur do so as a byproduct of enabling developers to work on different components of a project in smaller teams, where everything is version controlled.Nearly all developers use version control systems, such as Git, Mercurial, or Subversion. While version control systems have helped developers for nearly 40 years and are constantly getting updated, there are still functionalities that do not exist. One example of that is having a good way of managing dependencies and allowing developers to download projects without having to handle dependency problems manually. The solutions that version control systems offer to help manage dependencies (e.g., Git’s submodules or Mercurial’s subrepositories), do not enable developers a fail-safe download or build the project if it contains dependency problems.In this study, a case study was conducted at Saab Training and Simulation to explore methods for dependency management as well as discuss and highlight some of the problems that emerge when working with dependencies in multi-repositories.An argument can be made that the functionality of dependency management systems, both package managers and version control systems’ solutions are not up to date on how dependencies are used in the development, during this time.In this paper, a novel approach to dependency management is introduced with the possibility to describe the dependencies dynamically by providing the utility to describes usages of a repository (such as simulation of hardware or the main project). As well as discussing the necessary functionalities that are required to handle such a system.By re-opening the dialog about dependency management as well as describing problems that arise in such environments, the goal is to inspire further research within these areas.
23
Nogueira, Daniel Klug [UNESP]. „A teoria da dependência no pensamento socioeconômico de Fernando Henrique Cardoso“. Universidade Estadual Paulista (UNESP), 2006. http://hdl.handle.net/11449/93455.
Der volle Inhalt der QuelleAnnotation:
Made available in DSpace on 2014-06-11T19:26:39Z (GMT). No. of bitstreams: 0
Previous issue date: 2006-04-07Bitstream added on 2014-06-13T18:07:47Z : No. of bitstreams: 1
nogueira_dk_me_arafcl.pdf: 330196 bytes, checksum: c61a5cc24747c1ec4af8f3b8d25d694d (MD5)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Desde o momento em que se preocupa em analisar diferenças de desenvolvimento entre países, a análise da dependência econômica da América Latina chama a atenção dos estudiosos. Passando pelo nacional-desenvolvimento burguês do ISEB e do PCB, pelo estruturalismo da CEPAL, além de alguns estudos de Frank e Marini, colocam-se os primeiros passos para a obra de Cardoso. Nessa obram especialmente no que foi publicado em conjunto com Faletto, Cardoso vem mostrar que desenvolvimento e dependência não são conceitos exclusivos; aliás, na América Latina, segundo sua visão, são conceitos até interligados. Dentro do pensamento cardosiano, a Teoria da Dependência vem estabelecer os principais critérios de análise econômico-política, a qual deve obrigatoriamente passar pelos conflitos internos e externos entre as classes sociais envolvidas no sistema.
From the moment someone concerns about the differences among economic development in several countries, Latin American economic dependency analysis calls scholars' attention. Going through bourgeoise national developmentalism by ISEB and PCB, through ECLA's structuralism, besides some studies by Frank and Marini, the first steps to Cardoso's work, specially the jiont study with Faletto, Cardoso shows that development and dependency are not exclusive; by the way, according to his point of view, they are even connected concepts. In Cardosian thought, the dependency theory comes to set the amin criteria for economic and political analysis, which must pass through internal end external struggles among social classes involved within the system.
24
Pérez, Cáncer Josep Maria. „A dependency-aware parallel programming model“. Doctoral thesis, Universitat Politècnica de Catalunya, 2015. http://hdl.handle.net/10803/286286.
Der volle Inhalt der QuelleAnnotation:
Designing parallel codes is hard. One of the most important roadblocks to parallel programming is the presence of data dependencies. These restrict parallelism and, in general, to work them around requires complex analysis and leads to convoluted solutions that decrease the quality of the code.
This thesis proposes a solution to parallel programming that incorporates data dependencies into the model. The programming model can handle that information and to dynamically find parallelism that otherwise would be hard to find. This approach improves both programmability and parallelism, and thus performance.
While this problem has already been solved in OpenMP 4 at the time of this publication, this research begun before the problem was even being considered for OpenMP 3. In fact, some of the contributions of this thesis have had an influence on the approach taken in OpenMP 4. However, the contributions go beyond that and cover aspects that have not been considered yet in OpenMP 4.
The approach we propose is based on function-level dependencies across disjoint blocks of contiguous memory. While finding dependencies under those constraints is simple, it is much harder to do so over strided and possibly partially overlapping sets of data. This thesis also proposes a solution to this problem. By doing so, we increase the range of applicability of the original solution and increase the span of applicability of the programming model. OpenMP4 does not currently cover this aspect.
Finally, we present a solution to take advantage of the performance characteristics of Non-Uniform Memory Access architectures. Our proposal is at the programming model level and does not require changes in the code. It automatically distributes the data and does not rely on data migration nor replication. Instead, it is based exclusively on scheduling the computations. While this process is automatic, it can be tuned through minor changes in the code that do not require any change in the programming model.
Throughout the thesis, we demonstrate the effectiveness of the proposal through benchmarks that are either hard to program using other paradigms or that have different solutions. In most cases, our solutions perform either on par or better than already existing solutions. This includes the implementations available in well-known high-performance parallel libraries.Dissenyar codis paral·lels es complex. Un dels principals esculls a l'hora de programar aplicacions paral·leles és la presència de dependències. Aquestes constrenyen el paral·lelisme, i en general, per evitar-les es requereix realitzar anàlisis complicades que donen lloc a solucions complexes que redueixen la qualitat del codi. Aquesta tesi proposa una solució a la programació paral·lela que incorpora al model les dependències de dades. El model de programació és capaç d'utilitzar aquesta informació per a trobar paral·lelisme que altrament seria molt difícil de detectar i d'extreure. Aquest enfoc augmenta la programabilitat i el paral·lelisme, i per tant també el rendiment. Tot i que al moment de la publicació d'aquesta tesi, el problema ja ha estat resolt a OpenMP 4, la recerca d'aquesta tesi va començar abans de que el problema s'hagués plantejat en l'àmbit d'OpenMP 3. De fet, algunes de les contribucions de la tesi han influït en la solució emprada a OpenMP 4. Tanmateix, les contribucions van més enllà i cobreixen aspectes que encara no han estat considerats a OpenMP 4. La proposta es basa en dependències a nivell de funció entre blocs de memòria continus i sense intersecció. Tot i que trobar dependències sota aquestes condicions és senzill, fer-ho sobre dades no contínues amb possibles interseccions parcials és molt més complex. Aquesta tesi també proposa una solució a aquest problema. Fent això, es millora el rang d'aplicació de la solució original i per tant el del model de programació. Aquest és un dels aspectes que encara no es contemplen a OpenMP 4. Finalment, es presenta una solució que té en compte les característiques de rendiment de les arquitectures NUMA (Accés No Uniforme a la Memòria). La proposta es planteja a nivell del model de programació i no precisa de canvis al codi ja que les dades es distribueixen automàticament. En lloc de basar-se en la migració i la replicació de les dades, es basa exclusivament en la planificació de l'execució de les computacions. Tot i que aquest procés és automàtic, es pot afinar mitjançant petits canvis en el codi que no arriben a alterar el model de programació. Al llarg d'aquesta tesi es demostra la efectivitat de les propostes a través de bancs de proves que son difícils de programar amb altres paradigmes o que tenen solucions diferents. A la majoria dels casos les nostres solucions tenen un rendiment similar o millor que les solucions preexistents, que inclouen implementacions en ben reconegues biblioteques paral·leles d'alt rendiment.
25
Kolz, Benjamin. „Tailoring dependency models to NLP tasks“. Doctoral thesis, Universitat Pompeu Fabra, 2016. http://hdl.handle.net/10803/393730.
Der volle Inhalt der QuelleAnnotation:
Currently available dependency structures differ significantly in the linguistic criteria they are based on, but are not always adequate for their later use in natural language processing tasks. This dissertation analyses the needs of some of these tasks, in particular temporal and discourse parsing, and suggests task-based dependency structures. A surface-syntax dependency structure is taken as base version, which is then tailored to the needs of the corresponding task by means of head selection, customised syntactic function tagset and collapsed dependencies. The work is grounded on the Spanish corpus AnCora, establishing a surface-syntax base version from its constituent structure level. Two dependency models are created, Temporal and Discourse Dependencies, which take the base version as input and adapt it automatically to the task-based versions. The resulting versions are evaluated by network analysis methods, which confirm the adequacy of these new dependency structures with respect to the specific tasks.Las estructuras de dependencias disponibles actualmente incluyen diferencias significativas en cuanto a los criterios lingüísticos en que se basan, y no siempre son adecuadas para su uso en tareas del procesamiento de lenguaje natural. Esta tesis doctoral analiza las necesidades de algunas de estas tareas, concretamente los análisis temporal y discursivo, y propone la creación de estructuras de dependencias orientadas a las mismas. Una estructura de dependencias puramente sintáctica sirve como versión básica que se adapta a las necesidades de cada tarea a través de la selección del head, de un etiquetario de funciones sintácticas adecuado y del recorte de algunos caminos de dependencias. El proyecto parte de la versión castellana del corpus AnCora y establece una versión puramente sintáctica a partir de sus estructuras de constituyentes. Se crean dos modelos de dependencias, Temporal and Discourse Dependencies, que usan la versión básica como entrada y la adaptan de forma automática a las versiones orientadas en las tareas específicas. Las versiones resultantes se evalúan a través de métodos de análisis de redes, que confirman la adecuación de estas nuevas estructuras de dependencias para las respectivas tareas.
26
Nilsson, Jens. „Tree Transformations in Inductive Dependency Parsing“. Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-1205.
Der volle Inhalt der QuelleAnnotation:
This licentiate thesis deals with automatic syntactic analysis, or parsing, of natural languages. A parser constructs the syntactic analysis, which it learns by looking at correctly analyzed sentences, known as training data. The general topic concerns manipulations of the training data in order to improve the parsing accuracy.
Several studies using constituency-based theories for natural languages in such automatic and data-driven syntactic parsing have shown that training data, annotated according to a linguistic theory, often needs to be adapted in various ways in order to achieve an adequate, automatic analysis. A linguistically sound constituent structure is not necessarily well-suited for learning and parsing using existing data-driven methods. Modifications to the constituency-based trees in the training data, and corresponding modifications to the parser output, have successfully been applied to increase the parser accuracy. The topic of this thesis is to investigate whether similar modifications in the form of tree transformations to training data, annotated with dependency-based structures, can improve accuracy for data-driven dependency parsers. In order to do this, two types of tree transformations are in focus in this thesis.
%This is a topic that so far has been less studied.
The first one concerns non-projectivity. The full potential of dependency parsing can only be realized if non-projective constructions are allowed, which pose a problem for projective dependency parsers. On the other hand, non-projective parsers tend, among other things, to be slower. In order to maintain the benefits of projective parsing, a tree transformation technique to recover non-projectivity while using a projective parser is presented here.
The second type of transformation concerns linguistic phenomena that are possible but hard for a parser to learn, given a certain choice of dependency analysis. This study has concentrated on two such phenomena, coordination and verb groups, for which tree transformations are applied in order to improve parsing accuracy, in case the original structure does not coincide with a structure that is easy to learn.
Empirical evaluations are performed using treebank data from various languages, and using more than one dependency parser. The results show that the benefit of these tree transformations used in preprocessing and postprocessing to a large extent is language, treebank and parser independent.
27
Xiao, Wei. „A dependency-based parser evaluation method“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq23555.pdf.
Der volle Inhalt der Quelle
28
Arai, Yusuke, Masato Hagiwara, Yasuhiro Ogawa und Katsuhiko Toyama. „KWISC — Dependency visualization for understanding context“. IEEE, 2009. http://hdl.handle.net/2237/13922.
Der volle Inhalt der Quelle
29
König, Malin A. E. „Context dependency of plant – animal interactions“. Doctoral thesis, Stockholms universitet, Institutionen för ekologi, miljö och botanik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-101067.
Der volle Inhalt der QuelleAnnotation:
The strength and direction of interactions between organisms vary spatially across the landscape. Traditionally, the focus has been on how trait variation affects the interactions between species. However, differences in abiotic and biotic environmental factors may also alter the distribution, phenology and behavior of the interacting species. To be able to understand why an interaction varies across the landscape, the effects of trait variation has to be separated from the effects of the environmental context. In this thesis, I try to separate the effects of context and trait differences on plant resistance against herbivory, through experimental and observational studies conducted with two cytotypes of the perennial herb Cardamine pratensis and its main herbivore, Anthocharis cardamines. The results show that differences in plant resistance against oviposition under controlled conditions were mainly mediated by flower size; larger flowers were more attractive to the female butterfly. However, among-populations differences in oviposition under natural conditions were not related to the resistance observed under controlled conditions, or to ploidy type, flowering phenology or plant size. Within populations under natural conditions the oviposition patterns by A. cardamines was affected by the plant traits plant size and flowering phenology. The result of this thesis shows that among-population differences in intensity of plant-herbivore interactions were caused by differences in environmental context rather than by herbivore preferences for any phenotypic plant traits, while host plant selection within population was based on plant traits. This suggests that biotic and biotic context can have important effects on the intensity of plant-herbivore interactions. Although genetic traits influenced the outcome of the interaction within populations, it was the environmental context of the populations that determined largely if the interaction took place or not.At the time of the doctoral defence the following papers were unpublished and had a status as follows: Paper 2: Manuscript in review in Plos One; Paper 3: Manuscript in review in Ecological Entomology; Paper 4: Manuscript
30
Sarin, Philip D. (Philip Daman) 1977. „An unsupervised head-dependency language model“. Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86510.
Der volle Inhalt der Quelle
31
Causevic, Azra. „Data Dependency Analysis in Industrial Systems“. Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-29583.
Der volle Inhalt der QuelleAnnotation:
Software in modern industrial systems may have complex data dependencies. As a result of this, it can be hard for system developers to understand the system’s behavior, if they cannot explicitly see these dependencies. This thesis addresses this problem, with an emphasis on dependencies among data in systems built using the IEC 61499 standard. An analysis method was developed, with which we are able to extract data dependency information from basic and composite function blocks. The first step of handling this problem is to investigate how the data dependencies occur in IEC 61499. The second step is to create a formal definition of IEC 61499 elements that were needed in order to formulate the analysis method. Next, we define a dependency matrix, in which we store the information regarding dependencies between input and output data ports. Later, we formulate the necessary algorithms for data dependency analysis in basic and composite function blocks. Finally, the last piece of the puzzle is to develop a plug-in for Framework for Distributed Industrial Automation and Control – Integrated Development Environment. This plug-in is used to show that the analysis method is efficient and that the proposed analysis is applicable to IEC 61499 systems.
32
Su, Peng. „Signal Dependency Analysisand Status Propagation Tracking“. Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-276770.
Der volle Inhalt der QuelleAnnotation:
In software engineering, analyzing the dependence of software modules and signals is a common method of verification and testing software behaviors. Through dependency analysis, users can improve the quality and operating efficiency of the code. Also, analyzing dependencies can reflect the working status of software modules. Software signal dependence is thus very important for software verification. However, how to perform the dependency analysis is an open question. Code review is a text-based analysis method. When faced with many dependencies, the readability is significantly reduced. It is also difficult for a code reviewer to track all dependencies on a single signal. By contrast, visual dependency is a relatively intuitive analysis method, which can express the dependency of signals visually.This thesis deals with the analysis and visualization of signal dependencies in the Engine Management System (EMS), which is an essential and complex software module in vehicles. There are usually hundreds of function modules in the EMS. Understanding their dependencies can help engineers diagnose and test the system accordingly. This topic has the following difficulties: (1) how to summarize the dependence of all elements from the source code; (2) how to express dependence; (3) how to visualize dependencies; (4) what tools are needed to achieve visualization of dependencies.To solve the above problems, we need to establish a corresponding toolchain. First, we use static analysis to extract dependencies from the source code. The static analysis here refers to use scripts to automatically analyze dependencies in the source code. The script includes setting up a parser to collect data. The purpose of the parser is to parse the pre-processing code and generate the corresponding intermediate file, which needs to indicate signal dependencies and other basic information. Then, we evaluate the analysis results and choose an appropriate visualization tool to represent the signal dependency. The results show that the signal dependency can be tracked, and the visualization can be implemented by using our designed toolchain. The results are intuitive and concise, and it has a strong application prospect.I mjukvaruteknik är analys av beroende av mjukvarumoduler och signaler en vanlig metod för verifiering och testning av mjukvarubeteenden. Genom beroendeanalys kan användare förbättra kodens kvalitet och driftseffektivitet. Analys av beroenden kan också spegla arbetsstatus för mjukvarumoduler. Programsignalberoende är alltså mycket viktigt för programvaruverifiering. Hur man gör beroende-analysen är dock en öppen fråga. Kodgranskning är en textbaserad analysmetod. Vid många beroenden minskar läsbarheten avsevärt. Det är också svårt för en kodgranskare att spåra alla beroenden på en enda signal. Däremot är visuellt beroende en relativt intuitiv analysmetod, som visuellt kan uttrycka signalberoende.Denna avhandling behandlar analys och visualisering av signalberoenden i Engine Management System, som är en väsentlig och komplex mjukvarumodul i fordon. Det finns vanligtvis hundratals funktionsmoduler i EMS. Att förstå deras beroende kan hjälpa ingenjörer att diagnostisera och testa systemet i enlighet därmed. Detta ämne har följande svårigheter. (1) för att sammanfatta beroendet av alla element från källkoden; (2) hur man uttrycker beroende; (3) hur man kan visualisera beroenden; (4) vilka verktyg som behövs för att uppnå visualisering av beroenden.För att lösa ovanstående problem måste vi skapa en motsvarande verktygskedja. Först använder vi statisk analys för att extrahera beroenden från källkoden. Den statiska analysen hänvisar här till användningen av skript för att automatiskt analysera beroenden i källkoden, vilket inkluderar att ställa in en parser för att samla data från källkoden. Syftet med parsaren är att analysera förbehandlingskoden och generera motsvarande data. Uppgifterna måste indikera signalberoende och annan grundläggande information. Sedan väger vi analysresultaten och väljer lämpligt visualiseringsverktyg för att representera signalberoendet. Resultaten vi erhöll visar att signalberoendet kan spåras och visualiseringen kan implementeras med vår designade verktygskedja. Resultaten är intuitiva och kortfattade och det har en stark applikationsutsikter.
33
Domke, Jens. „Routing on the Channel Dependency Graph:“. Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225902.
Der volle Inhalt der QuelleAnnotation:
In the pursuit for ever-increasing compute power, and with Moore's law slowly coming to an end, high-performance computing started to scale-out to larger systems. Alongside the increasing system size, the interconnection network is growing to accommodate and connect tens of thousands of compute nodes. These networks have a large influence on total cost, application performance, energy consumption, and overall system efficiency of the supercomputer. Unfortunately, state-of-the-art routing algorithms, which define the packet paths through the network, do not utilize this important resource efficiently. Topology-aware routing algorithms become increasingly inapplicable, due to irregular topologies, which either are irregular by design, or most often a result of hardware failures. Exchanging faulty network components potentially requires whole system downtime further increasing the cost of the failure. This management approach becomes more and more impractical due to the scale of today's networks and the accompanying steady decrease of the mean time between failures. Alternative methods of operating and maintaining these high-performance interconnects, both in terms of hardware- and software-management, are necessary to mitigate negative effects experienced by scientific applications executed on the supercomputer. However, existing topology-agnostic routing algorithms either suffer from poor load balancing or are not bounded in the number of virtual channels needed to resolve deadlocks in the routing tables.
Using the fail-in-place strategy, a well-established method for storage systems to repair only critical component failures, is a feasible solution for current and future HPC interconnects as well as other large-scale installations such as data center networks. Although, an appropriate combination of topology and routing algorithm is required to minimize the throughput degradation for the entire system. This thesis contributes a network simulation toolchain to facilitate the process of finding a suitable combination, either during system design or while it is in operation. On top of this foundation, a key contribution is a novel scheduling-aware routing, which reduces fault-induced throughput degradation while improving overall network utilization. The scheduling-aware routing performs frequent property preserving routing updates to optimize the path balancing for simultaneously running batch jobs. The increased deployment of lossless interconnection networks, in conjunction with fail-in-place modes of operation and topology-agnostic, scheduling-aware routing algorithms, necessitates new solutions to solve the routing-deadlock problem. Therefore, this thesis further advances the state-of-the-art by introducing a novel concept of routing on the channel dependency graph, which allows the design of an universally applicable destination-based routing capable of optimizing the path balancing without exceeding a given number of virtual channels, which are a common hardware limitation. This disruptive innovation enables implicit deadlock-avoidance during path calculation, instead of solving both problems separately as all previous solutions.
34
Mirroshandel, Seyedabolghasem. „Towards less supervision in dependency parsing“. Thesis, Aix-Marseille, 2015. http://www.theses.fr/2015AIXM4096/document.
Der volle Inhalt der QuelleAnnotation:
Analyse probabiliste est l'un des domaines de recherche les plus attractives en langage naturel En traitement. Analyseurs probabilistes succès actuels nécessitent de grandes treebanks qui Il est difficile, prend du temps et coûteux à produire. Par conséquent, nous avons concentré notre l'attention sur des approches moins supervisés. Nous avons proposé deux catégories de solution: l'apprentissage actif et l'algorithme semi-supervisé. Stratégies d'apprentissage actives permettent de sélectionner les échantillons les plus informatives pour annotation. La plupart des stratégies d'apprentissage actives existantes pour l'analyse reposent sur la sélection phrases incertaines pour l'annotation. Nous montrons dans notre recherche, sur quatre différents langues (français, anglais, persan, arabe), que la sélection des phrases complètes ne sont pas une solution optimale et de proposer un moyen de sélectionner uniquement les sous-parties de phrases. Comme nos expériences ont montré, certaines parties des phrases ne contiennent aucune utiles information pour la formation d'un analyseur, et en se concentrant sur les sous-parties incertains des phrases est une solution plus efficace dans l'apprentissage actifProbabilistic parsing is one of the most attractive research areas in natural language processing. Current successful probabilistic parsers require large treebanks which are difficult, time consuming, and expensive to produce. Therefore, we focused our attention on less-supervised approaches. We suggested two categories of solution: active learning and semi-supervised algorithm. Active learning strategies allow one to select the most informative samples for annotation. Most existing active learning strategies for parsing rely on selecting uncertain sentences for annotation. We show in our research, on four different languages (French, English, Persian, and Arabic), that selecting full sentences is not an optimal solution and propose a way to select only subparts of sentences. As our experiments have shown, some parts of the sentences do not contain any useful information for training a parser, and focusing on uncertain subparts of the sentences is a more effective solution in active learning
35
Shotton, Margret Anne. „An exploratory study of computer dependency“. Thesis, Loughborough University, 1988. https://dspace.lboro.ac.uk/2134/11210.
Der volle Inhalt der QuelleAnnotation:
This research was initiated to investigate the syndrome of computer dependency, and to ascertain whether there was any foundation to the apocryphal stories which suggested that 'obsessive' dependency by some people upon computers and computing was detrimental to their psychological and social development. National publicity brought forth volunteers who considered themselves to be dependent upon computers. As a group they did not form a cross-section of the general population but consisted in the main of very well educated, adult males. (An additional study showed that there were distinct differences between the sexes in attitudes held towards computers to account for this lack of balance). As the computer dependent individuals were unrepresentative of the general population, control groups were established with whom comparisons could be made, matched with them on the criteria of sex, age and highest educational level. One control group was formed from computer owners who were not computer dependent and the other from people Who did not own a computer. Thus three groups were studied; a computer dependent group and two controls. The results established that the two computer-owning groups differed significantly from each other in their preferred computing activities, both quantitatively and qualitatively. As anticipated, the computer dependent individuals spent significantly more time computing than the others, but they were also found to use computers in a more exploratory and self-educational manner, rarely having a definite end-product in mind. All three groups were found to have enjoyed different types of hobbies throughout their lives. The computer dependent group had shown interests in technological and scientific artefacts before school age and rarely partook of either the social or physical activities of interest to the control groups. The dependent group had found in the computer the ultimate hobby; one which was constantly stimulating and exciting and which matched their psychological needs. Investigation of the social and psychological issues suggested that the group of computer dependent people had experienced different types of parenting from the control groups, leading them to become object- rather than people-centred at an early age. This bias had been perpetuated throughout life, leaving them shy and unable to form satisfactory relationships; they neither trusted humans nor needed them in many cases. Their lives had become dominated by task- and object-related activities, with the computer offering them a controllable form of interaction Which they had been unable to find elsewhere. Deleterious effects occurred within some marriages Where one spouse had become computer dependent, but only en very rare occasions did individuals express distress about their dependency. Tb the contrary, the positive benefits gained by their use of computers far outweighed any disadvantages. The research disproved the hypothesis that computer dependency was in general detrimental to the individuals' social and psychological development, and suggested that computer dependency was in fact therapeutic by providing an outlet for their high levels of curiosity and originality. Computing had brought them intellectual stimulation rarely found when interacting with the majority of humans and had provided a level of fulfilment to which many would aspire.
36
Baloch, Raheel Ali. „Context dependency analysis in ubiquitous computing“. Phd thesis, Institut National des Télécommunications, 2012. http://tel.archives-ouvertes.fr/tel-00714129.
Der volle Inhalt der QuelleAnnotation:
To provide users with personalized adaptive services only using the accessible computing resources in a cloud environment, context aware applications need to assimilate both the accessed and derived context, i.e. a combination of more than one sensed data and information in the environment. Context data dependency, dependency that arises between the context data producer and consumer, may get introduced in a system due to numerous reasons. But as the number of context dependencies for a service increases, the more complex the system becomes to manage. The thesis addresses issues of how to identify context dependencies, represent such context dependencies and then reduce them in a system. In the first part of the thesis, we present two efficient approaches to determine context dependency relations among various services in ubiquitous computing environment to help better analyse the pervasive services. One approach is based on graph theory, and we have used the topological sort to determine the context dependencies. The second approach is based on solving constraint networks which determines whether an entity is affected when the state of a certain other entity has its state changed, i.e. determining the dynamic nature of context dependency. In the second part of the thesis, we present a mode for representation of context dependencies within a system. Our model that represents context dependencies is based on set theory and first-order predicate logic. The context dependency representation model also represents alternative sources for context acquisition that can be utilized in a case in which the preferred context producers are not available to service the desired context to the relevant context consumer any more. Further, we try to reduce the context dependencies by presenting the idea of profile context, which is based on the proposal of an open framework for context acquisition, management and distribution. This heuristic approach is based on the idea of utilizing mobile nodes in an ad hoc overlay network with more resources than the context producer itself to store various contextual information under the banner of profile context, and further, provide profile context instead of each context individually based on the queries the nodes receive from the context consumers. Bringing together the context information and context updates from various sources, support for context aware decisions can be implemented efficiently in a mobile environment by addressing the issues of context dependency using profile context
37
Baloch, Raheel Ali. „Context dependency analysis in ubiquitous computing“. Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2012. http://www.theses.fr/2012TELE0004.
Der volle Inhalt der QuelleAnnotation:
Pour fournir aux utilisateurs des services personnalisés d'adaptation en utilisant uniquement les ressources informatiques accessibles dans un environnement de cloud computing, les applications contexte, conscients besoin d'assimiler à la fois le contexte accessible et dérivés, c'est à dire une combinaison de plus d'un senti données et d'informations dans l'environnement. Contexte des données de dépendance, la dépendance qui se pose entre le contexte des données du producteur et du consommateur, peut se présenter dans un système en raison de nombreuses raisons. Mais comme le nombre de dépendances de contexte pour une augmentation des services, la plus complexe, le système devient à gérer. La thèse aborde les questions de la façon d'identifier les dépendances de contexte, représentent des dépendances de contexte tels, puis les réduire dans un système. Dans la première partie de la thèse, nous présentons deux approches efficaces pour déterminer les relations de dépendance entre les différents services du contexte dans l'environnement informatique ubiquitaire pour aider à mieux analyser les services omniprésents. Une approche est basée sur la théorie des graphes, et nous avons utilisé le tri topologique pour déterminer les dépendances de contexte. La deuxième approche est basée sur la résolution des réseaux de contraintes qui détermine si une entité est affectée lorsque l'état d'une certaine entité autre a changé son état, c.-à-détermination de la nature dynamique de la dépendance contexte. Dans la deuxième partie de la thèse, nous présentons un mode de représentation des dépendances de contexte au sein d'un système. Notre modèle qui représente les dépendances de contexte est basé sur la théorie des ensembles et la logique des prédicats du premier ordre. Le modèle de représentation contexte de dépendance représente également d'autres sources pour l'acquisition de contexte qui peuvent être utilisés dans une affaire dans laquelle les producteurs contexte privilégiées ne sont pas disponibles pour desservir le contexte souhaité pour le consommateur un contexte pertinent, pas plus. En outre, nous essayons de réduire les dépendances de contexte en présentant l'idée du contexte de profil, qui est basé sur la proposition d'un cadre ouvert pour l'acquisition de contexte, la gestion et la distribution. Cette approche heuristique est basée sur l'idée d'utiliser les nœuds mobiles dans un réseau ad hoc avec superposition de plus de ressources que le producteur lui-même contexte pour stocker diverses informations contextuelles sous la bannière du contexte profil, et en outre, fournir le contexte profil au lieu de chaque contexte individuellement sur la base sur les requêtes des nœuds reçoivent des consommateurs contexte. Réunissant les informations de contexte et de mises à jour de contexte à partir de diverses sources, le soutien aux décisions contexte, conscients peut être mis en œuvre efficacement dans un environnement mobile en s'attaquant aux problèmes de dépendance en utilisant le contexte contexte profilTo provide users with personalized adaptive services only using the accessible computing resources in a cloud environment, context aware applications need to assimilate both the accessed and derived context, i.e. a combination of more than one sensed data and information in the environment. Context data dependency, dependency that arises between the context data producer and consumer, may get introduced in a system due to numerous reasons. But as the number of context dependencies for a service increases, the more complex the system becomes to manage. The thesis addresses issues of how to identify context dependencies, represent such context dependencies and then reduce them in a system. In the first part of the thesis, we present two efficient approaches to determine context dependency relations among various services in ubiquitous computing environment to help better analyse the pervasive services. One approach is based on graph theory, and we have used the topological sort to determine the context dependencies. The second approach is based on solving constraint networks which determines whether an entity is affected when the state of a certain other entity has its state changed, i.e. determining the dynamic nature of context dependency. In the second part of the thesis, we present a mode for representation of context dependencies within a system. Our model that represents context dependencies is based on set theory and first-order predicate logic. The context dependency representation model also represents alternative sources for context acquisition that can be utilized in a case in which the preferred context producers are not available to service the desired context to the relevant context consumer any more. Further, we try to reduce the context dependencies by presenting the idea of profile context, which is based on the proposal of an open framework for context acquisition, management and distribution. This heuristic approach is based on the idea of utilizing mobile nodes in an ad hoc overlay network with more resources than the context producer itself to store various contextual information under the banner of profile context, and further, provide profile context instead of each context individually based on the queries the nodes receive from the context consumers. Bringing together the context information and context updates from various sources, support for context aware decisions can be implemented efficiently in a mobile environment by addressing the issues of context dependency using profile context
38
Giullari, Susanna. „Comparing kin support for lone mothers in Italy and England : moral autonomies, kin relations and social rights“. Thesis, University of Warwick, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.269233.
Der volle Inhalt der Quelle
39
SAKAI, Masahiko, und Keiichirou KUSAKARI. „On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems“. IEICE, 2005. http://hdl.handle.net/2237/9579.
Der volle Inhalt der Quelle
40
Scholz, Mario. „Deterministic dependency parsing of unrestricted English text“. Thesis, Växjö University, School of Mathematics and Systems Engineering, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-360.
Der volle Inhalt der QuelleAnnotation:
This master’s thesis describes a deterministic dependency parser using a memorybased
learning approach to parse unrestricted English text. A converter transforms
the Wall Street Journal section of the Penn Treebank to an intermediate dependency
representation which is used to train the parser using the TiMBL (Daelemans, Zavrel,
Sloot, & Bosch, 2003) library. The output of the parser is labeled dependency graphs,
using as arc labels a combination of bracket labels and grammatical role labels constructed
from the Penn Treebank II annotation scheme (Marcus, Kim, et al., 1994). The
parser reaches a maximum unlabeled attachment score of 87.1% and produces labeled
dependency graphs with an accuracy of of 86.0% with the correct head and arc label
recognised. The results are close to the state of the art in dependency parsing, and the
parser also outputs arc labels that other parsers do not produce.
41
Macleod, Angus Donald. „Predicting mortality and dependency in Parkinson's disease“. Thesis, University of Aberdeen, 2015. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=230050.
Der volle Inhalt der QuelleAnnotation:
This thesis aimed to improve our understanding of prognosis in Parkinson's disease (PD) in terms of two imporatant outcomes: death and dependency. 88 studies were included in a systematic review of mortality in PD. Inception studies (recruiting patients at diagnosis) provided more consistent results than non-inception studies, with 50% higher mortality that in people without PD. Survival declined, on average, by 5% per year, but hospital-based studies consistently reported higher survival than community-based studies. 23 studies were included in a systematic review of activity limitation (difficulty with activities of daily living) and progression to dependency (the need for help with basic activities of daily living). Heterogeneity prevented quantitative analysis. Recommendations for future studies were developed. The rest of the thesis consists of analyses of the PINE study, a community-based, incident cohort of PD in North-East Scotland with 198 patients followed for up to 12 years. The mortality rate in PD was 8 per 100-person-years and was increased 1.5-fold compared to poulation mortality. Survival probabilities were lower than most previously reported. The rates of development of sustained dependency and "death or sustained dependency" were 14 and 16 per 100-person-years, respectively, in those independent at diagnosis. Older age, male gender, worse bradykinesia, more severe axial signs relative to limb signs, and higher co-morbidity (witih effect only early in the disease course) were independent baseline predictors of mortality in multivariable Cox regression. Increasing age, more smoking, worse bradykinesia, more axial signs relative to limb signs, and poorer cognitive function were independent baseline prognostic factors for both increased dependency and "death or dependency". These prognostic factors were combined into prognostic models for the three outcomes using Weibull parametric survival modelling and were internally vali There are several potential important uses for these models, in clinical practice and in research, subject to external validation.
42
Axelsson, Nils. „Dynamic Programming Algorithms for Semantic Dependency Parsing“. Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138594.
Der volle Inhalt der QuelleAnnotation:
Dependency parsing can be a useful tool to allow computers to parse text. In 2015, Kuhlmann and Jonsson proposed a logical deduction system that parsed to non-crossing dependency graphs with an asymptotic time complexity of O(n3), where “n” is the length of the sentence to parse. This thesis extends the deduction system by Kuhlmann and Jonsson; the extended deduction system introduces certain crossing edges, while maintaining an asymptotic time complexity of O(n4). In order to extend the deduction system by Kuhlmann and Jonsson, fifteen logical item types are added to the five proposed by Kuhlmann and Jonsson. These item types allow the deduction system to intro-duce crossing edges while acyclicity can be guaranteed. The number of inference rules in the deduction system is increased from the 19 proposed by Kuhlmann and Jonsson to 172, mainly because of the larger number of combinations of the 20 item types. The results are a modest increase in coverage on test data (by roughly 10% absolutely, i.e. approx. from 70% to 80%), and a comparable placement to that of Kuhlmann and Jonsson by the SemEval 2015 task 18 metrics. By the method employed to introduce crossing edges, derivational uniqueness is impossible to maintain. It is hard to defien the graph class to which the extended algorithm, QAC, parses, and it is therefore empirically compared to 1-endpoint crossing and graphs with a page number of two or less, compared to which it achieves lower coverage on test data. The QAC graph class is not limited by page number or crossings. The takeaway of the thesis is that extending a very minimal deduction system is not necessarily the best approach, and that it may be better to start off with a strong idea of to which graph class the extended algorithm should parse. Additionally, several alternative ways of extending Kuhlmann and Jonsson are proposed.Dependensparsning kan vara ett användbart verktyg för att få datorer att kunna läsa text. Kuhlmann och Jonsson kom 2015 fram till ett logiskt deduktionssystem som kan parsa till ickekorsande grafer med en asymptotisk tidskomplexitet O(n3), där "n" är meningens som parsas längd. Detta arbete utökar Kuhlmann och Jonssons deduktionssystem så att det kan introducera vissa korsande bågar, medan en asymptotisk tidskomplexitet O(n4) uppnås. För att tillåta deduktionssystemet att introducera korsande bågar, introduceras 15 nya logiska delgrafstyper, eller item. Dessa item-typer tillåter deduktionssystemet att introducera korsande bågar på ett sådant sätt att acyklicitet bibehålls. Antalet logiska inferensregler tags från Kuhlmanns och Jonssons 19 till 172, på grund av den större mängden kombinationer av de nu 20 item-typerna. Resultatet är en mindre ökning av täckning på testdata (ungefär 10 procentenheter, d v s från cirka 70% till 80%), och jämförbar placering med Kuhlmann och Jonsson enligt måtten från uppgift 18 från SemEval 2015. Härledningsunikhet kan inte garanteras på grund av hur bågar introduceras i det nya deduktionssystemet. Den utökade algoritmen, QAC, parsar till en svårdefinierad grafklass, som jämförs empiriskt med 1-endpoint-crossing-grafer och grafer med pagenumber 2 eller mindre. QAC:s grafklass har lägre täckning än båda dessa, och har ingen högre gräns i pagenumber eller antal korsningar. Slutsatsen är att det inte nödvändigtvis är optimalt att utöka ett mycket minimalt och specifikt deduktionssystem, och att det kan vara bättre att inleda processen med en specifik grafklass i åtanke. Dessutom föreslås flera alternativa metoder för att utöka Kuhlmann och Jonsson.
43
Gylling, Joakim. „Transition-Based Dependency Parsing with Neural Networks“. Thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138596.
Der volle Inhalt der QuelleAnnotation:
Dependency parsing is important in contemporary speech and language processing systems. Current dependency parsers typically use the multi-class perceptron machine learning component, which classifies based on millions of sparse indicator features, making developing and maintaining these systems expensive and error-prone. This thesis aims to explore whether replacing the multi-class perceptron component with an artificial neural network component can alleviate this problem without hurting performance, in terms of accuracy and efficiency. A simple transition-based dependency parser using the artificial neural network (ANN) as the classifier is written in Python3 and the same program with the classifier replaced by a multi-class perceptron component is used as a baseline. The results show that the ANN dependency parser provides slightly better unlabeled attachment score with only the most basic atomic features, eliminating the need for complex feature engineering. However, it is about three times slower and the training time required for the ANN is significantly longer.
44
Karakaya, Gungor. „Essays on population ageing, dependency and overeducation“. Doctoral thesis, Universite Libre de Bruxelles, 2008. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210405.
Der volle Inhalt der QuelleAnnotation:
The main objective of this thesis is to analyze the problem of population ageing in terms of the cessation of professional activity (and especially premature labour market withdrawals) and non-medical care needs of persons who are dependent or have lost their autonomy, in order to provide the various public and private administrations active in these fields with some food for thought.Doctorat en Sciences économiques et de gestion
info:eu-repo/semantics/nonPublished
45
Yin, Bo Electrical Engineering & Telecommunications Faculty of Engineering UNSW. „Language identification with language and feature dependency“. Awarded By:University of New South Wales. Electrical Engineering & Telecommunications, 2009. http://handle.unsw.edu.au/1959.4/44045.
Der volle Inhalt der QuelleAnnotation:
The purpose of Language Identification (LID) is to identify a specific language from a spoken utterance, automatically. Language-specific characteristics are always associated with different languages. Most existing LID approaches utilise a statistical modelling process with common acoustic/phonotactic features to model specific languages while avoiding any language-specific knowledge. Great successes have been achieved in this area over past decades. However, there is still a huge gap between these languageindependent methods and the actual language-specific patterns. It is extremely useful to address these specific acoustic or semantic construction patterns, without spending huge labour on annotation which requires language-specific knowledge. Inspired by this goal, this research focuses on the language-feature dependency. Several practical methods have been proposed. Various features and modelling techniques have been studied in this research. Some of them carry out additional language-specific information without manual labelling, such as a novel duration modelling method based on articulatory features, and a novel Frequency-Modulation (FM) based feature. The performance of each individual feature is studied for each of the language-pair combinations. The similarity between languages and the contribution in identifying a language by using a particular feature are defined for the first time, in a quantitative style. These distance measures and languagedependent contributions become the foundations of the later-presented frameworks ?? language-dependent weighting and hierarchical language identification. The latter particularly provides remarkable flexibility and enhancement when identifying a relatively large number of languages and accents, due to the fact that the most discriminative feature or feature-combination is used when separating each of the languages. The proposed systems are evaluated in various corpora and task contexts including NIST language recognition evaluation tasks. The performances have been improved in various degrees. The key techniques developed for this work have also been applied to solve a different problem other than LID ?? speech-based cognitive load monitoring.
46
Mudie, Robyn. „Vietnamese underdevelopment : a case for socialist dependency? /“. Title page, contents and introduction only, 1989. http://web4.library.adelaide.edu.au/theses/09AR/09armm945.pdf.
Der volle Inhalt der Quelle
47
Chai, Shaojin. „Taiwanese nationalism situation dependency and elite games /“. online access from Digital Dissertation Consortium, 2007. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?1446934.
Der volle Inhalt der Quelle
48
Ophir, Adi. „Functional dependency detection: an information theoretic algorithm“. Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=32553.
Der volle Inhalt der QuelleAnnotation:
There are many statistical measures of correlation, such as Pearson's correlation coefficient for real random variables, the chi-square statistic for discrete random variables, and mutual information. Most such measures are symmetric and do not allow detection of influence direction. We propose a novel information theory measure whose value indicates direction of functional dependency. The measure calculation algorithm is performed on real-valued data being quantized into bins. This quantization is a corner stone of the algorithm suggested, as it affects both the statistical significance between the variables being tested for dependency and the numeric strength of dependency.Il existe de nombreuses mesures statistiques de corrélation, tels que le Pearson coefficient de corrélation des variables aléatoires, le chi-carré pour les variables aléatoires discrètes et, finalement, l'information mutuelle. La plupart de ces mesures sont symétriques et ne pas permettre la détection d'influence. Nous proposons une nouvelle mesure de l'information-théorique dont la valeur indique la direction de le dépendence fonctionnelle. La mesure algorithme de calcul est effectué sur la valeur réelle de données quantifiées en bacs. Cette quantification est une fondation de l'algorithme proposé, car elle informe à la fois la signification statistique entre les variables et la force de la dépendance.
49
Shahtahmasebi, Said. „Statistical modelling of dependency in old age“. Thesis, Bangor University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318077.
Der volle Inhalt der Quelle
50
Chisala, Victoria. „Foreign aid dependency : the case of Zambia“. Thesis, SOAS, University of London, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.441967.
Der volle Inhalt der Quelle