• Title/Summary/Keyword: Sorting algorithm

Search Result 280, Processing Time 0.027 seconds

GBNSGA Optimization Algorithm for Multi-mode Cognitive Radio Communication Systems (다중모드 Cognitive Radio 통신 시스템을 위한 GBNSGA 최적화 알고리즘)

  • Park, Jun-Su;Park, Soon-Kyu;Kim, Jin-Up;Kim, Hyung-Jung;Lee, Won-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.314-322
    • /
    • 2007
  • This paper proposes a new optimization algorithm named by GBNSGA(Goal-Pareto Based Non-dominated Sorting Genetic Algorithm) which determines the best configuration for CR(Cognitive Radio) communication systems. Conventionally, in order to select the proper radio configuration, genetic algorithm has been introduced so as to alleviate computational burden along the execution of the cognition cycle proposed by Mitola. This paper proposes a novel optimization algorithm designated as GBNSGA for cognitive engine which can be described as a hybrid algorithm combining well-known Pareto-based NSGA(Non-dominated Sorting Genetic Algorithm) as well as GP(Goal Programming). By conducting computer simulations, it will be verified that the proposed method not only satisfies the user's service requirements in the form of goals. It reveals the fast optimization capability and more various solutions rather than conventional NSGA or weighted-sum approach.

An Interference Avoidance Method Using Two Dimensional Genetic Algorithm for Multicarrier Communication Systems

  • Huynh, Chuyen Khoa;Lee, Won Cheol
    • 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.

Development of Nut Sorting Machine by Area Labelling Method (영역 라벨링법에 의한 밤 선별기 개발)

  • Lee Seong-Cheol;Lee Young-Choon;Pang Du-Yeol
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.1858-1861
    • /
    • 2005
  • Automatic nut sorting machine used to calculate the size of inserted nut and detect the black spot defection is introduced in this paper. Because most of farm products are imported from the underdeveloped countries, domestic farm products have no place to be sold in market. To overcome this critical situation, lowering the productivity cost is strongly demanded to compete with foreign corps. Imaged processed nut sorting algorithm is developed to the automatic nut sorting machine to remove the sorting time which takes lots of man power. This system is composed of mainly two parts, mechanical parts and vision system. The purpose of mechanical part is supplying the nuts automatically to make computer system capture the images of objects. Simplified mechanical system was assembled followed by 3D simulation by Pro/E design for the adaptive cost effects. Several image processing algorithms are designed to detect the spot defects and calculate the size of nuts. Test algorithm shows good results to the designed automatic nut sorting system.

  • PDF

Exact Histogram Specification Considering the Just Noticeable Difference

  • Jung, Seung-Won
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.2
    • /
    • pp.52-58
    • /
    • 2014
  • Exact histogram specification (EHS) transforms the histogram of an input image into the specified histogram. In the conventional EHS techniques, the pixels are first sorted according to their graylevels, and the pixels that have the same graylevel are further differentiated according to the local average of the pixel values and the edge strength. The strictly ordered pixels are then mapped to the desired histogram. However, since the conventional sorting method is inherently dependent on the initial graylevel-based sorting, the contrast enhancement capability of the conventional EHS algorithms is restricted. We propose a modified EHS algorithm considering the just noticeable difference. In the proposed algorithm, the edge pixels are pre-processed such that the output edge pixels obtained by the modified EHS can result in the local contrast enhancement. Moreover, we introduce a new sorting method for the pixels that have the same graylevel. Experimental results show that the proposed algorithm provides better image enhancement performance compared to the conventional EHS algorithms.

An Experimental Analysis on the Unplugged Sorting Activity for Computer Science Education (컴퓨터과학 교육용 정렬 놀이를 위한 실험적 분석)

  • Park, Youngki
    • Journal of The Korean Association of Information Education
    • /
    • v.22 no.6
    • /
    • pp.671-679
    • /
    • 2018
  • Sorting algorithms are the basic building blocks that computer science students need to learn. In recent years, sorting algorithms also have begun to be taught in K-12 classrooms using "the educational sorting game" described in CSUnplugged. However, although the educational sorting game was developed for students aged 8 and up, it is hard for K-12 teachers to play with their students because it is difficult for teachers to understand all of the algorithms and some popular algorithms do not work well in the educational sorting game. In this paper, we discuss what teachers should know, and experimentally analyze the performance of the existing algorithms when applied to the educational sorting game.

DESIGN AND ANALYSIS OF PREDICTIVE SORTING ALGORITHMS

  • Yun, Min-Young
    • Journal of applied mathematics & informatics
    • /
    • v.3 no.1
    • /
    • pp.11-24
    • /
    • 1996
  • The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

A Simple Capacitor Voltage Balancing Method with a Fundamental Sorting Frequency for Modular Multilevel Converters

  • Peng, Hao;Wang, Ying;Wang, Kun;Deng, Yan;He, Xiangning;Zhao, Rongxiang
    • Journal of Power Electronics
    • /
    • v.14 no.6
    • /
    • pp.1109-1118
    • /
    • 2014
  • A Fundamental Frequency Sorting Algorithm (FFSA) is proposed in this paper to balance the voltages of floating dc capacitors for Modular Multilevel Converters (MMCs). The main idea is to change the sequences of the CPS-PWM carriers according to the capacitor voltage increments during the previous fundamental period. Excessive frequent sorting is avoided and many calculating resources are saved for the controller. As a result, more sub-modules can be dealt with. Furthermore, it does not need to measure the arm currents. Therefore, the communication between the controllers can be simplified and the number of current sensors can be reduced. Moreover, the proposed balancing method guarantees that all of the switching frequencies of the sub-modules are equal to each other. This is quite beneficial for the thermal design of the sub-modules and the lifetime of the power switches. Simulation and experimental results acquired from a 9-level prototype verify the viability of the proposed balancing method.

Parallel Sorting Algorithm by Median-Median (중위수의 중위수에 의한 병렬 분류 알고리즘)

  • Min, Yong-Sik
    • 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.

  • PDF

Optimization Design for Dynamic Characters of Electromagnetic Apparatus Based on Niche Sorting Multi-objective Particle Swarm Algorithm

  • Xu, Le;You, Jiaxin;Yu, Haidan;Liang, Huimin
    • Journal of Magnetics
    • /
    • v.21 no.4
    • /
    • pp.660-665
    • /
    • 2016
  • The electromagnetic apparatus plays an important role in high power electrical systems. It is of great importance to provide an effective approach for the optimization of the high power electromagnetic apparatus. However, premature convergence and few Pareto solution set of the optimization for electromagnetic apparatus always happen. This paper proposed a modified multi-objective particle swarm optimization algorithm based on the niche sorting strategy. Applying to the modified algorithm, this paper guarantee the better Pareto optimal front with an enhanced distribution. Aiming at shortcomings in the closing bounce and slow breaking velocity of electromagnetic apparatus, the multi-objective optimization model was established on the basis of the traditional optimization. Besides, by means of the improved multi-objective particle swarm optimization algorithm, this paper processed the model and obtained a series of optimized parameters (decision variables). Compared with other different classical algorithms, the modified algorithm has a satisfactory performance in the multi-objective optimization problems in the electromagnetic apparatus.

Development of Control Algorithm and Pick & Placer (반도체 소자 Pick &Placer 및 제어 알고리즘 개발)

  • 심성보;김재희;유범상
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.1339-1343
    • /
    • 2004
  • This paper presents a development of the control algorithm and Pick & Placer. The Pick & Placer provides a powerful multi-task system that includes both graphical and remote interface. Users can easily set up sorting parameters and record important data including wafer number, data, and operator information. This System sets up a dustproof device and massively machined components to provide an extremely stable sorting environment. Precise resolution and accuracy result from using machine vision, a pneumatic slide drive and close -looped positioning.

  • PDF