• 제목/요약/키워드: sequence-based method

검색결과 1,738건 처리시간 0.03초

Displacement prediction in geotechnical engineering based on evolutionary neural network

  • Gao, Wei;He, T.Y.
    • Geomechanics and Engineering
    • /
    • 제13권5호
    • /
    • pp.845-860
    • /
    • 2017
  • It is very important to study displacement prediction in geotechnical engineering. Nowadays, the grey system method, time series analysis method and artificial neural network method are three main methods. Based on the brief introduction, the three methods are analyzed comprehensively. Their merits and demerits, applied ranges are revealed. To solve the shortcomings of the artificial neural network method, a new prediction method based on new evolutionary neural network is proposed. Finally, through two real engineering applications, the analysis of three main methods and the new evolutionary neural network method all have been verified. The results show that, the grey system method is a kind of exponential approximation to displacement sequence, and time series analysis is linear autoregression approximation, while artificial neural network is nonlinear autoregression approximation. Thus, the grey system method can suitably analyze the sequence, which has the exponential law, the time series method can suitably analyze the random sequence and the neural network method almostly can be applied in any sequences. Moreover, the prediction results of new evolutionary neural network method is the best, and its approximation sequence and the generalization prediction sequence are all coincided with the real displacement sequence well. Thus, the new evolutionary neural network method is an acceptable method to predict the measurement displacements of geotechnical engineering.

CDMA 시스템을 위한 정수론 접근 방법에 의한 주기이진부호의 사건?? 계산 (Periodic Binary Sequence Time Offset Calculation Based on Number Theoretic Approach for CDMA System)

  • 한영열
    • 한국통신학회논문지
    • /
    • 제19권5호
    • /
    • pp.952-958
    • /
    • 1994
  • 본 논문에서 정수론에 기초한 이진수호와 이전된 이진부호 사이의 시간옵셉을 계산하는 방법을 제시한다. 이 방법을 이용하여 이진부호 사이의 시간옵셉을 계산할 수 있다. 모든 기지국은 동일한 확산부호를 사용하므로써 동기 부호분할 다원접속 시스템에서 기준(영 \ulcorner\ulcornerV)부호를 정의하는 것은 중요하다. 다른 기지국으로부터 이동국에 수신되는 신호를 구별하기 위하여 영옵셉부호에 대한 시간옵셉을 사용하고 있다. 본 논문은 기준부호를 정의하는 방법을 제시한다.

  • PDF

반음절기반의 한국어 연속숫자음인식과 그 후처리에 대한 연구 (A Study on Korean Connected Digit Recognizer Based on Semi-syllable and Post-processing)

  • 정재부;정훈;정익주
    • 음성과학
    • /
    • 제8권4호
    • /
    • pp.1-15
    • /
    • 2001
  • This paper describes the effect of new recognition unit, a unit based on semisyllable, and its post processing method. A recognition unit based on semi-syllable expresses Korean connected digit's coarticulation effect. An existing method using semi-syllable limits next models, derived from current recognized models, to make complete connected digit sequence. However, this paper uses a new method to make complete connected digit sequence. The new post-processing method recognizes isolated digit words which include digits sequence from the digit combinations being able to occur from current recognized semi-syllable sequence. This method gives an improved accuracy rate than that of existing method. This new post processing provides two advantages. 1) It corrects current mis-recognized semi-syllable unit. 2) When people say each digit, they say it without regard to saying duration.

  • PDF

유전자 알고리즘을 이용한 조립순서 추론 (Assembly sequence generation using genetic algorithm)

  • 홍대선;조형석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
    • /
    • pp.1267-1270
    • /
    • 1997
  • An assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying assembly constraints. to generate such sequences for robotic assembly, this paper proposes a method using a genetic algorithm (GA). This method denotes an assembly sequence as an individual, which is assigned a fitness related to the assembly cost. Then, a population consisting of a number of individuals evolves to the next generation through genetic operations of crossover and mutation based upon the fitness of the individuals. The population continues to repetitively evolve, and finally the fittest individual and its corresponding assembly sequence is found. Through case study for an electrical relay, the effectiveness of the proposed method is demonstrated. Also, the performance is evaluated by-comparing with those of previously presented approaches such as a neural-netowork-based method and a simulated annealing method.

  • PDF

비접지 배전계통에서 영상전류 위상 비교에 의한 고장구간 검출 방법 (A Fault Section Detection Method for Ungrounded System Based on Phase Angle Comparison of Zero-Sequence Current)

  • 양하;최면송;이승재
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 제38회 하계학술대회
    • /
    • pp.31-32
    • /
    • 2007
  • In this paper, a fault section detection method is proposed for ungrounded system in the case of a single line-to-ground fault. A conventional method is used for faulted feeder selection according to the angular relationship between zero-sequence currents of the feeders and zero-sequence voltage of the system. Fault section detection is based on the comparison of phase angle of zero-sequence current. Proposed method has been testified in a demo system by Matlab/Simulink simulations. Based on Distribution Automation System(DAS), Feeder Remote Terminal Unit(FRTU) is used to collect those necessary data, at present a demo system is under developing using Manufacturing Message Specification (MMS) in IEC61850 standard.

  • PDF

집합 유사 시퀀스 매칭의 성능 향상을 위한 인덱스 기반 검색 방법 (An Index-Based Search Method for Performance Improvement of Set-Based Similar Sequence Matching)

  • 이주원;임효상
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제6권11호
    • /
    • pp.507-520
    • /
    • 2017
  • 집합 유사 시퀀스 매칭 방법은 유사한 정도를 나타내는 척도로 교집합을 기반으로 한 유사도를 사용한다. 그러나 교집합 크기를 계산하는 과정에 시간이 오래 걸릴 뿐만 아니라, 유사한 시퀀스를 찾기 위해서 수많은 집합 간 교집합 크기를 구해야 하므로 수행 시간이 오래 걸리는 성능상의 문제가 있다. 본 논문에서는 이러한 성능상의 문제를 해결하기 위해 인덱스 기반의 검색 방법을 사용하여 집합 기반 유사 시퀀스 매칭을 빠르게 수행하는 방법을 제안한다. 제안하는 방법은 크게 두가지로 구분된다. 첫 번째로 집합 시퀀스 유사도 문제를 교집합의 크기 비교 문제로 정형적으로 변환하고, 교집합의 크기를 빠르게 찾을 수 있는 인덱스 구조를 제안한다. 두 번째로 제안한 인덱스 구조를 사용하여 집합 기반 유사 시퀀스 매칭을 효율적으로 수행할 수 있는 방법을 제안한다. 성능 평가 결과, 제안하는 방법이 기존 방법에 비해 최대 30배에서 50배의 수행 시간 단축이 있음을 보인다. 또한 데이터 시퀀스의 개수가 증가할수록 수행시간의 차이가 점점 커지므로, 대용량 데이터 처리에 적절함을 보인다.

다중서열정렬의 유사도 매칭을 이용한 순서기반 침입탐지 (Sequence based Intrusion Detection using Similarity Matching of the Multiple Sequence Alignments)

  • 김용민
    • 정보보호학회논문지
    • /
    • 제16권1호
    • /
    • pp.115-122
    • /
    • 2006
  • 대부분의 침입탐지 방법은 알려진 침입 정보를 축적하고 임의의 행위 데이터에 대해 침입 여부를 결정하는 오용행위 탐지의 방법에 기반하고 있다. 그러나 생성된 공격행위 패턴은 새로운 공격 및 변형된 공격행위에 대응하는 방법에 어려움이 있다. 현실적으로 비정상행위 탐지기법의 높은 오탐을 고려하면, 대용량 순서기반 침입패턴은 알려진 공격에 대한 탐지와 함께 침입패턴의 유사도를 측정하는 방법의 보완을 통해 변형된 공격 및 새로운 공격에 대한 탐지의 가능성을 높이는 대책이 요구된다. 본 논문에서는 순서기반 침입패턴의 유사성 매칭을 위해 다중서열정렬 기법을 적용하는 방법을 제안한다. 그 기법은 침입패턴 서열의 통계적 분석을 가능하게 하고 구현이 용이하며, 서열 크기의 변경에 따라 공격에 대한 탐지 경보 및 오탐의 수를 줄이는 결과를 보였다.

Ship block assembly sequence planning considering productivity and welding deformation

  • Kang, Minseok;Seo, Jeongyeon;Chung, Hyun
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제10권4호
    • /
    • pp.450-457
    • /
    • 2018
  • The determination of assembly sequence in general mechanical assemblies plays an important role in terms of manufacturing cost, duration and quality. In the production of ships and offshore plants, the consideration of productivity factors and welding deformation is crucial in determining the optimal assembly sequence. In shipbuilding and offshore industries, most assembly sequence planning has been done according to engineers' decisions based on extensive experience. This may result in error-prone planning and sub-optimal sequence, especially when dealing with unfamiliar block assemblies composed of dozens of parts. This paper presents an assembly sequence planning method for block assemblies. The proposed method basically considers geometric characteristics of blocks to determine feasible assembly sequences, as well as assembly process and productivity factors. Then the assembly sequence with minimal welding deformation is selected based on simplified welding distortion analysis. The method is validated using an asymmetric assembly model and the results indicate that it is capable of generating an optimal assembly sequence.

Reference String Recognition based on Word Sequence Tagging and Post-processing: Evaluation with English and German Datasets

  • Kang, In-Su
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권5호
    • /
    • pp.1-7
    • /
    • 2018
  • Reference string recognition is to extract individual reference strings from a reference section of an academic article, which consists of a sequence of reference lines. This task has been attacked by heuristic-based, clustering-based, classification-based approaches, exploiting lexical and layout characteristics of reference lines. Most classification-based methods have used sequence labeling to assign labels to either a sequence of tokens within reference lines, or a sequence of reference lines. Unlike the previous token-level sequence labeling approach, this study attempts to assign different labels to the beginning, intermediate and terminating tokens of a reference string. After that, post-processing is applied to identify reference strings by predicting their beginning and/or terminating tokens. Experimental evaluation using English and German reference string recognition datasets shows that the proposed method obtains above 94% in the macro-averaged F1.

New Construction Method for Quaternary Aperiodic, Periodic, and Z-Complementary Sequence Sets

  • Zeng, Fanxin;Zeng, Xiaoping;Zhang, Zhenyu;Zeng, Xiangyong;Xuan, Guixin;Xiao, Lingna
    • Journal of Communications and Networks
    • /
    • 제14권3호
    • /
    • pp.230-236
    • /
    • 2012
  • Based on the known binary sequence sets and Gray mapping, a new method for constructing quaternary sequence sets is presented and the resulting sequence sets' properties are investigated. As three direct applications of the proposed method, when we choose the binary aperiodic, periodic, and Z-complementary sequence sets as the known binary sequence sets, the resultant quaternary sequence sets are the quaternary aperiodic, periodic, and Z-complementary sequence sets, respectively. In comparison with themethod proposed by Jang et al., the new method can cope with either both the aperiodic and periodic cases or both even and odd lengths of sub-sequences, whereas the former is only fit for the periodic case with even length of sub-sequences. As a consequence, by both our and Jang et al.'s methods, an arbitrary binary aperiodic, periodic, or Z-complementary sequence set can be transformed into a quaternary one no matter its length of sub-sequences is odd or even. Finally, a table on the existing quaternary periodic complementary sequence sets is given as well.