Towards a general temporal theory

The research work presented herein addresses time representation and temporal reasoning in the domain of artificial intelligence. A general temporal theory, as an extension of Alien and Hayes', Gallon's and Vilain's theories, is proposed which treats both time intervals and time points on an equal footing; that is, both intervals and points are taken as primitive time elements in the theory. This means that neither do intervals have to be constructed out of points, nor do points have to be created as some limiting construction of intervals. This approach is different from that of Ladkin, of Van Beek, of Dechter, Meiri and Pearl, and of Maiocchi, which is either to construct intervals out of points, or to treat points and intervals separately. The theory is presented in terms of a series of axioms which characterise a single temporal relation, "meets", over time elements. The axiomatisation allows non-linear time structures such as branching time and parallel time, and additional axioms specifying the linearity and density of time are specially presented. A formal characterisation for the open and closed nature of primitive intervals, which has been a problematic question of time representation in artificial intelligence, is provided in terms of the "meets" relation. It is shown to be consistent with the conventional definitions of open/closed intervals which are constructed out of points. It is also shown that this general theory is powerful enough to subsume some representative temporal theories, such as Alien and Hayes's interval based theory, Bruce's and McDermott's point based theories, and the interval and point based theory of Vilain, and of Gallon. A finite time network based on the theory is specially addressed, where a consistency checker in two different forms is provided for cases with, and without, duration reasoning, respectively. Utilising the time axiomatisation, the syntax and semantics of a temporal logic for reasoning about propositions whose truth values are associated with particular intervals/points are explicitly defined. It is shown that the logic is more expressive than that of some existing systems, such as Alien's interval-based logic, the revised theory proposed by Gallon, Shoham's point-based interval logic, and Haugh's MTA based logic; and the corresponding problems with these systems are satisfactorily solved. Finally, as an application of the temporal theory, a new architecture for a temporal database system which allows the expression of relative temporal knowledge of data transaction and data validity times is proposed. A general retrieval mechanism is presented for a database with a purely qualitative temporal component which allows queries with temporal constraints in terms of any logical combination of Alien's temporal relations. To reduce the computational complexity of the consistency checking algorithm when quantitative time duration knowledge is added, a class of databases, termed time-limited databases, is introduced. This class allows absolute-time-stamped and relative time information in a form which is suitable for many practical applications, where qualitative temporal information is only occasionally needed, and the efficient retrieval mechanisms for absolute-time-stamped databases may be adopted

Deriving explanations from partial temporal information

The representation and manipulation of natural human understanding of temporal phenomena is a fundamental field of study in Computer Science, which aims both to emulate human thinking, and to use the methods of human intelligence to underpin engineering solutions. In particular, in the domain of Artificial Intelligence, temporal knowledge may be uncertain and incomplete due to the unavailability of complete and absolute temporal information. This paper introduces an inferential framework for deriving logical explanations from partial temporal information. Based on a graphical representation which allows expression of both absolute and relative temporal knowledge in incomplete forms, the system can deliver a verdict to the question if a given set of statements is temporally consistent or not, and provide understandable logical explanation of analysis by simplified contradiction and rule based reasoning

Design and Implementation of a Wireless Sensor Network for Smart Homes

Wireless sensor networks (WSNs) have become indispensable to the realization of smart homes. The objective of this paper is to develop such a WSN that can be used to construct smart home systems. The focus is on the design and implementation of the wireless sensor node and the coordinator based on ZigBee technology. A monitoring system is built by taking advantage of the GPRS network. To support multi-hop communications, an improved routing algorithm based on the Dijkstra algorithm is presented. Preliminary simulations have been conducted to evaluate the performance of the algorithm.Comment: International Workshop on Mobile Cyber-Physical Systems (MobiCPS 2010), in conjunction with UIC2010, IEEE, Xi'an, China, 26 - 29 October, 201

Ontology mapping of business process modeling based on formal temporal logic

A business process is the combination of a set of activities with logical order and dependence, whose objective is to produce a desired goal. Business process modeling (BPM) using knowledge of the available process modeling techniques enable a common understanding and analysis of a business process. Industry and academics use informal and formal methods respectively to represent business processes (BP), having the main objective to support an organization. Despite both are aiming at BPM but the methods used are quite different in their semantics. While carrying out literature research, it has been found that there is no general representation of business process modeling is available that is expressive than the commercial modeling tools and techniques. Therefore, it is primarily conceived to provide an ontology mapping of modeling terms of Business Process Modeling Notation (BPMN), Unified Modeling Language (UML) Activity Diagrams (AD) and Event Driven Process Chains (EPC) to temporal logic. Being a formal system, first order logic assists in thorough understanding of process modeling and its application. However, our contribution is to devise a versatile conceptual categorization of modeling terms/constructs and also formalizing them, based on well accepted business notions, such as action, event, process, sub-process, connector and flow. It is demonstrated that the new categorization of modeling terms mapped to formal temporal logic, provides the expressive power to subsume business process modeling techniques i.e. BPMN, UML AD and EPC

The effect that auditory distractions have on a visual P300 speller while utilizing low-cost off-the-shelf equipment

This paper investigates the effect that selected auditory distractions have on the signal of a visual P300 Speller in terms of accuracy, amplitude, latency, user preference, signal morphology, and overall signal quality. In addition, it ensues the development of a hierarchical taxonomy aimed at categorizing distractions in the P300b domain and the effect thereof. This work is part of a larger electroencephalography based project and is based on the P300 speller brain–computer interface (oddball) paradigm and the xDAWN algorithm, with eight to ten healthy subjects, using a non-invasive brain–computer interface based on low-fidelity electroencephalographic (EEG) equipment. Our results suggest that the accuracy was best for the lab condition (LC) at 100%, followed by music at 90% (M90) at 98%, trailed by music at 30% (M30) and music at 60% (M60) equally at 96%, and shadowed by ambient noise (AN) at 92.5%, passive talking (PT) at 90%, and finally by active listening (AL) at 87.5%. The subjects’ preference prodigiously shows that the preferred condition was LC as originally expected, followed by M90, M60, AN, M30, AL, and PT. Statistical analysis between all independent variables shows that we accept our null hypothesis for both the amplitude and latency. This work includes data and comparisons from our previous papers. These additional results should give some insight into the practicability of the aforementioned P300 speller methodology and equipment to be used for real-world applications

A discrete formalism for reasoning about action and change

This paper presents a discrete formalism for temporal reasoning about actions and change, which enjoys an explicit representation of time and action/event occurrences. The formalism allows the expression of truth values for given fluents over various times including nondecomposable points/moments and decomposable intervals. Two major problems which beset most existing interval-based theories of action and change, i.e., the so-called dividing instant problem and the intermingling problem, are absent from this new formalism. The dividing instant problem is overcome by excluding the concepts of ending points of intervals, and the intermingling problem is bypassed by means of characterising the fundamental time structure as a well-ordered discrete set of non-decomposable times (points and moments), from which decomposable intervals are constructed. A comprehensive characterisation about the relationship between the negation of fluents and the negation of involved sentences is formally provided. The formalism provides a flexible expression of temporal relationships between effects and their causal events, including delayed effects of events which remains a problematic question in most existing theories about action and change

Adaptive digital watermarking scheme based on support vector machines and optimized genetic algorithm

Digital watermarking is an effective solution to the problem of copyright protection, thus maintaining the security of digital products in the network. An improved scheme to increase the robustness of embedded information on the basis of discrete cosine transform (DCT) domain is proposed in this study. The embedding process consisted of two main procedures. Firstly, the embedding intensity with support vector machines (SVMs) was adaptively strengthened by training 1600 image blocks which are of different texture and luminance. Secondly, the embedding position with the optimized genetic algorithm (GA) was selected. To optimize GA, the best individual in the first place of each generation directly went into the next generation, and the best individual in the second position participated in the crossover and the mutation process. The transparency reaches 40.5 when GA’s generation number is 200. A case study was conducted on a 256 × 256 standard Lena image with the proposed method. After various attacks (such as cropping, JPEG compression, Gaussian low-pass filtering (3, 0. 5), histogram equalization, and contrast increasing (0.5, 0.6)) on the watermarked image, the extracted watermark was compared with the original one. Results demonstrate that the watermark can be effectively recovered after these attacks. Even though the algorithm is weak against rotation attacks, it provides high quality in imperceptibility and robustness and hence it is a successful candidate for implementing novel image watermarking scheme meeting real timelines

Efficient and effective state-based framework for news video retrieval

In this paper, an efficient and effective framework is proposed for news video retrieval. Firstly, the 64-dimensional colour histogram is extracted as the feature vector. Then the pair quantizer is adopted to transfer the news video retrieval problem into multi-dimensional string matching problem, which conduces to the efficiency to the framework. Secondly, a new measurement named ‘optimal temporal common subsequence’, which distinguishes the difference caused by rich temporal characteristics including temporal order, temporal duration and temporal gap, is designed to match state-sequence, followed by the point & interval-based formal characterization of time-series and state-sequences. Thirdly, we tested the proposed measurement on news video retrieval. The performance shows the proposed algorithm is more effective for news video retrieval

Security and privacy for data mining of RFID-enabled product supply chains

The e-Pedigree used for verifying the authenticity of the products in RFID-enabled product supply chains plays a very important role in product anti-counterfeiting and risk management, but it is also vulnerable to malicious attacks and privacy leakage. While the radio frequency identification (RFID) technology bears merits such as automatic wireless identification without direct eye-sight contact, its security has been one of the main concerns in recent researches such as tag data tampering and cloning. Moreover, privacy leakage of the partners along the supply chains may lead to complete compromise of the whole system, and in consequence all authenticated products may be replaced by the faked ones! Quite different from other conventional databases, datasets in supply chain scenarios are temporally correlated, and every party of the system can only be semi-trusted. In this paper, a system that incorporates merits of both the secure multi-party computing and differential privacy is proposed to address the security and privacy issues, focusing on the vulnerability analysis of the data mining with distributed EPCIS datasets of e-pedigree having temporal relations from multiple range and aggregate queries in typical supply chain scenarios and the related algorithms. Theoretical analysis shows that our proposed system meets perfectly our preset design goals, while some of the other problems leave for future research