• Title/Summary/Keyword: Split-Algorithm

Search Result 316, Processing Time 0.03 seconds

An Efficient Bulk Loading for High Dimensional Index Structures (고차원 색인 구조를 위한 효율적인 벌크 로딩)

  • Bok, Kyoung-Soo;Lee, Seok-Hee;Cho, Ki-Hyung;Yoo, Jae-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2327-2340
    • /
    • 2000
  • Existing bulk loading algorithms for multi-dimensional index structures suffer from satisfying both index construction time and retrieval perfonnancc. In this paper, we propose an efficient bulk loading algorithm to construct high dimensional index structures for large data set that overcomes the problem. Although several bulk loading algorithms have been proposed for this purpose, none of them improve both constnlCtion time and search performance. To improve the construction time, we don't sort whole data set and use bisectiou algorithm that divides the whole data set or a subset into two partitions according to the specific pivot value. Also, we improve the search performance by selecting split positions according to the distribution properties of the data set. We show that the proposed algorithm is superior to existing algorithms in terms of construction time and search perfomlance through various experiments.

  • PDF

A Study on the Optimal Frame Design of Armscye Circumference (겨드랑둘레선의 최적 프레임 생성에 관한 연구)

  • Park, Sun-Mi;Choi, Kueng-Mi;Nam, Yun-Ja;Ryu, Young-Sil;Jun, Jung-Ill
    • Fashion & Textile Research Journal
    • /
    • v.11 no.5
    • /
    • pp.788-798
    • /
    • 2009
  • This study aims to develop a highly reproducible, optimal frame design algorithm using variations in the curvature of armscye circumference, which will provide the basics for remodeling the 3D human body shape with the concept of reverse design used to develop total contents for the apparel industry. 1. The results of the experiment proved that ratio value was significantly efficient than absolute value of curvature variation to extract feature points in the armscye circumference 2. For the shoulder(1st and 2nd quadrant) and front armhole(3rd quadrant) parts of the armscye circumference, frame remodeling with the positive point of inflection led to the completion of a highly reproducible frame. 3. Similarly, even for the rear armhole part(4th quadrant) in the armscye circumference, it was found that frame remodeling using the positive maximum point of inflection resulted in highly reproducible body shape with the maximum point of inflection situated within the range of split angles $305^{\circ}{\sim}330^{\circ}$, while frame remodeling using simultaneously the two largest points of inflection including maximum point of inflection led to highly reproducible body shape with the maximum point of inflection out of the range $305^{\circ}{\sim}330^{\circ}$. 4. Based upon the optimal frame design algorithm developed in this study, section-specific feature points in the armscye circumference were extracted depending on the rate of curvature variation and remodeling with spline curves was conducted. The results indicate a remarkably high reproducibility(98.6%) and suggest that the algorithm developed in this study is suitable for human body modeling.

Equilibrium of transport mode choice in logit model (로짓 수단선택모형의 균형연구)

  • Im, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.5
    • /
    • pp.131-139
    • /
    • 2010
  • The transport mode choice problem is to determine which of the alternative transport modes connecting an origin and destination will be used by a traveler. Most of the research relating to transport mode choice have mainly been focused on modeling, properties, and applications of the model, but rarely were concerned with equilibrium among the modes. This paper proves the equilibrium among the modes by using a logit mode choice model, and then verifies it with the Korean Transport Database (KTDB). In order to obtain such an equilibrium, this paper also presents a solution algorithm based on the fixed point theorem. The algorithm was tested with an example and confirmed the equilibrium solution.

Bi-directional Maximal Matching Algorithm to Segment Khmer Words in Sentence

  • Mao, Makara;Peng, Sony;Yang, Yixuan;Park, Doo-Soon
    • Journal of Information Processing Systems
    • /
    • v.18 no.4
    • /
    • pp.549-561
    • /
    • 2022
  • In the Khmer writing system, the Khmer script is the official letter of Cambodia, written from left to right without a space separator; it is complicated and requires more analysis studies. Without clear standard guidelines, a space separator in the Khmer language is used inconsistently and informally to separate words in sentences. Therefore, a segmented method should be discussed with the combination of the future Khmer natural language processing (NLP) to define the appropriate rule for Khmer sentences. The critical process in NLP with the capability of extensive data language analysis necessitates applying in this scenario. One of the essential components in Khmer language processing is how to split the word into a series of sentences and count the words used in the sentences. Currently, Microsoft Word cannot count Khmer words correctly. So, this study presents a systematic library to segment Khmer phrases using the bi-directional maximal matching (BiMM) method to address these problematic constraints. In the BiMM algorithm, the paper focuses on the Bidirectional implementation of forward maximal matching (FMM) and backward maximal matching (BMM) to improve word segmentation accuracy. A digital or prefix tree of data structure algorithm, also known as a trie, enhances the segmentation accuracy procedure by finding the children of each word parent node. The accuracy of BiMM is higher than using FMM or BMM independently; moreover, the proposed approach improves dictionary structures and reduces the number of errors. The result of this study can reduce the error by 8.57% compared to FMM and BFF algorithms with 94,807 Khmer words.

A Study on Suppression of UT Grain Noise Using SSP MPO Algorithms (SSP MPO 알고리즘을 이용한 초음파 결정립 잡음 억제에 관한 연구)

  • Koo, Kil-Mo;Jun, Kye-Suk
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.6
    • /
    • pp.81-89
    • /
    • 1996
  • It is very important for ultrasonic test method to evaluate the integrity of the class I components in nuclear power plants. However, as the rltrasonic test is affected by internal structures and configurations of test materials, backscattering, that is, time invariant noise is generated in large grain size materials. Due to the above reason, the received signal results in low signal to noise(S/N) ratio. Split spectrum processing(SSP) technique is effective to suppress the grain noise. The conventional SSP technique. however, has been applied to unique algorithm. This paper shows that MPO(minimization and polarity threshold) algorithm which two algorithms are applied simulatancously, was utilized, the signal processing time was shorten by using the new constant-Q SSP with the FIR filter which frequency to bandwidth ratio is constant and the optimum parameters were analysed for the signal processing to longitudinal wave and shear wave with the same requirements of inspection on nuclear power plant site. Moreover, the new ultrasonic test instrument, the reference block of the same product form and material specification, stainless stell test specimens and copper test specimens block of the same fabricated for the application of new SSP technique. As the result of experimental test with new ultrasonic test instrument and test specimens, the signal to noise ratio was improved by appying the new SSP technique.

  • PDF

Improvement of COMS land surface temperature retrieval algorithm by considering diurnal variation of air temperature (기온의 일 변동을 고려한 COMS 지표면온도 산출 알고리즘 개선)

  • Choi, Youn-Young;Suh, Myoung-Seok
    • Korean Journal of Remote Sensing
    • /
    • v.32 no.5
    • /
    • pp.435-452
    • /
    • 2016
  • Land Surface Temperature (LST) has been operationally retrieved from the Communication, Ocean, and Meteorological Satellite (COMS) data by the spilt-window method (CSW_v2.0) developed by Cho et al. (2015). Although the CSW_v2.0 retrieved the LST with a reasonable quality compared to the Moderate Resolution Imaging Spectroradiometer (MODIS) LST data, it showed a relatively poor performance for the strong inversion and lapse rate conditions. To solve this problem, the LST retrieval algorithm (CSW_v2.0) was updated using the simulation results of radiative transfer model (MODTRAN 4.0) by considering the diurnal variations of air temperature. In general, the upgraded version, CSW_v3.0 showed a similar correlation coefficient between the prescribed LSTs and retrieved LSTs (0.99), the relatively smaller bias (from -0.03 K to-0.012 K) and the Root Mean Square Error (RMSE) (from 1.39 K to 1.138 K). Particularly, CSW_v3.0 improved the systematic problems of CSW_v2.0 that were encountered when temperature differences between LST and air temperature are very large and/or small (inversion layers and superadiabatic lapse rates), and when the brightness temperature differences and surface emissivity differences were large. The bias and RMSE of CSW_v2.0 were reduced by 10-30% in CSW_v3.0. The indirect validation results using the MODIS LST data showed that CSW_3.0 improved the retrieval accuracy of LST in terms of bias (from -0.629 K to -0.049 K) and RMSE (from 2.537 K to 2.502 K) compared to the CSW_v2.0.

Algorithm for Maximum Degree Vertex Partition of Cutwidth Minimization Problem (절단 폭 최소화 문제의 최대차수 정점 분할 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.1
    • /
    • pp.37-42
    • /
    • 2024
  • This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CWf(G)=max𝜈VCWf(𝜈)for given graph G=(V,E),m=|V|, n=|E|, the proposed algorithm divides neighborhood NG[𝜈i] of the maximum degree vertex 𝜈i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈i firstly. Then, we split the left and right NG[𝜈i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n2) time complexity, that can be obtains the optimal solutions for all of various experimental data

An Indoor Pedestrian Simulation Model Incorporating the Visibility (가시성을 고려한 3차원 실내 보행자 시뮬레이션 모델)

  • Kwak, Su-Yeong;Nam, Hyun-Woo;Jun, Chul-Min
    • Spatial Information Research
    • /
    • v.18 no.5
    • /
    • pp.133-142
    • /
    • 2010
  • Many pedestrian or fire evacuation models have been studied last decades for modeling evacuation behaviors or analysing building structures under emergency situations. However, currently developed models do not consider the differences of visibility of pedestrians by obstacles such as furniture, wall, etc. The visibility of pedestrians is considered one of the important factors that affect the evacuation behavior, leading to making simulation results more realistic. In order to incorporate pedestrian's visibility into evacuation simulation, we should be able to give different walking speeds according to differences of visibility. We improved the existing floor field model based on cellular automata in order to implement the visibility. Using the space syntax theory, we showed how we split the indoor spaces depending on the different visibilities created by different levels of structural depths. Then, we improved the algorithm such that pedestrians have different speeds instead of simultaneous movement to other cells. Also, in order for developing a real time simulation system integrated w ith indoor sensors later, we present a process to build a 3D simulator using a spatial DBMS. The proposed algorithm is tested using a campus building.

Material Topology Optimization Design of Structures using SIMP Approach Part I : Initial Design Domain with Topology of Partial Holes (SIMP를 이용한 구조물의 재료 위상 최적설계 Part I : 부분적인 구멍의 위상을 가지는 초기 설계영역)

  • Lee, Dong-Kyu;Park, Sung-Soo;Shin, Soo-Mi
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.1
    • /
    • pp.9-18
    • /
    • 2007
  • This study shows an implementation of partial holes in an initial design domain in order to improve convergences of topology optimization algorithms. The method is associated with a bubble method as introduced by Eschenauer et al. to overcome slow convergence of boundary-based shape optimization methods. However, contrary to the bubble method, initial holes are only implemented for initializations of optimization algorithm in this approach, and there is no need to consider a characteristic function which defines hole's deposition during every optimization procedure. In addition, solid and void regions within the initial design domain are not fixed but merged or split during optimization Procedures. Since this phenomenon activates finite changes of design parameters without numerically calculating movements and positions of holes, convergences of topology optimization algorithm can be improved. In the present study, material topology optimization designs of Michell-type beam utilizing the initial design domain with initial holes of varied sizes and shapes is carried out by using SIMP like a density distribution method. Numerical examples demonstrate the efficiency and simplicity of the present method.

Matching Pursuit Estimation and Quantizer Design for Sinusoidal Model-based Coder (정현파 모델 부호화기를 위한 MP(Matching Pursuit) 알고리즘과 파라미터 양자화기)

  • Ahn Yeong-Uk;Jeong Gyu-Hyeok;Kim Jong-Hak;Yang Yong-Ho;Lee In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.7
    • /
    • pp.402-409
    • /
    • 2005
  • In this paper. we propose a coding method using a matching pursuit algorithm in a strongly periodic highband signal. Also. we propose an efficient quantizer for the estimated parameters : spectral magnitude and phase. Based on the error concealment principle and sinusoidal model. the MP algorithm requires the high-precision pitch period estimation. To estimate more accurate pitch period. the refined pitch obtained from lowband speech is used. which increases the efficiency of bit allocation. The spectral magnitude parameters are quantized by the method which is combined with MDCT (Modified Discrete Cosine Transform) and multi-stage structure. The spectral phase quantizer uses the $2{\pi}$ modular characteristic of phases and the weighted function by spectral magnitudes. To evaluate the efficiency of the proposed method. we applied it to analysis-by-synthesis system. Furthermore we suggest the possibillity of scalable wideband speech codecs based on band-split structure.