• Journal of KIISE:Software and Applications
• /
• v.28 no.2
• /
• pp.201-209
• /
• 2001

고성능 마이크로 프로세서들은 성능 향상을 위해 ILP를 지원한다. 병렬성을 극대화시키기 위해서는 많은 성능 저해 요인들을 제거해야 한다. 최근에는 컴파일러의 역할을 증대시켜 이러한 요인들을 줄이기 위한 노력들이 활발히 진행되고 있다. 본 논문에서는 성능 저해 요인인 조건 분기 처리를 위하여 조건 실행과 레지스터 할당을 결합함으로써 메모리로의 대피를 최소화하고 병렬성을 향상시킬 수 있는 개선된 레지스터 할당 알고리즘을 제안한다. 제안한 방법을 적용하여 실험한 결과 간섭 그래프의 에지수가 4.47% 감소되었고 그 결과 요구되는 대피 변수의 수도 21.35% 감소되었다. 그리고 기존의 방법에 비해 19.38%의 성능 향상 결과를 얻었다. 결국 본 레지스터 할당 기법은 조건 실행을 통해 조건 분기 명령을 제거하여 기본 블록 내의 명령어 수를 증가시켜 병렬처리의 기회를 증진시키고 조건 분석을 통해 간섭 그래프의 불필요한 에너지를 제거시켜 보다 효율적인 레지스터 할당을 실현함으로써 제안한 방법의 타당성을 검증하였다.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2231-2233
• /
• 1998

본 논문은 손등의 정맥패턴을 이용한 개인식별을 위해 개발된 3가지의 알고리즘에 관해 각각의 성능을 비교한 결과를 제시한다. 세가지 방법은 각각 Unsharp Masking을 이용한 이치화 후 정맥과 손등 배경의 면적을 이용한 가중치를 적용한 원형정합 알고리즘[1]과 Kolmogorov Smirnov(KS) statistic[2]을 이용한 매칭 알고리즘을 개선한 방식, 그리고 정맥의 세선화 처리 후 분기점의 좌표, 정맥의 길이, 정맥 가지 사이의 분기각도 등의 특징벡터를 이용한 방법 등이다. 본 연구에서는 전처리 과정에 있어서, 원시영상의 혈관부위와 배경부위의 gray scale 분포가 겹친 상태에서 Unsharp Masking 필터링을 적용한 결과가 기타 다른 전처리 방식보다 우수하게 영상을 강화시킬 수 있음을 확인하였고, 가중치를 이용한 매칭방식이 다른 매칭방식보다 우수함을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.658-660
• /
• 1999

Ziv-Lempel 코딩 방식은 문자열이 반복해서 나올 때 뒤에 나오는 문자열을 앞에 나온 문자열에 대한 포인터로 대칭시킴으로써 압축을 한다. 따라서 이 방식을 위해서는 앞서 나온 문자열을 유지하는 사전과 문자열 매칭이 필수적이다. 그래서 이 두 가지에 효율적인 자료구조인 접미사 트리를 Ziv-Lempel 코딩 방식에 적용시키려고, 그 이후에 Fiala, Greene와 Larsson은 각각 McCreight와 Ukkonen의 접미사 트리 생성 알고리즘을 LZ77 코딩에 이용하였다. 접미사 트리를 이용한 Zv-Lempel 코딩에는 만들어진 사전, 즉 접미사 트리와 앞으로 압축될 문자열과의 가장 긴 매치는 찾는 과정이 있다. 이는 단순히 접미사 트리의 루트부터 차례로 검색해 나가도 되지만 이렇게 했을 때 걸리는 시간은 노드에서 자식을 찾는데 걸리는 분기 결정 시간에 의해 좌우된다. 즉 분기에 성형 시간 이상이 걸리면 가장 긴 매치를 찾는데도 역시 선형 시간 이상이 걸린다. 게다가 이 방법은 자기 중복(self-overlapping)의 이점을 살릴 수가 없다. Rodeh, Pratt와 Even은 McCreight의 생성 알고리즘을 이용할 때 가장 긴 매치를 바로 찾을 수 있다는 것을 발견했다. 그러나 Ukkonend의 알고리즘에 대해서는 아직 이러한 방법이 알려지지 않았다. 본 논문에서는 Ukkonen의 알고리즘에 몇가지 작업을 추가하여 전체적으로 선형시간안에 가장 긴 매치를 찾는 방법을 소개한다.

• 두엄누리회보
• /
• s.4
• /
• pp.1-18
• /
• 2003

2/4분기 이사회의 개최 - 홈페이지 활용방법 - 부산물비료 생산반 교육 - 비료성분 분석 의뢰

• Proceedings of the KWS Conference
• /
• 2003.11a
• /
• pp.113-116
• /
• 2003

• Korean Journal of Social Welfare Studies
• /
• v.42 no.2
• /
• pp.351-379
• /
• 2011

This study explores the divergence of grounded theory focused on the differences of Glaser and Strauss. Grounded theory has been divided into two versions, Glaser version and Strauss version. Two versions are different in research methodology. Therefore, it is important for us to choose one of these two version. There are many grounded theory researches or qualitative researches by grounded theory approach in Korea. But Theses researches has been studied only Strauss version. Therefore this article introduces the differences of Glaser method and Strauss method in various aspects of research methods: basic logic of research process, core category and basic social process, and coding methods - especially axial coding, selective coding and theoretical coding. Glaser and Strauss argued differently in many aspects of grounded theory method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.418-425
• /
• 2005

3D surface reconstruction is to make the original geometry of 3D objects from 2D geometric information. Barequet's algorithm is well known and most widely used in surface reconstruction. It tiles matched regions first, then triangulates clefts using dynamic programming. However it takes considerably long processing time while manipulating complex model. Our method tiles a simple region that does not have branches along minimally distant vertex pairs at once. When there are branches, our method divides contour lines into a simple region and clefts. We propose a fast and simple method that calculates medial axes using a minimum distance in cleft region. Experimental results show that our method can produce accurate models than the previous method within short time.

• Tuberculosis and Respiratory Diseases
• /
• v.40 no.2
• /
• pp.177-184
• /
• 1993

Background: Accurate staging of bronchogenic carcinoma is important in determining resectability and metastasis of tumor to the subcarinal nodes is generally believed to indicate poor prognosis. The technique of Transbronchial needle aspiration (TBNA) has offered a safe & effective way to asscess mediastinal lymph node involvement in the staging of lung cancer. We performed TBNA in patients who were suspected lung cancer to evaluate the clinical usefulness of the TBNA. Method: TBNA of the subcarinal lymph node was performed at the time of initial diagnostic bronchoscopy in 60 patients with suspected lung cancer, and 42 cases of histologically proved bronchogenic cancer were analized. Results: The frequency of adequate samples by transbronchial needle aspiration (TBNA) was 81% and the positive rate of malignant cells by TBNA was 14.7%. There were no differences in positive rates by tumor cell types. In patients with thickened carina on bronchoscopy, the TBNA was positive in 33.3% as compared to 5.3% of normal carina on bronchoscopy, and the difference was statistically significant (p<0.05). In patients with enlarged subcarinal lymph node on chest CT, the positive rate of malignant cells (50.0%) was higher than that of normal sized subcarinal lymph node on chest CT (4.8%) (p<0.01). There were no specific complications in the TBNA procedure. Conclusion: TBNA is a relatively safe procedure and it offers the possibility of avoiding the cost and morbidity of surgical staging in patients especially whose carina is thickened on bronchoscopy and whose subcarinal LN was enlarged on chest CT.

• Journal of the Korean Society for Railway
• /
• v.19 no.6
• /
• pp.717-726
• /
• 2016

Emergency tracks are necessary in case a broken down train evacuates, a train needs to make way for a faster train behind it, or a train suddenly stops and following trains must avoid colliding with it. Magnetic Levitated (maglev) Trains can change track to enter an emergency track using a segmented switch or a traverse switch. On a traverse switch, a train can change its track when the part of the track that the train is on moves to the other track. Currently manufactured Maglev trains have two bodies and the total length is 25 meters. If a traverse switch is used, it will only require 30 meters of track to move the train to the other track, so, when it comes to efficiency of costs and space, the traverse switch surpasses the articulated switch. Therefore, in this paper, an optimized design to secure structural safety and weight lightening is suggested. To achieve these results, the heights of the piled concrete and girders which are both placed on the top of the traverse switch, are set as design variables. The Finite Element Method (FEM), in application of kriging and in the design of the experiments (DOE), is used. Maximum stress, deformation, and structural weight are compared with the results, and through this process structural safety and weight lightening is proven.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.2
• /
• pp.61-71
• /
• 2007

The instruction level parallelism, which has been used to improve the performance of processors, expose its limit. The change of a control flow by a branch miss prediction is one of the obstacles that restrict the instruction level parallelism. The single chip multiprocessors have been developed to utilize the thread level parallelism. However, we could not use the maximum performance of the single chip multiprocessor in case of executing the coded programs without considering the multi-thread. In order to overcome the two performance degradation factors, in this paper, we suggest the concurrent branch execution method that applies to the multi-path execution method at a single chip multiprocessor. We executes all two flows of the conditional branch using the idle core processor. Through this, we can improve the processor's efficiency with blocking the control flow termination by the branch instruction and reducing the idle time. We analyze the effects of concurrent branch execution proposed in this paper through the simulation. As a result of that, concurrent branch execution reduces about 20% of idle time and improves the maximum 10% of the branch prediction accuracy. We show that our scheme improves the overall performance of maximum 39% compared to the normal single chip multiprocessor and maximum 27% compared to the superscalar processor.