• Title/Summary/Keyword: Sort-Sorting

Search Result 79, Processing Time 0.027 seconds

Analysis of Sorting Algorithm for Efficient Hardware Implementation (효율적인 하드웨어 구현을 위한 정렬 알고리즘에 대한 분석)

  • Kim, Han Kyeol;Kang, Bongsoon
    • Journal of IKEEE
    • /
    • v.23 no.3
    • /
    • pp.978-983
    • /
    • 2019
  • Under the influence of Autonomous Driving and AI, it is important to accurately recognize and judge objects through cameras. In particular, since a method of recognizing an object using a camera can obtain a large amount of information visually compared to other methods, many image signal processing methods have been studied to extract an accurate image. In addition, a lot of research is being carried out to implementation about hardware. In this work, we compare the principles and characteristics of the sorting algorithms that are frequently used in image signal processing and summarize the performance evaluation. Based on this, we define an efficient algorithm when implemented in hardware among efficient sorting algorithms.

Factors Affecting the Intention to Distribute in Sort Plastic Waste of Vietnamese People: A Case Study in Ho Chi Minh City

  • Thai Dinh TRUONG;Thich Van NGUYEN
    • Journal of Distribution Science
    • /
    • v.21 no.8
    • /
    • pp.35-45
    • /
    • 2023
  • Purpose: This paper (1) identifies the factors that affect people's changing habits towards waste sorting, (2) evaluates the benefits of waste sorting to the environment and (3) designs communication strategies to change people's behavior and habits in sorting plastic waste in Ho Chi Mnh City, Vietnam. Research design, data and methodology: Using the data from 309 people that are living in Ho Chi Minh City and Structural Equation Modeling (SEM), to evaluate variables and test the hypotheses. Results: Research results show that attitudes, subjective standards, behavioral control, and facilities affect people's intention to classify plastic waste. We find that environmental concerns greatly influence people's attitudes. In contrast, environmental concerns have a relatively weaker effect on people's degree of behavioral control. Conclusion: Environmental protection is a matter of concern in the world. In Vietnam, this issue has been institutionalized into law to create a basis for improving the effectiveness of environmental protection activities. This article has some limitations. Firstly, sample is limited to HCMC residents; the study results are not representative of the entire population of Vietnam. This paper is based on cross-sectional data, which is not the best way to establish a causal relationship between the intention to sort plastic waste and its drivers.

Design of Learning Courses of Sorting Algorithms using LAMS

  • Yoo, Jae-Soo;Seong, Dong-Ook;Park, Yong-Hun;Lee, Seok-Jae;Yoo, Kwan-Hee;Cho, Ja-Yeon
    • International Journal of Contents
    • /
    • v.4 no.1
    • /
    • pp.20-25
    • /
    • 2008
  • The development of communication technology and the spread of computers and internet have affected to the field of education. In this paper, we design a learning process with LAMS to make the new education environment which is required in an information age. We made the learning environment with LAMS which develops the learner's algorithmic thinking faculty on some sorting algorithm, especially such as selection sort, bubble sort and insertion sort algorithm. In addition, we analyse the effectiveness of the learning environment. The designed contents were applied to elementary school students' learning and a questionnaire survey was conducted after a learning course. The research of the questionnaire shows that the learning system using LAMS motivates a learner for learning and provides a convenient learning environment.

A Design and Implementation of High Speed Hardware Sorter with Reverse Radix Method (역방향 레딕스 방식에 위한 고속 하드웨어 정렬기의 설계 및 구현)

  • Park, Hui-Sun;Jeon, Jong-Yeon;Kim, Hui-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.992-1001
    • /
    • 1996
  • Radix sort scans the data twice in a pass, to search bit 0s of the items being sorted and store them into the lowest address, and to search bit 1s and st ore them into the following addresses. This doubles the sorting time. In this paper, we introduce Reverse Radix Sort Algorithm, in which the data being sorted are sacnned just once and write upward from the lowest address if it is 0 and downward from the highest address if it is 1. The algorithm is simple and the hardware sorter implemented by this method shows very high sorting sped. Hardware implementation requires two separate pocket memories, register, an upward increasing address counter, a downward decreasing address counter, and comparator. The software simulation of Reverse Radix Sor Algorithm performs sorting in the speed of 54.9ms per 10 thousand of 8 bit digit data, but the hardware sorter spends 5.3ms to sort the same number of data.

  • PDF

Development of an Automatic Sweet Potato Sorting System Using Image Processing (영상처리를 이용한 고구마 자동 선별시스템 개발)

  • Yang G. M.;Choi K. H.;Cho N. H.;Park J. R.
    • Journal of Biosystems Engineering
    • /
    • v.30 no.3 s.110
    • /
    • pp.172-178
    • /
    • 2005
  • Grading and sorting an indeterminate form of agricultural products such as sweet potatoes and potatoes are a labor intensive job because its shape and size are various and complicate. It costs a great deal to sort sweet potato in an indeterminate forms. There is a great need for an automatic grader fur the potatoes. Machine vision is the promising solution for this purpose. The optical indices for qualifying weight and appearance quality such as shape, color, defects, etc. were obtained and an on-line sorting system was developed. The results are summarized as follows. Sorting system combined with an on-line inspection device was composed of 5 sections, human inspection, feeding, illumination chamber, image processing & control, and grading & discharging. The algorithms to compute geometrical parameters related to the external guality were developed and implemented for sorting the deformed sweet potatoes. Grading accuracy by image processing was $96.4\%$ and the processing capacity was 10,800 pieces per hour.

Design of an Expandable VLSI Rebound Sorter (확장형 VLSI 리바운드 정렬기의 설계)

  • Yun, Ji-Heon;Ahn, Byoung-Chul
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.3
    • /
    • pp.433-442
    • /
    • 1995
  • This paper presents an improved VLSI implementation of a parallel sorter to achieve O(Ν) time complexity. Many fast VLSI sort algorithms have been proposed for sorting N elements in O(log Ν) time. However, most such algorithms proposed have complex network structure without considering data input and output time. They are also very difficult to expand or to use in real applications. After analyzing the chip area and time complexity of several parallel sort algorithms with overlapping data input and output time, the most effective algorithm, the rebound sort algorithm, is implemented in VLSI with some improvements. To achieve O(Ν) time complexity, an improved rebound sorter is able to sort 8 16-bits records on a chip. And it is possible to sort more than 8 records by connecting chips in a chain vertically.

  • PDF

Design and feature analysis of a new interconnection network : Half Bubblesort Graph (새로운 상호연결망 하프 버블정렬 그래프 설계 및 성질 분석)

  • Seo, Jung-Hyun;Sim, Hyun;Lee, Hyeong Ok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.7
    • /
    • pp.1327-1334
    • /
    • 2017
  • The Bubble sort graph is node symmetric, and can be used in the data sorting algorithm. In this research we propose and analyze that Half Bubble sort graph that improved the network cost of Bubble sort graph. The Half Bubble sort graph's number of node is n!, and its degree is ${\lfloor}n/2{\rfloor}+1$. The Half Bubble sort graph's degree is $${\sim_=}0.5$$ times of the Bubble sort, and diameter is $${\sim_=}0.9$$ times of the Bubble sort. The network cost of the Bubble sort graph is $${\sim_=}0.5n^3$$, and the network cost of the half Bubble sort graph is $${\sim_=}0.2n^3$$. We have proved that half bubble sort graph is a sub graph of the bubble sort graph. In addition, we proposed a routing algorithm and analyzed the diameter. Finally, network cost is compared with the bubble sort graph.

A Basic Study on the Mobile Separator and Sorter Development of Small and Medium-sized Discharge Site's Mixed Construction Waste in Rural Area (농촌지역 혼합건설폐기물의 중·소규모 배출현장용 이동식 분리선별기 개발을 위한 기초연구)

  • Kim, Byung-Yun;Park, Ji-Sun
    • Journal of the Korean Institute of Rural Architecture
    • /
    • v.21 no.3
    • /
    • pp.17-24
    • /
    • 2019
  • This study aimed to develop a mobile separating and sorting device for discharge sites to separate and sort mixed construction waste generated in small and medium scale in small provincial cities into inorganic materials and combustible materials. The study results can be summarized as follows: 1) As a result of analyzing the existing domestic technology for the separating and sorting mixed construction waste, a device sorting the waste by fusing the vibration screen, disc screen, air blowing methods and the separating and sorting the combustible waste is applied in Korea. 2) In foreign countries, the air blowing, screen, gravity sorters are used for separating and sorting combustible waste in the same way as in Korea. Especially German T Company suggests a construction waste separating and sorting system using an optical sorter. 3) As for the test device for separating and sorting mixed construction waste to be buried in landfill, the processing capacity was set as 16 tons per day. 4) For separating and sorting inorganic materials by granularity, this study set a trommel with two types of diameter as a basic. To operate the mobile all-in-one system, the device is designed to locate a conveyor, a combustible waste conveying device, inside of the trommel. 5) The device is designed in a mobile mode under the concept of primary separating and sorting device, and it can be transported using a 2.5-ton truck minimum. The diameter and length of the trommel are designed to be within 1500mm and 3000mm, respectively. In a further study, an optimized separating and sorting technology is planned to be presented through an experimental study for processing efficiency analysis at the mixed construction waste site by manufacturing the pilot experiment facility reflecting the design elements in the result of this study.

Virtual Radix Counting Bucket sort (가상의 기수계수버킷 정렬)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.95-102
    • /
    • 2015
  • Generally, there is no sorting algorithm much faster than O(nlogn). The quicksort has a best performance O(nlogn) in best and average-case, and $O(n^2)$ in worst-case. This paper suggests virtual radix counting bucket sort such that counting the frequency of numbers in each radix digit, and moves the arbitrary number to proper virtual bucket in the array, and divides the array into radix digit numbers virtually. Also, this algorithm moves the data to proper location within an array for using the minimum auxiliary memory. This algorithm performs k-times such that the number of k digits in given data and the time complexity is O(n). Therefore, this algorithm has a O(kn) time complexity.

Investigation on Grain Image Visulalization and Color Sorting Technique (색채선별기 곡물 이미지 가시화 및 선별기법에 관한 연구)

  • Lee, Choon-Young;Yan, Lei;Lee, Sang-Ryong;Par, Cheol-Woo
    • Journal of the Korean Society of Visualization
    • /
    • v.6 no.2
    • /
    • pp.20-27
    • /
    • 2008
  • The color sorting technique utilizing the image processing method is very applicable tool to analyze motion of a free-falling object in many agricultural and industrial research fields. In the present study, we have developed an image processing system and algorithm to sort good quality rice grains effectively from the bad ones. The system employs a high speed rate line-scan CCD camera with 2K-pixels and worked with a high speed DSP and FPGA in-line. It can accumulate acquired line-scan image data and visualize each grain image clearly. As a result, we can easily calculate the number of pixels occupied by grain(=grain size), gray level and its correct position by visualizing grain images rapidly.