• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.204-212
• /
• 2008

We study the routing problem in all-wireless networks based on cooperative transmissions. We model the minimum-energy cooperative path (MECP) problem and prove that this problem is NP-complete. We hence design an approximation algorithm called cooperative shortest path (CSP) algorithm that uses Dijkstra's algorithm as the basic building block and utilizes cooperative transmissions in the relaxation procedure. Compared with traditional non-cooperative shortest path algorithms, the CSP algorithm can achieve a higher energy saving and better balanced energy consumption among network nodes, especially when the network is in large scale. The nice features lead to a unique, scalable routing scheme that changes the high network density from the curse of congestion to the blessing of cooperative transmissions.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.3
• /
• pp.5-12
• /
• 2008

This paper presents the features of an impact angle constrained open-loop optimal trajectory which is given by a function of initial conditions and optimal guidance gains. Using missile motion described by linearized kinematic equations and a proper form of performance index, an inverse optimal problem is suggested to investigate the gains related to the performance index. The flight trajectory and time-to-go can be shaped in terms of the optimal guidance gains. The results are evaluated by 3-DOF simulation.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.6
• /
• pp.235-245
• /
• 2007

This research study presents the development and application of an Elitist Genetic Algorithm (Elitist GA) for solving the resource-constrained project scheduling problem, which is one of the most challenging problems in construction engineering. Main features of the developed algorithm are that the elitist roulette selection operator is developed to preserve the best individual solution for the next generation so as to obtain the improved solution, and that parallel schedule generation scheme is used to generate a feasible solution to the problem. The experimental results on standard problem sets indicate that the proposed algorithm not only produces reasonably good solutions to the problems over the heuristic method and other GA, but also can find the optimal and/or near optimal solutions for the large-sized problems with multiple resources within a reasonable amount of time that will be applicable to the construction industry. This paper will help researchers and/or practitioners in the construction project scheduling software area with alternative means to find the optimal schedules by utilizing the advantages of the Elitist GA.

• 한국전산유체공학회:학술대회논문집
• /
• 1999.05a
• /
• pp.113-123
• /
• 1999

In this study a pure vector potential method (PVPM) for a three dimensional, unsteady, incompressible flow is proposed. A simplified version for a two dimensional problem is described in detail, and a method to prescribe appropriate boundary conditions is also presented. The resulting numerical algorithm is applied to the cavity flow driven by an impulsively started wall and also to the Stokes' first problem. Some important unsteady/steady features are captured for these two flows, and quantitative agreements of flow variables with available reference database are good.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.5
• /
• pp.848-860
• /
• 1994

Generally, to get the minimum distance between two arbitrary shapes that are composed of circular arcs and lines, we must calculate distances for all the possible pairs of the components from two given shapes. In this paper, we propose an efficient method for the minimum distance problem between two shapes by using their structural features after extracting the reduced component lists which are essential to calculate the minimum distance considering the relationship of shape location. Even though the reduced component lists may contain all the components of the shapes in the worst case, in the average we can reduce the required computation much by using the reduced component lists. This method may be efectively applied to calculating the minimum distance between two shapes which are generated by the CAD tool, like in the nesting system.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.137-140
• /
• 1996

This paper proposes a unit commitment scheduling method based on Parallel Genetic Algorithm(PGA). Due to a variety of constraints to be satisfied, such as the minimum up and down time constraints, the search space of the UC problem is highly nonconvex. So, we used transputer which is one of the practical parallel processors. It can give us fastness and effectiveness features of the proposed method for solving the problem. To show the effectiveness of the PGA based unit commitment scheduling, we tested results for system of 5 units and we can get desirable results.

• The Mathematical Education
• /
• v.53 no.1
• /
• pp.75-92
• /
• 2014

In this paper, we summarize briefly some of the most salient features of Repkina & Zaika's theory of learning action formation levels. We concretize Repkina & Zaika's theory by comparing various points of view of Uoo, Polya, Krutetskii, and Davydov et al. In this study we are able to diagnose students' learning action formation levels in the process of mathematics problem solving. In addition we use interview method to collect various information about students' levels. As a result we suggest data related with each level of learning action formation, and characteristics of students who belong to each level of learning action formation.

• Journal of Power Electronics
• /
• v.19 no.6
• /
• pp.1486-1495
• /
• 2019

Dealing with the DC link fault poses a technical problem for an HVDC based on a modular multilevel converter. The fault suppressing mechanisms of several sub-module topologies with DC fault current blocking capacity are examined in this paper. An improved half-bridge sub-module topology with double direction control switch is also designed to address the additional power consumption problem, and a sub-module topology called hybrid double direction blocking sub module (HDDBSM) is proposed. The DC fault suppression characteristics and sub-module capacitor voltage balance problem is also analyzed, and a self-startup method is designed according to the number of capacitors. The simulation model in PSCAD/EMTDC is built to verify the self-startup process and the DC link fault suppression features.

• Journal of Multimedia Information System
• /
• v.9 no.2
• /
• pp.93-102
• /
• 2022

Dependency parsing is a decision problem of the syntactic relation between words in a sentence. Recently, deep learning models are used for dependency parsing based on the word representations in a continuous vector space. However, it causes a mislabeled tagging problem for the proper nouns that rarely appear in the training corpus because it is difficult to express out-of-vocabulary (OOV) words in a continuous vector space. To solve the OOV problem in dependency parsing, we explored the proper noun embedding method according to the embedding unit. Before representing words in a continuous vector space, we replace the proper nouns with a special token and train them for the contextual features by using the multi-layer bidirectional LSTM. Two models of the syllable-based and morpheme-based unit are proposed for proper noun embedding and the performance of the dependency parsing is more improved in the ensemble model than each syllable and morpheme embedding model. The experimental results showed that our ensemble model improved 1.69%p in UAS and 2.17%p in LAS than the same arc-eager approach-based Malt parser.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.3
• /
• pp.613-622
• /
• 2023

In this paper, finite element method is applied to solve boundary control problem governed by elliptic variational inequality with an infinite number of variables. First, we introduce some important features of the finite element method, boundary control problem governed by elliptic variational inequalities with an infinite number of variables in the case of the control and observation are on the boundary is introduced. We prove the existence of the solution by using the augmented Lagrangian multipliers method. A triangular type finite element method is used.