• 융합보안논문지
• /
• 제14권7호
• /
• pp.59-64
• /
• 2014

이 논문에서는 고정된 개수를 가진 bin들을 이용하여 실행 복잡도가 $p(n){\cdot}2^{O(\sqrt{n})}$인 알고리즘을 제시한다, 여기서 x는 (5)n개의 객체들에 대한 리스트의 길이에 대한 총 비트 수를 나타낸다. 이러한 방법은 수치적 크기나 비중의 합의 리스트를 이용하는 여러 가지 최적화 알고리즘이나 결정 문제등에 적용할 수 있다. 이 논문에서 제시한 알고리즘은 의사-다항식(pseudo-polynomial) 시간을 갖는 NP-Complete의 많은 문제들을 결정적인 서브-지수 시간에 해결할 수 있은 가능성을 제시한다. 여기서 제시한 알고리즘을 이용하여 생명공학의 유전자 분석에 적용하려고 한다.

• Journal of information and communication convergence engineering
• /
• 제16권3호
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• 대한수학회논문집
• /
• 제37권4호
• /
• pp.1221-1248
• /
• 2022

In this paper we study the theory of knotoids and braidoids and the theory of pseudo knotoids and pseudo braidoids on the torus T. In particular, we introduce the notion of mixed knotoids in S², that generalizes the notion of mixed links in S³, and we present an isotopy theorem for mixed knotoids. We then generalize the Kauffman bracket polynomial, <; >, for mixed knotoids and we present a state sum formula for <; >. We also introduce the notion of mixed pseudo knotoids, that is, multi-knotoids on two components with some missing crossing information. More precisely, we present an isotopy theorem for mixed pseudo knotoids and we extend the Kauffman bracket polynomial for pseudo mixed knotoids. Finally, we introduce the theories of mixed braidoids and mixed pseudo braidoids as counterpart theories of mixed knotoids and mixed pseudo knotoids, respectively. With the use of the L-moves, that we also introduce here for mixed braidoid equivalence, we formulate and prove the analogue of the Alexander and the Markov theorems for mixed knotoids. We also formulate and prove the analogue of the Alexander theorem for mixed pseudo knotoids.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.427-438
• /
• 2005

From a notion of d-pseudo-orthogonality for a sequence of poly-nomials ($d\;\in\;{2,3,\cdots}$), this paper introduces three different characterizations of natural exponential families (NEF's) with polynomial variance functions of exact degree 2d-1. These results provide extended versions of the Meixner (1934), Shanbhag (1972, 1979) and Feinsilver (1986) characterization results of quadratic NEF's based on classical orthogonal polynomials. Some news sets of polynomials with (2d-1)-term recurrence relation are then pointed out and we completely illustrate the cases associated to the families of positive stable distributions.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2004년도 추계학술대회 및 정기총회
• /
• pp.225-228
• /
• 2004

The generalized knapsack problem, or gknap is the combinatorial optimization problem of optimizing a nonnegative linear functional over the integral hull of the intersection of a polynomially separable 0 - 1 polytope and a knapsack constraint. Among many potential applications, the knapsack, the restricted shortest path, and the restricted spanning tree problem are such examples. We prove via the ellipsoid method the equivalence between the fully polynomial approximability and a certain pseudo-polynomial separability of the gknap polytope.

• 대한산업공학회지
• /
• 제27권4호
• /
• pp.379-383
• /
• 2001

The restricted shortest path problem is known to be weakly NP-hard and solvable in pseudo-polynomial time. Four fully polynomial approximation schemes (FPAS) are available in the literature, and most of these are based on pseudo-polynomial algorithms. In this paper, we propose a new FPAS that can be easily derived from a combination of a set of standard techniques. Although the complexity of the suggested algorithm is not as good as the fastest one available in the literature, it is practical in the sense that it does not rely on the bound tightening phase based on approximate binary search as in Hassin's fastest algorithm. In addition, we provide a review of standard techniques of existing works as a useful reference.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.537-539
• /
• 1999

When dealing with a controller design in the two parameter configuration, there are some situations when neither a known pseudo inverse technique nor the inverse method can be applicable. In this case, we propose two methods of designing a controller by the gradient algorithm and the new pseudo inverse method such that the designed closed loop polynomial may be equal to or nearly equal to the desired closed loop polynomial. We compare the proposed methods with the known methods. We use the Manabe standard form as a desired closed loop characteristic polynomial.

• 대한수학회논문집
• /
• 제35권4호
• /
• pp.1299-1307
• /
• 2020

We show that the Liechti-Strenner's example for the closed nonorientable surface in [13] minimizes the dilatation within the class of pseudo-Anosov homeomorphisms with an orientable invariant foliation and all but the first coefficient of the characteristic polynomial of the action induced on the first cohomology nonpositive. We also show that the Liechti-Strenner's example of orientation-reversing homeomorphism for the closed orientable surface in [13] minimizes the dilatation within the class of pseudo-Anosov homeomorphisms with an orientable invariant foliation and all but the first coefficient of the characteristic polynomial p(x) of the action induced on the first cohomology nonpositive or all but the first coefficient of p(x)(x ± 1)², p(x)(x² ± 1), or p(x)(x² ± x + 1) nonpositive.

• 한국경영과학회지
• /
• 제36권2호
• /
• pp.43-50
• /
• 2011

We consider the separation problem of the rank-1 Chvatal-Gomory (C-G) inequalities for the 0-1 knapsack problem with the knapsack capacity defined by an additional binary variable, which we call the fixed-charge 0-1 knapsack problem. We analyze the structural properties of the optimal solutions to the separation problem and show that the separation problem can be solved in pseudo-polynomial time. By using the result, we also show that the existence of a pseudo-polynomial time algorithm for the separation problem of the rank-1 C-G inequalities of the ordinary 0-1 knapsack problem.

• 호남수학학술지
• /
• 제43권3호
• /
• pp.503-511
• /
• 2021

In this present work, we obtain certain coefficients of the subclass 𝓗_λ,𝛄(s, b, n) of non-Bazilević functions and estimate the relevant connection to the famous classical Fekete-Szegö inequality of functions belonging to this class.