• Title/Summary/Keyword: Tables

Search Result 1,873, Processing Time 0.026 seconds

THEORIES OF SET AND LOGIC : COMPUTING WITH WORDS AND NUMBERS

  • Turksen, I.B.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.1-19
    • /
    • 1998
  • In this Kdynote address, two types of information granules are considered : (ⅰ) one for set assignments of a concept descriptor and (ⅱ) the other for truthood assignment to the concept description verifier. The first is, the process which specifies the assignment of an object to a clump, a class, a group, etc., and hence defines the set membership with a relational constraint. the second is the assignment of the degree of truthood or the membership specification of the abstract concept of truthood which specifies the " veristic" constraint associated with the concept descriptor. The combination of these two distinct assignments let us generate four set and logic theories. This then leads to the concern of normal forms and their derivation from truth tables for each of these theories. In this regard, some of the fundamental issues arising in this context are discussed and certain preliminary answers are provided in order to highlight the consequences of these theories.

  • PDF

INCREMENTAL INDUCTIVE LEARNING ALGORITHM IN THE FRAMEWORK OF ROUGH SET THEORY AND ITS APPLICATION

  • Bang, Won-Chul;Bien, Zeung-Nam
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.308-313
    • /
    • 1998
  • In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general description of concepts from specific instances of these concepts. In many real life situations, however, new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overcall set of instances. The method of learning presented here is base don a rough set concept proposed by Pawlak[2][11]. It is shown an algorithm to find minimal set of rules using reduct change theorems giving criteria for minimum recalculation with an illustrative example. Finally, the proposed learning algorithm is applied to fuzzy system to learn sampled I/O data.

  • PDF

Fuzzy System Representation of the Spline Interpolation for differentiable functions

  • Moon, Byung-Soo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.358-363
    • /
    • 1998
  • An algorithm for representing the cubic spline interpolation of differentiable functions by a fuzzy system is presented in this paper. The cubic B-spline functions which form a basis for the interpolation function are used as the fuzzy sets for input fuzzification. The ordinal number of the coefficient cKL in the list of the coefficient cij's as sorted in increasing order, is taken to be the output fuzzy set number in the (k, l) th entry of the fuzzy rule table. Spike functions are used for the output fuzzy sets, with cij's as support boundaries after they are sorted. An algorithm to compute the support boundaries explicitly without solving the matrix equation involved is included, along with a few properties of the fuzzy rule matrix for the designed fuzzy system.

  • PDF

Efficient Multi-way Tree Search Algorithm for Huffman Decoder

  • Cha, Hyungtai;Woo, Kwanghee
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.1
    • /
    • pp.34-39
    • /
    • 2004
  • Huffman coding which has been used in many data compression algorithms is a popular data compression technique used to reduce statistical redundancy of a signal. It has been proposed that the Huffman algorithm can decode efficiently using characteristics of the Huffman tables and patterns of the Huffman codeword. We propose a new Huffman decoding algorithm which used a multi way tree search and present an efficient hardware implementation method. This algorithm has a small logic area and memory space and is optimized for high speed decoding. The proposed Huffman decoding algorithm can be applied for many multimedia systems such as MPEG audio decoder.

Design of Fuzzy Logic Control System for Segway Type Mobile Robots

  • Kwak, Sangfeel;Choi, Byung-Jae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.2
    • /
    • pp.126-131
    • /
    • 2015
  • Studies on the control of inverted pendulum type systems have been widely reported. This is because this type of system is a typical complex nonlinear system and may be a good model to verify the performance of a proposed control system. In this paper, we propose the design of two fuzzy logic control systems for the control of a Segway mobile robot which is an inverted pendulum type system. We first introduce a dynamic model of the Segway mobile robot and then analyze the system. We then propose the design of the fuzzy logic control system, which shows good performance for the control of any nonlinear system. In this paper, we here design two fuzzy logic control systems for the position and balance control of the Segway mobile robot. We demonstrate their usefulness through simulation examples. We also note the possibility of simplifying the design process and reducing the computational complexity. This possibility is the result of the skew symmetric property of the fuzzy rule tables of the system.

THE ROENTGENOCEPHALOMETRIC STANDARDS ON THE CHILDREN WITH NORMAL OCCLUSION IN HELLMAN DENTAL AGE III C (두부방사선 계측법에 의한 Hellman치령 III C 정상교합 아동의 기준치에 관하여)

  • Chang, Hyun Il
    • The korean journal of orthodontics
    • /
    • v.6 no.1
    • /
    • pp.55-63
    • /
    • 1976
  • This study was undertaken to establish the roentgenocephalometric standards of the Korean children in Hellman dental age III C. The subjects consisted of 33 males and 33 females with the normal occlusion and acceptable profile. The lateral cephalometric films were taken with the teeth in centric occlusion, the soft tissue outline of the nose, lips, and chin was made visible by the low-speed films, 70Kvp, 100Mas. Their linear and angular measurements were performed by Jarabak's methods. The following results were obtained; 1) The author made the tables of standard deviation from the measured values. 2) Each linear measurement of the skull was greater in males than in females. 3) The maxillary basal bones were more protrusive in Korean children than in Caucasian. 4) The degree of the facial convexity was larger in Korean children than in Caucasian. 5) The labial inclination of the upper & lower incisors was greater in Korean children than in Caucasian. The labial inclination of the upper incisor was greater in females, but the labial inclination of the lower incisor was greater in males.

  • PDF

A ROENTGENOCEPHALOMETRIC STUDY OF THE CHILDREN IN THE DECIDUOUS DENTITION (유치열기 아동의 두부방사선 계측학적 연구)

  • Rhee, Byung Tae
    • The korean journal of orthodontics
    • /
    • v.6 no.1
    • /
    • pp.25-32
    • /
    • 1976
  • The present study was performed to establish the cephalometric standards of Hellman dental age II C groups of Korean on the roentgenocephalometry. The subjects consisted of 26 males and 25 females with normal occlusion and acceptable profile. The major conclusions may be listed as follows: 1) The tables of standard deviation from the measurements were made. 2) All linear measurements of skeletal pattern in male were greater than in female with exception of the mandibular body length measurement. 3) The labial inclinations of the upper and lower incisors were greater in female than in male. 4) Vertical growth tendency of the face nab conformed in the late primary dentition as compared with the measurements of the mixed dentition.

  • PDF

Bayesian pooling for contingency tables from small areas

  • Jo, Aejung;Kim, Dal Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.6
    • /
    • pp.1621-1629
    • /
    • 2016
  • This paper studies Bayesian pooling for analysis of categorical data from small areas. Many surveys consist of categorical data collected on a contingency table in each area. Statistical inference for small areas requires considerable care because the subpopulation sample sizes are usually very small. Typically we use the hierarchical Bayesian model for pooling subpopulation data. However, the customary hierarchical Bayesian models may specify more exchangeability than warranted. We, therefore, investigate the effects of pooling in hierarchical Bayesian modeling for the contingency table from small areas. In specific, this paper focuses on the methods of direct or indirect pooling of categorical data collected on a contingency table in each area through Dirichlet priors. We compare the pooling effects of hierarchical Bayesian models by fitting the simulated data. The analysis is carried out using Markov chain Monte Carlo methods.

Dual Addressing Scheme in IPv6 over IEEE 802.15.4 Wireless Sensor Networks

  • Yang, Soo-Young;Park, Sung-Jin;Lee, Eun-Ju;Ryu, Jae-Hong;Kim, Bong-Soo;Kim, Hyung-Seok
    • ETRI Journal
    • /
    • v.30 no.5
    • /
    • pp.674-684
    • /
    • 2008
  • This paper proposes a dual addressing scheme (DAS) for IPv6 over IEEE 802.15.4 wireless sensor networks (WSN). DAS combines a global unicast address to cope with association link changes and node mobility, and it links local addresses to lighten the overhead of the system to save energy and resources. This paper describes DAS address formats, address autoconfiguration, and address translation tables in the gateway. A detailed description of DAS is provided through examples. Simulations are performed to demonstrate the performance improvements of the DAS compared with the IPv6-based WSN, which uses the conventional single address.

  • PDF

High-Speed Hardware Architectures for ARIA with Composite Field Arithmetic and Area-Throughput Trade-Offs

  • Lee, Sang-Woo;Moon, Sang-Jae;Kim, Jeong-Nyeo
    • ETRI Journal
    • /
    • v.30 no.5
    • /
    • pp.707-717
    • /
    • 2008
  • This paper presents two types of high-speed hardware architectures for the block cipher ARIA. First, the loop architectures for feedback modes are presented. Area-throughput trade-offs are evaluated depending on the S-box implementation by using look-up tables or combinational logic which involves composite field arithmetic. The sub-pipelined architectures for non-feedback modes are also described. With loop unrolling, inner and outer round pipelining techniques, and S-box implementation using composite field arithmetic over $GF(2^4)^2$, throughputs of 16 Gbps to 43 Gbps are achievable in a 0.25 ${\mu}m$ CMOS technology. This is the first sub-pipelined architecture of ARIA for high throughput to date.

  • PDF