• Journal of Korean Society of Transportation
• /
• v.30 no.3
• /
• pp.17-30
• /
• 2012

This study analyzes the basic characteristics needed for motivating modal shift from truck to rail. The object of the study is to consider the resistance factor for container transported inland and the object point is the transfer node where modal shift occurs. The main contents of the study are as follows. First, the study looks at what shippers, engaged in inland transport of container, think of current transfer node environment. From this, the study analyzes what resistance factors are attributable to the lack of motivation in modal shift from truck to rail. Second, the study estimates mode choice models in which the resistance factors at transfer node are applied. Also by using this, the study draws out elasticities, and analyzes characteristics of resistantance factors in modal shift. Third, as its result, the study suggests methods to promote modal-shifting container transport from truck to rail.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.49-57
• /
• 2012

In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.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.

• Speech Sciences
• /
• v.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.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.4 s.181
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.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
• /
• v.3 no.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.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.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.