• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.126-148
• /
• 2015

Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment-a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.

• 동력기계공학회지
• /
• 제7권1호
• /
• pp.34-41
• /
• 2003

A method is presented for generating the path which significantly reduces residual vibration of a flexible robot manipulator and applying control theory to track the desired path. The desired path is optimally designed so that the system completes the required move with minimum residual vibration. A closed loop control theory is applied to track the planned path in the case of load variation. Specifically, it is desired that the optimally designed path has a better trajectory tracking capabilities during the residual vibration over the cycloidal path, in various cases of load. Perturbation adaptive control is used as closed loop control scheme. A planar two link manipulator is used to evaluate this method.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2002년도 춘계학술대회 논문집
• /
• pp.66-69
• /
• 2002

In the ideal forming theory(1), which has been deviously developed as a direct method for optimizing forming process, material elements are required to deform following the minimum plastic work path (or the proportional true strain path). Besides the general theory(2,3), specific ideal forming theories have been developed for membrane sheet forming(4) as well as two-dimensional steady bulk forming(5-7). In this work, the ideal forming theory was successfully applied for non-steady bulk forming under the plane strain condition. Here, the shape change complying with the minimum plastic work path, was effectively described by developing a numerical code based on the characteristic method. Numerical results obtained for a specific industrial part also include the optimum pre-forming shape and its evolving shape change to the final shape as well as the boundary traction history.

• 대한가정학회지
• /
• 제41권3호
• /
• pp.73-91
• /
• 2003

This research tested the path model which examined the direct and indirect effects of family violence experience on perpetration of dating violence among college students. Two family violence variables such as witnessing parents' marital violence and being abused by parent were the exogeneous variables in the path model, while the mediated variables were consisted of (1) the social-learning-theory-derived variables such as acceptance of violence, positive outcome expectations of using violence, and aggressive conflict-coping behavior, and (2) control-theory-derived variables such as attachment, belief, and commitment. Data were from self-administered questionnaires completed by 332 male and 469 female students selected by stratified quota sampling method. The path analysis was done for males and females separately, since females reported significantly higher degree of dating violence than males. Results of the path analysis showed that first, for both males and females, being abused by parents directly and indirectly influenced dating violence, while witnessing parents' marital violence did not have effect on dating violence either directly or indirectly. Second, for male students, acceptance of violence and conflict coping behavior found to be the mediated variables in the effect of being abused by parents on dating violence. Third, for females, a control-theory-derived variable of belief as well as all three social learning theory-derived variables mediated the influence of being abused by parents on dating violence.

• 여성건강간호학회지
• /
• 제16권1호
• /
• pp.78-86
• /
• 2010

Purpose: This study was to examine the fitness of a path model based on the objectification theory and to expand it by including the new variables to explain eating disorder symptomatology (EDS). Methods: The subjects consisted of 444 college women. Data was collected through self-report questionnaires that measured self-objectification (SO), social physique anxiety (SPA) and EDS as the original variables in the objectification theory, and influence of mass media (IMM) and sex-role attitude (SRA) as the new variables. Data was analyzed by SPSS/WIN 12.0 and Amos 5.0 programs. Results: IMM and SRA showed direct effect on SO. IMM had direct and indirect effect on SPA and EDS. SRA had direct and indirect effect on EDS, but only indirect effect on SPA. SO and SPA influenced EDS directly, and SO influenced indirectly EDS. Conclusion: Path analyses indicated support for the original theory and the expanded theory. It is necessary for repeated studies including various age groups of women to clarify the applicability of the objectification theory to Korean women's eating disorders. And it were recommended that we should promote womens' criticism of the image and message about the perfect female body presented in the mass media, and to highlight the relationship of gender equality to women's eating disorders in health education.

• Journal of Information Processing Systems
• /
• 제17권5호
• /
• pp.879-891
• /
• 2021

With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.

• 한국IT서비스학회지
• /
• 제20권1호
• /
• pp.93-115
• /
• 2021

Various policy declarations and institutional experiments involving artificial intelligence are being made in most countries. Depending on how the artificial intelligence policy changes, the role of the government, the scope of the policy, and the policy means used may vary, which can lead to the success or failure of the policy. This study proposed a perspective on AI(Artificial Intelligence) in policy research, investigated the theory of path change, and derived the characteristics of path change in AI policy. Since AI policy is related to a wide range of policy areas and the policy making is at the start points, this study is based on the neo-institutional path theory about the types of institutional changes. As a result of this study, AI policy showed the characteristics of path creation, and in detail presented the conflict relationship between institutional design elements, the scalability of policy areas, policy stratification and policy mix, the top policy characteristics transcending the law, and the experiment for regulatory innovation. Since AI can also be used as a key tool for policy innovation in the future, research on the path and characteristics of AI policy will provide a new direction and approach to government policy or institutional innovation seeking digital transformation.

• KIEAE Journal
• /
• 제14권4호
• /
• pp.91-96
• /
• 2014

The behavior of walking involves our action of seeing things. It is the intention of this research that the cognitive process of perceiving things along the path can affect the way we sense the length of the journey. The theory generally accepted in this line of thought is the 'feature accumulation theory'. It assumes that if the journey includes many objects or memorable features, then our memory recalls that journey much farther than it really was. This study set up a real-life experiment by asking university students about their mental memory of the two different routes in the campus. One is a longer path that has not much to look at except trees and the other a shorter path yet with many buildings, sign boards and street furnitures. The subjects processed their mental image in the brain based on their experience. They showed a strong tendency that the path with more features were remembered longer while that with less features shorter. More interestingly, it was found that as their experience increases, they become more accurate about the exact length of the questioned paths. The result corroborates the theory that human perception of space is based on the topological understanding of surroundings rather than geometric understanding.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
• /
• pp.314-318
• /
• 2001

Constructing a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges, fuzzy weights can be used instead of crisp weights, and Type-2 fuzzy weights will be more suitable if this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type-2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.