• Title/Summary/Keyword: Sorting algorithm

Search Result 282, Processing Time 0.025 seconds

Deep Web and MapReduce

  • Tao, Yufei
    • 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.

Information Block Preprocessing Algorithm(IBPA) for Improving Performances of Sorting Algorithms (정렬 알고리즘의 성능향상을 위한 정보블록 전처리 알고리즘)

  • 송태옥;송기상
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.557-559
    • /
    • 2000
  • 본 논문에서는 기존의 정렬 알고리즘의 성능을 향상시키기 위하여 정보블록 전처리알고리즘(IBPA)이라는 전처리 알고리즘을 제안한다. IBPA는 정렬된 리스트(list)에 있는 데이터에 관한 정보를 생성하고, 생성된 정보를 이용하여 각 데이터를 재배치하며, 실제적인 정렬은 기존의 정렬 알고리즘을 그대로 이용하여 이루어진다. IBPA의 성능을 측정해본 결과, 2백만개의 랜덤데이터를 정렬한 경우, O(N2)의 평균시간복잡도를 갖는 정렬알고리즘의 0.003%, O(NlogN)의 평균시간복잡도를 갖는 정렬알고리즘의 52%, 그리고 O(N)의 평균시간복잡도를 갖는 정렬알고리즘의 89%정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

  • PDF

Fast and simple algorithm for sorting by reversals and transpositions (전도와 전치 연산을 사용하여 정렬하는 빠르고 간단한 알고리즘)

  • 한보형;박근수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.674-676
    • /
    • 2000
  • 최근 들어 계산분자생물학 분야에서 문자열 알고리즘과 관련된 유전자 재배열 문제가 많은 관심을 끌고 있다. 특히 이러한 문제에는 전도(reversal)나 전치(transpositon)와 같은 재배열 연산들이 사용되고 있다. 전도와 전치 두 가지 연산을 모두 사용하는 정렬은 필요한 최소 연산 회수의 3배 이내의 연산 수행만으로 가능하다고 알려져 있다. 이 논문에서는 기존의 알고리즘을 분석하고 휴리스틱을 사용함으로써 실제 연산 수행 회수를 대폭 줄일수 있음을 보였다. 또한, 기존의 알고리즘보다 간단한 새로운 알고리즘을 제시하고, 이 알고리즘과 휴리스틱을 같이 사용하는 경우 수행 시간과 근사비(approximation ratio)에 있어서 매우 효과적임을 보였다.

  • PDF

Learning System of Sorting Algorithm using Web-based Animation (웹 기반의 애니메이션을 이용한 정렬 알고리즘 학습 시스템)

  • 유광열;정유진
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.574-576
    • /
    • 2003
  • 인터넷과 멀티미디어의 눈부신 발전은 교육현장에서도 다양한 교육매체로 활용되어 수업을 돕고 있다. 이러한 교육매체들은 학습자의 생각으로만 이해할 수 있는 것들을 시각적으로 표현하여 보다 직관적이고 구체적으로 이해시킬 수 있다. 이에 본 논문에서는 플래시 액션스크립트를 사용하여 버블, 삽입, 쉘, 퀵, 힙 알고리즘의 수행과정을 그래픽 애니메이션으로 구현함으로 시각적 효과를 통해 다양한 정렬과정을 스스로 학습할 수 있는 학습 시스템을 구현하였다.

  • PDF

Implementation of counterfeit banknote detection counter using RTOS (RTOS를 이용한 위폐검출 계수기의 구현)

  • 정원근;신태민;이건기
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.364-370
    • /
    • 2002
  • A banknote counter is a machine that automates counting the money in some agencies to treat much banknotes as well as general banking agencies. The banknote counter materialized in this paper is the machine that adds the function of banknote sorting, detecting plural banknote and detecting counterfeit banknote to an existing banknote counter. The technique of sensor signal processing are used for banknote sorting. The technique of sensor application and data processing are used for detecting counterfeit banknote. The technique of precision equipment design and microprocessor application are used for high speed count. Software improved in debugging and difficulties to link with additional hardware. It was materialized through effective control algorithm and real-time signal processing with C-language on the basis of RTOS(real-time operating system) Photodiode, its applications and a magnetic resistance sensor are used as a sensor device with regard to hardware cost -cutting and process velocity. PCF80C552-24 of Philips using Intel I8051 core is used as a control microprocessor. As the results so far achieved, counterfeit banknotes made by the use of a color duplicator and a color Printer, are distinguished from real banknotes through mixing an optical with a magnetic sensor. and, in case that there are some different banknotes while counting, it is prevented for them to be counted without discriminating from the same kind of banknotes in addition to the fu notion of banknote sorting.

Study on Quality Factor Measurement for Cherry Tomato using Color Imagery (칼라영상을 이용한 방울토마토 품질 인자 계측에 관한 연구)

  • Kim, Dae-Yong;Oh, Hyun-Keun;Lee, Nam-Keun;Kim, Young-Sik;Cho, Byung-Kwan
    • Korean Journal of Agricultural Science
    • /
    • v.37 no.2
    • /
    • pp.303-308
    • /
    • 2010
  • Surface color is the most important quality factor for the grade evaluation of cherry tomato. Color is one of the representative indicators for the maturity which is closely related to the internal quality of cherry tomato, such as firmness, sugar content, and acidity. This study was carried out to investigate the relationship between surface color and internal quality of cherry tomatoes harvested from both hydroponic and soil culture at different ripening stages. To calculate the color values of cherry tomatoes an automatic color imaging system was constructed. A specially designed image processing algorithm for the color measurement was developed. The color values of L*, a*, b* were calculated from the initial color values of RGB and then compared with the internal quality. Statistical analyses indicated that the internal quality was more highly correlated with the surface color than size of cherry tomatoes. Color image features were also investigated to detect external damage of cherry tomatoes. The value of (R value - R mean value)/R mean value was the most effective image feature for the detection of damaged areas on the surface of cherry tomatoes. The results of this study demonstrated the feasibility of color sorting process as an alternative of the conventional drum type size sorting system for cherry tomato industry.

Channel Sorting Based Transmission Scheme For D2D Caching Networks (채널 정렬을 활용한 D2D 캐싱 네트워크용 전송 기법)

  • Jeong, Moo-Woong;Ryu, Jong Yeol;Kim, Seong Hwan;Lee, Woongsup;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.11
    • /
    • pp.1511-1517
    • /
    • 2018
  • Mobile Device-to-Device (D2D) caching networks can transmit multimedia data to users directly without passing through any network infrastructure by storing popular multimedia contents in advance that are popular among many mobile users at caching server devices (CSDs) in distributed manners. Thus, mobile D2D caching networks can significantly reduce backhaul traffic in wired networks and service latency time of mobile users. In this paper, we propose an efficient transmission scheme that can enhance the transmission efficiency of mobile D2D caching networks by using multiple CSDs that are caching the contents that are popular among mobile users. By sorting the multiple CSDs that are caching a content that mobile users want to receive according to their channel gains, the proposed scheme can reduce the complexity of algorithm significantly, compared to an optimal scheme based on Brute-force searching, and can also obtain much higher network transmission efficiency than the existing Blanket and Opportunistic transmission schemes.

On Generating Fuzzy Systems based on Pareto Multi-objective Cooperative Coevolutionary Algorithm

  • Xing, Zong-Yi;Zhang, Yong;Hou, Yuan-Long;Jia, Li-Min
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.4
    • /
    • pp.444-455
    • /
    • 2007
  • An approach to construct multiple interpretable and precise fuzzy systems based on the Pareto Multi-objective Cooperative Coevolutionary Algorithm (PMOCCA) is proposed in this paper. First, a modified fuzzy clustering algorithm is used to construct antecedents of fuzzy system, and consequents are identified separately to reduce computational burden. Then, the PMOCCA and the interpretability-driven simplification techniques are executed to optimize the initial fuzzy system with three objectives: the precision performance, the number of fuzzy rules and the number of fuzzy sets; thus both the precision and the interpretability of the fuzzy systems are improved. In order to select the best individuals from each species, we generalize the NSGA-II algorithm from one species to multi-species, and propose a new non-dominated sorting technique and collaboration mechanism for cooperative coevolutionary algorithm. Finally, the proposed approach is applied to two benchmark problems, and the results show its validity.

Constant Time Algorithm for Building the Linear Quadtree on RMESH (RMESH 구조에서의 선형 사진트리 구축을 위한 상수 시간 알고리즘)

  • Kong, Heon-Taek;Woo, Jin-Woon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.9
    • /
    • pp.2247-2258
    • /
    • 1997
  • Quadtree, which is hierarchical data structure, is a very important data structure to represent binary images. Since a linear quadtree representation as is a way to store a quadtree is efficient to save space compared with other representations. It is, however, complicated and takes a large amount of time to build the linear quadtree. In this paper, we present O(1) time a linear quadtree building algorithm for a $n{\times}n$ binary image using three-dimensional $n{\times}n{\times}n$ processors on RMESH structure. Our algorithm, by use of O(1) time collapsing algorithm and reported O(1) time sorting algorithm, is simpler and easier to understand than resently presented algorithm on PARBUS structure.

  • PDF

Parameter identification for nonlinear behavior of RC bridge piers using sequential modified extended Kalman filter

  • Lee, Kyoung Jae;Yun, Chung Bang
    • Smart Structures and Systems
    • /
    • v.4 no.3
    • /
    • pp.319-342
    • /
    • 2008
  • Identification of the nonlinear hysteretic behavior of a reinforced concrete (RC) bridge pier subjected to earthquake loads is carried out based on acceleration measurements of the earthquake motion and bridge responses. The modified Takeda model is used to describe the hysteretic behavior of the RC pier with a small number of parameters, in which the nonlinear behavior is described in logical forms rather than analytical expressions. Hence, the modified extended Kalman filter is employed to construct the state transition matrix using a finite difference scheme. The sequential modified extended Kalman filter algorithm is proposed to identify the unknown parameters and the state vector separately in two steps, so that the size of the problem for each identification procedure may be reduced and possible numerical problems may be avoided. Mode superposition with a modal sorting technique is also proposed to reduce the size of the identification problem for the nonlinear dynamic system with multi-degrees of freedom. Example analysis is carried out for a continuous bridge with a RC pier subjected to earthquake loads in the longitudinal and transverse directions.