Dissertations / Theses on the topic 'Hierarchy'
To see the other types of publications on this topic, follow the link: Hierarchy.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Hierarchy.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Poças, Jacinta Rodrigues. "Leibniz hierarchy." Master's thesis, Universidade de Aveiro, 2009. http://hdl.handle.net/10773/2916.
Full textAbstract:
Mestrado em MatemáticaA Lógica Algébrica Abstracta estuda o processo pelo qual uma classe de álgebras pode ser associada a uma lógica. Nesta dissertação, analisamos este processo agrupando lógicas partilhando certas propriedades em classes. O conceito central neste estudo é a congruência de Leibniz que assume o papel desempenhado pela equivalência no processo tradicional de Lindenbaum- Tarski. Apresentamos uma hierarquia entre essas classes que é designada por hierarquia de Leibniz, caracterizando as lógicas de cada classe por propriedades meta-lógicas, por exemplo propriedades do operador de Leibniz. Estudamos também a recente abordagem comportamental que usa lógicas multigénero, lógica equacional comportamental e, consequentemente, uma versão comportamental do operador de Leibniz. Neste contexto, apresentamos alguns exemplos, aos quais aplicamos esta nova teoria, capturando alguns fenómenos de algebrização que não era possível formalizar com a abordagem standard. ABSTRACT: Abstract Algebraic logic studies the process by which a class of algebras can be associated with a logic. In this dissertation, we analyse this process by grouping logics sharing certain properties into classes. The central concept in this study is the Leibniz Congruence that assumes the role developed by the equivalence in the traditional Lindenbaum-Tarski process. We show a hierarchy between these classes, designated by Leibniz hierarchy, by characterizing logics in each class by meta-logical properties, for example properties of the Leibniz operator. We also study a recent behavioral approach which uses many-sorted logics, behavioral equational logic and, consequently, a behavioral version of the Leibniz operator. In this context, we provide some examples, to which we apply this new theory, capturing some phenomena of algebraization that are not possible to formalize using the standard approach.
2
Taylor, Christopher Michael. "Hierarchy in honeycombs." Thesis, University of Exeter, 2012. http://hdl.handle.net/10036/3884.
Full textAbstract:
The main aim of this project was to examine the effects of introducing hierarchy into honeycombs and determining the variables that preside over the global response of the structure. Specifically to understand how the in and out-of-plane elastic and non-linear plastic properties of honeycombs were affected by hierarchy. Analytical analysis of hierarchical honeycombs has been used to explain and predict the response of finite element simulations validated by experimental investigations. The early stage of the investigation focused on finding if the elastic modulus could be maintained or improved on an equal density basis due to the introduction of hierarchy. It is clear that honeycombs are sensitive to hierarchical sub-structures, particularly the fraction of mass shared between the super-and sub-structures. Introduction of an additional level of hierarchy without reducing performance is difficult, but was possible by functional grading. Another original result was that it was determined when the sub-structure could be assumed to be a continuum of the super-structure. Meaning the material properties from a single unit sub-cell could be used as the constituent material properties of the super-structure, as in previous work by (Lakes 1993) and (Carpinteri et al 2009) for example. Work investigating the in-plane, non-linear plastic response of hierarchical honeycombs showed that the introduction of hierarchy into honeycombs can have the effect of delaying the onset of elastic buckling, which is a common failure mechanism for low relative density structures. As such it was possible to achieve a marked increase in the recoverable energy absorbed by hierarchical honeycombs prior to elastic buckling or plastic yield. The potential benefits are less apparent in higher relative density structures due to the onset of plasticity becoming the first mode of failure. The out-of-plane properties also investigated showed no increase in the elastic properties due to the introduction of hierarchy, but showed a marked increase in the out-of-plane elastic buckling stress of 60% when compared to a conventional hexagonal honeycomb of the same relative density.
3
Whittle, Bruno. "Paradox and hierarchy." Thesis, University of Oxford, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410999.
Full text
4
Galloway, Alasdair. "Maintenance of hierarchy." Thesis, University of Glasgow, 1990. http://theses.gla.ac.uk/1972/.
Full textAbstract:
This work considers how it is that company structures, based on hierarchy, are able to persist over time. This question, though simple, is basic to industrial society, since although business organizations do in general operate with sufficient cohesion to produce their goods/services for sale, the traditional hierarchical structure has on occasions come under attack. Our aim will be to establish and understand the conditions under which hierarchy is able to persist - or conversely, under what conditions we might expect it to come apart. Our consideration does not however, preclude the possibility that the attack on hierarchy is more apparent than real - that any attack is at the level of limited ideology rather than social praxis. Hence it will be our position that we shall suspend belief in the persistence of the hierarchical structure and in this way be able to consider the conditions both for its persistence, and also for any challenge to be made to it. By pursuing the initial problem in this way we do not preclude the possibility of either 1) the permanence of hierarchy, or 2) the inevitability of its replacement with more/less democratic structures. Our aim is to understand the conditions for the persistence of hierarchical structures, and by implication the conditions under which they may be challenged by more democratic structures. There are two important features to our theoretical perspective: A) the process of knowledge selection to produce and structure expectations, B) a theory of power to structure the situation in which these expectations are made. In respect of the former we shall rely heavily on the work of Schutz, Habermas, and of Laing and Esterson, while for the latter we shall consider Lukes' three dimensional theory of power, developed from the perspective of Habermas, and in particular his Ideal Speech Thesis. This will result in a theory of the Lifeworld, which while substantially consistent with Schutz continues to establish in what respects the Lifeworld creates but conceals the possibility of the exercise of power. The importance of Schutz for us is that he provides a theoretical basis for knowledge creation for the individual social actor, and the structuring of knowledge into categories, which is consistent with our own view. We shall argue, however, that the view presented by Schutz does not take adequate account of the `restricting' or `limiting' aspects of the Lifeworld and the taken-for-grantedness (or uncritical attitude) which it sets up - that as Morgan's `Images' suggests the Lifeworld (as our `subjective stock of knowledge') can be a `Psychic Prison'. This argument in turn leads on to possible exercises of power of which the participants (ie power holder and subject) are not conscious. This will be developed by reference to Habermas's work. The importance of Lukes is his provision of an analytical framework for power, which recognises that power is a concept of greater variation than has been realised. Lukes, however, does not make sufficiently clear the meaning - particularly at the empirical level - of his third ('radical') dimension of power. For this reason we shall introduce the thesis of ideal speech, put forward by Habermas, to clarify and extend Lukes' work in a manner which is theoretically and empirically stronger, and methodologically more practical. We shall use a synthesis of Lukes and Habermas as a basis for our analysis of the social situation in which expectations are a) structured b) developed as a project in a social situation. By bringing together these two elements (ie the Habermasian adaption of Schutz and Lukes) we shall argue that individuals make expectations on their company which they develop from their Lifeworld and its subjective stock of knowledge. This process of knowledge selection and development of expectations, analytically sets a number of issues which shall be important to us in considering whether there is the social asymmetry we suggested exists as a support to existing organizational structures: 1) the knowledge selected may be so structured as to forestall the development of particular expectations, or so constrain behaviour that, in either situation, the structure of the organization goes unchallenged. 2) expectations can only be satisfied in competition with others - hence interaction with other employees will be important and particularly the Lifeworld definition of these employees (for instance competition between Management and Hourly paid may be influenced by the definition which the latter make of the former). 3) expectations shall be arbitrated upon by the company decision-making system (ie by the individual/group who have the authority to make the decision in question). At a relatively superficial level we must consider the values of this individual/group - but we have to go still deeper to understand the conditions under which this authority is regarded as legitimate or conversely regarded as illegitimate. These issues are closely connected since the legitimacy and illegitimacy or the decision-making system are largely determined - in our model - by the selection of knowledge, part of which is constituted by one's experience and/or interaction with other employees, as well as wider social knowledge which is employed by defining and interpreting the behaviour of others to develop expectations. Our perspective on this process is composed of two parts: 1) Employees make expectations of their company. 2) These expectations are generated in a process of experience and learning. We see no causal implications in this, but instead take the view that employees select from the knowledge available to them, in order to structure, guide and justify their behaviour. For instance this may be to A) justify the expectation of having more influence in their company's decision-making, and to indicate what would be appropriate behaviour to this end. Or alternatively B) indicate that this is not a reasonable expectation, and not a reasonable form of behaviour. Similarly the knowledge which is accessible can be employed to define and interpret the behaviour of relevant others in their own group and throughout the work situation -to account for, and explain what is happening, to foretell how to behave/not behave in the future. The process can, in other words, encourage or discourage the taking up of particular projects. Our particular interest is the dominance of hierarchy is maintained, restraining the development of more democratic organizational forms.
5
Soliman, Ehab Mohammed. "Delay hierarchy propagation model." Thesis, University of Plymouth, 2005. http://hdl.handle.net/10026.1/2334.
Full textAbstract:
Construction projects are always exposed to delay. Research has shown that most projects encounter delays and this problem is a global one. Previous research related to delays in construction projects have been dedicated to measuring and ranking the direct delays that have occurred. These types of delay are past delays and have already affected many aspects of the project's performance. This type of research is of the reactive type and handles delays after they have happened. The objective of this research is to model the construction project delays that can be used to predict the level of delays that the project could face during its future life. The proposed Delay Hierarchy Propagation Model (DHPM) is the first attempt to model delays in the construction project. This model is an innovative predictive approach to anticipate the future encountered delays before they become real. The model assumes that the direct delay is generated from earlier events or aspects that are found before the direct delay occurs; these events are called the root delay causes. These root delay causes need to be analysed, measured and managed in order to prevent or mitigate the effect of a later direct delay in the project life. The direct delays were analysed by a cause-effect technique to extract a set of root delay causes. The model assumes that the root delay causes will influence the project resources supply rate. The resource shortage then leads to activity delay and, hence possible delay to the whole project. The DHPM consists of two interrelated models: a Resource Shortage Possibility (RSP) model and the Predicting Project Delay model (PPD) model. The RSP model objective is to predict the possibility of resource shortage, whilst the PPD model objectives are to predict the project finish time and to define the critical areas for the project to delay using the output of the RSP model as input. The RSP model was verified through interview questionnaires with a number of selected personnel from the construction industry. The Delphi method was used to enhance the questionnaire results. The RSP model calculations used a combination of fuzzy logic, analytical hierarchy process (AHP) and multi-attribute theory to obtain the model output. A prototype computer program was introduced. The prototype computer program was then tested on a real construction project. The application of the RSP model showed that it is viable. The PPD model used probabilistic networking to predict the finish time of the project. The model introduced two new terms that can be used to define the most critical activities and the possible resource influence to delay. The comparison between PPD and the classical critical path method (CPM), programme evaluation and review technique (PERT) and Monte Carlo simulation revealed that the proposed model provides new information required to enhance delay management by project management staff.
6
Wu, Maoguo. "Promotion tournaments and hierarchy." Thesis, University of Aberdeen, 2012. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=192271.
Full textAbstract:
This thesis studies promotion tournaments and hierarchy, through both theoretical and empirical means. The data set utilised through- out the thesis for empirical tests consists of a large panel gathered from a major British financial sector firm. The data set has very detailed and consistent data on job levels, which are particularly well suited for studies of transitions across levels. The thesis first investigates one main assumption of the tournament theory, i.e., hierarchy is relatively fixed, and finds support in empirical results that external hiring number, promotion into level number, promotion out of level number, and exit number are closely related. The thesis then extends the conventional tournament model to a multi-contestant multi-prize setting and sets out to test the theoretical model predictions. Following the predictions, an empirical model of promotion probabilities is tested. Fixity of hierarchy, proxied by external hiring rate and exit rate, along with conventional promotion determinants, are included in the estimation. The results shed light on a distinct finding that fixity of hierarchy plays an important role in promotion outcomes, i.e., vacancies influence promotion probabilities, and incentives vary closely with promotion probabilities. The relation between incentives and promotion probabilities can be characterised as a hump shape. The results also indicate that promotion requirement would even get weakened if a large number of vacancies emerged. The thesis also compares two alternative promotion rules, tournaments versus standards. The theoretical model argues that tournaments and standards have similar incentive effect on inducing effort. In tournaments, maximal incentive occurs for intermediate promotion rates, and lower incentive occurs for lower and higher promotion rates. In standards, maximal incentive occurs when the standard is set so that the chance of promotion is a half, and lower incentive occurs when the standard is set so that the chance of promotion is far from a half. The empirical tests address the extent to which promotions within organisations are driven by relative comparisons of worker performance and comparisons of worker performance against absolute standards. The results provide evidence that relative comparisons become more important at higher hierarchical levels.
7
Stroe, Ionel Daniel. "Scalable visual hierarchy exploration." Link to electronic version, 2000. http://www.wpi.edu/Pubs/ETD/Available/etd-0510100-142928.
Full textAbstract:
Thesis (M.S.)--Worcester Polytechnic Institute.Keywords: semantic caching; prefetching; recursive queries; hierarchical structures; database backend; visual exploration. Includes bibliographical references (p. 81-84).
8
Che, Suisui. "Study on a Hierarchy Model." FIU Digital Commons, 2012. http://digitalcommons.fiu.edu/etd/611.
Full textAbstract:
The statistical inferences about the parameters of Binomial-Poisson hierarchy model are discussed. Based on the estimators of paired observations we consider the other two cases with extra observations on both the first and second layer of the model. The MLEs of lambda and p are derived and it is also proved the MLE lambda is also the UMVUE of lambda. By using multivariate central limit theory and large sample theory, both the estimators based on extra observations on the first and second layer are obtained respectively. The performances of the estimators are compared numerically based on extensive Monte Carlo simulation. Simulation studies indicate that the performance of the estimators is more efficient than those only based on paired observations. Inference about the confidence interval for p is presented for both cases. The efficiency of the estimators is compared with condition given that same number of extra observations is provided.
9
Hengst, Bernhard Computer Science & Engineering Faculty of Engineering UNSW. "Discovering hierarchy in reinforcement learning." Awarded by:University of New South Wales. Computer Science and Engineering, 2003. http://handle.unsw.edu.au/1959.4/20497.
Full textAbstract:
This thesis addresses the open problem of automatically discovering hierarchical structure in reinforcement learning. Current algorithms for reinforcement learning fail to scale as problems become more complex. Many complex environments empirically exhibit hierarchy and can be modeled as interrelated subsystems, each in turn with hierarchic structure. Subsystems are often repetitive in time and space, meaning that they reoccur as components of different tasks or occur multiple times in different circumstances in the environment. A learning agent may sometimes scale to larger problems if it successfully exploits this repetition. Evidence suggests that a bottom up approach that repetitively finds building-blocks at one level of abstraction and uses them as background knowledge at the next level of abstraction, makes learning in many complex environments tractable. An algorithm, called HEXQ, is described that automatically decomposes and solves a multi-dimensional Markov decision problem (MDP) by constructing a multi-level hierarchy of interlinked subtasks without being given the model beforehand. The effectiveness and efficiency of the HEXQ decomposition depends largely on the choice of representation in terms of the variables, their temporal relationship and whether the problem exhibits a type of constrained stochasticity. The algorithm is first developed for stochastic shortest path problems and then extended to infinite horizon problems. The operation of the algorithm is demonstrated using a number of examples including a taxi domain, various navigation tasks, the Towers of Hanoi and a larger sporting problem. The main contributions of the thesis are the automation of (1)decomposition, (2) sub-goal identification, and (3) discovery of hierarchical structure for MDPs with states described by a number of variables or features. It points the way to further scaling opportunities that encompass approximations, partial observability, selective perception, relational representations and planning. The longer term research aim is to train rather than program intelligent agents
10
Rivera, Kris Krishna. "Ray collection bounding volume hierarchy." Master's thesis, University of Central Florida, 2011. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4701.
Full textAbstract:
This thesis presents Ray Collection BVH, an improvement over a current day Ray Tracing acceleration structure to both build and perform the steps necessary to efficiently render dynamic scenes. Bounding Volume Hierarchy (BVH) is a commonly used acceleration structure, which aides in rendering complex scenes in 3D space using Ray Tracing by breaking the scene of triangles into a simple hierarchical structure. The algorithm this thesis explores was developed in an attempt at accelerating the process of both constructing this structure, and also using it to render these complex scenes more efficiently. The idea of using "ray collection" as a data structure was accidentally stumbled upon by the author in testing a theory he had for a class project. The overall scheme ofthe algorithm essentially collects a set of localized rays together and intersects them with subsequent levels of the BVH at each build step. In addition, only part of the acceleration structure is built on a per-Ray need basis. During this partial build, the Rays responsible for creating the scene are partially processed, also saving time on the overall procedure. Ray tracing is a widely used technique for simple rendering from realistic images to making movies. Particularly, in the movie industry, the level of realism brought in to the animated movies through ray tracing is incredible. So any improvement brought to these algorithms to improve the speed of rendering would be considered useful and welcome. This thesis makes contributions towards improving the overall speed of scene rendering, and hence may be considered as an important and useful contribution.ID: 030646225; System requirements: World Wide Web browser and PDF reader.; Mode of access: World Wide Web.; Thesis (M.S.)--University of Central Florida, 2011.; Includes bibliographical references (p. 80-81).
M.S.
Masters
Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Science
11
King, Martin Graham. "The hierarchy of conceptual design." Thesis, University of Salford, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272688.
Full text
12
Redhead, Daniel Joseph. "The dynamics of social hierarchy." Thesis, University of Essex, 2018. http://repository.essex.ac.uk/23263/.
Full textAbstract:
A growing body of research has outlined that humans gain social rank through two pathways: prestige and dominance. This dual model of social hierarchy advocates that individuals either attain positions of high rank though signals of an ability and willingness to either inflict harm (dominance) or confer benefits (prestige) to group members. While there is growing support for the dual model of social hierarchy, the extant empirical evidence has been cross-sectional and has neglected the impact that time and context has on the efficacy of prestige and dominance as long-term processes. The present research outlines a theoretical framework for the trajectories of prestige, dominance and social rank over time, and further provides longitudinal evidence of their temporal dynamics. In addition, the current research tests the longitudinal associations that prestige and dominance have with social networks, Results of study 1 suggest that, in collaborative task groups, prestige has a positive and bidirectional temporal association with social rank, while the association that dominance has diminished over time. Study 2 indicated that in these task groups those high in prestige were more likely to be asked advice and prestige was transmitted through advice ties but had a limited association with friendship. Those high in dominance were less likely to be nominated as friends, but dominance was transmitted through friendship ties. Results from Study 3 suggest that those high in prestige status were more likely to aid in food sharing and food production, and that the prestige status of an individual’s food sharing and food production partners increased their prestige status over a period of twelve years among the Tsimane forager-horticulturalists of Bolivia. Overall, the present research highlights the distinction between prestige and dominance over time and shows that prestige, dominance, social rank and social networks have bidirectional, dynamic relationships over time.
13
Koltsidas, Ioannis. "Flashing up the storage hierarchy." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/3932.
Full textAbstract:
The focus of this thesis is on systems that employ both flash and magnetic disks as storage media. Considering the widely disparate I/O costs of flash disks currently on the market, our approach is a cost-aware one: we explore techniques that exploit the I/O costs of the underlying storage devices to improve I/O performance. We also study the asymmetric I/O properties of magnetic and flash disks and propose algorithms that take advantage of this asymmetry. Our work is geared towards database systems; however, most of the ideas presented in this thesis can be generalised to any data-intensive application. For the case of low-end, inexpensive flash devices with large capacities, we propose using them at the same level of the memory hierarchy as magnetic disks. In such setups, we study the problem of data placement, that is, on which type of storage medium each data page should be stored. We present a family of online algorithms that can be used to dynamically decide the optimal placement of each page. Our algorithms adapt to changing workloads for maximum I/O efficiency. We found that substantial performance benefits can be gained with such a design, especially for queries touching large sets of pages with read-intensive workloads. Moving one level higher in the storage hierarchy, we study the problem of buffer allocation in databases that store data across multiple storage devices. We present our novel approach to per-device memory allocation, under which both the I/O costs of the storage devices and the cache behaviour of the data stored on each medium determine the size of the main memory buffers that will be allocated to each device. Towards informed decisions, we found that the ability to predict the cache behaviour of devices under various cache sizes is of paramount importance. In light of this, we study the problem of efficiently tracking the hit ratio curve for each device and introduce a lowoverhead technique that provides high accuracy. The price and performance characteristics of high-end flash disks make them perfectly suitable for use as caches between the main memory and the magnetic disk(s) of a storage system. In this context, we primarily focus on the problem of deciding which data should be placed in the flash cache of a system: how the data flows from one level of the memory hierarchy to the others is crucial for the performance of such a system. Considering such decisions, we found that the I/O costs of the flash cache play a major role. We also study several implementation issues such as the optimal size of flash pages and the properties of the page directory of a flash cache. Finally, we explore sorting in external memory using external merge-sort, as the latter employs access patterns that can take full advantage of the I/O characteristics of flash memory. We study the problem of sorting hierarchical data, as such is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The proposed algorithm efficiently exploits the hierarchical structure in order to minimize the number of disk accesses and optimise the utilization of available memory. Our proposals are not specific to sorting over flash memory: the presented techniques are highly efficient over magnetic disks as well.
14
Shelton, Marilyn Rose. "Triangle concept hierarchy and microcomputers." The Ohio State University, 1989. http://rave.ohiolink.edu/etdc/view?acc_num=osu1342112647.
Full text
15
Ito, Sumiko. "Hierarchy in The Chronicles of Narnia." Thesis, University of Macau, 2002. http://umaclib3.umac.mo/record=b1636601.
Full text
16
Pietruszewski, Przemyslaw. "Association rules analysis for objects hierarchy." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3512.
Full textAbstract:
Association rules are one of the most popular methods of data mining. This technique allows to discover interesting dependences between objects. The thesis concerns on association rules for hierarchy of objects. As a multi–level structure is used DBLP database, which contains bibliographic descriptions of scientific papers conferences and journals in computer science. The main goal of thesis is investigation of interesting patterns of co-authorship with respect to different levels of hierarchy. To reach this goal own extracting method is proposed.p.pietruszewski@op.pl
17
Settle, M. W. Alexander. "An adaptive chip multiprocessor cache hierarchy." Connect to online resource, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3256380.
Full text
18
Smith, David Michael. "Hierarchy in the Early Helladic Peloponnese." Thesis, University of Liverpool, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568985.
Full textAbstract:
The Early Helladic period in the Peloponnese (c. 3100 -2000 BC) is traditionally viewed as a phase of incipient hierarchical social organisation. This interpretation rests with a series of socio-economic developments perceived to represent an increased socio-economic complexity over that visible during the Late and Final Neolithic, including the appearance of organised, highly-socialised burial practices, a monumental architectural tradition, a non-uniform shift in Peloponnesian settlement patterns, the advent of sealing practices, an expansion of overland and maritime trade relationships and an increased visibility for metallurgical practice and Other specialist technologies. The second phase of the period, Early Helladic (E!"!) Il, and particularly so its later stages, is seen to represent a socio-cultural apex for the Early Helladic period and that for which the existence of elite groups on the Early Bronze Age Greek mainland -: has been most fervently proposed. There is a persistent belief that these dynamic multi-scale changes represent correlative developments articulated within a coherent and contemporary 'system' of social behaviours, within which social hierarchy was present from the start or out of which it quickly developed. Through the analysis of infant and adult burial practices, regional settlement activity and the use of monumental architecture in multiple modes of social interaction, this thesis demonstrates that a far more complex situation is evident. One in which systemic centralisation of 'elite' behaviours can be largely deconstructed in favour of temporally- and spatially-specific developments resulting from inter-group interaction or the particular geological, geographical or socio-political position of the study area. Increasingly accurate artefactual chronologies have allowed the identification of local and regional variation in behaviour which challenge existing ideas of 'hierarchy' and its operation in the Early Bronze Age Peloponnese, and suggests instead that the evident complexity of the period may find its origins in non-stratified communal and inter-communal action.
19
Hermansson, Anders. "Analytic Hierarchy Process : en kritisk genomgång." Thesis, Högskolan i Gävle, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-17048.
Full textAbstract:
Analytic Hierarchy Process, AHP, är en spridd och mycket omdiskuterad metod för att analysera multikriterieproblem. Syftet med uppsatsen är göra beslutsfattare som använder AHP uppmärksamma på några av de problem som kan finnas med att använda AHP. Uppsatsen redogör detaljerat för hur beslutsfattarens indata behandlas av AHP och visar både med ett konkret exempel och med en formell beskrivning hur en rangordning av alternativ genereras av AHP. Den detaljerade redogörelsen illustrerar att AHP bygger på additiv nyttofunktion vilket döljs för användare av programvaror utvecklade för AHP. Vidare belyses andra drag i AHPs behandling av indata, drag som i flera fall döljs för användaren.
20
Boni, Stefano. "Hierarchy in twentieth-century Sefwi (Ghana)." Thesis, University of Oxford, 1999. http://ora.ox.ac.uk/objects/uuid:c3238187-7e9d-465d-b9e4-63ea1ad7eda1.
Full textAbstract:
The dissertation aims to provide an understanding of the relation between political-economic power and the attribution of social value in twentieth-century Sefwi (Ghana). The existing literature on relations of dominance amongst the Akan has flaws: works examine single relations of dominance in isolation; studies focus mostly on discontinuity and change; peripheral areas are neglected. In the dissertation these issues are addressed. Hierarchy is used as an analytical tool which enables one to link diverse expressions of dominance; the persistence of certain hierarchical patterns throughout the twentieth century is analysed alongside transformations; and the focus is on Sefwi, a marginal region of the Akan world. The dissertation is divided into five sections. The introduction presents the methodological and theoretical approach adopted in the work. Part one is concerned with change in hierarchical patterns: twentieth-century dynamics are analysed to determine the extent of change with reference to chiefly power, capitalist.relations and gender issues. Part two shows that unequal relations inform three hierarchical domains -ancestry, gender and seniority. Part three addresses the issue of the coherence and unity of hierarchy by examining modes of organization of experience that cut across the three domains of inequality: reference is made to the use of kinship terms; concepts of ownership, caretakership and help; recourse to the supernatural; food and drink transactions. In the conclusion, Sefwi hierarchy is examined in a wider comparative and theoretical perspective with reference to the notions of 'encompassing of the contrary' (Dumont) and 'fetishization' (Marx).
21
Adams, Robin. "A modular hierarchy of logical frameworks." Thesis, Royal Holloway, University of London, 2004. http://repository.royalholloway.ac.uk/items/2fa04c91-c933-8da6-3bc4-9d300b20cc54/10/.
Full textAbstract:
Logical frameworks - formal systems for the specification and representation of other formal systems - are now a well-established field of research, and the number and variety of logical frameworks is large and growing continuously. In this thesis, I tie several examples of logical frameworks into a single hierarchy. I begin by introducing an infinite family of new, weak, lambda-free logical frameworks. These systems do not use lambda-abstraction, local definition, or any similar feature; parameterisation, and the instantiation of parameterisation, is taken as basic. These frameworks form conservative extensions of one another; this structure of extension is what I call the modular hierarchy of logical frameworks. I show how several examples of existing logical frameworks - specifically, the systems PAL and AUT-68 from the AUTOMATH family, the Edinburgh Logical Framework, Martin-Lof's Logical Framework, and Luo's system PAL+ - can be fitted into this hierarchy, in the sense that one of the weak frameworks can be embedded in each as a conservative subsystem. I give several examples of adequacy theorems for object theories in the weak frameworks; these theorems are easier to prove than is usually the case for a logical framework. Adequacy theorems for the systems higher in the hierarchy follow as immediate corollaries. In the second part of this thesis, I investigate an approach to the design of logical frameworks suggested by the existence of such a hierarchy: that a framework could be built by specifying a set of features, the result of adding any of which to a framework is a conservative extension of the same. I show how all of the weak frameworks from the first part, as well as two of the systems we gave there as examples, can indeed be built in this manner.
22
Taylor, John. "Hierarchy : Georges Bataille and religious studies." Thesis, University of Wales Trinity Saint David, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.683273.
Full text
23
Dublish, Saumay Kumar. "Managing the memory hierarchy in GPUs." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31205.
Full textAbstract:
Pervasive use of GPUs across multiple disciplines is a result of continuous adaptation of the GPU architectures to address the needs of upcoming application domains. One such vital improvement is the introduction of the on-chip cache hierarchy, used primarily to filter the high bandwidth demand to the off-chip memory. However, in contrast to traditional CPUs, the cache hierarchy in GPUs is presented with significantly different challenges such as cache thrashing and bandwidth bottlenecks, arising due to small caches and high levels of memory traffic. These challenges lead to severe congestion across the memory hierarchy, resulting in high memory access latencies. In memory-intensive applications, such high memory access latencies often get exposed and can no longer be hidden through multithreading, and therefore adversely impact system performance. In this thesis, we address the inefficiencies across the memory hierarchy in GPUs that lead to such high levels of congestion. We identify three major factors contributing to poor memory system performance: first, disproportionate and insufficient bandwidth resources in the cache hierarchy; second, poor cache management policies; and third, high levels of multithreading. In order to revitalize the memory hierarchy by addressing the above limitations, we propose a three-pronged approach. First, we characterize the bandwidth bottlenecks present across the memory hierarchy in GPUs and identify the architectural parameters that are most critical in alleviating congestion. Subsequently, we explore the architectural design space to mitigate the bandwidth bottlenecks in a cost-effective manner. Second, we identify significant inter-core reuse in GPUs, presenting an opportunity to reuse data among the L1s. We exploit this reuse by connecting the L1 caches with a lightweight ring network to facilitate inter-core communication of shared data. We show that this technique reduces traffic to the L2 cache, freeing up the bandwidth for other accesses. Third, we present Poise, a machine learning approach to mitigate cache thrashing and bandwidth bottlenecks by altering the levels of multi-threading. Poise comprises a supervised learning model that is trained offline on a set of profiled kernels to make good warp scheduling decisions. Subsequently, a hardware inference engine is used to predict good warp scheduling decisions at runtime using the model learned during training. In summary, we address the problem of bandwidth bottlenecks across the memory hierarchy in GPUs by exploring how to best scale, supplement and utilize the existing bandwidth resources. These techniques provide an effective and comprehensive methodology to mitigate the bandwidth bottlenecks in the GPU memory hierarchy.
24
Learoyd, Arthur. "Semi-sovereignty and relationships of hierarchy." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:cd2288c8-4db5-4285-ab08-d34506574380.
Full textAbstract:
Scholars of International Relations are increasingly interested in exploring differences between the members of international society, and the various forms of international hierarchy which connect these unlike actors. There are many points of intersection between these areas of interest, and a recent turn towards historical sociology, which puts the historical development of international society front and centre, and draws particular attention to the long-nineteenth century as a pivotal period in that development. This thesis seeks to contribute to these research programmes, by explaining variations between the so-called 'semi-sovereign' polities found throughout international society at the time. These entities existed throughout the entirety of the long-nineteenth century, and could be found across a range of regions. They varied by legal type, in terms of the rights they held and lacked, and in terms of the organizations and institutions they comprised and within which they were situated. This thesis accounts for variations between these polities in terms of four 'social logics': complexes of relations, processes, practices, norms, and concepts which, taken together, represent distinct, ideal-typical styles of interaction. Drawing on 'relational' International Relations theory and approaches from historical sociology, I argue that polities manifested and embodied elements of these prior logics, in a range of different combinations and configurations. With recourse to these logics â law, management, suzerainty, and cultural differentiation â we can account for where these entities came from, why they had the characteristics they did, and why they varied from one another, as well as from their fully-sovereign and wholly non-sovereign counterparts.
25
Allard, Filip. "Neutrino Masses and the Hierarchy Problem." Thesis, KTH, Fysik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210325.
Full text
26
Yoo, Joonhyuk. "Harnessing checker hierarchy for reliable microprocessors." College Park, Md.: University of Maryland, 2007. http://hdl.handle.net/1903/7688.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2007.Thesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
27
Magnano, Guido. "Poisson-Nijenhuis Structures and Sato Hierarchy." Doctoral thesis, SISSA, 1991. http://hdl.handle.net/20.500.11767/4437.
Full textAbstract:
The thesis is organized in three distinct parts. The first part ( § 1 and §2) is purely
expository. After a brief introduction to the basic ideas of the bi-Hamiltonian approach
to integrable systems in §1, in §2 the bi-Hamiltonian factorization of Sato's equations is
described as explicitly as possible. This section collects the "experimental facts" which
we aim to explain in the following part of the thesis. In §2 we also introduce and discuss
different representations of the Sato hierarchy, as families of integro-differential equations
in two space variables and in a finite number of fields, which we call Sato-Gel'fand-Dikii
hierarchies. The simplest representation of this type coincides with the well-known KP
hierarchy, while the other representations do not appear, to oμr knowledge, in the previous
literature. The second part of the thesis includes §3, §4 and §5 and represents the theoretical core
of this work. The main result (§4) is the construction of the Poisson-Nijenhuis structures
already mentioned; in §5 we introduce the Kac-Moody algebra of Hamiltonian vector fields,
and we show that these vector fields admit a Lax representation. The only arbitrary point
in the construction is the choice of a Lie-algebra cocycle corresponding to the affine part
of the Lie-Poisson brackets: both the Kac-Moody algebra of bi-Hamiltonian vector fields
and its Lax representation are completely determined by that cocycle.
The third and final part is devoted to the formal application of the abstract framework
to algebras of pseudodifferential operators. In §6 the Gel'fand-Dikii and the Sato-Gel'fandDikii
hierarchies are obtained as reductions (on different affine subspaces) of the dynamical
systems previously obtained, for finite n, while the Sato hierarchy is recovered in §7 as a
generalization of the same construction to the case n = oo.
28
Letizia, Elisa. "Hierarchy and risk in financial networks." Doctoral thesis, Scuola Normale Superiore, 2018. http://hdl.handle.net/11384/85741.
Full text
29
Fournier, Kevin. "The Wadge Hierarchy : Beyond Borel Sets." Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC005.
Full textAbstract:
Cette thèse est dévolue à l'étude des sous-ensembles Ale non-boréliens de l'espace de Baire. Dans une première partie, nous généralisons les résultats obtenus par Duparc et Louveau pour obtenir une description complète de la hiérarchie de Wadge des différences croissantes d'ensembles coanalytiques, sous l'hypothèse que tous les ensembles analytiques sont déterminés. Ensuite, nous étudions certaines classes incluses dans la classe A1/2, les classes de Selivanovski et celles de Kolmogorov, et donnons un fragment de leur hiérarchie de Wadge. Finalement, nous appliquons les techniques et résultats obtenus à l'informatique théorique, et plus précisément à la théorie des automates d'arbresThis thesis is devoted to the study of non-Borel Al2 pointclasses of the Baire space, using reductions by continuous functions. This work is divided in three main parts. In the first one, we generalise results obtained by Duparc and Louveau to provide a complete description of the • Wadge hierarchy of the class of increasing differences of coanalytic sets, under some determinacy hypothesis. In a second part, we study some Al2 pointclasses above the class of increasing differences of coanalytic sets, and give a fragment of the Wadge hierarchy for those classes. Finally, we apply our results and techniques to theoretical computer science and more precisely to the study of regular tree languages, that is sets of labeled binary trees that are recognized by tree automata
30
Alford, Brian David. "Two applications involving the analytic hierarchy process." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/2131.
Full textAbstract:
Thesis (M.S.) -- University of Maryland, College Park, 2004.Thesis research directed by: Robert H. Smith School of Business. Dept. of Decision and Information Technologies. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
31
Bian, Shun. "Data mining ensemble hierarchy, diversity and accuracy." Thesis, University of East Anglia, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433607.
Full text
32
Frend, Hayley Theresa. "Mammary gland hierarchy and its controlling mechanisms." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708178.
Full text
33
Mueller, Thibaut. "Solving hierarchy problems in the LHC era." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708391.
Full text
34
Ajjanagadde, Ganesh. "A learning hierarchy for classification and regression." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/112818.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.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 (pages 51-53).
This thesis explores the problems of learning analysis of variance (ANOVA) decompositions over GF(2) and R, as well as a general regression setup. For the problem of learning ANOVA decompositions, we obtain fundamental limits in the case of GF(2) under both sparsity and degree structures. We show how the degree or sparsity level is a useful measure of the complexity of such models, and in particular how the statistical complexity ranges from linear to exponential in the dimension, thus forming a "learning hierarchy". Furthermore, we discuss the problem in both an "adaptive" as well as a "one-shot" setting, where in the adaptive case query choice can depend on the entire past history. Somewhat surprisingly, we show that the "adaptive" setting does not yield significant statistical gains. In the case of R, under query access, we demonstrate an approach that achieves a similar hierarchy of complexity with respect to the dimension. For the general regression setting, we outline a viewpoint that captures a variety of popular methods based on locality and partitioning of some kind. We demonstrate how "data independent" partitioning may still yield statistically consistent estimators, and illustrate this by a lattice based partitioning approach.
by Ganesh Ajjanagadde.
M. Eng.
35
Vellacott, Oliver R. "A framework of hierarchy for neural theory." Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/14597.
Full textAbstract:
There is currently no generally-accepted theory explaining how neural systems realise complex function. Indeed, it is believed by some that neural systems are fundamentally opaque. A framework of hierarchy is proposed as the basis of neural theory. By the application of hierarchy to neural systems it is possible to explain how complex function is computed. At the primitive (hardware) level it is only possible to understand the computation of primitive functions. To understand the computation of higher level function it is necessary to abstract primitive function, via an arbitrary number of intermediate levels of complexity, to the appropriate level of abstraction. Application of the framework is facilitated by a software tool which implements a specification as a neural system, to which training can then be applied. This specification is hierarchical, and is described in a fully distributed, object-oriented style. Networks constructed by this method are not restricted to any of the traditional neural models. The class of topologies which may be implemented is unrestricted. The framework is applied to the recognition of numberplates. This practical demonstration shows that (a) hierarchy enables neural computation of complex function to be understood; (b) the application of hierarchy allows the integration of specification and learning as methods of implementation; and (c) the framework facilitates the scaling-up of neural systems.
36
Kell, Alexander James Eaton. "Hierarchy and invariance in auditory cortical computation." Thesis, Massachusetts Institute of Technology, 2018. https://hdl.handle.net/1721.1/132746.
Full textAbstract:
Thesis: Ph. D. in Neuroscience, Massachusetts Institute of Technology, Department of Brain and Cognitive Sciences, June, 2019Cataloged from the PDF version of thesis. "June 2019"--Hand written on title page.
Includes bibliographical references.
With ease, we recognize a friend's voice in a crowd, or pick out the first violin in a concerto. But the effortlessness of everyday perception masks its computational challenge. Perception does not occur in the eyes and ears - indeed, nearly half of primate cortex is dedicated to it. While much is known about peripheral auditory processing, auditory cortex remains poorly understood. This thesis addresses basic questions about the functional and computational organization of human auditory cortex through three studies. In the first study we show that a hierarchical neural network model optimized to recognize speech and music does so at human levels, exhibits a similar pattern of behavioral errors, and predicts cortical responses, as measured with fMRI. The multi-task optimization procedure we introduce produces separate music and speech pathways after a shared front end, potentially recapitulating aspects of auditory cortical functional organization. Within the model, different layers best predict primary and non-primary voxels, revealing a hierarchical organization in human auditory cortex. We then seek to characterize the representational transformations that occur across stages of the putative cortical hierarchy, probing for one candidate: invariance to realworld background noise. To measure invariance, we correlate voxel responses to natural sounds with and without real-world background noise. Non-primary responses are substantially more noise-invariant than primary responses. These results illustrate a representational consequence of the potential hierarchical organization of the auditory system. Lastly, we explore of the generality of deep neural networks as models of human hearing by simulating many psychophysical and fMRI experiments on the above-described neural network model. The results provide an extensive comparison of the performance characteristics and internal representations of a deep neural network with those of humans. We observe many similarities that suggest that the model replicates a broad variety of aspects of auditory perception. However, we also find discrepancies that suggest targets for future modeling efforts.
by Alexander James Eaton Kell.
Ph. D. in Neuroscience
Ph.D.inNeuroscience Massachusetts Institute of Technology, Department of Brain and Cognitive Sciences
37
Montoya, Chávez Victorhugo, and Cambiaso Raúl Feijóo. "The Hierarchy of Human Rights International Treaties." IUS ET VERITAS, 2016. http://repositorio.pucp.edu.pe/index/handle/123456789/123420.
Full textAbstract:
An issue that has sparked heated debate over the years is undoubtedly the hierarchy of international treaties in the Peruvian legal system. the critical point is whether these treaties have Constitutional status. thus, the authors seek the answer based on the hierarchy of laws and how Human Rights Treaties are defined nowadays. Furthermore, they analyze the arguments defending their constitutional status in order to arrive to a firm conclusion that considers the globalization process that Law is going through.Un tema que ha despertado un gran debate a lo largo de los años, es sin duda el rango de los tratados internacionales en el ordenamiento jurídico peruano. el punto álgido sobre la discusión es si dichos tratados tienen el mismo peso que la Constitución. De esta manera, los autores buscan responder a la interrogante basándose en la jerarquía normativa y cómo se entienden hoy en día los tratados sobre Derechos Humanos. Además, analizan los argumentos que defienden su rango constitucional, para finalmente emitir una sólida conclusión considerando el proceso de globalización por el que transcurre el Derecho en la actualidad.
38
Pietrzycki, James M. "Analytical Hierarchy Process in Pavement Management Systems." University of Toledo / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1404499466.
Full text
39
Wilby, Jennifer Margaret. "Hierarchy theory and epidemiology : a narrative critique." Thesis, University of Hull, 2007. http://hydra.hull.ac.uk/resources/hull:13819.
Full textAbstract:
Integrating approaches from systems thinking with the methods and tools from the discipline of epidemiology, at the level of the management of international health policy and emerging (and reemerging) infectious disease (EID), the subject of this thesis, is a novel approach. The aim of integrating these approaches in this thesis was to provide additional insights into the management of EID, alongside the aims of enriching the practice of both systems and epidemiology. This thesis proposed that applying a systemic approach using systems thinking (and specifically the systems approach that addresses problematical situations from a hierarchical perspective) in combination with existing epidemiological knowledge, could provide an enriched description for the modelling, planning, intervention, and response in an analysis of international guidance in public health policy-making. This research was undertaken using a multi-disciplinary multi-paradigm approach of combining the systematic review process with critical systems thinking to explore a functionalist and interpretive approach to hierarchical systems thinking. There are several outcomes from this research: 1) The compilation of a comprehensive narrative of published work on hierarchy theory and those areas of epidemiology relevant to this study; 2) a process for critical systematic review; 3) a narrative review and critical systems thinking analysis of functionalist and interpretive hierarchical approaches in complex systems; and 4) a critical reflection on the usefulness of combining these hierarchical systems approaches with methods and data from other disciplines; in this case, epidemiology and the study of EID. This research has shown that there are contributing risk factors in the emergence of infectious disease not addressed in current policy making procedures for EID. The implications of this are important in reviewing current EID policies. Further work in this area is suggested to investigate whether the functionalist and interpretive hierarchical analysis is feasible in other complex systems, and in further investigating the philosophy, principles and practice of this multi-disciplinary approach.
40
Kurz, Aaron. "Shared Norms, Hierarchical Maintenance, and International Hierarchy." Thesis, University of North Texas, 2013. https://digital.library.unt.edu/ark:/67531/metadc283783/.
Full textAbstract:
The dissertation studies two aspects of international hierarchy. The world of international politics is not one of completely sovereign states competing in anarchy. Patterns of hierarchy, where a dominant state has legitimate control over some actions of a subordinate state, color the globe. First, I look at shared norms and hierarchy. Most studies concerning hierarchy focus on material maximization as an explanation for hierarchy--if hierarchy increases the wealth and security of two states, then hierarchy is more likely. I argue that shared norms held by two states facilitate hierarchy. Shared norms produce a common in-group community, generate common interests, create common ways of doing business, and give rise to common values that increase subordinate states' ability to persuade the dominant state. These factors ease the creation and maintenance of international hierarchical relationships. Second, I study interstate behaviors that can be explained as actions of maintenance by dominant states over subordinates to preserve or increase a level of hierarchy. I theorize that sticks and carrots from a dominant state (like economic sanctions, military interventions, and foreign aid) help sustain a dominant state's rule by convincing subordinate states to follow the dominant state's commands and expectations. Using data on U.S. hierarchies from 1950 to 2010, I utilize multivariate regressions to test hypotheses drawn from these theories. I find that shared norms associate with hierarchy, and maintenance actions uncommonly associate with compliance.
41
Hayden, Casey P. "A hierarchy of needs in international relations." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Mar/09Mar%5FHayden.pdf.
Full textAbstract:
Thesis (M.A. in Security Studies (Europe and Eurasia) )--Naval Postgraduate School, March 2009.Thesis Advisor(s): Johnson, Thomas H. ; Tsypkin, Mikhail. "March 2009." Description based on title screen as viewed on April 23, 2009. Author(s) subject terms: Russia, Soviet Union, Intelligence, Foreign Policy, Maslow, Hierarchy of Needs, NATO, CSTO, SCO, Central Asia, U.S.-Russia Relations, NATO-Russia Relations, International Relations, Political Science, Foreign Policy, Legitimacy, Domestic Security, External Security, Prestige, Strong States, State Identity, Needs, State Behavior Includes bibliographical references (p. 103-114). Also available in print.
42
Chopra, Sanjay. "Class hierarchy design for space time problems." Master's thesis, This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-10312009-020024/.
Full text
43
Dickson, Ronald. "Algebro-geometric solutions of the Boussinesq hierarchy /." free to MU campus, to others for purchase, 1998. http://wwwlib.umi.com/cr/mo/fullcit?p9904841.
Full text
44
Au, Kin Chung. "Sampling-sensitive multiresolution hierarchy for irregular meshes /." View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20AU.
Full textAbstract:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.Includes bibliographical references (leaves 57-59). Also available in electronic version. Access restricted to campus users.
45
Carlet, Guido. "Extended Toda hierarchy and its Hamiltonian structure." Doctoral thesis, SISSA, 2003. http://hdl.handle.net/20.500.11767/4024.
Full text
46
Chikatamarla, Shyam S. "Hierarchy of lattice Boltzmann models for fluid mechanics /." Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17893.
Full text
47
Lyttle, Brian J. Ehrhardt Todd P. "Interconnectivity via a consolidated type hierarchy and XML." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA386926.
Full textAbstract:
Thesis (M.S. in Computer Science) Naval Postgraduate School, Dec. 2000. Brian J. Lyttle. Thesis (M.S. in Software Engineering) Naval Postgraduate School, Dec. 2000. Todd P. Ehrhardt.Thesis advisors, Valdis Berzins, Ge Jun. "December 2000." Includes bibliographical references (p. 55-58). Also available in print.
48
Braud, Laurent. "The structure of orders in the pushdown hierarchy." Phd thesis, Université Paris-Est, 2010. http://tel.archives-ouvertes.fr/tel-00587409.
Full textAbstract:
Cette thèse étudie les structures dont la théorie au second ordremonadique est décidable, et en particulier la hiérarchie à pile. Onpeut définir celle-ci comme la hiérarchie pour $n$ des graphesd'automates à piles imbriquées $n$ fois ; une définition externe, partransformations de graphes, est également disponible. Nous nousintéressons à l'exemple des ordinaux. Nous montrons que les ordinauxplus petits que $epsilon_0$ sont dans la hiérarchie, ainsi que des graphesporteurs de plus d'information, que l'on appelle "graphecouvrants''. Nous montrons ensuite l'inverse : tous les ordinaux de lahiérarchie sont plus petits que $epsilon_0$. Ce résultat utilise le fait queles ordres d'un niveau sont en fait isomorphes aux structures desfeuilles des arbres déterministes dans l'ordre lexicographique, aumême niveau. Plus généralement, nous obtenons une caractérisation desordres linéaires dispersés dans la hiérarchie. Dans un troisièmetemps, nous resserons l'intérêt aux ordres de type $omega$ --- les mots infinis --- pour montrer que les mots du niveau 2 sont les motsmorphiques, ce qui nous amène à une nouvelle extension au niveau 3
49
Hwang, Jiha. "Acquisition hierarchy of Korean as a foreign language." Thesis, University of Hawaii at Manoa, 2002. http://hdl.handle.net/10125/3025.
Full textAbstract:
This study has three general objectives: 1. To observe and describe learner oral performance data; 2. To attempt to discover any clusters or hierarchical relationships, of whatever type, that may be indicative of acquisition processes; 3. To attempt to determine which factors account for the observed clusters and hierarchy. For this study, oral performance data collected from 111 learners of Korean as a Foreign Language (76 English native speakers and 35 Japanese native speakers) was analyzed for tokens of particles and verbal suffixes. Based on the findings obtained from statistical analysis of the tokens of the targeted variables, three stages of hierarchical development were proposed. The morphemes acquired in Stage 1 were identical for the English-speaking and Japanese-speaking groups, except for the inclusion delimiter -to (INC) which the Japanese speakers have acquired and which the English speakers have not yet acquired at this stage. For the learners studied, Stage 1 can be characterized as the period during which grammatical morphemes are acquired. In Stage 2 both case markers and delimiters emerge, but there is strong evidence of random variation for both Japanese and English native speakers. At Stage 3 additional systematic acquisition of delimiters continues. The three-stage acquisition hierarchy can thus be characterized as an alternation between a systematic stage and a diffused stage, followed by another stage of systematic acquisition. The early and systematic emergence of grammatical morphemes documented and observed in the case of Korean as a Foreign Language by this study contradicts the claims of models based on psychological processing constraints, which predict that pure grammatical morphemes will emerge late. However, the evidence in this corpus of adult instructed language learners clearly indicates that pure grammatical morphemes particles emerge in Stage 1 in Korean (five out of six early morphemes were grammatical morphemes). Theories based on the concept of psychological constraints, summarized in Pienemann's statement of 'easy to process, easy to acquire' somehow need to be able to account for these facts from KFL learner data.Thesis (Ph. D.)--University of Hawaii at Manoa, 2002.
Includes bibliographical references (leaves 136-149).
Mode of access: World Wide Web.
Also available by subscription via World Wide Web
xii, 149 leaves, bound ill. 29 cm
50
Stefanovic, Marija. "The category of animacy, a semantic feature hierarchy?" Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ49999.pdf.
Full text