• Bulletin of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.1157-1171
• /
• 2013

In this paper, by using the $q$-difference analogue of lemma on the logarithmic derivative lemma to re-establish some estimates of Nevanlinna characteristics of $f(qz)$, we deal with the value distribution and uniqueness of certain types of $q$-difference polynomials.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.51-54
• /
• 1990

A parametrization for a linear system is presented to design a direct model reference adaptive pole placement controler. This parametrized model is one of the structured nonminimal models. The exponentially weighted least-squres algorithm is employed to estimate the control parameters. The direct adaptive controller has the exponential weighting properties by the proposed method of selecting the characteristic polynomials of the sensitivity function filters in connection with the reference models.

• Kyungpook Mathematical Journal
• /
• v.28 no.1
• /
• pp.39-44
• /
• 1988

In 1940, B. H. Neumann, working with a system more general than a near-field, proved that the additive group of such a system (and of a near-field) is commutative. The algebraic structure he used is known as a Neumann system (N-system). Here, the prime N-systems are classified and for each possible characteristic, examples of N-systems which are neither near-fields nor rings are given. It is also shown that a necessary condition for the set of all odd polynomials over GF(p) to be an N-system is that p is a Fermat prime.

• Korean Journal of Mathematics
• /
• v.32 no.1
• /
• pp.97-107
• /
• 2024

Let A ⊆ B be an extension of integral domains with characteristic zero. Let H(A, B) and h(A, B) be rings of composite Hurwitz series and composite Hurwitz polynomials, respectively. We simply call H(A, B) and h(A, B) composite Hurwitz rings of A and B. In this paper, we study when H(A, B) and h(A, B) are unique factorization domains (resp., GCD-domains, finite factorization domains, bounded factorization domains).

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.955-962
• /
• 2015

It has been established that the role played by complete graphs in graph theory is similar to the role Dowling group geometries and Projective geometries play in matroid theory. In this paper, we introduce a notion of H-tree, a class of representable matroids which play a similar role to trees in graph theory. Then we give some properties of H-trees such that when q = 0, then the results reduce to the known properties of trees in graph theory. Finally we give explicit expressions of the characteristic polynomials of H-trees, H-cycles, H-fans and H-wheels.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.664-669
• /
• 2005

In this note, we present a different asymptotes from the standard approximate lines of the Bode magnitude plot. Wherein the pseudo break frequency is defined in terms of coefficients of denominator and numerator polynomials of the transfer function instead of its poles and zeros. Several comparative examples are given. This result can be used for the characteristic ratio assignment(CRA) [1], [2] with frequency response requirements, which is a method of designing linear controller in parameter space.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.2
• /
• pp.65-71
• /
• 2001

The step response of the Manabe standard form[2] has little overshoot and show almost same waveforms regardless of the order of the characteristic polynomials. In some situations it is difficult to control the rise time and settling time simultaneously of the step response of the Manabe standard form To control its rise time and settling time efficiently, We develop the Manabe standard form: We try to find out the SRFS(Slow Rise time & Fast Setting time) form which has the slower rise time and faster settling time than those fo the Manabe standard form. We also consider the other three forms: FRSS(Fast Rise time & Slow Settling time), SRFS(Slow Rise time & Fast Settling time) and SRSS(Slow Rise time & Slow Settling time) forms. In this paper, by using the evolutionary strategy, we obtain all the coefficient of the four forms we mention above. Finally, we design a controller for a given plant so that the overall system has the performance that the rise time is faster, the settling time is faster than those of the Manabe standard form.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.77-85
• /
• 2002

A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• Water for future
• /
• v.27 no.2
• /
• pp.155-166
• /
• 1994

Various Eulerian-Lagrangian numerical models for the one-dimensional longitudinal dispersion equation are studied comparatively. In the model studied, the transport equation is decoupled into two component parts by the operator-splitting approach ; one part governing adveciton and the other dispersion. The advection equation has been solved using the method of characteristics following fluid particles along the characteristic line and the results are interpolated onto an Eulerian grid on which the dispersion equation is solved by Crank-Nicholson type finite difference method. In solving the advection equation, various interpolation schemes are tested. Among those, Hermite interpolation polynomials are superior to Lagrange interpolation polynomials in reducing dissipation and dispersion errors in the simulation.