• Title/Summary/Keyword: 논리규칙

Search Result 290, Processing Time 0.03 seconds

A Fuzzy Agents for an Autonomous Decision Making on State Transition (상태변화에 따른 자율적 의사결정을 위한 퍼지 에이전트)

  • Lee, TaeKyung
    • Annual Conference of KIPS
    • /
    • 2004.05a
    • /
    • pp.365-368
    • /
    • 2004
  • 본 논문에서는 상태변화에 대한 자율적 의사결정을 하는 퍼지논리를 이용한 에이전트를 구현하는 것을 연구의 목적으로 한다. 이를 위하여 제한적인 조건을 설정하여 부분적인 실험을 하였다. 에이전트를 구성하기 위한 추론방식으로는 max-product 기법을 사용하였으며, n개 퍼지 규칙들 또는 연관들 $(A_1,\;B_1),\;{\ldots},\;(A_n,\;B_n)$을 가지는 상황을 고려하여 비퍼지화 작업을 수행하여 중심값을 추출하여 추론 작업을 실행하였다.

  • PDF

Digital Logic Extraction from QCA Designs (QCA 설계에서 디지털 논리 자동 추출)

  • Oh, Youn-Bo;Kim, Kyo-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.1
    • /
    • pp.107-116
    • /
    • 2009
  • Quantum-dot Cellular Automata (QCA) is one of the most promising next generation nanoelectronic devices which will inherit the throne of CMOS which is the domineering implementation technology for large scale low power digital systems. In late 1990s, the basic operations of the QCA cell were already demonstrated on a hardware implementation. Also, design tools and simulators were developed. Nevertheless, its design technology is not quite ready for ultra large scale designs. This paper proposes a new approach which enables the QCA designs to inherit the verification methodologies and tools of CMOS designs, as well. First, a set of disciplinary rules strictly restrict the cell arrangement not to deviate from the predefined structures but to guarantee the deterministic digital behaviors is proposed. After the gate and interconnect structures of. the QCA design are identified, the signal integrity requirements including the input path balancing of majority gates, and the prevention of the noise amplification are checked. And then the digital logic is extracted and stored in the OpenAccess common engineering database which provides a connection to a large pool of CMOS design verification tools. Towards validating the proposed approach, we designed a 2-bit adder, a bit-serial adder, and an ALU bit-slice. For each design, the digital logic is extracted, translated into the Verilog net list, and then simulated using a commercial software.

Design and Evaluation of a Fuzzy Logic based Multi-hop Broadcast Algorithm for IoT Applications (IoT 응용을 위한 퍼지 논리 기반 멀티홉 방송 알고리즘의 설계 및 평가)

  • Bae, Ihn-han;Kim, Chil-hwa;Noh, Heung-tae
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.17-23
    • /
    • 2016
  • In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

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

Implementation of a Transition Rule Model for Automation of Tracking Exercise Progression (운동 과정 추적의 자동화를 위한 전이 규칙 모델의 구현)

  • Chung, Daniel;Ko, Ilju
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.5
    • /
    • pp.157-166
    • /
    • 2022
  • Exercise is necessary for a healthy life, but it is recommended that it be conducted in a non-face-to-face environment in the context of an epidemic such as COVID-19. However, in the existing non-face-to-face exercise content, it is possible to recognize exercise movements, but the process of interpreting and providing feedback information is not automated. Therefore, in this paper, to solve this problem, we propose a method of creating a formalized rule to track the contents of exercise and the motions that constitute it. To make such a rule, first make a rule for the overall exercise content, and then create a tracking rule for the motions that make up the exercise. A motion tracking rule can be created by dividing the motion into steps and defining a key frame pose that divides the steps, and creating a transition rule between states and states represented by the key frame poses. The rules created in this way are premised on the use of posture and motion recognition technology using motion capture equipment, and are used for logical development for automation of application of these technologies. By using the rules proposed in this paper, not only recognizing the motions appearing in the exercise process, but also automating the interpretation of the entire motion process, making it possible to produce more advanced contents such as an artificial intelligence training system. Accordingly, the quality of feedback on the exercise process can be improved.

(Implementation of Current-Mode CMOS Multiple-Valued Logic Circuits) (전류 모드 CMOS 다치 논리 회로의 구현)

  • Seong, Hyeon-Gyeong;Han, Yeong-Hwan;Sim, Jae-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.39 no.3
    • /
    • pp.191-200
    • /
    • 2002
  • In this paper, we present the method transforming the interval functions into the truncated difference functions for multi-variable multi-valued functions and implementing the truncated difference functions to the multiple valued logic circuits with uniform patterns using the current mirror circuits and the inhibit circuits by current-mode CMOS. Also, we apply the presented methods to the implementation of circuits for additive truth table of 2-variable 4-valued MOD(4) and multiplicative truth table of 2-variable 4-valued finite fields GF(4). These circuits are simulated under 2${\mu}{\textrm}{m}$ CMOS standard technology, 15$mutextrm{A}$ unit current, and 3.3V power supply voltage using PSpice. The simulation results have shown the satisfying current characteristics. Both implemented circuits using current-mode CMOS have the uniform Patterns and the regularity of interconnection. Also, it is expansible for the variables of multiple valued logic functions and are suitable for VLSI implementation.

Two-Daughter Problem and Selection Effect (두 딸 문제와 선택 효과)

  • Kim, Myeongseok
    • Korean Journal of Logic
    • /
    • v.19 no.3
    • /
    • pp.369-400
    • /
    • 2016
  • If we learn that 'Mrs Lee has two children and at least one of them is a daughter', what is our credence that her two children are all girls? Obviously it is 1/3. By assuming some other obvious theses it seem to be argued that our credence is 1/2. Also by just supposing we learn trivial information about the future, it seem to be argued that we must change our credence 1/3 into 1/2. However all of these arguments are fallacious, cannot be sound. When using the conditionalization rule to evaluate conformation of a hypothesis by an evidence, or to estimate credence change by information intake, there are some points to keep in mind. We must examine whether relevant information was given through a random procedure or a biased procedure. If someone with full information releases to us particular partial information, an observation, a testimony, an evidence selected intentionally by him, which means the particular partial information was not given by chance, or was not given accidentally or naturally to us, then the conditionalization rule should be employed very cautiously or restrictedly.

  • PDF

On the Pinocchio Paradox (피노키오 역설에 대하여)

  • Song, Hasuk
    • Korean Journal of Logic
    • /
    • v.17 no.2
    • /
    • pp.233-253
    • /
    • 2014
  • The Pinocchio paradox that Eldridge-Smith suggested is a version of the semantic paradox. But it is unique in the sense that this paradox does not contain a semantic predicate. Tarski's solution which appeals to the hierarchy of language and Kripke's para-completeness which accepts the third truth value cannot solve the Pinocchio paradox. This paper argues that Eldridge-Smith's trial to criticize semantical dialetheism is not successful and that the paradox implies the rule of the truth predicate is inconsistent. That is, the proper diagnosis to this paradox is that the Pinocchio principle should be considered to be potentially inconsistent, which suggests that semantic paradoxes such as the liar paradox arise because the rule of the truth-predicate is inconsistent. The Pinocchio paradox teaches us that consistent view of truth cannot be successful to solve the semantic paradoxes and that we should accept the inconsistent view of truth.

  • PDF

An Implementation of Inference-Based Web Ontology for Intelligent Image Retrieval System (지능형 이미지 검색 시스템을 위한 추론 기반의 웹 온톨로지 구축)

  • Kim, Su-Kyoung;Ahn, Kee-Hong
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.3
    • /
    • pp.119-147
    • /
    • 2007
  • Actually a diffusion of a semantic web application and utilization are situations insufficient extremely. Technology most important in semantic web application is construction of the ontology which contents itself with characteristics of semantic web. Proposed a suitable a method of building web ontology for characteristics or semantic web and web ontology as we compared the existing ontology construction ana ontology construction techniques proposed for web ontology construction, and we analyzed. And modeling old ontology to bases to description logic and the any axiom rule that used an expression way of SWRL, and established inference-based web ontology according to proposed ways. Verified performance of ontology established through ontology inference experiment. Also established an web ontology-based intelligence image retrieval system, to experiment systems for performance evaluation of established web ontology, and present an example of implementation of a semantic web application and utilization. Demonstrated excellence of a semantic web application to be based on ontology through inference experiment of an experiment system.

Reconstruction Analysis of Pedestrian Collision Accidents Using Fuzzy Methods (퍼지수법을 활용한 보행자 충돌사고 재구성 해석)

  • Park, Tae-Yeong;Han, In-Hwan
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.1
    • /
    • pp.125-134
    • /
    • 2011
  • In order to reconstruct vehicle-pedestrian collision accidents, this paper presents a fuzzy tool to estimate accurately the impact velocity of the vehicle using parameters which could be easily collectable at the accident scene. The fuzzy rules and membership functions were set up using number of over 200 domestic and foreign data from accidents and empirical tests and 700 data from multibody simulation experiments. The developed fuzzy tool deduces the category of pedestrian trajectory and impact speed of the vehicle using 4 membership functions and 2 logic rules. The membership function of throw distance was differently set according to the deduced category of trajectories. The implemented fuzzy program was validated through comparing with the domestic and foreign empirical data. The output results agree very well in impact velocities of vehicle resulting the accuracy and usefulness of the developed tool in the reconstruction analysis of vehicle-pedestrian collision accidents.