• 대한교통학회지
• /
• 제30권3호
• /
• pp.17-30
• /
• 2012

본 연구는 공로에서 철도로의 모달 쉬프트를 활성화 하는데 필요한 기본 특성을 조사하고 분석하였다. 연구의 대상 화물은 국내에서 내륙으로 운송되는 컨테이너이며, 연구의 대상 지점은 모달 쉬프트가 이루어지는 환적노드를 중심으로 하였다. 연구에서 수행한 주요 내용은 다음과 같다. 첫째, 컨테이너 육상운송을 하는 화주가 생각하는 환적노드의 운송환경에 대한 인식을 조사하였다. 그리고 이로부터 공로에서 철도로 모달 쉬프트가 활성화되지 않는 저항요인을 분석하였다. 둘째, 환적노드의 저항요인을 반영한 운송수단 선택모형을 추정하였다. 그리고 이를 활용하여 탄력성을 도출하고 모달 쉬프트 저항 요인별 특성을 분석하였다. 셋째, 연구에서 도출된 결과로부터 컨테이너 운송수단을 공로에서 철도로 모달 쉬프트 시키는 방안을 제시하였다.

• 정보처리학회논문지A
• /
• 제12A권6호
• /
• pp.557-562
• /
• 2005

높은 클럭으로 동작하는 고속의 프로세서를 다수 이용한 다중프로세서 시스템 성능은 프로세서 자체의 성능보다 상호연결망의 트랜잭션 처리 능력 및 지연에 의하여 큰 영향을 받게 된다. 따라서 상호연결망의 성능은 대역폭 및 지연시간 측면으로 시스템 성능에 큰 비중을 차지한다. 단방향 이중 연결을 이용한 CC-NUMA 구조는 이중 연결을 이용한 대역폭 증가효과와 고속 단방향 링크를 이용한 적은 지연시간으로 인하석 고성능 시스템에서 많이 채용되고 있다. 한편, 이중 연결구조로 인하여 시스템의 상호연결망의 최단 경로는 단일하게 형성되지 않으며, 여러 개의 최단 경로가 구성될 수 있다. 그러나 실제 응용프로그램을 수행할 때, 동일한 홉 수를 나타내는 경로일지라 하더라도 각 연결 링크의 부하 및 경쟁에 따른 지연 시간의 차이를 나타내게 되며, 만일 노드간의 트랜잭션 전달 경로가 정적으로 구성되어 있을 경우, 실제 프로그램의 수행에서 균일하지 못한 연결 링크 부하에 따른 지연 시간의 차이가 나타날 수 있음을 의미한다. 이는 곧 고속의 상호연결망 전체의 대역폭을 균일하게 사용하지 못함으로 나타나는 부가적 지연 시간으로 볼 수 있으며, 이로 인한 응용 프로그램의 수행 성능이 저하될 수 있음을 의미한다. 본 논문은 기존 연구된 단방향 이중 연결을 이용한 CC-NUMA 시스템에서, 노드간 트랜잭션 전달 경로가 정 적으로 구성될 경 우 발생될 수 있는 성능 저하를 평가하고, 정적 경로와 동일한 홉 수의 경로를 나타내며 링크 부하에 따라서 동적으로 전달되도록 부하에 따르는 동적 경로 설정 방법을 제시하였다. 논문에서 제시하는 방법은 기존 경로설정 방법에 대하여 동일한 홉 수를 나타내며, 링크 부하에 따라서 동적으로 경로를 설정함으로써 실시간 경로 분배가 자연스럽게 이루어지도록 하였고, 링크 경쟁을 완화함으로써 보다 균일한 링크 사용을 나타냈고, 링크 획득 실패로 인한 지 연시간을 감소시켰다. 프로그램 구동 시뮬레이션을 통한 성능 검증 결과, 논문에서 제시한 동적경로 설정 방법은 기존 정적 경로 설정 방법에 비해 링크점유시간 편차가 $1{\~}10\%$ 낮게 나타났고, 링크의 획득 실패 횟수가 ${\~}3\%$ 감소하였으며, 그 결과 $1{\~}6\%$의 수행 시간 감소를 나타냈다.

• 한국컴퓨터정보학회논문지
• /
• 제17권5호
• /
• pp.49-57
• /
• 2012

본 논문에서는 P2P스트리밍에서 peer간 연결 정보를 이용하는 방법을 기반으로 topology 최적화를 연구한다. 제안하는 방법은 mesh-network에서 사용된 link와 사용되지 않은 link의 수로 peer의 업로드 용량을 추정하는 방법을 기반으로 한다. 연결된 link의 정보를 사용하는 기존 방법은 peer의 자원 관리 측면에서 메시지 과부하를 줄이는데 효과적이다. 하지만 업로드 대역폭이 고려되지 않는 topology를 구성할 우려가 있다. 또한 서버에 가까운 peer에서 네트워크 오류 발생시 네트워크 전송성능이 저하될 수 있다. 본 논문에서는 기존 방법의 단점을 보완하는 방법을 제안한다. 기존 방법과 제안하는 방법을 시뮬레이션 하고 결과를 비교 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.959-975
• /
• 2011

Wireless mesh networks enlarge the wireless coverage area by interconnecting relatively stationary wireless routers (mesh routers). As wireless mesh networks are envisioned to provide high-bandwidth broadband Internet service to a large community of users, the Internet gateway, which acts as a central point of Internet attachment for the mesh networks, is likely to suffer heavily from the scramble for shared wireless resources because of aggregated traffic toward the Internet. It causes performance decrement on end-to-end transmissions. We propose a scheme to balance the load in a mesh network based on link quality variation to different Internet gateways. Moreover, under the mesh coverage, mobile nodes can move around and connect to nearby mesh routers while still keeping the connections to the Internet through the best gateway in terms of link quality. In this structure, gateways perform the balancing procedure through wired links. Information about gateways and mobile node's location is distributed appropriately so that every mesh router can quickly recognize the best gateway as well as the positions of mobile nodes. This distributed information assists mobile nodes to perform fast handoff. Significant benefits are shown by the performance analysis.

• 음성과학
• /
• 제1권
• /
• pp.55-81
• /
• 1997

In the present paper, V-to-V coarticulation in Korean VCV sequences is discussed, focusing on links between consonantal production and degree of V-to-V coarticulation. Temporal and spatial differences between three types of Korean alveolar stops (lax /t/. aspirated /$t^h$/ and thense /t'/) are examined from VCV sequences involving all possible combinations of three Korean unrounded vowels /a, i,/ based on spectrographic and electrographic data(two male speakers and one female speaker and one female speaker respectively). Closure duration and voice onset time (VOT) were measured from acoustic data. 'Total duration', which is defined as the sum of the closure duration and the VOT, was also calculated in order to see the temporal distance between two vowels in a VCV sequence. Differences in lingual-palatal contact pattern at the maximum contact (MC) point between the three types of stop were observed from EPG data. V-to-V coarticulation was investigated by measuring the offset or onset of the second formant (F2) of the target vowels from spectrograms. Two different dimensions of articulation, temporal and spatial, seem to playa role in determining the degree of V-to-V coarticulation. The degree of V-to-V anticipatory coarticulation is influenced by the spatial characteristics of the intervening consonant while the degree of carryover coarticulation is influenced by the temporal characteristics of the consonant.

• 한국정밀공학회지
• /
• 제23권4호
• /
• pp.75-82
• /
• 2006

In this paper, we propose an optimal trajectory for biped robots to move up-and-down stairs using a genetic algorithm and a computed-torque control for biped robots to be dynamically stable. First, a Real-Coded Genetic Algorithm (RCGA) which of operators are composed of reproduction, crossover and mutation is used to minimize the total energy. Constraints are divided into equalities and inequalities: Equality constraints consist of a position condition at the start and end of a step period and repeatability conditions related to each joint angle and angular velocity. Inequality constraints include collision avoidance conditions of a swing leg at the face and edge of a stair, knee joint conditions with respect to the avoidance of the kinematic singularity, and the zero moment point condition with respect to the stability into the going direction. In order to approximate a gait, each joint angle trajectory is defined as a 4-th order polynomial of which coefficients are chromosomes. The effectiveness of the proposed optimal trajectory is shown in computer simulations with a 6-dof biped robot that consists of seven links in the sagittal plane. The trajectory is more efficient than that generated by the modified GCIPM. And various trajectories generated by the proposed GA method are analyzed in a viewpoint of the consumption energy: walking on even ground, ascending stairs, and descending stairs.

• 한국통신학회논문지
• /
• 제22권6호
• /
• pp.1323-1333
• /
• 1997

In this paper, we propose an efficient architecture for a high-speed cell concentrator/distributor(HCCD) in an ATM(Asynchronous Transfer Mode) switch and by analyzeing the simulation results evaluate the performance of the proposed architecuture. The proposed HCCD distributes cells from a switch link to local processors, or concentrates cells from local processor s to a switch link. This design is to guarntee a high throughput for the IPC (inter-processor communication) link in a distributed ATM switching system. The HCCD is designed in a moudlar architecture to provide the extensibility and the flexibility. The main characteristics of the HCCD are 1) Adaption of a local CPU in HCCD for improving flexibility of the system, 2) A cell-baced statistical multiplexing function for efficient multiplexing, 3) A cell distribution function based on VPI(Virtual Path Identifier), 4) A bypassing capability for IPC between processor attached to the same HCCD, 5) A multicasting capability for point-to-multipoint communication, 6) A VPI table updating function for the efficient management of links, 7) A self-testing function for detecting system fault.

• 대한기계학회논문집A
• /
• 제33권10호
• /
• pp.1014-1022
• /
• 2009

A biped robot in locomotion can be regarded to be kinetically redundant in that the link-chain from its foot on the ground to its swing foot has more degrees of freedom that needed to realize stable bipedal locomotion. This paper proposes a new method to generate a trajectory for bipedal locomotion based on this redundancy, which directly generates a locomotion trajectory at the joint level unlike some other methods such as LIPM (linear inverted-pendulum mode) and GCIPM (gravity-compensated inverted-pendulum mode), each of which generates a trajectory of the center of gravity or the hip link under the assumption of the dominance of the hip-link inertia before generating the trajectory of the whole links at the joint level. For the stability of the trajectory generated in the proposed method, a stability condition based on the ZMP (zero-moment point) is used as a constraint as well as other kinetic constraints for bipedal motions. A 6-DOF biped robot is used to show how a stable locomotion trajectory can be generated in the sagittal plane by the proposed method and to demonstrate the feasibility of the proposed method.

• Transactions on Control, Automation and Systems Engineering
• /
• 제3권4호
• /
• pp.217-222
• /
• 2001

We propose a new two-degree of freedom parallel mechanism for a haptic device and will refer to the mechanism as the SenSation. The SenSation is designed in order to improve the kinematic performanced and to achieve static balance. We use the panto graph mechanisms in order to change the location of active joints, which leads to transform a direct kinematic singularity into a nonsingularity. The direct kinematic singular configurations of the SenSation occur near the workspace boundary. Using the property that position vector of rigid body rotating about a fixed point is normal to the velocity vector, Jacobian matrix is derived. Using the vector method, two different types of singularities of the SenSation can be identified and we discuss the physical significance of each of the three types of singularities. We will compare the kinematic performances(force manipulability ellipsoid, kinematic isotropy) of the SenSation with those of five-var parallel mechanism. By specifying that the potential energy be fixed, the conditions for the static balancing of the SenSation is derived. The static balancing is accomplished by changing the center of mass of the links.

• 전자공학회논문지A
• /
• 제32A권8호
• /
• pp.1-10
• /
• 1995

We have analyzed the reliability of failure models in circuit-switched networks. These models are grid topology circuit-switched networks, and each node transmits a packet to a destination node using a Flooding routing method. We have assumed that the failure of each link and node is independent. We have considered two method to analyze reliability in these models : The Karnaugh Map method and joint probability method. In this two method, we have analyzed the reliability in a small grid topology circuit switched network by a joint probability method, and comared analytic results with simulated ones. For a large grid enormous. So, we have evaluated the reliability of the network by computer simulation techniques. As results, we have found that the analytic results are very close to simulated ones in a small grid topology circuit switched network. And, we have found that network reliability decreases exponentially, according to increment of link or node failure, and network reliability is almost linearly decreased according to increment of the number of links, by which call has passed. Finally, we have found an interesting result that nodes in a center of the network are superior to the other nodes from the reliability point of view.