Готові списки джерел за темами / Oriented path

Добірка наукової літератури з теми "Oriented path"

Автор: Grafiati

Опубліковано: 7 липня 2024

Оновлено: 7 липня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Oriented path".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Oriented path":

Nešetřil, Jaroslav, and Xuding Zhu. "Path homomorphisms." Mathematical Proceedings of the Cambridge Philosophical Society 120, no. 2 (August 1996): 207–20. http://dx.doi.org/10.1017/s0305004100074806.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

AbstractWe investigate homomorphisms between finite oriented paths. We demonstrate the surprising richness of this perhaps simplest case of homomorphism between graphs by proving the density theorem for oriented paths. As a consequence every two dimensional countable poset is represented finite paths and their homomorphisms, and every finite dimensional poset is represented finite oriented trees and their homomorphisms. We then consider related problems of universal representability and extendability and on-line representability.

Maxová, Jana, and Jaroslav Nešetřil. "On oriented path double covers." Discrete Mathematics 233, no. 1-3 (April 2001): 371–80. http://dx.doi.org/10.1016/s0012-365x(00)00253-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Junkkari, Marko, Johanna Vainio, Kati Iltanen, Paavo Arvola, Heidi Kari, and Jaana Kekäläinen. "Path Expressions in SQL." Journal of Database Management 27, no. 3 (July 2016): 1–22. http://dx.doi.org/10.4018/jdm.2016070101.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This article focuses on testing a path-oriented querying approach to hierarchical data in relational databases. The authors execute a user study to compare the path-oriented approach and traditional SQL from two perspectives: correctness of queries and time spent in querying. They also analyze what kinds of errors are typical in path-oriented SQL. Path-oriented query languages are popular in the context of object-orientation and XML. However, relational databases are the most common paradigm for storing data and SQL is most common for manipulating data. When querying hierarchical data in SQL, the user must specify join conditions explicitly between hierarchy levels. Path-oriented SQL is a new alternative for expressing hierarchical queries in relational databases. In the authors' study, the users spent significantly less time in writing path-oriented SQL queries and made fewer errors in query formulation.

Xiao-Ying Wu, Xiao-Ying Wu, Xin-Qian Fan Xiao-Ying Wu, Bing-Yan Wei Xin-Qian Fan, and Qian-Han Zhang Bing-Yan Wei. "A Path Planning Method for Logistics Oriented Drone Flight Routes." 電腦學刊 34, no. 5 (October 2023): 179–87. http://dx.doi.org/10.53106/199115992023103405013.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

<p>This article mainly studies the path planning of unmanned aerial vehicle logistics delivery, considering the constraints in the process of unmanned aerial vehicle delivery, and establishes a unmanned aerial vehicle flight environment model based on logistics management. Based on the performance constraints and task requirements of logistics drones, a multi constraint logistics drone path planning model is established from the perspectives of transportation safety, economy, and speed. The established constraints include flight altitude, maximum angle constraints, energy consumption constraints, etc. Then, a hybrid algorithm is used to plan the drone path, and dynamic window algorithm is used for local path planning, Finally, the hybrid algorithm was fused through a smoothing strategy, and simulation experiments confirmed that the drone’s flight range, energy consumption, and planning time were significantly improved during the delivery process.</p> <p> </p>

Borst, C., M. Mulder, M. M. van Paassen, and J. A. Mulder. "Path-Oriented Control/Display Augmentation for Perspective Flight-Path Displays." Journal of Guidance, Control, and Dynamics 29, no. 4 (July 2006): 780–91. http://dx.doi.org/10.2514/1.16469.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nguyen, S., D. Pretolani, and L. Markenzon. "On some path problems on oriented hypergraphs." RAIRO - Theoretical Informatics and Applications 32, no. 1-3 (1998): 1–20. http://dx.doi.org/10.1051/ita/1998321-300011.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lacevic, Bakir, and Paolo Rocco. "Safety-oriented path planning for articulated robots." Robotica 31, no. 6 (February 21, 2013): 861–74. http://dx.doi.org/10.1017/s0263574713000143.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

SUMMARYThis work presents an approach to motion planning for robotic manipulators that aims at improving path quality in terms of safety. Safety is explicitly assessed using the quantity called danger field. The measure of safety can easily be embedded into a heuristic function that guides the exploration of the free configuration space. As a result, the resulting path is likely to have substantially higher safety margin when compared to one obtained by regular planning algorithms. To this end, four planning algorithms have been proposed. The first planner is based on volume trees comprised of bubbles of free configuration space, while the remaining ones represent modifications of classical sampling-based algorithms. Several numerical case studies are carried out to validate and compare the performance of the presented algorithms with respect to classical planners. The results indicate significantly lower danger metric for paths obtained by safety-oriented planners even with some decrease in running time.

Li, Xiaohong, Ran Liu, Zhiyong Feng, and Ke He. "Threat modeling-oriented attack path evaluating algorithm." Transactions of Tianjin University 15, no. 3 (June 2009): 162–67. http://dx.doi.org/10.1007/s12209-009-0029-y.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Reid, K. B., and Keith Wayland. "Minimum path decompositions of oriented cubic graphs." Journal of Graph Theory 11, no. 1 (1987): 113–18. http://dx.doi.org/10.1002/jgt.3190110115.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chaturvedi, Santosh K. "Recovery Oriented Services: Obstacle is the Path." Journal of Psychosocial Rehabilitation and Mental Health 1, no. 2 (December 2014): 43–45. http://dx.doi.org/10.1007/s40737-014-0018-x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Oriented path":

Strandberg, Morten. "Robot path planning : an object-oriented approach." Doctoral thesis, KTH, Signals, Sensors and Systems, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-18.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Path planning has important applications in many areas, for example industrial robotics, autonomous systems, virtual prototyping, and computer-aided drug design. This thesis presents a new framework for developing and evaluating path planning algorithms. The framework is named CoPP (Components for Path Planning). It consists of loosely coupled and reusable components that are useful for building path planning applications. The framework is especially designed to make it easy to do fair comparisons between different path planning algorithms.

CoPP is also designed to allow almost any user-defined moving system. The default type of moving system is a robot class, which is capable of describing tree-like kinematic chains. Additional features of this robot class are: joint couplings, numerical or closed-form inverse kinematics, and hierarchical robot representations. The last feature is useful when planning for complex systems like a mobile platform equipped with an arm and a hand.

During the last six years, Rapidly-exploring Random Trees (RRTs) have become a popular framework for developing randomized path planning algorithms. This thesis presents a method for augmenting bidirectional RRT-planners with local trees. For problems where the solution trajectory has to pass through several narrow passages, local trees help to reduce the required planning time.

To reduce the work needed for programming of industrial robots, it is desirable to allow task specifications at a very high level, leaving it up to the robot system to figure out what to do. Here we present a fast and flexible pick-and-place planner. Given an object that has to be moved to another position, the planner chooses a suitable grasp of the object and finds motions that bring the object to the desired position. The planner can also handle constraints on, e.g., the orientation of the manipulated object.

For planning of pick-and-place tasks it is necessary to choose a grasp suitable to the task. Unless the grasp is given, some sort of grasp planning has to be performed. This thesis presents a fast grasp planner for a three- fingered robot hand. The grasp planner could be used in an industrial setting, where a robot is to pick up irregularly shaped objects from a conveyor belt. In conjunction with grasp planning, a new method for evaluating grasp stability is presented.

Adams, Gregory (Gregory David) 1965 Carleton University Dissertation Computer Science. "Describing groups of interacting objects using path expressions." Ottawa.:, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

de, Gosson de Varennes Serge. "Multi-oriented Symplectic Geometry and the Extension of Path Intersection Indices." Doctoral thesis, Växjö universitet, Matematiska och systemtekniska institutionen, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-400.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Symplectic geometry can be traced back to Lagrange and his work on celestial mechanics and has since then been a very active field in mathematics, partly because of the applications it offers but also because of the beauty of the objects it deals with. I this thesis we begin by the simplest fact of symplectic geometry. We give the definition of a symplectic space and of the symplectic group, Sp(n). A symplectic space is the data of an even-dimensional space and of a form which satisfies a number of properties. Having done this we give a definition of the Lagrangian Grassmannian Lag(n) which consists of all n-dimensional subspaces of the symplectic space on which the symplectic form vanishes. We carefully study the topology of these spaces and their universal coverings. It is of great interest to know how the elements of the Lagrangian Grassmannian intersect each other. A lot of efforts have therefore been made to construct intersection indices for elements of Lag(n). They have gone under many names but have had a sole purpose, namely to give us a way to determine how these elements intersect. We show how these elements are constructed and extend the definition to paths of elements of Lag(n) and Sp(n). We end this thesis by extending the definition of an index defined by Conley and Zehnder bu using the properties of the Leray index. Their index plays a significant role in the theory of periodic Hamiltonian orbit.

Shaha, Bartholomew. "Leadership for process-oriented social development: a path towards building community." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29697906.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Escher, P. C. "Pythia : an object-oriented gas path analysis computer program for general applications." Thesis, Cranfield University, 1995. http://dspace.lib.cranfield.ac.uk/handle/1826/3457.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

For both civil and military aero gas turbines, technological advances and high cost of ownership have resulted in considerable interest in advanced maintenance techniques. Some of these techniques are now ready for application to industrial gas turbines. This thesis attempts to give an overview of engine maintenance and engine health monitoring techniques. One way to tackle the high cost is to employ Gas Path Analysis techniques. Gas Path C Analysis helps to identify deteriorated components of a gas turbine in terms of performance parameter changes with respect to each other. The changes can be analysed and actions taken to minimise the life cycle costs of a gas turbine. A generalised Gas Path Analysis computer program Pythia has been developed that incorporated new techniques such as a non-linear multiple fault diagnostics scheme. In order to develop reliable software a structured methodology, conforming to quality standards, has been introduced. The program Pythia is based on an object-oriented programming method that can be run with a modem PC. •Pythia has been applied to a wide range of gas turbine engines. As a result, the Gas Path Analysis technique showed statistically significant improvements with the non-Iinear solution. The non-linear GPA technique was able to successfully identify sets of instrumentation for all engines. Finally, the thesis presents further developments of the non-linear GPA technique. In particular, instrumentation error, creep life estimation and low cycle fatigue estimation are some of the techniques.

Hong, Luke. "Spatial navigation in fiddler crabs: Goal oriented path integration of Uca pugilator." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1384850701.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Boggs, James Darrell. "Accessing Geospatial Services in Limited Bandwidth Service-Oriented Architecture (SOA) Environments." NSUWorks, 2013. http://nsuworks.nova.edu/gscis_etd/97.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

First responders are continuously moving at an incident site and this movement requires them to access Service-Oriented Architecture services, such as a Web Map Service, via mobile wireless networks. First responders from inside a building often have problems in communicating to devices outside that building due to propagation obstacles. Dynamic user geometry and the propagation conditions of communicating from inside buildings to transceivers on the outside are difficult to model reliably in network planning software. Thus, leading commercial network simulation software and open source network simulator software do not model wireless links between transceivers inside and outside of buildings; new modeling software is needed. The discrete simulation runs in this investigation were built on events in a scenario that is typical of first-responder activities at an incident site. This scenario defined the geometry and node characteristics that were used in a mobile wireless network simulation to calculate expected connectivity based on propagation modeling, transceiver characteristics, and the environment. The author implemented in software a propagation model from the United States National Institute of Standards and Technology (NIST) to simulate radio wave propagation path loss during the scenario. Modifications to the NIST model propagation path loss method were generated to improve consistency in results calculated with the same node separation distances and radio wave obstacle environments. The final set of modifications made the NIST model more generalized by using more building material characteristics than the original version. The modifications in this study to the path loss model from NIST engineers were grounded on ad hoc network connectivity data collected at the operational scenario site. After changes in the NIST model were validated, 1,265 operational simulation runs were conducted with different numbers of deployed nodes in an operational incident-response scenario. Data were reduced and analyzed to compare measures of mobile ad hoc network effectiveness. Findings in this investigation resulted in two specific contributions to the body of knowledge in mobile wireless network design. First, data analysis indicated that specific changes to a recent path loss model from NIST produced results that were more generalized than the original model with respect to accommodating different building materials and enhancing the consistency of simulation results. Second, the results from the modified path loss model revealed an operational impact in using relay nodes to support public safety. Specifically, placing relay nodes at the entrance to a building and on odd-numbered floors improved connectivity in terms of first responders' accessing Web Services via mobile network devices, when moving through a building in an incident scenario.

Tarhini, Batoul. "Oriented paths in digraphs and the S-packing coloring of subcubic graph." Electronic Thesis or Diss., Bourgogne Franche-Comté, 2023. http://www.theses.fr/2023UBFCK079.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Cette thèse de doctorat est divisée en deux parties principales: La partie I explore l'existence de chemins orientés dans les digraphes, cherchant à établir un lien entre le nombre chromatique d'un digraphe et l'existence de chemins orientés spécifiques en tant que sous-digraphes. Les digraphes contenus dans n'importe quel digraphe n-chromatique sont appelés n-universels. Nous examinons deux conjectures : la conjecture de Burr, qui affirme que chaque arbre orienté d'ordre n est (2n-2)-universel, et la conjecture d'El Sahili, qui déclare que chaque chemin orienté d'ordre n est n-universel. Pour les chemins orientés en général, la meilleure borne est donnée par Burr, à savoir que chaque chemin orienté d'ordre n est (n - 1)²-universel.Notre objectif est d'étudier des chemins à trois blocs. Pour atteindre nos objectifs, nous nous appuyons fortement sur des concepts fondamentaux, y compris l'induction sur l'ordre d'un digraphe donné, les forêts finales, les techniques de nivellement et les méthodes de décomposition stratégique de digraphes. Un chemin comportant trois blocs est désigné par P(k1, k2, k3). Pour le chemin P(k,1,l), nous avons confirmé la conjecture d'El Sahili dans les digraphes Hamiltoniens. En se basant sur ce résultat pour les digraphes Hamiltoniens, nous avons confirmé la conjecture d'El Sahili pour une classe plus générale de digraphes, ceux qui incluent un chemin dirigé hamiltonien. Nous introduisons une technique novatrice : une décomposition du digraphe en sous-digraphes résultant d'une série d'opérations basées sur le fameux théorème de Roy, qui garantit l'existence d'un chemin orienté dirigé d'ordre n dans tout digraphe n-chromatique. Cette technique s'est avérée cruciale pour établir de nouvelles bornes linéaires pour le nombre chromatique de digraphes qui ne comportent pas de chemin orienté avec trois blocs. En effet, en utilisant cette technique, nous avons prouvé que le chemin P(k,1,l) satisfait la conjecture de Burr. De plus, pour n'importe quel chemin à trois blocs, P(k,l,r), nous avons établi une borne linéaire pour le nombre chromatique qui améliore toutes les bornes précédemment atteintes. Dans la partie II, nous étudions le problème de la coloration de packing dans les graphes. Étant donnée une séquence non décroissante S = (s1, s2, . . . , sk) d'entiers positifs, une S-coloration (de packing) d'un graphe G est une partition de l'ensemble des sommets de G en k sous-ensembles {V1, V2, . . . , Vk} tels que pour chaque 1 ≤ i ≤ k, la distance entre deux sommets distincts u et v dans Vi est d'au moins si + 1. Notre attention est centrée sur une conjecture intrigante proposée par Brešar et al., qui affirme que l'arête subdivision de n'importe quel graphe subcubique admet une (1,2,3,4,5)-coloration de packing. Notre objectif est de confirmer cette conjecture pour des classes spécifiques de graphes subcubiques et de traiter les questions non résolues soulevées dans ce domaine. Une observation de Gastineau et Togni indique que si un graphe G est (1, 1, 2, 2)-colorable, alors son graphe subdivisé S(G) est (1,2,3,4,5)-colorable, et donc il satisfait la conjecture. En nous basant sur cette observation et afin de prouver la véracité de la conjecture pour la classe des graphes de Halin cubiques, nous avons étudié leur S-coloration de packing visant à prouver qu'ils admettent une coloration en (1, 1, 2, 2). Nous avons prouvé que tout graphe de Halin cubique est (1, 1, 2, 3)-colorable, et donc (1, 1, 2, 2)-colorable, et ainsi nous confirmons la conjecture pour cette classe. De plus, Gastineau et Togni, après avoir prouvé que chaque graphe subcubique est (1, 2, 2, 2, 2, 2, 2)-colorable, ont posé un problème ouvert sur le fait de savoir si chaque graphe subcubique est (1, 2, 2, 2, 2, 2)-colorable. Nous répondons affirmativement à cette question dans la classe particulière sur laquelle nous avons travaillé : nous avons prouvé que les graphes d'Halin cubiques sont (1, 2, 2, 2, 2, 2)-colorables
This PhD thesis is divided into two principal parts: Part I delves into the existenceof oriented paths in digraphs, aiming to establish a connection between a digraph'schromatic number and the existence of specific oriented paths within it as subdigraphs. Digraphs contained in any n-chromatic digraph are called n-universal. We consider two conjectures: Burr's conjecture, which states that every oriented tree of order n is (2n-2)-universal, and El Sahili's conjeture which states that every oriented path of order n is n-universal. For oriented paths in general, the best bound is given by Burr, that is every oriented path of order n is (n − 1)^2-universal. Our objective is to study the existence of an integer k such that any digraph with a chromatic number k, contains a copy of a given oriented path with three blocks as its subdigraph. To achieve our goals, we rely significantly on fundamental concepts, including, induction on the order of a given digraph, final forests, leveling techniques, and strategic digraph decomposition methods. A path P (k1, k2, k3) is an oriented path consisting of k1 forward arcs, followed by k2 backward arcs, and then by k3 forward arcs. For the path P(k,1,l), we have confirmed El Sahili's conjecture in Hamiltonian digraphs. More clearly, we have established the existence of any path P (k, 1, l) of order n in any n-chromatic Hamiltonian digraph. And depending on this result concerning Hamiltonian digraphs, we proved the correctness of El Sahili's conjecture on a more general class of digraphs which is digraphs containing a Hamiltonian directed path. We introduce a new technique which is represented by a decomposition of the digraph into subdigraphs defined by a series of successive operations applied to the digraph relying on the famous theorem of Roy which establishes the existence of a directed path of order n in any n-chromatic digraph. This technique has proven to be instrumental in establishing new linear bounds for the chromatic number of digraphs that lack an oriented path with three blocks. In deed, using this technique, we proved that the path P(k,1,l) satisfies Burr's conjecture.Moreover, for any path with three blocks, P(k,l,r) we establish a linear bound for the chromatic number which improves all the previously reached bounds. In Part II we study the problem of S-packing coloring in graphs. Given a non-decreasing sequence S = (s1, s2, . . . , sk) of positive integers, an S-packing coloring of a graph G is a partition of the vertex set of G into k subsets{V1, V2, . . . , Vk} such that for each 1 ≤ i ≤ k, the distance between any two dis-tinct vertices u and v in Vi is at least si + 1. Our focus is centered on an intriguing conjecture proposed by Brešar et al., which states that packing chromatic number of the subdivision of any subcubic graph is at most 5. Our desired aim is to provide a confirmation of this conjecture for specific classes of subcubic graphs, and to address the unresolved issues raised within this subject matter. An observation for Gastineau and Togni states that if a graph G is (1, 1, 2, 2)-packing colorable, then the chromatic number of its subdivision graph S(G) is at most 5, and hence it satisfies the conjecture. Depending on this observation, and in order to prove the correctness of the conjecture for the class of cubic Halin graphs, we studied its S-packing coloring aiming to prove that it admits a (1, 1, 2, 2)- packing coloring. We proved that a cubic Halin graph is (1, 1, 2, 3)-packing colorable, then it is (1, 1, 2, 2)-packing colorable, and so we confirm the conjecture for this class. Moreover, Gastineau and Togni, after proving that every subcubic graph is (1, 2, 2, 2, 2, 2, 2)-packing colorbale, have posed an open problem on whether every subcubic graph is (1, 2, 2, 2, 2, 2)-packing colorable. We answer this question in affirmative in the particular class we worked on; we proved that cubic Halin graphs are (1, 2, 2, 2, 2, 2)-packing colorable

Lewis, Tracy L. "Design Readiness: An Exploratory Model of Object-Oriented Design Performance." Diss., Virginia Tech, 2004. http://hdl.handle.net/10919/28545.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The available literature supports the fact that some students experience difficulty learning object-oriented design (OOD) principles. Previously explored predictors of OOD learning difficulties include student characteristics (cognitive activities, self-efficacy), teaching methodologies (teacher centered, course complexity), and student experiences (prior programming experience). Yet, within an extensive body of literature devoted to OOD, two explanations of student difficulty remain largely unexplored: (1) varying conceptualizations of the underlying principles/strategies of OOD, and (2) preparedness or readiness to learn OOD. This research also investigated the extent to which individual differences impacted DRAS and OOD performance. The individual difference measures of interest in this study included college grade point average, prior programming experience, cognitive abilities (spatial orientation, visualization, logical reasoning, flexibility, perceptual style), and design readiness. In addition, OOD performance was measured using two constructs: course grade (exams, labs, programs, overall), and a specially constructed design task. Participants selected from the CS2 course from two southeastern state universities were used within this study, resulting in a sample size of 161 (School A, n = 76; School B, n = 85). School A is a mid-sized comprehensive university and School B is a large research-intensive university. If was found that the schools significantly differed on all measures of prior computer science experience and cognitive abilities. Path analysis was conducted to determine which individual differences were related to design readiness and OOD performance. In summary, this research identified that instructors can not ignore individual differences when teaching OOD. It was found that the cognitive ability visualization, prior OO experience, and overall college grade point average should be considered when teaching OOD. As it stands, without identifying specific teaching strategies used at the schools within this study, this research implies that OOD may require a certain level of practical computer experience before OOD is introduced into the curriculum. The cognitive ability visualization was found to have a significant indirect relationship with overall course grade through the mediating variable design readiness. Further, the results suggest that the DRAS may serve as a viable instrument in identifying successful OOD students as well as students that require supplemental OOD instruction.
Ph. D.

Suweon, Kim. "The political economy of aid-oriented foreign policy change: elite perspectives on mercantilism in Korea and Ghana." Thesis, University of the Western Cape, 2014. http://hdl.handle.net/11394/4021.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Philosophiae Doctor - PhD
The thesis examines how elite perspectives on foreign aid affect the subsequent path of aid dependence. The focus is on aid-seeking foreign policy change. Two foreign policy change cases are examined for the study, which took place in Korea under Park Chung-hee and in Ghana under Rawlings through a lens of comparative historical analysis. The thesis aims to make two original contributions to knowledge. First, it explains recipient foreign policy using two different forms of mercantilism, and second, it reveals the dependent path created by the mercantilist oriented elite. Mercantilism in the thesis is used as dual-frameworked concept. First, it is a lens to see state behaviour. Despite the fact that mercantilism has been mainly used to explain a donor‘s behaviour, it can elucidate that of an aid-recipient state when the aid-seeking country is in dire need of the foreign aid for the survival of the state. The thesis applies mercantilism to explain aid-receiving countries‘behaviour. Second, more importantly, mercantilism also explains elite perspectives. The elite in aid receiving countries search for foreign aid not only for the wealth and power of their state, but also for the prosperity and survival of themselves. Mercantilism is used as an ostensible principle in practicing the private search for advantages of the elite. The thesis uses the dual-mercantilism idea to examine aid-seeking foreign policy in Korea and Ghana. In Korea, the elite saw the key to their survival in industrialising the nation, and their search for foreign aid took place based on that raison d’être. In Ghana, on the other hand, the elite found the way to their survival and prosperity in acquiring more foreign aid and the aid per se became the ultimate goal. The thesis finds industrial mercantilism a useful framework to understand the elite perspective in Korea

Більше джерел

Книги з теми "Oriented path":

Huang, J. C. Path-oriented program analysis. Cambridge: Cambridge University Press, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

T, Karamouzis Stamos, and United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., eds. A path-oriented matrix-based knowledge representation system. [Washington, DC]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Feyock, Stefan. A path-oriented matrix-based knowledge representation system. Hampton, Va: Langley Research Center, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Randhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Randhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Randhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Randhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Randhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Oriented path":

Mueck, Thomas A., and Martin L. Polaschek. "Aggregation Path Indexing." In Index Data Structures in Object-Oriented Databases, 123–40. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6213-9_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yang, Yong, Long Wang, Jing Gu, and Ying Li. "Transparently Capturing Execution Path of Service/Job Request Processing." In Service-Oriented Computing, 879–87. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03596-9_63.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liang, Tingting, Liang Chen, Jian Wu, Hai Dong, and Athman Bouguettaya. "Meta-Path Based Service Recommendation in Heterogeneous Information Networks." In Service-Oriented Computing, 371–86. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46295-0_23.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Altunay, M., D. Brown, G. Byrd, and R. Dean. "Trust-Based Secure Workflow Path Construction." In Service-Oriented Computing – ICSOC 2007, 382–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596141_29.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sarcar, Vaskaran. "Important Features in Java’s Enhancement Path." In Interactive Object-Oriented Programming in Java, 423–39. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5404-2_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cai, Zhicheng, Xiaoping Li, and Jatinder N. D. Gupta. "Critical Path-Based Iterative Heuristic for Workflow Scheduling in Utility and Cloud Computing." In Service-Oriented Computing, 207–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45005-1_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chen, Niu, An Liu, Guanfeng Liu, Jiajie Xu, and Lei Zhao. "Representation Learning Based Query Decomposition for Batch Shortest Path Processing in Road Networks." In Service-Oriented Computing, 257–72. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91431-8_16.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Oomoto, Eitetsu, Makoto Kamitani, and Toshiyuki Takamatsu. "Path Existence Constraints in Object-Oriented Databases." In Information Organization and Databases, 45–58. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-1379-7_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Toivonen, Hannu, Sébastien Mahler, and Fang Zhou. "A Framework for Path-Oriented Network Simplification." In Lecture Notes in Computer Science, 220–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13062-5_21.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Maleszka, Marcin, and Ngoc Thanh Nguyen. "Path-Oriented Integration Method for Complex Trees." In Agent and Multi-Agent Systems. Technologies and Applications, 84–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30947-2_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Oriented path":

Gotlieb, Arnaud, and Matthieu Petit. "Path-oriented random testing." In the 1st international workshop. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1145735.1145740.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gotlieb, Arnaud, and Matthieu Petit. "Constraint Reasoning in Path-Oriented Random Testing." In 2008 32nd Annual IEEE International Computer Software and Applications Conference. IEEE, 2008. http://dx.doi.org/10.1109/compsac.2008.78.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

"AN OPEN OBJECT ORIENTED PATH PLANNING SYSTEM." In 2nd International Conference on Informatics in Control, Automation and Robotics. SciTePress - Science and and Technology Publications, 2005. http://dx.doi.org/10.5220/0001177600170024.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hayasaka, Mitsuo, Thavisak Manodham, and Tetsuya Miki. "A Novel Path Protection Scheme with FEC Path in Connection Oriented Networks." In 2006 Asia-Pacific Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/apcc.2006.255823.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liang, Bomiao, Yan Xu, Fushuan Wen, Ivo Palu, Weijia Liu, Yusheng Xue, Yuquan Liu, and Huiyu Shang. "Fast Path-Oriented Strategy for Power System Restoration." In 2019 Electric Power Quality and Supply Reliability Conference (PQ) & 2019 Symposium on Electrical Engineering and Mechatronics (SEEM). IEEE, 2019. http://dx.doi.org/10.1109/pq.2019.8818244.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jian, Su, Weng Wenyong, and Wang Zebing. "A Teaching Path for Java Object Oriented Programming." In 2009 International Forum on Information Technology and Applications (IFITA). IEEE, 2009. http://dx.doi.org/10.1109/ifita.2009.229.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kang, Gitae, Yong Bum Kim, Won Suk You, Young Hun Lee, Hyun Seok Oh, Hyungpil Moon, and Hyouk Ryeol Choi. "Sampling-based path planning with goal oriented sampling." In 2016 IEEE International Conference on Advanced Intelligent Mechatronics (AIM). IEEE, 2016. http://dx.doi.org/10.1109/aim.2016.7576947.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Minjin, Huawei Li, and Xiaowei Li. "Multiple Coupling Effects Oriented Path Delay Test Generation." In 26th IEEE VLSI Test Symposium (vts 2008). IEEE, 2008. http://dx.doi.org/10.1109/vts.2008.9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wu, Jing, Xinlin He, Miao Shang, and Wenming Ma. "Exploration on Development Path for Application-oriented Universities." In Proceedings of the 2018 8th International Conference on Education and Management (ICEM 2018). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/icem-18.2019.10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Majumder, Md Badruddoja, Mesbah Uddin, Garrett S. Rose, and Jeyavijayan Rajendran. "Sneak path enabled authentication for memristive crossbar memories." In 2016 IEEE Asian Hardware-Oriented Security and Trust (AsianHOST). IEEE, 2016. http://dx.doi.org/10.1109/asianhost.2016.7835568.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Oriented path":

Nguyen, Daniel. Workflow Critical Path: A Data-Oriented Critical Path Metric for Holistic HPC Workflows. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.7369.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Green, Alastair, Paolo Guagliardo, and Leonid Libkin. Property graphs and paths in GQL: Mathematical definitions. Linked Data Benchmark Council, October 2021. http://dx.doi.org/10.54285/ldbc.tzjp7279.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper provides precise mathematical definitions of a property graph as specified in the proposed GQL international standard, which is an attributed mixed multigraph with loops. It further defines a partially-oriented walk in such a property graph, which is called a path in GQL, as well as restricted classes of such walks (trails, simple/acyclic paths).

Manzano, Osmel, and José Luis Saboin. Reverse Causality between Oil Policy and Fiscal Policy?: The Venezuelan Experience. Inter-American Development Bank, May 2021. http://dx.doi.org/10.18235/0003290.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper uses a model of intergenerational accounting to simulate the intergenerational distribution of oil wealth in Venezuela. Venezuelan oil production does not seem to follow an optimal extraction path. Nevertheless, this is true if we do not consider what the government does with the resources received from the oil sector. In this paper we explored the interaction of oil policy and fiscal policy using an intergeneration accounting model. We found that these interactions could explain certain outcomes. In particular, the model could explain why the sector was open for investment in 1991 and then “re-nationalized” in 2001. Results suggest that when fiscal policy could leave an important burden to future generations, voters seem to favor a more tax oriented oil policy, leaving the oil in the subsoil.

Anzolin, Guendalina. Productive Development Policies in the Mining Value Chain: Policy Opportunity and Alignment. Inter-American Development Bank, December 2021. http://dx.doi.org/10.18235/0003886.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Natural resources are an important source for development, and Latin America is one of the regions with the highest endowment. This calls for a reconsideration of resource-based development. Ambitious countries are moving toward high-value activities and more diversified economies to continue moving up the development ladder. In this sense, the resurgence of industrial policy can correct market failures and lead to the implementation of mission-oriented policies. This document analyzes opportunities to design and implement integrated policies through a revised taxonomy of mining-related policies, applying it to Australia, South Africa, and Chile. The mining sector has been a fertile field, characterized by high technology niches, growth, and innovation. Demand and supply policies can shape the path for development within the sector and across the economy due to the potential of vertical and horizontal linkages.

Fedasiuk, Ryan, and Jacob Feldgoise. The Youth Thousand Talents Plan and China’s Military. Center for Security and Emerging Technology, August 2020. http://dx.doi.org/10.51593/20200041.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

CSET research sheds light on the backgrounds and career paths of nearly 3,600 awardees in China’s Youth Thousand Talents Plan. While concerns over China’s recruitment of science and technology experts for military-supporting roles are legitimate, this brief finds that the vast majority of YTTP awardees receive civilian-oriented job offers.

Bray, Jonathan, Ross Boulanger, Misko Cubrinovski, Kohji Tokimatsu, Steven Kramer, Thomas O'Rourke, Ellen Rathje, Russell Green, Peter Robertson, and Christine Beyzaei. U.S.—New Zealand— Japan International Workshop, Liquefaction-Induced Ground Movement Effects, University of California, Berkeley, California, 2-4 November 2016. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, March 2017. http://dx.doi.org/10.55461/gzzx9906.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

There is much to learn from the recent New Zealand and Japan earthquakes. These earthquakes produced differing levels of liquefaction-induced ground movements that damaged buildings, bridges, and buried utilities. Along with the often spectacular observations of infrastructure damage, there were many cases where well-built facilities located in areas of liquefaction-induced ground failure were not damaged. Researchers are working on characterizing and learning from these observations of both poor and good performance. The “Liquefaction-Induced Ground Movements Effects” workshop provided an opportunity to take advantage of recent research investments following these earthquake events to develop a path forward for an integrated understanding of how infrastructure performs with various levels of liquefaction. Fifty-five researchers in the field, two-thirds from the U.S. and one-third from New Zealand and Japan, convened in Berkeley, California, in November 2016. The objective of the workshop was to identify research thrusts offering the greatest potential for advancing our capabilities for understanding, evaluating, and mitigating the effects of liquefaction-induced ground movements on structures and lifelines. The workshop also advanced the development of younger researchers by identifying promising research opportunities and approaches, and promoting future collaborations among participants. During the workshop, participants identified five cross-cutting research priorities that need to be addressed to advance our scientific understanding of and engineering procedures for soil liquefaction effects during earthquakes. Accordingly, this report was organized to address five research themes: (1) case history data; (2) integrated site characterization; (3) numerical analysis; (4) challenging soils; and (5) effects and mitigation of liquefaction in the built environment and communities. These research themes provide an integrated approach toward transformative advances in addressing liquefaction hazards worldwide. The archival documentation of liquefaction case history datasets in electronic data repositories for use by the broader research community is critical to accelerating advances in liquefaction research. Many of the available liquefaction case history datasets are not fully documented, published, or shared. Developing and sharing well-documented liquefaction datasets reflect significant research efforts. Therefore, datasets should be published with a permanent DOI, with appropriate citation language for proper acknowledgment in publications that use the data. Integrated site characterization procedures that incorporate qualitative geologic information about the soil deposits at a site and the quantitative information from in situ and laboratory engineering tests of these soils are essential for quantifying and minimizing the uncertainties associated site characterization. Such information is vitally important to help identify potential failure modes and guide in situ testing. At the site scale, one potential way to do this is to use proxies for depositional environments. At the fabric and microstructure scale, the use of multiple in situ tests that induce different levels of strain should be used to characterize soil properties. The development of new in situ testing tools and methods that are more sensitive to soil fabric and microstructure should be continued. The development of robust, validated analytical procedures for evaluating the effects of liquefaction on civil infrastructure persists as a critical research topic. Robust validated analytical procedures would translate into more reliable evaluations of critical civil infrastructure iv performance, support the development of mechanics-based, practice-oriented engineering models, help eliminate suspected biases in our current engineering practices, and facilitate greater integration with structural, hydraulic, and wind engineering analysis capabilities for addressing multi-hazard problems. Effective collaboration across countries and disciplines is essential for developing analytical procedures that are robust across the full spectrum of geologic, infrastructure, and natural hazard loading conditions encountered in practice There are soils that are challenging to characterize, to model, and to evaluate, because their responses differ significantly from those of clean sands: they cannot be sampled and tested effectively using existing procedures, their properties cannot be estimated confidently using existing in situ testing methods, or constitutive models to describe their responses have not yet been developed or validated. Challenging soils include but are not limited to: interbedded soil deposits, intermediate (silty) soils, mine tailings, gravelly soils, crushable soils, aged soils, and cemented soils. New field and laboratory test procedures are required to characterize the responses of these materials to earthquake loadings, physical experiments are required to explore mechanisms, and new soil constitutive models tailored to describe the behavior of such soils are required. Well-documented case histories involving challenging soils where both the poor and good performance of engineered systems are documented are also of high priority. Characterizing and mitigating the effects of liquefaction on the built environment requires understanding its components and interactions as a system, including residential housing, commercial and industrial buildings, public buildings and facilities, and spatially distributed infrastructure, such as electric power, gas and liquid fuel, telecommunication, transportation, water supply, wastewater conveyance/treatment, and flood protection systems. Research to improve the characterization and mitigation of liquefaction effects on the built environment is essential for achieving resiliency. For example, the complex mechanisms of ground deformation caused by liquefaction and building response need to be clarified and the potential bias and dispersion in practice-oriented procedures for quantifying building response to liquefaction need to be quantified. Component-focused and system-performance research on lifeline response to liquefaction is required. Research on component behavior can be advanced by numerical simulations in combination with centrifuge and large-scale soil–structure interaction testing. System response requires advanced network analysis that accounts for the propagation of uncertainty in assessing the effects of liquefaction on large, geographically distributed systems. Lastly, research on liquefaction mitigation strategies, including aspects of ground improvement, structural modification, system health monitoring, and rapid recovery planning, is needed to identify the most effective, cost-efficient, and sustainable measures to improve the response and resiliency of the built environment.

Bieder, Corinne, René Amalberti, Jean Pariès, Hervé Laroche, Eric Marsden, and Caroline Kamaté. Industrial safety in the age of “living with”: Uncertainty, complexity and rising expectations. Fondation pour une Culture de Sécurité Industrielle, April 2024. http://dx.doi.org/10.57071/420lwu.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Climate change, digital transformation, political, economic and geopolitical tensions, an increasingly arms-length relation to work: can industrial safety (and in particular, its management) continue to be conceived of, modeled and practiced in the same way as in the past, despite the major changes that have arisen over the past decades? The FonCSI invites interested stakeholders to join a debate on this question, which will involve critical analysis at the academic, industrial and practical levels. To kick off this debate, the current document provides an overview of the significant changes that have occurred since the beginning of the century and analyzes their potential impacts on safety management. These impacts are analyzed at both the conceptual (are the hypotheses and principles that underlie most safety models still valid?) and the practical (what are the implications for safety management professionals?) level. This exercise leads us to propose a number of possible paths forward for reflecting upon and managing safety in our changing world. We will be working with the academic community and interested stakeholders to discuss, improve and develop more practically oriented suggestions for reimagining safety management as a way of living with uncertainty and complexity rather than a commitment to ensuring control.

Kin, Eunjin, Jungyoon Choi, and Sang Yeon Min. Efficacy and safety of herbal medicines external application with Tuina in congenital muscular torticollis : A systematic review and meta-analysis protocol. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, January 2022. http://dx.doi.org/10.37766/inplasy2022.1.0017.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Review question / Objective: By 3 to 4 months of age, infants can keep their necks upright and look into both eyes horizontally. But infants with CMT have a wry neck also known as a twisted neck. Complementary therapies have been commonly used to treat CMT, such as tuina, acupuncture, herbal medicine. Among them, external application of herbal medicine is non-surgical and non-invasive inventions so it can be used widely in East Asia. This review aims to evaluate any form of external application of herbal medicines in CMT, such as cream, oil, extract, form of patch, etc. Information sources: We will electronically search the following database 4 English databases(MEDLINE, PubMed, EMBASE, the Cochrane Central Register of Controlled Trials), 3 Chinese databases(China National Knowledge Infrastructure(CNKI), Chinese Scientific Journal Database(VIP), Wan Fang Database), 4 Korean medical databases(Oriental Medicine Advanced Searching Integrated System(OASIS), Korean Studies Information Service System(KISS), National Digital Science Links(NDSL), Research Information Sharing Service(RISS)) from their founding date to June 2022, without any language restrictions.