• Journal of the Korea Institute of Military Science and Technology
• /
• v.26 no.5
• /
• pp.384-391
• /
• 2023

In modern electronic warfare, a number of radar emitters are in operation, causing radar receivers to receive high-density signal pulses that occur simultaneously. To analyze the radar signals more accurately and identify enemies, the sorting process of high-density radar signals is very important before analysis. Recently, machine learning algorithms, specifically K-means clustering, are the subject of research aimed at improving the accuracy of radar signal sorting. One of the challenges faced by these studies is that the clustering results can vary depending on how the initial points are selected and how many clusters number are set. This paper introduces a repeated K-means clustering algorithm that aims to accurately cluster all data by identifying and addressing false clusters in the radar sorting problem. To verify the performance of the proposed algorithm, experiments are conducted by applying it to simulated signals that are generated by a signal generator.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.65-71
• /
• 2012

An OS-CFAR (Ordered Statistics CFAR) based on a sorting algorithm is useful for automotive radar systems in a multi-target situation. However, while the typical cell-averaging CFAR has low computational complexity, the OS-CFAR has much higher computation effort. In this paper, we design the new OS-CFAR architecture with a low computational effort. In the proposed method, since one time sorting processing is performed for the decision of the CFAR threshold, the whole processing effort can be reduced. When the fast sorting technique is employed, the computing time of the proposed OS-CFAR is always much shorter compared with typical OS-CFAR method regardless of the data size. We also present the processing result of proposed architecture using the real radar data.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2009.04a
• /
• pp.513-516
• /
• 2009

본 논문에서는 사례연구를 통하여 RC구조 BIM에서의 물량정보 획득의 효율성을 분석하고 이를 기반으로 BIM 프로세스 환경에서의 철근 및 콘크리트 물량산출을 위한 데이터베이스를 구축하여 현장 시공단계에서의 공정 및 물량관리의 협업단계를 가능하도록 하는 철근 Sorting 시스템에 대한 연구를 목적으로 한다. 기존의 건설, 건축분야에서의 정보는 기호적 언어와 2차원 기반의 도면 정보체계를 통해 표현되었지만, BIM 기술을 통해 건물의 실제 형상과 정보를 가지는 3차원 기반의 정보체계로의 변화와 함께 컴퓨터 데이터베이스 내에서 프로젝트에 포함된 모든 정보를 저장하고, 다양한 형태로 필요에 따라 정보를 표현할 수 있게 변화하고 있다. 견적 및 시공을 위한 RC구조설계단계에서의 배근 모델은 협업을 위한 객체 정보의 획득 및 추출이 중요하지만 현재 상용되고 있는 BIM도구에서는 현재까지 미흡한 체계를 이루고 있다. 본 논문에서는 구조설계를 기반으로 배근된 BIM 구조모델 사례를 통하여 기존 BIM도구에서의 물량 정보획득 효율성 분석을 기반으로 객체들의 데이터베이스 구축을 통한 철근 Sorting 시스템 구축 연구를 통하여 협업단계에서의 체계적 물량정보 관리를 가능하도록 하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1E
• /
• pp.14-21
• /
• 1995

This paper presents a parallel sorting algorithm suitable for the SIMD multiprocessor. The algorithm finds pivots for partitioning the data into ordered subsets. The data can be evenly distributed to be sorted since it uses the probability theory. For n data elements to be sorted on p processors, when $n{\geq}p^2$, the algorithm is shown to be asymptotically optimal. In practice, sorting 8 million data items on 64 processors achieved a 48.43-fold speedup, while the PSRS required a 44.4-fold speedup. On a variety of shared and distributed memory machines, the algorithm achieved better than half-linear speedups.

• Journal of the Korean Society of Visualization
• /
• v.15 no.2
• /
• pp.41-47
• /
• 2017

Microring/nanoring structure has high applicability for nano-antenna and biosensor thanks to its superior optical characteristics. Although coiling nanowires manufactured using immiscible emulsion droplets have an advantage in mass production, this process also forms nanowire bundles. In this study, we solved the nanowire bundle problem by size-selective sorting of the emulsion droplets in a pinched flow fractionation microchannel. Utilizing silver nanowires and immiscible emsulsion droplets, we investigated the correlation between the size of ring droplets and bundle droplet. We visualized the sorting process for glass particles and microring-containing emulsion droplets. Droplets were sorted based on their size, and the ratio of bundle droplets in solution decreased. This droplet-sorting strategy has potential to help the printing and coating process for manufacturing of ring structure patterns and developing of functional materials.

• BMB Reports
• /
• v.37 no.3
• /
• pp.362-369
• /
• 2004

The human folate receptor (hFR) is a glycosylphosphatidylinositol (GPI) linked plasma membrane protein that mediates delivery of folates into cells. We studied the sorting of the hFR using transfection of the hFR cDNA into MDCK cells. MDCK cells are polarized epithelial cells that preferentially sort GPI-linked proteins to their apical membrane. Unlike other GPI-tailed proteins, we found that in MDCK cells, hFR is functional on both the apical and basolateral surfaces. We verified that the same hFR cDNA that transfected into CHO cells produces the hFR protein that is GPI-linked. We also measured the hFR expression on the plasma membrane of type III paroxysmal nocturnal hemoglobinuria (PNH) human erythrocytes. PNH is a disease that is characterized by the inability of cells to express membrane proteins requiring a GPI anchor. Despite this defect, and different from other GPI-tailed proteins, we found similar levels of hFR in normal and type III PNH human erythrocytes. The results suggest the hypothesis that there may be multiple mechanisms for targeting hFR to the plasma membrane.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.68-72
• /
• 2009

The suffix array is a data structure storing all suffixes of a string in lexicographical order. It is widely used in string problems instead of the suffix tree, which uses a large amount of memory space. Many researches have shown that not only the suffix array can be built in O(n), but also it can be constructed with a small time and space usage for real-world inputs. In this paper, we analyze a practical suffix sorting algorithm due to Maniscalco and Puglisi [1], and we propose an efficient algorithm which improves Maniscalco-Puglisi's running time.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.25 no.5
• /
• pp.329-336
• /
• 2015

This paper presents a sorting method of mode vectors and natural frequencies about a rotor-journal bearing system. The rotor is solved by the finite element method, the bearing stiffness and damping coefficient are solved by the finite difference method. At any rotation speed section through the eigenvalue analysis of the system, mode vectors and natural frequencies not sorted are confirmed via the Campbell diagram and the MAC(modal assurance criterion). To sort mode vectors and natural frequencies of the section, a mode sorting method is presented through a method of rearranging the MAC of the mode vectors. Finally, the mode vectors and the natural frequencies are sorted by using the presented method, these are verified through the MAC.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.6
• /
• pp.3023-3031
• /
• 2013

In this paper, we propose a robot control data generation system applying context aware mechanism in order to control the robot manipulator which automatically sorts parcels. The context aware mechanism generates intelligent information to control a robot using context data such as the parcel shape, weight, location and barcodes. The proposed system collects context data of the parcel and generates robot control data to pick up and drop parcels. Then a robot manipulator, which receives control data of picking-up and dropping, processes the automated sorting of parcels according to delivery persons and delivery routes. It will contribute not only to save much time and cost but also to reduce the industrial accidents.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.1
• /
• pp.70-78
• /
• 2010

Elitist nondominated sorting genetic algorithm (NSGA-II) is adopted and improved for multiobjective optimal reactive power flow (ORPF) problem. Multiobjective ORPF, formulated as a multiobjective mixed integer nonlinear optimization problem, minimizes real power loss and improves voltage profile of power grid by determining reactive power control variables. NSGA-II-based ORPF is tested on standard IEEE 30-bus test system and compared with four other state-of-the-art multiobjective evolutionary algorithms (MOEAs). Pareto front and outer solutions achieved by the five MOEAs are analyzed and compared. NSGA-II obtains the best control strategy for ORPF, but it suffers from the lower convergence speed at the early stage of the optimization. Several problem-specific local search strategies (LSSs) are incorporated into NSGA-II to promote algorithm's exploiting capability and then to speed up its convergence. This enhanced version of NSGA-II (ENSGA) is examined on IEEE 30 system. Experimental results show that the use of LSSs clearly improved the performance of NSGA-II. ENSGA shows the best search efficiency and is proved to be one of the efficient potential candidates in solving reactive power optimization in the real-time operation systems.