• Journal of the Institute of Electronics Engineers of Korea SD
• /
• 제43권3호
• /
• pp.33-39
• /
• 2006

In this paper we propose the Modified Karatsuba-Ofman algorithm for polynomial multiplication to polynomials of arbitrary degree. Leone proposed optimal stop condition for iteration of Karatsuba-Ofman algorithm(KO). In this paper, we propose a Non-Redundant Karatsuba-Ofman algorithm (NRKOA) with removing redundancy operations, and design a parallel hardware architecture based on the proposed algorithm. Comparing with existing related Karatsuba architectures with the same time complexity, the proposed architecture reduces the area complexity. Furthermore, the space complexity of the proposed multiplier is reduced by 43% in the best case.

• Journal of the Korean Data and Information Science Society
• /
• 제28권5호
• /
• pp.1021-1026
• /
• 2017

Mixture experiments are commonly encountered in many fields including food, chemical and pharmaceutical industries. In mixture experiments, measured response depends on the proportions of the components present in the mixture and not on the amount of the mixture. Statistical analysis of the data from mixture experiments has mainly focused on a continuous response variable. In the example of quantal response data in mixture experiments, however, the tumor incidence data have been analyzed in Chen et al. (1996) to study the effects of 3 dietary components on the expression of mammary gland tumor. In this paper, we compared the logistic regression models with linear predictors such as second degree Scheffe polynomial model, Becker model and Akay model in terms of classification accuracy.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• 제1권3호
• /
• pp.69-76
• /
• 2008

This paper concerns Fuzzy Radial Basis Function Neural Network (FRBFNN) and automatic rule generation of extraction of the FRBFNN by means of mountain clustering. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values (degree of membership) directly rely on the computation of the relevant distance between data points. Also, we consider high-order polynomial as the consequent part of fuzzy rules which represent input-output characteristic of sup-space. The number of clusters and the centers of clusters are automatically generated by using mountain clustering method based on the density of data. The centers of cluster which are obtained by using mountain clustering are used to determine a degree of membership and weighted least square estimator (WLSE) is adopted to estimate the coefficients of the consequent polynomial of fuzzy rules. The effectiveness of the proposed model have been investigated and analyzed in detail for the representative nonlinear function.

• Bulletin of the Korean Mathematical Society
• /
• 제61권3호
• /
• pp.745-762
• /
• 2024

In this paper, we study the existence of finite order meromorphic solutions of the following non-linear difference equation fⁿ(z) + P_d(z, f) = p₁e^α1z + p₂e^α2z + p₃e^α3z, where n ≥ 2 is an integer, P_d(z, f) is a difference polynomial in f of degree d ≤ n - 2 with small functions of f as its coefficients, p_j (j = 1, 2, 3) are small meromorphic functions of f and α_j (j = 1, 2, 3) are three distinct non-zero constants. We give the expressions of finite order meromorphic solutions of the above equation under some restrictions on α_j (j = 1, 2, 3). Some examples are given to illustrate the accuracy of the conditions.

• Bulletin of the Korean Mathematical Society
• /
• 제57권4호
• /
• pp.1061-1073
• /
• 2020

In this paper, the expressions of meromorphic solutions of the following nonlinear complex differential equation of the form $$f^n+Qd(z,f)=\sum\limits_{i=1}^{3}pi(z)e^{{\alpha}_i(z)}$$ are studied by using Nevanlinna theory, where n ≥ 5 is an integer, Q_d(z, f) is a differential polynomial in f of degree d ≤ n - 4 with rational functions as its coefficients, p₁(z), p₂(z), p₃(z) are non-vanishing rational functions, and α₁(z), α₂(z), α₃(z) are nonconstant polynomials such that α'₁(z), α'₂(z), α'₃(z) are distinct each other. Moreover, examples are given to illustrate the accuracy of the condition.

• Structural Engineering and Mechanics
• /
• 제2권3호
• /
• pp.245-256
• /
• 1994

A new axisymmetric crack model is proposed on the basis of p-version of the finite element method limited to theory of small scale yielding. To this end, axisymmetric stress element is formulated by integrals of Legendre polynomial which has hierarchical nature and orthogonality relationship. The virtual crack extension method has been adopted to calculate the stress intensity factors for 3-D axisymmetric cracked bodies where the potential energy change as a function of position along the crack front is calculated. The sensitivity with respect to the aspect ratio and Poisson locking has been tested to ascertain the robustness of p-version axisymmetric element. Also, the limit value that is an exact solution obtained by FEM when degree of freedom is infinite can be estimated using the extrapolation equation based on error prediction in energy norm. Numerical examples of thick-walled cylinder, axisymmetric crack in a round bar and internal part-thorough cracked pipes are tested with high precision.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제18권2호
• /
• pp.3-10
• /
• 2008

The choice of basis for representation of element in $GF(2^m)$ affects the efficiency of a multiplier. Among them, a multiplier using redundant representation efficiently supports trade-off between the area complexity and the time complexity since it can quickly carry out modular reduction. So time of a previous multiplier using redundant representation is faster than time of multiplier using others basis. But, the weakness of one has a upper space complexity compared to multiplier using others basis. In this paper, we propose a new efficient multiplier with consideration that polynomial exponentiation operations are frequently used in cryptographic hardwares. The proposed multiplier is suitable fer left-to-right exponentiation environment and provides efficiency between time and area complexity. And so, it has both time delay of $T_A+({\lceil}{\log}_2m{\rceil})T_x$ and area complexity of (2m-1)(m+s). As a result, the proposed multiplier reduces $2(ms+s^2)$ compared to the previous multiplier using equally-spaced polynomials in area complexity. In addition, it reduces $T_A+({\lceil}{\log}_2m+s{\rceil})T_x$ to $T_A+({\lceil}{\log}_2m{\rceil})T_x$ in the time complexity.($T_A$:Time delay of one AND gate, $T_x$:Time delay of one XOR gate, m:Degree of equally spaced irreducible polynomial, s:spacing factor)

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제23권3호
• /
• pp.267-282
• /
• 2019

This paper examines how one can build a block tridiagonal structure for k-almost normal matrices and also for k-almost conjugate normal matrices. We shall see that these representations are created by unitary similarity and unitary congruance transformations, respectively. It shall be proven that the orders of diagonal blocks are 1, k + 2, 2k + 3, ${\ldots}$, in both cases. Then these block tridiagonal structures shall be reviewed for the cases where the mentioned matrices satisfy in a second-degree polynomial. Finally, for these processes, algorithms are presented.

• Korean Journal of Mathematics
• /
• 제30권3호
• /
• pp.525-532
• /
• 2022

Let 𝓟_n denote the space of all complex polynomials $P(z)=\sum\limits_{j=0}^{n}{\alpha}_jz^j$ of degree n. Let P ∈ 𝓟_n, for any complex number α, D_αP(z) = nP(z) + (α - z)P'(z), denote the polar derivative of the polynomial P(z) with respect to α and B_n denote a family of operators that maps 𝓟_n into itself. In this paper, we combine the operators B and D_α and establish certain operator preserving inequalities concerning polynomials, from which a variety of interesting results can be obtained as special cases.

• Journal of the Korean Data and Information Science Society
• /
• 제19권2호
• /
• pp.463-473
• /
• 2008

In this study, we measure damage depth and calculate effective impact speed in case of rear-end collision using real car insurance data. We study the relationship between demage depth and effective impact speed, and present statistical model for these two variables. In our real data study, 3-degree polynomial equation model is better fit to effective impact speed and demage depth than the simple linear model that are estimated in previous other studies. Damage depth is a major factor to see the extent of impact in a car collision, and by using this equation, it is possible to evaluate the severity of driver's injury.