• Title/Summary/Keyword: 지역 탐색

Search Result 1,572, Processing Time 0.027 seconds

An Improved Route Recovery using Bidirectional Searching Method for Ad hoc Networks (Ad hoc 네트워크에서의 양방향 경로탐색을 이용한 경로복구 개선 방안)

  • Han, Ho-Yeon;Nam, Doo-Hee;Kim, Seung-Cheon
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.35-41
    • /
    • 2010
  • Since the ad-hoc network allow nodes to communicate each other without infrastructure system and predefined configuration, it comes into the spotlight that is suitable to ubiquitous society. In ad-hoc network, route recovery mechanism is considered important. Normally route recovery is needed to solve the link failure problem because there is no route maintaining system like a router in ad-hoc networks. In this paper we propose BS-AODV(Bidirectional Searching-AODV) route recovery method. The proposed method is a local repair method that can be applied in all of the network area. Unlike a limited local repair method in AODV. the proposed method adopts the bidirectional searching method where the upstream/downstream nodes can send the route maintenance messages. Restricting the flooding of route request messages, the proposed scheme attempts to minimize the costs of local repair, the performance of the proposed scheme is evaluated through the simulations. In two scenarios which variate the node numbers and node speed, the comparison among the proposed scheme, AODV and AOMDV is shown in terms of the control traffic and data delivery ratio.

A Performance Analysis of Routing Protocols Avoiding Route breakages in Ad hoc Networks (애드 흑 네트워크에서 경로 손실 회피 라우팅 프로토콜의 성능평가)

  • Wu Mary;Jung Sang Joon;Jung Youngseok;Kim Chonggun
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.49-58
    • /
    • 2006
  • When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

Comparision of metaheuristic methods for generating long-term reservoir operation rule (장기 저수지운영률 도출을 위한 메타휴리스틱 기법의 비교)

  • Kang, Shin-Uk;Lee, Sang-Ho;Kim, Hyeon-Sik
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2011.05a
    • /
    • pp.226-226
    • /
    • 2011
  • 최적 저수지운영을 위한 운영률 도출이나 강우-유출 및 수질 모형의 매개변수 추정 문제처럼 비선형적이고 추정해야할 변수의 수가 많은 경우, 수학적으로 모형화하기에 너무 복잡해서 선형계획법, 비선형계획법, 동적계획법 등을 사용하여 최적해를 구할 수 없는 경우도 있다. 이러한 문제에 대해서는 구조적 진화를 통해 최적해를 구하는 방법들이 사용된다. 일반적으로 미지수의 개수가 많아지면 전역최적해를 찾기가 어려워진다. 전역최적해를 찾는 여러 가지 방법들이 수자원 분야에서는 강우-유출모형의 매개변수를 추정하는데 많이 사용되고 있으며, 특히 유전자 알고리즘, SCE-UA 알고리즘 등 전역최적해를 찾는 메타휴리스틱 방법이 많이 사용되고 있다. 전역최적화 방법을 개발하는 연구자들은 최적화방법의 성능을 평가하기 위해 다양한 검사함수(test function)를 만들어 성능을 평가하고 있다. 본 연구에 사용한 검사함수는 Mishra의 연구(2006a, 2006b)에서 사용한 중요하고 복잡한 검사함수이다. 유전자 알고리즘, SCE-UA 알고리즘, DDS 알고리즘을 검사함수 중 전역해를 찾기 어려운 2 차원 함수 2 가지, 다차원 함수 4 가지 함수에 적용하여 각각의 탐색 성능을 평가하였다. 2차원 함수인 Bukin 함수에 대해서는 모든 최적화 방법이 전역최적해를 찾을 수 없었지만, 유전자 알고리즘이 가장 전역최적해에 가까웠고 다음으로 DDS 알고리즘 순서였다. 지역수렴 영역이 많을 것으로 판단되는 10, 30, 50 차원 Michalewicz 함수에 대해서는 DDS 알고리즘으로 구한 최적해가 전역최적해와 매우 근접하였고 다음으로 SCE-UA 알고리즘, 유전자 알고리즘 순이었다. 지역수렴 영역이 상대적으로 다른 함수보다 넓은 10 차원 Schwefel 함수에 대해서는 DDS 알고리즘으로 구한 최적해가 전역최적해와 거의 근접하였고 유전자 알고리즘과 SCE-UA 알고리즘은 매우 큰 편차를 보였다. 40, 80 차원 Schwefel 함수에 대해서는 3 가지 알고리즘 모두 전역최적해와 편차를 보였지만 DDS 알고리즘에 의한 최적해와 다른 두 알고리즘에 의한 최적해는 1 오더(order) 정도의 차이가 났다. 지역수렴 영역이 큰 Michalewicz 함수와 Schwefel 함수에 대한 결과는 매우 흡사한 결과이다. 이상과 같은 결과로, 유전자 알고리즘은 매개변수의 수가 적을 경우 우수한 탐색성능을 가졌으며, SCE-UA 알고리즘은 Griewank, Rastrigin 함수와 같은 형태인 경우 우수한 성능을 보였다. DDS 알고리즘은 전체적으로 우수한 탐색 능력을 가진 것으로 판단된다. 그러므로 수위구간 영역별 저수지운영률 도출을 위한 적절한 최적화방법으로 DDS 알고리즘을 선정하였다.

  • PDF

Evaluating and Comparing the Search & Discovery Features: Focusing on the Public Libraries OPACs and the Internet Bookstores (탐색과 디스커버리 기능 평가 연구 - 공공도서관 OPAC과 인터넷 서점을 중심으로 -)

  • Han, Seunghee
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.50 no.1
    • /
    • pp.493-511
    • /
    • 2016
  • Discovery is an emerging concept to enhance the search capabilities of library resources with the Next Generation Library Catalog. This paper defined the Discovery feature based on the information search behavior, and then derived the elements that make up its function. After that, the 11 regional representatives libraries' OPACs and 3 Internet bookstores are evaluated and compared against Search & Discovery capabilities. As a result, the Internet bookstores were superior to the libraries' OPACs for all the elements that make up the Discovery functions. This study verified that the public libraries OPACs are still concentrating on known item search, and it is hard for the users to meet a serendipity which is gained through the Discovery functions.

Fast Motion Estimation Using Local Statistics of Neighboring Motion Vectors (인접 블록 움직임 벡터의 지역적 통계 특성을 이용한 고속 움직임 추정 기법)

  • Kim, Ki-Beom;Jeong, Chan-Young;Hong, Min-Cheol
    • Journal of Broadcast Engineering
    • /
    • v.13 no.1
    • /
    • pp.128-136
    • /
    • 2008
  • In this paper, we propose a variable step search fast motion estimation algorithm using local statistics of neighboring motion vectors. Using the degree of correlation between neighboring motion vectors, motion search range is adaptively adjusted to reduce unnecessary search points. Based on the adjusted search range, motion vector is obtained by variable search step. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast full spiral search motion estimation and other fast motion estimation.

Transport Infrastructure Investment and Its Impacts on Rural Development : Exploratory Analysis for Policy Evaluation (교통 인프라 투자와 농촌지역 발전에 미치는 영향 - 정책평가를 위한 탐색적 분석 -)

  • Lee, Wonho
    • Journal of the Korean association of regional geographers
    • /
    • v.21 no.3
    • /
    • pp.503-514
    • /
    • 2015
  • This study aims to analyze the relationship between transport infrastructure investment and rural development in Korea in a more systematic and empirical way. To do so, we formulate research framework to examine the multi-faceted relationship through extensive literature review and carry out a descriptive study on the spatial patterns of road investment and rural development in Korea. Finally, using the structural equation model, this study carries out the exploratory empirical analysis on the direct and indirect relationship between transport infrastructure investment and rural development. The study finds that the transport infrastructure investment in rural Korea impacts clearly on both the population base promotion and production and income growth through better accessibility. In addition, the investment has an indirect effects on the production and income growth through its influence on the population base promotion. This implies that the transport infrastructure investment in rural Korea so far exerts both long-term and short-term influences on rural development through various channels of impacts.

  • PDF

Assessment of Landslide Susceptibility in Jecheon Using Deep Learning Based on Exploratory Data Analysis (데이터 탐색을 활용한 딥러닝 기반 제천 지역 산사태 취약성 분석)

  • Sang-A Ahn;Jung-Hyun Lee;Hyuck-Jin Park
    • The Journal of Engineering Geology
    • /
    • v.33 no.4
    • /
    • pp.673-687
    • /
    • 2023
  • Exploratory data analysis is the process of observing and understanding data collected from various sources to identify their distributions and correlations through their structures and characterization. This process can be used to identify correlations among conditioning factors and select the most effective factors for analysis. This can help the assessment of landslide susceptibility, because landslides are usually triggered by multiple factors, and the impacts of these factors vary by region. This study compared two stages of exploratory data analysis to examine the impact of the data exploration procedure on the landslide prediction model's performance with respect to factor selection. Deep-learning-based landslide susceptibility analysis used either a combinations of selected factors or all 23 factors. During the data exploration phase, we used a Pearson correlation coefficient heat map and a histogram of random forest feature importance. We then assessed the accuracy of our deep-learning-based analysis of landslide susceptibility using a confusion matrix. Finally, a landslide susceptibility map was generated using the landslide susceptibility index derived from the proposed analysis. The analysis revealed that using all 23 factors resulted in low accuracy (55.90%), but using the 13 factors selected in one step of exploration improved the accuracy to 81.25%. This was further improved to 92.80% using only the nine conditioning factors selected during both steps of the data exploration. Therefore, exploratory data analysis selected the conditioning factors most suitable for landslide susceptibility analysis and thereby improving the performance of the analysis.

Potential Allelic Association of Microsatellite Markers on Chromosome 1 with Economic Traits in Korean Native Chicken (한국재래닭 1번 염색체내 초위성체 유전표지를 이용한 경제형질 연관 지역 탐색)

  • Kim, H.K.;Oh, J.D.;Kang, B.S.;Park, M.N.;Chae, E.J.;Jung, H.M.;Seo, O.S.;Choe, H.S.;Jeon, G.J.;Lee, H.K.;Kong, H.S.
    • Korean Journal of Poultry Science
    • /
    • v.35 no.2
    • /
    • pp.163-169
    • /
    • 2008
  • A total of 17 polymorphic microsatellite markers on chromosome 1 were used for allelic association tests with phenotypic traits in Korean native chicken. Chi-square tests were performed to compare the frequencies of individual alleles between the high and the low trait groups. The frequency of allele 123 of MCW0160 showed a significant difference between the high and the low groups in the trait of egg weight (EW). Three markers, namely ADL0234, UMA1.125 and ADL0101, were found to show significant differences in allelic distribution for the trait of the first lay day (FLD). UMA1.117, ADL0020, UMA 1.019, LMA1 and ADL0238 were found to show significant differences in allelic distribution for the trait of body weight (BW). ADL0101 and ADL0238 were found to show significant differences in allelic distribution for the trait of number of egg production(EP). In this study, we identified the QTL for economic traits at around 94 (MCW0160), 151 (ADL0234), 170 (UMA1.125), 225 (UMA1.117), 285 (ADL0020), 387 (UMA1.019), 418 (LMA1), 500 (ADL0101) and 520 (ADL0238) cM on chromosome 1 in Korean native chicken. The results provided a useful guideline for identification of positional candidate gene and marker-assisted selection for economic traits in Korean native chicken.