• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1862-1867
• /
• 2011

Recently, a railway vehicle of the maximum speed of 350km/h or more high speed has been developed in the developed country. The next-generation railway vehicle(HEMU-400X) is being developed for aim to run over 430km/h in Republic of Korea, too. The safety of the railway vehicle should be conformed before manufacturing the railway vehicle. In this study, the next generation high-speed railway vehicle was modeled as a single-car system using commercial dynamic program ADAMS/Rail. Safety analysis was implemented through the international standard of the UIC 518 OR code. Also, appropriateness of the railway vehicle design variable were conformed by safety analysis results.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.268-274
• /
• 2011

In railway, Ballast plays an essential role as intermedium in transmitting train load to subgrade safely. Gyoung-Bu HSL 1st phase consists of ballasted track except for over 5km long tunnels. Ballast track occurred track irregularity by train loads and requires periodic maintenance work. However, Repetitive train operation and tamping work cause to accelerate track irregularity and ballast deterioration such as abrasion and crushing. For these reason, Track irregularity areas had occurred ballast cleaning work to improve track quality. However, for the train to run safety, ballast cleaner working area needs train speed reduction and track stabilization work due to ballast relaxation and initial settlement. In this study, according to train speed-up and cumulative traffic tonnage, we measured and analyzed the track settlement and acceleration of sleepers to evaluate of track stabilization in order to keep the ballast condition stable after cleaning work.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.849-852
• /
• 2005

A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored from is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube Boolean subexpression pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's co-kernel cube matrix.

• East Asian Economic Review
• /
• v.21 no.3
• /
• pp.201-230
• /
• 2017

This paper studies the long-run behavior of relative price dispersion among cities in Korea with a special emphasis on heterogeneous transitional patterns of price level dynamics. Formal statistical tests indicate considerable evidence for rejecting the null of relative price level convergence among the majority of cities over the sample period of 1985-2015. The analysis of gravity model suggests that the effect of transportation costs on intercity price level differentials is limited, while other socioeconomic factors, such as income, input factor prices, demographic structure, and housing price growth, play key roles in accounting for persistent regional price level disparities. Individual price levels are found to be better explained by a multiple-component model, and the deviations from PPP may be attributed to distinct stochastic common trends that are characterized by income and demographic structure.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.493-501
• /
• 2017

This paper introduces a new motion-synthesis technique for animating multiple characters. At a high level, we introduce a hub-sub-control-point scheme that automatically generates many different spline curves from a user scribble. Then, each spline curve becomes a trajectory along which a 3D character moves. Based on the given curves, our algorithm synthesizes motions using a cyclic motion. In this process, space-time warp curves, which are time-warp curves, are embedded in the 3D environment to control the speed of the motions. Since the space-time warp curve represents a trajectory over the time domain, it enables us to verify whether the trajectory causes any collisions between characters by simply checking whether two space-time warp curves intersect. In addition, it is possible to edit space-time warp curves at run time to change the speed of the characters. We use several experiments to demonstrate that the proposed algorithm can efficiently synthesize a group of character motions. Our method creates collision-avoiding trajectories ten times faster than those created manually.

• World Technopolis Review
• /
• v.4 no.2
• /
• pp.62-78
• /
• 2015

The importance of university technology transfer has widely been brought to the center of attention over the last decades. Research and practice thereby often concentrate on issues related to patenting and licensing or entrepreneurship but abstract away from relationship- and network-focused initiatives. In this paper, we argue that efforts to systematically develop close, long-term collaboration partnerships - although complex and resource intensive - are likely to be more beneficial for both universities and industry in the long run. Drawing on data derived from interviews with technology transfer executives of 22 leading European and U.S. universities, we analyze and discuss well-established practices of network and relationship management and their possible impact on technology transfer success. Our findings indicate that dedicated relationship management approaches can yield a sustainable competitive advantage for universities. We thereby shift the focus away from transaction-orientation towards more forward-looking relationship-centric approaches and discuss their institutionalization in great detail.

• Journal of The Korean Astronomical Society
• /
• v.27 no.1
• /
• pp.13-29
• /
• 1994

We have constructed a 3-dim hydrodynamics code called BTSPH. The fluid dynamics part of the code is based on the smoothed particle hydrodynamics (SPH), and for its Poisson solver the binary tree (BT) scheme is employed. We let the smoothing length in the SPH algorithm vary with space and time, so that resolution of the calculation is considerably enhanced over the version of SPH with fixed smoothing length. The binary tree scheme calculates the gravitational force at a point by collecting the monopole forces from neighboring particles and the multipole forces from aggregates of distant particles. The BTSPH is free from geometric constraints, does not rely on grids, and needs arrays of moderate size. With the code we have run the following set of test calculations: one-dim shock tube, adiabatic collapse of an isothermal cloud, small oscillation of an equilibrium polytrope of index 3/2, and tidal encounter of the polytrope and a point mass perturber. Results of the tests confirmed the code performance.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.11a
• /
• pp.49-55
• /
• 2009

This paper evaluates performances of a recently developed divergence-free finite element method based on Hermite interpolated stream functions. Velocity bases are derived from Hermite interpolated stream functions to form divergence-free basis functions. These velocity basis functions constitute a solenoidal function space, and the simple gradient of the Hermite functions constitute an irrotational function space. The incompressible Navier-Stokes equation is orthogonally decomposed into a solenoidal and an irrotational parts, and the decoupled Navier-Stokes equations are projected onto their corresponding spaces to form proper variational formulations. To access accuracy and convergence of the present algorithm, three test problems are selected. They are lid-driven cavity flow, flow over a backward-facing step and buoyancy-driven flow within a square enclosure. Hermite interpolation functions from cubic to quintic are chosen to run the test problems. Numerical results are shown. In all cases it has shown that the present method has performed well in accuracies and convergences. Moreover, the present method does not require an upwinding or a stabilized term.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.523-526
• /
• 1998

In an ongoing project at ETRI-CSTL, A debugger for distributed programs that run on a varied collection of machines is being built. To build such debugger, a clientserver model is incorporated. This strategy enables us to provide a unified user interface and isolate debugger core from the user interface. Several debugging servers running on a diverse set of platforms permit the implementation of a distributed debugger for heterogeneous environment, and the single debugging client provides unified debugging concept and graphical user interface over various servers. Also, the precise specification of the interaction protocol between the client and server facilitates client to be paired with a variety of server implementantations. This paper describes the design and implementation of our debugger, concentrating on the system architecture.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.281-285
• /
• 2000

This paper proposes context-based coding methods for variable length coding of inter-frame DCT coefficients. The proposed methods classify run-level symbols depending on the preceding coefficients. No extra overhead needs to be transmitted, since the information of the previously transmitted coefficients is used for classification. Two entropy coding methods, arithmetic coding and Huffman coding, are used for the proposed context-based coding. For Huffman coding, there is no complexity increase from the current standards by using the existing inter/intra VLC tables. Experimental results show that the proposed methods give ～ 19% bits gain and ～ 0.8 dB PSNR improvement for adaptive inter/intra VLC table selection, and ～ 37% bits gain and ～ 2.7dB PSNR improvement for arithmetic coding over the current standards, MPEG-4 and H.263. Also, the proposed methods obtain larger gain for small quantizaton parameters and the sequences with fast and complex motion. Therefore, for high quality video coding, the proposed methods have more advantage.