• Korean Journal of Logic
• /
• v.3
• /
• pp.27-51
• /
• 2000

이글의 기본적인 목적은 2치를 포함한 다치 논리 체계들간의 관계를 검토하는 데 있다. 이를 위하여 여기서는 명제를 대상으로 한 형식 의미 해석체계들 간에 고러해야 할 의미론적 확장 개념을 분명히 하였다. 구체적으로 다음의 두 작업이 수행되었다 첫째로 2치와 다치 논리 또는 다치 논리들간에 적용될 만한 의미론적 확장 개념을 의미해석의 바탕을 이루는 진리치 함수와 진리연산에 맞게 정의하였다. 둘째로 정의의 적합성을 확장, 비확장 사례 증명을 통해 예증해 보였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.1
• /
• pp.107-115
• /
• 2014

The reduced-bit transform based bit-plane matching algorithm (BPM) can obtain the block matching result through its simple calculation and hardware design compared to the conventional block matching algorithms (BMAs), but the block matching accuracy of BPMs is somewhat low. In this paper, reduced-bit transform based sum of the absolute difference (R-SAD) is proposed to improve the block matching accuracy in comparison with the conventional BPMs and it is shown that the matching process can be obtained using the logical operations. Firstly, this method transforms the current and the reference images into their respective 2-bit images and then a truth table is obtained from the relation between input and output 2-bit images. Next, a truth table is simplified by Karnaugh map and the absolute difference is calculated by using simple logical operations. Finally, the simulation results show that the proposed R-SAD can obtain higher accuracy in block matching results compared to the conventional BPMs through the PSNR analysis in the motion compensation experiments.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1995.10a
• /
• pp.284-288
• /
• 1995

최근 애매성이 수반되는 정보를 Zadeh는 멤버쉽함수(membership function)를 이용하여 새로운 정보처리 방식으로서 퍼지이론을 제안하였고, 그후 의료계에서도 퍼지이론을 도입한 진단법들이 제안되었다. 회전기계의 이상진단법으로는 주파수득점법(Point counting method), 퍼지역연산법(Inverse method of fuzzy theory)등이 보고되고 있으며, 저자들도 퍼지이론을 이용하여 구름베어링의 결함진단, 회전기계의 간이 이상진단법등을 보고하였다. 이들은 주로 진동주파수의 스펙트럼 데이터 만을 이용하고 있고, 다른 많은 데이터를 복합적으로 이용할 수 없다. 이 때문에 주로 소규모 문제의 간이진단에서는 효과적이나 진단대상이 복잡하고 대규모로 되면 보다 정확한 원인 추정이 곤란하게 된다. 또한 수치데이터만을 취급할 수 있으므로 진동전문가가 진단에 이용하는 각종의 수치화 될 수 없는 데이터(언어적인 정보)가 취급될 수 없다. 따라서 이들의 진단법은 개략적인 진단은 가능하나 상세한 원인까지는 진단할 수 없는 단점이 있다. 회전기계의 이상판단시 참고가 되는 각종 정보로는 주로 진동진폭의 크기, 진폭과 위상의 변화, 진폭의 변화, 진동파형, 진동벡터의 시간변화 등이 있고, 이들은 수치적으로 표현할 수 있는 계량데이터와 판단의 경계가 불명확한 언어정보(범위데이터)로 나눌 수 있다. 후자는 애매성(fuzziness)을 많이 포함하고 있으며, 엄밀히 측정되는 수치데이터에서도 퍼지성을 가지고 있다. 이러한 언어적인 정보의 애매성을 퍼지추론에서는 [수치적 진리치](numeric truth)와 [언어적 진리치](linguistic truth)의 개념으로 표현하게 되었다. 수치적 진리치는 확실함의 척도를 [0,1] 사이의 수치를 이용하여 표현하고 있으며, 이 수치는 소견의 확실도로서 가능성을 표현한 것이다. 예를 들면, 진동진폭 스펙트럼상에 2X 성분이 상당히 크게 나타나 정렬불량의 가능성이 0.7 정도라고 판정하는 것 등은 이러한 수치적진리치를 이용하는 방법이다. 그러나 상기의 수치적 표현만으로는 확실도를 한개의 수치로서 대표하게 하는 것은 진단의 정밀도에 문제가 있을 것으로 생각된다. 따라서 언어적진리치가 도입되어 [상당히 확실], [확실], [약간 확실] 등의 언어적인 표현을 이용하여 애매성을 표현하게 되었다. 본 논문에서는 간이진단 결과로부터 추출된 애매한 진단결과중에서 가장 가능성이 높은 이상원인을 복수로 선정하고, 여러 종류의 수치화할 수 없는 언어적(linguistic)인 정보ㄷㄹ을 if-then 형식의 퍼지추론으로 종합하는 회전기계의 이상진단을 위한 정밀진단 알고리즘을 제안하고 그 유용성을 검토한다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.2
• /
• pp.123-131
• /
• 2002

In this paper, a new standard basis parallel ternary-valued multiplier circuit designed using current mode CMOS is presented. Prior to constructing the GF(3$^{ｍ}$) multiplier circuit, we provide a GF(3) adder and a GF(3) multiplier with truth tables and symbolize them, and also design them using current mode CMOS circuit. Using the basic ternary operation concept, a ternary adder and a multiplier, we develop the equations to multiply arbitrary two elements over GF(3$^{ｍ}$). Following these equations, we can design a multiplier generalized to GF(3$^{ｍ}$). For the proposed circuit in this paper, we show the example in GF(3$^{3}$). In this paper, we assemble the operation blocks into a complete GF(3$^{ｍ}$) multiplier. Therefore the proposed circuit is easy to generalize for m and advantageous for VLSI. Also, it need no memory element and the latency not less fewer than other circuit. We verify the proposed circuit by functional simulation and show its result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.589-594
• /
• 1992

This paper offers the simplification method of Multiple-Valued logic function based on M-AND,M-OR, NOT operation presented by Lukasiewicz. First in performing the simplification the result is different by the method to arrange Cube, the method to find the most effective adjacent term if, most of all, important in simplification. According to this method, the two-variable multiple-valued logic function given by truth table is decomposed. The simplification method in this paper proves that the number of devices and cost is considerably reduced comparing with the existing method 141 to realize the same logic functions.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1115-1123
• /
• 2016

Assumption-based truth maintenance system (ATMS) is a tool that maintains the reasoning process of inference engine. It also supports non-monotonic reasoning based on dependency-directed backtracking. Bookkeeping all the reasoning processes allows it to quickly check and retract beliefs and efficiently provide solutions for problems with large search space. However, the amount of data has been exponentially grown recently, making it impossible to use a single machine for solving large-scale problems. The maintaining process for solving such problems can lead to high computation cost due to large memory overhead. To overcome this drawback, this paper presents an approach towards incrementally maintaining the reasoning process of inference engine on cluster using Spark. It maintains data dependencies such as assumption, label, environment and justification on a cluster of machines in parallel and efficiently updates changes in a large amount of inferred datasets. We deployed the proposed ATMS on a cluster with 5 machines, conducted OWL/RDFS reasoning over University benchmark data (LUBM) and evaluated our system in terms of its performance and functionalities such as assertion, explanation and retraction. In our experiments, the proposed system performed the operations in a reasonably short period of time for over 80GB inferred LUBM2000 dataset.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.11 no.4
• /
• pp.1.1-11
• /
• 1974

A general and systematic method of organizing two-dimensional flexible cellular array which is capable of reclizing arbitrary combinational switching function is developed. A set of n functions of n variables is transformed to revalued functions of one variable. This set of functions form a semigroup under the normal operation which is defined in this paper. A systematic method of generating any functions using three base functions is presented. Three basic networks which are capable of realizing three base functions are designed using only one one-dimensional array. The algorithm is presented for lealizing arbitrary combinational switching functions by organizing this basic array in two.dimensional cellular array and by appropriately setting the parameters or the edge of the array.

• Korean Journal of Logic
• /
• v.8 no.2
• /
• pp.3-32
• /
• 2005

Hilbert's rational ambition to establish consistency in Number theory and mathematics in general was frustrated by the fact that the statement itself claiming consistency is undecidable within its formal system by $G\ddot{o}del's$ second theorem. Hilbert's optimism that a mathematician should not say "Ignorabimus" ("We don't know") in any mathematical problem also collapses, due to the presence of a undecidable statement that is neither provable nor refutable. The failure of his program receives more shock, because his system excludes any ambiguity and is based on only mechanical operations concerning signs and strings of signs. Above all, $G\ddot{o}del's$ theorem demonstrates the limits of formalization. Now, the notion of provability in the dimension of syntax comes to have priority over that of semantic truth in mathematics. In spite of his failure, the notion of algorithm(mechanical processe) made a direct contribution to the emergence of programming languages. Consequently, we believe that his program is failure, but a great one.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.3
• /
• pp.201-207
• /
• 2008

This paper presents the implementation of a Tiling System about Preprocessing functions of JPEG 2000. The system covers the JPEG 2000 standard and is designed to determine the size of the image, to expand the image area and to split input image into several tiles. In order to split the input image with the progressive transmission into several tiles and transmit a tile of this image to others, this system store this image into Frame Memory. Therefore, this is designed as the Finite State Machine (FSM) to sequence through specific patterns of states in a predetermined sequential manner by using Verilog-HDL and be designed to handle a maximum 5M image. Moreover, for identifying image size for expansion, we propose several formula which are based on remainder after division (rem). we propose the true table which determines the size of the image input patterns by using results of these formula. Under the condition of TSMC 0.25um ASIC library, gate count is 18,725 and maximum data arrival time is 18.94 [ns].

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.757-768
• /
• 2003

This paper proposes a weighted fuzzy reasoning algorithm for rule-based systems based on weighted fuzzy Pr/T nets, where the certainty factors of the fuzzy production rules, the truth values of the predicates appearing in the rules and the weights representing the importance of the predicates are represented by the fuzzy numbers. The proposed algorithm is more flexible and much closer to human intuition and reasoning than other methods : $\circled1$ calculate the certainty factors using by the simple min and max operations based on the only certainty factors of the fuzzy production rules without the weights of the predicates[10] : $\circled2$ evaluate the belief of the fuzzy production rules using by the belief evaluation functions according to fuzzy concepts in the fuzzy rules without the weights of the predicates[12], because this algorithm uses the weights representing the importance of the predicates in the fuzzy production rules.