• Title/Summary/Keyword: Multi-Point

Search Result 2,352, Processing Time 0.032 seconds

A New Diversity Preserving Evolutionary Programming Technique (다양성을 유지하는 새로운 진화 프로그래밍 기법)

  • 신정환;진성일;최두현
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1011-1014
    • /
    • 1999
  • In this paper, a new algorithm has been presented that helps to preserve diversity as well as to enhance the convergence speed of the evolutionary programming. This algorithm is based on the cell partitioning of search region for preserving the diversity. Until now, the greater part of researches is not concerned about preserving the diversity of individuals in a population but improving convergence speed. Although these evolutions are started from multi-point search at the early phase, but at the end those search points are swarming about a one-point, the strong candidate. These evolutions vary from the original idea in some points such as multi-point search. In most case we want to find the only one point of the best solution not several points in the vicinity of that. That is why the cell partitioning of search region has been used. By restricting the search area of each individual, the diversity of individual in solution space is preserved and the convergence speed is enhanced. The efficiency of the proposed algorithm has been verified through benchmark test functions.

  • PDF

EXISTENCE RESULTS FOR POSITIVE SOLUTIONS OF NON-HOMOGENEOUS BVPS FOR SECOND ORDER DIFFERENCE EQUATIONS WITH ONE-DIMENSIONAL p-LAPLACIAN

  • Liu, Yu-Ji
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.1
    • /
    • pp.135-163
    • /
    • 2010
  • Motivated by [Science in China (Ser. A Mathematics) 36 (2006), no. 7, 721?732], this article deals with the following discrete type BVP $\LARGE\left\{{{\;{\Delta}[{\phi}({\Delta}x(n))]\;+\;f(n,\;x(n\;+\;1),{\Delta}x(n),{\Delta}x(n + 1))\;=\;0,\;n\;{\in}\;[0,N],}}\\{\;{x(0)-{\sum}^m_{i=1}{\alpha}_ix(n_i) = A,}}\\{\;{x(N+2)-\;{\sum}^m_{i=1}{\beta}_ix(n_i)\;=\;B.}}\right.$ The sufficient conditions to guarantee the existence of at least three positive solutions of the above multi-point boundary value problem are established by using a new fixed point theorem obtained in [5]. An example is presented to illustrate the main result. It is the purpose of this paper to show that the approach to get positive solutions of BVPs by using multifixed-point theorems can be extended to treat nonhomogeneous BVPs. The emphasis is put on the nonlinear term f involved with the first order delta operator ${\Delta}$x(n).

Ignitability and Combustion Characteristics of Lean Mixture by Multi-Point Ignition (희박혼합기에 대한 다점점화의 점화능력 및 연소특성)

  • ;;;Lee, Sang Joon;Han, Sung Bin;Lee, Jong Tai
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.10
    • /
    • pp.2607-2616
    • /
    • 1995
  • The influences of number of spark plug on ignitability, combustion characteristics and combustion promotion effect were examined to establish the design conception of spark ignition system for lean burn. Ignitability was increased remarkably by increasing of number of spark plug at combustion wall. Combustion duration was shortened and maximum combustion pressure was increased in accordance with increasing of spark plug number. Rate of overall combustion promotion considered of combustion duration and combustion pressure was 28% in two point ignition and 40% in four point ignition. It was verified that heat release, heat loss and combustion duration were affected by flame area, heat transfer area and maximum flame travel distance respectively.

Design of New Channel Codes for Speed Up Coding Procedure (코딩 속도향상을 위한 채널 코드의 설계)

  • 공형윤;이창희
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.5-8
    • /
    • 2000
  • In this paper, we present a new cぉnet coding method, so called MLC (Multi-Level Codes), for error detection and correction in digital wireless communication. MLC coding method we the same coding procedure wed in the convolutional coding but it is distinguished from the existing convolutional coding in point of generating the code word by using multi-level information data (M-ary signal) and in point of speed of coding procedure Through computer simulation, we analyze the performance of the coding method suggested here compared to convolutional coding method in case of modulo-operation and in case of non-binary coding Procedure respectively under various channel environments.

  • PDF

DSCP Scheme of Effective Service Class in Multi DiffServ Networks (Multi DiffServ Network에서 효율적인 Service Class의 DSCP 적응 기법)

  • 김태욱;백승원;이동춘
    • Proceedings of the Korea Information Assurance Society Conference
    • /
    • 2004.05a
    • /
    • pp.43-50
    • /
    • 2004
  • Diffserv Network DSCP(Differentiated Service Code Point)는 8bit로 구성되어 있고, 그 중 6bit만 사용되고, 나머지 2bit는 비워져 있는 상태로 있다. 이 2bit를 사용하여, DF(Default Forwarding), EF(Expedited Forwarding), AF(Assured Forwarding)의 DSCP 에 각각의 Service Class Code Point를 부여해서 사용자의 패킷을 구분하여 서비스하는 DiffServ 같은 경우 상용화가 되었을 때, DiffServ를 서비스하는 망에서 동일한 DiffServ 정책을 설정해서 사용할 수 있는 기법을 제안한다.

  • PDF

Determination of optimal contact forces for multi-fingered robotic hands (다지 다관절 로봇 손의 최적 접촉력 결정 방법)

  • 백주현;서일홍;최동훈
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10a
    • /
    • pp.52-56
    • /
    • 1990
  • An algorithm is proposed to determine the optimal contact forces of robotic hands, where the soft finger contact as well as the frictional point contact are considered. Especially, the algorithm can be efficiently applied to the case of multi-point contact by inner-link as well as fingertip. To show the validities of the algorithm, several numerical exampies are presented by employing a robotics hand with three fingers each of which has four joints.

  • PDF

FCM for the Multi-Scale Problems (고속 최소자승 점별계산법을 이용한 멀티 스케일 문제의 해석)

  • 김도완;김용식
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2002.10a
    • /
    • pp.599-603
    • /
    • 2002
  • We propose a new meshfree method to be called the fast moving least square reproducing kernel collocation method(FCM). This methodology is composed of the fast moving least square reproducing kernel(FMLSRK) approximation and the point collocation scheme. Using point collocation makes the meshfree method really come true. In this paper, FCM Is shown to be a good method at least to calculate the numerical solutions governed by second order elliptic partial differential equations with geometric singularity or geometric multi-scales. To treat such problems, we use the concept of variable dilation parameter.

  • PDF

FIXED POINTS OF MULTI-VALUED OSILIKE-BERINDE NONEXPANSIVE MAPPINGS IN HYPERBOLIC SPACES

  • Kiran Dewangan;Niyati Gurudwan;Laxmi Rathour
    • Nonlinear Functional Analysis and Applications
    • /
    • v.28 no.3
    • /
    • pp.685-702
    • /
    • 2023
  • This paper is concerned with fixed point results of a finite family of multi-valued Osilike-Berinde nonexpansive type mappings in hyperbolic spaces along with some numerical examples. Also strong convergence and ∆-convergence of a sequence generated by Alagoz iteration scheme are investigated.

Multi-GNSS Standard Point Positioning using GPS, GLONASS, BeiDou and QZSS Measurements Recorded at MKPO Reference Station in South Korea

  • Choi, Byung-Kyu;Cho, Chang-Hyun;Cho, Jung Ho;Lee, Sang Jeong
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.4 no.4
    • /
    • pp.205-211
    • /
    • 2015
  • The Global Navigation Satellite System (GNSS) is undergoing dramatic changes. Nowadays, much more satellites are transmitting navigation data at more frequencies. A multi-GNSS analysis is performed to improve the positioning accuracy by processing combined observations from different GNSS. The multi-GNSS technique can improve significantly the positioning accuracy. In this paper, we present a combined Global Positioning System (GPS), the GLObal NAvigation Satellite System (GLONASS), the China Satellite Navigation System (BeiDou), and the Quasi-Zenith Satellite System (QZSS) standard point positioning (SPP) method to exploit all currently available GNSS observations at Mokpo (MKPO) station in South Korea. We also investigate the multi-GNSS data recorded at MKPO reference station. The positioning accuracy is compared with several combinations of the satellite systems. Because of the different frequencies and signal structure of the different GNSS, intersystem biases (ISB) parameters for code observations have to be estimated together with receiver clocks in multi-GNSS SPP. We also present GPS/GLONASS and GPS/BeiDou ISB values estimated by the daily average.