• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1101
  • 350
  • 139
  • 134
  • 125
  • 87
  • 42
  • 39
  • 29
  • 24
  • 11
  • 11
  • 10
  • 7
  • 7
  • Tagged with
  • 2536
  • 492
  • 331
  • 286
  • 234
  • 196
  • 169
  • 158
  • 158
  • 151
  • 145
  • 135
  • 129
  • 128
  • 125
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
521

The Failure of Democracy in Iraq / Den Misslyckande Demkoratin i Irak

Al-khalidi, Ali January 2017 (has links)
The motivation of the bachelor thesis is to provide an understanding of democracy in Iraq from 2003 until present. After the fall of Saddam’s regime, there have been general elections but there is still an unstable democracy in Iraq. What are the reasons behind the failure of democracy in Iraq? Of course, there are many reasons behind this but my choice is to focus on three specific ones. How do these three variables that I have chosen, affect the possibility of democracy in Iraq? These two questions will be answered in this bachelor thesis, using Path Dependence Theory and Dahl’s Polyarchy Model and its Criteria that help to analyze and answer the research questions. Iraq has many major problems but the three I have focused on are ethnic and religious divides between Shia and Sunni, the violent environment and the presence of terrorist groups.
522

Ekonomická komparace dvou úseků realizace Labské cyklostezky / Economic comparison of two sections of implementation The Elbe Cycle Path

Černá, Lenka January 2011 (has links)
This thesis deals with a comparison of two sections of The Elbe Cycle Path in the Central Region. The whole work is divided into four parts. In the first half of the theoretical part describes cycling as such, explains the basic concepts arising from the topic and parameters that can influence the price of trails. The second half focuses on the approach to Elbe Cycle Route, its history, current status and vision for the future. The practical part describes The Elbe Cycle Route already embedded in the Central Region and the region itself and represents "The Elbe Cycle Route Brandýs nad Labem and in the neighborhood" and "The Cycleway Horní Počaply -- Vliněves -- Zelčín". The final section is devoted to the analysis of cartographic and economic comparison of the above projects. Final comparison shows the effectiveness in the implementation of both projects and highlights their strengths and opportunities and points out the weaknesses and threats that can be an inspiration and a warning to other projects linked to the development of cycling and mountain biking. The added value of this work is the visibility of both projects and communities to come together to be capable of such an important yet very financially demanding projects to implement. It turned out that although the patronage of the way, in terms of cycling, strategic projects assumed by the Central Region, it is fair to make a below average spending.
523

Reconceitualizando o Institucionalismo Histórico: path dependence, agencia e mudança institucional / Reconceptualizing the Historical Institutionalism: path dependence, agency and institutional change

Luis Enrique Urtubey de Cesaris 09 October 2009 (has links)
O núcleo desta dissertação é desenvolver um conceito de path dependence mais parcimonioso, coerente e útil, seja teoricamente ou em estudos empíricos. Neste sentido, o insight fundamental é que se partimos de uma conceitualização mais dinâmica, baseada mais em externalidades negativas do que em rendimentos crescentes, o conceito de path dependence pode ser inerentemente mais operacionalizável, robusto e ressoar melhor com a literatura e os estudos Institucionalistas Históricos. O conceito de path dependence pode também ser mais compatível com várias elaborações realizadas dentro do próprio Institucionalismo Histórico sobre questões como mudança institucional, mecanismos explicativos, complementaridade, idéias e agência, e, portanto, enriquecer-se graças aos mesmos. / The objective of this dissertation is to develop a more parsimonious, coherent and useful concept of path dependence, both theoretically and empirically. Its fundamental insight is that with a more dynamic conceptualization, based more in negative externalities than in increasing returns, the concept of path dependence can be inherently more robust and resonate better with the literature and Historical Institutionalist studies. The concept of path dependence can also be more compatible with several theoretical developments which have arisen within Historical Institutionalism regarding questions such as institutional change, social mechanisms, complementarities, ideas, agency and, therefore, to be enriched by them.
524

City of Davis Greenbelt Master Plan

Haydu, Brandon 01 March 2010 (has links)
The City of Davis is currently updating its Parks and Recreation Facilities Master Plan. During the update, greenbelts were identified as a highly used and desired facility. This Greenbelt Master Plan serves as a plan focused on the opportunities greenbelts can provide as recreational and transportation facilities. This report has analyzed community feedback, greenbelt coverage, greenbelt capacity, and existing local, state, and federal design guidelines. The final plan is a set of goals, objectives, policies, and programs, along with a greenbelt map, which is aimed at improving the greenbelt infrastructure in Davis through the year 2020.
525

Obstacle Avoidance Path Planning for Worm-like Robot

Liu, Zehao 01 September 2021 (has links)
No description available.
526

The influence of glide path preparation on the failure rate of nickel-titanium reciprocating instruments

Jonker, Casper Hendrik January 2013 (has links)
Introduction: The aim of this in vitro study was to determine the influence of two glide path preparation methods on the fracture rate of the Primary 25/08 WaveOne reciprocating instrument. The number of simulator Endo-Training-Blocks in each group were calculated at the time of instrument fracture and compared to determine the influence of glide path preparation on the failure rate of the Primary 25/08 WaveOne reciprocating instrument. Preparation times for different glide path methods and total time for root canal preparation, with or without glide path, was also calculated. Materials and Methods: Simulator Endo-Training-Blocks (n = 300) were selected and randomly divided into 3 groups (n = 100). The 3 groups were then sub-divided into 5 smaller groups (n = 20). Root canal preparation was done with new primary 25/08 WaveOne instruments allocated to each group (5 in total for each group, 1 for each sub-group) following different methods for glide path preparation. Group 1: no glide path (control); Group 2: glide path preparation with stainless-steel hand files (size 10 K-File followed by size 15 K-File and finally size 20 K-File until loose fitting); and Group 3: glide path preparation with rotary PathFiles (size 10 K-File until loose fitting followed by PathFile no.1 (ISO 13 tip), PathFile no.2 (ISO 16 tip) and finally PathFile no. 3 (ISO 19 tip)). The Primary 25/08 WaveOne reciprocating instrument was used with the WaveOne endodontic motor in “WaveOne All “mode with a brushing motion on the outstroke. Simulated root canals were irrigated with sterile water and Glyde was used as lubricating agent. The outcome was measured by recording how many simulators could be prepared with one instrument before instrument breakage occurred. The preparation protocol was repeated 5 times. The time it took to prepare the glide path and the total preparation time was also calculated. The data of the different parts of the project were collected and statistically analysed using the ANOVA / Bonferroni test. Results: Glide path preparation with PathFiles was significantly faster (13.3 s ± 2.60 s) than with hand files (25.1 s ± 1.70 s) (P < 0.001). The highest number of simulators could be prepared after glide path preparation was performed with PathFiles (19.2 ± 0.84) (P < 0.001). Pairwise comparisons at the Bonferroni adjusted significance level of 0.017 demonstrated that there were statistical significant differences (P < 0.001) when PathFiles (19.2 ± 0.84) and hand files (17.6 ±1.14) were compared to the no glide path group (7.4 ± 0.89). There was no statistical significant difference between PathFiles and hand files groups. Total Preparation time was significantly shorter (P < 0.001) when an initial glide path was prepared with PathFiles (12.7 ± 0.22 s). The longest preparation time (P < 0.001) was calculated in group 1 where no glide path (21.2 ± 0.20 s) was present and the Endo-Training-Blocks were left undisturbed. Conclusion: Initial glide path preparation with PathFiles resulted in shorter preparation time (glide path and total preparation) and allowed a higher number of simulators prepared before failure of the WaveOne instrument. / Dissertation (MSc)--University of Pretoria, 2013. / gm2014 / Odontology / unrestricted
527

The Development of a Lexicon for the Communication of Action in Cooperative Work

Shah, Claire Supriya January 2019 (has links)
No description available.
528

Four-bar Linkage Synthesis for a Combination of Motion and Path-point Generation

Tong, Yuxuan 23 May 2013 (has links)
No description available.
529

The Minimum Rank Problem for Outerplanar Graphs

Sinkovic, John Henry 05 July 2013 (has links) (PDF)
Given a simple graph G with vertex set V(G)={1,2,...,n} define S(G) to be the set of all real symmetric matrices A such that for all i not equal to j, the ijth entry of A is nonzero if and only if ij is in E(G). The range of the ranks of matrices in S(G) is of interest and can be determined by finding the minimum rank. The minimum rank of a graph, denoted mr(G), is the minimum rank achieved by a matrix in S(G). The maximum nullity of a graph, denoted M(G), is the maximum nullity achieved by a matrix in S(G). Note that mr(G)+M(G)=|V(G)| and so in finding the maximum nullity of a graph, the minimum rank of a graph is also determined. The minimum rank problem for a graph G asks us to determine mr(G) which in general is very difficult. A simple graph is planar if there exists a drawing of G in the plane such that any two line segments representing edges of G intersect only at a point which represents a vertex of G. A planar drawing partitions the rest of the plane into open regions called faces. A graph is outerplanar if there exists a planar drawing of G such that every vertex lies on the outer face. We consider the class of outerplanar graphs and summarize some of the recent results concerning the minimum rank problem for this class. The path cover number of a graph, denoted P(G), is the minimum number of vertex-disjoint paths needed to cover all the vertices of G. We show that for all outerplanar graphs G, P(G)is greater than or equal to M(G). We identify a subclass of outerplanar graphs, called partial 2-paths, for which P(G)=M(G). We give a different characterization for another subset of outerplanar graphs, unicyclic graphs, which determines whether M(G)=P(G) or M(G)=P(G)-1. We give an example of a 2-connected outerplanar graph for which P(G) ≥ M(G).A cover of a graph G is a collection of subgraphs of G such that the union of the edge sets of the subgraphs is equal to the E(G). The rank-sum of a cover C of G is denoted as rs(C) and is equal to the sum of the minimum ranks of the subgraphs in C. We show that for an outerplanar graph G, there exists an edge-disjoint cover of G consisting of cliques, stars, cycles, and double cycles such that the rank-sum of the cover is equal to the minimum rank of G. Using the fact that such a cover exists allows us to show that the minimum rank of a weighted outerplanar graph is equal to the minimum rank of its underlying simple graph.
530

Shortest Path - Capacitated Maximum Covering Problems

Hua, Liyan 03 September 2010 (has links)
No description available.

Page generated in 0.0449 seconds