• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.24 no.12
• /
• pp.948-953
• /
• 2014

Many studies using the assumed mode method have been found for the free vibration analysis of stiffened plate with known elastic boundary conditions. However many local structures such as tank edges and equipment foundations consist of connected structures and it is very difficult to find suitable elastic boundary conditions. In this study combined polynomials which satisfy simply and fixedly supported boundary conditions are proposed. The proposed method has been applied to tanks which bounded by bulkhead and a deck. The results of this study shows good agreements with these obtain by the FEA S/W(Patran/Nastran).

• Journal of the Korean Mathematical Society
• /
• v.41 no.1
• /
• pp.157-174
• /
• 2004

In this work we discuss "plank problems" for complex Banach spaces and in particular for the classical $L^{p}(\mu)$ spaces. In the case $1\;{\leq}\;p\;{\leq}\;2$ we obtain optimal results and for finite dimensional complex Banach spaces, in a special case, we have improved an early result by K. Ball [3]. By using these results, in some cases we are able to find best possible lower bounds for the norms of homogeneous polynomials which are products of linear forms. In particular, we give an estimate in the case of a real Hilbert space which seems to be a difficult problem. We have also obtained some results on the so-called n-th (linear) polarization constant of a Banach space which is an isometric property of the space. Finally, known polynomial inequalities have been derived as simple consequences of various results related to plank problems.

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

• Proceedings of the Korean Statistical Society Conference
• /
• 2000.11a
• /
• pp.27-32
• /
• 2000

To overcome boundary problems with wavelet regression, we propose a simple method that reduces bias at the boundaries. It is based on a combination of wavelet functions and low-order polynomials. The utility of the method is illustrated with simulation studies and a real example. Asymptotic results show that the estimators are competitive with other nonparametric procedures.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.699-709
• /
• 2016

Our paper is devoted to the study of certain diophantine equations on the ring of polynomials over a finite field, which are intimately related to algebraic formal power series which have partial quotients of unbounded degree in their continued fraction expansion. In particular it is shown that there are Pisot formal power series with degree greater than 2, having infinitely many large partial quotients in their simple continued fraction expansions. This generalizes an earlier result of Baum and Sweet for algebraic formal power series.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.75-86
• /
• 1996

Let G be a finite simple connected graph with vertex set V(G) and edge set E(G). Let A(G) be the adjacency matrix of G. The characteristic polynomial of G is the characteristic polynomial $\Phi(G;\lambda) = det(\lambda I - A(G))$ of A(G). A zero of $\Phi(G;\lambda)$ is called an eigenvalue of G.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.231-238
• /
• 2022

In this paper we prove some results by using a simple but elegant techniques to improve and strengthen some generalizations and refinements of two widely known polynomial inequalities and thereby deduce some useful corollaries.

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

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.92-95
• /
• 1999

The design problem of the control system is the ability to synthesize controller that achieve robust stability and robust performance. The paper explains the Finite Inclusions Theorem (FIT) by the procedure namely FIT synthesis. It is developed for synthesizing robustly stabilizing controller for parametrically uncertain system. The fundamental problem in the study of parametrically uncertain system is to determine whether or not all the polynomials in a given family of characteristic polynomials is Hurwitz i.e., all their roots lie in the open left-half plane. By FIT it can prove a polynomial is Hurwitz from only approximate knowledge of the polynomial's phase at finitely many points along the imaginary axis. An example shows the simplicity of using the FIT synthesis to directly search for robust controller of parametrically uncertain system by way of solving a sequence of systems of linear inequalities. The systems of inequalities are solved via the projection method which is an elegantly simple technique fur solving (finite or infinite) systems of convex inequalities in an arbitrary Hilbert space. Results from example show that the controller synthesized by FIT synthesis is better than by H$\sub$$\infty$/ synthesis with parametrically uncertain system as well as satisfied the objectives for a considerably larger range of uncertainty.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.595-608
• /
• 2013

Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).