• Korean Journal of Applied Biomechanics
• /
• v.12 no.1
• /
• pp.205-219
• /
• 2002

This research seeks to identify the plantar pressure distribution graph and change in force in connection with effective golf drive strokes and thus to help ordinary golfers have appropriate understanding on the moving of the center of weight and learn desirable drive swing movements. To this end, we conducted surveys on five excellent golfers to analyze the plantar pressure applied when performing golf drive strokes, and suggested dynamic variables quantitatively. 1) Our research presents the desire movements as follows. For the time change in connection with the whole movement, as a golfer raises the club head horizontally low above ground from the address to the top swing, he makes a semicircle using the left elbow joint and shaft and slowly turns his body, thus lengthening the time. And, as the golfer twists the right waist from the middle swing to the impact with the head taking address movement, and does a quick movement, thus shortening the time. 2) For the change in pressure distribution by phase, to strike a strong shot with his weight imposed from the middle swing to the impact, a golfer uses centrifugal force, fixes his left foot, and makes impact. This showed greater pressure distribution on the left sole than on the right sole. 3) For the force distribution graph by phase, the force in the sole from the address to halfway swing movements is distributed to the left foot with 46% and to the right foot with 54%. And, with the starting of down swing, as the weight shifts to the left foot, the force is distributed to the left sole with 58%. Thus, during the impact and follow through movements, it is desirable for a golfer to allow his left foot to take the weight with the right foot balancing the body. 4) The maximum pressure distribution and average of the maximum force in connection with the whole movement changed as the left (foot) and right (foot) supported opposing force, and the maximum pressure distribution also showed much greater on the left sole.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.786-790
• /
• 2009

In this paper, we present a new heuristic search algorithm, HSCP, that can solve conditional/contingent planning problems with nondeterministic actions as well as partial observations. The algorithm repeats its AND-OR search trials until a complete solution graph can be found. However, unlike existing heuristic AND-OR search algorithms such as$AO^*$ and $LAO^*$, the AND-OR search trial conducted by HSCP concentrates on only a single candidate of solution subgraphs to expand it into a complete solution graph. Moreover, unlike real-time dynamic programming algorithms such as RTDP and LRTDP, the AND-OR search trial of HSCP finds a solution immediately when it possible without delaying it until the estimated value of every state converges. Therefore, the HSCP search algorithm has the advantage that it can find a sub-optimal conditional plan very efficiently.

• Korean Journal of Applied Biomechanics
• /
• v.18 no.4
• /
• pp.179-189
• /
• 2008

The purpose of this study was to investigate interjoint and intersegmental coordination of lower segments in skill process. For the investigation, we examined the difference of resultant linear velocity of segments and angle vs angle graph. Novice subjects were 9 male middle school students who have never been experienced a taekwondo. We analyzed kinematic variables of Side Kick motion through videographical analysis. The conclusions were as follows. 1. Examining the graph of novice subjects' maximal resultant linear velocity of the thigh, shank, and foot segment, as it gets closer to the end of the training, the maximal resultant linear velocity in each segment increases which can be assumed to be a result of the effective momentum transfer between adjacent segments. 2 This research showed a sequential transfer from trunk, to thigh, and then to shank as it gets closer to the end of learning at intersegment angular velocity, and it also showed pattern of throwlike motion and pushlike motion. 3. In three dimension of flexion-extension, adduction-abduction and internal-external rotation of the thigh and shank segment, the angle-angle diagram of knee joint and of hip joint showed that dynamic change was indicated at the beginning of learning but stable coordination pattern was indicated like skilled subject as novice subjects became skilled.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.569-582
• /
• 2005

As information and business communication via Internet are growing up, web-based software is wide spread and more important on the viewpoint of software qualify than stand-alone. Research on verification of web content links and web-based Program was tried, but has short on covering various types of web based software and making experiments to be applied in real testing practice. This paper suggests a modeling technique to be applied to dynamic and various types of web-based software. First, it identifies each elements consisting of web-based software and then construct a model of Object Control Flow Graph and Object Relationship Diagram. We can generate test cases covering all test paths of ORD or invoking key points test route. Suggested modeling method and test case selection technique are verified by applying five types of web-based software and compared with other web-based test techniques.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1207-1212
• /
• 2003

As development of the e-commerce, the distributing network for a logistics currency is more complicated. A management of the distributing network (DN) is important factor in distribution planning. The DN can be expressed to distribution center (DC) and the interaction of DC. An internal factor of DC and an external factor to occur by an interaction of DC have many influences on the DN. Therefore, for an efficient DN management plan, analysis of the DN that considered DC and an interaction of DC is required. Until now a study on a viewpoint of supply chain management as resources assignment was performed, but the study on analysis of the distribution network was not performed. This paper propose the distribution network analysis technique that considered DC and an interaction of DC. A proposed technique consists of two steps largely. First of all a DN is expressed with the graph that included an interaction of DC and DC. It uses a reachibility tree, and the following, a DN expressed with a graph is analyzed. Also we presented an example model, and show an usefulness of proposal technique with the analysis of this model.

• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.105-113
• /
• 2000

The representation of a procedural program cannot be applied directly to object oriented program representation consisting of class, object, inheritance, and dynamic binding. Furthermore, preexisting program dependence represented the dependence among statements, but not among variables. That is, it could not solve the problem of which variables make an effect on given variables. Consequently, this study presents the method dependence model representing implementation level information including the dependence among variables in an object oriented program. I also propose implementation-based class testing technique based on the test adequacy criterion of an object-oriented program. Considering inter-data member dependences and a set of axioms for test data adequacy, it generates sequences of methods as test cases which satisfy a flow graph-based testing criterion. For a derived class testing, it considers inheritance relationship and the resuability of the testing information for its parent classes which verified the reduction of test cost through the experiment.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1468-1481
• /
• 1999

didates.본 논문은 절차 중심 소프트웨어를 객체 지향 소프트웨어로 재/역공학하기 위한 다단계 절차중 첫 절차인 객체 추출 절차에 대하여 기술한다. 사용한 객체 추출 방법은 전처리, 기본 분할 및 결합, 정제 결합, 결정 및 통합의 다섯 단계로 이루어진다 : 1) 전처리 과정에서는 객체 추출을 위한 FTV(Function, Type, Variable) 그래프를 생성/분할 및 클러스터링하고, 2) 기본 분할 및 결합 단계에서는 다중 객체 추출을 위한 그래프를 생성하고 생성된 그래프의 정적 객체를 추출하며, 3) 정제 결합 단계에서는 동적 객체를 추출하며, 4) 결정 단계에서는 영역 모델링과 다중 객체 후보군과의 유사도를 측정하여 영역 전문가가 하나의 최적합 후보를 선택할 수 있는 측정 결과를 제시하며, 5) 통합 단계에서는 전처리 과정에서 분리된 그래프가 여러 개 존재할 경우 각각의 처리된 그래프를 통합한다. 본 논문에서는 클러스터링 순서가 고정된 결정론적 방법을 사용하였으며, 가능한 경우의 수에 따른 다중 객체 후보, 객관적이고 의미가 있는 객체 추출 방법으로의 정제와 결정, 영역 모델링을 통한 의미적 관점에 기초한 방법 등을 사용한다. 이러한 방법을 사용함으로써 전문가는 객체 추출 단계에서 좀더 다양하고 객관적인 선택을 할 수 있다.Abstract This paper presents an object extraction process, which is the first phase of a methodology to transform procedural software to object-oriented software. The process consists of five steps: the preliminary, basic clustering & inclusion, refinement, decision and integration. In the preliminary step, FTV(Function, Type, Variable) graph for object extraction is created, divided and clustered. In the clustering & inclusion step, multiple graphs for static object candidate groups are generated. In the refinement step, each graph is refined to determine dynamic object candidate groups. In the decision step, the best candidate group is determined based on the highest similarity to class group modeled from domain engineering. In the final step, the best group is integrated with the domain model. The paper presents a new clustering method based on static clustering steps, possible object candidate grouping cases based on abstraction concept, a new refinement algorithm, a similarity algorithm for multiple n object and m classes, etc. This process provides reengineering experts an comprehensive and integrated environment to select the best or optimal object candidates.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.93-104
• /
• 2007

In the complex real-time multi-agent system such as game environment, dynamic task allocations are repeatedly performed to achieve a goal in terms of system efficiency. In this research, we present a task allocation scheme suitable for the real-time multi-agent environment. The scheme is to optimize the task allocation by complementing existing coordination agent with $A^*$ algorithm. The coordination agent creates a status graph that consists of nodes which represent the combinations of tasks and agents, and refines the graph to remove nodes of non-execution tasks and agents. The coordination agent performs the selective utilization of the $A^*$ algorithm method and the greedy method for real-time re-allocation. Then it finds some paths of the minimum cost as optimized results by using $A^*$ algorithm. Our experiments show that the coordination agent with $A^*$ algorithm improves a task allocation efficiency about 25% highly than the coordination agent only with greedy algorithm.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.725-732
• /
• 2002

Presented is a Genetic Algorithm (GA) for dynamic partitioning an ATM LANE(LAN Emulation) network. LANE proves to be one of the best solutions to provide guaranteed Quality of Service (QoS) for mid-size campus or enterprise networks with minor modification of legacy LAN facilities. However, there are few researches on the efficient LANE network operations to deal with scalability issues arising from broadcast traffic delivery. To cope with this scalability issue, proposed is a decision model named LANE Partitioning Problem (LPP) which aims at partitioning the entire LANE network into multiple Emulated LANs (ELANS), each of which works as an independent virtual LAN.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.199-202
• /
• 2009

The optimal path on real road network has been changed by traffic flow of roads frequently. Therefore a path finding system to find the optimal path on real network should consider traffic flow of roads that is changed on real time. The most of existing path finding methods do not consider traffic flow of roads and do not also perform efficiently if they use traffic information. In this paper, we propose an abstraction method of real road network based on the Terminal Based Navigation System (TBNS) with technique such as TPEG. TBNS can be able to provides quality of path better than before as using traffic information that is transferred by TPEG. The proposed method is to abstract real network as simple graph in order to use traffic information. It is composed boundary nodes based on real nodes, all boundary nodes that have the same of connection are merged together. The result of path finding on an abstract graph diminishes the search space.