We present our research findings on the practicality of using RFID for building context-aware homes in India. Our research is the result of an endeavor to bring this global trend of smart homes to India. Rather than s...
详细信息
ISBN:
(纸本)9780889866386
We present our research findings on the practicality of using RFID for building context-aware homes in India. Our research is the result of an endeavor to bring this global trend of smart homes to India. Rather than studying the effects of such an influence in its original form-building smart homes equipped with such high-end sensors as real-time, audio-video sensing, and sophisticated, environmental sensors as are popular in a typical smart home-we studied the viability of realizing ambient-intelligence using simple, low-cost, and robust RFID sensors, which we believe would be suitable to Indian dwellings in the near future. We describe the learning and prediction algorithm used in our study;we modeled time as fuzzy-sets and used Markov model for predicting the future locations of inhabitants wearing RFID bracelets. Our system provides context-aware reactive and proactive services. We modeled the uncertainties-involved in inferring users' activities from their location information-using Bayesian Belief Networks or BBNs. this improved the accuracy of prediction considerably. Our experience showed that it is possible to develop cost-effective, easily deployable, context-aware homes using only RFID in India in the short-term before high-end sensing technologies mature and become commercially affordable in the longer run.
the relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic, abbreviated ATL) and linear temporal l...
详细信息
ISBN:
(纸本)354037406X
the relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen's interval algebra (or Allen's temporal logic, abbreviated ATL) and linear temporal logic (LTL). A discrete variant of ATL is defined, called Allen linear temporal logic (ALTL), whose models are w-sequences of timepoints. It is shown that any ALTL formula can be linearly translated into an equivalent LTL formula, thus enabling the use of LTL techniques on ALTL requirements. this translation also implies the NP-completeness of ATL satisfiability. then the problem of monitoring ALTL requirements is investigated, showing that it reduces to checking satisfiability;the similar problem for unrestricted LTL is known to require exponential space. An effective monitoring algorithm for ALTL is given, which has been implemented and experimented with in the context of planning applications.
We have created a logic-based, Turing-complete language for stochastic modeling. Since the inference scheme for this language is based on a variant of Pearl's loopy belief propagation algorithm, we call it Loopy L...
详细信息
We have created a logic-based, Turing-complete language for stochastic modeling. Since the inference scheme for this language is based on a variant of Pearl's loopy belief propagation algorithm, we call it Loopy logic. Traditional Bayesian networks have limited expressive power, basically constrained to finite domains as in the propositional calculus. Our language contains variables that can capture general classes of situations, events and relationships. A first-order language is also able to reason about potentially infinite classes and situations using constructs such as hidden Markov models(HMMs). Our language uses an Expectation-Maximization (EM) type learning of parameters. this has a natural fit withthe Loopy Belief Propagation used for inference since both can be viewed as iterative message passing algorithms. We present the syntax and theoretical foundations for our Loopy logic language. We then demonstrate three examples of stochastic modeling and diagnosis that explore the representational power of the language. A mechanical fault detection example displays how Loopy logic can model time-series processes using an HMM variant. A digital circuit example exhibits the probabilistic modeling capabilities, and finally, a parameter fitting example demonstrates the power for learning unknown stochastic values.
the Genetic programming (GP) is a powerful technique for Symbolic Regression. However, because it is a new area, many improvements can be obtained changing the basic behavior of the method. In this way, this work deve...
详细信息
In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchronously and concurrently on different threads. th...
详细信息
ISBN:
(纸本)354037406X
In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchronously and concurrently on different threads. this paper investigates the problem of model checking programs that follow this idiom. We present a programming language SPL that encapsulates this design pattern. SPL extends simplified form of sequential Java to which we add the capability of making asynchronous method invocations in addition to the standard synchronous method calls and the ability to execute asynchronous methods in threads atomically and concurrently. Our main result shows that the control state reachability problem for finite SPL programs is decidable. therefore, such multithreaded programs can be model checked using the counterexample guided abstraction-refinement framework.
By introducing the concepts of a loop and a loop formula, Lin and Zhao showed that the answer sets of a nondisjunctive logic program are exactly the models of its Clark's completion that satisfy the loop formulas ...
详细信息
Computer programs that can be expressed in two or more dimensions are typically called visual programs. the underlying theories of visual programming languages involve graph grammars. As graph grammars are usually con...
详细信息
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integers in the homogeneous case, and over...
详细信息
ISBN:
(纸本)354037406X
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integers in the homogeneous case, and over the rationals in the general case. this is done by analyzing the powers of a matrix symbolically using its eigenvalues. Our results generalize the work of Tiwari [Tiw04], where similar results were derived for termination over the reals. We also gain some insights into termination of non-homogeneous integer programs, that are very common in practice.
In this paper, we describe an interesting driver assignment problem that is computationally intensive to solve due to its combinatorial nature. A hybrid approach involoving mixed integer programming (MIP) and a heuris...
详细信息
Software reliability models are used to estimate the probability of a software fails along the time. they are fundamental to plan test activities and to ensure the quality of the software being developed. Two kind of ...
详细信息
暂无评论