• 제목/요약/키워드: Cubic complex polynomial

검색결과 7건 처리시간 0.02초

SOME CUBIC JULIA SETS

  • Lee, Hung-Hwan;Baek, Hun-Ki
    • Journal of applied mathematics & informatics
    • /
    • 제4권1호
    • /
    • pp.31-38
    • /
    • 1997
  • We figure out geometric properties of the Julia set $J_{\alpha}$ of cubic complex polynomial $C_{\alpha}(z)=z^3 + {\alpha}z(\alpha \epsilon \mathbb{C})$ and the smallest ellipse which surrounds $J_{\alpha}$.

G2 Continuity Smooth Path Planning using Cubic Polynomial Interpolation with Membership Function

  • Chang, Seong-Ryong;Huh, Uk-Youl
    • Journal of Electrical Engineering and Technology
    • /
    • 제10권2호
    • /
    • pp.676-687
    • /
    • 2015
  • Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

A Method for Distinguishing the Two Candidate Elliptic Curves in the Complex Multiplication Method

  • Nogami, Yasuyuki;Obara, Mayumi;Morikawa, Yoshitaka
    • ETRI Journal
    • /
    • 제28권6호
    • /
    • pp.745-760
    • /
    • 2006
  • In this paper, we particularly deal with no $F_p$-rational two-torsion elliptic curves, where $F_p$ is the prime field of the characteristic p. First we introduce a shift product-based polynomial transform. Then, we show that the parities of (#E - 1)/2 and (#E' - 1)/2 are reciprocal to each other, where #E and #E' are the orders of the two candidate curves obtained at the last step of complex multiplication (CM)-based algorithm. Based on this property, we propose a method to check the parity by using the shift product-based polynomial transform. For a 160 bits prime number as the characteristic, the proposed method carries out the parity check 25 or more times faster than the conventional checking method when 4 divides the characteristic minus 1. Finally, this paper shows that the proposed method can make CM-based algorithm that looks up a table of precomputed class polynomials more than 10 percent faster.

  • PDF

펴지추론과 다항식에 기초한 활성노드를 가진 자기구성네트윅크 (Self-organizing Networks with Activation Nodes Based on Fuzzy Inference and Polynomial Function)

  • 김동원;오성권
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.15-15
    • /
    • 2000
  • In the past couple of years, there has been increasing interest in the fusion of neural networks and fuzzy logic. Most of the existing fused models have been proposed to implement different types of fuzzy reasoning mechanisms and inevitably they suffer from the dimensionality problem when dealing with complex real-world problem. To overcome the problem, we propose the self-organizing networks with activation nodes based on fuzzy inference and polynomial function. The proposed model consists of two parts, one is fuzzy nodes which each node is operated as a small fuzzy system with fuzzy implication rules, and its fuzzy system operates with Gaussian or triangular MF in Premise part and constant or regression polynomials in consequence part. the other is polynomial nodes which several types of high-order polynomials such as linear, quadratic, and cubic form are used and are connected as various kinds of multi-variable inputs. To demonstrate the effectiveness of the proposed method, time series data for gas furnace process has been applied.

  • PDF

형태 보존성을 위한 자유 형태 곡선 보간 방법 (Free-Form Curve Interpolation Method for Shape Preservation)

  • 이아리;박철호;심재홍
    • 한국정보처리학회논문지
    • /
    • 제6권3호
    • /
    • pp.758-765
    • /
    • 1999
  • Shape-preserving property is the important method that controls the complex free form curve/surface. Interpolation method for the existed Shape-Preservation had problems that it has needed the minimization of a curvature-related functions for calculating single-valued data. Solving this problem, in this paper, it proposed to the algorithm of generalizing C piecewise parametric cubic that has shape-preserving property for both Single-value data and Multivalue data. When there are the arbitrary tangents and two data, including shape-preserving property, this proposed method gets piecewise parametric cubic polynomial by checking the relation between the shape-preserving property and then calculates efficiently the control points using that. Also, it controls the initial shape using curvature distribution on curve segments.

  • PDF

임의의 점 군 데이터로부터 쾌속조형을 위한 입력데이터의 자동생성 (Automatic Generation of the Input Data for Rapid Prototyping from Unorganized Point Cloud Data)

  • 유동진
    • 한국정밀공학회지
    • /
    • 제24권11호
    • /
    • pp.144-153
    • /
    • 2007
  • In order to generate the input data for rapid prototyping, a new approach which is based on the implicit surface interpolation method is presented. In the method a surface is reconstructed by creating smooth implicit surface from unorganized cloud of points through which the surface should pass. In the method an implicit surface is defined by the adaptive local shape functions including quadratic polynomial function, cubic polynomial function and RBF(Radial Basis Function). By the reconstruction of a surface, various types of error in raw STL file including degenerated triangles, undesirable holes with complex shapes and overlaps between triangles can be eliminated automatically. In order to get the slicing data for rapid prototyping an efficient intersection algorithm between implicit surface and plane is developed. For the direct usage for rapid prototyping, a robust transformation algorithm for the generation of complete STL data of solid type is also suggested.

다항식 뉴럴네트워크 구조의 최적 설계에 관한 연구 (A Study on the Optimal Design of Polynomial Neural Networks Structure)

  • 오성권;김동원;박병준
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제49권3호
    • /
    • pp.145-156
    • /
    • 2000
  • In this paper, we propose a new methodology which includes the optimal design procedure of Polynomial Neural Networks(PNN) structure for model identification of complex and nonlinear system. The proposed PNN algorithm is based on GMDA(Group Method of Data handling) method and its structure is similar to Neural Networks. But the structure of PNN is not fixed like in conventional Neural Networks and can be generated. The each node of PNN structure uses several types of high-order polynomial such as linear, quadratic and cubic, and is connected as various kinds of multi-variable inputs. In other words, the PNN uses high-order polynomial as extended type besides quadratic polynomial used in GMDH, and the number of input of its node in each layer depends on that of variables used in the polynomial. The design procedure to obtain an optimal model structure utilizing PNN algorithm is shown in each stage. The study is illustrated with the aid of pH neutralization process data besides representative time series data for gas furnace process used widely for performance comparison, and shows that the proposed PNN algorithm can produce the model with higher accuracy than previous other works. And performance index related to approximation and prediction capabilities of model is evaluated and also discussed.

  • PDF