• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.630-637
• /
• 2003

This paper proposed a new watermarking algorithm using chaotic sequence instead of conventional M-sequence for protecting copyright to the author. Robustness and security is very important for watermarking process. We use multi-threshold value according to the human visual system for improving robustness of watermarking to each subband images coefficient differently after wavelet transform. And then, we embedded watermark image to original image by multi-watermark weights which are made by random sequence generator. We detect watermark image from the difference data which is made from each wavelet subband images. We also simulate the efficiency from the various possible attacks. Chaotic sequence is better than M-sequence, because the one is very easy to make sequence and the chaotic sequence is changed easy according to the initial value. So, the chaotic sequence has the better security than the conventional M-sequence.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.4
• /
• pp.121-128
• /
• 2018

A Korean morphological analyzer adopts sequence-to-sequence (seq2seq) model, which can generate an output sequence of different length from an input. In general, a seq2seq based Korean morphological analyzer takes a syllable-unit based sequence as an input, and output a syllable-unit based sequence. Syllable-based morphological analysis has the advantage that unknown words can be easily handled, but has the disadvantages that morpheme-based information is ignored. In this paper, we propose a reranking model as a post-processor of seq2seq model that can improve the accuracy of morphological analysis. The seq2seq based morphological analyzer can generate K results by using a beam-search method. The reranking model exploits morpheme-unit embedding information as well as n-gram of morphemes in order to reorder K results. The experimental results show that the reranking model can improve 1.17% F1 score comparing with the original seq2seq model.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.46-50
• /
• 2006

According to the advancement of experimental techniques in molecular biology, genomic and protein sequence databases are increasing in size exponentially, and mean sequence lengths are also increasing. Because the sizes of these databases become larger, it is difficult to search similar sequences in biological databases with significant homologies to a query sequence. In this paper, we present the N-gram indexing method to retrieve similar sequences fast, precisely and comparably. This method regards a protein sequence as a text written in language of 20 amino acid codes, adapts N-gram tokens of fixed-length as its indexing scheme for sequence strings. After such tokens are indexed for all the sequences in the database, sequences can be searched with information retrieval algorithms. Using this new method, we have developed a protein sequence search system named as ProSeS (PROtein Sequence Search). ProSeS is a protein sequence analysis system which provides overall analysis results such as similar sequences with significant homologies, predicted subcellular locations of the query sequence, and major keywords extracted from annotations of similar sequences. We show experimentally that the N-gram indexing approach saves the retrieval time significantly, and that it is as accurate as current popular search tool BLAST.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.952-958
• /
• 1994

In this paper a method calculates the time offset between a binary sequence and its shifted sequence based on the number theoretic approach is presented. Using this method the time offset between a binary sequence and its shifted sequence can be calculated. It has been recongnized that the defining the reference (zero-offset) sequence is important in synchronous code division multiple access(CDMA) system since the same spreading sequence are used by the all base station. The time offset of the sequence with respect to the zero offset sequence are used to distinguish signal received at a mobile station from different base stations. This paper also discusses a method that defines the reference sequence.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.18
• /
• pp.59-69
• /
• 1988

This study represents the method of application of W.S(Work Sampling) to determine job sequence. The result shows job sequence which has the came performance measure of optimal job sequence is selected by average number of 199 sampling. In the case, the optimal job sequence is not selected within the sampling number of 921 which satisfy the reliability of 99.5% and precision of 99%, the deviation is very little which 0.73%. This improves the possibility of application of W.S method to select optimal job sequence is very high.

• Journal of Life Science
• /
• v.9 no.2
• /
• pp.9-14
• /
• 1999

Pseudomonas iodinum IFO 3558 adenosine deaminase(ADA) gene was cloned by the polymerase chain reaction and deduced the amino acid sequence of the enzyme. DNA sequence homology of Pseudomonas iodinum IFO 3558 ADA gene was compared to those of E. coli, human and mouse ADA genes. Unambiguous sequence from both strands of pM21 was obtained for the region believed to encode ADA. The sequence included a 804-nucleotide open reading frame, bounded on one end by sense primer and on the other end by two antisense primer. This open reading frame encodes a protein of 268 amino acids having a molecular weight of 29,448. The deduced amino acid sequence shows considerable similarity to those of E. coli, mouse and human ADA. Pseudomonas iodinum IFO 3558 nucleotide sequence shows 98.5% homology with that of the E. coli ADA sequence and 51.7% homology with that of the mouse ADA sequence and 52.5% homology with that of the human ADA sequence. The ADA protein sequence of Pseudomonas iodinum IFO 3558 shows 96.9% homology with that of the E. coli and 40.7% homology with that of the mouse and 41.8% homology with that of the human. The distance between two of the conserved elements, TVHAGE and SL(1)NTDDP has veen exactly conserved at 76 amino acids for all four ADAs. Two of the four conserved sequence elements shared among the four ADAs are also present in the yeast, rat, human (M), and Human(L) AMP deaminase. The SLSTDDP sequence differs only in the conservative substitution of a serine for an asparagine. A conserved cysteine with conserved spacing between these two regions is also found. Thus, sequence analysis of four ADAs and four AMP deaminases revealed the presence of a highly conserved sequence motif, SLN(S)TDDP, a conserved dipeptide, HA, and a conserved cysteine residue.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.4
• /
• pp.244-253
• /
• 2001

For more complete process planning, machining sequence determination is critical to attain machining economics. Although many studies have been conducted in recent years, most of them suggests the non-unique machining sequences. When the tool approach directions(TAD) are considered fur a feature, both machining time and number of setups can be reduced. Then, the unique machining sequence can be extracted from alternate(non-unique) sequences by minimizing the idle time between operations within a sequence. This study develops an algorithm to generate the best machining sequence for composite prismatic features in a vertical milling operation. The algorithm contains five steps to produce an unique sequence: a precedence relation matrix(PRM) development, tool approach direction determination, machining time calculation, alternate machining sequence generation, and finally, best machining sequence generation with idle times. As a result, the study shows that the algorithm is effective for a given composite feature and can be applicable fur other prismatic parts.

• Korean Journal of Computational Design and Engineering
• /
• v.18 no.6
• /
• pp.417-427
• /
• 2013

Assembly direction is used in order to confirm the generated assembly sequences in an automatic assembly sequence planning system. Moreover, assembly sequence planners can ascertain the feasibility of a sequence during simulation with assembly direction based in a CAD environment. In other words, assembly direction is essential for sequence optimizing and automatic generation. Based on the importance of assembly direction, this paper proposes a method to select the best direction for the generated assembly sequence using disassembly simulation and geometrical common area between assembled parts. Simultaneously, this idea can be applied to verify the generated assembly sequence. In this paper, the automatic selection of assembly direction and sequence correction system is designed and implemented. The developed algorithms and the implemented system are verified based on case study in the CAD environment.

• IE interfaces
• /
• v.14 no.3
• /
• pp.247-254
• /
• 2001

As current postal automation is limited to dispatch and arrival sorting, delivery sequence sorting is performed manually by each postman. It not only acts as a bottleneck process in the overall mailing process but is expensive operation. To cope with this problem effectively, delivery sequence sorting automation is required. The important components of delivery sequence sorting automation system are sequence sorter and Hangul OCR which function is to extract the address of delivery point. DSI database will be interfaced to both Hangul OCR and sequence sorter for finding the accurate delivery sequence number and stacker number. The objectives of this research are to develop DSI(Delivery Sequence Information) database prototype and client application for managing information effectively. For database requirements collection and analysis, we draw all possible sorting plans, and apply the AHP(Analytic Hierarchy Process) method to determine the optimal one. And then, we design DSI database schema based on the optimal one and implement it using Oracle RDBMS. In addition, as address information in DIS database consist of hierarchical structure which has its correspondence sequence number, so it is important to reorganize sequence information accurately when address information is inserted, deleted or updated. To increase delivery accuracy, we reflect this point in writing application.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.