• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.807-810
• /
• 1995

The effects of weae particles on the friiction and wear behavior of metals in dry sliding conditions are presented. The tribological test were performed using pure metal specimens which were selected based on their degrees of compatibility and hardness ratio. Friction and wear experiments were conducted using both pin-on-disk and reciprocating pin-on-plate type tribotesters to investigate the effect of motion history. Experimental results show that in the case of dry sliding the frictional behavior observed during pin-on-disk test differed form that of pin-on-reciprocator test for the given set of material pairs. The friction coefficient and wear rate were found to be higher for the pin-on-disk tests. It is suspected that the sliding motion of the pin affects the wear particle dynamics, which in turn influences the frictional behavior. The effect of material pair properties seemed to be relatively smaller than that of wear particles. The results of this paper is expected to aid in the design of mechanical systems for best tribological performance.

• Korean Management Science Review
• /
• v.21 no.3
• /
• pp.129-147
• /
• 2004

Scenario analysis for strategic planning, unlike most forecasting methods, provides a qualitative, contextual description of how the present will evolve into the future. It normally tries to identify a set of possible futures, each of whose occurrence is plausible but not assured. In this paper, we propose the use of Cross Impact Analysis(CIA) approach for scenario generation about the future of Korean IT environments. In this analysis, we classified IT environments into technical, social, legislative, and economic factor. And various variables and events were defined in each factor. From the survey collected from IT related experts, we acquire probability of occurrence and compatibility estimates of every possible pairs of events as input. Then 2 phase analysis is used in order to choice events with high probability of occurrence and generate scenario. Finally, after CIA using Monte Carlo simulation, a detail scenario for 2010 was developed. These scenario drawn from the CIA approach is a result considered by cross impacts of various events.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.99-108
• /
• 2001

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum load on the ring. The fastest a1gorithm to date is Myung, Kim and Tcha＇s a1gorithm that runs in Ο(n｜K｜) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha＇s a1gorithm arid runs in Ο(min{n｜K｜, n$^2$}) time.

• Journal of Biosystems Engineering
• /
• v.23 no.4
• /
• pp.381-390
• /
• 1998

An algorithm to extract the 3-D geometric information of a static object was developed using a set of 2-D computer vision system and a laser structured lighting device. As a structured light pattern, multi-parallel lines were used in the study. The proposed algorithm was composed of three stages. The camera calibration, which determined a coordinate transformation between the image plane and the real 3-D world, was performed using known 6 pairs of points at the first stage. Then, utilizing the shifting phenomena of the projected laser beam on an object, the height of the object was computed at the second stage. Finally, using the height information of the 2-D image point, the corresponding 3-D information was computed using results of the camera calibration. For arbitrary geometric objects, the maximum error of the extracted 3-D feature using the proposed algorithm was less than 1~2mm. The results showed that the proposed algorithm was accurate for 3-D geometric feature detection of an object.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.33-44
• /
• 2001

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.08a
• /
• pp.250-253
• /
• 1998

In digital communicatioin networks, speech recognition systems conventionally reconstruct speech followed by extracting feature [parameters. In this paper, we consider a useful approach by incorporating speech coding parameters into the speech recognizer. Most speech coders employed in the networks represent line spectral pairs as spectral parameters. In order to improve the recognition performance of the LSP-based speech recognizer, we introduce two different ways: one is to devise weighed distance measures of LSPs and the other is to transform LSPs into a new feature set, named a pseudo-cepstrum. Experiments on speaker-independent connected-digit recognition showed that the weighted distance measures significantly improved the recognition accuracy than the unweighted one of LSPs. Especially we could obtain more improved performance by using PCEP. Compared to the conventional methods employing mel-frequency cepstral coefficients, the proposed methods achieved higher performance in recognition accuracies.

• Journal of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.359-369
• /
• 2000

Let X be an integral Gorenstein projective curve with g:=pa(X) $\geq$ 3. Call $G^r_d$ (X,**) the set of all pairs (L,V) with L$\epsilon$Pic(X), deg(L) = d, V $\subseteq$ H^0$(X,L), dim(V) =r+1 and V spanning L. Assume the existence of integers d, r with 1 $\leq$ r$\leq$ d $\leq$ g-1 such that there exists an irreducible component, , of $G^r_d$(X,**) with dim($\Gamma$) $\geq$ d - 2r and such that the general L$\geq$$\Gamma$ is spanned at every point of Sing(X). Here we prove that dim( ) = d-2r and X is hyperelliptic.

• Smart Media Journal
• /
• v.9 no.3
• /
• pp.9-17
• /
• 2020

Hippocampus is a complex brain structure embedded deep into the temporal lobe. Studies have shown that this structure gets affected by neurological and psychiatric disorders and it is a significant landmark for diagnosing neurodegenerative diseases. Hippocampus features play very significant roles in region-of-interest based analysis for disease diagnosis and prognosis. In this study, we have attempted to learn the embeddings of this important biomarker. As conventional metric learning methods for feature embedding is known to lacking in capturing semantic similarity among the data under study, we have trained deep Siamese convolutional neural network for learning metric of the hippocampus. We have exploited Gwangju Alzheimer's and Related Dementia cohort data set in our study. The input to the network was pairs of three-view patches (TVPs) of size 32 × 32 × 3. The positive samples were taken from the vicinity of a specified landmark for the hippocampus and negative samples were taken from random locations of the brain excluding hippocampi regions. We have achieved 98.72% accuracy in verifying hippocampus TVPs.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.49-62
• /
• 1998

In the ring loading problem, traffic demands are given for each pair of nodes in an undirected ring network with n nodes and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the Problem is to minimize the maximum load on the ring. In the ring loading problem with integer demand splitting, each demand can be split between the two directions and the flow routed in each direction is restricted to integers. Recently, Vachani et al. ［INFORMS J. Computing 8 (1996) 235-242］ have developed an Ο(n$^3$) algorithm for solving this integer version of the ring loading problem and independently, Schrijver et al. ［to appear in SIAM J. Disc. Math.］ have presented an algorithm which solves the problem with ｛0,1｝ demands in Ο（n$^2$｜K｜ ) time where K denotes the index set of the origin-desㅇtination pairs of nodes having flow demands. In this paper, we develop an algorithm which solves the problem in Ο(n ｜K｜) time.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 1998.11a
• /
• pp.111-115
• /
• 1998

A phase-shifting projection moire method particularly intended for high-speed three-dimensional shape reconstruction of diffuse objects is presented. Emphasis is on realization of phase-shifting fringe analysis in projection moire topography using a set of line grating pairs designed to provide different phase shifts in sequence. Further a time-integral fringe capturing scheme is devised to remove undesirable high frequency original grating patterns in real-time without time-consuming software image processing. Finally the performances of the proposed method are discussed with measurement results.