• 대한기계학회논문집A
• /
• 제32권2호
• /
• pp.170-176
• /
• 2008

Anti roll bar model for real time multibody vehicle dynamics model has been proposed using kinematic constraint. Anti roll bar have been modeled by kinematic relationship, and mass properties are neglected. Relative angle of torsion bar spring is computed by constraint about drop-link using Newton-Raphson iteration, and then the torque of torsion bar spring can be computed with the angle and torsion spring stiffness. Finally anti roll bar force acting on both knuckle can be calculated. To validate the proposed method, half car simulations of McPherson strut suspension and full car simulations are also carried out comparing with the ADAMS vehicle model with anti roll bar. CPU times are also measured to see the real-time capabilities of the proposed method.

• 한국언어정보학회지:언어와정보
• /
• 제4권1호
• /
• pp.67-82
• /
• 2000

The purpose of the paper is twofold. First, we revise the well-known Centering Theory of anaphora resolution and propose the controlled Information Packaging Theory (for short, CIPT). Second, we suggest a solution to the resolution of the antecedents of pronouns within the framework of CIPT. For this purpose, we select a dialogue of hotel reservation as a domain-restricted discourse, and discourse, and discuss the characteristics of the distribution of pronouns. We suggest that we need to palce the Slot-Link element on the top of the forward centering list. We claim that we need to establish a constraint on conceptual compatibility. As for the pronouns in the global dialogue, we propose a constraint of discourse command.

• ETRI Journal
• /
• 제26권1호
• /
• pp.21-26
• /
• 2004

This paper proposes a new architecture for a Viterbi decoder with an efficient memory management scheme. The trace-back operation is eliminated in the architecture and the memory storing intermediate decision information can be removed. The elimination of the trace-back operation also reduces the number of operation cycles needed to determine decision bits. The memory size of the proposed scheme is reduced to 1/($5{\times}$ constraint length) of that of the register exchange scheme, and the throughput is increased up to twice that of the trace-back scheme. A Viterbi decoder complying with the IS-95 reverse link specification is designed to verify the proposed architecture. The decoder has a code rate of 1/3, a constraint length of 9, and a trace-forward depth of 45.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (C)
• /
• pp.268-270
• /
• 2003

DSPF/IS-IS extension과 같은 기존 constraint-based 라우팅 알고리즘은 링크 상태(Link State) 정보에 constraints를 포함해야 하기 때문에 네트워크의 대역폭을 많이 낭비하게 되고, 모든 경로 탐색 정보를 모아서 초기에 적합한 최적 경로를 유지하고 있으므로 서로 다른 노드에서 다양한 멀티미디어 서비스가 요구될 때 서비스별 QoS를 만족시키기 힘들어진다. 본 논문은 다양한 005가 요구되는 네트워크 트래픽 상황에 맞는 QoS 기반의 새로운 라우팅 알고리즘(QRDGSPA)을 제안하여 복잡한 계산 과정없이 유용 자원을 측정하는(measured) 방식으로 QoS5가 고려된 경로들 중 단일 또는 여러 개의 최적 경로를 선택할 수 있도록 하고, CR-LDP를 이용한 LSP Feedback을 적용하여 네트워크의 자원 상황을 미리 파악함으로써 MPLS 네트워크의 이용율을 극대화하고 효율적인 네트워크 운용이 가능하도록 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• 산업경영시스템학회지
• /
• 제28권2호
• /
• pp.101-108
• /
• 2005

In this paper, the design problem of local area networks is defined as finding the network topology minimizing cost subject to reliability constraint. The design problem includes issues such as multiple choices of link type for each possible link, multiple choices of hub type for each hub, and allocation of the users to the hubs. To efficiently solve the problem, a genetic approach is suggested. According to the experiments, the proposed approach improves search performance.

• Journal of Mechanical Science and Technology
• /
• 제17권12호
• /
• pp.1961-1968
• /
• 2003

In this paper, an efficient numerical algorithm for the kinematic analysis of the standard MacPherson suspension system is presented. The kinematic analysis of the suspension mechanism is carried out in terms of the rectangular Cartesian coordinates of some defined points in the links and at the kinematic joints. Geometric constraints that fix the distances between the points belonging to the same rigid link are introduced. The nonlinear constraint equations are solved by iterative numerical methods. The corresponding linear equations of the velocity and acceleration are solved to yield the velocities and accelerations of the unknown points. The velocities and accelerations of other points of interest as well as the angular velocity and acceleration of any link in the mechanism can be calculated.

• 대한교통학회지
• /
• 제18권6호
• /
• pp.111-124
• /
• 2000

본 연구에서 다루고자 하는 문제는 서비스시간 제약을 갖는 도시부 복합교통망에서의 기종점을 잇는 합리적인 최단경로를 탐색하고자 하는 것이다. 서비스시간 제약은 도시부 복합교통망에서의 현실성을 보다 더 사실적으로 표현하지만 기존의 알고리즘들은 이를 고려하지 않고 있다. 서비스시간 제약은 환승역에서 여행자가 환승차량을 이용해서 다른 지점으로 여행할 수 있는 출발시간이 미리 계획된 차량운행시간들에 의해 제한되어지는 것이다. 환승역에 도착한 여행자는 환승차량의 정해진 운행시간에서만 환승차량을 이용해서 다른 지점으로 여행할 수 있다. 따라서 서비스시간 제약이 고려되어지는 경우 총소요시간에는 여행시간과 환승대기시간이 포함되어지고, 환승대기시간은 여행자가 환승역에 도착한 시간과 환승차량의 출발이 허용되어지는 시간에 의존해서 변한다. 본 논문에서는 이러한 문제를 해결할 수 있는 링크기반의 최단경로탐색 알고리즘을 개발하였다. Dijkstra 알고리즘과 같은 전통적인 탐색법에서는 각 노드까지의 최단도착시간을 계산하여 각 노드에 표지로 설정하지만 제안된 알고리즘에서는 각 링크가지의 최단도착시간과 각 링크에서의 가장 빠른 출발시간을 계산하여 각 링크의 표지로 설정한다. 제안된 알고리즘의 자세한 탐색과정이 간단한 복합교통망에 대하여 예시되어진다.

• 한국자동차공학회논문집
• /
• 제13권1호
• /
• pp.99-108
• /
• 2005

This paper represents an efficient modeling method of a suspension system for the vehicle dynamic simulation. The suspension links are modeled as composite joints. The motion of wheel is defined as relative one degree of freedom motion with respect to car body. The unique relative kinematic constraint formulation between the car body and wheel enables to derive equations of motion in terms of wheel vertical motion. Thus, vehicle model has ten degrees of freedom. By using velocity transformation method, the equations of motion of the vehicle is systematically derived without kinematic constraints. Various vehicle simulation such as J-turn, slowly increasing steer, sinusoidal sweep steer and bump run has been performed to verify the validity of the suggested vehicle model.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2002년도 춘계종합학술대회
• /
• pp.380-383
• /
• 2002

KLDP(리눅스 한글 문서 프로젝트, http://kldp.org)와 같이 많은 분량의 HTML 문서들로 이루어진 매뉴얼 사이트를 관리하는데 가장 어려운 점은 현수 참조(dangling reference), 오문 참조 (inaccurate content reference)와 같은 깨진 링크(broken link)를 관리하는 것이다. 본 논문에서는 웹사이트의 HTML 문서들 사이에 존재하는 관계성(Relationship)과 제약 조건(Constraints)을 정의하여, HTML 문서의 삽입, 삭제, 변경이 발생할 경우 사용자에게 통지하거나, 트리거를 수행하여 HTML 문서들의 무결성(Integrity)을 유지할 수 있도록 하는 HIMS(HTML Document Integrity Management System)시스템을 설계 및 구현하였다.