• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.161-170
• /
• 1998

기존에 건설된 교통시설의 운영효율을 극대화하기 위한 지능형 교통체계의 한 분야인 ATIS는 도로를 이용하는 통행자에게 편리성을 제공하는 동시에 도로를 효율적으로 운영할 수 있는 정보체계이다. ATIS 체계하에서 통행자에게 신뢰성 있는 정보를 제공하기 위해서는 교차로서의 회전에 의한 지체를 정확하게 반영함은 물론이고 실시간으로 변화하는 교통상황을 반영할 수 있는 동적인 최단경로 탐색 알고리즘이 요구된다. 하지만 기존에 발표된 동적인 최단경로 탐색 알고리즘은 회전에 대한 정보를 반영하지 못하며 정적인 최단경로 탐색 알고리즘은 회전에 대한 정보를 반영하지 못하며 정적인 탐색알고리즘 조차 회전에 대한 정보를 정확히 반영하지 못한다. 본 연구에서는 이러한 이유에서 알고리즘 내부에서 회전을 반영하기 위해 수정형 덩굴망 알고리즘의 표지기법을 이용하여 동적인 최단경로 탐색알고리즘을 개발하였다. 본 연구에서 개발한 동적 최단경로 탐색 알고리즘은 정적인 상태의 수정형 덩굴망 알고리즘에 시간에 따라 변화하는 교통상황을 반영하기 위해 시간에 대한 변수를 추가하였다. 이렇게 해서 알고리즘은 시간대별로 변화하는 통행시간을 고려하여 최단 경로를 탐색하게 되며 출발시점을 기준으로 표지를 설정하여 모든 앞선 시간에 대해 경로를 고려하도록 하였다. 매 단계에서 전 노드를 추적하여 회전에 관한 정보를 반영하도록 하였다. 따라서 본 연구에서 개발한 최단경로 탐색 알고리즘은 교차로에서의 회전에 대한 정보와 통행금지 등을 정확히 반영하며 실시간으로 변화하는 통행시간을 반영함으로써 신뢰성 있는 노선 정보를 ATIS를 이용하는 통행자들에게 제공하는데 활용될 수 있는 기법이다.적으로 세부적 차종분류로 접근한다.의 영향들을 고려함으로써 가로망 설계 과정에서 가로망의 상반된 역할인 이동성과 접근성의 비교가 가능한 보다 현실적인 가로망 설계 모형을 구축하고자 한다. 지금까지 소개된 가로망 설계모형들은 용량변화에 대한 설계변수의 형태에 따라 이산적 가로망 설계 모형과 연속적 가로망 설계모형으로 나뉘어지게 된다. 본 논문의 경우, 계산속도의 향상 측면에서는 연속적 가로망 설계 모형을 도입할 수 있지만, 이때 요구되는 도로용량이 이산적인 변수(차선 수)로 결정되어야만 신호제어 변수를 결정할 수 있기 때문에, 이산적 가로망 설계 모형이 사용된다. 하지만, 이산적 설계모형의 경우 조합최적화 문제이므로 정확한 최적해를 구하기 위해서는 상당한 시간이 소요되며, 경우에 따라서는 국부 최적해에 빠지게 된다. 이러한 문제를 극복하기 위해, 우선 이상적 모형의 근사화, 혹은 조합최적화문제를 위해 개발된 Simulated Annealing기법의 적용, 연속적 모형의 변수를 이산화하는 방법 등 다양한 모형들을 고려해 본 뒤, 적절한 모형을 적용할 것이다. 가로망 설계 모형에서 신호제어를 고려하기 위해서는 주어진 가로망에 대한 통행 배정과정에서 고려되는 통행시간을 링크통행시간과 교차로 지체시간을 동시에 고려해야 하는데, 이러한 문제의 해결을 위해서 최근 활발히 논의되고 있는 교차로에서의 신호제어에 대응하는 통행배정 모형을 도입하여 고려하고자 한다. 이를 위해서 지금까지 연구되어온 Global Solution Approach와 Iterative Approach를 비교, 검토한 뒤 모형에 보다 알맞은 방법을 선택한다. 차량의 교차로 통행을 고려하는 perf

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.663-668
• /
• 2010

In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.

• The Korean Journal of Applied Statistics
• /
• v.9 no.2
• /
• pp.145-159
• /
• 1996

We propose an adaptive searching method using some spatial relations among sample points to estimate the interesting area in the spatial population. The fundamental idea is to observe the neighboring sample points when a sample point is satified with some condition of an adaptive searching observation. For obseving the sample points with this method to estimate the area the sample size is decreased. From this result, we may expect to reduce the cost and time consuming in observation the sample points and to draw the shape of the interesting area without prior information of an spatial population. Some analytical simulation results are also presented.

• Journal of Labour Economics
• /
• v.40 no.2
• /
• pp.69-87
• /
• 2017

This paper examined the impact of student loan on job search duration, explicitly considering the type of student loan. The data was collected from Korean Education & Employment Panel (KEEP) study released by KRIVET. The survival analysis shows the following two patterns. First, the students who used the student loan with guarantee tended to have longer job search duration of job search. Second, the students with the income contingent loan tended to have shorter job search duration to end up with lower wage.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.585-588
• /
• 2010

The prediction of user location within a building can be applied to many areas like visitor guiding. The existing methods for solving this problem consider limited number of locations a user visited in the past to predict the current location. It cannot model the complex movement patterns, and makes the system inefficient by modeling simple ones too detail. Also it causes prediction errors. In this paper, there is no restriction on the length of past movement patterns to consider for current location prediction. For this purpose, a modified search tree is used. The search tree is constructed to make exact matching as needed for location prediction. The search tree makes the efficient and accurate prediction possible.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.29-33
• /
• 2019

Recently, due to the rapid improvement of communication technologies as well as the easy production of video contents, IPTV is becoming increasingly popular. Meanwhile, as the number of IPTV channels increases rapidly, much time is required for finding the user's desired channel. This paper discusses and analyzes the effectiveness of reducing IPTV channel searching delays by using memory management techniques of computer systems. Specifically, this paper introduces how memory management techniques such as memory replacement, prefetching, and caching techniques can be adopted in IPTV channel searching interfaces by mapping between the two problems and discusses the effectiveness of the techniques.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.161-169
• /
• 1996

This paper presents a new search region prediction method using vector quantization for the motion estimation. We find motion vectors using the full search BMA from two successive frame images first. Then the motion vectors are used for training a codebook. The trained codebook is the predicted search region. We used the unsupervised neural network for VQ encoding and codebook design. A major advantage of formulating VQ as neural networks is that the large number of adaptive training algorithm that are used for neural networks can be applied to VQ. The proposed method reduces the computation and reduce the bits required to represent the motion vectors because of the smaller search points. The computer simulation results show the increased PSNR as compared with the other block matching algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.112-119
• /
• 2000

A two-color infrared (IR) seeker employs two detection-bands for efficient target tracking under countermeasures and background noises. This paper describes a study on the detection-band selections for the two-color seeker. To select the detection-bands, we analysis infrared radiation characteristics of a target, a flare, and background noises and then other characteristics closely related with the received power, such as the atmospheric transmission, acquisition range, background noise effect, and signal-to-noises. The analysis shows that the pertinent bands of two-color IR seeker are 3 um~5 um for target detection and 1.5 um~l.7 um for counter-countermeasures. The results of our study will play a significant role in the further study of two-color seekers.

• Journal of the Korean Society for information Management
• /
• v.17 no.4
• /
• pp.187-206
• /
• 2000

This study is to analyrc the f~~nclional capdbiiities and interracc features or OPAC systems in twcnty-[ouracademc libraries in order to iuvesugale thc strongest pan and (he nveakesl or OPACs. For h e sludy, lllc checklistwas developed. TIE findmgs of thc sludy suegesl Lhat. among the leu RreE evaluated, '.Access Poinls." is lhe bcstdeveloped m a , whercas "Subject Scarc11 Aids" is the wekcst. Timefore, the OPAC system designers am1 librarianswill improvc the varlou sci~rch aids luncuonr and vocabulary browsiug function and will develop mil imlilen\ulcornerentvisual merracc ilnd hyper linkmg inechanism. hyper linkmg inechanism.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.9 no.3
• /
• pp.89-95
• /
• 2014

The purpose of this study was to examine the impact of a career exploration education to job-seeking anxiety, career maturity and Career decision-making in an effort to prove the effectiveness of career exploration education. The subjects in this study were 65 high school student who were users of B high school in the city of Gwang-Ju. An experimental group and a control group were organized with 65 high school student' each, and a career exploration education was conducted in nine sessions, once a week. The major findings of the study were as follows: The experimental group who participated in the career exploration education felt less job-seeking anxiety, improvement in career maturity and Career decision-making. Second, the experimental group who participated in the career exploration education showed. Third, the experimental group who participated in the career exploration education showed improvement in.