• Title/Summary/Keyword: sequence-to-sequence model

Search Result 1,626, Processing Time 0.033 seconds

Application of Sequence Diagrams to the Reverse Engineering Process of the ESf-ccs

  • Hasan, Md. Mehedi;Elakrat, Mohamed;Mayaka, Joyce;Jung, Jae Cheon
    • Journal of the Korean Society of Systems Engineering
    • /
    • v.15 no.1
    • /
    • pp.1-8
    • /
    • 2019
  • Reverse engineering involves examining a system or component so as to comprehend its structure, functionality, and operation. Creation of a system model in reverse engineering can serve several purposes: test generation, change impact analysis, and the creation of a new or modified system. When attempting to reverse engineering a system, often the most readily accessible information is the system description, which does not readily lend itself to use in Model Based System Engineering (MBSE). Therefore, it is necessary to be able to transform this description into a diagram, which clearly depicts the behavior of the system as well as the interaction between components. This study demonstrates how sequence diagrams can be extracted from the systems description. Using MBSE software, the sequence diagrams for the Engineered Safety Features Component Control System (ESF-CCS) of the Nuclear Power Plant are created. Sequence diagrams are chosen because they are a means of representing the systems behavior and the interaction between components. In addition, from these diagrams, the system's functional requirements can be elicited. These diagrams then serve as the baseline of the reverse engineering process and multiple system views are subsequently be created from them, thus speeding up the development process. In addition, the use of MBSE ensures that any additional information obtained from auxiliary sources can then be input into the system model, ensuring data consistency.

A study on the speech recognition by HMM based on multi-observation sequence (다중 관측열을 토대로한 HMM에 의한 음성 인식에 관한 연구)

  • 정의봉
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.4
    • /
    • pp.57-65
    • /
    • 1997
  • The purpose of this paper is to propose the HMM (hidden markov model) based on multi-observation sequence for the isolated word recognition. The proosed model generates the codebook of MSVQ by dividing each word into several sections followed by dividing training data into several sections. Then, we are to obtain the sequential value of multi-observation per each section by weighting the vectors of distance form lower values to higher ones. Thereafter, this the sequential with high probability value while in recognition. 146 DDD area names are selected as the vocabularies for the target recognition, and 10LPC cepstrum coefficients are used as the feature parameters. Besides the speech recognition experiments by way of the proposed model, for the comparison with it, the experiments by DP, MSVQ, and genral HMM are made with the same data under the same condition. The experiment results have shown that HMM based on multi-observation sequence proposed in this paper is proved superior to any other methods such as the ones using DP, MSVQ and general HMM models in recognition rate and time.

  • PDF

Existence Condition for the Stationary Ergodic New Laplace Autoregressive Model of order p-NLAR(p)

  • Kim, Won-Kyung;Lynne Billard
    • Journal of the Korean Statistical Society
    • /
    • v.26 no.4
    • /
    • pp.521-530
    • /
    • 1997
  • The new Laplace autoregressive model of order 2-NLAR92) studied by Dewald and Lewis (1985) is extended to the p-th order model-NLAR(p). A necessary and sufficient condition for the existence of an innovation sequence and a stationary ergodic NLAR(p) model is obtained. It is shown that the distribution of the innovation sequence is given by the probabilistic mixture of independent Laplace distributions and a degenrate distribution.

  • PDF

Bio-mimetic Recognition of Action Sequence using Unsupervised Learning (비지도 학습을 이용한 생체 모방 동작 인지 기반의 동작 순서 인식)

  • Kim, Jin Ok
    • Journal of Internet Computing and Services
    • /
    • v.15 no.4
    • /
    • pp.9-20
    • /
    • 2014
  • Making good predictions about the outcome of one's actions would seem to be essential in the context of social interaction and decision-making. This paper proposes a computational model for learning articulated motion patterns for action recognition, which mimics biological-inspired visual perception processing of human brain. Developed model of cortical architecture for the unsupervised learning of motion sequence, builds upon neurophysiological knowledge about the cortical sites such as IT, MT, STS and specific neuronal representation which contribute to articulated motion perception. Experiments show how the model automatically selects significant motion patterns as well as meaningful static snapshot categories from continuous video input. Such key poses correspond to articulated postures which are utilized in probing the trained network to impose implied motion perception from static views. We also present how sequence selective representations are learned in STS by fusing snapshot and motion input and how learned feedback connections enable making predictions about future input sequence. Network simulations demonstrate the computational capacity of the proposed model for motion recognition.

Physical Database Design for DFT-Based Multidimensional Indexes in Time-Series Databases (시계열 데이터베이스에서 DFT-기반 다차원 인덱스를 위한 물리적 데이터베이스 설계)

  • Kim, Sang-Wook;Kim, Jin-Ho;Han, Byung-ll
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.11
    • /
    • pp.1505-1514
    • /
    • 2004
  • Sequence matching in time-series databases is an operation that finds the data sequences whose changing patterns are similar to that of a query sequence. Typically, sequence matching hires a multi-dimensional index for its efficient processing. In order to alleviate the dimensionality curse problem of the multi-dimensional index in high-dimensional cases, the previous methods for sequence matching apply the Discrete Fourier Transform(DFT) to data sequences, and take only the first two or three DFT coefficients as organizing attributes of the multi-dimensional index. This paper first points out the problems in such simple methods taking the firs two or three coefficients, and proposes a novel solution to construct the optimal multi -dimensional index. The proposed method analyzes the characteristics of a target database, and identifies the organizing attributes having the best discrimination power based on the analysis. It also determines the optimal number of organizing attributes for efficient sequence matching by using a cost model. To show the effectiveness of the proposed method, we perform a series of experiments. The results show that the Proposed method outperforms the previous ones significantly.

  • PDF

A Study on the Extended Engineering BOM for Generating Assembly Sequence (조립 순서 모델을 고려한 확장된 엔지니어링 BOM에 관한 연구)

  • 장현수
    • Journal of the Korea Safety Management & Science
    • /
    • v.2 no.1
    • /
    • pp.77-87
    • /
    • 2000
  • BOM has been widely used to manufacturing, product design and scheduling. There are several bug differences between Manufacturing BOM and Engineering BOM, which cause a lot of problems. A study to integrate both manufacturing BOM and Engineering BOM is researching to solve those problems. Therefore, this research presents a extended Engineering BOM concepts considering assembly sequence model.

  • PDF

Technical Issues in Pattern Machining (패턴 가공에서의 기술적인 고려사항)

  • 김보현;최병규
    • Korean Journal of Computational Design and Engineering
    • /
    • v.6 no.4
    • /
    • pp.263-270
    • /
    • 2001
  • In stamping-die manufacturing, the first step is to build die patterns for lost wax casting process. A recent industry trend is to manufacture the die pattern using 3-axis NC machining. This study identifies technical considerations of the pattern machining caused by the characteristics of Styrofoam material, and proposes technical methods related to establishing a process plan and generating tool paths for optimizing the pattern machining. In this paper, the process plan includes the fellowing three items: 1) deter-mining a global machining sequence-a sequence of profile, top, bottom machining and two set-ups, 2) extracting machining features from a pattern model and merging them, and 3) determining a machining sequence of machining features. To each machining feature, this study determines the machining start point, generates the approach tool path, and proposes a tool path linking method fur reducing the distance of the cutter rapid motion. Finally, a smooth tool path generation and an automatic feedrate adjustment (AFA) method are introduced far raising the machining efficiency.

  • PDF

Determination and application of installation sequence of piping systems in cramped spaces of ships and offshore structures considering geometric relationship of pipe elements

  • Jang, MiSeon;Nam, Jong-Ho
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.12 no.1
    • /
    • pp.60-70
    • /
    • 2020
  • The outfitting design of ships and offshore structures is mainly undertaken in a restricted space. Pipes occupying a large portion of outfitting design are normally manufactured outside the shipyard. This complicated manufacturing process results in frequent delivery delays. Inevitable design modifications and material changes have also resulted in inefficient pipe installation works. In this study, an algorithm is proposed to systematically determine the pipe installation sequence. An accurate and fast algorithm to identify the geometric relationship of piping materials is presented. To improve the calculation efficiency, the interference is gradually examined from simplified to complicated shapes. It is demonstrated that the calculation efficiency is significantly improved with successive geometric operations such as back-face culling and use of bounding boxes. After the final installation sequence is determined, the entire installation process is visualized in a virtual reality environment so that the process can be rendered and understood for a full-scale model.

An Improved Pseudorandom Sequence Generator and its Application to Image Encryption

  • Sinha, Keshav;Paul, Partha;Amritanjali, Amritanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1307-1329
    • /
    • 2022
  • This paper proposes an improved Pseudorandom Sequence Generator (PRSG) based on the concept of modular arithmetic systems with non-integral numbers. The generated random sequence use in various cryptographic applications due to its unpredictability. Here the mathematical model is designed to solve the problem of the non-uniform distribution of the sequences. In addition, PRSG has passed the standard statistical and empirical tests, which shows that the proposed generator has good statistical characteristics. Finally, image encryption has been performed based on the sort-index method and diffusion processing to obtain the encrypted image. After a thorough evaluation of encryption performance, there has been no direct association between the original and encrypted images. The results show that the proposed PRSG has good statistical characteristics and security performance in cryptographic applications.

Channel Assignment Sequence Optimization under Fixed Channel Assignment Scheme (채널 고정 할당 방식에서 채널 할당 순서 최적화(응용 부문))

  • Han, Jung-Hee;Lee, Young-Ho;Kim, Seong-In;Kim, Yong-Jin
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.288-300
    • /
    • 2006
  • In this paper, we consider a channel ordering problem that seeks to minimize the total interference in mobile radio networks. If a base station receives connection request from a mobile user, one of the empty channels that are fixed to the base station is assigned to the mobile user. Among several channels available, we can choose one that seems to make least interference with other channels assigned to adjacent base stations. However, a pair of channels that are not separated enough do not generate interference if both of them are not simultaneously used by mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference costs are properly generated.

  • PDF