• Title/Summary/Keyword: depth-first search

Search Result 134, Processing Time 0.029 seconds

Development of Facility Layout Design Algorithm Based on Artificial Intelligence Concept (인공지능 개념을 이용한 공장 설비배치 알고리즘 개발)

  • Kim, Hwan-Seong;Lee, Sang-Yong
    • Journal of Korean Society for Quality Management
    • /
    • v.19 no.1
    • /
    • pp.151-162
    • /
    • 1991
  • The purpose of this study is to propose a facility layout design algorithm based on artificial intelligence concept, and then to develop a computer program which is more practical than any other conventional facility layout design systems. The algorithm is composed of five step layout procedures; knowledge and data input, knowledge interpretation, priority determination, inference of layout design, and evaluation, In the step of priority determination, the algorithm is divided into single row and multi row layout problem. In the step of inference of layout design, alternatives are generated by constraints-directed reasoning and depth first search method based on artificial intelligence concept. Alternatives are evaluated by the moving cost and relationship value by interactive man-machine interface in the step of evaluation. As a case study, analytical considerations over conventional programs such as CRAFT and CORELAP was investigated and compared with algorithm propsed in this study. The proposed algorithm in this study will give useful practical tool for layout planner. The computer progran was written in C language for IBM PC-AT.

  • PDF

DISCO: A COMPUTER PROGRAM FOR PROTECTION COORDINATION OF DISTRIBUTION SYSTEMS (DISCO: 배전 계통 보호 기기 정정 프로그램)

  • Lee, Seung-Jae;Park, Young-Moon;Lee, Jeoung-Won;Yoon, Sang-Hyun;Yoon, Man-Chul;Lee, Sang-Ok
    • Proceedings of the KIEE Conference
    • /
    • 1990.07a
    • /
    • pp.125-128
    • /
    • 1990
  • A program for the protection coordination of distribution systems is reported. The developed program nailed DISCO, consisting of two modules has a capability of selling the overcurrent relays, reclosers, sectionalizers, fuses which are commonly used in the primary feeder systems. Setting is performed in a downstream fashion starting from the substation, and coordination rules are applied identifying the pattern of the primary-backup devices based on the depth-first search. T/C curves of various devices are handled by digitization for accuracy and various graphics and windows are adopted for user-friendly interface.

  • PDF

The Perception of Suffering by Hospice Nurses (말기 암환자를 간호하는 간호사의 고통 인식에 관한 태도 : Q-방법론 적용)

  • Jo Kae-Hwa;Kim Myung-Ja
    • Journal of Korean Academy of Fundamentals of Nursing
    • /
    • v.8 no.1
    • /
    • pp.35-50
    • /
    • 2001
  • The purpose of this study was to identify the perception of hospice nurses on suffering, the type of stracture and characteristics of suffering. The research process is followed : First, the researcher selected 35 statements on suffering using content analysis of in-depth interviews and a literature search Second, the researcher asked 38 hospice nurses to classify the statement cards. The result of the research showed that the hospice nurse's perception of suffering can be divided into 4 types (Self-recognition, Suffering-elimination, Relation-restoration, and Meaning-endowment). The total explained variance was 46 percent. In relation to this, nursing intervention skills could be presence, listening touch, hope, reassurance, and comforting which result in positive effects between nurse and hospice client.

  • PDF

An Efficient Mining for Closed Frequent Sequences (효율적인 닫힌 빈발 시퀀스 마이닝)

  • Kim, Hyung-Geun;Whang, Whan-Kyu
    • Journal of Industrial Technology
    • /
    • v.25 no.A
    • /
    • pp.163-173
    • /
    • 2005
  • Recent sequential pattern mining algorithms mine all of the frequent sequences satisfying a minimum support threshold in a large database. However, when a frequent sequence becomes very long, such mining will generate an explosive number of frequent sequence, which is prohibitively expensive in time. In this paper, we proposed a novel sequential pattern algorithm using only closed frequent sequences which are small subset of very large frequent sequences. Our algorithm extends the sequence by depth-first search strategy with effective pruning. Using bitmap representation of underlying databases, we can obtain a closed frequent sequence considerably faster than the currently reported methods.

  • PDF

Diagnosis of Fire-Causes by using Expert System technique (전문가시스템 기법을 이용한 화재 원인진단)

  • 정국삼;김두현;김상철
    • Journal of the Korean Society of Safety
    • /
    • v.7 no.1
    • /
    • pp.31-38
    • /
    • 1992
  • This paper presents a study on application of expert system technique for the diagnosis of fire-causes in plants. A need is recognized for new methods to diagnose exactly the causes of fires without the help of the human experts. To cope with the difficulty, the expert system techiuque is applied to this area. The expert system suggested in this paper is developed to infer the causes of fires(or, ignition source ) by using the information drawn from the circumstances in fire. For the convenience of inference, ignition sources we classified into eight types ; elecoic spark, adiabatic compression, welding spark, material of high temperature, impact and friction, spontaneous ignition, naked fire, and static electricity. The knowledge base is composed of the rule base and dynamic database, which contain the rules and facts obtained by the expenence in this area, respectively. Both depth-first search and backward chaining schemes are used in reasoning process. This expert system is written in an artificial intelligence language "PROLOG", and its availability is demonstrated through the case study.

  • PDF

Collision Avoidance of Obstacles and Path Planning of the Robot applied Genetic Algorithm (유전알고리즘을 적용한 로봇의 장애물 충돌회피 및 경로추정)

  • Lim, Jin-Su;Kim, Moon-Su;Lee, Yang-Woo
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.3042-3044
    • /
    • 1999
  • This paper presents a method for solving the path planning problem for robot manipulators. The technique allows manipulators to move from a specified starting point to a goal without colliding with objects in two dimensional environment. Approximate cell decomposition with a greedy depth-first search algorithm is used to guide the end effector though Cartesian space and genetic algorithms are used to solve the joint variable for the robot manipulators.

  • PDF

Applying Stochastic Fractal Search Algorithm (SFSA) in Ranking the Determinants of Undergraduates Employability: Evidence from Vietnam

  • DINH, Hien Thi Thu;CHU, Ngoc Nguyen Mong;TRAN, Van Hong;NGUYEN, Du Van;NGUYEN, Quyen Le Hoang Thuy To
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.7 no.12
    • /
    • pp.583-591
    • /
    • 2020
  • Employability has recently become the first target of the national higher education. Its model has been updated to catch the new trend of Industry 4.0. This paper aims at analyzing and ranking the determinants of undergraduate employability, focusing on business and economics majors in Ho Chi Minh City, Vietnam. In-depth interviews with content analysis have been primarily conducted to reach an agreement on a key group of factors: human capital, social capital, and identity. The Stochastic Fractal Search Algorithm (SFSA) is then applied to rank the sub-factors. Human capital is composed of three major elements: attitude, skill, and knowledge. Social capital is approached at both structural and cognitive aspects with three typical types: bonding, bridging, and linking. The analysis has confirmed the change of priority in employability determinants. Human capital is still a driver but the priority of attitude has been confirmed in the contemporary context. Then, social capital with the important order of linking, bridging, and bonding is emphasized. Skill, knowledge, and identity share the least weight in the model. It is noted that identity is newly proposed in the model but a certain role has been found. The findings are crucial for education strategies to enhance university graduate employability.

Limits and Problems of the Current OPACs for Digital Kids ('디지털 키즈'를 위한 기존 OPAC의 한계와 과제)

  • Rho, Jee-Hyun
    • Journal of Korean Library and Information Science Society
    • /
    • v.45 no.4
    • /
    • pp.337-364
    • /
    • 2014
  • This research begins from the recognition that the Korean library OPACs have failed in reflecting the information needs of children, and especially the behavioral aspects of digital kids. Maintaining such problem recognition, this research examines the weak points and limits of Korean OPACs for digital kids, and explores the possible solutions. In details, identified at the first hand is digital kids' library use behavior, in particular, their search behavior of library OPACs. Also discussed is on the development of a new generation OPAC for digital kids. The data were collected from a survey with 545 elementary school students, in-depth interviews with 8 carefully selected students among the survey participants, and a direct observation on the children's information search process in 6 libraries.

Channel Assignment for RFID Readers in Dense Reader Environments (밀집리더환경에서 RFID 리더를 위한 채널 할당)

  • Sohn, Surgwon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.2
    • /
    • pp.69-76
    • /
    • 2013
  • Reader-to-reader interference in RFID system is occurred due to the use of limited number of frequencies, and this is the main cause of read rate reduction in the passive RFID tags. Therefore, in order to maximize the read rate under the circumstances of limited frequency resources, it is necessary to minimize the frequency interference among RFID readers. This paper presents a hybrid FDM/TDM constraint satisfaction problem models for frequency interference minimization problems of the RFID readers, and assigns optimal channels to each readers using conventional backtracking search algorithms. A depth first search based on backtracking are accomplished to find solutions of constraint satisfaction problems. At this moment, a variable ordering algorithm is very important to find a solution quickly. Variable ordering algorithms applied in the experiment are known as efficient in the graph coloring. To justify the performance of the proposed constraint satisfaction problem model, optimal channels for each readers in the passive UHF RFID system are allocated by using computer simulation satisfying various interference constraints.

A Study on Containerports Clustering Using Artificial Neural Network(Multilayer Perceptron and Radial Basis Function), Social Network, and Tabu Search Models with Empirical Verification of Clustering Using the Second Stage(Type IV) Cross-Efficiency Matrix Clustering Model (인공신경망모형(다층퍼셉트론, 방사형기저함수), 사회연결망모형, 타부서치모형을 이용한 컨테이너항만의 클러스터링 측정 및 2단계(Type IV) 교차효율성 메트릭스 군집모형을 이용한 실증적 검증에 관한 연구)

  • Park, Ro-Kyung
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.9 no.6
    • /
    • pp.757-772
    • /
    • 2019
  • The purpose of this paper is to measure the clustering change and analyze empirical results, and choose the clustering ports for Busan, Incheon, and Gwangyang ports by using Artificial Neural Network, Social Network, and Tabu Search models on 38 Asian container ports over the period 2007-2016. The models consider number of cranes, depth, birth length, and total area as inputs and container throughput as output. Followings are the main empirical results. First, the variables ranking order which affects the clustering according to artificial neural network are TEU, birth length, depth, total area, and number of cranes. Second, social network analysis shows the same clustering in the benevolent and aggressive models. Third, the efficiency of domestic ports are worsened after clustering using social network analysis and tabu search models. Forth, social network and tabu search models can increase the efficiency by 37% compared to that of the general CCR model. Fifth, according to the social network analysis and tabu search models, 3 Korean ports could be clustered with Asian ports like Busan Port(Kobe, Osaka, Port Klang, Tanjung Pelepas, and Manila), Incheon Port(Shahid Rajaee, and Gwangyang), and Gwangyang Port(Aqaba, Port Sulatan Qaboos, Dammam, Khor Fakkan, and Incheon). Korean seaport authority should introduce port improvement plans by using the methods used in this paper.