• Title/Summary/Keyword: 개체 기반

Search Result 921, Processing Time 0.03 seconds

Rank-based Formation for Multiple Robots in a Local Coordinate System (지역 좌표에서 랭크기반의 다개체 로봇 포메이션 제어)

  • Jung, Hahmin;Kim, Dong Hun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.1
    • /
    • pp.42-47
    • /
    • 2015
  • This paper presents a rank-based formation for multiple agents based on potential functions, where the proposed method uses the relative position of two neighboring agents. The conventional formation scheme of multiple systems requires communication between agents and a central computer to get the positions of all multiple agents. In the study, differently from previous studies, the formation scheme uses the relative position of two neighboring agents in a local coordinate system. In addition, it introduces a singular agent association that considers only the relative position between an agent and its neighboring agents, instead of multiple associations among all information about all agents. Furthermore, the proposed framework explores the benefits of different formation types. Extensive simulation results show that the proposed approach verifies the viability and effectiveness of the proposed formation.

PTS Technique Based on Micro-Genetic Algorithm with Low Computational Complexity (낮은 계산 복잡도를 갖는 마이크로 유전자 알고리즘 기반의 PTS 기법)

  • Kong, Min-Han;Song, Moon-Kyou
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6C
    • /
    • pp.480-486
    • /
    • 2008
  • The high peak-to-average power ratio (PAPR) of the transmitted signals is one of major drawbacks of the orthogonal frequency division multiplexing (OFDM). A partial transmit sequences (PTS) technique can improve the PAPR statistics of OFDM signals. However, in a PTS technique, the search complexity to select phase weighting factors increases exponentially with the number of sub-blocks. In this paper, a PTS technique with low computational complexity is presented, which adopts micro-genetic algorithm(${\mu}$-GA) as a search algorithm. A search on the phase weighting factors starts with a population of five randomly generated individuals. An elite having the largest fitness value and the other four individuals selected through the tournament selection strategy are determined, and then the next generation members are generated through the crossover operations among those. If the new generation converges, all the four individuals except the elite are randomly generated again. The search terminates when there has been no improvements on the PAPR during the predefined number of generations, or the maximum number of generations has been reached. To evaluate the performance of the proposed PTS technique, the complementary cumulative distribution functions (CCDF) of the PAPR are compared with those of the conventional PTS techniques.

Combining A* and Genetic Algorithm for Efficient Path Search (효율적인 경로 탐색을 위한 A*와 유전자 알고리즘의 결합)

  • Kim, Kwang Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.7
    • /
    • pp.943-948
    • /
    • 2018
  • In this paper, we propose a hybrid approach of combining $A^*$ and Genetic algorithm in the path search problem. In $A^*$, the cost from a start node to the intermediate node is optimized in principle but the path from that intermediate node to the goal node is generated and tested based on the cumulated cost and the next node in a priority queue is chosen to be tested. In that process, we adopt the genetic algorithm principle in that the group of nodes to generate the next node from an intermediate node is tested by its fitness function. Top two nodes are selected to use crossover or mutation operation to generate the next generation. If generated nodes are qualified, those nodes are inserted to the priority queue. The proposed method is compared with the original sequential selection and the random selection of the next searching path in $A^*$ algorithm and the result verifies the superiority of the proposed method.

A New Migration Method of the Multipopulation Genetic Algorithms (다중 개체군 유전자 알고리즘의 새로운 이주 방식)

  • Cha, Seong-Min;Gwon, Gi-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.1
    • /
    • pp.26-30
    • /
    • 2001
  • Multipopulation Genetic Algorithm(MPGA) is the modified form of Genetic Algorithm(GA), which was devised for covering for overing the defect of general GA. The core of MPGA is said to be the migration method. The fitness-based migration method and the random migration method are currently used. The random migration method is more general than the other because it keeps the diversity of the population. In this paper, a new migration method is suggested. This method has a merit that it can improve the speed of conergence, compared to the general migration method. This method is compared with the general migration method.

  • PDF

A Study on the based on FRAD Conceptual Model based Authority Data Scheme for Academic Papers (FRAD 개념 모형 기반의 학술논문 전거데이터 구조에 관한 연구)

  • Lee, Seok-Hyoung;Kwak, Seung-Jin
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.45 no.3
    • /
    • pp.235-257
    • /
    • 2011
  • In this study, we proposed the FRAD concept model of authority data schema for author, organization and journal titles included in the academic papers. Academic information includes author names, affiliations, publishers, journals and conferences. They are used as access points, and there are multiple relationships among these entities. It is expected that the use of authority data for academic information based on FRAD conceptual model could improve more accurate retrieval of information, systematic management of academic information, and various forms of knowledge representation. In this study, our entity-relationship authority data will be linked to the document, and included the several properties and relationship to identify the object.

Research on a Development of Business Information for the Efficient Reuse of XML Libraries (XML 라이브러리의 효율적 재사용을 위한 비즈니스 정보 개발 방안)

  • Park, Chan-Gwon;Kim, Hyeong-Do
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2008.10b
    • /
    • pp.656-663
    • /
    • 2008
  • XML 기술의 발전에 따라 확장성 있는 ebXML(Electronic Business eXtensible Markup Language) 기반의 스키마 사용이 확장되면서 점차 기존 EDI 전자문서나 DTD(Document Type Definition) 구조로 되어 있는 전자문서를 XML 스키마 형태로 변환하거나 새롭게 개발해고 있는 추세이다. 한국전자거래진흥원에서는 XML 전자운세 개발 지침과 함께 XML 라이브러리를 개발하여 제시함으로써 표준 XML 전자문서의 개발을 지원하고 있다. XML 전자문서 개발 지침은 ebXML CCTS 기술규격에서 제시하고 있는 방법론을 준용하고, UN/CEFACT ATG 그룹에서 개발한 XML Naming & Design Rule 규격을 국내에 맞게 수정하여 적용하고 있다. 또한 XML 라이브러리는 전자문서 개발지침에 따라 사전에 정의하고 개발해 놓은 핵심 컴포넌트와 비즈니스 정보 개체들로 구성되어 있다. 하지만 전자문서개발 지침상의 일부 규칙들이 의미상 명확하지 않은 상태에서 개발자의 임의적 선택의 폭을 허용하거나 개체의 명명에 대한 뚜렷한 기준을 제시하지 못함으로써 핵심 컴포넌트와 비즈니스 정보 개체의 검색 및 재사용을 제한하고 라이브러리 유지보수를 어렵게 하고 있는 실정이다. 본 연구에서는 XML 전자문서 개발지침 상의 일부 규칙에 대한 문제점을 분석, 규칙을 구제화함으로써 개발자 중립적인 핵심 컴포넌트와 비즈니스 정보 개체의 개발을 지원하고 라이브러리 관리를 효율적으로 수행할 수 있는 방안을 제시하고자 한다.

  • PDF

Automatic Construction of Restaurant Menu Dictionary (음식메뉴 개체명 인식을 위한 음식메뉴 사전 자동 구축)

  • Gu, Yeong-Hyeon;Yoo, Seong-Joon
    • Annual Conference on Human and Language Technology
    • /
    • 2013.10a
    • /
    • pp.102-106
    • /
    • 2013
  • 레스토랑 리뷰 분석을 위해서는 음식메뉴 개체명 인식이 매우 중요하다. 그러나 현재의 개체명 사전을 이용하여 리뷰 분석을 할 경우 구체적이고 복잡한 음식메뉴명을 표현하는데 충분하지 않으며 지속적인 업데이트가 힘들어 새로운 트렌드의 음식 메뉴명 등이 반영되지 않는 문제가 있다. 본 논문에서는 레스토랑 전문 사이트와 레시피 제공 사이트에서 각 레스토랑의 메뉴 정보와 음식명 등을 래퍼기반 웹 크롤러로 수집하였다. 그런 다음 빈도수가 낮은 음식메뉴와 레스토랑 온라인 리뷰에서 쓰이지 않는 음식메뉴를 제거하여 레스토랑 음식 메뉴 사전을 자동으로 구축하였다. 그리고 레스토랑 온라인 리뷰 문서를 이용해 음식 메뉴 사전의 엔티티들이 어느 유형의 레스토랑 리뷰에서 발견되는지를 찾아 빈도수를 구하고 분류 정보에 따른 비율을 사전에 추가하였다. 이 정보를 이용해 여러 분류 유형에 해당되는 음식메뉴를 구분할 수 있다. 실험 결과 한국관광공사 외국어 용례사전의 음식 메뉴명은 1,104개의 메뉴가 실제 레스토랑 리뷰에서 쓰인데 비해 본 논문에서 구축한 사전은 1,602개의 메뉴가 실제 레스토랑 리뷰에서 쓰여 498개의 어휘가 더 구성되어 있는 것을 확인 할 수 있었다. 이와 아울러, 자동으로 수집한 메뉴의 정확도와 재현율을 분석한다. 실험 결과 정확률은 96.2였고 재현율은 78.4, F-Score는 86.4였다.

  • PDF

A Study on Utilization of Wikipedia Contents for Automatic Construction of Linguistic Resources (언어자원 자동 구축을 위한 위키피디아 콘텐츠 활용 방안 연구)

  • Yoo, Cheol-Jung;Kim, Yong;Yun, Bo-Hyun
    • Journal of Digital Convergence
    • /
    • v.13 no.5
    • /
    • pp.187-194
    • /
    • 2015
  • Various linguistic knowledge resources are required in order that machine can understand diverse variation in natural languages. This paper aims to devise an automatic construction method of linguistic resources by reflecting characteristics of online contents toward continuous expansion. Especially we focused to build NE(Named-Entity) dictionary because the applicability of NEs is very high in linguistic analysis processes. Based on the investigation on Korean Wikipedia, we suggested an efficient construction method of NE dictionary using the syntactic patterns and structural features such as metadatas.

Detection of Pupil using Template Matching Based on Genetic Algorithm in Facial Images (얼굴 영상에서 유전자 알고리즘 기반 형판정합을 이용한 눈동자 검출)

  • Lee, Chan-Hee;Jang, Kyung-Shik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.7
    • /
    • pp.1429-1436
    • /
    • 2009
  • In this paper, we propose a robust eye detection method using template matching based on genetic algorithm in the single facial image. The previous works for detecting pupil using genetic algorithm had a problem that the detection accuracy is influnced much by the initial population for it's random value. Therefore, their detection result is not consistent. In order to overcome this point we extract local minima in the facial image and generate initial populations using ones that have high fitness with a template. Each chromosome consists of geometrical informations for the template image. Eye position is detected by template matching. Experiment results verify that the proposed eye detection method improve the precision rate and high accuracy in the single facial image.

A Method of Biofouling Population Estimation on Marine Structure (수중구조물 표면에 부착된 해양생물의 개체 수 예측 방법)

  • Choi, Hyun-Jun;Kim, Gue-Chol;Kim, Bu-Ki
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.4
    • /
    • pp.845-850
    • /
    • 2018
  • In this paper, we propose a method to estimate the number of biofouling attached to the surface of marine structures. This method estimates the number of biofouling by calculating the region maxima using images taken in underwater. To do this, we analyze the correlation between the region maxima and the number of biofouling. The analysis showed that there is a significant correlation between the number of region maxima and the number of biofouling. By using the results of this analysis, the experiments were conducted on images taken in the underwater. Experimental results show that the higher the region maxima of the image, is greater than the number of biofouling in the image. The proposed method can be used as an important technology in computer vision for underwater images.