• The Transactions of the Korea Information Processing Society
• /
• v.13 no.2
• /
• pp.13-17
• /
• 2024

In this paper, union-based rule antecedent neuro-fuzzy controller, which can guarantee a parsimonious knowledge base with reduced number of rules, is proposed. The proposed neuro-fuzzy controller allows union operation of input fuzzy sets in the antecedents to cover bigger input domain compared with the complete structure rule which consists of AND combination of all input variables in its premise. To construct the proposed neuro-fuzzy controller, we consider the multiple-term unified logic processor (MULP) which consists of OR and AND fuzzy neurons. The fuzzy neurons exhibit learning abilities as they come with a collection of adjustable connection weights. In the development stage, the genetic algorithm (GA) constructs a Boolean skeleton of the proposed neuro-fuzzy controller, while the stochastic reinforcement learning refines the binary connections of the GA-optimized controller for further improvement of the performance index. An inverted pendulum system is considered to verify the effectiveness of the proposed method by simulation and experiment.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.5 no.4
• /
• pp.1-8
• /
• 1968

A TANT network is a three-level network composed solely of NAND gates having only true(i.e. uncomplemented) inputs. The paper presents a technique for finding for any given Boolean function a least-cost TANT network. The first step of the technique is to determine essential prime implicants(EPI) by Quine-McCluskey procedure or other methods and generate prime implicants(PI) hving the same head as any one of EPI by consensus operation. The second step is to select common factors among the usable tail factors. The selcetion phase is analogous to the use of C-C table. The last step is to minimize inputs by deleting the redundant PI. the technique permits hand solution of typical five-and six-variable problems.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.406-410
• /
• 2003

B. M. Schein([1]) considered systems of the form (${\Phi}$; ${\circ}$,-), where ${\Phi}$ is a set of functions closed under the composition "${\circ}$" of functions and the set theoretic subtraction "-". In this structure, (${\Phi}$; ${\circ}$) is a function semigroup and (${\Phi}$;-) is a subtraction algebra in the sense of [1]. He proved that every subtraction semigroup is isomorphic to a difference semigroup of invertible functions. Also this structure is closely related to the mathematical logic, Boolean algebra, Bck-algera, etc. In this paper, we define the near subtraction semigroup as a generalization of the subtraction semigroup, and define the notions of strong for it, and then we will search the general properties of this structure, the properties of ideals, and the application of it.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.9-14
• /
• 2002

Boolean retrieval is simple and elegant. However, since there is no provision for term weighting, no ranking of the answer set is generated. As a result, the size of the output might be too large or too small. Relevance feedback is the most popular query reformulation strategy. in a relevance feedback cycle, the user is presented with a list of the retrieved documents and, after examining them, marks those which are relevant. In practice, only the top 10(or 20) ranked documents need to be examined. The main idea consists of selecting important terms, or expressions, attached to the documents that have been identified as relevant by the user, and of enhancing the importance of these terms in a new query formulation. The expected effect is that the new query will be moved towards the relevant documents and away from the non-relevant ones. Local analysis techniques are interesting because they take advantage of the local context provided with the query. In this regard, they seem more appropriate than global analysis techniques. In a local strategy, the documents retrieved for a given query q are examined at query time to determine terms for query expansion. This is similar to a relevance feedback cycle but might be done without assistance from the user.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1169-1172
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm consider area and delay time is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. The proposed algorithm is examined by using benchmarks in SIS. In the case of that the number of OR-terms is 5, the experiments results show that reduce the power consumption by 30.73% comparing with that of TEMPLA, and 17.11% comparing with that of PLAmap respectively.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.86-91
• /
• 2008

To present the design procedure of discretized 8-bit tent map executing the transformation of tent function which is one of the chaotic functions, first, the truth table of discretized tent map was written, and then according to the simplified Boolean algebra equations obtained from the truth table, the discretized map is implemented with the exclusive logic gate as a real hardware. The discretized tent map circuit which provides the feedback circuit for generating the period-8 states relevant to the 8-bit finite precision is also designed and presented in this paper. Furthermore, it might be used stream cipher system with a new key-stream circuit for generate of chaotic binary sequence.

• Journal of Korean Library and Information Science Society
• /
• v.35 no.1
• /
• pp.303-317
• /
• 2004

The purpose of this study was to develop a framework for predicting searching performance through an understanding of how cognitive ability relates to searching process and outcome. Specifically, this study examined the relationship between spatial visualization, logical reasoning, integrative reasoning, and information searching process and outcome. Information searching process was assessed by seven search process indicators: (1) search command selection: (2) combination of search commands; (3) application of Boolean logic: (4) application of truncation; (5) use of limit search function; (6) number of search statements; and (7) number of search errors made. Searching outcome was assessed by the number of correct answers to search questions. Subjects first took three standardized cognitive tests that measured cognitive abilities, and performed online catalog searching in response to seven information search questions. The searches were logged using Lotus ScreenCam, and reviewed for the analysis. Factor analysis was used to find underlying structures of the seven search process variables. Multiple regression analysis was applied to examine the predictive power of three cognitive variables on three extracted factors, and search outcome. Results of the data analysis showed that individual differences in logical reasoning could predict information searching process and outcome.

• 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.

• 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.