• The Journal of the Acoustical Society of Korea
• /
• v.30 no.3
• /
• pp.129-135
• /
• 2011

An algorithm is presented for estimating the 3-D location (i.e., azimuth angle, elevation angle, and range) of multiple sources with a uniform circular array (UCA) consisting of an even number of sensors. Recently the rank reduction (RARE) algorithm for partly-calibrated sensor arrays was developed. This algorithm is applicable to sensor arrays consisting of several identically oriented and calibrated linear subarrays. Assuming that a UCA consists of M sensors, it can be divided into M/2 identical linear subarrays composed of two facing sensors. Based on the structure of the subarrays, the steering vectors are decomposed into two parts: range-independent 2-D direction-of-arrival (DOA) parameters, and range-relevant 3-D location parameters. Using this property we can estimate range-independent 2-D DOAs by using the RARE algorithm. Once the 2-D DOAs are available, range estimation can be obtained for each source by defining the 1-D MUSIC spectrum. Despite its low computational complexity, the proposed algorithm can provide an estimation performance almost comparable to that of the 3-D MUSIC benchmark estimator.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.55-72
• /
• 2010

Recently, the battlefield environment has changed from platform-centric warfare(PCW) which focuses on maneuvering forces into network-centric warfare(NCW) which is based on the connectivity of each asset through the warfare information system as information technology increases. In particular, C4I(Command, Control, Communication, Computer and Intelligence) system can be an important factor in achieving NCW. It is generally used to provide direction across distributed forces and status feedback from thoseforces. It can provide the important information, more quickly and in the correct format to the friendly units. And it can achieve the information superiority through SA(Situational Awareness). Most of the advanced countries have been developed and already applied these systems in military operations. Therefore, ROK forces also have been developing C4I systems such as KJCCS(Korea Joint Command Control System). And, ours are increasing the budgets in the establishment of warfare information systems. However, it is difficult to evaluate the C4I effectiveness properly by deficiency of methods. We need to develop a new combat effectiveness evaluation method that is suitable for NCW. Existing evaluation methods lay disproportionate emphasis on technical factors with leaving something to be desired in human factors. Therefore, it is necessary to consider technical and human factors to evaluate combat effectiveness. In this study, we proposed a new Combat Effectiveness evaluation algorithm called E-TechMan(A Combat Effectiveness Evaluation Algorithm Considering Technical and Human Factors in C4I System). This algorithm uses the rule of Newton's second law($F=(m{\Delta}{\upsilon})/{\Delta}t{\Rightarrow}\frac{V{\upsilon}I}{T}{\times}C$). Five factors considered in combat effectiveness evaluation are network power(M), movement velocity(v), information accuracy(I), command and control time(T) and collaboration level(C). Previous researches did not consider the value of the node and arc in evaluating the network power after the C4I system has been established. In addition, collaboration level which could be a major factor in combat effectiveness was not considered. E-TechMan algorithm is applied to JFOS-K(Joint Fire Operating System-Korea) system that can connect KJCCS of Korea armed forces with JADOCS(Joint Automated Deep Operations Coordination System) of U.S. armed forces and achieve sensor to shooter system in real time in JCS(Joint Chiefs of Staff) level. We compared the result of evaluation of Combat Effectiveness by E-TechMan with those by other algorithms(e.g., C2 Theory, Newton's second Law). We can evaluate combat effectiveness more effectively and substantially by E-TechMan algorithm. This study is meaningful because we improved the description level of reality in calculation of combat effectiveness in C4I system. Part 2 will describe the changes of war paradigm and the previous combat effectiveness evaluation methods such as C2 theory while Part 3 will explain E-TechMan algorithm specifically. Part 4 will present the application to JFOS-K and analyze the result with other algorithms. Part 5 is the conclusions provided in the final part.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.5
• /
• pp.73-82
• /
• 1996

In this paper, an efficient algorithm for recognizing and positioning occuluded objects in a two-dimensional plane is presented. Model objects and unknown input image are approximated by polygonal boundaries, which are compactly represented by shape functions of the polygons. The input image is partitioned into measningful segments whose end points are at the locations of possible occlusion - i.e. at concave vertices. Each segment is matched against known model objects by calculating a matching measure, which is defined as the minimum euclidean distance between the shape functions. An O(mm(n+m) algorithm for computing the measure is presentd, where n and m are the number of veritces for a model and an unknown object, respectively. Match results from aprtial segments are combined based on mutual compatibility, then are verified using distance transformation and translation vector to produce the final recognition. The proposed algorithm is invariant under translation and rotation of objects, which has been shown by experimental results.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.229-236
• /
• 2016

Theta join is one of the essential and important types of queries in database systems. As the amount of data needs to be processed increases, processing theta joins with a single machine becomes impractical. Therefore, theta join algorithms using distributed computing frameworks have been studied widely. Although one of the state-of-the-art theta-join algorithms uses M-Bucket-I heuristic, it is hard to use since running time of M-Bucket-I heuristic, which computes a mapping from a record to a reducer (i.e., reducer mapping), is O(n) where n is the size of input data. In this paper, we propose MBI-I algorithm which reduces the running time of M-Bucket-I heuristic to $O(r_{max}log\;n)$ and gives the same result as M-Bucket-I heuristic does. We also conducted several experiments to show algorithm and confirmed that our algorithm can improve the performance of a theta join by 10%.

• Structural Engineering and Mechanics
• /
• v.20 no.3
• /
• pp.279-292
• /
• 2005

In this study, element loading matrices are defined for static application of classical M$\ddot{u}$ller-Breslau principle to finite element method. The loading matrices are derived from existing element matrices using Betti's law and known governing equations of F.E.M. Thus, the ordinates of influence lines and influence surfaces may be easily obtained from structural analysis for the loading matrices derived from governing equations, instead of through introduced unit force or displacement techniques. An algorithm for a computer program and comparative numerical examples are also presented to illustrate the procedure for determination of influence line and surface ordinates.

• Current Optics and Photonics
• /
• v.3 no.5
• /
• pp.466-472
• /
• 2019

A system for continuous-wave coherent Doppler lidar (CW lidar), made up of all-fiber structures and a coaxial transmission telescope, was set up for wind measurement in Hefei (31.84 N, 117.27 E), Anhui province of China. The lidar uses a fiber laser as a light source at a wavelength of $1.55{\mu}m$, and focuses the laser beam on a location 80 m away from the telescope. Using the CW lidar, radial wind measurement was carried out. Subsequently, the spectra of the atmospheric backscattered signal were analyzed. We tested the noise and obtained the lower limit of wind velocity as 0.721 m/s, through the Rayleigh criterion. According to the number of Doppler peaks in the radial wind spectrum, a classification retrieval algorithm (CRA) combining a Gaussian fitting algorithm and a spectral centroid algorithm is designed to estimate wind velocity. Compared to calibrated pulsed coherent wind lidar, the correlation coefficient for the wind velocity is 0.979, with a standard deviation of 0.103 m/s. The results show that CW lidar offers satisfactory performance and the potential for application in wind measurement.

• Journal of Advanced Navigation Technology
• /
• v.10 no.2
• /
• pp.95-102
• /
• 2006

In this paper, we model a traffic of multiple tags operated in 2.45GHz band RTLS environment and analyze the multi-tag interference. Also, we propose a high precision location estimation algorithm of RTLS and then analyze its performance. From the results, the BER performance of RTLS degrades as the number of multi-tags increase in Gaussian noise and fading(m=15) environment. To meet the BER specification of RTLS, $10^{-5}$, we have to limit the multi-tag number to below 40. We also estimate the tag's location in $250m{\times}250m$ searching-area with enhanced TDOA scheme. It is confirmed that the 3m radius within accuracy of RTLS specification is satisfied, if the number of sub-blink receives more than 2 when available reader is 3 to 8.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.661-668
• /
• 2009

The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver's auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.403-426
• /
• 1998

We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.

• ETRI Journal
• /
• v.44 no.3
• /
• pp.400-412
• /
• 2022

In cognitive radio networks (CRNs), the computational complexity of resource allocation algorithms is a significant problem that must be addressed. However, the high computational complexity of the optimal solution for tackling resource allocation in CRNs makes it inappropriate for use in practical applications. Therefore, this study proposes a power-based pricing algorithm (PPA) primarily to reduce the computational complexity in downlink CRN scenarios while restricting the interference to primary users to permissible levels. A two-stage approach reduces the computational complexity of the proposed mathematical model. Stage 1 assigns subcarriers to the CRN's users, while the utility function in Stage 2 incorporates a pricing method to provide a power algorithm with enhanced reliability. The PPA's performance is simulated and tested for orthogonal frequency-division multiplexing-based CRNs. The results confirm that the proposed algorithm's performance is close to that of the optimal algorithm, albeit with lower computational complexity of O(M log(M)).