• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.5 no.1
• /
• pp.42-49
• /
• 1987

This paper describes test-pattern generation and it;s sequence for fan out-free Combinational logic network with multiple faults. The method for detecting multiple faults, in systematic way, is established by using characteristic graphs. This method is applied even in the case of fan out-reconvergent combinational logic networks. In this case, the network is decomposed into a set of fan out-free sybnetworks so as to use the characteristic graphs, and minimal test patterns are generated seperately. The each test set is combined and the test pattern for fan out-reconvergent networks are derived. According to corresponding characteristic graph, additional test patterns to detect multiple faults are simply derived.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1471-1481
• /
• 1998

In this paper, we propose a new digital image stabilization scheme based on the bit-plane matching. In the proposed algorithm, the conventional motion estimation algorithms are applied to the binary images extracted from the bit-plane images. It is shown that the computational complexity of the proposed algorithm can be significantly reduced by replacing the arithmetic calculations with the binary Boolean functions, while the accuracy of motion estimation is maintained. Furthermore, an adaptive algorithm for selecting a bit-plane in consideration of changes in external illumination can provide the robustness of the proposed algorithm. We compared the proposed algorithm with existing algorithms using root mean square error (RMSE) on the basis of the brute-force method, and proved experimentally that the proposed method detects the camera motion more accurately than existing algorithms. In addition, the proposed algorithm performs digital image stabilization with less computation.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.1-6
• /
• 2006

In this paper, a RTL binding technique and low power technology mapping consider CPLD is proposed. Allocation processing selected module consider the module calculation after scheduling process for circuit by HDL. Select CPLD for constrain after allocation. A Boolean equation is partitioned for CLB by allocated modules. The proposed binding algorithm is description using optimum CLB within a CPLD consider low power. The proposed algorithm is examined by using 16 bit FIR filter. In the case that applicate the algorithm, the experiments results show reduction in the power consumption by 43% comparing with that of non application algorithm.

• Journal of the Korean Society for information Management
• /
• v.1 no.1
• /
• pp.25-42
• /
• 1984

The intellectual organization of information for storage and retrieval is one of the problem areas of information science. But the most of the methods have been developed are based on the coordination of keywords by Boolean logic or traditional classification systems. It is necessary to include in indexing process not just concepts or keywords, but also to express explicitly the relationship between them. Farradane believed that such a system should be founded on the psychology of thinking and developed an outline structure for concept organization and a series of explicit relations. The system of relational operators provides nine symbols which enable the semantic relationship between any two concepts to be explicitly specified in a analet. With the addition of the permutations of such analets, formed according to simple rules, alphabetical arrangement of the first term provides a complete logical subject index. Relational indexing as the basis of an indexing language has the potential to offer improved retrieval performance.

• Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.151-160
• /
• 2016

Cutter-workpiece engagement (CWE) is the instantaneous contact geometry between the cutter and the in-process workpiece during machining. It plays an important role in machining process simulation and directly affects the calculation of the predicted cutting forces and torques. The difficulty and challenge of CWE determination come from the complexity due to the changing geometry of in-process workpiece and the curved tool path of cutter movement, especially for multi-axis milling. This paper presents a new method to determine the CWE for general milling processes. To fulfill the requirement of generality, which means for any cutter type, any in-process workpiece shape, and any tool path even with self-intersections, all the associated geometries are to be modeled as triangle meshes. The involved triangle-to-triangle intersection calculations are carried out by an effective method in order to realize the multiple subtraction Boolean operations between the tool and the workpiece mesh models and to determine the CWE. The presented method has been validated by a series of case studies of increasing machining complexity to demonstrate its applicability to general milling processes.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.38-49
• /
• 1994

One of the most common problems encountered in the automatic translation of FORTRAN source code to VECTRAN is the occurrence of conditional transfer of control within loops. Transfers of control create control dependencies, in which the execution of a statement is dependent on the value of a variable in another statement. In this paper I propose algorithms involve an attempt to convert statements in the loop into conditional assignment statements that can be easily analyzed for data dependency, and this paper presents a simplification method for conditional assignment statement. Especially, I propose not only a method for simplifying boolean functions but extended method for n-state functions.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.709-719
• /
• 1997

Performance of an algorithm can be mesaurde from serval aspects.Suppose thre is a query formulation al-gorithm.Even though this algorithm shows high retrival performance, ie, high recall and percision, retriveing items can rake a long time.In this study, we time complexity of automatic query reformulation algorithms, named the query Tree, DNF method, and Dillon's method, and comparethem in theoretical and practical aspects using a tral-time performance)the absolute times for each algorithm to fromulate a query)in a Sun SparcStation 2. In experiments using three test sets, CSCM, CISI, and Medlars, the query Tree algorithm was the fastest among the three algorithms tested.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.48-55
• /
• 2001

Using BDD, we can represent Boolean functions uniquely and compactly, Hence, BDD have become widely used for CAD applications, such as logic synthesis, formal verification, and etc. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variables. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm based on the $\mu$O(microcanonical optimization). $\mu$O consists of two distinct procedures that are alternately applied : Initialization and Sampling. The initialization phase is to executes a fast local search, the sampling phase leaves the local optimum obtained in the previous initialization while remaining close to that area of search space. The proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to a algorithm based on simulated annealing.

• Spatial Information Research
• /
• v.7 no.2
• /
• pp.223-236
• /
• 1999

Recently, the need of wast incineratory has been recognized. However, the waste incinerator is considered the typical example of NYMB syndrome as a locally unwanted facilities. Therefore, the site selection of waste incineratory should be determined very carefully with consideration of various location factors. The purpose of this study is to provide a new decision-making process model for site selection that provides a rational and a systematic way. The fuzzy set theory and AHP theory, which have merits to overcome uncertainly and complexity of spatial data, are applied to select candidate sites for the waste incineratory. The method is able to produce a more flexible and objective solution for selecting suitability sites in comparison to rigid boolean logic. The result of this study shows that geographic information systems have clear implication for informing the spatial decision making process.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.10
• /
• pp.843-850
• /
• 2005

FBA(flux balance analysis) with Boolean rules for representing regulatory events has correctly predicted cellular behaviors, such as optimal flux distribution, maximal growth rate, metabolic by-product, and substrate concentration changes, with various environmental conditions. However, until now, since FBA has not taken into account a hierarchical regulatory network, it has limited the representation of the whole transcriptional regulation mechanism and interactions between specific regulatory proteins and genes. In this paper, in order to solve these problems, we describe the construction of hierarchical regulatory network with defined symbols and the introduction of a weight for representing interactions between symbols. Finally, the whole cellular behaviors with time were simulated through the linkage of a hierarchical regulatory network module and dynamic simulation module including FBA. The central metabolic network of E. coli was chosen as the basic model to identify our suggested modeling method.