• Journal of Korean Society of Transportation
• /
• v.14 no.3
• /
• pp.27-44
• /
• 1996

The purpose of the thesis is providing a new formulation for the transit assignment problem. The existing models dealing with the transit assignment problem don't consider the congestion effects due to the insufficient capacity of transit vehicles. Besides, these models don't provide solutions satisfying the Wardrop's user equilibrium conditions. The congestion effects are considered to be concentrated at the transit stops. For the transit lines, the waiting times at the transit stops are dependent on the passenger flows. The new model suggests the route section cost function analogous to the link performance function of the auto assignment to reflect the congestion effects in congested transit network. With the asymmetric cost function, the variational inequality programming is used to obtain the solutions satisfying Wardrop's condition. The diagonalization algorithm is introduced to solve this model. Finally, the results are compared with those of EMME/2.

• Journal of the military operations research society of Korea
• /
• v.30 no.1
• /
• pp.30-47
• /
• 2004

This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported.

• Korean Management Science Review
• /
• v.14 no.1
• /
• pp.205-227
• /
• 1997

Higher level representation splay an important role in model management systems. The role is to make decision makers friendly represent their problem using the representations. In this research, we address higher level representations including five distinctivenesses: Objective, Node, Link, Topological Constraint including five components, and Decision, Therefore, it is developed a system called HLRNET that implements the building procedure of network models using structural knowledge and object data The paper particularly elaborates all components included in each of distinctiveness extracted from structural characteristics of a lot of telecommunication network models. Higher level representations represented with five destinctivenesses should be converted into base level representations which are employed for semantic representations of linear and integer programming problems in a knowledge-assisted optimization modeling system. The system is illustrated with an example of the local access network model.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.787-796
• /
• 1995

A man model is a useful design tool for the evaluation of man machine systems and products. An arm reach trajectory prediction for such a model will be specifically useful to present human activities and, consequently, could increase the accuracy and reality of the evaluation. In this study, a three-dimensional reach trajectory prediction model was developed using an inverse kinematics technique. The upper body was modeled as a four link open kinematic chain with seven degrees of freedom. The Resolved Motion Method used for the robot kinematics problem was used to predict the joint movements. The cost function of the perceived discomfort developed using the central composite design was also used as a performance function. This model predicts the posture by moving the joints to minimize the discomfort on the constraint of the end effector velocity directed to a target point. The results of the pairwise t-test showed that all the joint coordinates except the shoulder joint's showed statistically no differences at .alpha. = 0.01. The reach trajectory prediction model developed in this study was found to accurately simulate human arm reach trajectory and the model will help understand the human arm reach movement.

• Proceedings of the KIPE Conference
• /
• 1999.07a
• /
• pp.26-30
• /
• 1999

The constraint condition is the stator voltage and the stator current to operate the motor in the flux weakening region. The maximum current is limited by the inverter current rating and the machine thermal rating. Given DC link voltage to control the motor in the flux weakening the maximum voltage is determined by considering PWM strategy, dead time, voltage drop of the inverter switching device, and the margin of the voltage for current forcing. In this paper, the new method to determine the available maximum voltage is derived by the analythic method and by considering the factors of the voltage drop. So Determining the maximum voltage is very useful to enlarge the speed operation region in the flux weakening operation, the utility of the maximum voltage is increased.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.11
• /
• pp.3398-3407
• /
• 1996

In this paper, we derive an algorithm and develope a computer program which analyze rapidly and precisely the inverse kinematics of robotic mechanism with spatial complex chain structure based on the relative coordinates. We represent the inverse kinematic problem as an optimization problem with the kinematic constraint equations. The inverse kinematic analysis algorithm, therefore, consists of two algorithms, the main, an optimization algorithm finding the motion of independent joints from that of an end-effector and the sub, a forward kinematic analysis algorithm computing the motion of dependent joints. We accomplish simulations for the investigation upon the accuracy and efficiency of the algorithm.

• Journal of Korean Society of Transportation
• /
• v.5 no.1
• /
• pp.3-23
• /
• 1987

Traffic signal control problems in urban street networks are formulated in two ways. In the formulations network flows are assumed to satisfy the user route choice criterion. the first formulation which is called implicit substiuation incorporates user route behavior implicitly in the objective function by recognizing the dependence of the link flows on the signal variables. On the other hands, the second one which is called 'penalty formulation' consists in expressing the route choice conditions in the form of a single nonlinear constraint. Approximate solution algorithm for each of the formulations was investigated in detail and computer codes were written to examine key aspects of each algorithm. A test was done on a network which is small in size but sufficiently complex in representing real-world traffic conditions and the test result shows that both algorithms produce converged solutions. It is recommended, however, that further studies should be done in order to compare the performance of each algorithm more in depth.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1089-1092
• /
• 2003

TCP/IP 프로토콜을 기반으로 한 웹은 컴퓨터 기술과 통신 기술의 발달과 더불어 양적으로나 복잡도에 있어서 놀라운 속도로 성장하고 있다. 이에 따라 웹 사이트를 이용한 홍보나 기업의 이익을 목적으로 하는 웹 사이트들이 급속히 증가하면서 웹 페이지들의 추가, 삭제, 갱신 등 끊임없이 일어나고 있다. 이렇게 끊임없는 웹 페이지의 수정으로 인하여 링크가 끊어지는 등의 문제가 발생한 수 있는데, 이런 끊어진 링크의 발견은 쉽지 않고, 때에 따라서는 기업에 큰 손실을 가져올 수 있다. 본 논문에서는 웹 페이지 문서들 사이에 존재하는 관계성(Relationship)과 제약 조건(Constraint Condition)을 확장 UML을 통해 정의하여, 웹 페이지의 DLP(Dangling Link Problem)를 해결하기 위한 WPMS(Web Page Integrity Management System) 시스템을 제안하였다.

• Proceeding of Spring/Autumn Annual Conference of KHA
• /
• 2009.04a
• /
• pp.155-160
• /
• 2009

Safety of residents could be considered and then increased when we plan, design, and operate a city. In Korea, CPTED (Crime Prevention through Environmental Design) is currently being applied to new towns. However, it is not systemized and neither efficient, for there are no constraint provisions, and the foreign cases are not specifically customized to the current situation of the country. This means, the introduction of CPTED is an indispensable fact, but there are limits to the budget aids and actual application, for there is no legal base to support it. This study, therefore, aims to find the limits from analyzing related laws and regimes, administrative regulations, and applied cases, and to deduct improvement plans based on examined foreign cases. In this Study, the supporting system of foreign CPTED related laws and regulations was analyzed around the cases of England and U.S.A, and based on that information, the present condition and limits of CPTED related laws and regulations of Korea were deducted. As a result of this study, there were no constraint provisions to apply the design guidelines to actual planning, and there were limits on backup aid and actual application due to the lacking of analyzing the relevant area. Also, an acceptable framework must be arranged by the revision of laws and ordinances to compel the system, and link it with the CPTED certification system which will revitalize the whole system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.1-14
• /
• 2006

Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.