• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.13-19
• /
• 2011

Games gave the calculation method for the crosscorrelation function of a Kasami sequence and a No sequence that have been generated by the same primitive polynomial. In this paper, we calculate the crosscorrelation function of a Kasami sequence and a No sequence that have been generated by the same primitive polynomial with the periodic crosscorrelation function of two base sequences. Our method is different from the Games's method.

• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.527-530
• /
• 1997

An automated process planning system for cold forging of non-axisymmetric parts of comparatively simple shape was developed in this study. Programs for the system have been written with Visual LISP in the AutoCAD using a personal computer and are composed of four main modules such as input module, shape cognition and shape expression module, material diameter determination module and process planning module. The design rules and knowledges for th system are extracted from the plasticity theories. handbook, relevant reference and empirical knowledge of field experts. Generally, in forging, only front view is needed for expression of axisymmetric parts, but non-axisymmetric parts are needed both front view and plane. At the plane, this system cognizes the external shape of non-axisymmetric parts - number of sides of regular polygon and radius of a circle circumscribing the polygon of n sides. At the front view, the system perceives diameter of axisymmetric portions and hight of primitive geometries such as polygon, cylinder, cone, concave, convex, etc.

• Journal of The Korean Astronomical Society
• /
• v.40 no.4
• /
• pp.107-111
• /
• 2007

The original environment of the solar system can be inferred by studying the oxygen isotope ratios in the Sun as well as in primitive meteorites and comets. The oxygen isotopic fractionation measured in primitive meteorites is mass-independent, which can be explained by the isotopic-selective photodissociation of CO. The isotopic-selective photodissociation model in a collapsing cloud by Lee et al. (2007) imply the birth of the Sun in a stellar cluster with an enhanced radiation field, which is consistent with the inferred presence of $^{60}Fe$.

• The Journal of Information Technology
• /
• v.5 no.1
• /
• pp.133-142
• /
• 2002

This paper presents an efficient implementation of the linear window operator. I derived computational primitives based upon a block state space representation. The computational primitive can be implemented as a data path for a programmable processor, which can be used for the efficient implementation of a linear window operator. A multiprocessor architecture is presented for the realtime processing of a linear window operator. The architecture is designed based upon the data partitioning technique. Performance analysis for the various block size is provided.

• Aerospace Engineering and Technology
• /
• v.6 no.2
• /
• pp.157-163
• /
• 2007

The purpose of this study is to design and simulate Reed Solomon encoder(255,223) in PCM/FM communication system in order to transmit the KSLV-I onboard video data. Especially in the compressed video data transmission applications, the communication system is required to have a very low BER performance because of interframe or interframe compression techniques. We have used the primitive polynomial of CCSDS standard and calculated the various coefficients and then the encoder have been simulated as a part of RF interface FPGA hardware in a video compression unit.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.4
• /
• pp.408-414
• /
• 2011

The objective of this paper is to define local optimization algorithms (LOA) to solve Resource-Constrained Project Scheduling Problem (RCPSP) and analyze the performance of these algorithms. By representing solutions with activity list, three primitive LOAs, i.e. forward and backward improvement-based, exchange-based, and relocation-based LOAs are defined. Also, combined LOAs integrating two primitive LOAs are developed. From the experiments with standard test set J120 generated using ProGen, the FBI-based LOA demonstrates to be an efficient algorithm. Moreover, algorithms combined with FBI-based LOA and other LOA generate good solutions in general. Among the considered algorithms, the combined algorithm of FBI-based and exchangebased shows best performance in terms of solution quality and computation time.

• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.115-124
• /
• 2000

For a finite group G, #Cent(G) denotes the number of cen-tralizers of its clements. A group G is called n-centralizer if #Cent( G) = n. and primitive n-centralizer if #Cent(G) = #Cent(${\frac}{G}{Z(G)$) = n. In this paper we compute the number of distinct centralizers of some finite groups and investigate the structure of finite groups with Qxactly SLX distinct centralizers. We prove that if G is a 6-centralizer group then ${\frac}{G}{Z(G)$${\cong}D_8$,$A_4$, $Z_2{\times}Z_2{\times}Z_2$ or $Z_2{\times}Z_2{\times}Z_2{\times}Z_2$.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.466-469
• /
• 2005

Recently, in computer graphics, researches on 3D animations have been very active. One of the important research areas in 3D animation is animation of human being. Implicit surface model is convient for modeling objects composed of complicated surface such as 3D characters and liquids. Moreover, it can represent various forms of surfaces using a relatively small amount of data. In this paper, we propose a method of facial model generation using Implicit Primitive.

• Korean Journal of Mathematics
• /
• v.23 no.1
• /
• pp.29-36
• /
• 2015

A signed digraph S is the digraph D by assigning signs 1 or -1 to each arc of D. The base of S is the minimum number k such that there is a pair walks which have the same initial and terminal point with length k, but different signs. In this paper we show that for $n{\geq}5$ the upper bound of the base of a primitive non-powerful signed tournament Sn, which is the signed digraph by assigning 1 or -1 to each arc of a primitive tournament $T_n$, is max{2n + 2, n+11}. Moreover we show that it is extremal except when n = 5, 7.