• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.35 no.3
• /
• pp.245-253
• /
• 2011

We investigate the flow characteristics of elementary-flow paths with $90^{\circ}$ bends; a velocity-control trim consists of such paths. For geometric similarity, the width and length of each path are selected, and the number of bends is 0, 4, or 8. The flow tests are conducted with the same flow-path elements. The numerical results are in good agreement with the experimental data. In elements without bends, the volume flow rate decreases with the length of the flow path, with a constant pressure drop between the inlet and the outlet. However, in flow paths with $90^{\circ}$ bends, it increases and then decreases with the length of the flow path. For a fixed number of $90^{\circ}$ bends, better pressure-drop characteristics are observed as the length of the flow path increases. For a fixed flow-path length, a flow-path element with more bends has a smoother pressure drop along the path.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2325-2330
• /
• 2005

A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.11
• /
• pp.634-639
• /
• 2002

A Shortest Path Algorithm is the method to find the most efficient route among many routes from a start node to an end node. It is based on Labeling methods. In Labeling methods, there are Label-Setting method and Label-Correcting method. Label-Setting method is known as the fastest one among One-to-One shortest path algorithms. But Benjamin[1,2] shows Label-Correcting method is faster than Label-Setting method by the experiments using large road data. Since Graph Growth algorithm which is based on Label-Correcting method is made to find One-to-All shortest path, it is not suitable to find One-to-One shortest path. In this paper, we propose a new One-to-One shortest path algorithm. We show that our algorithm is faster than Graph Growth algorithm by extensive experiments.

• Journal of Families and Better Life
• /
• v.24 no.6 s.84
• /
• pp.95-116
• /
• 2006

The purpose of this study was to validate a hypothetical path model of maternal childhood attachment, emotions, parenting behaviors, and child behavioral problems. The research was conducted with 240 sets or mothers and their children 70 mother-child teams from seven counseling organizations including the Children's Counseling Clinic, Community Social Welfare Service Center, and Welfare Service Center for the Disabled in Seoul, Incheon, and Pyeongtaek, and 170 elementary school children from Seoul and their mothers. Consequently, a total of 200 mother-child teams were selected for this study. The data in this study were analyzed with SPSS 12.0 program and LISREL 8.3 program. The result of this study is as follows: (1) Examining the path of paternal attachment and the internalizing and externalizing behavioral problems, it was noted that paternal attachment had the indirect effect of anxiety and over-protection on the path to internalizing problems and the indirect effect of anxiety also noted is that there is a full-mediation of anxiety and over-protection between paternal attachment and the internalizing problems. (2) Examining the path of maternal attachment and the internalizing problems, it was noted that maternal attachment has direct effect on the internalizing problems. Maternal attachment has the indirect effect of self-esteem depression, anxiety and over-protection on the Path, and the indirect effect of self-esteem, anxiety and over-protection. (3) Examining the path of maternal attachment and the externalizing problems, it was noted that maternal attachment has direct effect on the externalizing problems and on the path to the externalizing problems, and maternal attachment has the indirect effect of depression, the indirect effect of self-esteem and authoritarian control, and the indirect effect of self-esteem and depression.

• Restorative Dentistry and Endodontics
• /
• v.44 no.2
• /
• pp.22.1-22.8
• /
• 2019

Objectives: The aim of this study was to investigate the effect of glide path preparation with PathFile and ProGlider nickel-titanium (NiTi) files on the cyclic fatigue resistance of WaveOne NiTi files. Materials and Methods: Forty-four WaveOne Primary files were used and divided into four groups (n = 11). In the first group (0 WaveOne), the WaveOne Primary files served as a control group and were not used on acrylic blocks. In the 1 WaveOne Group, acrylic blocks were prepared using only WaveOne Primary files, and in the PF+WaveOne group and PG+WaveOne groups, acrylic blocks were first prepared with PathFile or ProGlider NiTi files, respectively, followed by the use of WaveOne Primary files. All the WaveOne Primary files were then subjected to cyclic fatigue testing. The number of cycles to failure was calculated and the data were statistically analyzed using one-way analysis of variance (ANOVA) and the Tukey honest significant difference multiple-comparison test at a 5% significance level. Results: The highest number of cycles to failure was found in the control group, and the lowest numbers were found in the 1 WaveOne group and the PF+WaveOne group. Significant differences were found among the 1 WaveOne, PF+WaveOne, and control groups (p < 0.05). No statistically significant differences were found between the PG+WaveOne group and the other three groups (p > 0.05). Conclusion: Glide path preparation with NiTi rotary files did not affect the cyclic fatigue resistance of WaveOne Primary files used on acrylic blocks.

• Journal of Forest and Environmental Science
• /
• v.37 no.3
• /
• pp.260-268
• /
• 2021

This study was conducted to grasp users' preferences and behavior of forest paths and to provide basic data for forest path construction in the future. Among forest path users, males and females over 20 years old were surveyed on forest path preferences, motives for visiting, using time and distance, companions, and sources for obtaining information on forest paths. A total of 587 people participated in the questionnaire, and cross-analysis was conducted simultaneously using the SPSS statistical program. In analyzing the preference of forest paths, it was found that male and the general public preferred trekking path for activities while female and foresters preferred forest path for relaxation and healing (p<0.05). As for the motives for visiting forest paths, the response that they visited for a walk/rest was the highest in gender, occupation, and age group. As for the number of annual visits, less than 5 was the highest in overall, and foresters tended to visit forest path more often than the general public, and the number of visits to the forest paths increased with age (p<0.01). The most common route to acquire information about forest paths is the Internet, while the Internet use is relatively low in those over 60s (p<0.05). The response ratio of accompanying their family in visiting forest paths were the highest, while the response in their 20s and 60s was the most in accompanying their friends (p<0.05).

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.275-283
• /
• 2017

A large amount of RDF data has been generated along with the increase of semantic web services. Various distributed storage and query processing schemes have been studied to efficiently use the massive amounts of RDF data. In this paper, we propose a distributed SPARQL query processing scheme that considers the data locality and query execution path of large RDF data. The proposed scheme considers the data locality and query execution path in order to reduce join and communication costs. In a distributed environment, when processing a SPARQL query, it is divided into several sub-queries according to the conditions of the WHERE clause by considering the data locality. The proposed scheme reduces data communication costs by grouping and processing the sub-queries through the index based on associated nodes. In addition, in order to reduce unnecessary joins and latency when processing the query, it creates an efficient query execution path considering data parsing cost, the amount of each node's data communication, and latency. It is shown through various performance evaluations that the proposed scheme outperforms the existing scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.1921-1929
• /
• 1997

This paper describes a direct transmission method of multimedia data stream between a multimedia data processor and a communication interface without using system memory. I propose the direct transfer method of multimedia data through the single data path, without additional data path between a multimedia data processor and a communication interface in multimedia platforms. The hardware architecture and functions for the direct transfer method is defined. Procedure to transfer multimedia data to and from the multimedia data processor is described by means of control flow chart. Comparing the proposed method with general methods, I show that the proposed method can decrease number of bus accesses and bus cycles.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3151-3168
• /
• 2021

Internet of Things (IoT) connects several objects with embedded sensors and they are capable of exchanging information between devices to create a smart environment. IoT smart devices have limited resources, such as batteries, computing power, and bandwidth, but comprehensive sensing causes severe energy restrictions, lowering data quality. The main objective of the proposal is to build a hybrid protocol which provides high data quality and reduced energy consumption in IoT sensor network. The hybrid protocol gives a flexible and complete solution for sensor selection problem. It selects a subset of active sensor nodes in the network which will increase the data quality and optimize the energy consumption. Since the unused sensor nodes switch off during the sensing phase, the energy consumption is greatly reduced. The hybrid protocol uses Dijkstra's algorithm for determining the shortest path for sensing data and Ant colony inspired variable path selection algorithm for selecting active nodes in the network. The missing data due to inactive sensor nodes is reconstructed using enhanced belief propagation algorithm. The proposed hybrid method is evaluated using real sensor data and the demonstrated results show significant improvement in energy consumption, data utility and data reconstruction rate compared to other existing methods.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2008.06a
• /
• pp.969-970
• /
• 2008