42532593
A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator
We present a formalization of fuzzy logic based on Zadeh's implication operator a→b=max{1-a, b}. Our logical system allows the specification of both lower and upper bounds of the truth value of a formula. We present a specific system of axioms and inference rules which are both sound and complete. We also provide a generalization of the classical resolution method which acts as a decision procedure in a finite fuzzy theory.
14245135
Automatic Correlation and Calibration of Noisy Sensor Readings Using Elite Genetic Algorithms
This paper explores an image processing application of optimization techniques which entails interpreting noisy sensor data. The application is a generalization of image correlation; we attempt to find the optimal gruence which matches two overlapping gray scale images corrupted with noise. Both tabu search and genetic algorithms are used to find the parameters which match the two images. A genetic algorithm approach using an elitist reproduction scheme is found to provide significantly superior results.
27866706
A New Method of Circumscribing Beliefs: The Propositional Case
We propose here a new notion of a minimal model for forming circumscription in belief-logic by incorporating the notion of minimal models in the prepositional logic. This results in a new circumscription operation for belief-formulas than the one considered in [4-6]. An important feature of the new circumscription operation is its close relationship with the circumscription of prepositional formulas. For instance, we have CIRC[Bp] = B(CIRC[p]), where p is a prepositional formula. We give several examples to show that the new notion of circumscription fits quite well with intuition.
30548729
A Class of Stratified Programs in Autoepistemic Logic of Knowledge and Belief
Przymusinski proposed [11] AELB, the autoepistemic logic of knowledge and belief. The AELB logic is a very powerful and expressive formal system which isomorphically contains various major non-monotonic knowledge representation formalisms and major logic program semantics. Thus AELB can be used as a unifying framework for non-monotonic knowledge representation formalisms, which allows us to compare and better understand different formalizations of common-sense knowledge.
39684197
A sound and complete proof theory for the generalized logic of only knowing
We present a sound and complete proof theory for the generalized logic of only knowing (GOL). The GOL logic is a modal logic proposed recently (Chen 1997) as a unified logical framework for non-monotonic reasoning, which extends the logic of only knowing (OL) of Levesque (1990), and covers the important notion of epistemic specification (Gelfond 1991, Gelfond and Przymusinska 1993) which is very useful for knowledge representation. The OL logic has been shown to have close connections with Lifschitz's minimal belief and negation as failure (Lifschitz 1994) and various other major non-monotonic formalisms. The GOL logic is more general and powerful than OL. The completeness result for the GOL proof theory establishes the theoretical foundation for answering queries in epistemic theories. This work is restricted to the propositional case only.
9144862
Rules and fuzzy rules in text: concept, extraction and usage
Several concepts and techniques have been imported from other disciplines such as Machine Learning and Artificial Intelligence to the field of textual data. In this paper, we focus on the concept of rule and the management of uncertainty in text applications. The different structures considered for the construction of the rules, the extraction of the knowledge base and the applications and usage of these rules are detailed. We include a review of the most relevant works of the different types of rules based on their representation and their application to most of the common tasks of Information Retrieval such as categorization, indexing and classification.
7673579
Managing personal and group collections of information
The internet revolution has dramatically increased the amount of information available to users. Various tools such as search engines have been developed to help users find the information they need from this vast repository. Users often also need tools to help manipulate the growing amount of useful information they have discovered. Current tools available for this purpose are typically local components of web browsers designed to manage URL bookmarks. They provide limited functionalities to handle high information complexities.
40634947
Experiments Study on a Dynamic Priority Scheduling for Wireless Sensor Networks
Wireless Sensors Networks (WSNs) represent a new generation of embedded systems, which deploy wireless ad hoc communication mechanisms to route a sensory data from the originator sensor node to the base station. One of the most important issues in wireless sensor networks is to support real-time QoS, which is fundamentally a challenging problem. In this paper, we introduce EDBP scheduling algorithm for sensor network along with a MAC protocol based on the dynamic priority assignment EDBP. Two different platforms based experiment projects are designed to test our proposal.
5885564
On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]
The field of supply chain management has been growing at a rapid pace in recent years, both as a research area and as a practical discipline. In this paper, we study the computational complexity of product covering problems in 3-tier supply chain models, and present natural complete problems for the classes W[3] and W[4] in parameterized complexity theory. This seems the first group of natural complete problems for higher levels in the parameterized intractability hierarchy (i.e., the W-hierarchy), and the first precise complexity characterizations of certain optimization problems in the research of supply chain management. Our results also derive strong computational lower bounds and inapproximability for these optimization problems.
2466823
Two methods for creating chinese painting
We present two methods to create realistic Chinese painting. The first method is to create 3D Chinese painting animation using existing software packages. The second method is an expressive paint tool which allows an artist to interactively create 2D Chinese painting.
6688024
Error-resilient real-time video communications over IP-based LANs
Video communication over IP networks involves more issues than that over ATM networks in terms of error control. First, IP networks provide neither prioritized transmission nor guaranteed QOS for data packets. Second, video streams need to be packetized well before transmission over IP networks in order to have good error resilience characteristics. Finally, the mitigation of spatial and temporal error propagation in IP networks is very different from that in ATM networks upon the loss of IP packets. In this paper, we develop an error-resilient video communication system based on the H.323 family of ITU-T recommendations. With a low-delay backward channel for packet receipt reports, bidirectional error resilience mechanisms are employed to avoid error spreading in the temporal domain. Two operation modes, i.e., ACK and NACK, are devised for two communicating parties to eliminate error propagation after either one frame lag or one round trip delay without consuming much additional bandwidth as compared to simple INTRA updates. Our system can also adaptively choose an operation mode to maintain a satisfactory video quality at the decoder under variable channel error conditions. It is shown by experimental results that our error control scheme is suitable for video transmission over IP-based LANs at packet loss rates up to 20%.