Se connecter

Bibliographies thématiques / Oriented path / Articles de revues

Articles de revues sur le sujet « Oriented path »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Oriented path.

Auteur : Grafiati

Publié le 7 juillet 2024

Mis à jour le 7 juillet 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Oriented path ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Nešetřil, Jaroslav, et Xuding Zhu. « Path homomorphisms ». Mathematical Proceedings of the Cambridge Philosophical Society 120, n^o 2 (août 1996) : 207–20. http://dx.doi.org/10.1017/s0305004100074806.

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

2

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Junkkari, Marko, Johanna Vainio, Kati Iltanen, Paavo Arvola, Heidi Kari et Jaana Kekäläinen. « Path Expressions in SQL ». Journal of Database Management 27, n^o 3 (juillet 2016) : 1–22. http://dx.doi.org/10.4018/jdm.2016070101.

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

4

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

Texte intégral

Résumé :

<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>

Styles APA, Harvard, Vancouver, ISO, etc.

5

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

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

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Lacevic, Bakir, et Paolo Rocco. « Safety-oriented path planning for articulated robots ». Robotica 31, n^o 6 (21 février 2013) : 861–74. http://dx.doi.org/10.1017/s0263574713000143.

Texte intégral

Résumé :

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.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Li, Xiaohong, Ran Liu, Zhiyong Feng et Ke He. « Threat modeling-oriented attack path evaluating algorithm ». Transactions of Tianjin University 15, n^o 3 (juin 2009) : 162–67. http://dx.doi.org/10.1007/s12209-009-0029-y.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Reid, K. B., et Keith Wayland. « Minimum path decompositions of oriented cubic graphs ». Journal of Graph Theory 11, n^o 1 (1987) : 113–18. http://dx.doi.org/10.1002/jgt.3190110115.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Chaturvedi, Santosh K. « Recovery Oriented Services : Obstacle is the Path ». Journal of Psychosocial Rehabilitation and Mental Health 1, n^o 2 (décembre 2014) : 43–45. http://dx.doi.org/10.1007/s40737-014-0018-x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

11

Sheng, Kai, Zhen Li, Zhi Chao Song et Hong Duan. « Artificial Society-Oriented Large-Scale Road Path Querying Methods ». Applied Mechanics and Materials 644-650 (septembre 2014) : 2269–75. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2269.

Texte intégral

Résumé :

In artificial society simulation, each artificial population needs road path planning in the process of travel. However, because of the large amounts of populations in artificial society, road path planning will cost lots computational resources and time, thus this process has terrible efficiency to the performance of the simulation system. In order to solve this problem, this article firstly makes use of CPU to generate the artificial populations, travel logs, and construct the road network models; then computes the shortest road path between each two environments and load the results in RAM for prepare; lastly, sends the ID and its start point and destination of the population who need road path querying to GPU at current simulation time in the simulation process, and then takes advantages of GPU to query the road path and return the results back. In this way, we can obviously reduce the time costs in the process of road path querying and enormously improve the performance of the whole simulation system.

Styles APA, Harvard, Vancouver, ISO, etc.

12

Abdul Latip, Nor Badariyah, Rosli Omar et Sanjoy Kumar Debnath. « Optimal Path Planning using Equilateral Spaces Oriented Visibility Graph Method ». International Journal of Electrical and Computer Engineering (IJECE) 7, n^o 6 (1 décembre 2017) : 3046. http://dx.doi.org/10.11591/ijece.v7i6.pp3046-3051.

Texte intégral

Résumé :

<span>Path planning has been an important aspect in the development of autonomous cars in which path planning is used to find a collision-free path for the car to traverse from a starting point Sp to a target point Tp. The main criteria for a good path planning algorithm include the capability of producing the shortest path with a low computation time. Low computation time makes the autonomous car able to re-plan a new collision-free path to avoid accident. However, the main problem with most path planning methods is their computation time increases as the number of obstacles in the environment increases. In this paper, an algorithm based on visibility graph (VG) is proposed. In the proposed algorithm, which is called Equilateral Space Oriented Visibility Graph (ESOVG), the number of obstacles considered for path planning is reduced by introducing a space in which the obstacles lie. This means the obstacles located outside the space are ignored for path planning. From simulation, the proposed algorithm has an improvement rate of up to 90% when compared to VG. This makes the algorithm is suitable to be applied in real-time and will greatly accelerate the development of autonomous cars in the near future.</span>

Styles APA, Harvard, Vancouver, ISO, etc.

13

XIE, Xiao-Yuan, Bao-Wen XU, Liang SHI et Chang-Hai NIE. « Genetic Test Case Generation for Path-oriented Testing ». Journal of Software 20, n^o 12 (25 décembre 2009) : 3117–36. http://dx.doi.org/10.3724/sp.j.1001.2009.00580.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Lau, William, et Sanjay Jha. « Failure-Oriented Path Restoration Algorithm for Survivable Networks ». IEEE Transactions on Network and Service Management 1, n^o 1 (avril 2004) : 11–20. http://dx.doi.org/10.1109/tnsm.2004.4623690.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Peng, JingFu, Ye Ding, Gang Zhang et Han Ding. « Smoothness-oriented path optimization for robotic milling processes ». Science China Technological Sciences 63, n^o 9 (18 mai 2020) : 1751–63. http://dx.doi.org/10.1007/s11431-019-1529-x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

16

Olsson, Anders. « An object-oriented implementation of structural path-following ». Computer Methods in Applied Mechanics and Engineering 161, n^o 1-2 (août 1998) : 19–47. http://dx.doi.org/10.1016/s0045-7825(97)00307-1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

Pang, Qiangwei, Yongjiang Hu, Wenguang Li et Lina Chu. « Multi-target oriented UAV reconnaissance path planning algorithm ». IOP Conference Series : Materials Science and Engineering 563 (9 août 2019) : 052058. http://dx.doi.org/10.1088/1757-899x/563/5/052058.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

Blanco-Oliver, Antonio, Ana Irimia-Dieguez et Nuria Reguera-Alvarado. « Prediction-oriented PLS path modeling in microfinance research ». Journal of Business Research 69, n^o 10 (octobre 2016) : 4643–49. http://dx.doi.org/10.1016/j.jbusres.2016.03.054.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

19

Havet, Frédéric. « Finding an Oriented Hamiltonian Path in a Tournament ». Journal of Algorithms 36, n^o 2 (août 2000) : 253–75. http://dx.doi.org/10.1006/jagm.2000.1085.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

20

Mhanna, Batool. « Matrix of relative forest accessibility of the oriented path and the oriented cycle ». Chebyshevskii sbornik 22, n^o 2 (2021) : 183–201. http://dx.doi.org/10.22405/2226-8383-2021-22-2-183-201.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

21

Nguyen, Daniel D., et Karen L. Karavanic. « Workflow Critical Path : A data-oriented critical path metric for Holistic HPC Workflows ». BenchCouncil Transactions on Benchmarks, Standards and Evaluations 1, n^o 1 (octobre 2021) : 100001. http://dx.doi.org/10.1016/j.tbench.2021.100001.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

22

OH, Yeon Taek. « Study of Goal Oriented Obstacle Avoidance for Mobile Robot ». International Journal of Emerging Technology and Advanced Engineering 11, n^o 10 (15 octobre 2021) : 13–21. http://dx.doi.org/10.46338/ijetae1021_02.

Texte intégral

Résumé :

—This paper suggests simultaneous mechanism which makes UGV to secure its safety and recreate optimum path right after obstacle avoidance occurs. Research target and sensors is shown and the suggested optimum region path algorithm is presented. Also, this paper provides the performance of suggested algorithm by simulation, and will propose the direction of the future plans. The fixed and varying weight algorithm satisfy the constraints, once the robot arrives at the goal position in the simulation. However, the fixed weight algorithm was not able to drive on the shortest path, which is optimal, with many other successful weight values. On the other hand, the varying weight algorithm successfully generated the optimized path by changing the weight values in term of local environment. Especially, in the second simulation, the robot was able to safely arrive to the goal with little time period. This paper proposed VTV and Local Optimal path algorithm that the robot can generate the optimal path to the goal position without colliding obstacles as adapting Fuzzy controller which continuously optimizes the weight values of the cost function in terms of local environment

Styles APA, Harvard, Vancouver, ISO, etc.

23

Liu, Yong-tao, Rui-zhi Sun, Tian-yi Zhang, Xiang-nan Zhang, Li Li et Guo-qing Shi. « Warehouse-Oriented Optimal Path Planning for Autonomous Mobile Fire-Fighting Robots ». Security and Communication Networks 2020 (20 juin 2020) : 1–13. http://dx.doi.org/10.1155/2020/6371814.

Texte intégral

Résumé :

In order to achieve the fastest fire-fighting purpose, warehouse autonomous mobile fire-fighting robots need to make an overall optimal planning based on the principle of the shortest time for their traveling path. A∗ algorithm is considered as a very ideal shortest path planning algorithm, but the shortest path is not necessarily the optimal path for robots. Furthermore, the conventional A∗ algorithm is affected by the search neighborhood restriction and the theoretical characteristics, so there are many problems, which are closing to obstacles, more inflection points, more redundant points, larger total turning angle, etc. Therefore, A∗ algorithm is improved in eight ways, and the inflection point prior strategy is adopted to compromise Floyd algorithm and A∗ algorithm in this paper. According to the criterion of the inflection point in this paper, the path inflection point arrays are constructed and traveling all path nodes are replaced by traveling path inflection points for the conventional Floyd algorithm backtracking, so it greatly reduces the backtracking time of the smooth path. In addition, this paper adopts the method of the extended grid map obstacle space in path planning safety distance. According to the relationship between the actual scale of the warehouse grid map and the size of the robot body, the different safe distance between the planning path and the obstacles is obtained, so that the algorithm can be applied to the safe path planning of the different size robots in any map environments. Finally, compared with the conventional A∗ algorithm, the improved algorithm reduces by 7.846% for the path length, reduces by 71.429% for the number of the cumulative turns, and reduces by 75% for the cumulative turning angle through the experiment. The proposed method can ensure robots to move fast on the planning path and ultimately achieve the goal of reducing the number of inflection points, reducing the cumulative turning angle, and reducing the path planning time.

Styles APA, Harvard, Vancouver, ISO, etc.

24

Li, Yi, Zhen Hui Song et Li Zhao. « Path Planning for Mobile Robot with Clonal Selection Algorithm ». Applied Mechanics and Materials 256-259 (décembre 2012) : 2943–46. http://dx.doi.org/10.4028/www.scientific.net/amm.256-259.2943.

Texte intégral

Résumé :

Aiming at the problem of path planning for a mobile robot, an oriented clonal selection algorithm is proposed. Firstly, the static environment was expressed by a map with nodes and links. Secondly, the locations of target and obstacles were defined. Thirdly, an oriented mutation operator was used to accelerate the evolutionary progress. In this way, we can find an optimal solution with proposed oriented clonal algorithm. Experiment results demonstrate that the algorithm is simple, effective, to solve the problem of robot path planning in a static environment

Styles APA, Harvard, Vancouver, ISO, etc.

25

Bosman, F. T., et J. W. Arends. « Teaching pathology in a problem-oriented curriculum : The Maastricht experience ». Journal of Pathology 159, n^o 2 (octobre 1989) : 175–78. http://dx.doi.org/10.1002/path.1711590214.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

26

Han, Xiao, et Jiayun Zhang. « Business Model Innovation Paths of Manufacturing Oriented towards Green Development in Digital Economy ». International Journal of Environmental Research and Public Health 19, n^o 24 (8 décembre 2022) : 16454. http://dx.doi.org/10.3390/ijerph192416454.

Texte intégral

Résumé :

China’s manufacturing industry has been confronted with the issue of extensive development with high input, high consumption, and high emissions for a long time, and its green development is the key to reaching carbon neutrality in China. Under the digital economy, business model innovation is the fundamental means of the green development of manufacturing enterprises. Four representative listed companies in China’s manufacturing were selected as typical cases for the case study. Through open, axial, and selective coding that is based on proceduralized grounded theory, this study profoundly explores business model innovation paths of the manufacturing industry oriented towards green development in the digital economy following the research logic of “green development orientation–business model innovation process–business model innovation result”. Moreover, this study further compares the differences among paths and discusses each path’s effectiveness and applicable conditions. Results show that: (1) Four green business model innovation paths are revealed based on the four green development orientations: efficiency-oriented path, value-oriented path, user-oriented path, and ecology-oriented path. (2) Different enterprises pursue distinct business model innovation paths. The scientific premise for enterprises to opt for the optimal innovation path is the matching of upgrading demands, existing conditions, and path characteristics. Ultimately, the following policy implications are offered: First, promote the green innovation of business models in the manufacturing industry. Second, consider enterprises’ heterogeneity and implement differentiated support policies. This study can serve as theoretical support and decision-making reference for business model innovation and green development in manufacturing enterprises.

Styles APA, Harvard, Vancouver, ISO, etc.

27

Wang, Dawei. « Analysis On The Path And Difficulties Of Chemical Energy Marketization Reform ». E3S Web of Conferences 252 (2021) : 03042. http://dx.doi.org/10.1051/e3sconf/202125203042.

Texte intégral

Résumé :

Chemical energy market-oriented reform is a series of important meeting requirements of the central government, which has a very arduous reform task in the context of the information age. In view of this phenomenon, analysis on the path and difficulties of chemical energy marketization reform. The market-oriented reform of chemical energy is the requirement of a series of important meetings of the central government, which has a very arduous reform task in the context of the information age. In view of this phenomenon, the path and difficulties of chemical energy market-oriented reform are analyzed. Build a complex of multiple system subtypes, integrate the price, output, benefit and other indicators of chemical materials to reach a balance point, and meet the different needs of market-oriented reform of different chemical energy enterprises; coordinate the overall reform of the whole industrial chain, including the top-level design of the whole industrial chain reform, the combination of state-owned enterprise reform and chemical industry reform, and the reform of government approval In addition, we should take a comprehensive view of energy and environment, and vigorously develop renewable energy and clean energy. Through the analysis of the difficulties in the market-oriented reform of chemical energy, it is concluded that: at present, the administrative measures for the market-oriented reform of chemical energy in China are temporary but not permanent, most energy enterprises think that the attraction of the proposed policies is low and can not promote the market-oriented reform of chemical energy enterprises; the energy system can not be typified, and it is difficult to classify it as planned economy or market economy based on the atypical characteristics of chemical energy market Market economy increases the difficulty of chemical energy market-oriented reform.

Styles APA, Harvard, Vancouver, ISO, etc.

28

이상근. « Path-oriented Telicity and the Extended Verb Phrase Structure ». Studies in Generative Grammar 17, n^o 3 (août 2007) : 291–312. http://dx.doi.org/10.15860/sigg.17.3.200708.291.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

29

Liu, Ye, Luan Shi et Li Liu. « Research on the Realization Path of Application-Oriented University ». Open Journal of Social Sciences 08, n^o 06 (2020) : 387–93. http://dx.doi.org/10.4236/jss.2020.86029.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

30

Zhao, Shengjie, Xinxiang Zong et Nan Wu. « Design of Load Path-oriented BCCz Lattice Sandwich Structures ». Journal of Physics : Conference Series 2239, n^o 1 (1 avril 2022) : 012014. http://dx.doi.org/10.1088/1742-6596/2239/1/012014.

Texte intégral

Résumé :

Abstract Lattice structures are increasingly used in lightweight designs due to the advances of additive manufacturing. The overall performance of the lattice structures highly depends on the lattice cell arrangement. Previous studies show that body-centered cubic with z-axis reinforcement (BCCz) lattice has higher stiffness and strength compared to regular body-centered cubic (BCC) lattice subject to unidirectional compression. In this report, a load path-based methodology for the design of BCCz lattice sandwich structure with variable reinforcement directions is presented. A homogenization model of the sandwich structure with a specified volume fraction is developed first. Load path analysis is then conducted on the homogenization model to calculate the pointing stress vectors, which are lastly used to determine the orientations of BCCz cells. Based on the numerical simulations of a cantilever sandwich structure, the proposed lattice design has superior specific stiffness over the designs based on BCC or uniformly oriented BCCz unit cells.

Styles APA, Harvard, Vancouver, ISO, etc.

31

Jiayuan, Lu. « Space Robot Motion Planning Oriented to Autonomous Capture Path ». Journal of Physics : Conference Series 1939, n^o 1 (1 mai 2021) : 012118. http://dx.doi.org/10.1088/1742-6596/1939/1/012118.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Lee, Kelvin, Yu Jiang, Avishai (Avi) Ceder, Justin Dauwels, Rong Su et Otto Anker Nielsen. « Path-oriented synchronized transit scheduling using time-dependent data ». Transportation Research Part C : Emerging Technologies 136 (mars 2022) : 103505. http://dx.doi.org/10.1016/j.trc.2021.103505.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

33

Moadab, Shahram, et Mohsen Falah Rad. « Diagnostic Path-Oriented Test Data Generation by Hyper Cuboids ». International Journal of Information Engineering and Electronic Business 6, n^o 6 (8 décembre 2014) : 1–14. http://dx.doi.org/10.5815/ijieeb.2014.06.01.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

34

Geiger, H. Jack. « Community-Oriented Primary Care : A Path to Community Development ». American Journal of Public Health 92, n^o 11 (novembre 2002) : 1713–16. http://dx.doi.org/10.2105/ajph.92.11.1713.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

35

Bao, Xiaoan, Zijian Xiong, Na Zhang, Junyan Qian, Biao Wu et Wei Zhang. « Path-oriented test cases generation based adaptive genetic algorithm ». PLOS ONE 12, n^o 11 (14 novembre 2017) : e0187471. http://dx.doi.org/10.1371/journal.pone.0187471.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

36

Moon Jung Chung et Sangchul Kim. « A path-oriented algorithm for the cell selection problem ». IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14, n^o 3 (mars 1995) : 296–307. http://dx.doi.org/10.1109/43.365121.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

37

Liu, Yike, Hongchuan Sun et Xu Chang. « Crosswell imaging by two-dimensional oriented wave path migration ». Geophysical Journal International 169, n^o 1 (avril 2007) : 233–39. http://dx.doi.org/10.1111/j.1365-246x.2006.03281.x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

38

Duttweiler, Luke, et Nathan Reff. « Spectra of cycle and path families of oriented hypergraphs ». Linear Algebra and its Applications 578 (octobre 2019) : 251–71. http://dx.doi.org/10.1016/j.laa.2019.05.008.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

39

Cappellari, Paolo, Roberto De Virgilio et Mark Roantree. « Path-oriented keyword search over graph-modeled Web data ». World Wide Web 15, n^o 5-6 (21 décembre 2011) : 631–61. http://dx.doi.org/10.1007/s11280-011-0153-1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

40

Moadab, Shahram, et Hassan Rashidi. « Automatic path-oriented test data generation by boundary hypercuboids ». Journal of King Saud University - Computer and Information Sciences 28, n^o 1 (janvier 2016) : 82–97. http://dx.doi.org/10.1016/j.jksuci.2015.05.002.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

41

NIKRAVAN, Esmaeel, et Saeed PARSA. « Path-oriented random testing through iterative partitioning (IP-PRT) ». TURKISH JOURNAL OF ELECTRICAL ENGINEERING & ; COMPUTER SCIENCES 27, n^o 4 (26 juillet 2019) : 2666–80. http://dx.doi.org/10.3906/elk-1801-18.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

Desai, Bhupat M., et N. V. Namboodiri. « Cooperative Rural Banking : Anad Shows the Growth-oriented Path ». Vikalpa : The Journal for Decision Makers 21, n^o 4 (octobre 1996) : 27–46. http://dx.doi.org/10.1177/0256090919960403.

Texte intégral

Résumé :

Anad Farmers Service Cooperative Bank is an innovative bank in both the spirit of its cooperation and rural banking. This bank is also financially viable and growth-oriented. This paper by Bhupat M Desai and N V Namboodiri analyses how this bank could be successful under the same macro rural credit policies that governed most rural financial institutions. The paper also offers some suggestions on what macro rural credit policies may continue and which ones need modifications to extend the experiment of this bank.

Styles APA, Harvard, Vancouver, ISO, etc.

43

Seo, Sang Koo, et Yoon Joon Lee. « Optimal evaluation of path predicates in object-oriented queries ». Microprocessing and Microprogramming 40, n^o 10-12 (décembre 1994) : 751–54. http://dx.doi.org/10.1016/0165-6074(94)90033-7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

44

Lenis, Angelos, Vasilis Merekoulias et Vasilis Maglaris. « Designing Connection Oriented Networks for Multi-Domain Path Resilience ». Journal of Network and Systems Management 18, n^o 4 (6 janvier 2010) : 374–94. http://dx.doi.org/10.1007/s10922-009-9155-z.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

45

Ma, Zheng, et Guan Bo Wang. « Research on Camera-Oriented Smart Car and Intelligent Control ». Applied Mechanics and Materials 260-261 (décembre 2012) : 342–47. http://dx.doi.org/10.4028/www.scientific.net/amm.260-261.342.

Texte intégral

Résumé :

This paper designs a camera-oriented smart car along with specialized intelligent control algorithms. MC9S12XS128 is chosen as the central processing unit and a CCD sensor along with peripheral circuit is designed as the camera module. The proposed system integrates technologies of intelligent control, Micro-Electro-Mechanism System (MEMS), System on Chip (SOC), wireless communication and low power consumption embedded technology, realizing autonomous navigation while tracking the path. In the paper, the extraction of path information is streamlined, where dynamic threshold method is used for image binarization and path optimization is done with least square method. Control algorithms are highlighted, where servo control incorporates least squares method creatively and the DC motor control, forming a closed-loop system with a rotatory encoder, adopts incremental PID control algorithm.

Styles APA, Harvard, Vancouver, ISO, etc.

46

Arokiasami, Willson Amalraj, Prahlad Vadakkepat, Kay Chen Tan et Dipti Srinivasan. « Real-Time Path-Generation and Path-Following Using an Interoperable Multi-Agent Framework ». Unmanned Systems 06, n^o 04 (octobre 2018) : 231–50. http://dx.doi.org/10.1142/s2301385018500061.

Texte intégral

Résumé :

Autonomous unmanned vehicles are preferable in patrolling, surveillance and, search and rescue missions. Multi-agent architectures are commonly used for autonomous control of unmanned vehicles. Existing multi-robot architectures for unmanned aerial and ground robots are generally mission and platform oriented. Collision avoidance, path-planning and tracking are some of the fundamental requirements for autonomous operation of unmanned robots. Though aerial and ground vehicles operate differently, the algorithms for obstacle avoidance, path-planning and path-tracking can be generalized. Service Oriented Interoperable Framework for Robot Autonomy (SOIFRA) proposed in this work is an interoperable multi-agent framework focused on generalizing platform independent algorithms for unmanned aerial and ground vehicles. SOIFRA is behavior-based, modular and interoperable across unmanned aerial and ground vehicles. SOIFRA provides collision avoidance, and, path-planning and tracking behaviors for unmanned aerial and ground vehicles. Vector Directed Path-Generation and Tracking (VDPGT), a vector-based algorithm for real-time path-generation and tracking, is proposed in this work. VDPGT dynamically adopts the shortest path to the destination while minimizing the tracking error. Collision avoidance is performed utilizing Hough transform, Canny contour, Lucas–Kanade sparse optical flow algorithm and expansion of object-based time-to-contact estimation. Simulation and experimental results from Turtlebot and AR Drone show that VDPGT can dynamically generate and track paths, and SOIFRA is interoperable across multiple robotic platforms.

Styles APA, Harvard, Vancouver, ISO, etc.

47

Chen, Qihong, Qingsong Zhao et Zhigang Zou. « Threat-Oriented Collaborative Path Planning of Unmanned Reconnaissance Mission for the Target Group ». Aerospace 9, n^o 10 (4 octobre 2022) : 577. http://dx.doi.org/10.3390/aerospace9100577.

Texte intégral

Résumé :

Unmanned aerial vehicle (UAV) cluster combat is a typical example of an intelligent cluster application, and it is characterized by its large scale, low cost, retrievability, and intra-cluster autonomous coordination. An unmanned reconnaissance mission for a target group (URMFTG) is a significant pattern in UAV cluster combat. This paper discusses the collaborative path planning problem of unmanned aerial vehicle formations (UAVFs) and refueling tankers in a URMFTG with threat areas and fuel constraints. The purpose of collaborative path planning is to ensure that the UAVFs (with fuel constraints) can complete the reconnaissance mission for the target group with the assistance of refueling tankers, which is one of the most important constraints in the collaborative path planning. In this paper, a collaborative path-planning model is designed to analyze the relationship between the planning path of the UAVFs and the tankers, and a threat avoidance strategy is designed considering the threat area. This paper proposes a two-stage solution algorithm. It creates a UAVFs path-planning algorithm based on the fast search genetic algorithm (FSGA) and a refueling tanker path-planning algorithm based on the improved non-dominated sorting genetic algorithm II (NSGA-II). Based on simulation experiments, the solution method proposed in this paper can provide a better path-planning scheme for a URMFTG. That is, it decreases the rate of the UAVF’s distance growth from 3.1% to 2.2% for the path planning of UAVFs and provides a better Pareto solution set for the path planning of refueling tankers.

Styles APA, Harvard, Vancouver, ISO, etc.

48

Zuo, Jing, et Yanxin Ye. « On the Unique Development Path of Universities of Applied Sciences ». Review of Educational Theory 1, n^o 1 (1 février 2018) : 24. http://dx.doi.org/10.30564/ret.v1i1.17.

Texte intégral

Résumé :

The transition of universities from academy-oriented to application-oriented has become a paramount mission for the management. And the revelation of the path for the unique development lies in the six aspects below: locating specific talents-cultivating goals, innovating educational plans, developing distinctive teaching resources, enhancing instructions for students' vocation and employment, optimizing teaching equipment and increasing publicity.

Styles APA, Harvard, Vancouver, ISO, etc.

49

Chen, Xiaoyan, Ting Wang, Yan Liu et Zixin Dou. « Configurational Path to Collaborative Innovation in Large and Complex Construction Projects ». Buildings 14, n^o 1 (2 janvier 2024) : 117. http://dx.doi.org/10.3390/buildings14010117.

Texte intégral

Résumé :

Collaborative innovation contributes to sustainable development in many industries. Although there is a growing literature on collaborative innovation, it is still unclear whether and how configurations of drivers affect collaborative innovation in large and complex construction projects (hereafter megaprojects). This research adopts fuzzy-set qualitative comparative analysis (fsQCA) to explore multiple conjunctural causations of collaborative innovation in megaprojects. The findings show that four equifinal solutions can influence collaborative innovation in megaprojects, i.e.: “system innovation-oriented” (configuration 1), “radical innovation-oriented” (configuration 2), “second-tier supplier oriented” (configuration 3), and “modular or architectural innovation-oriented” (configuration 4). This study contributes to explaining the mechanisms regarding how configurations of drivers contribute to collaborative innovation in megaprojects. It also contributes to the development of collaborative innovation research in a construction project context. The research findings provide construction project managers with four useful suggestions for promoting collaborative innovation in megaprojects.

Styles APA, Harvard, Vancouver, ISO, etc.

50

NARAYANAN, BHARGAV. « Connections in Randomly Oriented Graphs ». Combinatorics, Probability and Computing 27, n^o 4 (6 décembre 2016) : 667–71. http://dx.doi.org/10.1017/s0963548316000341.

Texte intégral

Résumé :

Given an undirected graph G, let us randomly orient G by tossing independent (possibly biased) coins, one for each edge of G. Writing a → b for the event that there exists a directed path from a vertex a to a vertex b in such a random orientation, we prove that for any three vertices s, a and b of G, we have ℙ(s → a ∩ s → b) ⩾ ℙ(s → a) ℙ(s → b).

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!