• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.2 no.2
• /
• pp.32-35
• /
• 2003

This paper presents a simple method to show that the committed bit based on pseudo-random sequence can be predicted with a probability very close to.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.607-609
• /
• 2004

본 논문은 시 계열 데이터에서의 연관성 발견에 있어서 복잡성과 연산량을 효과적으로 줄이며 연관성을 찾아내는 기법에 대해 기술한다. 기존의 시 계열 데이터에서의 sequence 분할 방법은 복잡한 clustering 기법을 사용하여 많은 시간과 resource를 필요로 하는 제한이 있다 이에 본 논문에서는 효과적인 sequence 분할을 위한 증감 table을 이용한 방법을 제안하였다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.325-332
• /
• 2017

In this paper, a survey of test sequence generation methods for testing the conformance of a protocol implementation to its specification is presented. The best known methods proposed in the literature are called transition tour, distinguishing sequence, characterizing sequence, and unique input/output sequence. Also, several variants of the above methods are introduced. Applications of these methods to the finite state machine model are discussed. Then, comparative analysis of the methods is made in terms of test sequence length. Finally, conclusions are given as follows. The T-method produces the shortest test sequence, but it has the worst fault coverage. The W-method tends to produce excessively long test sequences even though its fault coverage is complete. The problem with the DS-method is that a distinguishing sequence may not exist. The UIO-method is more widely applicable, but it does not provide the same fault coverage as the DS-method.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.49-57
• /
• 2006

While developing a complex reactive software system. it is very important to analyze the user requirement and reflect it to the developed system. Therefore understanding the need of users precisely and promptly is the key to the successful software system development. Among several requirement specification languages, message sequence charts (MSCs), also known as sequence diagrams in UML are the most widely used scenario notation. Live Sequence Charts (LSCs) are a variant ot MSCs, characterized by its message abstraction facility and the modality of scenarios. In this paper, I define the formal semantics of LSC specification including the essential language constructs such as pre-charts, variables, assignment and conditions. The range of the formalized LSC language has been broadened, and the scope of the formalized semantics is much closer to the complete LSC specification.

• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.32-37
• /
• 2016

In model-based testing using sequence diagrams, test cases are automatically derived from the sequence diagrams. For the generation of test cases, scenarios need to be found for representing as a sequence diagram, and to extract test paths satisfying the test coverage. However, it is hard to automatically extract test paths from the sequence diagram because a sequence diagram represents loop, opt, and alt information using CombinedFragments. To resolve this problem, we propose a transformation process that transforms a sequence diagram into an activity diagram which represents scenarios as a type of control flows. In addition, we generate test cases from the activity diagram by applying a test coverage concept. Finally, we present a case study for test cases generation from a sequence diagram.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.77-85
• /
• 2002

A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.12
• /
• pp.1910-1917
• /
• 1989

This paper shows the performances of asynchronous binary direct-sequence spread-spectrum multiple access communication systems with Rayleigh fading and White Gaussian noise. The performance measures considered are worst-case bit error probability and average SNR depending on code sequences and chip waveforms. The code sequences used are m-sequence and Gold sequence with period 31.The chip waveforms employed are rectangular, sinusoidal and something other chip waveforms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.49-51
• /
• 2003

가입자망과 메트로 광 가입자망에서 광범위한 적용범위에 대해 광 기술을 선도하는 기존의 WDM은 증가하는 사용자 수를 수용하는 데 어려움을 가지며 WDM은 채널간의 잡음에 의한 제한과 유효 채널의 최대가 WDM 채널에서 광 증폭기 이득의 균일성에 의해 제한받는다. 따라서 사용자 수를 증가시키고 데이터량을 확장시킬 수 있는 CDMA 기술 도입이 하나의 대안으로 요구된다. 본 논문에서는 SMF에서 수십 km 거리를 갖는 가입자망에서 Prime sequence code를 사용한 2.5Gb/s 광 COMA 신호의 색분산 패널티에 대해 연구하였다. 시스템 모델에서, 색분산 패널티, 파형과 디코드된 신호의 아이 다이어그램(eye diagram)이 결과로써 보여지며, prime sequence code 수의 증가에 대해 Chirp 파라미터를 갖는 코드화된 신호의 색분산 패널티를 보인다. 이러한 접근은 pseudo-orthogonality를 가지는 비동기식 광 CDMA의 디자인에 특히 적합할 것이다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.3
• /
• pp.8-15
• /
• 2014

For zero inventory and mixed assembly production, JIT (Just In Time) production system in Toyota and JIS (Just-In-Sequence) production system in Hyundai motor co. have been proposed in automobile production areas. Even though the production systems are popular in the areas, many subcontract companies producing part-modules for final production at a parent company suffers from excessive or shortage amount of inventory due to the time gap of production and delivery to the parent company. In this study, we propose an efficient real-time assembly sequence system applying a well-known Pareto method using Paint-In information in painting process and daily production planning information. Based on this system, a production line can estimate the shortage amount of UPH (Units Per Hour) at production line and recovers the amount before operating assembly production in the line. The proposed system provides efficiency on productivity compared with the previous system.

• Genomics & Informatics
• /
• v.6 no.1
• /
• pp.54-58
• /
• 2008

Genotyping Tool for Viral SEQuences (GTVseq) provides scientists with the genotype information on the viral genome sequences including HIV-1, HIV-2, HBV, HCV, HTLV-1, HTLV-2, poliovirus, enterovirus, flavivirus, Hantavirus, and rotavirus. GTVseq produces alternative and additive genotype information for the query viral sequences based on two different, but related, scoring methods. The genotype information produced is reported in a graphical manner for the reference genotype matches and each graphical output is linked to the detailed sequence alignments between the query and the matched reference sequences. GTVseq also reports the potential 'repeats' and/or 'recombination' sequence region in a separated window. GTVseq does not replace completely other well-known genotyping tools such as NCBI's virus sequence genotyping tool (http://www.ncbi. nlm.nih.gov/projects/genotyping/formpage.cgi), but provides additional information useful in the confirmation or for further investigation of the genotype(s) for the newly isolated viral sequences.