• Communications for Statistical Applications and Methods
• /
• v.25 no.2
• /
• pp.131-157
• /
• 2018

We propose a robust event date model to estimate the date of a target event by a combination of individual dates obtained from archaeological artifacts assumed to be contemporaneous. These dates are affected by errors of different types: laboratory and calibration curve errors, irreducible errors related to contaminations, and taphonomic disturbances, hence the possible presence of outliers. Modeling based on a hierarchical Bayesian statistical approach provides a simple way to automatically penalize outlying data without having to remove them from the dataset. Prior information on individual irreducible errors is introduced using a uniform shrinkage density with minimal assumptions about Bayesian parameters. We show that the event date model is more robust than models implemented in BCal or OxCal, although it generally yields less precise credibility intervals. The model is extended in the case of stratigraphic sequences that involve several events with temporal order constraints (relative dating), or with duration, hiatus constraints. Calculations are based on Markov chain Monte Carlo (MCMC) numerical techniques and can be performed using ChronoModel software which is freeware, open source and cross-platform. Features of the software are presented in Vibet et al. (ChronoModel v1.5 user's manual, 2016). We finally compare our prior on event dates implemented in the ChronoModel with the prior in BCal and OxCal which involves supplementary parameters defined as boundaries to phases or sequences.

• Journal of Korean Society for Quality Management
• /
• v.11 no.2
• /
• pp.10-17
• /
• 1983

The former paper (Part I) studies two methods for searching and determining the simple paths in an acyclic or a cyclic network. The two methods are computer programmed as subroutines (SPLP1 and SPLP2) for various use. And a few examples of its applications are discussed Another paper (Par II) studies the reliability computation for a network by using the Event Space Methods. A computer program is developed for the computation by applying the SPLP2 subroutine subprogram. In this paper the former results are summarized with another computer program for reliability computation by using the Path Tracing Methods. The two subroutines appear in the Appendix as reference for others. The programs can be used in the reliability computation of reducible and irreducible structure networks.

• Kyungpook Mathematical Journal
• /
• v.61 no.1
• /
• pp.11-21
• /
• 2021

We study the structure of rings whose factor rings modulo nonzero proper ideals are right duo; such rings are called right FD. We first see that this new ring property is not left-right symmetric. We prove for a non-prime right FD ring R that R is a subdirect product of subdirectly irreducible right FD rings; and that R/N∗(R) is a subdirect product of right duo domains, and R/J(R) is a subdirect product of division rings, where N∗(R) (J(R)) is the prime (Jacobson) radical of R. We study the relation among right FD rings, division rings, commutative rings, right duo rings and simple rings, in relation to matrix rings, polynomial rings and direct products. We prove that if a ring R is right FD and 0 ≠ e2 = e ∈ R then eRe is also right FD, examining that the class of right FD rings is not closed under subrings.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1209-1217
• /
• 2008

In this paper, we present a new bit-parallel multiplier for performing the bit-parallel multiplication of two polynomials in the finite fields $GF(2^m)$. Prior to construct the multiplier circuits, we consist of the vector code generator(VCG) to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial after performing the parallel multiplication of a multiplicand polynomial with a irreducible polynomial. The basic cells of VCG have two AND gates and two XOR gates. Using these VCG, we can obtain the multiplication results performing the bit-parallel multiplication of two polynomials. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields $GF(2^4)$. Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper use the VCGs with the basic cells repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSI.

• Convergence Security Journal
• /
• v.18 no.4
• /
• pp.27-33
• /
• 2018

Stream cipher is an one-time-pad type encryption algorithm that encrypt plaintext using simple operation such as XOR with random stream of bits (or characters) as symmetric key and its security depends on the randomness of used stream. Therefore we can design more secure stream cipher algorithm by using mathematical analysis of the stream such as period, linear complexity, non-linearity, correlation-immunity, etc. The key stream in stream cipher is generated in linear feedback shift register(LFSR) having characteristic polynomial. The primitive polynomial is the characteristic polynomial which has the best security property. It is used widely not only in stream cipher but also in SEED, a block cipher using 8-degree primitive polynomial, and in Chor-Rivest(CR) cipher, a public-key cryptosystem using 24-degree primitive polynomial. In this paper we present the concept and various properties of primitive polynomials in Galois field and prove the theorem finding the number of irreducible polynomials and primitive polynomials over $F_p$ when p is larger than 2. This kind of research can be the foundation of finding primitive polynomials of higher security and developing new cipher algorithms using them.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2A
• /
• pp.102-109
• /
• 2003

In this paper, the new multiplicative algorithm using standard basis over GF(2m) is proposed. The multiplicative process is simplified by data select method in proposed algorithm. After multiplicative operation, the terms of degree greater than m can be expressed as a polynomial of standard basis with degree less than m by irreducible polynomial. For circuit implementation of proposed algorithm, we design the circuit using multiplexer and show the example over GF(24). The proposed architectures are regular and simple extension for m. Also, the comparison result show that the proposed architecture is more simple than privious multipliers. Therefore, it well suited for VLSI realization and application other operation circuits.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.1-10
• /
• 2004

A cellular array parallel multiplier with parallel-inputs and parallel-outputs for performing the multiplication of two polynomials in the finite fields GF$(2^m)$ is presented in this paper. The presented cellular way parallel multiplier consists of three operation parts: the multiplicative operation part (MULOP), the irreducible polynomial operation part (IPOP), and the modular operation part (MODOP). The MULOP and the MODOP are composed if the basic cells which are designed with AND Bates and XOR Bates. The IPOP is constructed by XOR gates and D flip-flops. This multiplier is simulated by clock period l${\mu}\textrm{s}$ using PSpice. The proposed multiplier is designed by 24 AND gates, 32 XOR gates and 4 D flip-flops when degree m is 4. In case of using AOP irreducible polynomial, this multiplier requires 24 AND gates and XOR fates respectively. and not use D flip-flop. The operating time of MULOP in the presented multiplier requires one unit time(clock time), and the operating time of MODOP using IPOP requires m unit times(clock times). Therefore total operating time is m+1 unit times(clock times). The cellular array parallel multiplier is simple and regular for the wire routing and have the properties of concurrency and modularity. Also, it is expansible for the multiplication of two polynomials in the finite fields with very large m.

• Journal of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.453-467
• /
• 1997

A transitive permutation representation of a group G is said to be multiplicity-free if all of its irreducible constituents are distinct. The character corresponding to the action is called the permutation character, given by $(1_H)^G$, where H is the stabilizer of a point. Multiplicity-free permutation characters are of interest in the study of centralizer algebras and distance-transitive graphs, and all finite simple groups are known to have such characters. In this article, we extend to the alternating groups the result of J. Saxl who determined the multiplicity-free permutation representations of the symmetric groups. We classify all subgroups H for which $(1_H)^An, n > 18$, is multiplicity-free.

• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.79-82
• /
• 2002

In this paper, we proposed a multiplicative algorithm for two polynomials in existence coefficients over finite field GF(3$^{m}$ ). Using the proposed multiplicative algorithm, we constructed the multiplier of modular architecture with parallel in-output. The proposed multiplier is composed of (m+1)$^2$identical cells, each cell consists of single mod(3) additional gate and single mod(3) multiplicative gate. Proposed multiplier need single mod(3) multiplicative gate delay time and m mod(3) additional gate delay time not clock. Also, the proposed architecture is simple, regular and has the property of modularity, therefore well-suited for VLSI implementation.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1757-1771
• /
• 2017

Let K be a field and G be a group of its automorphisms. It follows from Speiser's generalization of Hilbert's Theorem 90, [10] that any K-semilinear representation of the group G is isomorphic to a direct sum of copies of K, if G is finite. In this note three examples of pairs (K, G) are presented such that certain irreducible K-semilinear representations of G admit a simple description: (i) with precompact G, (ii) K is a field of rational functions and G permutes the variables, (iii) K is a universal domain over field of characteristic zero and G its automorphism group. The example (iii) is new and it generalizes the principal result of [7].