• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.47 no.2
• /
• pp.176-189
• /
• 2024

Vertical takeoff and landing (VTOL) is a core feature of unmanned aerial vehicles (UAVs), which are commonly referred to as drones. In emerging smart logistics, drones are expected to play an increasingly important role as mobile platforms. Therefore, research on last-mile delivery using drones is on the rise. There is a growing trend toward providing drone delivery services, particularly among retailers that handle small and lightweight items. However, there is still a lack of research on a structural definition of the VTOL drone flight model for multi-point delivery service. This paper describes a VTOL drone flight route structure for a multi-drone delivery service using rotary-wing type VTOL drones. First, we briefly explore the factors to be considered when providing drone delivery services. Second, a VTOL drone flight route model is introduced using the idea of the nested graph. Based on the proposed model, we describe various time-related attributes for delivery services using drones and present corresponding calculation methods. Additionally, as an application of the drone route model and the time attributes, we comprehensively describe a simple example of the multi-drone delivery for first-come-first-served (FCFS) services.

• Korean Journal of Cognitive Science
• /
• v.4 no.2
• /
• pp.29-51
• /
• 1994

This paper presents a new approach to describing the meanings of English relative clauses with the theoretical framework of Conceptual Structure Theory (henceforth CST)which builds on the pionerring work of Sowa.And this paper aims at proposing some extensions to his work. CST describes the conceptual structrures of sentences with conceptual graphs(henceforth CG). which have begun to be used as an intermediate language in natural language processing and machine translation of computer.CGs are composed of concept types and conceptual relation types. They are a system of logic for semantic representation of sentences. This paper focuses on showing the differences of the CGs according to the functions of English relative clauses. English relative clauses are divided into restrictive and nonrestrictive uses.And this paper describes a restrictive clause with a CG including a expression.which derives from the viewpoint of Montague-semantics and Nom-S Analysis.This paper deals mainly with the relative clauses of double restroction as an example of restrictive relative clauses.The description of a nonrestrictive relative clause does not need any-expression, for it doesn's involve the meaning of set.And this paper links the CG of an appositive relative clause,which is a kind of nonrestrictive clauses,to the concept of the antecedent in the main clause.The description of a nonrestrictive relative clause with adverbial meaning is strated with two CGs for the main clause and the relative clause.They are linked with an appropriate intersentential conceptual relation type according to the contextual realtions between them.This paper also presents a CG of a sentential relative clause,which gives a comment on the main clause.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.5
• /
• pp.747-754
• /
• 2001

This paper describes measurement of relative permittivity of illite found in young-dong area. A measurement of relative permittivity of the illite was made using cylindrical cavity resonators with a moveable cap. A concentric dielectric-rod inserted the cylindrical cavity resonator and an exact field representation of non-decaying mode of the resonator are introduced for the measurement of relative permittivity. The exact electromagnetic fields in cylindrical cavity with a concentric dielectric rod is analysed. The relative permittivity of dielectric in the cavity is calculated by analyzing a characteristic equation. The characteristic equation is solved by using the ContourPlot graph of Mathematica. We know that the field representation of non-decaying mode is exact. As a result, the relative permittivity of dielectric materials was 7.820 for a sample with binder and 7.894 for a pure sample.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.396-408
• /
• 2007

After the Human Genome Project finished the sequencing of a human DNA sequence, the concerns on protein functions are increasing. Since the structures of proteins are conserved in divergent evolution, their functions are determined by their structures rather than by their amino acid sequences. Therefore, if similarities between two protein structures are observed, we could expect them to have common biological functions. So far, a lot of researches on protein structure alignment have been performed. However, most of them use RMSD(Root Mean Square Deviation) as a similarity measure with which it is hard to judge the similarity level of two protein structures intuitively. In addition, they retrieve only one result having the highest alignment score with which it is hard to satisfy various users of different purpose. To overcome these limitations, we propose a novel protein structure alignment algorithm based on MRPD(Maximum of Residue Pair Distance) and SG (Similarity Graph). MRPD is more intuitive similarity measure by which fast tittering of unpromising pairs of protein pairs is possible, and SG is a compact representation method for multiple alignment results with which users can choose the most plausible one among various users' needs by providing multiple alignment results without compromising the time to align protein structures.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.6
• /
• pp.543-551
• /
• 2002

In this paper, we present an efficient decoding method that performs in real time for 20k word continuous speech recognition task. Basic search method is a one-pass Viterbi decoder on the search space constructed from the novel language model network. With the consistent search space representation derived from various language models by the LM network, we incorporate basic pruning strategies, from which tokens alive constitute a dynamic search space. To facilitate post-processing, it produces a word graph and a N-best list subsequently. The decoder is tested on the database of 20k words and evaluated with respect to accuracy and RTF.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.2
• /
• pp.39-48
• /
• 2002

It is general that the ICAI(Intelligent Computer Assisted Instruction) consists of 4 modules. Export module, Teacher module, Student module and Interface module. In each module construction, there should be some rules to control strategies efficiently and systematically that are related to the texts and assessment instruments, assessment results and evaluation, feedback, etc. It is necessary to use a method to classify the curriculum into sections with units and to represent the identified relationships between them. These relationships are available to all the process of learning, assessment, evaluation and feedback. In this paper, we propose the method to represent these units and relationships as a graph. In addition, we implement an internet-based courseware authoring tool to support the environment in which several expert can construct concurrently the courseware with cooperation between them.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.564-582
• /
• 2015

This paper proposes a novel swarm intelligence optimization method which integrates bacterial foraging optimization (BFO) with quantum computing, called quantum bacterial foraging optimization (QBFO) algorithm. In QBFO, a multi-qubit which can represent a linear superposition of states in search space probabilistically is used to represent a bacterium, so that the quantum bacteria representation has a better characteristic of population diversity. A quantum rotation gate is designed to simulate the chemotactic step for the sake of driving the bacteria toward better solutions. Several tests are conducted based on benchmark functions including multi-peak function to evaluate optimization performance of the proposed algorithm. Numerical results show that the proposed QBFO has more powerful properties in terms of convergence rate, stability and the ability of searching for the global optimal solution than the original BFO and quantum genetic algorithm. Furthermore, we examine the employment of our proposed QBFO for cognitive radio spectrum allocation. The results indicate that the proposed QBFO based spectrum allocation scheme achieves high efficiency of spectrum usage and improves the transmission performance of secondary users, as compared to color sensitive graph coloring algorithm and quantum genetic algorithm.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.2
• /
• pp.12-17
• /
• 2010

An automatic facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in the image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.705-711
• /
• 2003

An automatic face and facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in !be image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the face identification system.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.276-284
• /
• 2000

Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.