• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.20-28
• /
• 2012

We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1441-1446
• /
• 2010

This paper presents a method of constructing the divider using sequential logic systems over finite fields(or galois fields). The proposed the sequential logic systems is constructed by as following. First of all, we obtain the linear characteristics between present state and next state based on mathematical properties of finite fields and sequential logic systems. Next, we realize the sequential logic systems over finite fields using above linear characteristics and characteristic polynomial which is expressed using by matrix. Also, we apply to implement divider using the proposed sequential logic systems over finite fields.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.156-163
• /
• 2013

The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.629-632
• /
• 1997

This paper presents the design method of controller which is combined Genetic Algorithms with the Generalized minimum variance self tuning controller. It is shown that the controllers adapts to changes in the system parameters with time delays and noises. The self tuning effect is achieved through the recursive least square algorithm at the parameter estimation stage and also through the Robbins-Monro algorithm at the stage of optimizing a polynomial parameters. The computer simulation results are presented to illustrate the procedure and to show the performance of the control system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.368-368
• /
• 2000

In this paper, we present forecasting ozone concentration with decision support system. Since the mechanism of ozone concentration is highly complex, nonlinear, and nonstationary, modeling of ozone prediction system has many problems and results of prediction are not good performance so far. Forecasting ozone concentration with decision support system is acquired to information from human knowledge and experiment data. Fuzzy clustering method uses the acquisition and dynamic polynomial neural network gives us a good performance for ozone prediction with ability of superior data approximation and self-organization.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1875-1877
• /
• 2002

There exist several forms of transfer function descriptions for multivariable LTI systems. We treat transfer function matrix with characteristic polynomial as its common denominator named Characteristic Transfer-function Matrices (CTM). First, we clarify necessary and sufficient conditions of CTM, then, we show some related lemmas. These interpretations not only offer deeper explanations but they also provide ways for calculations of all possible transfer matrices, system zeros, and inverse polynomial matrices.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1099-1115
• /
• 2019

In the present paper, we establish certain $L^p$ bounds for the generalized parametric Marcinkiewicz integral operators associated to surfaces generated by polynomial compound mappings with rough kernels in Grafakos-Stefanov class ${\mathcal{F}}_{\beta}(S^{n-1})$. Our main results improve and generalize a result given by Al-Qassem, Cheng and Pan in 2012. As applications, the corresponding results for the generalized parametric Marcinkiewicz integral operators related to the Littlewood-Paley $g^*_{\lambda}$-functions and area integrals are also presented.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.479-482
• /
• 2005

본 논문에서는 퍼지 뉴럴네트워크의 새로운 구조인 Fuzzy Set-based Polynomial Neural Networks(FSPNN)을 소개한다. 제안된 모델은 일반적인 최적화 방법과 정보 입자를 이용하여 네트워크를 설계한다. 최종 구조는 Fuzzy Set-based Polynomial Neuron(FSPN)을 기반으로 설계한 FPNN과 동일하다. 첫째로 FSPNS의 종합적인 설계방법(유전자 알고리즘을 이용한 최적 구조 탐색)에 대해 소개한다. FSPNN에 관계되는 입력변수의 개수, 후반부 다항식의 차수, 멤버쉽 함수의 수 그리고 입력변수 개수에 따른 입력변수를 유전자 알고리즘을 통하여 동조한다. 두 번째로, 입력 변수의 개별적인 퍼지 규칙 형성과 퍼지 공간 분할 및 삼각형 멤버쉽 함수의 초기 정점을 HCM 클러스터링을 통한 Information Granules로 정의한다. 또한 데이터 입자의 중심을 이용하여 후반부의 구조를 결정한다. 이 네트워크의 성능은 기존에 퍼지 또는 뉴로퍼지 모델링에서 실험된 모델링 표준치를 이용하여 평가한다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.8
• /
• pp.731-738
• /
• 2011

In this paper, we introduce an advanced architecture of K-Means clustering-based polynomial Radial Basis Function Neural Networks (p-RBFNNs) designed with the aid of SSOA (Space Search Optimization Algorithm) and develop a comprehensive design methodology supporting their construction. In order to design the optimized p-RBFNNs, a center value of each receptive field is determined by running the K-Means clustering algorithm and then the center value and the width of the corresponding receptive field are optimized through SSOA. The connections (weights) of the proposed p-RBFNNs are of functional character and are realized by considering three types of polynomials. In addition, a WLSE (Weighted Least Square Estimation) is used to estimate the coefficients of polynomials (serving as functional connections of the network) of each node from output node. Therefore, a local learning capability and an interpretability of the proposed model are improved. The proposed model is illustrated with the use of nonlinear function, NOx called Machine Learning dataset. A comparative analysis reveals that the proposed model exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.3
• /
• pp.387-393
• /
• 2015

In Electronic Commerce and Secret Communication based on ECC over finite field, if the sender and the receiver use different basis of finite fields, then the time of communication should always be delayed. In this paper, we analyze the number of bases-transformations needed for Electronic Signature in Electronic Commerce and Secret Communication based on ECC over finite field between H/W and S/W implementation systems and introduce the anomalous basis of finite fields using AOP which is efficient for H/W, S/W implementation systems without bases-transformations for Electronic Commerce and Secret Communication. And then we propose a new multiplier based on the anomalous basis of finite fields using AOP which reduces the running time by 25% than that of the multiplier based on finite fields using trinomial with polynomial bases.