• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.135-143
• /
• 2011

As a zero set of some multivariate splines, the piecewise algebraic variety is a kind of generalization of the classical algebraic variety. This paper presents an algorithm for isolating real roots of the zero-dimensional piecewise algebraic variety which is based on interval evaluation and the interval zeros of univariate interval polynomials in Bernstein form. An example is provided to show the proposed algorithm is effective.

• Journal of the Korean Statistical Society
• /
• 제31권2호
• /
• pp.251-259
• /
• 2002

Lagged regressor models with general stationary errors independent of the regressors are considered. The regressor process is unstable having characteristic roots on the unit circle. If the order of the lag matches the number of roots on the unit circle, the ordinary least squares estimator (OLSE) is asymptotically efficient in that it has the same limiting distribution as the generalized least squares estimator (GLSE) under the same normalization. This result extends the well-known result of Grenander and Rosenblatt (1957) for asymptotic efficiency of the OLSE in deterministic polynomial and/or trigonometric regressor models to a class of models with stochastic regressors.

• 대한수학회보
• /
• 제52권2호
• /
• pp.603-618
• /
• 2015

We derive three identities of symmetry in two variables and eight in three variables related to generalized twisted Bernoulli polynomials and generalized twisted power sums, both of which are twisted by unramified roots of unity. The case of ramified roots of unity was treated previously. The derivations of identities are based on the p-adic integral expression, with respect to a measure introduced by Koblitz, of the generating function for the generalized twisted Bernoulli polynomials and the quotient of p-adic integrals that can be expressed as the exponential generating function for the generalized twisted power sums.

• 한국컴퓨터그래픽스학회논문지
• /
• 제6권1호
• /
• pp.37-50
• /
• 2000

본 논문에서는 R. T. Farouki에 의하여 소개된 평면 곡선들에 대한 복소수화된 표현법을 사용하여 주어진 임의의 평면 다항식 곡선을 복소수 계수를 갖는 한 다항식으로 나타내고 이 식을 대수학의 기본정리에 따라 복소수체 상에서 완전히 인수분해한 다음 그 근들을 관찰하여 주어진 곡선이 평면 다항식 피타고리안 호도그라프(PH) 곡선이 되기 위하 필요충분 조건을 새로운 방법으로 밝히고, 이를 3차원 민코브스키 공간 $R^{2,1}$ 상의 다항식 곡선에 적용, 이 곡선이 PH 곡선이 되기 위한 필요충분을 보다 간결한 형태로 나타내고 이를 통하여 3차원 민코브스키 공간 $R^{2,1}$ 상의 가능한 다항식 PH 곡선들의 유형이 모두 결정된다는 것을 보인다.

• Transactions on Control, Automation and Systems Engineering
• /
• 제4권3호
• /
• pp.217-223
• /
• 2002

The paper presents a single constraint equation of the direct kinematic solution of 6-dof (Stewart-Gough) platforms. Many research works have presented a single polynomial of the direct kinematics for several 6-dof platforms. However, the formulation of the polynomial has potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots. This results in heavy computational burden and time-consuming task. Thus, to overcome these problems, we use a new formulation approach, called the Tetrahedron Approach, to easily derive a single constraint equation, not a polynomial one, of the direct kinematics and use two well-known numerical iterative methods to find the solution of the single constraint equation. Their performance and characteristics are investigated through a series of simulation.

• 전기학회논문지
• /
• 제63권7호
• /
• pp.875-882
• /
• 2014

In this paper, we propose a new parameter estimation method that can deal with the data of multiple time intervals simultaneously. If there are common modes in the multiple time intervals, it is possible to create a new polynomial by summing the coefficients of the prediction error polynomials of each time interval. By calculating the roots of the new polynomial, it is possible to estimate the common modes that exist in each time interval. The accuracy of the proposed parameter estimation method has been proven by using appropriate test signals.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.83.4-83
• /
• 2001

The paper presents a new closed-form, not a polynomial-form, solution of the direct kinematics of the 3-6 (Stewart-Gough) Platform. Many research works have presented a single high-order polynomial equation of the direct kinematics. However the polynomial equation causes potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots, which results in time-consuming task and heavy computational burden. Thus, to overcome these problems, we use a new formulation approach, based on the Tetrahedron Approach, to derive easily a closed-form nonlinear equation of the direct kinematics and use not the Newton-Raphson method, but the Secant method to obtain quickly the solution from ...

• 대한수학회논문집
• /
• 제35권3호
• /
• pp.773-787
• /
• 2020

In this paper we consider the uniqueness of meromorphic functions when two linear differential polynomials share a set of values. Our result improves and rectifies a result of An and Khoai.

• 한국IT서비스학회지
• /
• 제19권1호
• /
• pp.145-158
• /
• 2020

With the development and widespread application of online shopping, the number of online consumers has increased. With one click of a mouse, people can buy anything they want without going out and have it sent right to the doors. As consumers benefit from online shopping, people are becoming more concerned about protecting their privacy. In the group buying scenario described in our paper, online shopping was regarded as intra-group communication. To protect the sensitive information of consumers, the polynomial-based encryption key sharing method (Piao et al., 2013; Piao and Kim, 2018) can be applied to online shopping communication. In this paper, we analyze security problems by using a polynomial-based scheme in the following ways : First, in Kamal's attack, they said it does not provide perfect forward and backward secrecy when the members leave or join the group because the secret key can be broken in polynomial time. Second, for simultaneous equations, the leaving node will compute the new secret key if it can be confirmed that the updated new polynomial is recomputed. Third, using Newton's method, attackers can successively find better approximations to the roots of a function. Fourth, the Berlekamp Algorithm can factor polynomials over finite fields and solve the root of the polynomial. Fifth, for a brute-force attack, if the key size is small, brute force can be used to find the root of the polynomial, we need to make a key with appropriately large size to prevent brute force attacks. According to these analyses, we finally recommend the use of a relatively reasonable hash-based mechanism that solves all of the possible security problems and is the most suitable mechanism for our application. The study of adequate and suitable protective methods of consumer security will have academic significance and provide the practical implications.

• 한국수학사학회지
• /
• 제18권3호
• /
• pp.39-54
• /
• 2005

중국 산학에서는 구장산술의 제곱근과 세제곱근의 해법을 일반화하여 고헌이 도입한 증승개방법을 통하여 다항방정식의 해의 근사값을 구한다. 이 때 도구로 사용되는 조립제법에서 음수와 그 연산을 정확히 사용하지 않아서 번적, 익적이라는 개념이 나타나는데, 이는 조선 산학에도 그대로 사용되었다. 먼저 중국과 조선에서 번적, 익확에 대한 역사를 조사하고, 19세기 중엽에 조선 산학자 남병길과 이상혁이 번적과 익적에 대한 충분조건을 얻어내고 이를 증명한 사실을 밝혀낸다.