• Title/Summary/Keyword: 규칙 찾기

Search Result 81, Processing Time 0.035 seconds

Finding State Transition Functions of One-Dimensional Cellular Automata by Evolutionary Algorithms (일차원 셀룰러 오토마타 상에서 진화 알고리즘을 이용한 상태전이함수 찾기)

  • Park, Jongwoo;Wang, Sehee;Wee, Kyubum
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.5
    • /
    • pp.187-192
    • /
    • 2019
  • Majority problem and synchronization problem on cellular automata(CA) are hard to solve, since they are global problems while CA operate on local information. This paper proposes a way to find state transition rules of these problems. The rules of CA are represented as CMR(conditionally matching rules) and evolutionary algorithms are applied to find rules. We find many solution rules to these problems, compared the results with the previous studies, and demonstrated the effectiveness of CMR on one-dimensional cellular automata.

Finding Measure Position Using Combination Rules of Musical Notes in Monophonic Song (단일 음원 노래에서 음표의 조합 규칙을 이용한 마디 위치 찾기)

  • Park, En-Jong;Shin, Song-Yi;Lee, Joon-Whoan
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.10
    • /
    • pp.1-12
    • /
    • 2009
  • There exist some regular multiple relations in the intervals of notes when they are combined within one measure. This paper presents a method to find the exact measure positions in monophonic song based on those relations. In the proposed method the individual intervals are segmented at first and the rules that state the multiple relations are used to find the measure position. The measures can be applied as the foundational information for extracting beat and tempo of a song which can be used as background knowledge of automatic music transcription system. The proposed method exactly detected the measure positions of 11 songs out of 12 songs except one song which consist of monophonic voice song of the men and women. Also one can extract the information of beat and tempo of a song using the information about extracted measure positions with music theory.

An N-version Learning Approach to Enhance the Prediction Accuracy of Classification Systems in Genetics-based Learning Environments (유전학 기반 학습 환경하에서 분류 시스템의 성능 향상을 위한 엔-버전 학습법)

  • Kim, Yeong-Jun;Hong, Cheol-Ui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.7
    • /
    • pp.1841-1848
    • /
    • 1999
  • DELVAUX is a genetics-based inductive learning system that learns a rule-set, which consists of Bayesian classification rules, from sets of examples for classification tasks. One problem that DELVAUX faces in the rule-set learning process is that, occasionally, the learning process ends with a local optimum without finding the best rule-set. Another problem is that, occasionally, the learning process ends with a rule-set that performs well for the training examples but not for the unknown testing examples. This paper describes efforts to alleviate these two problems centering on the N-version learning approach, in which multiple rule-sets are learning and a classification system is constructed with those learned rule-sets to improve the overall performance of a classification system. For the implementation of the N-version learning approach, we propose a decision-making scheme that can draw a decision using multiple rule-sets and a genetic algorithm approach to find a good combination of rule-sets from a set of learned rule-sets. We also present empirical results that evaluate the effect of the N-version learning approach in the DELVAUX learning environment.

  • PDF

Space Allocation of Export Container Yard by Constraint Satisfaction Search (제약만족탐색 기법을 이용한 수출 컨테이너 장치장 계획)

  • 손예진;류광렬;김갑환
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.05a
    • /
    • pp.99-105
    • /
    • 2002
  • 컨테이너 터미널의 수출 장치장은 수출될 컨테이너들이 지속적으로 반입되어 해당 선박에 선적되기까지 일시적으로 보관되는 장소이다. 장치장의 공간 활용도를 높이면서 선적 시 작업의 능률을 극대화하기 위해서는 여러 가지 제약조건과 장치 규칙에 따라 컨테이너들의 장치 위치를 결정해야 할 뿐 아니라, 소정의 기간을 대상으로 그 동안 반입 예정인 전 컨테이너들에 대한 적절한 공간할당 계획을 미리 수립해 두어야 한다. 본 논문에서는 수출 장치장 계획 문제를 제약조건만족 문제로 보고 이를 효과적으로 해결하기 위한 탐색 기법을 제시하고 있다 대규모의 탐색공간으로부터 효율적으로 해를 찾기 위해 dependency-directed backtracking 기법을 적용하였고, 탐색 중에 제약조건을 만족하는 해를 찾기 어렵다고 판단될 경우에는 일부 제약조건을 완화하여 해를 재 탐색하는 제약조건 완화 기법을 적용하였다. 실제 부산 신선대 컨테이너 터미널의 데이터를 이용한 실험 결과 만족할 만한 수준의 계획을 빠른 시간 내에 수립할 수 있음을 확인하였다

  • PDF

Remarshalling Planning for Multiple Automated Yard Cranes Considering Slack Time (여유시간을 고려한 다수 자동화 야드 크레인의 이적작업 일정계획)

  • Park, Young-Man
    • Journal of Navigation and Port Research
    • /
    • v.41 no.3
    • /
    • pp.149-154
    • /
    • 2017
  • Recently, container terminal operators have made efforts to develop an efficient remarshalling plan in response to the increase in automation of equipment handling and transport of containers in the terminals. Usually, containers are handled by multiple AYCs(automated yard cranes) in-yard in an automated container terminal, and terminal operators establish a remarshalling plan using slack time to increase the efficiency of ship operation. This study develops the optimal mathematical model through mixed integer programming as a solution to the problem of dispatching multiple AYCs. Considering the difficulty of direct application to the field due to computation time, we analyze the five prototypical dispatching rules for real world adaptation. A numerical experiment found that the maximum weight ratio (MR) rule and the maximum weight (MW) rule are the ideal dispatching solutions to the multiple AYCs dispatching problem.

An efficient algorithm to search frequent itemsets using TID Lists (TID List를 이용한 빈발항목의 효율적인 탐색 알고리즘)

  • 고윤희;김현철
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04b
    • /
    • pp.136-139
    • /
    • 2002
  • 연관규칙 마이닝과정에서의 빈발항목 탐색의 대표적인 방법으로 알려진 Apriori 알고리즘의 성능을 향상시키기 위한 많은 연구가 진행되어 왔다. 본 논문에서는 트랜잭션 데이터베이스(TDB)에서 생성되는 각 패스의 k-itemset들에 대해 각각 트랜잭션 ID List(TIDist)를 유지하고 이를 이용해 (k+1)-itemset을 효율적으로 찾아내는 방법을 제안한다. 이 방법은 frequent (k+1)-itemset(k>0)의 빈도수 및 TIDList를 TDB 에 대한 스캔이 전혀 없이 k-itemset의 TIDList로부터 직접 구한다. 이는 빈발항목집합을 찾기 위한 탐색 complexity는 크게 줄여줄 뿐 아니라 시간 변화에 따른 빈발항목집합의 분포 정보를 제공해 준다.

  • PDF

Optimal solution search method by using modified local updating rule in Ant Colony System (개미군락시스템에서 수정된 지역 갱신 규칙을 이용한 최적해 탐색 기법)

  • Hong, Seok-Mi;Chung, Tae-Choong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.1
    • /
    • pp.15-19
    • /
    • 2004
  • Ant Colony System(ACS) is a meta heuristic approach based on biology in order to solve combinatorial optimization problem. It is based on the tracing action of real ants which accumulate pheromone on the passed path and uses as communication medium. In order to search the optimal path, ACS requires to explore various edges. In existing ACS, the local updating rule assigns the same pheromone to visited edge. In this paper, our local updating rule gives the pheromone according to the number of visiting times and the distance between visited cities. Our approach can have less local optima than existing ACS and find better solution by taking advantage of more informations during searching.

Pattern Generation Technique for Network-based Intrusion Detection using Association Rules (연관 규칙을 이용한 네트워크 기반 침입 탐지 패턴생성 기술)

  • Soh, Jin;Lee, Sang-Hoon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.619-621
    • /
    • 2002
  • 네트워크 기반 컴퓨터 시스템은 현대사회에 있어서 매우 중요한 역할을 담당하고 있기 때문에 이들은 정보 범죄들로부터 안정적이면서 효율적인 환경을 제공하는 것은 매우 중요한 일이다. 현재의 침입탐지 시스템은 네트워크 상에서 지속적으로 처리되는 대량의 패킷에 대하여 탐지속도가 떨어지고, 새로운 침입유형에 대한 대응방법이나 인지능력에도 한계가 있기 때문이다. 따라서 다양한 트래픽 속에서 탐지율을 높이고 탐지속도를 개선하기 위한 방안이 필요하다. 본 논문에서는 침입탐지 능력을 개선하기 위해 먼저, 광범위한 침입항목들에 대한 탐지 적용기술을 학습하고, 데이터 마이닝 기법을 이용하여 침입패턴 인식능력 및 새로운 패턴을 생성하는 적용기술을 제안하고자 한다. 침입 패턴생성을 위해 각 네트워크에 돌아다니는 관련된 패킷 정보와 호스트 세션에 기록되어진 자료를 필터링하고, 각종 로그 화일을 추출하는 프로그램들을 활용하여 침입과 일반적인 행동들을 분류하여 규칙들을 생성하였다. 마이닝 기법으로는 학습된 항목들에 대한 연관 규칙을 찾기 위한 연역적 알고리즘을 이용하였다. 또한, 추출 분석된 자료는 리눅스기반의 환경 하에서 다양하게 모아진 네트워크 로그파일들을 본 논문에서 제안한 방법에 따라 적용한 결과이다.

  • PDF

A Survey of Representation Methods of Game Rules in Game Design (게임디자인에서 게임규칙 표현방법 조사연구)

  • Chang, Hee-Dong
    • Journal of Korea Game Society
    • /
    • v.6 no.4
    • /
    • pp.39-45
    • /
    • 2006
  • In game developments, the design results are often modified not only in the design phase but also in the implementation and test phases. The results of game design are consisted of the results of game rule design and the results of game contend design. The results of game rule design should be correctly understood to all the participants, be efficiently managed by the given configuration controls, and be accurately verified. In this study, we carry out a survey of representation methods of game rules in game design. We have the comparison analysis of the written representation, the UML representation, the Petri net representation, and script-language representation methods about the suitability of the representation method for game rule designs. The comparison analysis is about the representation scope, the visual representation, the automated verification, and the configuration management. The analysis results show that the UML representation is the best method but it needs more convenient automated verification method.

  • PDF

An Analysis of the Questions Presented in Chapters of Pattern Area in Elementary School Mathematics (초등수학의 규칙성 영역 단원에 제시된 발문의 특성 분석)

  • Do, Joowon
    • Education of Primary School Mathematics
    • /
    • v.24 no.4
    • /
    • pp.189-202
    • /
    • 2021
  • The teacher's questions presented in the problem-solving situation stimulate students' mathematical thinking and lead them to find a solution to the given problem situation. In this research, the types and functions of questions presented in chapters of Pattern area of the 2015 revised elementary school mathematics textbooks were compared and analyzed by grade cluster. Through this, it was attempted to obtain implications for teaching and learning in identifying the characteristics of questions and effectively using the questions when teaching Pattern area. As a result of this research, as grade clsuter increased, the number of questions per lesson presented in Pattern area increased. Frequency of the types of questions in textbooks was found to be high in the order of reasoning questions, factual questions, and open questions in common by grade cluster. In chapters of Pattern area, relatively many questions were presented that serve as functions to help guess, invent, and solve problems or to help mathematical reasoning in the process of finding rules. It can be inferred that these types of questions and their functions are related to the learning content by grade cluster and characteristics of grade cluster. Therefore, the results of this research can contribute to providing a reference material for devising questions when teaching Pattern area and further to the development of teaching and learning in Pattern area.