• Journal of KIISE:Computer Systems and Theory
• /
• 제31권10호
• /
• pp.593-602
• /
• 2004

A new surface reconstruction scheme for approximating the surface from a set of unorganized 3D points is proposed. Our method, called shrink-wrapped boundary face (SWBF) algorithm, produces the final surface by iteratively shrinking the initial mesh generated from the definition of the boundary faces. Proposed method surmounts the genus-0 spherical topology restriction of previous shrink-wrapping based mesh generation technique, and can be applicable to any kind of surface topology. Furthermore, SWBF is much faster than the previous one since it requires only local nearest-point-search in the shrinking process. According to experiments, it is proved to be very robust and efficient for mesh generation from unorganized points cloud.

• Korean Journal of Optics and Photonics
• /
• 제27권6호
• /
• pp.223-228
• /
• 2016

The birefringence of distributed, uniaxially anisotropic molecules like liquid crystals is calculated as the degree of ordering is varied. The relation between the normalized birefringence ${\Delta}n_{rel}$ and the orientational order parameter S is investigated. The distribution function, which enables one to monitor the degree of ordering of liquid crystals including randomly distributed ones, is introduced. Using this distribution function, a series of distributed liquid crystals with order parameters ranging from 0 to 1 are generated, and ${\Delta}n_{rel}$ and S of the correspondingly distributed liquid crystals are calculated. Based on the calculated data, it is revealed that ${\Delta}n_{rel}$ and S satisfy the quasi-linear relation of $S=(1+a){\Delta}n_{rel}-a{\Delta}n^2_{rel}$, where a can be approximated as $n_o{\frac{{\Delta}n}{4}}$. The anisotropy of molecular polarizability is also calculated, using the birefringence, and separately following Vuks' method and Neugebauer's method, and it is shown that the relations between S and the molecular-polarizability anisotropy are also quasi-linear.

• The Bulletin of The Korean Astronomical Society
• /
• 제40권1호
• /
• pp.82.3-83
• /
• 2015

비축 반사경의 DTM (Diamond Turning Machine) 가공을 하기 전에는 시간 및 비용의 절감을 위해 CNC(Computerized Numerically Controlled Machine Tools)를 이용하여 비축면의 곡률반경과 가장 유사한 형태의 구면으로 1차 가공 후 3축 이상을 제어할 수 있는 MC (Machining Center)를 이용하여 근사한 비축면을 먼저 가공한다. 이후 DTM으로 광학계에서 요구하는 형상 정밀도 및 표면 조도를 만족하는 비축면을 완성한다. 하지만 비축면을 가공하는 경우, 일반적인 축 대칭 광학계와 달리 가공장비에 장착된 기상계측기를 사용할 수 없기 때문에 외부 장비를 이용하여 반사경 표면을 측정해야한다. 이때 측정과 가공 단계 사이에서 정렬오차가 발생하여 반사경의 형상 정밀도 향상을 위한 보상가공에 어려움이 있다. 본 연구에서는 비축면 반사경의 가공과 측정 과정 사이에 발생하는 정렬오차를 최소화 할 수 있는 DTM 가공용 지그를 설계 및 제작하였다. 또, DTM으로 가공한 반사경의 측정값과 설계값을 비교하여 알루미늄 반사경의 광학 성능을 평가하였다. 이러한 성능 평가 결과는 비축면 반사경의 형상 보상가공을 위한 모델링 방법을 고안하는데에 있어 핵심 자료가 될 것이다.

• Korean Journal of Materials Research
• /
• 제9권11호
• /
• pp.1049-1054
• /
• 1999

Two-step growth method is suggested to enhance the alignment of highly oriented diamond films. (100) Si wafers are pretreated with negative biasing of - 200 V at $850^{\circ}C$ for 20 min with 4 % methane in hydrogen plasma. The pretreated wafers are grown under the lst-step growth conditions(2 % CH$_4$ in H$_2$, $810^{\circ}C$) from 2 hr to 35 hr, in order to obtain <100> textured films. The 2nd-step growth(2 % CH$_4$ in H$_2$, $850^{\circ}C$) is carried out to make diamond films having (100) growth planes, which are parallel to the substrate. The alignment of the films after the 1st-step growth, has been analyzed by {111} X-ray pole figure, which is improved abruptly with increasing film thickness. However, the pyramidal surface morphology is inevitable. These morphology is flattened after the 2nd-step growth by developing the (100) facets parallel to the substrate. The alignment of the highly oriented textured films after the two-step growth depends on the thickness of the 1st-step growth film.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제29권7C호
• /
• pp.921-930
• /
• 2004

In this paper, a robust video transmission system is proposed. To effectively prevent the corruption of video stream and its propagation in spatial and temporal domains, a version of turbo code, so-called as byte-aligned variable-length turbo code, is applied. Protection performance of the proposed turbo code is first evaluated by applying it to GOB-based variable-size ITU-T H.263+ video packets, where the protection level is statically controlled based on the joint source-channel criteria. This protection is then extended to support the adaptation of code ratio to best match the time-varying channel condition. The time-varying Rayleigh fading channel is modelled considering the correlation of the fading channel. The resulting performance comparison with the static turbo code as well as the conventional RCPC code clearly demonstrates the possibility of the proposed adaptation approach for the time-varying correlated Rayleigh-fading channel.

• Journal of the Korean Vacuum Society
• /
• 제20권6호
• /
• pp.461-467
• /
• 2011

The valence band maximum and the conduction band miminum of GaAs, GaSb, InAs, and InSb (constituent binaries of the quaternaty alloy $Ga_xIn_{1-x}Sb_yAs_{1-y}$) are calculated by using TB analytical approach method. The band alignment types of their heterojunctions are determined directly from their relative position of band edges (VBM and CBM). For example, the GaAs/InAs, GaAs/InSb, and GaSb/InSb are in a type-I, the GaAs/GaSb in a type-II, and the GaSb/InAs and InSb/InAs in a type-III, respectively. The composition dependent VBM and CBM for the $Ga_xIn_{1-x}Sb_yAs_{1-y}$ alloy are obtained by using the univeral tight binding method. For the alloyed heterojunctions, the band alignments can be controlled by changing the composition which induce a band type transition. For the alloy $Ga_xIn_{1-x}Sb_yAs_{1-y}$ lattice mathced to GaSb, the type-II band alignment in the region of $x{\leq}0.15$ is changed to the type-III in the region of $x{\geq}0.81$. On the other hand, the alloy $Ga_xIn_{1-x}Sb_yAs_{1-y}$ lattice mathced to InAs has the type-II band alignment in the region of $x{\leq}0.15$ and the type-III band alignment in the region of $x{\geq}0.81$, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제29권11B
• /
• pp.930-937
• /
• 2004

In this paper, we analyze the delay performance for a Markovian source transported over a wireless channel with time-varying error characteristics. To improve the reliability of the channel, the end points of the wireless link implement a selective-repeat (SR) ARQ error control protocol. We provide an approximate discrete-time analysis of the end-to-end mean packet delay, which consists of transport and resequencing delays. Numerical results and simulations indicate that our approximate analysis is sufficiently accurate for a wide range of parameter values.

• Journal of KIISE:Information Networking
• /
• 제27권3호
• /
• pp.315-322
• /
• 2000

네트워크에서 QoS를 보장하기 위해 최근에 제안되는 패킷 스케줄링 알고리즘은 대부분 우선 순위에 입각한 패킷 전송 서비스를 한다. 이러한 우선 순위를 유지하기 위한 큐의 관리에는 많은 비용이 들므로 QoS를 보장하는 네트워크에서 우선 순위 큐의 관리 비용을 줄이는 노력이 필요하다. 패킷 스케줄링 알고리즘 중 RPO+(Rotate Priority Queue)는 우선 순위 FIFO(First in first out)큐를 사용하여 주기 적으로 재명명되는 패킷 스케줄링 알고리즘이다. FIFO 큐에 패킷들을 근사 정렬하여 패킷의 우선 순위를 유지하므로 계산 복잡도를 줄이지만, 패킷 우선 순위를 유지하기 위해 2배(2P)의 큐를 필요로 한다.[1] 본 논문에서는 필요한 큐의 개수를 P개의 큐로 제한하여 큐에 대한 관리 비용을 줄였으며 엔터프라이즈 환경에서 애플리케이션이 요구하는 서비스 특성에 따라 클래스로 구분하여 적합한 패킷 스케줄링 서비스를 제공하는 알고리즘을 제시한다. 본 기법은 추가적인 오버플로우 큐를 관리하고 패킷 어드미션 컨트롤러를 통해 패킷 전송 지연 시간을 제한함으로 다양한 애플리케이션의 네트워크 QoS 요구를 보장하고 패킷 전손 효율을 높였다.

• Journal of KIISE:Software and Applications
• /
• 제37권10호
• /
• pp.788-801
• /
• 2010

Advancing of mobile device is remarkable, so the research on mobile input device is getting more important issue. There are lots of input devices such as keypad, QWERTY keypad, touch and speech recognizer, but they are not as convenient as typical keyboard-based desktop input devices so input strings usually contain many typing errors. These input errors are not trouble with communication among person, but it has very critical problem with searching in database, such as dictionary and address book, we can not obtain correct results. Especially, Hangeul has more than 10,000 different characters because one Hangeul character is made by combination of consonants and vowels, frequency of error is higher than English. Generally, suffix tree is the most widely used data structure to deal with errors of query, but it is not enough for variety errors. In this paper, we propose fast approximate Korean word searching system, which allows variety typing errors. This system includes several algorithms for applying general approximate string searching to Hangeul. And we present profanity filters by using proposed system. This system filters over than 90% of coined profanities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제37A권10호
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.