• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.281-286
• /
• 2011

Data sorting is one of important pre-process to utilize huge data in modern society, but sorting spends a lot of time by sorting itself. In this paper, we presented hybrid sorting algorithm that splits array to sort concurrently in CPU and GPU. To do this, we decided most effective range of array based on hardware performance, then accomplished reducing whole sorting time by concurrent sorting on CPU and GPU. As shown in results of experiment, hybrid sorting improved about eight percent of sorting time in comparison with the sorting time using only GPU.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.725-734
• /
• 2016

For multi-mode radar signals in complex electromagnetic environment, different modes of one emitter tend to be deinterleaved into several emitters, called as "extension", when processing received signals by use of existing sorting methods. The "extension" problem inevitably deteriorates the sorting performance of multi-mode radar signals. In this paper, a novel method based on spatial data mining is presented to address above challenge. Based on theories of data field, we describe the distribution information of feature parameters using potential field, and makes partition clustering of parameter samples according to revealed distribution features. Additionally, an evaluation criterion based on cloud model membership is established to measure the relevance between different cluster-classes, which provides important spatial knowledge for the solution of the "extension" problem. It is shown through numerical simulations that the proposed method is effective on solving the "extension" problem in multi-mode radar signal sorting, and can achieve higher correct sorting rate.

• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.191-196
• /
• 2021

Computational thinking refers to the process and method of solving everyday problems using computers. When teaching a computational thinking class for computer majors and non-majors at university, the easiest example to deliver the concept of computational thinking is sorting. Sorting is the concept of arranging given data in order. In this work, we have implemented four visualized sorting algorithms that anyone can easily use. In particular, it helps to understand the difference between the algorithms by showing the number of comparisons and exchanges between elements, which are the criteria for evaluating the performance of the sorting algorithm in real time. It was confirmed that the practice of using the sorting visualization app developed in this research contributed to the improvement of students' understanding of computational thinking.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.6
• /
• pp.27-35
• /
• 2004

Data structure and algorithm are primary courses for computer programming instruction. However, now those are not interesting courses for students because the programming instruction methodologies that used these courses are not the proper methodologies for the visual and windows programming. The Sorting programming is the same as other data structures. Therefore, we developed the VTSPI (Visualization Tool for Sorting Programming Instruction) which is a software component to instruct sorting program effectively for solving these problems. As a result, students can code, understand and debug their programs because VTPSI is software components based on visual programming.

• International journal of advanced smart convergence
• /
• v.4 no.1
• /
• pp.137-144
• /
• 2015

Development of the yarn sorting equipment (khonhook) by slide way due to the principle of engineering that cause of workers on the long of motion time. The data was collected from the weaving group Ban Nongkok village, Nakornratchasima Province, THAILAND. According to the study, the step of yarn sorting (konhook) was one of the steps that affect long of motion time. The problem was the inadequate capacity equipment. The objective of research was to study and develop the yarn sorting equipment (konhook). The fabric used in the study was 64 meters in length and 1 meter in width. Researchers studied the processes the yarn sorting (konhook) which it consists of seven sub steps, 1) the thread tube setting, 2) yarn bunching, 3) tying a knot at the end of yarn, 4) looping the yarn into a pillar, 5) sorting the yarn (konhook), 6) crossing pillars and 7) taking out the yarn. Researchers focused on studying yarn sorting process (konhook) by designing and creating a device for yarn sorting (konhook) for reducing yarn sorting (konhook) time by the original method performance indicators. The results found that the developed yarn sorting equipment (konhook) ) by slide way could reduce working time from 7.24 minutes to 6.08 minutes of the original equipment yarn sorting (konhook). This means it could make the process 16.02 % faster. This also helps reducing the distance of workers' movement from 2,234 meters to 8 meters. This is 99.64 % shorter.

• Journal of Biosystems Engineering
• /
• v.20 no.4
• /
• pp.376-382
• /
• 1995

This study was intended to develop more reliable fruit sorting algorithm regardless of the feeding positions of fruits by using the neural network in which various information could be included as input data. Specific objectives of this study were to select proper input units in the neural network by investigating the features of input image, to analyze the sorting accuracy of the algorithm depending on the feeding positions of Fuji apple and to evaluate the performance of the algorithm for practical usage. the average value in color grading accuracy was 90%. Based on the computing time required for color grading, the maximum sorting capacity was estimated to approximately 10, 800 apples per hours. Finally, it is concluded that the neuro-net based color sorting algorithm developed in this study has feasibility for practical usage.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3100-3116
• /
• 2012

Reversible data hiding enables the embedding of messages in a host image without any loss of host content, which is proposed for image authentication that if the watermarked image is deemed authentic, we can revert it to the exact copy of the original image before the embedding occurred. In this paper, we present an improved histogram-based reversible data hiding scheme based on prediction and sorting. A rhombus prediction is employed to explore the prediction for histogram-based embedding. Sorting the prediction has a good influence on increasing the embedding capacity. Characteristics of the pixel difference are used to achieve large hiding capacity while keeping low distortion. The proposed scheme exploits a two-stage embedding strategy to solve the problem about communicating peak points. We also present a histogram shifting technique to prevent overflow and underflow. Performance comparisons with other existing reversible data hiding schemes are provided to demonstrate the superiority of the proposed scheme.

• 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.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.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
• /
• v.22 no.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.