• Journal of Ship and Ocean Technology
• /
• 제11권4호
• /
• pp.21-28
• /
• 2007

Recently the importance of the utilization of engineering data is gradually increasing. Engineering data contains the experiences and know-how of experts. Data mining technique is useful to extract knowledge or information from the accumulated existing data. This paper deals with generating optimal polynomials using genetic programming (GP) as the module of Data Mining system. Low order Taylor series are used to approximate the polynomial easily as a nonlinear function to fit the accumulated data. The overfitting problem is unavoidable because in real applications, the size of learning samples is minimal. This problem can be handled with the extended data set and function node stabilization method. The Data Mining system for the ship design based on polynomial genetic programming is presented.

• 정보보호학회논문지
• /
• 제25권3호
• /
• pp.567-571
• /
• 2015

Brezing과 Weng은 페어링 친화 타원곡선의 CM 파라미터들을 수체(number field)의 다항식 표현을 이용하여 생성하는 방법을 제안하였고, Freeman은 그 방법을 아벨 다양체(abelian variety)의 경우로 일반화 시켰다. 본 논문에서는 특히 단순 아벨 곡면(simple abelian surface)의 경우에 대해 Brezing-Weng 방법에서 사용되는 다항식족(polynomial family)을 구하는 새로운 공식들을 유도하고, 이를 이용하여 CM 파라미터들을 생성할 수 있음을 보인다.

• 대한수학회보
• /
• 제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.

• 한국경영과학회지
• /
• 제29권3호
• /
• pp.145-155
• /
• 2004

The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

• 호남수학학술지
• /
• 제34권3호
• /
• pp.297-310
• /
• 2012

The relationship between the integral polynomials obtained from the iterations of the matrix given by the expression (1) and the entries of the Krawtchouk matrices is derived by using the associated Riordan arrays.

• Korean Journal of Mathematics
• /
• 제19권3호
• /
• pp.263-272
• /
• 2011

In the paper [1], an explicit correspondence between certain cubic irreducible polynomials over $\mathbb{F}_q$ and cubic irreducible polynomials of special type over $\mathbb{F}_{q^2}$ was established. In this paper, we show that we can mimic such a correspondence for quintic polynomials. Our transformations are rather constructive so that it can be used to generate irreducible polynomials in one of the finite fields, by using certain irreducible polynomials given in the other field.

• Journal of Applied and Pure Mathematics
• /
• 제5권3_4호
• /
• pp.197-209
• /
• 2023

In this paper, the generalized (p, q)-poly-Genocchi polynomials with variable a is defined by generalizing it more, and various properties of this polynomial are introduced. To do this, we define a generating function and use the definition to introduce some interesting properties as follows: basic properties, relation between Stirling numbers of the second kind and generalized (p, q)-poly-Genocchi polynomials with variable a and symmetric properties.

• 호남수학학술지
• /
• 제46권1호
• /
• pp.136-145
• /
• 2024

In this paper we obtained several properties that the characteristic polynomial of the unit-primitive matrix satisfies. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In fact, Xin and Zhong ([4]) showed it earlier. However, we provide a simpler method here.

• 충청수학회지
• /
• 제29권1호
• /
• pp.73-82
• /
• 2016

The utility of exponential generating functions is that they are relevant for combinatorial problems involving sets and subsets. Sequences of polynomials play a fundamental role in applied mathematics, such sequences can be described using the exponential generating functions. The actuarial polynomials ${\alpha}^{({\beta})}_n(x)$, n = 0, 1, 2, ${\cdots}$, which was suggested by Toscano, have the following exponential generating function: $${\limits\sum^{\infty}_{n=0}}{\frac{{\alpha}^{({\beta})}_n(x)}{n!}}t^n={\exp}({\beta}t+x(1-e^t))$$. A linear functional on polynomial space can be identified with a formal power series. The set of formal power series is usually given the structure of an algebra under formal addition and multiplication. This algebra structure, the additive part of which agree with the vector space structure on the space of linear functionals, which is transferred from the space of the linear functionals. The algebra so obtained is called the umbral algebra, and the umbral calculus is the study of this algebra. In this paper, we investigate some umbral representations in the actuarial polynomials.

• 한국정보통신학회논문지
• /
• 제19권12호
• /
• pp.2865-2870
• /
• 2015

최근 양자 컴퓨터가 개발되는 등 컴퓨팅 하드웨어의 성능이 발전하면서 단시간 내에 처리할 수 있는 정보의 양이 기하급수적으로 증가하고 있다. Koblitz-Fellows가 제안한 암호시스템은 생성할 수 있는 불변 다항식(invariant polynomial)의 개수가 충분하지 않아 특정 3-정규 그래프에서 완전지배집합(Perfect Dominating Set, PDS)을 찾는 문제가 NP-complete임을 보장할 수 없는 문제점이 발생한다. 본 논문에서는 이러한 취약점을 보완하기 위해 Koblitz-Fellows가 제안한 3-정규 그래프 상에서 완전지배집합을 이용하여 불변 다항식의 개수를 기하급수적으로 증가시킴으로 계산의 복잡도를 더욱 난해하게 하여 암호시스템의 취약점을 개선하도록 제안한다.