• Title/Summary/Keyword: 조합 논리

Search Result 162, Processing Time 0.019 seconds

자연문화자원을 이용한 특정단지개발과 GIS활용에 대한 고찰

  • 박구원;이애정
    • Proceedings of the Korean Environmental Sciences Society Conference
    • /
    • 2003.11b
    • /
    • pp.70-76
    • /
    • 2003
  • 최근 자연문화자원이 중요하게 인식되면서, 자연문화자원을 통한 특성단지개발을 추진하는 예가 많지만, 보전에 대한 규제만 있을 뿐 활용에 대한 가이드라인이 정해지지 않아 정책추진에 어려움을 겪는 예가 많다. 본 연구는 이러한 자연문화자원을 이용한 특정단지개발에 대한 문제 및 발전방안을 몇 가지 실사례를 통해 검토한 것에 있다. 사례조사결과 지방자치단체의 개발여건은 극히 복잡다단한 자원분포를 갖고 있고, 이들이 상호 연결되는 구조를 갖고 있어, 기존과 같이 자연생태도를 통해 일방적으로 개발적지를 정한다든가, 보전 범위를 500m로 설정하는 것과 같은 개발방식은 지역개발에 거의 도움을 주지 못하는 것으로 나타난다. 이러한 일기준 일거점의 개발논리보다는 모든 자원의 속성을 통해 최적의 보전범위를 정해가는 다거점 개발논리가 자원의 보전은 물론 활용에 있어서도 효과적인 것으로 판단된다. 이때 다거점에 대한 연출은 매우 복잡하게 작용하는 바 GIS를 통해 다거점을 조합해 가는 방식이 기술적 방안으로 제안된다.

  • PDF

Analysis of Problems in the Submicro Representations of Acid·Base Models in Chemistry I and II Textbooks of the 2009 & 2015 Revised Curricula (2009 개정교육과정과 2015 개정교육과정의 화학 I 및 화학 II 교과서에서 산·염기 모델의 준미시적 표상에 대한 문제점 분석)

  • Park, Chul-Yong;Won, Jeong-Ae;Kim, Sungki;Choi, Hee;Paik, Seoung-Hey
    • Journal of the Korean Chemical Society
    • /
    • v.64 no.1
    • /
    • pp.19-29
    • /
    • 2020
  • We analyzed the representations of acid-base models in 4 kinds of Chemistry I and 4 kinds of Chemistry II textbooks of the 2009 revised curriculum, and 9 kinds of Chemistry I textbooks and 6 kinds of chemistry II textbooks of the 2015 revised curriculum in this study. The problems of the textbook were divided into the problems of definitions and the representations of the logical thinking. As a result of the study, the lack of the concept of chemical equilibrium had a problem with the representation of reversible reactions in the definition of the Brønsted-Lowry model in the Chemistry I textbooks of 2009 revised curriculum, it also appeared to persist in Chemistry I textbooks of 2015 revised curriculum which contains the concept of chemical equilibrium. The representations of logical thinking were related to particle kinds of conservation logic, combinational logic, particle number conservation logic, and proportion logic. There were few problems related to representation of logical thinking in Chemistry I textbook in 2009 revision curriculum, but more problems of representations related to logics are presented in Chemistry I textbooks in 2015 revision curriculum. Therefore, as the curriculum is revised, the representations of chemistry textbooks related to acid and base models need to be changed in a way that can help students' understanding.

A Study on the Effects of Reading Education Using Book-Coding (북코딩의 독서교육 효과에 관한 연구)

  • Ji, Hyoun-Ah;Cho, Miah
    • Journal of Korean Library and Information Science Society
    • /
    • v.52 no.2
    • /
    • pp.145-166
    • /
    • 2021
  • The study was aimed at verifying the effectiveness of Book-Coding reading education as a reader activity of older elementary school children at a time when high-dimensional thinking abilities were formed. To this end, 30 fifth-grade children of N Elementary School in N-si, Gyeonggi-do, comprised of 15 students from a reading education program using Book-Coding, and 15 students from a reading comprehension program, and applied the reading education program over a total of 12 sessions. The main results of the study are summarized as follows. First, when the effects of the convergence reading education program using Book-Coding on the logical thinking ability of the students in the upper grades in the elementary school were analyzed, all the six sub-factors of logical thinking ability, that is, conservation logic, proportional logic, variable controlling logic, probabilistic logic, correlational inference logic, and combinational logic, were proved to have statistically more meaningful difference than the group writing a book report. Second, the analysis result of the influence of the convergence reading education program using Book-Coding on the creativity of the students in the upper grades of the elementary school showed that all the 13 elements of curiosity, persistence, effectiveness, independence, adventurousness, openness, knowledge, imagination, originality, sensitivity, fluency, flexibility, and accuracy were statistically meaningfully different compared to the book report group. Third, when it was analyzed how the convergence reading education program using Book-Coding affected the creative personality of the elementary school students, all the six factors of curiosity, task commitment, independence, awareness of risk, and openness of thinking, and aesthetics were found out to have a statistically more meaningful difference than the group that wrote a book report.

A Study on the fault Detection using output Sequence in Combinational Logic Networks (출력순자를 이용한 조합회로의 고장검출에 관한 연구)

  • Han, Hee;Park, Kue-Tae
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.17 no.4
    • /
    • pp.31-37
    • /
    • 1980
  • In this paper, we are concerned with the problems of fault- detection for combinational logic networks. The method which we can obtain the complete test sets using propagation of primitive test sets is presented by considering the relation between test sets of each line. A new method is proposed that can detect the fault through the observation of the output variance by applying only the test sets equivalent to the number of inputs We found that the method is much improved compared to the conventional fault detecting procedure that requires applying the complete test sets to the logic networks.

  • PDF

An Efficient CPLD Technology Mapping considering Area under Time Constraint (시간 제약 조건하에서 면적을 고려한 효율적인 CPLD 기술 매핑)

  • Kim, Jae-Jin;Kim, Hui-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.1
    • /
    • pp.79-85
    • /
    • 2001
  • In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint(TMFCPLD). This technology mapping algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. This method is for reason to reduce area and improve total run time of circuits by TEMPLA proposed previously. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Initial cost of each node are the number of OR-terms that it have. Among mappable clusters, clusters of which the number of multi-level is least is selected, and the graph is partitioned. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by 62.2% than those of DDMAP. And reduced the number of CLBs by 17.6% than those of TEMPLA, and reduced the number of CLBs by 4.7% than those of TMCPLD. This results will give much efficiency to technology mapping for CPLDs.

  • PDF

A Study on Fault Detection Tests for Combintional Logic Networks (조합논리회로의 결함검출시험에 관한 연구)

  • 최흥문
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.14 no.6
    • /
    • pp.10-15
    • /
    • 1977
  • This paper proposes a simple and systematic method for the generation of the fault detection test sets for the combinational logic networks. Based on tile path sensitizing concept, the test patterns for the primary input gates of the network are defined, and then it is shown that, arranging these predefined test patterns according to the path sensitizing characteristics of the given network sturctures, the minimal complete test sets for the fan-out free combinational networks can be found easily. It is also shown that, taking into account the fan-out paths sensitizing compatibility, the proposed method can be extended to the irredundant reconvergent fan-out networks.

  • PDF

모바일한글이야기

  • Im, Yeong-Mo
    • Digital Contents
    • /
    • no.11 s.150
    • /
    • pp.60-65
    • /
    • 2005
  • 한글’은지구상문자중에서가장과학적이고독창적인글자다. 이정의에대해누구도섣불리부인하지못할것이다. 지구상의문자들을보면낱자를일렬로나열해 사용하거나, 뜻을가진낱글자하나씩을사용하는방식의문자가대부분이다. 한글처럼자음과모음이논리적으로조합되고창의적으로생성돼하나의음절을이루 는글자는찾아볼수없다. 한글의원리를하나씩이해해나가다보면조상들의뛰어난창의력에저절로감탄이나온다. ‘ 생각’은‘ 언어’를통해서하게되며, 이언어 를기록하고전달하기위해서는‘ 문자’라는가시적인기호가필요하다. 이번호에서는민족의얼을담고있는우리말‘ 한글’이모바일환경에서어떤모습으로나타 나는지알아보고자한다.

  • PDF

Circuit partitioning to enhance the fault coverage for combinational logic (조합논리회로의 고장 검출율 개선을 위한 회로분할기법)

  • 노정호;김상진;이창희;윤태진;안광선
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.4
    • /
    • pp.1-10
    • /
    • 1998
  • Partitioning problem of large combinational logic has been studied in real world. Most of logic include undectable faults from the structure of it's redundant, fan-out-reconvergent, and symetrical feature. BPT algorithm is proposed to enhance the fault voverage for combinational logic partitioning. This algorithm partitions the logic by cut the lines related to undetectable structure when seperating. Controllability and observability are considered in the process of partitioning. This algorithm is evaluated effective by testing ISCAS85 circuits.

  • PDF

생산시스템 운용모델 설계를 위한 시뮬레이션 소프트웨어 응용

  • 이승우;이춘식
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.04a
    • /
    • pp.520-529
    • /
    • 1993
  • 생산시스템의 효율적 설계/구축/운용에 상용 시뮬레이션 소프트웨어가 최근 급속히 이용되고 있다. 특히 복잡한 논리에 의해 제어되는 FMS(Flexible Manufacturing System)의 시뮬레이션에서는 동적인 상태변화의 파악이 중요하며, 거의 유사한 하드웨어와 소프트웨어의 조합에 의해 시스템이 구축될 수 있다는 특징을 가지고 있다. 본 연구에서는 FMS모델 구축에 필요한 구성요소를 갖추고 있는 상용시뮬레이션 소프트웨어를 생산시스템 구축 및 운용모델 설계에 이용한 사례를 소개하고자 한다.

  • PDF

인공지능에서 정수 프로그래밍을 위한 제약조건 해결기의 구현

  • 오윤상;조근식
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1994.04a
    • /
    • pp.159-165
    • /
    • 1994
  • 실세계에서 발생하는 많은 문제들은 주어진 제약조건들을 만족하는 범위내에서 해를 찾는 제약만족문제(CSP)의 개념으로 설명될 수 있으며, 이러한 문제들의 해결을 위해 인공지능 및 OR 분야에서 활발한 연구가 계속 되어왔다. 본 연구는 대표적 논리언어인 prolog에서 유한이산 도메인 및 수치 제약조건의 해결을 위한 제약해결기에 대한 연구이다. 본 연구에서 구현된 제약해결기에서는 포워드체킹(FC)을 사용하여 조합적 문제를 효과적인 도메인 여과를 통해 탐색공간 및 탐색시간을 축소시키며, 또한 최적화 문제의 해결에 있어서도 그 문제에 주어진 목적함수와 FC의 장점을 조화 시킴으로써 최적해를 더욱 효과적으로 발견한다.