• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제12권5호
• /
• pp.229-236
• /
• 2023

3D 출력된 의료용 임플란트(implant) 부품은 보통 표면에 결함이 발생되므로, 출력 후 표면을 검사하는 과정이 필요하다. 자동화된 표면 검사를 수행하기 위해서는 임플란트를 3D 스캔하여 점군(point cloud)과 같은 스캔 모델로 복원하는 방법이 효과적이다. 스캔 모델을 구성할 때, 임플란트는 일반적인 3D 출력 제조 부품과 다른 특성들을 가지므로, 임플란트의 형태와 재료의 특성에 대한 고려가 필요하다. 본 논문에서는 의료용 임플란트 부품의 한 종류인 금속 bone-plate의 3D 출력물에 대해 스캔 모델로 복원하는 방법을 제안한다. 다각도의 시점에서 3D 스캔을 수행하여 다수의 부분 스캔 데이터를 생성한 뒤, 이들에 대해 정렬(alignment)과 정합(merging)을 수행하여 스캔 모델로 복원한다. 또한, 실험을 통해 스캔 모델로 복원하는 과정을 보인다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제28권2호
• /
• pp.168-178
• /
• 2001

진화 알고리즘은 자원 관리, 스케줄링, 패턴 인식 등의 다양한 문제들에 적용되는, 일반적이고 효율적인 최적화 방법이다. 그러나 이러한 진화 알고리즘의 문제점은 탐색해야할 변수가 증가할수록 그에 따른 차원의 증가로 인하여 기하급수적으로 늘어나는 탐색공간에 약하다는 것이다. 이러한 문제점을 해결하기 위해 Potter와 DeJong은 개개의 종족을 독립적으로 진화시킴으로써 탐색공간을 대폭 줄인, 협력 공진화 알고리즘을 제안하였다. 그러나 이것 또한 변수 의존성이 강한 문제들에 대해서는 비효율적인 탐색을 하는 문제점이 있다. 본 논문에서는 종족의 분할과 병합을 이용한 효율적인 공진화 알고리즘을 제안한다. 이 알고리즘은 최적화하려는 변수들이 서로 의존성이 없는 경우에는 종족의 분할을 통하여 탐색공간의 축소의 잇점을 얻고, 최적화하려는 변수들이 서로 의존성이 있는 경우에는 종족의 병합을 통하여 전역탐색을 하도록 한다. 제안하는 알고리즘을 몇 가지 벤치마크 함수 최적화 문제와, 상품 재고 제어문제로 실험하여 현존하는 어떤 공진화 알고리즘 보다도 효율적인 것을 보여준다.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2009년도 추계학술대회 논문집
• /
• pp.285-285
• /
• 2009

Due to a development of a modem technology as Power Line Communication(PLC) over 200 Mbps, the high-speed multi-media data trasmission could be currently possible. In This paper we develop a high quality media transmitter-receiver based on merging the HomePlug AV, which is 200 Mbps class PLC technology and HDMI Interface technology. Smart Live 6 software were used for the assessment of audio property. As the result of measurement of the HD class images by capturing from the receiver of the PLC, the quality of images couldn't be confirm any deterioration, which has compared with original reflections. In case of audio part as the result of confirmation of the Phase, Magnitude, it has been confirmed that over 90% of nomal transmition and receiving of acoustic signal.

• Journal of Microbiology and Biotechnology
• /
• 제25권6호
• /
• pp.765-770
• /
• 2015

Recent sequencing technology development has revolutionized fields of microbial ecology. MiSeq-based microbial community analysis allows us to sequence more than a few hundred samples at a time, which is far more cost-effective than pyrosequencing. The approach, however, has not been preferably used owing to computational difficulties of processing huge amounts of data as well as known Illumina-derived artefact problems with amplicon sequencing. The choice of assembly software to take advantage of paired-end sequencing and methods to remove Illumina artefacts sequences are discussed. The protocol we suggest not only removed erroneous reads, but also dramatically reduced computational workload, which allows even a typical desktop computer to process a huge amount of sequence data generated with Illumina sequencers. We also developed a Web interface (http://biotech.jejunu.ac.kr/ ~abl/16s/) that allows users to conduct fastq-merging and mothur batch creation. The study presented here should provide technical advantages and supports in applying MiSeq-based microbial community analysis.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1851-1854
• /
• 2002

The Internet with conventional routing scheme cannot meet user demands driven from drastic growth in the Internet user and various service and traffic type. MPLS(Multi Protocol Label Switching) was introduced to the Internet fur solution to resolve this problem. MPLS is a paradigm to integrate higher layer’s software routing functions including layer-3 routing with layer-2 switching. But, the exponential growth of Internet traffic brings out of label space. One scalable solution to cope with this problem is to introduce flow merge technique, i. e. a group of flows is forwarded using the same label. Specially, IETF(Internet Engineering Task Force) recommends that ATM based MPLS system may include VC merge function, so it is scalable to increase of internet traffic. We implemented the MPLS LER system that includes the look-up and forwarding function in incoming path and VC merging function and limited traffic management function in outgoing path. This paper describes the implementation of the LER’s outgoing parts.

• Journal of Dental Anesthesia and Pain Medicine
• /
• 제21권3호
• /
• pp.253-260
• /
• 2021

Therapeutic injections into the craniofacial region can be a complex procedure because of the nature of its anatomical structure. This technical note demonstrates a process for creating an extra-oral template to inject therapeutic substances into the temporomandibular joint and the lateral pterygoid muscle. The described process involves merging cone-beam computed tomography data and extra-oral facial scans obtained using a mobile device to establish a correlated data set for virtual planning. Virtual injection points were simulated using existing dental implant planning software to assist clinicians in precisely targeting specific anatomical structures. A template was designed and then 3D printed. The printed template showed adequate surface fit. This innovative process demonstrates a potential new clinical technique. However, further validation and in vivo trials are necessary to assess its full potential.

• 시스템엔지니어링학술지
• /
• 제17권2호
• /
• pp.61-68
• /
• 2021

A decrease in the fertility rate leads to a reduction of troops, so the need to efficiently operate the troops is growing. Therefore, it is necessary to develop a system for estimating warship manpower. In this study, system development was performed according to the CBD methodology. The user requirements were defined and the system function that satisfies the requirements was derived. And through the development process, the CBD methodology and the systems engineering process were compared. As a result, similarities were confirmed in the analysis and concept design stages, so the possibility of merging the two processes was suggested.

• 천문학논총
• /
• 제22권2호
• /
• pp.43-54
• /
• 2007

Many gravitational wave detectors are now being built or under operation throughout the world. In particular, LIGO has taken scientific data several times, although current sensitivity is not sufficient to detect the weak signals routinely. However, the sensitivities have been improving steadily over past years so that the real detection will take place in the near future. Data analysis is another important area in detecting the gravitational wave signal. We have carried out the basic research in order to implement data analysis software in Korea@home environment. We first studied the LIGO Science Collaboration Algorithm Library(LAL) software package, and extracted the module that can generate the virtual data of gravitational wave detector. Since burst sources such as merging binaries of neutron stars and black holes are likely to be detected first, we have concentrated on the simulation of such signals. This module can generate pure gravitational wave forms, noise suitable for LIGO, and combination of the signal and noise. In order to detect the gravitational signal embedded in the noisy data, we have written a simple program that employs 'matched filtering' method which is very effective in detecting the signal with known waveform. We found that this method works extremely well.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권5호
• /
• pp.643-650
• /
• 2004

제어 흐름 그래프는 자료 흐름 분석과 제어 종속 분석과 같은 프로그램 분석 분야와 프로그램 슬라이싱과 테스팅과 같은 소프트웨어공학 분야에서 필요로 하는 정보이다. 이러한 분석들이 안전하고 유용하기 위해서는 제어 흐름 그래프는 예외 흐름을 포함해야 한다. 기존의 방법은 예외 흐름과 정상 흐름의 상호 의존적인 관계로 인해 두 흐름을 동시에 계산하면서 제어 흐름 그래프를 생성한다. 그러나 실제 Java 프로그램을 조사해 본 결과 두 흐름이 상호 의존적으로 필요한 경우는 거의 발생하지 않음을 알 수 있었다. 그러므로 정상 흐름과 예외 흐름을 분리해서 계산할 수 있음을 알았고, 예외 흐름을 계산하는 예외 흐름 분석을 제안한다. 그리고 예외 흐름을 표현하는 예외 흐름 그래프를 제안한다. 그리고 제어 흐름 그래프는 예외 흐름 그래프와 정상 흐름 그래프를 합병함으로써 생성될 수 있음을 보인다.

• ETRI Journal
• /
• 제21권2호
• /
• pp.31-39
• /
• 1999

Given two sorted lists A=(a0, a1, ${\cdots}$,a${\ell}$-1}) and B=(b0, b1, ${\cdots}$, bm-1), we are to merge these two lists into a sorted list C=(c0,c1, ${\cdots}$, cn-1), where n=${\ell}$+m. Since this is a fundamental problem useful to solve many problems such as sorting and graph problems, there have been many efficient parallel algorithms for this problem. But these algorithms cannot be performed efficiently in the postal model since the communication latency ${\lambda}$, which is of prime importance in this model, is not needed to be considered for those algorithms. Hence, in this paper we propose an efficient merge algorithm in this model that runs in $$2{\lambda}{\frac{{\log}n}{{\log}({\lambda}+1)}}+{\lambda}-1$$ time by using a new property of the bitonic sequence which is crucial to our algorithm. We also show that our algorithm is near-optimal by proving that the lower bound of this problem in the postal model is $f_{\lambda}({\frac{n}{2}})$, where $${\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}{\le}f_{\lambda}({\frac{n}{2}}){\le}2{\lambda}+2{\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}}$$.