• Journal of Information Processing Systems
• /
• 제7권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.

• Journal of Biosystems Engineering
• /
• 제37권2호
• /
• pp.90-99
• /
• 2012

Purpose: This study was conducted to investigate the optimal sorting factors in establishing an efficient sorting technology for brown rice. Methods: The brown rice varieties used in this study were Il Pum, Chu Cheong, Dong Jin, Un Gwang, Nam Pyeong, and Dae An. These were classified into whole grain, unriped grain, and green dead rice. The shape factors were analyzed based on length, width and thickness of the grains. Results: The results revealed that the maximum length among whole grain, unriped grain, and green dead rice was observed in Dae An variety while Chu Cheong variety showed the minimum. Further more, Il Pum brown rice showed the maximum width while Dong Jin variety showed the minimum. In the case of thickness, the maximum was observed in Un Gwang variety and that of the minimum among Nam Pyeong variety for both whole grain and unriped grain. Conclusions: The length and width can be used as determinants in sorting factors of whole grain and green dead rice, and the thickness can be considered as optimum sorting factor of whole grain and unriped grain.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권3호
• /
• pp.197-205
• /
• 2004

In this paper, we studied on the hardware implementation of a 3${\times}$3 window weighted median filter using bit-level sorting algorithm. The weighted median filter is a generalization of the median filter that is able to preserve :,harp changes in signal and is very effective in removing impulse noise. It has been successfully applied in various areas such as digital signal and video/image processing. The weighted median filters are, for the most part, based on word-level sorting methods, which have more hardware and time complexity, However, the proposed bit-serial sorting algorithm uses weighted adder tree to overcome those disadvantages. It also offers a simple pipelined filter architecture that is highly regular with repeated modules and is very suitable for weighted median filtering. The algorithm was implemented by VHDL and graphical environment in MAX＋PlusII of ALTERA. The simulation results indicate that the proposed design method is more efficient than the traditional ones.

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권3호
• /
• pp.292-298
• /
• 2022

Coding education and algorithm education are essential in the era of the fourth industrial revolution. Text-oriented algorithm textbooks are perceived as difficult by students who are new to coding and algorithms. There is a need to develop educational content so that students can easily understand the principles of complex algorithms. This paper has implemented basic sorting algorithms as augmented reality contents for students who are new to algorithm education. To make it easier to understand the concept and principles of sorting algorithms, sorting data was expressed as a 3D box and the comparison of values according to the algorithms and the movement of values were produced as augmented reality contents in the form of 3D animations. In order to help with the understanding of sorting algorithms in C language, the change of variable values and the exchange of data were shown as animations according to the execution order of the code and the flow of the loop. Students can conveniently use contents through a smart phone without special equipment by being produced in a marker-based manner. Interest and immersion, as well as understanding of classes of sorting algorithms can be increased through educational augmented reality-based educational contents.

• International Journal of Computer Science & Network Security
• /
• 제22권12호
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1137-1139
• /
• 1987

We discuss several issues related to the sorting algorithms on hypercube machine. The efficiencies of the algorithms are compared under the simpler assumption and the load balancing problem arising from the various algorithms and the data distribution is also discussed.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 추계학술대회 논문집
• /
• pp.171-174
• /
• 1997

The great development of semiconductor industry demands the high efficiency and performance of related device, but the pick and place system of semiconductor packaging device can load a few units until nowdays. Although the system can load a lot of units, it can work multiple sort operation. The defect like that causes a low efficiency. Therefore, this paper represents the development of pick and place system which can work multiple sort operation.

• 전자공학회논문지A
• /
• 제29A권7호
• /
• pp.19-30
• /
• 1992

In this paper, a new large scale ATM switch architecture for Broadband ISDN is presented and its performance is analyzed mathematically. The proposed two-stage ATM switch consists of a sorting network and several unit switches. The proposed switch is self-routing and nonlocking. Its maximum through put is 100% without speed up which other output buffered switch needs. The hardware complexity mainly depends on that of a sorting network, but sorting network is easy to be implemented to VLSI because of its regularity in the structure.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.97-102
• /
• 2011

This study was performed to design and develop an ergonomic equipment for strawberry sorting and packing in agricultural working environments. Potential risk of work related musculo-skeletal disorders associated with farm workers performing strawberry sorting and packing was analyzed through interviews, field surveys, work measurement, and working posture evaluation. For the evaluation of working posture, we used REBA, OWAS, and RULA assessment methods to identify multi-factorial risk factors. Based on the result of comprehensive assessment, a new concept of multi-level rotating table for strawberry sorting and packing was proposed to modify awkward working postures and improve the effectiveness of the farm work. Finally, the characteristics and effectiveness of new equipment was discussed in terms of improvements in productivity, safety, and subjective ratings of farm workers. The results of analysis showed that working conditions improved significantly.

• 응용통계연구
• /
• 제16권1호
• /
• pp.129-140
• /
• 2003

본 논문은 통계적 영상처리를 이용하여 과일 선별 시스템을 개발하고자 한다. 히스토그램으로부터 과일 영상의 색깔에 대한 분포를 파악하고 이 표본 위치문제에서 Wilcoxon 검정을 이용하여 에지를 검출한다. 체인코드로부터 과일 영상의 면적, 둘레, 장ㆍ단축의 길이와 원형도 등 기하학적 특성값을 얻는다. 우리는 과일에 대한 영상실험을 통하여 통계적 에지검출 방법에 토대를 둔 시스템과 기존의 Sobel 연산자에 토대를 둔 시스템과의 비교 분석한다.