• Title/Summary/Keyword: 유연한 알고리즘

Search Result 443, Processing Time 0.024 seconds

A Design of Building a Meaningful Tag Cluster (의미 있는 태그 클러스터 구축을 위한 설계 방안)

  • Park, Byoung-Jae;Woo, Chong-Woo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.658-661
    • /
    • 2008
  • 태깅은 웹 2.0의 핵심 기술 중 하나로, 매우 유연하고 역동적인 분류 체계를 제공한다. 하지만 유연성과 역동성의 확보에 의해 계층 구조나 연관 관계와 같은 태그의 관계성이 부족하거나 존재하지 않는 한계점을 가지고 있는 것 또한 사실이다. 이런 한계점을 보완하기 위한 방법으로 계층 관계를 형성하기 위한 계층 클러스터링 방법과, 연관 관계를 형성하기 위한 협업 필터링 방법이 존재한다. 이 두 가지 방법은 태그의 관계성을 제공하지만, 연관 관계와 계층 관계 중 하나만 제공한다는 단점을 가진다. 본 논문에서는 태그 검색 시 연관 관계뿐 아니라 계층 구조의 탐색을 제공해주기 위한 태그 클러스터링 알고리즘을 설계하였다. 제안한 알고리즘은 사용자 태그셋을 활용하여 태그의 유사성을 계산하는 방법을 제시하고, 기존의 시각화 방법(태그 구름)과 다른 새로운 형태로 시각화 할 수 있는 결과 데이터를 제공한다.

Short-Time Production Scheduling and Parts Routing for Flexible Assembly Lines (유연한 조립 시스템의 단기 생산 스케듈링과 라우팅에 관한 연구)

  • Sin, Ok-Geun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.6
    • /
    • pp.823-830
    • /
    • 1995
  • A reactive piloting policy for Flexible Assembly Lines (FAL) is proposed, where the sequencing of the operations as well as the assignment of tasks to manipulators are not predetermined but driven by the actual state of the FAL For all work-in-process coming from a manipulator, the next destination is determined by minimizing a temporal criterion taking into account the time needed to reach the destination, the load of the manipulator to reach, the durati on of the operation to be completed in the destination manipulator, and the availability of product components in this manipulator. The purpose of proposed piloting policy is to manufacture a given quantity of products as rapidly as possible by balancing the amount of work allocated to manipulators and to reduce the efforts required for scheduling the production of short series of diversified products. After introducing the characteristics of assembly processes and FAL modelization, the proposed algorithm is evaluated by simulations. The simulations of the proposed algorithm showed satisfactory results.

  • PDF

A Study on the Data Compression Algorithm for Just-in-Time Rendering of Concentric Mosaic (동심원 모자이크의 실시간 표현을 위한 데이터 압축 알고리즘에 관한 연구)

  • Jee, Inn-Ho;Ahn, Hong-Yeoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.91-96
    • /
    • 2010
  • Concentric mosaics are made with arranging and summing of video frames by using common spacial standards. Compared with previous works on 3-D wavelet transform coding, we have made important design considerations to enable flexible partial decoding and bit-stream random access. A just-in-time(JIT) rendering engine of the compressed concentric mosaic is developed. However, computationally, it is still demanding to accomplish the real-time rendering. Only the contents for specific scene representation are need to be decoded by maintaining compressed data. Thus our proposed algorithm is able to render real concentric mosaic by using lifting scheme instead of wavelet transform.

Path Planning and Tracking for Mobile Robots Using An Improved Distance Transform Algorithm (개선된 거리변환 알고리즘을 이용한 이동 로봇의 경로 계획 및 추적)

  • Park Jin-Hyun;Park Gi-Hyung;Choi Young-Kiu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.4
    • /
    • pp.782-791
    • /
    • 2005
  • In this paper, path planning and tracking problems are mentioned to guarantee efficient and safe navigation of autonomous mobile robots. We focus on the path planning and also deal with the path tracking and obstacle avoidance. We improved the conventional distance transform (DT) algorithm for the path planning. Using the improved DT algorithm, we obtain paths with shorter distances compared to the conventional DT algorithm. In the stage of the Path tracking, we employ the fuzzy logic controller to conduct the path tracking behavior and obstacle avoidance behavior. Through computer simulation studies, we show the effectiveness of the Nosed navigational algorithm for autonomous mobile robots.

Autonomous Pole Placement Controller Design of Two-Inertia Motor System Based on Genetic Algorithms (유전자 알고리즘을 사용한 2관성 모터 시스템의 자동 극배치 제어기 설계)

  • Gloria Suh;Park, Jung-Il
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.40 no.5
    • /
    • pp.317-325
    • /
    • 2003
  • The vibration, which often occurred in a two inertia motor system, makes it difficult to achieve a quick response of speed and disturbance rejection. This paper provides an autonomous pole assignment technique for three kinds of speed controllers (I-P, I-PD, and State feedback) using GAs(Genetic Algorithms) for a two-inertia motor system. Firstly, the optimal parameters are chosen using GAs in view of reducing overshoot and settling time, then those are used in computing the gains of each controller. Some simulation results verify the effectiveness of the proposed design. The proposed controller is expected to be the autonomous design way for controlling a two-inertia motor system with flexible shaft.

Study on the Face recognition, Age estimation, Gender estimation Framework using OpenBR. (OpenBR을 이용한 안면인식, 연령 산정, 성별 추정 프로그램 구현에 관한 연구)

  • Kim, Nam-woo;Kim, Jeong-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.779-782
    • /
    • 2017
  • OpenBR is a framework for researching new facial recognition methods, improving existing algorithms, interacting with commercial systems, measuring perceived performance, and deploying automated biometric systems. Designed to facilitate rapid algorithm prototyping, it features a mature core framework, flexible plug-in system, and open and closed source development support. The established algorithms can be used for specific forms such as face recognition, age estimation, and gender estimation. In this paper, we describe the framework of OpenBR and implement facial recognition, gender estimation, and age estimation using supported programs.

  • PDF

Path Planning and Tracking for Mobile Robots Using An Improved Distance Transform Algorithm (개선된 거리변환 알고리즘을 이용한 이동 로봇의 경로 계획 및 추적)

  • Park, Jin-Hyun;Park, Gi-Hyung;Choi, Young-Kiu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.295-299
    • /
    • 2005
  • In this paper, path planning and tracking problems are mentioned to guarantee efficient and safe navigation of autonomous mobile robots. We focus on the path planning and also deal with the path tracking and obstacle avoidance. We improved the conventional distance transform (DT) algorithm for the path planning. Using the improved DT algorithm, we obtain paths with shorter distances compared to the conventional DT algorithm. In the stage of the path tracking, we employ the fuzzy logic controller to conduct the path tracking behavior and obstacle avoidance behavior. Through computer simulation studies, we show the effectiveness of the proposed navigational algorithm for autonomous mobile robots.

  • PDF

Message Scheduling Algorithm for Hard Real-time Communications of Periodic Messages on a Switched Ethernet (스위칭이더넷에서 주기적 메시지에 대한 경성 실시간 통신을 위한 메시지 스케쥴링 알고리즘)

  • Kim Myung-Kyun;Lee Hee-Chan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.684-690
    • /
    • 2006
  • This paper proposes a message transmission model for hard real-time communications of periodic messages on a switched Ethernet and also proposes an algorithm to schedule the messages to be transmitted within their deadlines. The proposed scheduling algorithm is a distributed one and is peformed by the source and the destination nodes without the modification of the operational features of the standard Ethernet switch. When a new periodic message needs to be transmitted, it is first checked whether it can be scheduled on both the transmission and the reception links without affecting the already-scheduled messages, and a feasible schedule is made for the new message if it is schedulable. The proposed scheduling algorithm guarantees the transmission of periodic messages within their deadline and allows flexible message transmission on a hard real-time switched Ethernet through the dynamic addition of new periodic messages during run-time.

Interval-Valued Fuzzy Set Backward Reasoning Using Fuzzy Petri Nets (퍼지 페트리네트를 이용한 구간값 퍼지 집합 후진추론)

  • 조상엽;김기석
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.559-566
    • /
    • 2004
  • In general, the certainty factors of the fuzzy production rules and the certainty factors of fuzzy propositions appearing in the rules are represented by real values between zero and one. If it can allow the certainty factors of the fuzzy production rules and the certainty factors of fuzzy propositions to be represented by interval -valued fuzzy sets, then it can allow the reasoning of rule-based systems to perform fuzzy reasoning in more flexible manner. This paper presents fuzzy Petri nets and proposes an interval-valued fuzzy backward reasoning algorithm for rule-based systems based on fuzzy Petri nets Fuzzy Petri nets model the fuzzy production rules in the knowledge base of a rule-based system, where the certainty factors of the fuzzy propositions appearing in the fuzzy production rules and the certainty factors of the rules are represented by interval-valued fuzzy sets. The algorithm we proposed generates the backward reasoning path from the goal node to the initial nodes and then evaluates the certainty factor of the goal node. The proposed interval-valued fuzzy backward reasoning algorithm can allow the rule-based systems to perform fuzzy backward reasoning in a more flexible and human-like manner.

  • PDF

Ranking Methods of Web Search using Genetic Algorithm (유전자 알고리즘을 이용한 웹 검색 랭킹방법)

  • Jung, Yong-Gyu;Han, Song-Yi
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.3
    • /
    • pp.91-95
    • /
    • 2010
  • Using artificial neural network to use a search preference based on the user's information, the ranking of search results that will enable flexible searches can be improved. After trained in several different queries by other users in the past, the actual search results in order to better reflect the use of artificial neural networks to neural network learning. In order to change the weights constantly moving backward in the network to change weights of backpropagation algorithm. In this study, however, the initial training, performance data, look for increasing the number of lessons that can be overfitted. In this paper, we have optimized a lot of objects that have a strong advantage to apply genetic algorithms to the relevant page of the search rankings flexible as an object to the URL list on a random selection method is proposed for the study.