• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.2
• /
• pp.167-174
• /
• 2014

In this paper, we address a task allocation problem for a robot team that performs a search and attack mission. The robots are limited in sensing and communication capabilities, and carry different types of resources that are used to attack a target. The environment is uncertain and dynamic where no prior information about targets is given and dynamic events unpredictably happen. The goal of robot team is to collect total utilities as much as possible by destroying targets in a mission horizon. To solve the problem, we propose a distributed task allocation framework incorporated with effective resource management based on resource welfare. The framework we propose enables the robot team to retain more robots available by balancing resources among robots, and respond smoothly to dynamic events, which results in system performance improvement.

• Journal of Information Management
• /
• v.34 no.2
• /
• pp.55-66
• /
• 2003

The Web is rich with various sources of information. It contains the contents of documents, multimedia data, shopping materials and so on. Due to the massive and heterogeneous web document collections, users want to find various types of target pages. We can classify user queries as three categories according to users'intent, content search, the site search, and the service search. In this paper, we present that different strategies are needed to meet the need of a user. Also we show the properties of content information, link information and URL information according to the class of a user query. In the content search, content information showed the good result. However, we lost the performance by combining link information and URL information. In the site search, we could increase the performance by combining link information and URL information.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.645-653
• /
• 2002

The unit commitment problem in a power system involves determining the start-up and shut-down schedules of many dynamos for a day or a week while satisfying the power demands and diverse constraints of the individual units in the system. It is very difficult to derive an economically optimal schedule due to its huge search space when the number of dynamos involved is large. Tabu search is a popular solution method used for various optimization problems because it is equipped with effective means of searching beyond local optima and also it can naturally incorporate and exploit domain knowledge specific to the target problem. When given a large-scaled problem with a number of complicated constraints, however, tabu search cannot easily find a good solution within a reasonable time. This paper shows that a large- scaled optimization problem such as the unit commitment problem can be solved efficiently by using a parallel tabu search. The parallel tabu search not only reduces the search time significantly but also finds a solution of better quality.

• Bulletin of the Korean Chemical Society
• /
• v.25 no.11
• /
• pp.1703-1706
• /
• 2004

• Management Science and Financial Engineering
• /
• v.13 no.2
• /
• pp.141-157
• /
• 2007

In this paper, we address a design problem and a case study of a K-stage back-light-unit(BLU) inspection system, which is composed of K stages, each of which includes an inspection process and a rework process. Assuming the type I, II errors and the inspection-free policy for items classified as good, we determine the smallest integer of K which can achieve a given target defective rate. If K does not exist, holding the current values of the type I, II errors, we search reversely the defective rate of an assembly line and the defective rate of a rework process, to meet the target defective rate. Our formulae and methodology based on a K-stage inspection system could be applied and extended to similar situations with slight modification.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.264-266
• /
• 2009

A skill is defined as the special ability to do something well, especially as acquired by learning and practice. To learn a skill, a Bayesian network model for representing the skill is first learned. We will regard the Bayesian network for a skill as an affordance. We propose a soft Behavior Motivation(BM) switch as a method for ordering affordances to accomplish a task. Then, a skill is constructed as a combination of an affordance and a soft BM switch. To demonstrate the validity of our proposed method, some experiments were performed with GENIBO(Pet robot) performing a task using skills of Search-a-target-object, Approach-a-target-object, Push-up-in front of -a-target-object.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.5
• /
• pp.1220-1228
• /
• 1995

In this paper, we consider the problems of tracking an object in a real image. In evaluating these problems, we explore a new technique based on an active contour model commonly called a snake model, and propose the active bar models to represent target. Using this model, we simplified the target welection problems, reduced the search space of energy surface, and obtained the better performances than those of snake model. This approach improves the numerical stability and the tendency for points to bunch up and speed up the computational efficiency. Representing the object by active bar, we can easily obtain the zeroth, the first, and the second moment and it facilitates the target tracking. Finally, we present the good result for the visual tracking problem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1457-1460
• /
• 2003

현재까지 개발된 약물들은 그 종류가 매우 다양하며 그 작용기전 또한 매우 다양하다. 약물이 작용하는 기전에 따라 같은 약물이 다른 용도로 사용되기도 하고, 약물이 어떤 Target 들에 작용을 하게 되면 생체 내에서 이 Target 이 다른 생체 내 분자들과 상호작용을 함으로써 우리가 원하는 약효나 원치 않았던 부작용들이 나타나게 된다. 이렇듯 약물과 그 약물이 작용하는 Target에 대한 정보의 구축은 약물의 매우 중요한 정보이며, 이러한 정보의 데이터베이스화는 차후 신약개발에 있어 매우 중요한 정보로 사용될 수 있다. 본 논문에서는 이렇게 구축된 약물 데이터베이스에 대하여 이의 사용자 편의성을 극대화하는 효율적인 검색 모듈을 제시한다.

• Journal of Advanced Navigation Technology
• /
• v.17 no.5
• /
• pp.568-573
• /
• 2013

In this paper, we propose a differential fault analysis on symmetry structured SPN block cipher proposed in 2008. The target algorithm has the SPN structure and a symmetric structure in encryption and decryption process. To recover the 128-bit secret key of the target algorithm, this attack requires only one random byte fault and an exhaustive search of $2^8$. This is the first known cryptanalytic result on the target algorithm.

• Genomics & Informatics
• /
• v.20 no.4
• /
• pp.47.1-47.13
• /
• 2022

Klebsiella pneumoniae is a gram-negative bacterium that is known for causing infection in nosocomial settings. As reported by the World Health Organization, carbapenem-resistant Enterobacteriaceae, a category that includes K. pneumoniae, are classified as an urgent threat, and the greatest concern is that these bacterial pathogens may acquire genetic traits that make them resistant towards antibiotics. The last class of antibiotics, carbapenems, are not able to combat these bacterial pathogens, allowing them to clonally expand antibiotic-resistant strains. Most antibiotics target essential pathways of bacterial cells; however, these targets are no longer susceptible to antibiotics. Hence, in our study, we focused on a hypothetical protein in K. pneumoniae that contains a DNA methylation protein domain, suggesting a new potential site as a drug target. DNA methylation regulates the attenuation of bacterial virulence. We integrated computational-aided drug design by using a bioinformatics approach to perform subtractive genomics, virtual screening, and fingerprint similarity search. We identified a new potential drug, koenimbine, which could be a novel antibiotic.