• Title/Summary/Keyword: 5-neighbor

Search Result 449, Processing Time 0.025 seconds

Optimal Solution of a Large-scale Travelling Salesman Problem applying DNN and k-opt (DNN과 k-opt를 적용한 대규모 외판원 문제의 최적 해법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.249-257
    • /
    • 2015
  • This paper introduces a heuristic algorithm to NP-hard travelling salesman problem. The proposed algorithm, in its bid to determine initial path, applies SW-DNN, DW-DNN, and DC-DNN, which are modified forms of the prevalent Double-sided Nearest Neighbor Search and searches the minimum value. As a part of its optimization process on the initial solution, it employs 2, 2.5, 3-opt of a local search k-opt on candidate delete edges and 4-opt on undeleted ones among them. When tested on TSP-1 of 26 European cities and TSP-2 of 49 U.S. cities, the proposed algorithm has successfully obtained optimal results in both, disproving the prevalent disbelief in the attainability of the optimal solution and making itself available as a general algorithm for the travelling salesman problem.

Effect of Random Node Distribution on the Throughput in Infrastructure-Supported Erasure Networks (인프라구조 도움을 받는 소거 네트워크에서 용량에 대한 랜덤 노드 분포의 효과)

  • Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.911-916
    • /
    • 2016
  • The nearest-neighbor multihop routing with/without infrastructure support is known to achieve the optimal capacity scaling in a large packet-erasure network in which multiple wireless nodes and relay stations are regularly placed and packets are erased with a certain probability. In this paper, a throughput scaling law is shown for an infrastructure-supported erasure network where wireless nodes are randomly distributed, which is a more feasible scenario. We use an exponential decay model to suitably model an erasure probability. To achieve high throughput in hybrid random erasure networks, the multihop routing via highway using the percolation theory is proposed and the corresponding throughput scaling is derived. As a main result, the proposed percolation highway based routing scheme achieves the same throughput scaling as the nearest-neighbor multihop case in hybrid regular erasure networks. That is, it is shown that no performance loss occurs even when nodes are randomly distributed.

Local Information-based Betweenness Centrality to Identify Important Nodes in Social Networks (사회관계망에서 중요 노드 식별을 위한 지역정보 기반 매개 중심도)

  • Shon, Jin Gon;Kim, Yong-Hwan;Han, Youn-Hee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.5
    • /
    • pp.209-216
    • /
    • 2013
  • In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes in terms of message delivery. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In this paper, we define a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also define a new measure, called the expended ego betweenness centrality. Through the intensive experiment with Barab$\acute{a}$si-Albert network model to generate the scale-free networks which most social networks have as their embedded feature, we also show that the nodes' importance rank based on the expanded ego betweenness centrality has high similarity with that based on the traditional betweenness centrality.

Genetic Relationships among the Poplars of Section Leuce (Genus Populus) revealed by RAPD Marker Analysis (RAPD 표식자(標識者) 분석(分析)에 의한 사시나무속(屬) Leuce절(節) 포플러의 유연관계(類緣關係))

  • Hong, Kyung-Nak;Hyun, Jung Oh;Hong, Yong Pyo
    • Journal of Korean Society of Forest Science
    • /
    • v.87 no.2
    • /
    • pp.153-163
    • /
    • 1998
  • Genetic relationships of some poplars in the section Leuce, including 5 species and 11 clones of Populus alba${\times}$glandulosa, were investigated on the basis of RAPD marker analysis. Twenty-two of the 88 arbitrary 10-mer primers, showed reproducible amplification in the preliminary experiment with 6 samples, were used for PCR and generated a total of 181 RAPD markers. Genetic relationships among the analyzed samples were tested by two phenetic methods of the UPGMA and the neighbor-joining, which revealed the close genetic relationship between P. glandulosa and P. alba. And the close genetic relationship between P. glandulosa and P. davidiana was ascertained by the principal component analysis. Based on the observation of the close genetic relationship between them, it was deduced that P. glandulosa might be originated by the saltational speciation caused by the hybridization between P. alba and P. davidiana in nature.

  • PDF

Molecular Phylogeny of Veneridae (Bivalvia: Heteroconchia) on the Basis of Partial Sequences of Mitochondrial Cytochrome Oxidase 1 (백합 과 패류의 mtCOI 일부 염기서열을 이용한 계통분류)

  • Kim, Jae-Jin;Kim, Sei-Chang;Hong, Hyun-Chul
    • The Korean Journal of Malacology
    • /
    • v.20 no.2
    • /
    • pp.171-181
    • /
    • 2004
  • Partial sequences of the mitochondrial cytochrome oxidase subunit Ⅰ(mtCOI) gene of veneroid clams were obtained to eluciadate molecular phylogeny. A total of nine veneroids and one corbiculid were collected from southern and western sea of Korea. The mtCOI sequences of the clams obtained from the present study and three veneroids sequences from GenBank were analyzed by maximum parsimony and neighbor-joining methods. The subfamilies Samarangiinae, Dorsiniinae, Cyclinae, Meretricinae and Chioninae were monophyletic, but Pitarinae was paraphyletic. One transitions and two transversions among two samples of Ruditapes philippinarum and a R. variegata were observed.

  • PDF

Onion yield estimation using spatial panel regression model (공간 패널 회귀모형을 이용한 양파 생산량 추정)

  • Choi, Sungchun;Baek, Jangsun
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.5
    • /
    • pp.873-885
    • /
    • 2016
  • Onions are grown in a few specific regions of Korea that depend on the climate and the regional characteristic of the production area. Therefore, when onion yields are to be estimated, it is reasonable to use a statistical model in which both the climate and the region are considered simultaneously. In this paper, using a spatial panel regression model, we predicted onion yields with the different weather conditions of the regions. We used the spatial auto regressive (SAR) model that reflects the spatial lag, and panel data of several climate variables for 13 main onion production areas from 2006 to 2015. The spatial weight matrix was considered for the model by the threshold value method and the nearest neighbor method, respectively. Autocorrelation was detected to be significant for the best fitted model using the nearest neighbor method. The random effects model was chosen by the Hausman test, and the significant climate variables of the model were the cumulative duration time of sunshine (January), the average relative humidity (April), the average minimum temperature (June), and the cumulative precipitation (November).

Estimation of Aboveground Biomass Carbon Stock Using Landsat TM and Ratio Images - $k$NN algorithm and Regression Model Priority (Landsat TM 위성영상과 비율영상을 적용한 지상부 탄소 저장량 추정 - $k$NN 알고리즘 및 회귀 모델을 중점적으로)

  • Yoo, Su-Hong;Heo, Joon;Jung, Jae-Hoon;Han, Soo-Hee;Kim, Kyoung-Min
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.19 no.2
    • /
    • pp.39-48
    • /
    • 2011
  • Global warming causes the climate change and makes severe damage to ecosystem and civilization Carbon dioxide greatly contributes to global warming, thus many studies have been conducted to estimate the forest biomass carbon stock as an important carbon storage. However, more studies are required for the selection and use of technique and remotely sensed data suitable for the carbon stock estimation in Korea In this study, the aboveground forest biomass carbon stocks of Danyang-Gun in South Korea was estimated using $k$NN($k$-Nearest Neighbor) algorithm and regression model, then the results were compared. The Landsat TM and 5th NFI(National Forest Inventory) data were prepared, and ratio images, which are effective in topographic effect correction and distinction of forest biomass, were also used. Consequently, it was found that $k$NN algorithm was better than regression model to estimate the forest carbon stocks in Danyang-Gun, and there was no significant improvement in terms of accuracy for the use of ratio images.

Estimation of Aboveground Biomass Carbon Stock in Danyang Area using kNN Algorithm and Landsat TM Seasonal Satellite Images (kNN 알고리즘과 계절별 Landsat TM 위성영상을 이용한 단양군 지역의 지상부 바이오매스 탄소저장량 추정)

  • Jung, Jae-Hoon;Heo, Joon;Yoo, Su-Hong;Kim, Kyung-Min;Lee, Jung-Bin
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.18 no.4
    • /
    • pp.119-129
    • /
    • 2010
  • The joint use of remotely sensed data and field measurements has been widely used to estimate aboveground carbon stock in many countries. Recently, Korea Forest Research Institute has developed new carbon emission factors for kind of tree, thus more accurate estimate is possible. In this study, the aboveground carbon stock of Danyang area in South Korea was estimated using k-Nearest Neighbor(kNN) algorithm with the 5th National Forest Inventory(NFI) data. Considering the spectral response of forested area under the climate condition in Korea peninsular which has 4 distinct seasons, Landsat TM seasonal satellite images were collected. As a result, the estimated total carbon stock of Danyang area was ranged from 3542768.49tonC to 3329037.51tonC but seasonal trends were not found.

Distance Browsing Query Processing using Query Result Set (질의 결과를 이용한 거리 브라우징 질의의 처리)

  • Park Dong-Joo;Park Sangwon;Chung Tae-Sun;Lee Sang-Won
    • The KIPS Transactions:PartD
    • /
    • v.12D no.5 s.101
    • /
    • pp.673-682
    • /
    • 2005
  • Distance browsing queries, namely k-nearest neighbor queries, are the most important queries in spatial database applications, e.g., Geographic Information Systems(GISs). Recently, GIS applications trends to extend themselves toward wide multi-user environments such as the Web. Since many techniques for such queries, where Hjaltason and Samet's algorithm is the most efficient one, were optimized for only one query, we need to complement them suitable for multi-user environments. It can be a good approach that we store many individual query results in a cache, i.e., query result caching and reuse them in evaluating incoming queries, j.e., query result matching. In this paper, we propose a complementary Hjaltason and Samet's algerian capable of reusing previous query results in a cache for answering distance browsing queries in multi-user GIS environments. Our experimental results conform the efficiency of our approach.

Analysis of Automatic Neighbor Relation Technology in Self Organization Networks of LTE (LTE 네트워크에서 SON ANR 기술 분석)

  • Ahn, Ho-Jun;Yang, Mo-Chan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.893-900
    • /
    • 2019
  • This paper deals with the analysis of SON (Self Organization Network) technology in LTE networks. SON is a unique LTE feature compared to previous cellular systems UMTS and GSM, and is a cost-effective tool for achieving the best performance in a changing environment. In addition, SON has the function of automating the settings of the network, enabling centralized planning and reducing the need for manual tasks. SON is largely divided into three categories: Self-Configuration, Self-Optimization, and Self-Healing. Each large category has a detailed description, and all the technologies in each category come together to complete the technology called SON. In this paper, we analyzed intensively about ANR among the techniques of Self-Configuration in each of the three categories.