• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 2001년도 추계학술발표회요약집
• /
• pp.341.1-341
• /
• 2001

• Kyungpook Mathematical Journal
• /
• 제5권2호
• /
• pp.47-50
• /
• 1963

• Kyungpook Mathematical Journal
• /
• 제7권1호
• /
• pp.5-6
• /
• 1967

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
• /
• pp.1363-1366
• /
• 2003

This paper introduces computerized version of Hangout(Korean Language) Standard Pronunciation Rule that can be used in Korean processing systems such as Korean voice synthesis system and Korean voice recognition system. For this purpose, we build Petri net models for each items of the Standard Pronunciation Rule, and then integrate them into the vocal sound conversion table. The reversion of Hangul Standard Pronunciation Rule regulates the way of matching vocal sounds into grammatically correct written characters. This paper presents not only the vocal sound conversion table but also character conversion table obtained by reversely converting the vocal sound conversion table. Making use of these tables, we have implemented a Hangeul character into a vocal sound system and a Korean vocal sound into character conversion system, and tested them with various data sets reflecting all the items of the Standard Pronunciation Rule to verify the soundness and completeness of our tables. The test results shows that the tables improves the process speed in addition to the soundness and completeness.

• 로봇학회논문지
• /
• 제2권4호
• /
• pp.304-309
• /
• 2007

This paper describes an efficient path generation method for area coverage. Its applications include robots for de-mining, cleaning, painting, and so on. Our method is basically based on a divide and conquer strategy. We developed a novel cell decomposition algorithm that divides a given area into several cells. Each cell is covered by a robot motion that requires minimum time to cover the cell. Using this method, completeness and time efficiency of coverage are easily achieved. For the completeness of coverage in dynamic environments, we also propose a path following method that makes the robot cover missed areas as a result of the presence of unknown obstacles. The effectiveness of the method is verified using computer simulations.

• 경영과학
• /
• 제31권2호
• /
• pp.65-70
• /
• 2014

This paper considers a single machine scheduling problem to determine release and processing times where both the release times and processing times are linearly decreasing functions of resources. The objective is to minimize the sum of the associated resource consumption cost and scheduling cost including makespan, sum of completion times, maximum lateness, or sum of lateness. This paper proves that the scheduling problem is NP-hard in the strong sense even if the release times are constant.

• 대한수학회지
• /
• 제46권3호
• /
• pp.551-560
• /
• 2009

A theorem of Robert Blumenthal is used here in order to obtain a sufficient condition for a function between two Finsler manifolds to be a fibre bundle map. Our study is connected with two possible constructions: 1) a Finslerian generalization of usually Kaluza-Klein theories which use Riemannian metrics, the well-known particular case of Finsler metrics, 2) a Finslerian version of reduction process from geometric mechanics. Due to a condition in the Blumenthal's result the completeness of Euler-Lagrange vector fields of Finslerian type is discussed in detail and two situations yielding completeness are given: one concerning the energy and a second related to Finslerian fundamental function. The connection of our last framework, namely a regular Lagrangian having the energy as a proper (in topological sense) function, with the celebrated $Poincar{\acute{e}}$ Recurrence Theorem is pointed out.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권3호
• /
• pp.147-156
• /
• 2016

A modalized Łukasiewicz three-valued propositional logic will be proposed in this paper which there are three modalities [t]; [m]; [f] to represent the three values t; m; f; respectively. And a Gentzen-typed deduction system will be given so that the the system is sound and complete with respect to the Łukasiewicz three-valued semantics Ł$_3$, which are given in soundness theorem and completeness theorem.

• 로봇학회논문지
• /
• 제1권1호
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• 논리연구
• /
• 제9권1호
• /
• pp.1-29
• /
• 2006

This paper investigates algebraic semantics for sKD and its extensions $sKD_\triangle$, $sKD\forall$, and $sKD\forall{_\triangle}$: sKD is a variant of the infinite -valued Kleene- Diense logic KD; $sKD_\triangle$ is the sKD with the Baaz's projection A; and $sKD\forall$ and $sKD\forall{_\triangle}$: are the first order extensions of sKD and $sKD_\triangle$, respectively. I first provide algebraic completeness for each of sKD and $sKD_\triangle$. Next I show that each $sKD\forall$ and $sKD\forall{_\triangle}$: is algebraically complete.