• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.271-286
• /
• 2011

In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net $RDN^k$(B) for k > 0 has $(2n_o)^{2K}/2$ nodes and $d_0$ + k links per node, where $n_0$ and $d_0$ are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of the algorithm for parallel prefix computation on $RDN^k$(B), k > 0, are $2^{k+1}-2+2^kT_{comm}(0)$ and $2^{k+1}-2+2^kT_{comp}(0)$, respectively, where $T_{comm}(0)$ and $T_{comp}(0)$ are the communication and computation time complexities of the algorithm for parallel prefix computation on the base-network B, respectively. The algorithm for parallel sorting on $RDN^k$(B) is restricted on B = $Q_m$ where $Q_m$ is an m-cube. Assume that each node holds a single data item, the sorting algorithm runs in $O((m2^k)^2)$ computation steps and $O((km2^k)^2)$ communication steps, respectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.1-5
• /
• 2010

정렬 알고리즘에서 사용한 원소 간 비교횟수를 기준으로, 비교횟수가 많게 되는 순열을 최악의 인스턴스(worst-case instance)라 명명하고 이를 찾기 위해 유전 알고리즘(genetic algorithm)을 사용하였다. 잘 알려진 퀵 정렬(quick sort), 머지 정렬(merge sort), 힙 정렬(heap sort), 삽입 정렬(insertion sort), 쉘 정렬(shell sort), 개선된 퀵 정렬(advanced quick sort)에 대해서 실험하였다. 머지 정렬과 삽입 정렬에 대해 탐색한 인스턴스는 최악의 인스턴스에 거의 근접하였다. 퀵 정렬은 크기가 증가함에 따라 최악의 인스턴스 탐색이 어려웠다. 나머지 정렬에 대해서 찾은 인스턴스는 최악의 인스턴스인지 이론적으로 보장할 수 없지만, 임의의 1,000개 순열을 정렬해서 얻은 비교횟수들의 평균치보다는 훨씬 높았다. 본 논문의 최악의 인스턴스를 탐색하는 시도는 알고리즘의 성능 검증을 위한 테스트 데이터를 생성한다는 점에서 의미가 크다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.1-4
• /
• 2011

본 논문에서는 병렬 정렬(sorting) 알고리즘들에 대하여 논의한다. 정렬 알고리즘은 컴퓨터 과학에서 매우 중요한 위치를 차지하며 지난 50~60년 동안 많은 연구자들에 의하여 연구되었다. 10년 전에는 GPU(Graphics Processing Unit) 병렬 프로세서가 개발되어 병렬 정렬 알고리즘에 대한 연구도 활발히 진행되고 있다. 병렬 정렬 알고리즘은 대체적으로 bitonic 정렬, radix 정렬, merge 정렬, 혹은 이들 정렬 알고리즘들을 혼합하여 사용한 방법으로 분류된다. 논문에서는 GPU를 사용한 새로운 효율적인 병렬 정렬 알고리즘의 설계 조건을 논의한다.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.99-102
• /
• 1997

A neural spike sorting technique has been developed that also has the capability of template learning. A system of software has been written that first obtains the templates by learning, and then performs the sorting of the spikes into single units. The spike sorting can be done in real time. The template learning consists of spike detection based on the discrete Haar transform (DHT), feature extraction by clustering of spike amplitude and duration, classification based on rms error, and fabrication of templates. The developed algorithms can be implemented into real time systems using digital signal processors.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.486-495
• /
• 2013

In this article, we suggest a two-dimensional genetic algorithm (GA) method that applies a cognitive radio (CR) decision engine which determines the optimal transmission parameters for multicarrier communication systems. Because a CR is capable of sensing the previous environmental communication information, CR decision engine plays the role of optimizing the individual transmission parameters. In order to obtain the allowable transmission power of multicarrier based CR system demands interference analysis a priori, for the sake of efficient optimization, a two-dimensionalGA structure is proposed in this paper which enhances the computational complexity. Combined with the fitness objective evaluation standard, we focus on two multi-objective optimization methods: The conventional GA applied with the multi-objective fitness approach and the non-dominated sorting GA with Pareto-optimal sorting fronts. After comparing the convergence performance of these algorithms, the transmission power of each subcarrier is proposed as non-interference emission with its optimal values in multicarrier based CR system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.400-403
• /
• 2022

This paper propose a GPU-based N-body collision detection algorithm using LBVH (Linear Bounding Volume Hierarchy) technique. This algorithm introduces a new modified Morton code scheme where the codes use an information about how much each body takes a space in the screen space. This scheme improves the GPU sorting performance of the N-Body because it culls out invisible objects in natural manner. Through the experiments, we verifies that the proposed algorithms can have at least 15% performance improvement over the existing methods

• Journal of Biosystems Engineering
• /
• v.32 no.2 s.121
• /
• pp.130-135
• /
• 2007

An on-line real time grading and sorting system for dried oak mushrooms was developed for on-site application. Quality grades of the mushrooms were determined according to an industrial specification. Three dimensional visual quality features were used for the grading. A progressive color computer vision system with white LED illumination was implemented to develop an algorithm to extract external quality patterns of the dried oak mushrooms. Cap (top) and gil (stem) surface images were acquired sequentially and side image was obtained using mirror. Algorithms for extracting size, roundness, pattern and color of the cap, thickness, color of the gil and amount of rolled edge of the dried mushroom were developed. Utilizing those quality factors normal and abnormal ones were classified and normal mushrooms were further classified into 30 different grades. The sorting device was developed using microprocessor controlled electro-pneumatic system with stainless buckets. Grading accuracy was around 97% and processing time was 0.4 s in average.

• Journal of The Korean Association of Information Education
• /
• v.20 no.2
• /
• pp.151-160
• /
• 2016

Algorithm education is emphasized as an instrument for teaching the basic principles of Computer Science. But these materials is very short-fall. We'll present the CS Unplugged-based algorithm contents, which is easy to learn for elementary student. These contents for self-directed learning consisted of the activity-based learning. For problem-solving algorithm learning in everyday life we were developed the hashing techniques on the basis of the basic searching and sorting algorithms. For checking the adequacy of these materials were tested by surveys of teacher professional groups, and we obtain the appropriate conclusions for sorting algorithm contents for improving the problem-solving ability for in elementary student.

• Journal of Computing Science and Engineering
• /
• v.7 no.3
• /
• pp.147-158
• /
• 2013

This invited paper introduces results on Web science and technology obtained during work with the Korea Advanced Institute of Science and Technology. In the first part, we discuss algorithms for exploring the deep Web, which refers to the collection of Web pages that cannot be reached by conventional Web crawlers. In the second part, we discuss sorting algorithms on the MapReduce system, which has become a dominant paradigm for massive parallel computing.

• Agricultural and Biosystems Engineering
• /
• v.4 no.1
• /
• pp.8-15
• /
• 2003

In Korea, quality evaluation of dried oak mushrooms are done first by classifying them into more than 10 different categories based on the state of opening of the cap, surface pattern, and colors. And mushrooms of each category are further classified into 3 or 4 groups based on its shape and size, resulting into total 30 to 40 different grades. Quality evaluation and sorting based on the external visual features are usually done manually. Since visual features of mushroom affecting quality grades are distributed over the entire surface of the mushroom, both front (cap) and back (stem and gill) surfaces should be inspected thoroughly. In fact, it is almost impossible for human to inspect every mushroom, especially when they are fed continuously via conveyor. In this paper, considering real time on-line system implementation, image processing algorithms utilizing artificial neural network have been developed for the quality grading of a mushroom. The neural network based image processing utilized the raw gray value image of fed mushrooms captured by the camera without any complex image processing such as feature enhancement and extraction to identify the feeding state and to grade the quality of a mushroom. Developed algorithms were implemented to the prototype on-line grading and sorting system. The prototype was developed to simplify the system requirement and the overall mechanism. The system was composed of automatic devices for mushroom feeding and handling, a set of computer vision system with lighting chamber, one chip microprocessor based controller, and pneumatic actuators. The proposed grading scheme was tested using the prototype. Network training for the feeding state recognition and grading was done using static images. 200 samples (20 grade levels and 10 per each grade) were used for training. 300 samples (20 grade levels and 15 per each grade) were used to validate the trained network. By changing orientation of each sample, 600 data sets were made for the test and the trained network showed around 91 % of the grading accuracy. Though image processing itself required approximately less than 0.3 second depending on a mushroom, because of the actuating device and control response, average 0.6 to 0.7 second was required for grading and sorting of a mushroom resulting into the processing capability of 5,000/hr to 6,000/hr.