• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.95-102
• /
• 2013

In metabolomics, metabolic pathway is represented by well-displayed graph. Metabolic pathways, especially, have a complex binding structure, which makes the graphical representation hard to visualize. There is a problem that edge crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 2-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in upper layer. Then the remaining subgraphs except meaningful components are drawn in lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. This algorithm is the basis of flexible analysis for metabolic pathways.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.71-79
• /
• 2013

Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1088-1099
• /
• 2003

The syntax-directed translation using semantic actions is frequently used in construction of compiler for text programming languages. it is very useful for the language designers to develop compiler back-end using a syntax structure of a source programming language. Due to the lack of the integrated representation method for a parse tree node and modeling method of syntax structures, it is very hard to construct compiler using syntax-directed translation in visual languages. In this Paper, we propose a visual language compiler generation method for constructing a visual languages compiler automatically, using syntax-directed translation. Our method uses the Picture Layout Grammar as a underlying grammar formalism. This grammar allows our approach to generate parser efficiently u sing And-Or-Waiting Graph and encapsulating syntax definition as one unit. Unlike other systems, we suggest separating the specification and the generation of semantic actions. Because of this, it provides a very efficient method for modification.

• 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 Natural Sciences
• /
• v.8 no.1
• /
• pp.115-121
• /
• 1995

The Conventional database management system is not applicable because of their inadequate performance and difficulty of CAD database that is dependant to hierarchical structure and to repeat accesses of large data. For effective management and easy tool integration of CAD database, hierarchy Interface System(HIS) is designed and GROCO(Graph Representation fOr Complex Objects) Model is presented. Hierarchy Interface System which is composed of two subsystems of a configurator and a converter is designed for the interface between a conventional database management system and CAD tools. GROCO Model is a directed cyclic graph having five node-types for representing semantics and supports efficiently CAD database characters having a hierarchical structure of complex objects.

• 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.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3377-3395
• /
• 2015

Recently, several approaches to share road conditions and/or digital contents through VANETs have been proposed, and such approaches have generally considered the radial distance from the information source as well as the TTL to provision an ephemeral, geographically-limited information sharing service. However, they implement general MANETs and have not been tailored to the constrained movement of vehicles on roads that are mostly linear. In this paper, we propose a novel application-level mechanism that can be used to share road conditions, including accidents, detours and congestion, through a VANET. We assign probabilities to roads around each of the intersections in the neighborhood road network. We then use the graph representation of the road network to build a spanning tree of roads with the information source as the root node. Nodes below the root represent junctions, and the edges represent inter-connecting road segments. Messages propagate along the branches of the tree, and as the information propagates down the branches, the probability of replication decreases. The information is replicated until a threshold probability has been reached, and our method also ensures that messages are not delivered to irrelevant vehicles, independently of their proximity to the source. We evaluated the success rate and performance of this approach using NS-3 simulations, and we used IDM car following and MOBIL lane change models to provide realistic modeling of the vehicle mobility.