Effective One-to-One Correspondence Method of O(N2 Log(N)) Complexity between Distributed Units

被引：0

作者：

Park, Sanghyuk ^{[2
]}

Kim, Jai-Hoon ^{[1
]}

Han, Chang-Hee ^{[3
]}

Kim, Kangseok ^{[4
]}

机构：

[1] Ajou Univ, Grad Sch Informat & Commun, Suwon 441749, South Korea

[2] Ajou Univ, Dept Network Centr Warfare Engn, Suwon 441749, South Korea

[3] Korea Mil Acad, Dept Comp Sci, Seoul, South Korea

[4] Ajou Univ, Grad Sch, Dept Knowledge Informat Secur, Suwon 441749, South Korea

来源：

INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS | 2012年 / 9卷

基金：

新加坡国家研究基金会;

关键词：

NCO (Network-Centric Operation); WTAP (Weapon Target Assignment Problem); BE (Battle Effects); SD (Standard deviation); MV (Maximum Value);

D O I：

10.5772/50913

中图分类号：

TP24 [机器人技术];

学科分类号：

080202 ; 1405 ;

摘要：

Recently, NCO (Network Centric Operation) has been intensively studied. The new concept provides many benefits by sharing information among distributed militaries linked by network. Based on these, we propose a novel correspondence algorithm of O(N(2)Log(N)) complexity while maintaining comparable BE (Battle Effects) with the optimal algorithm. We verify the efficiency of our algorithm in terms of complexity and BE by simulation and experiment. The results show that our algorithm improves BE up to 40% comparing to conventional random correspondence methods. Also, our algorithm speeds up by several orders comparing to the optimal algorithm while sacrificing BE only 6%.

引用

页数：7

共 50 条

[41] A New O (n2 log n) Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints
Schutt, Andreas
Wolf, Armin
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP 2010, 2010, 6308 : 445 - +
[42] A direct solver with O(N) complexity for integral equations on one-dimensional domains
Adrianna Gillman
Patrick M. Young
Per-Gunnar Martinsson
Frontiers of Mathematics in China, 2012, 7 : 217 - 247
[43] A direct solver with O(N) complexity for integral equations on one-dimensional domains
Gillman, Adrianna
Young, Patrick M.
Martinsson, Per-Gunnar
FRONTIERS OF MATHEMATICS IN CHINA, 2012, 7 (02) : 217 - 247
[44] Dissociation cross sections for N2 + N → 3N and O2 + O → 3O using the QCT method
Mankodi, Tapan K.
Bhandarkar, Upendra V.
Puranik, Bhalchandra P.
JOURNAL OF CHEMICAL PHYSICS, 2017, 146 (20):
[45] Uniformly distributed seeds for randomized trace estimator on O(N2)-operation log-det approximation in Gaussian process regression
Zhang, Yunong
PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, 2006, : 498 - 503
[46] n-dimensional observables on k-perfect MV-algebras and k-perfect effect algebras. II. One-to-one correspondence
Dvurecenskij, Anatolij
Lachman, Dominik
FUZZY SETS AND SYSTEMS, 2022, 442 : 17 - 42
[47] Extreme divergence between one-to-one orthologs: the structure of N15 Cro bound to operator DNA and its relationship to the λ Cro complex
Hall, Branwen M.
Roberts, Sue A.
Cordes, Matthew H. J.
NUCLEIC ACIDS RESEARCH, 2019, 47 (13) : 7118 - 7129
[48] MSXmin: A self-routing multicast ATM packet switch with O(log(2)N) delay and O(Nlog(2)N) hardware complexity
Kannan, R
Ray, S
GLOBECOM 97 - IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, CONFERENCE RECORD, VOLS 1-3, 1997, : 217 - 221
[49] Weighted scheduling algorithm with o(N2) complexity for input-buffered queue
Sun, Zhi-Gang
Su, Jin-Shu
Lu, Xi-Cheng
Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2002, 39 (05):
[50] Computing the quartet distance between evolutionary trees in time O(n log2 n)
Brodal, GS
Fagerberg, R
Pedersen, CNS
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 731 - 742

← 1 2 3 4 5 →