• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.11
• /
• pp.1309-1315
• /
• 2014

The switch for a maglev vehicle should be designed such that the vehicle safely changes its track without touching the guiderail. In particular, a medium-to-low-speed EMS -type maglev train relies heavily on a U-type electromagnet where it generates levitation force and guidance force simultaneously. Therefore, it is necessary to evaluate the safety of the vehicle whenever it passes the switch, as it lacks active control of the guidance force. Furthermore, when the vehicle passes a segmented switch, which is a group of curves made up of connected lines with a small radius of curvature, it may come into mechanical contact with the guiderail owing to the excessive lateral displacement of the electromagnet. The goal of this study is to analyze the influence of a segmented switch on the safety of major design-related variables for achieving improved running safety. We propose a three-dimensional multibody dynamics model composed of two cars with one body. Using the proposed model, we perform a simulation of the lateral air gap, which is one of the measurements of the running safety of the vehicle when it passes the switch. The analyzed design variables are the length between short span girder, the articulation angle, the length between two centers of a fixed girder at its ends, and the number of girders. On the basis of the effects of the considered design variables, we establish an optimized design of a switch with improved safety.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.401-410
• /
• 2002

Control independence has been put forward as a new significant source of instruction-level parallelism for superscalar processors. In branch prediction mechanisms, all instructions after a mispredicted branch have to be squashed and then instructions of a correct path have to be re-fetched and re-executed. This paper presents a new branch misprediction recovery mechanism to reduce the number of instructions squashed on a misprediction. Detection of control independent instructions is accomplished with the help of the static method using a profiling and the dynamic method using a control flow of program sequences. We show that the suggested branch misprediction recovery mechanism improves the performance by 2~7% on a 4-issue processor, by 4~15% on an 8-issue processor and by 8~28% on a 16-issue processor.

• Korean Journal of Optics and Photonics
• /
• v.8 no.4
• /
• pp.340-344
• /
• 1997

We proposed and demonstrated a tunable wavelength optical add/drop multiplexer(OADM) employing piezoactuated fiber grating pairs and polarization beam splitters. We used piezostack act as a fiber stretcher, using the fact that the resonant wavelength of the grating can be controlled by the axial strain along the fiber grating. The polarization controlled configuration showed high stability because the reflected signals from the two identical gratings are dropped or added not by interference but by polarizations of the beams. We could add and drop not noly 1549.3nm signal channel(original gratings), but also 1550.1nm(tuned gratings) with PZT actuators and in both cases, we found that the rejection of adjacent channels was more than -26dB, and signal leakage at the gratings was less than -34dB.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.477-486
• /
• 2003

In combinatorial auctions buyers nay bid for arbitrary combinations of goods. But determining the winners of combinatorial auctions who maximize the profit of a seller is known to be NP-complete. A branch-and-bound method can be one of practical algorithm for winner determination. However, bid selection heuristics play a very important role in the efficiency of a branch-and-bound method. In this paper, we designed and implemented an algorithm which used a branch-and-bound method and Linear Programming for winner determination in combinatorial auctions. We propose new bid selection heuristics which consider a branching bid and conflicting bids simultaneously to select a branching bid in the algorithm. In addition, upper bounds are reused to reduce the running time in specific cases. We evaluated the performance of the algorithm by experiments with five data distributions and compared our method with others. The algorithm using heuristics showed a superior efficiency in two data distributions and a similar efficiency in three distributions.

• The Journal of the Convergence on Culture Technology
• /
• v.6 no.2
• /
• pp.461-466
• /
• 2020

In this study, the relationship between the track support stiffness and the track impact factor for a sleeper floating track and a turnout system with wood ties currently employed in Korean urban transit was assessed by performing field tests using actual vehicles running along the service lines. Field tests were performed on four track systems (i.e., sleeper floating track, and point, lead and crossing sections of turnout system). The theoretically designed track impact factor and track support stiffness were compared with the corresponding track impact factor and track support stiffness measured through field tests for the target tracks on the service line. The track impact factor for the service line appeared to increase with the deviation of track support stiffness according to vehicle driving direction; therefore, it was inferred that the deviation of track support stiffness between each track section directly affected the track impact factor.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.10
• /
• pp.697-704
• /
• 2013

The identification of haplotypes, which encode SNPs in a single chromosome, makes it possible to perform haplotype-based association tests with diseases. Minimum Error Correction model, one of models to computationally assemble a pair of haplotypes for a given organism from Single Nucleotide Polymorphism fragments, has been known to be NP-hard even for gapless cases. In the previous work, an improved branch and bound algorithm was suggested and showed that it is more efficient than naive branch and bound algorithm by performing experiments for Apis mellifera (honeybee) data set. In this paper, to show the extensibility of the algorithm to other organisms we apply the improved branch and bound algorithm to the human data set and confirm the efficiency of the algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.43 no.2
• /
• pp.253-259
• /
• 2024

This paper proposes a new speech enhancement model based on a complex nested U-Net with a dual-branch decoder. The proposed model consists of a complex nested U-Net to simultaneously estimate the magnitude and phase components of the speech signal, and the decoder has a dual-branch decoder structure that performs spectral mapping and time-frequency masking in each branch. At this time, compared to the single-branch decoder structure, the dual-branch decoder structure allows noise to be effectively removed while minimizing the loss of speech information. The experiment was conducted on the VoiceBank + DEMAND database, commonly used for speech enhancement model training, and was evaluated through various objective evaluation metrics. As a result of the experiment, the complex nested U-Net-based speech enhancement model using a dual-branch decoder increased the Perceptual Evaluation of Speech Quality (PESQ) score by about 0.13 compared to the baseline, and showed a higher objective evaluation score than recently proposed speech enhancement models.

• KOREAN POULTRY JOURNAL
• /
• v.20 no.3 s.221
• /
• pp.144-145
• /
• 1988

축협중앙회가 88년도 1/4분기 축산관측결과를 발표하였는데 이중 산란계와 육계의 사육 및 가격동향과 전망은 다음과 같다.

• 한국전자현미경학회:학술대회논문집
• /
• 2005.11a
• /
• pp.31-32
• /
• 2005

• Korea Petroleum Association Journal
• /
• no.11 s.21
• /
• pp.76-89
• /
• 1982

이 자료는 한국개발연구원(KDI)의 「KDI 분기별경제전망」82년3/4분기호에서 옮긴 것이다. <편집자주>