• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.573-586
• /
• 2018

Let R be a noncommutative prime ring of characteristic different from 2, Q be its maximal right ring of quotients and C be its extended centroid. Suppose that $f(x_1,{\ldots},x_n)$ be a noncentral multilinear polynomial over $C,b{\in}Q,F$ a b-generalized derivation of R and d is a nonzero derivation of R such that d([F(f(r)), f(r)]) = 0 for all $r=(r_1,{\ldots},r_n){\in}R^n$. Then one of the following holds: (1) there exists ${\lambda}{\in}C$ such that $F(x)={\lambda}x$ for all $x{\in}R$; (2) there exist ${\lambda}{\in}C$ and $p{\in}Q$ such that $F(x)={\lambda}x+px+xp$ for all $x{\in}R$ with $f(x_1,{\ldots},x_n)^2$ is central valued in R.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1128-1135
• /
• 1993

In this paper, new binary cyclic codes (hereafter, refered to as GMW code) which are generated by using GMW sequence, g(t) = tr((trk(a))r), and its cyclic shifts are introduced. Code length of GMW codes is 2a-1, where k is composite integer, e·J. Dimension of the GMW codes is k(k/j)w-1, where w is a Hamming weight of r. Several properties of GMW codes such as designed distance, minimum distance, and weights of code words are obtained in terms of parameters of GMW sequences. And expansion of GMW sequences in terms of m-sequence and its decimation sequences are introduced and characteristic polynomials of GMW sequences are also derived.

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

The step response of the Manabe standard form[1］has little overshoot and shows 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 generalization of the Manabe standard form: we try to find out the SRFS(Slow Rise time & Fast Settling time) form which has the slower rise time and faster settling time than those of 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 genetic algorithm, 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 slower than those of the Manabe standard form.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.595-601
• /
• 1997

Let $C_d$ be the rational curve of degree d in $P_k ^3$ given parametrically by $x_0 = u^d, X_1 = u^{d - 1}t, X_2 = ut^{d - 1}, X_3 = t^d (d \geq 4)$. Then the defining ideal of $C_d$ can be minimally generated by d polynomials $F_1, F_2, \ldots, F_d$ such that $degF_1 = 2, degF_2 = \cdots = degF_d = d - 1$ and $C_d$ is a set-theoretically complete intersection on $F_2 = X_1^{d-1} - X_2X_0^{d-2}$ for every field k of characteristic p > 0. For the proofs we will use the notion of Grobner basis.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.709-737
• /
• 2020

Let R be a prime ring of characteristic different from 2. Suppose that F, G, H and T are generalized derivations of R. Let U be the Utumi quotient ring of R and C be the center of U, called the extended centroid of R and let f(x₁, …, x_n) be a non central multilinear polynomial over C. If F(f(r₁, …, r_n))G(f(r₁, …, r_n)) - f(r₁, …, r_n)T(f(r₁, …, r_n)) = H(f(r₁, …, r_n)²) for all r₁, …, r_n ∈ R, then we describe all possible forms of F, G, H and T.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.3
• /
• pp.311-319
• /
• 1992

In this paper, a direct adaptive pole placement controller for an unknown linear time-invariant single-input single-output nonminimum phase plant is proposed. To design this direct adaptive pole placement controller, the auxiliary signals are introduced. Consequently, a linear equation error model is formulated for estimating both the controller parameters and the additional auxiliary parameters. To estimate the controller parameters and the additional auxiliary parameters, the exponentially weighted least-squares algorithm is implemented, and a method of selecting the characteristic polynomials of the sensitivity function filters is proposed. In this method, all the past measurement data are weighted exponentially. A series of simulations for a nonminimum phase plant is presented to illustrate some features of both the parameter estimation and the output response of this adaptive pole placement controller.

• The Mathematical Education
• /
• v.54 no.4
• /
• pp.365-383
• /
• 2015

Factorization asks the recognition of the structure of polynomials, compared to polynomial expansion with process characteristic. Therefore it makes students experience a lot of difficulties. This study aims to figure out causes of the difficulties by identifying students' cognitive characteristics in factorizing in the perspective of 'structure sense'. To do this, we gave six factorizing problems of three types to middle school students and selected six participants as interviewees based on the test results. They were classified into two categories, structure sense and non-structure sense. Through this interview, we figured out the interviewee's cognitive characteristics and the causes of difficulty in the perspective of structure sense. Furthermore, we suggested some didactical implications for encouraging structure sense in factorizing by identifying assistances and obstacles for recognition of structures.

• International Journal of Internet, Broadcasting and Communication
• /
• v.6 no.1
• /
• pp.9-12
• /
• 2014

We present a mathematical method for calculation of transmission zero locations, determining a filtering characteristics of two-port systems. By adjusting element values based on the zero locations, the frequency-selectivity is characterized. The characteristic polynomial of ladder networks in externally-loaded feed-forward systems is considered by adopting chain matrices for subsystems. This method can be extended to other types of lumped systems with cross-coupled sections. We find out the zeros by solving characteristics polynomials of closed-form expressions in terms of Laplace impedances of elements. The pairs of complex zeros are shown to be solely from the cross-coupled portion of the system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.533-540
• /
• 2021

To evaluate the performance of a system, one-dimensional 3-neighborhood cellular automata(CA) based pseudo-random generators are widely used in many fields. Although two-dimensional CA and one-dimensional 5-neighborhood CA have been applied for more effective key sequence generation, designing symmetric one-dimensional 5-neighborhood CA corresponding to a given primitive polynomial is a very challenging problem. To solve this problem, studies on one-dimensional 5-neighborhood CA synthesis, such as synthesis method using recurrence relation of characteristic polynomials and synthesis method using Krylov matrix, were conducted. However, there was still a problem with solving nonlinear equations. To solve this problem, a symmetric one-dimensional 5-neighborhood CA synthesis method using a transition matrix of 90/150 CA and a block matrix has recently been proposed. In this paper, we detail the theoretical process of the proposed algorithm and use it to obtain symmetric one-dimensional 5-neighborhood CA corresponding to high-order primitive polynomials.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.970-976
• /
• 2007

In this study, Polynomial Network Pattern Classifier(PNC) based on Fuzzy Inference Mechanism is designed and its parameters such as learning rate, momentum coefficient and fuzzification coefficient are optimized by means of Particle Swarm Optimization. The proposed PNC employes a partition function created by Fuzzy C-means(FCM) clustering as an activation function in hidden layer and polynomials weights between hidden layer and output layer. Using polynomials weights can help to improve the characteristic of the linear classification of basic neural networks classifier. In the viewpoint of linguistic analysis, the proposed classifier is expressed as a collection of "If-then" fuzzy rules. Namely, architecture of networks is constructed by three functional modules that are condition part, conclusion part and inference part. The condition part relates to the partition function of input space using FCM clustering. In the conclusion part, a polynomial function caries out the presentation of a partitioned local space. Lastly, the output of networks is gotten by fuzzy inference in the inference part. The proposed PNC generates a nonlinear discernment function in the output space and has the better performance of pattern classification as a classifier, because of the characteristic of polynomial based fuzzy inference of PNC.