• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.38.2-38
• /
• 2002

1. Introduction 2. Potential theory and Local minimum problem 3. Discrete modeling method 4. Virtual obstacle concept and extra potential function 5. Simulations 6. Conclusions

• Korean Journal of Mathematics
• /
• v.14 no.1
• /
• pp.47-55
• /
• 2006

This paper presents an image analysis technique using connected components by applying SPA (shortest path algorithm) from graph theory. Software implementation of Floyd-Warshall transitive matrix labelling method is discussed. Results are also presented.

• Structural Engineering and Mechanics
• /
• v.11 no.2
• /
• pp.199-210
• /
• 2001

Axially compressed circular cylinders repeat symmetry-breaking bifurcation in the postbuckling region. There exist stable equilibria with all symmetry broken in the buckled configuration, and the minimum postbuckling strength is attained at the deep bottom of closely spaced equilibrium branches. The load level corresponding to such postbuckling stable solutions is usually much lower than the initial buckling load and may serve as a strength limit in shell stability design. The primary concern in the present paper is to compute these possible postbuckling stable solutions at the deep bottom of the postbuckling region. Two computational approaches are used for this purpose. One is the application of individual procedures in computational bifurcation theory. Path-tracing, pinpointing bifurcation points and (local) branch-switching are all applied to follow carefully the postbuckling branches with the decreasing load in order to attain the target at the bottom of the postbuckling region. The buckled shell configuration loses its symmetry stepwise after each (local) branch-switching procedure. The other is to introduce the idea of path jumping (namely, generalized global branch-switching) with static imperfection. The static response of the cylinder under two-parameter loading is computed to enable a direct access to postbuckling equilibria from the prebuckling state. In the numerical example of an elastic perfect circular cylinder, stable postbuckling solutions are computed in these two approaches. It is demonstrated that a direct path jump from the undeformed state to postbuckling stable equilibria is possible for an appropriate choice of static perturbations.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.1
• /
• pp.76-83
• /
• 2010

There have been many studies regarding development of autonomous excavation system which is helpful in construction sites where repetitive jobs are necessary. Unfortunately, bucket trajectory planning was excluded from the previous studies. Since, the best use of excavator is to dig efficiently; purpose of this research was set to determine an optimized bucket trajectory in order to get best digging performance. Among infinite ways of digging any given path, criterion for either optimal or efficient bucket moves is required to be established. One method is to adopt work know-how from experienced excavator operator; However the work pattern varies from every worker to worker and it is hard to be analyzed. Thus, other than the work pattern taken from experienced operator, we developed an efficiency model to solve this problem. This paper presents a method to derive a bucket trajectory from optimization theory with empirical CLUB soil model. Path is greatly influenced by physical constraints such as geometry, excavator dimension and excavator workspace. By minimizing a energy function under these constraints, an optimal bucket trajectory could be obtained.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1145-1157
• /
• 1999

본 논문에서는 RFC 2022에서 제안한 MARS 모델을 기반으로 하여 단일 대규모 클러스터를 가지는 ATM 망에서 다중의 멀티캐스팅 서버(MCS)를 이용한 멀티캐스팅 방안을 제안하고 그 성능을 평가하였다. 클러스터 내의 한 ATM 호스트가 특정 IP 멀티캐스트 그룹에 가입할 경우 ATM 호스트의 위치와 이미 존재하는 멀티캐스팅 서버들 사이의 전송 지연을 고려하여 가능한 한 종단간 전송 지연을 최소화하는 멀티캐스팅 서버를 선택하는 방안을 기술하였다. 이 방안은 최단거리 경로 알고리즘(shortest path algorithm)에 기반하여 최적의 MCS를 선정하고 송수신자 사이의 최소 지연을 가지는 멀티캐스트 트리를 구성한다. 다양한 망 위상에서 MCS의 분포 패턴을 다르게 할 경우에도 이 방안은 멀티캐스트 트리의 평균 전달 지연을 줄이는 것을 시뮬레이션을 통하여 확인하였다.Abstract In this paper, we proposed a scheme to support multiple MCSs over a single and large cluster in ATM networks, evaluated its performance by simulation. When an ATM host requests joining into a specific multicast group, the MARS designate a proper MCS among the multiple MCSs for the group member to minimize the average path delay between the sender and the group members. This scheme constructs a multicast tree through 2-phase partial multicast tree construction based upon the shortest path algorithm.We reduced the average path delay in multicast tree using our scheme under various cluster topologies and MCS distribution scenarios.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.19-31
• /
• 2016

A design method of the network for automated transporters mounted on rails is addressed for automated container terminals. In the network design, the flow directions of some path segments as well as routes of transporters for each flow requirement must be determined, while the total transportation and waiting times are minimized. This study considers, for the design of the network, the waiting times of the transporters during the travel on path segments, intersections, transfer points below the quay crane (QC), and transfer points at the storage yard. An algorithm, which is the combination of a modified Dijkstra's algorithm for finding the shortest time path and a queuing theory for calculating the waiting times during the travel, is proposed. The proposed algorithm can solve the problem in a short time, which can be used in practice. Numerical experiments showed that the proposed algorithm gives solutions better than several simple rules. It was also shown that the proposed algorithm provides satisfactory solutions in a reasonable time with only average 7.22% gap in its travel time from those by a genetic algorithm which needs too long computational time. The performance of the algorithm is tested and analyzed for various parameters.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2005.05a
• /
• pp.92-96
• /
• 2005

Among the failure modes which can be occurred in tube hydroforming such as wrinkling, bursting or buckling, the bursting by local instability under excessive tensile stresses is irrecoverable phenomenon. Thus, the accurate prediction of bursting condition plays an important role in producing the successfully hydroformed part without any defects. As the classical forming limit criteria, strain-based forming limit diagram has widely used to predict the failure in sheet metal forming. However, it is known that the FLD is extremely dependant on strain path throughout the forming process. Furthermore, the path-dependent limitation of FLD makes the application to hydroforming process, where strain path is no longer linear throughout forming process, more careful. In this work, stress-based forming limit diagram (FLSD), which is strain path-independent and more general, was applied to prediction of forming limit in tube hydroforming. Combined with the analytical FLSD determined from plastic instability theory, finite element analyses were carried out to find out Ihe state of stresses during hydroforming operation, and then FLSD is utilized as forming limit criterion. In addition, the approach is verified with a series of bulge tests in view of bursting pressure and shows a good agreement. Consequently, it is shown that the approach proposed in this paper will provide a feasible method to satisfy the increasing practical demands for judging the farming severity in hydroforming processes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.426-431
• /
• 2005

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2581-2587
• /
• 2013

A Meta-analysis is a statistical literature synthesis method that provides the opportunity to view the research context by combining and analyzing the quantitative results of many empirical studies. We conducted a Meta-analysis research on the behavioral intention of information technology based on the theory of planned behavior. This study was targeted a total of 36 research papers that are setting up the causal relationship in the theory of planned behavior among the research papers published in domestic academic journals before 2013. The result of the Meta-analysis, showed that the effect size was 0.571 in the path from attitude toward behavior to behavioral intention, it showed that the effect size was 0.381 in the path from subjective norm to behavioral intention. And, it showed that the effect size was 0.481 in the path from perceived behavioral control to behavioral Intention. Also, it showed that the effect size was 0.421 in the path from behavioral Intention to behavior.

• Archives of design research
• /
• v.18 no.4 s.62
• /
• pp.139-146
• /
• 2005

Animation works have been peformed by the objective sensitivity and experience so far. Software designs have been also manufactured based on intelligent data because they are easy to objectify and digitalize. In contrast, there are many elements, which human senses are hard to objectify and digitalize. This study investigates how to digitalize and objectify human senses and how to use them as the quantitative data and its subject is a flying path. In the experiment, this study collects some sensitive words for how human beings express the living path. The evaluation words for sensitivity through the collected sensitive words are extracted and the sketch images for the flying path are collected from the extracted evaluation words for sensitivity. Based on the collected sketch images, the samples of real moving image, which are the core of this study, are manufactured. Then, quantification theory III and I are used in order to analyze the correlation between the sensitive words representing the flying path and the samples of moving image. As a result, this study can figure out the structure of sensitive words and the samples of moving image and analyze the physical stimulating elements for the flying path. The flying path corresponds to the path that the object has passed. Some unique sensitive words are expressed by means of interacting some sensitive stimulating elements after looking at such a path. There are some elements that stimulate the senses and they include the physical elements such as speed, rotation, pattern and length of arc. The purpose of this study is to objectify and quantify the animation works that are created by animators' subjective thought and experience and to use them in animation works in the future.