Attribute Exploration of Discrete Temporal Transitions

Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome and proteome time series by literature and database knowledge. The starting point of a formal concept analysis model is presented. The objects of a formal context are states of the interesting entities, and the attributes are the variable properties defining the current state (e.g. observed presence or absence of proteins). Temporal transitions assign a relation to the objects, defined by deterministic or non-deterministic transition rules between sets of pre- and postconditions. This relation can be generalized to its transitive closure, i.e. states are related if one results from the other by a transition sequence of arbitrary length. The focus of the work is the adaptation of the attribute exploration algorithm to such a relational context, so that questions concerning temporal dependencies can be asked during the exploration process and be answered from the computed stem base. Results are given for the abstract example of a game and a small gene regulatory network relevant to a biomedical question.Comment: Only the email address and reference have been replace

One-way quantum computing with arbitrarily large time-frequency continuous-variable cluster states from a single optical parametric oscillator

One-way quantum computing is experimentally appealing because it requires only local measurements on an entangled resource called a cluster state. Record-size, but non-universal, continuous-variable cluster states were recently demonstrated separately in the time and frequency domains. We propose to combine these approaches into a scalable architecture in which a single optical parametric oscillator and simple interferometer entangle up to ($3\times 10^3$ frequencies) $\times$ (unlimited number of temporal modes) into a new and computationally universal continuous-variable cluster state. We introduce a generalized measurement protocol to enable improved computational performance on this new entanglement resource.Comment: (v4) Consistent with published version; (v3) Fixed typo in arXiv abstract, 14 pages, 8 figures; (v2) Supplemental material incorporated into main text, additional explanations added, results unchanged, 14 pages, 8 figures; (v1) 5 pages (3 figures) + 6 pages (5 figures) of supplemental material; submitted for publicatio

Constraint-Based Abstraction of a Model Checker for Infinite State Systems

Abstract. Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition sys-tems or other dual transition systems. By contrast we apply completely standard techniques for constructing abstract interpretations to the abstraction of a CTL semantic function, without restricting the kind of properties that can be verified. Furthermore we show that this leads directly to implementation of abstract model checking algorithms for abstract domains based on constraints, making use of an SMT solver.

The mind-body problem; three equations and one solution represented by immaterial-material data

Human life occurs within a complex bio-psycho-social milieu, a heterogeneous system that is integrated by multiple bidirectional interrelations existing between the abstract-intangible ideas and physical-chemical support of environment. The mind is thus placed between the abstract ideas/ concepts and neurobiological brain that is further connected to environment. In other words, the mind acts as an interface between the immaterial (abstract/ intangible) data and material (biological) support. The science is unable to conceives and explains an interaction between the immaterial and material domains (to understand nature of the mind), this question generating in literature the mind-body problem. We have published in the past a succession of articles related to the mind-body problem, in order to demonstrate the fact that this question is actually a false issue. The phenomenon of immaterial-material interaction is impossible to be explained because it never occurs, which means that there is no need to explain the immaterial-material interaction. Our mind implies only a temporal association between the immaterial data and material support, this dynamic interrelation being presented and argued here as a solution to the mind-body problem. The limited psycho-biologic approach of the mind-body problem is expanded here to a more comprehensive and feasible bio-psycho-social perspective, generating thus three distinct (bio- psychological, bio-social, and psycho-social) equations. These three equations can be solved through a solution represented by a dynamic cerebral system (two distinct and interconnected subunits of the brain) which presumably could have the capability of receiving and processing abstract data through association (with no interaction) between immaterial and material data

The algebra of spatio-temporal intervals

[[abstract]]The relations among temporal intervals can be used to model all time dependent objects. We propose a fast mechanism for temporal relation compositions. A temporal transitive closure table is derived, and an interval-based temporal relation algebraic system is constructed. Thus, we propagate the time constraints of arbitrary two objects across long distances n by linear time. We also give a complete discussion of different possible domains of interval relations. A set of algorithms is proposed to detect time conflicts and to derive reasonable interval relations. The algorithms are extended for time-based media in an arbitrary n-dimensional space[[notice]]補正完畢[[conferencetype]]國際[[conferencedate]]19980121~19980121[[conferencelocation]]Tokyo, Japa

Deep Temporal Clustering: Fully Unsupervised Learning of Time-Domain Features

abstract: Unsupervised learning of time series data, also known as temporal clustering, is a challenging problem in machine learning. This thesis presents a novel algorithm, Deep Temporal Clustering (DTC), to naturally integrate dimensionality reduction and temporal clustering into a single end-to-end learning framework, fully unsupervised. The algorithm utilizes an autoencoder for temporal dimensionality reduction and a novel temporal clustering layer for cluster assignment. Then it jointly optimizes the clustering objective and the dimensionality reduction objective. Based on requirement and application, the temporal clustering layer can be customized with any temporal similarity metric. Several similarity metrics and state-of-the-art algorithms are considered and compared. To gain insight into temporal features that the network has learned for its clustering, a visualization method is applied that generates a region of interest heatmap for the time series. The viability of the algorithm is demonstrated using time series data from diverse domains, ranging from earthquakes to spacecraft sensor data. In each case, the proposed algorithm outperforms traditional methods. The superior performance is attributed to the fully integrated temporal dimensionality reduction and clustering criterion.Dissertation/ThesisMasters Thesis Computer Engineering 201

Synthesis of Switching Protocols from Temporal Logic Specifications

We propose formal means for synthesizing switching protocols that determine the sequence in which the modes of a switched system are activated to satisfy certain high-level specifications in linear temporal logic. The synthesized protocols are robust against exogenous disturbances on the continuous dynamics. Two types of finite transition systems, namely under- and over-approximations, that abstract the behavior of the underlying continuous dynamics are defined. In particular, we show that the discrete synthesis problem for an under-approximation can be formulated as a model checking problem, whereas that for an over-approximation can be transformed into a two-player game. Both of these formulations are amenable to efficient, off-the-shelf software tools. By construction, existence of a discrete switching strategy for the discrete synthesis problem guarantees the existence of a continuous switching protocol for the continuous synthesis problem, which can be implemented at the continuous level to ensure the correctness of the nonlinear switched system. Moreover, the proposed framework can be straightforwardly extended to accommodate specifications that require reacting to possibly adversarial external events. Finally, these results are illustrated using three examples from different application domains

An ICON programming technique for multimedia presentation designs

[[abstract]]Relations among temporal intervals can be used to assist the automatic generation of multimedia presentations. The authors analyze the domains of interval temporal relations. A set of algorithms is proposed to derive reasonable relations between intervals. Possible conflicts in the user specification are firstly detected and eliminated. The mechanism then constructs partial order relations among temporal intervals before the presentation time chart is built. The algorithm is extended for objects in an arbitrary n-dimensional space. Thus, presentation layouts in 2D space, or virtual reality object representations in 3D space can be constructed. They use the algorithms to design a reasoning system that generates the schedule and layout of multimedia presentations.[[conferencetype]]國際[[conferencedate]]19971028~19971031[[booktype]]紙本[[conferencelocation]]Beijing, Chin

Toward a generic spatial/temporal computation model for multimedia presentations

[[abstract]]Relations among temporal intervals can be used to assist the automatic generation of multimedia presentations. The authors analyze the domains of interval temporal relations. A set of algorithms is proposed to derive reasonable relations between intervals. Possible conflicts in the user specification are firstly detected and eliminated. The mechanism then constructs partial order relations among temporal intervals before the presentation time chart is built. The algorithm is extended for objects in an arbitrary n-dimensional space. Thus, presentation layouts in 2-D space, or virtual reality object representations in 3-D space can be constructed. They use their algorithms to design a reasoning system that generates the schedule and layout of multimedia presentations[[conferencetype]]國際[[conferencedate]]19970603~19970606[[conferencelocation]]Ottawa, Ont., Canad