• 전기의세계
• /
• v.28 no.8
• /
• pp.57-65
• /
• 1979

This paper is concerned with not only the transformation of the logic diagrams to the NAND and the NOR forms but also the inverse transformation deriving the simple Boolean function from a logic diagram. The conversions of the algebraic expression from the AND, OR and NOT operations to the NAND and the NOR operations are usually quite complicated, because they involve a large number of repeated applications of De Morgan's Theorem and the other logic relations. For the derivation of the Boolean function, it becomes difficult because the Boolean function is determined from the De Morgan's theorem in consecutive order until the output is expressed in terms of input variables (9). But, these difficulties are avoided by the use of new techniques, called the TWO-NOTs method and the MOVING-NOT method, that are presented in this paper.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.9
• /
• pp.692-701
• /
• 2003

In this paper, a new logic transformation method to consider both low power consumption and high testability is proposed. We search the CFF(Compact Fanout Free) that has low probability of being observable at the primary outputs. Under the condition that the CFF is unobservable at all primary outputs, the switching operations in it can be removed by adding redundant connections into it. The testability of the transformed circuit generally tends to reduce. In our method, however, the inserted redundant connections operate as test points in the test mode and can improve not only the controllability but also the observability of the CFF. The transformed circuit consumes less power in the normal mode and also has higher testability in the test mode. To show the efficiency of the proposed logic transformation method, we perform some experiments on the MCNC benchmark test circuits. The results show that the power consumption of the transformed circuit is reduced by 13% maximally and the fault coverage of the transformed circuit is increased.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.653-656
• /
• 2000

We consider, in this paper, a UML-based design support system for real-time systems. However, the UML does not include any notion for verification of timing constraints. We presents transformation algorithms, as a function of the support system, of UML descriptions into Petri nets and Interval Temporal Logic models, which are very powerful for the verification. This paper shows also transformation example for simple elevator system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.1
• /
• pp.36-43
• /
• 2016

The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users' queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive cost-based transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.191-198
• /
• 2006

Many enterprises have introduced workflow to enhance work efficiency and support effective work processes in their various work environments. Recently, Business Process Management(BPM), an extension of workflow, is spotlighted in enterprise software markets Although woklflow plays an important role in Business Process Managements, researches in workflow are mostly concentrated on temporal constraints which finds exact execution sequences for complicated jobs. On that reason, majority of workflow scheduling has concentrated on modeling of various resources which should be handled and the interest for workflow scheduling under constraints related to resources is rather unsatisfactory In this paper we presents the Transformation Template based on Concurrent Transaction Logic(CTR) which is suitable for scheduling workflows with resource allocation constraints, and the logical framework. The Transformation Template consists of a Workflow Transformation Template and a Constraint Transaction Template. Especially the Transformation Template can be conveniently used to logically represent new workflows under the existing resource allocation constraints.

• Journal of Popular Narrative
• /
• v.25 no.3
• /
• pp.103-141
• /
• 2019

The purpose of this paper is to examine the logic of choice, transformation, and exclusion in The Song of sword, comparing it with the historical records. This paper explains how a novel is 'produced'. Through this, it searches for the aspects in which The Song of sword changed into 'a narrative revealing the disillusionment of the novel's subject with the world'. In the logic of choice, it explores which time and space were chosen in the novel, and which character was chosen to prepare the content and formal framework of the novel. In the logic of transformation, it is confirmed that the meaning of 'individual' is highlighted in the novel, unlike the historical records, by transforming both the character of the enemy and the meaning of war. In the logic of exclusion, it studies the characteristics of the modern (novel's) subject in the novel by excluding the characteristics of the historical subject that existed in a particular time and space. This paper differs from previous studies in that it examines the way in which a novel is produced by comparing and analyzing The Song of sword based on the historical records. Through these analyses, we can see the unity of various heterogeneous elements, such as the historical reality, the writer's ideology and imagination, and the desire of the contemporary in the form of a novel. Also, by examining the elements of text that can not be sutured into a complete form, we can see the meaning of the novel's text as an unstable system.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1410-1422
• /
• 2015

In order to design a system, software developers use an object model such as the UML class diagram. Object-Relational Transformation Methodology (ORTM) is a methodology to transform the relationships that are expressed in the object model into relational database tables, and it is applied for the implementation of the designed system. Previous ORTM studies have suggested a number of transformation methods to represent one relationship. However, there is an implementation problem that is difficult to apply because the usage criteria for each transformation method do not exist. Therefore, this paper proposes a binary decision diagram-based modeling rule for each relationship. Hence, we define the conditions for distinguishing the transformation methods. By measuring the query execution time, we also evaluate the modeling rules that are required for the verification. After evaluation, we re-define the final modeling rules which are represented by propositional logic, and show that our proposed modeling rules are useful for the implementation of the designed system through a case study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1774-1779
• /
• 2005

This paper propose the design method of the constructing the digital logic systems over galois fields using by the galois field decision diagram(GFDD) that is based on the graph theory. The proposed design method is as following. First of all, we discuss the mathematical properties of the galois fields and the basic properties of the graph theory. After we discuss the operational domain and the functional domain, we obtain the transformation matrixes, $\psi$GF(P)(1) and $\xi$GF(P)(1), in the case of one variable, that easily manipulate the relationship between two domains. And we extend above transformation matrixes to n-variable case, we obtain $\psi$GF(P)(1) and $\xi$GF(P)(1). We discuss the Reed-Muller expansion in order to obtain the digital switching functions of the P-valued single variable. And for the purpose of the extend above Reed-Muller expansion to more two variables, we describe the Kronecker product arithmetic operation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.447-454
• /
• 2010

This paper presents multiple fuzzy prediction systems based on an Interval type-2 TSK fuzzy Logic System so that the uncertainty and the hidden characteristics of nonlinear data can be reflected more effectively to improve prediction quality. In proposed method, multiple fuzzy systems are adopted to handle the nonlinear characteristics of data, and each of multiple system is constructed by using interval type-2 TSK fuzzy logic because it can deal with the uncertainty and the characteristics of data better than type-1 TSK fuzzy logic and other methods. For input of each system, the first-order difference transformation method are used because the difference data generated from it can provide more stable statistical information to each system than the original data. Finally, computer simulations are performed to show the effectiveness of the proposed method for two typical time series examples.

• Proceedings of the KIPE Conference
• /
• 1999.07a
• /
• pp.469-471
• /
• 1999

In this paper, the method of Space-Vector Pulse Width Modulation(SVPWM) with Fuzzy Logic Regulator(FLR) is proposed. In a conventional SVPWM, the procedures of phase transformation and choosing PWM patterns are complex. So, it should be implemented with high performance processor like Digital Signal Processor(DSP). In order to reduce a calculation burden, a proposed system adopts FLR. Using a linguistic contro strategy based on expert knowledge, FLR relieves the processor from a heavy computations. In simulations, the proposed system is validated.