• 한국항공운항학회지
• /
• 제25권3호
• /
• pp.44-50
• /
• 2017

This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

• Kyungpook Mathematical Journal
• /
• 제55권4호
• /
• pp.1053-1067
• /
• 2015

A two-direction multiscaling function ${\phi}$ satisfies a recursion relation that uses scaled and translated versions of both itself and its reverse. This offers a more general and flexible setting than standard one-direction wavelet theory. In this paper, we investigate how to find and normalize point values and derivative values of two-direction multiscaling and multiwavelet functions. Determination of point values is based on the eigenvalue approach. Normalization is based on normalizing conditions for the continuous moments of ${\phi}$. Examples for illustrating the general theory are given.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• 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.

• 대한수학회지
• /
• 제47권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).

• 대한기계학회논문집
• /
• 제19권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2012년도 춘계학술대회 논문집
• /
• pp.291-292
• /
• 2012

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(1)
• /
• 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.

• 한국사이버테러정보전학회:학술대회논문집
• /
• 한국사이버테러정보전학회 2004년도 제1회 춘계학술발표대회
• /
• 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 정책을 설정해서 사용할 수 있는 기법을 제안한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• 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.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2002년도 가을 학술발표회 논문집
• /
• 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.