• Title/Summary/Keyword: $A^*$ search algorithm

Search Result 3,553, Processing Time 0.035 seconds

A DNA Sequence Search Algorithm Using Integer Type Transformation (정수형 변환을 이용한 DNA 서열 검색 알고리즘)

  • Yoon, Kyong-Oh;Cho, Sung-Bae
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.357-359
    • /
    • 2012
  • 초 고성능 바이오 서열 분석 장비 기술의 발달로 대량의 바이오 정보가 쏟아져 나오고 있으며, 바이오산업의 발달로 개인별 유전체 정보에 의한 맞춤의학의 시대가 도래되고 있다. 수많은 서열에 대한 분석에는 많은 저장장치 및 주기억장치가 필요하므로 슈퍼컴퓨터 급의 서버와 대량의 데이터를 빠르게 처리할 수 있는 프로그램이 필요하다. 이러한 분석에는 염기서열 일치 검색과 이를 기반으로 하는 Alignment와 Assembly 분석이 있으며, 이를 수행하는 기존의 알고리즘 및 대부분의 프로그램들은 염기서열을 문자열로 취급하고, 해쉬 인덱스 테이블, Brujin 그래프의 사용, 버러우즈 휠러 변환(BWT) 등의 기법을 활용하여 효율적인 분석을 도모하였다. 본 논문에서는 염기서열을 문자열이 아닌 k-mer 묶음의 정수형 하나로 변환하여 검색함으로써 저장 공간의 크기를 약 28% 이상으로 줄이고 형 변환 상태에서의 검색을 수행할 수 있는 알고리즘을 제안한다. Assembly 분석 프로그램인 CalcGen 프로그램을 개발하여 본 알고리즘의 효용성 및 효율성을 실험을 통해 검증하였다. 이 연구의 결과는 향후 대량의 유전체 염기서열의 효율적 분석과 저장 및 처리에 또 하나의 새로운 접근 방법을 제안하는데에 그 의미를 둘 수 있다.

An Efficient Complex Event Detection Algorithm based on NFA_HTS for Massive RFID Event Stream

  • Wang, Jianhua;Liu, Jun;Lan, Yubin;Cheng, Lianglun
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.989-997
    • /
    • 2018
  • Massive event stream brings us great challenges in its volume, velocity, variety, value and veracity. Picking up some valuable information from it often faces with long detection time, high memory consumption and low detection efficiency. Aiming to solve the problems above, an efficient complex event detection method based on NFA_HTS (Nondeterministic Finite Automaton_Hash Table Structure) is proposed in this paper. The achievement of this paper lies that we successfully use NFA_HTS to realize the detection of complex event from massive RFID event stream. Specially, in our scheme, after using NFA to capture the related RFID primitive events, we use HTS to store and process the large matched results, as a result, our scheme can effectively solve the problems above existed in current methods by reducing lots of search, storage and computation operations on the basis of taking advantage of the quick classification and storage technologies of hash table structure. The simulation results show that our proposed NFA_HTS scheme in this paper outperforms some general processing methods in reducing detection time, lowering memory consumption and improving event throughput.

Ship Loading Plan for Tandem Crane in Container Terminals (탠덤 크레인을 고려한 컨테이너터미널 선적 계획)

  • Kwon, Sun-Cheol;Shin, Jae-Young;Kim, Sang-Jin
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2009.06a
    • /
    • pp.167-168
    • /
    • 2009
  • As the rapid increase of the container trade, most of the container terminals strive to improve the container handling productivity. Therefore, they consider to find efficient operating strategies and to introduce new container handling facilities. In terms of equipment, there are a variety of types of quay cranes. Single-lift crane operates only one container regardless of size and twin-lift crane operates two 20' containers or one 40' container simultaneously. Tandem crane, recently introduced, can operate four 20' containers or two 40' containers simultaneously. In this paper, we propose the mathematical model and the solution procedure of the ship loading scheduling problem for the tandem crane.

  • PDF

An Integration Algorithm of X-tree and kd-tree for Efficient Retrieval of Spatial Database (공간 데이터베이스의 효율적인 검색을 위한 X-트리와 kd-트리의 병합 알고리즘)

  • Yoo, Jang-Woo;Shin, Young-Jin;Jung, Soon-Key
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3469-3476
    • /
    • 1999
  • In spatial database based on spatial data structures, instead of one-dimensional indexing structure, new indexing structure which corresponds to multi-dimensional features of spatial objects is required. In order to meet those requirements, in this paper we proposed new indexing structure for efficient retrieval of spatial database by carrying through the feature analysis of conventional multi-dimensional indexing structures. To improve the sequential search method of supernodes in the conventional X-tree and to reduce the retrieval time in case of generating the huge supernode, we proposed a indexing structure integrating the kd-tree based on point index structure into the X-tree. We implemented the proposed indexing structure and analyzed its retrieval time according to the dimension and distribution of experimental data.

  • PDF

Methods for Assessing the Innovative Capacity of Agri-food Enterprises

  • Orlova-Kurilova, Olga;Liubimov, Ivan;Yaremovich, Petr;Safronska, Iryna;Voron'ko-Nevidnycha, Tetiana;Dziuba, Mykola;Serhiienko, Serhii;Tkachenko, Volodymyr
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12spc
    • /
    • pp.503-512
    • /
    • 2021
  • The article proposes a methodical approach to assessing the innovative capacity of agri-food enterprises. This approach is based on the calculation of personnel, investment, technical and technological, information components of the ability of agri-food enterprises to innovate. The algorithm of search of production, intellectual, financial, information resources reserves, which are necessary for functioning of the enterprises of agro-food sphere, is defined. The approach developed by the authors, in contrast to the existing ones in the scientific world, allows the tools of mathematical modeling to identify shortcomings in the development of agri-food enterprises, to forecast the development of these enterprises and on this basis to form different models of market stakeholders. The method proposed by the authors to assess the innovative capacity of agri-food enterprises allows market participants to assess the current state of agri-food enterprises and form the necessary management levers to influence its activities to eliminate market failures and pitfalls.

Classification method for failure modes of RC columns based on key characteristic parameters

  • Yu, Bo;Yu, Zecheng;Li, Qiming;Li, Bing
    • Structural Engineering and Mechanics
    • /
    • v.84 no.1
    • /
    • pp.1-16
    • /
    • 2022
  • An efficient and accurate classification method for failure modes of reinforced concrete (RC) columns was proposed based on key characteristic parameters. The weight coefficients of seven characteristic parameters for failure modes of RC columns were determined first based on the support vector machine-recursive feature elimination. Then key characteristic parameters for classifying flexure, flexure-shear and shear failure modes of RC columns were selected respectively. Subsequently, a support vector machine with key characteristic parameters (SVM-K) was proposed to classify three types of failure modes of RC columns. The optimal parameters of SVM-K were determined by using the ten-fold cross-validation and the grid-search algorithm based on 270 sets of available experimental data. Results indicate that the proposed SVM-K has high overall accuracy, recall and precision (e.g., accuracy>95%, recall>90%, precision>90%), which means that the proposed SVM-K has superior performance for classification of failure modes of RC columns. Based on the selected key characteristic parameters for different types of failure modes of RC columns, the accuracy of SVM-K is improved and the decision function of SVM-K is simplified by reducing the dimensions and number of support vectors.

Development of Machine Learning Based Seismic Response Prediction Model for Shear Wall Structure considering Aging Deteriorations (경년열화를 고려한 전단벽 구조물의 기계학습 기반 지진응답 예측모델 개발)

  • Kim, Hyun-Su;Kim, Yukyung;Lee, So Yeon;Jang, Jun Su
    • Journal of Korean Association for Spatial Structures
    • /
    • v.24 no.2
    • /
    • pp.83-90
    • /
    • 2024
  • Machine learning is widely applied to various engineering fields. In structural engineering area, machine learning is generally used to predict structural responses of building structures. The aging deterioration of reinforced concrete structure affects its structural behavior. Therefore, the aging deterioration of R.C. structure should be consider to exactly predict seismic responses of the structure. In this study, the machine learning based seismic response prediction model was developed. To this end, four machine learning algorithms were employed and prediction performance of each algorithm was compared. A 3-story coupled shear wall structure was selected as an example structure for numerical simulation. Artificial ground motions were generated based on domestic site characteristics. Elastic modulus, damping ratio and density were changed to considering concrete degradation due to chloride penetration and carbonation, etc. Various intensity measures were used input parameters of the training database. Performance evaluation was performed using metrics like root mean square error, mean square error, mean absolute error, and coefficient of determination. The optimization of hyperparameters was achieved through k-fold cross-validation and grid search techniques. The analysis results show that neural networks and extreme gradient boosting algorithms present good prediction performance.

A Study on the Effect of On-Dock System in Container Terminals - Focusing on GwangYang Port - (컨테이너터미널에서 On-Dock 시스템 효과분석에 관한 연구 - 광양항을 중심으로 -)

  • Cha, Sang-Hyun;Noh, Chang-Kyun
    • Journal of Navigation and Port Research
    • /
    • v.39 no.1
    • /
    • pp.45-53
    • /
    • 2015
  • These days Container Terminals are focusing on increasing the quantity of containers and shipping lines choose Terminals by referring to the key elements of a terminal to perform the overall operation the fastest such as the location of the terminal, discharging ability, keeping environment, and other elements related to shipping in general. Container terminal is able to offer On-Dock service has become an important factor for shipping lines to choose that terminal. In this paper, we propose an algorithm for On-Dock system work algorithm, the algorithm Empty container exports, Full Container algorithm and The aim of our study focus on both container's gate out time and search for the effective terminal operation which is using the general On-Dock system through several algorithm like container batch priority, gate in and out job priority and empty container yard equipment allocation rule based on the automatic allocation method and manual allocation scheme for container. Gathering these information, it gives the priority and yard location of gate-out containers to control. That is, by selecting an optimum algorithm container, container terminals Empty reduces the container taken out time, it is possible to minimize unnecessary re-handling of the yard container can be enhanced with respect to the efficiency of the equipment. Operations and operating results of the Non On-Dock and On-Dock system is operated by the out work operations (scenarios) forms that are operating in the real Gwangyang Container Terminal derived results. Gwangyang Container terminal and apply the On-Dock system, Non On-Dock can be taken out this time, about 5 minutes more quickly when applying the system. when managing export orders for berths where On-Dock service is needed, ball containers are allocated and for import cargoes, D/O is managed and after carryout, return management, container damage, cleaning, fixing and controlling services are supported hence the berth service can be strengthened and container terminal business can grow.

Estimation of Genetic Parameters for Carcass Traits in Hanwoo Steer (거세한우의 도체형질에 대한 유전모수 추정)

  • Yoon, H.B.;Kim, S.D.;Na, S.H.;Chang, U.M.;Lee, H.K.;Jeon, G.J.;Lee, D.H.
    • Journal of Animal Science and Technology
    • /
    • v.44 no.4
    • /
    • pp.383-390
    • /
    • 2002
  • The data were consisted of 1,262 records for carcass traits observed at Hanwoo steers from 1998 to 2001 at Namwon and Deakwanryung branch of National Livestock Research Institute, Rural Development Administration. Pedigrees of young bulls were traced back to search for magnifying inbreeding. Genetic parameters for carcass traits with Gibbs sampling in a threshold animal model were compared to estimates with REML algorithm in linear model. As the results, most of bulls were not inbred and sire pedigree group was non-inbred population. However, most of the bulls fell in some relationship with each other. Heritability estimates as fully posterior means by Gibbs samplers in threshold model were higher than those by REML in linear model. Furthermore, these estimates in threshold model using GS showed higher estimates than estimates using tested young bulls in previous study and same model. Heritability estimate by GS for marbling score was 0.74 and genetic correlation estimate between marbling score and body weight at slaughter was –0.44. Further study for correlation of breeding values between REML algorithm in linear model and Gibbs sampling algorithm in threshold model was needed.

A Study on the Efficient Algorithm for Converting Range Matching Rules into TCAM Entries in the Packet Filtering System (패킷 필터링 시스템에서 범위 규칙의 효율적 TCAM 엔트리 변환 알고리즘 연구)

  • Kim, Yong-Kwon;Cho, Hyun-Mook;Choe, Jin-Kyu;Lee, Kyou-Ho;Ki, Jang-Geun
    • Journal of IKEEE
    • /
    • v.9 no.1 s.16
    • /
    • pp.19-30
    • /
    • 2005
  • Packet classification is defined as the action to match the packet with a set of predefined rules. One of classification is to use Ternary Content Addressable Memory hardware search engine that has faster than other algorithmic methods. However, TCAM has some limitations. One of them is that TCAM can not perform range matching efficiently. A range has to be expanded into prefixes to fit the boundary. In general, the number of expansion could be up to 2w-2, where w is the width of the field. For example, if two range fields with 16 bits are used, there could be up to $30\;{\times}\;30\;=\;900$ expansions for a single rule. In this paper, we describe the novel algorithm for converting range matching rules into TCAM entry efficiently. The number of maximum entry is 2w-4 when using the algorithm. Furthermore, it has also benefit about the negation range. In the result of experimentation, the new scheme practically reduces 14 percent in case that searched fields are source port and destination port number.

  • PDF