• Communications of the Korean Mathematical Society
• /
• v.20 no.1
• /
• pp.51-62
• /
• 2005

We consider 2-colored digraphs of the primitive ministrong digraphs having given exponents. In this paper we give bounds for 2-exponents of primitive extremal ministrong digraphs.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.485-491
• /
• 2004

We shall discuss irreducible and primitive S-automata. A variety of properties of transitive and primitive semigroups associated with them have been obtained. Also a classification of primitive semi groups will be given with S-automata.

• Korean Journal of Computational Design and Engineering
• /
• v.18 no.3
• /
• pp.234-242
• /
• 2013

Different CAD systems are used in ship outfitting design on different usage and purpose. Therefore, data exchanges between CAD systems are required from different formats. For data exchange, boundary representation standard formats such as IGES and ISO 10303 (STEP) are widely used. However, they present only B-rep representation. Because of different CAD systems have their own geometry format, data exchanges with design intend are difficult. Especially, Tribon and PDMS use primitives for express their geometry in ship outfitting design. However, Tribon primitives are represented their parameter by values that are non-parametric. Therefore, data size of catalogue library is bigger than different CAD system using parametric primitive representation. And that system has difficulty on data reprocessing. To solve that problem, we discuss about shape DB which contains design parameters of primitive for exchange Tribon primitives. And geometry data exchange between Tribon and Shape Database that defines based on PDMS scheme are specified using primitive mapping that can represent design intend.

• The Journal of Engineering Research
• /
• v.6 no.1
• /
• pp.111-124
• /
• 2004

The advanced semiconductor technology and electronic design automation(EDA) tools make it possible to implement the system on the programmable logic devices. The electronic design method is also changing from schematic capture to hardware description language. In this paper, I present the architecture of multi-dimensional digital filter which can be efficiently implemented on PLDs. This is based on the former research results which are called algorithm decomposition technique. Algorithm decomposition technique is used to obtain the computational primitive from the state space equations of the multi-dimensional digital filtering algorithm. The obtained computational primitive is designed with VHDL. This can be used to implement the filtering system as a component. The designed filtering system is implemented on the PLD. Therefore, the filter can be upgradable on system. It is greatly reduced the time-to-market time of the system that is based on the multi-dimensional filter.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.403-410
• /
• 2006

For a finite group G, #Cent(G) denotes the number of centralizers of its elements. A group G is called n-centralizer if #Cent(G) = n, and primitive n-centralizer if #Cent(G) = #Cent($\frac{G}{Z(G)}$) = n. The first author in [1], characterized the primitive 6-centralizer finite groups. In this paper we continue this problem and characterize the primitive 7-centralizer finite groups. We prove that a finite group G is primitive 7-centralizer if and only if $\frac{G}{Z(G)}{\simeq}D_{10}$ or R, where R is the semidirect product of a cyclic group of order 5 by a cyclic group of order 4 acting faithfully. Also, we compute #Cent(G) for some finite groups, using the structure of G modulu its center.

• 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.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.627-641
• /
• 2008

A two-colored digraph D is primitive if there exist nonnegative integers hand k with h + k > 0 such that for each pair (i, j) of vertices there exists an (h, k)-walk in D from i to j. The exponent of the primitive two-colored digraph D is the minimum value of h + k taken over all such hand k. In this paper, we give the tight upper bound on the exponents of a class of primitive two-colored digraphs with (s + 1) n-cycles and one (n - 1)-cycle, and the characterizations of the extremal two-colored digraphs.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.25-43
• /
• 2005

Let F be a finite field of prime power order q(odd) and the multiplicative order of q modulo $2^{n}\;(n>1)\;be\; {\phi}(2^{n})/2$. If n > 3, then q is odd number(prime or prime power) of the form $8m{\pm}3$. If q = 8m - 3, then the ring $R_{2^n} = F[x]/ < x^{2^n}-1 >$ has 2n primitive idempotents. The explicit expressions for these primitive idempotents are obtained and the minimal QR cyclic codes of length $2^{n}$ generated by these idempotents are completely described. If q = 8m + 3 then the expressions for the 2n - 1 primitive idempotents of $R_{2^n}$ are obtained. The generating polynomials and the upper bounds of the minimum distance of minimal QR cyclic codes generated by these 2n-1 idempotents are also obtained. The case n = 2,3 is dealt separately.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.380-392
• /
• 2000

This paper proposes a qualitative reasoning approach for the spatial configuration of mechanisms that could be applied in the early phase of the conceptual design. The spatial configuration problem addressed in this paper involves the relative direction and position between the input and output motion, and the orientation of the constituent primitive mechanisms of a mechanism. The knowledge of spatial configuration of a primitive mechanism is represented in a matrix form called spatial configuration matrix. This matrix provides a compact and convenient representation scheme for the spatial knowledge, and facilitates the manipulation of the relevant spatial knowledge. Using this spatial knowledge of the constituent primitive mechanisms, the overall configuration of a mechanism is described and identified by a spatial configuration state matrix. This matrix is obtained by using a qualitative reasoning method based on sign algebra and is used to represent the qualitative behavior of the mechanism. The matrix-based representation scheme allows handling the involved spatial knowledge simultaneously and the proposed reasoning method enables the designer to predict the spatial behavior of a mechanism without knowing specific dimension of the components of the mechanism.

• Korea-Australia Rheology Journal
• /
• v.18 no.2
• /
• pp.99-102
• /
• 2006

Primitive chain network model for block copolymers is used here to simulate molecular dynamics in the entangled state with acceptable computational cost. It was found that i) the hooking procedure rearranging the topology of the entangled network is critical for the equilibrium structure of the system, and ii) simulations accounting for the different chemistry, i.e., with a biased hooking probability based on interaction parameter ${\chi}$ for selection of the hooked partner, generates a reasonable phase diagram.