• Journal of Korea Multimedia Society
• /
• v.4 no.1
• /
• pp.82-90
• /
• 2001

Genetic Algorithm(GA) has known as a method of solving NP problem in various applications. Since a major drawback of the GA is that it needs a long computation time, the hardware implementation of Genetic Algorithm is focused on in recent studies. This paper proposes a new type of embedded one chip computer fort Hardware Implementation of Genetic Algorithm. The proposed embedded one chip computer consists of 16 Bit CPU care and hardware of genetic algorithm. In contrast to conventional hardware oriented GA which is dependent on main computer in the process of GA, the proposed embedded one chip computer is independent on main computer. Conventional hardware GA uses the fixed length of chromosome but the proposed embedded one chip computer uses the variable length of chromosome by employing the efficient 16 bit Pipeline Unit. Experimental results show that the proposed one chip computer is applicable to the design of evolvable hardware for Random NRZ bit synchronization circuit.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.371-376
• /
• 2006

적응형 소프트웨어는 유비쿼터스 컴퓨팅의 핵심 분야로 홈 네트워크, 지능 로봇 등 다양한 분야에 응용이 가능하다. 하지만, 대부분의 연구가 적응형 소프트웨어의 요구사항이나 시나리오의 구체화를 위한 비전을 제시하거나, 응용 구현의 사례를 보임으로써 실현 가능성을 확인하는데 초점을 맞추고 있다. 본 연구에서는 동적인 재구성이 가능한 규칙 기반으로 동작할 수 있기 때문에 진화가 가능하며, 상태에 기반하여 행위를 판단하는 RASC 프레임워크를 제안한다. 기존 서비스 조합의 개념을 실현하기 위해 중개자를 이용하였으며, 변이와 교차와 같은 유전 알고리즘 연산을 쉽게 적용할 수 있도록 RASC 도메인을 정의하였다. RASC 프레임워크는 블랙보드 아키텍처를 기반으로 규칙을 공유하며, 서비스와 서비스 조합체 모두 자극-반응 모델을 따르고 자기유사성을 가지는 일종의 복잡계를 구성한다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.8
• /
• pp.739-746
• /
• 2011

Recently, recommender systems have been widely applied in E-commerce websites to help their customers find the items what they want. A recommender system should be able to provide users with useful information regarding their interests. The ability to immediately respond to the changes in user's preference is a valuable asset of recommender systems. This paper proposes a novel recommender system which aims to effectively adapt and respond to the immediate changes in user's preference. The proposed system combines IEC (Interactive Evolutionary Computation) with a content-based filtering method and also employs data grouping in order to improve time efficiency. Experiments show that the proposed system makes acceptable recommendations while ensuring quality and speed. From a comparative experimental study with an existing recommender system which uses the content-based filtering, it is revealed that the proposed system produces more reliable recommendations and adaptively responds to the changes in any given condition. It denotes that the proposed approach can be an alternative to resolve limitations (e.g., over-specialization and sparse problems) of the existing methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.4
• /
• pp.466-471
• /
• 2006

IAn important problem of pattern recognition is to extract or select feature set, which is included in the pre-processing stage. In order to extract feature set, Principal component analysis has been usually used and SFS(Sequential Forward Selection) and SBS(Sequential Backward Selection) have been used as a feature selection method. This paper applies genetic algorithm which is a popular method for nonlinear optimization problem to the feature selection problem. So, we call it Genetic Algorithm Feature Selection(GAFS) and this algorithm is compared to other methods in the performance aspect.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.4
• /
• pp.13-21
• /
• 2009

Game level design is one of the important parts in the commercial game development. Because of its complexity in combining game components, game design work could be classified into a non-linear problem. In this paper, we propose a new automated game level design system by using genetic algorithms. With our system, a game designer easily generates an optimized game level by designating the key parameters m the initial stage of game design. Our system can be useful in reducing the trial-errors in the initial game level design process.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.1-15
• /
• 2004

The current Internet space is evolving to the so called Ubiquitous space. Unlike the Internet space, the information in the Ubiquitous space is distributed evenly in the places like computer's memory, human's brain and physical machine. The 'hypertext', the connection model of the information, which is originally designed for the Internet space doesn't suit well to the Ubiquitous space. From this point of view, we proposed the CPM model in this paper. The CPM model is designed for comprising the such three computing mechanism as analog computing, digital computing and human computing. In this paper, we showed that the characteristics of the CPM model might answer the such purpose as the connection of information in the Ubiquitous space.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.219-220
• /
• 2022

최근 항로표지는 기본 업무를 위한 등명기의 구동과 해상 환경 정보 수집 및 데이터 전송 기능들의 확장을 통해 다양한 임무를 수행하기 위한 스마트 장비로써 진화하고 있다. 그래서 항로표지를 운영하기 위한 전력량의 요구가 높아지고 있고, 동작 구동 시간을 확보하기 위해 다양한 해상 에너지원을 통해 발전하는 시스템을 고려하고 있다. 하지만 전원 공급 및 교체가 쉽지 않은 해상 환경에서 태양광, 파력 등의 한정적인 에너지원의 활용은 지속적인 스마트 항로표지의 동작에 한계가 존재한다. 그래서 해양 환경 상황에서도 한정된 에너지원을 활용하여 에너지 수집을 하고 이를 활용하여 다양한 환경 센싱, 정보 연산, 데이터 처리, 무선 정보 전송 등의 시스템에 안정적으로 전력을 공급할 수 있는 방안이 필요하다. 본 논문에서는 해상 환경 적응 에너지 수집, 백업 전력운영, 항로표지 출력 에너지 재사용, 분산 전력관리 등을 포함한 차세대 스마트 항로표지 전원 시스템 구성 방안에 대해서 제안한다.

• The Journal of the Korea Contents Association
• /
• v.20 no.11
• /
• pp.292-300
• /
• 2020

According to the development of artificial intelligence technology, attempts have been made to interpret phenomena in various fields of the real world such as economic, social, and scientific fields through computer simulations using virtual artificial agents. In the existing artificial agent-based bargaining game analysis, there was a problem that did not reflect the cost incurred when the stage progresses in the real-world bargaining game and the depreciation of the bargaining target over time. This study intends to observe the effect on the bargaining game by adding the cost incurred in the bargaining stage and depreciation of the bargaining target over time (bargaining cost) to the previous artificial agent-based bargaining game model. As a result of the experiment, it was observed that as the cost incurred in the bargaining stage increased, the two artificial agents participating in the game had a share close to half the ratio and tried to conclude the negotiation in the early stage.

• Journal of KIISE:Software and Applications
• /
• v.32 no.4
• /
• pp.277-289
• /
• 2005

To overcome the long design time/high computational effort/low computational performance of phylogenetic learning featuring selection and reproduction, this paper proposes a genetic representation based on XML. Since genetic programs (GP) and genetic operations of this representation are maintained by the invocation of the built-in off-the-shelf XML parser's API, the proposed approach features significant reduced time consumption of GP design process. Handling only semantically correct GPs with standard XML schema can reduce search space and computational effort. Furthermore, computational performance can be improved by the parallelism of GP caused by the utilization of XML, which is a feasible system and wire format for migration of genetic programs in heterogeneous distributed computer environments. To verify the proposed approach, it is applied to the evolution of social behaviors of multiple agents modeling the predator-prey pursuit problem. The results show that the approach can be applied for fast development and time efficiency of GPs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.618-624
• /
• 2009

In the evolution from wireless sensor networks(WSNs) to ubiquitous sensor networks(USNs), technologies that can support intensive data-traffic loads, large number of users, improved interoperability, and extreme longevity are required. Therefore, efficient communication time coordination control and low power consumption becomes one of the most important design goals for USN MAC protocols. So far several time division multiplexed (TDM) MAC protocols have been proposed. However, since the pros and cons of existing protocols are not easy to analyze, it becomes a challenging task to design improved TOM MAC protocols. Based on this objective, this paper provides a novel protocol analysis along with a message complexity derivation and comparison of the existing TDM MAC protocols.