• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.17-21
• /
• 2008

As with the binary pseudo-random sequences q-ary m-sequences possess very good properties which make them useful in many applications. So we construct a class of Jacket matrices by applying additive characters of the finite field $F_q$ to entries of all shifts of q-ary m-sequence. In this paper, we generalize a method of obtaining conventional Hadamard matrices from binary PN-sequences. By this way we propose Jacket matrix construction based on q-ary M-sequences.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.237-240
• /
• 2012

Binary sequences of period $N=2^k-1$ are widely used in many areas of engineering and sciences. Some well-known applications include code-division multiple-access (CDMA) communications and stream cipher systems. In this paper, we analyze the equation $(x+1)^d=x^d+1$ over finite fields. The $d$ of the equation is used to analyze cross-correlation of binary sequences.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.196-202
• /
• 2021

DNA sequencing provides fundamental data in genomics, bioinformatics, biology and many other research areas. With the emergent evolution in DNA sequencing technology, a massive amount of genomic data is produced every day, mainly DNA sequences, craving for more storage and bandwidth. Unfortunately, managing, analyzing and specifically storing these large amounts of data become a major scientific challenge for bioinformatics. Those large volumes of data also require a fast transmission, effective storage, superior functionality and provision of quick access to any record. Data storage costs have a considerable proportion of total cost in the formation and analysis of DNA sequences. In particular, there is a need of highly control of disk storage capacity of DNA sequences but the standard compression techniques unsuccessful to compress these sequences. Several specialized techniques were introduced for this purpose. Therefore, to overcome all these above challenges, lossless compression techniques have become necessary. In this paper, it is described a new DNA compression mechanism of pattern matching extended Compression algorithm that read the input sequence as segments and find the matching pattern and store it in a permanent or temporary table based on number of bases. The remaining unmatched sequence is been converted into the binary form and then it is been grouped into binary bits i.e. of seven bits and gain these bits are been converted into an ASCII form. Finally, the proposed algorithm dynamically calculates the compression ratio. Thus the results show that pattern matching extended Compression algorithm outperforms cutting-edge compressors and proves its efficiency in terms of compression ratio regardless of the file size of the data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.4
• /
• pp.69-87
• /
• 2006

This paper proposes an effective approach for the part-machine grouping(PMG) based on the non-binary part-machine incidence matrix in which real manufacturing factors such as the operation sequences with multiple visits to the same machine and production volumes of parts are incorporated and each entry represents actual moves due to different operation sequences. The proposed approach adopts Fuzzy ART neural network to quickly create the Initial part families and their machine cells. A new performance measure to evaluate and compare the goodness of non-binary block diagonal solution is suggested. To enhance the poor solution due to category proliferation inherent to most artificial neural networks, a supplementary procedure reassigning parts and machines is added. To show effectiveness of the proposed approach to large-size PMG problems, a psuedo-replicated clustering procedure is designed. Experimental results with intermediate to large-size data sets show effectiveness of the proposed approach.

• Progress in Superconductivity
• /
• v.3 no.1
• /
• pp.83-86
• /
• 2001

We have fabricated a single flux quantum 4-stage shift register with interface-controlled $Y_1$$Ba_2$$Cu_3$$O_{7-x}$(YBCO) Josephson junction. The YBCO Josephson junctions showed RSJ-like current-voltage(I-V) curves at temperatures 45~80K. We tested load and shift operation of shift register with binary data sequences “1000”, “1010”, “1011”, and “1111” at 58K. For all the binary data sequences, the shift register operated successfully. By operating the circuit with proper current pulses, we observed no errors during at least 12 hours operation for all the data sequences.s.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.6-11
• /
• 2008

From a periodic sequence, we can obtain new sequences with a longer period by r-symbol insertion to each period. In this paper we review previous results on the linear complexity of periodic sequences obtained by r-symbol insertion. We derive the distribution of the linear complexity of 1-symbol insertion sequences obtained from m-sequences over GF(p), and prove some relationship between their linear complexity and the insertion position. Then, we analyze the k-error linear complexity of the 1-symbol insertion sequences from binary m-sequences.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.7
• /
• pp.120-127
• /
• 2003

A novel three degrees of freedom sensing method utilizing binary grid pattern image and vision camera is presented. The binary grid pattern image is designed by Pseudo-Random Binary Arrays and referenced to encode in-plane position of a moving stage of the contact-free planar actuator. First, the yaw motion of the stage is detected using fast image processing and then the other planar positions, x and y, are decoded with a sequence of images. This method can be applied to the system that needs feedback of in-plane position, with advantages of a good accuracy and high resolution comparable with the encoder, a relatively compact structure, no friction, and a low cost. In this paper, all the procedures of the above sensing mechanism are described in detail, including simulation and experiment results.

• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.48-56
• /
• 2006

This paper proposes an efficient preprocessing technique for a binary centroid tracker in correlated image sequences. It is known that the following factors determine the performance of the binary centroid target tracker: (1) an efficient real-time preprocessing technique, (2) an exact target segmentation from cluttered background images and (3) an intelligent tracking window sizing, and etc. The proposed centroid tracker consists of an adaptive segmentation method based on novel distance features and an efficient real-time preprocessing technique in order to enhance the distinction between the objects of interest and their local background. Various tracking experiments using synthetic images as well as real Forward-Looking InfraRed (FLIR) images are performed to show the usefulness of the proposed methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.27-35
• /
• 1999

In this paper, we propose an error detection scheme of phase offsets for binary sequences including PN (Pseudo Noise) sequences based on the number theoretical approach. It is important to know phase offsets of spreading sequences in the CDMA (Code Division Multiple Access) mobile communication systems because phase offsets of the same spreading sequence are used to achieve the acquisition and are used to distinguish each base station. When the period of the sequence is not very long, the relative phase offset between the sequence and its shifted replica can be found by comparing them, but as the period of the sequence increases it becomes difficult to find the phase offset. The error detection failure probability of the proposed method is derived, and it is confirmed by the simulation results. We also discuss the circuit realization of the proposed method and show it can be easily implemented.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1007-1012
• /
• 2014

Software birthmarks are used to detect software plagiarism. For binaries, however, only a few birthmarks have been developed. In this paper, we propose a static approach to generate API sequences along major paths, which are analyzed from control flow graphs of the binaries. Since our API sequences are extracted along the most plausible paths of the binary codes, they can represent actual API sequences produced from binary executions, but in a more concise form. Our similarity measures use the Smith-Waterman algorithm that is one of the popular sequence alignment algorithms for DNA sequence analysis. We evaluate our static path-based API sequence with multiple versions of five applications. Our experiment indicates that our proposed method provides a quite reliable similarity birthmark for binaries.