• Title/Summary/Keyword: Merge sort

Search Result 18, Processing Time 0.019 seconds

Storage and Retrieval Architecture based on Key-Value Solid State Device (Key-Value Solid State Device 기반의 저장 및 검색 아키텍처)

  • Sun, Yu Xiang;Lee, Yong-Ju
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.1
    • /
    • pp.45-52
    • /
    • 2020
  • This paper proposes a solution for storage and retrieval problems for Resource Description Framework (RDF) data utilizing a key-value Solid State Device (SSD), considering storage, retrieval performance, and security. We propose a two-step compression algorithm to separate logical relationship and true values from RDF data-sets using the key-value SSD. This improves not only compression and storage efficiency but also storage security. We also propose a hybrid retrieval structure based on R∗-tree to enhance retrieval efficiency and implement a sort-merge join algorithm, and discuss factors affecting R∗-tree retrieval efficiency. Finally, we show the proposed approach is superior to current compression, storage, and retrieval approaches, obtaining target results faster while requiring less space, and competitive in terms of versatility, flexibility and security.

A Method for the Region Segmentation for Satellite Images using Region Split and Merge (영역 분할 및 합병 기법을 이용한 위성 영상 영역 분할 방법)

  • Chun, Byung-Tae;Jang, Dae-Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.2 s.46
    • /
    • pp.47-52
    • /
    • 2007
  • Conventional pixel based region segmentation methods have problems of long processing time and incorrect region split on account of performing region split through comparison of neighboring pixels. In this paper, we propose the method which segments a large size of satellite image effectively using modified centroid linkage method. This method is a sort of region split and merge. The proposed method merges pixels and makes them as a new region through only two directional comparing the current positioning pixel with neighbor ones, if they are satisfied with given conditions. Therefore, this method has less comparing time than the cases of previous ones. The experimental result shows that the proposed method is very efficient because of having less processing time and more exact segmented regions than the previous ones.

  • PDF

Non-linear Vibration of a System Incorporating a Hysteretic Damper (비선형 히스테리시스 댐퍼를 갖는 진동계의 해석)

  • 양성영;장서일;김상주
    • Journal of KSNVE
    • /
    • v.10 no.3
    • /
    • pp.531-535
    • /
    • 2000
  • A three-parameter model of viscoelastic damper which has a non-linear spring as an element is incorporated into an oscillator. The behavior of the damper model shows non-linear hysteresis curves which is qualitatively similar to those of real viscoelastic materials. The motion is governed by get analytic solutions of the system. The frequency-response curves show that multiple solutions co-exist and that the jump phenomena can occur. In addition it is shown that separate solution branch exists and that it can merge with the primary response curve. Saddle-node bifurcation sets explain the occurences of such non-linear phenomena. A direct time intergration of the original equation of motion validifies the use of the harmonic balance method to this sort of problem.

  • PDF

Modelling and Analysis of a Vibrating System Incorporating a Viscoelastic Damper (비선형 점탄성 댐퍼를 포함한 진동시스템의 모델링 및 해석)

  • Yang, Seong-Young;Chang, Seo-Il;Kim, Sang-Joo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2000.06a
    • /
    • pp.449-454
    • /
    • 2000
  • A three-parameter model of viscoelastic damper, which has a non-linear spring as an element is incorporated into an oscillator. The behavior of the damper model shows non-linear hysteresis curves which is qualitatively similar to those of real viscoelastic materials. The motion is governed by three-dimensional non-linear dynamical system of equations. The harmonic balance method is applied to get analytic solutions of the system. The frequency-response curves show that multiple solutions co-exist and that the jump phenomena can occur. In addition, it is shown that separate solution branch exists and that it can merge with the primary response curve. Saddle-node bifurcation sets explain the occurences of such non-linear phenomena. A direct time integration of the original equation of motion validifies the use of the harmonic balance method to this sort of problem.

  • PDF

Comparision of Join Query Processing Cost in Row-Oriented and Column-Oriented Databases (Row-지향과 Column-지향 데이터베이스의 조인 질의 처리 비용 비교)

  • Oh, Byung-Jung;Ahn, Soo-Min;Kim, Kyung-Chang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.1214-1217
    • /
    • 2011
  • 데이터 레코드를 가로(row-wise)로 저장하는 기존의 데이터베이스를 Row-지향 데이터베이스, 세로(column-wise)로 저장하는 데이터베이스를 Column-지향 데이터베이스라 정의하자. 본 논문에서는 Row-지향 데이터베이스와 Column-지향 데이터베이스에서 분석 workload 형태의 조인 질의를 처리하여 비교 우위 성능을 보이는 데이터베이스 시스템을 고찰하고자 한다. 객관적인 성능 실험을 위해 분석적 모델인 스타 스키마 벤치마크를 이용하였다. Nested Loop 조인과 Sort Merge 조인 기법을 사용한 실험에서 Column-지향 데이터베이스의 성능이 우수하게 나타났음을 확인할 수 있다.

A Heuristic Polynomial Time Algorithm for Crew Scheduling Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.11
    • /
    • pp.69-75
    • /
    • 2015
  • This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

A Low-Computation Indirect Model Predictive Control for Modular Multilevel Converters

  • Ma, Wenzhong;Sun, Peng;Zhou, Guanyu;Sailijiang, Gulipali;Zhang, Ziang;Liu, Yong
    • Journal of Power Electronics
    • /
    • v.19 no.2
    • /
    • pp.529-539
    • /
    • 2019
  • The modular multilevel converter (MMC) has become a promising topology for high-voltage direct current (HVDC) transmission systems. To control a MMC system properly, the ac-side current, circulating current and submodule (SM) capacitor voltage are taken into consideration. This paper proposes a low-computation indirect model predictive control (IMPC) strategy that takes advantages of the conventional MPC and has no weighting factors. The cost function and duty cycle are introduced to minimize the tracking error of the ac-side current and to eliminate the circulating current. An optimized merge sort (OMS) algorithm is applied to keep the SM capacitor voltages balanced. The proposed IMPC strategy effectively reduces the controller complexity and computational burden. In this paper, a discrete-time mathematical model of a MMC system is developed and the duty ratio of switching state is designed. In addition, a simulation of an eleven-level MMC system based on MATLAB/Simulink and a five-level experimental setup are built to evaluate the feasibility and performance of the proposed low-computation IMPC strategy.

A Comparative Study of PRAM-based Join Algorithms (PRAM 기반의 조인 알고리즘 성능 비교 연구)

  • Choi, Yongsung;On, Byung-Won;Choi, Gyu Sang;Lee, Ingyu
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.379-389
    • /
    • 2015
  • With the advent of non-volatile memories such as Phase Change Memory (PCM or PRAM) and Magneto Resistive RAM (MRAM), active studies have been carried out on how to replace Dynamic Random-Access Memory (DRAM) with PRAM. In this paper, we study both endurance and performance issues of existing join algorithms that are based on PRAM-based computer systems and have been widely used until now: Block Nested Loop Join, Sort-Merge Join, Grace Hash Join, and Hybrid Hash Join. Our experimental results show that the existing join algorithms need to be redesigned to improve both the endurance and performance of PRAMs. To the best of our knowledge, this is the first research to scientifically study the results of the four join algorithms running on PRAM-based systems. In this work, our main contribution is the modeling and implementation of a PRAM-based simulator for a comparative study of the existing join algorithms.