Finding relational expressions which exist frequently in one class of data while not in the other class of data is an interesting work. In this paper, a relational expression of this kind is defined as a contrast inequality. Gene Expression Programming (GEP) is powerful to discover relations from data and express them in mathematical level. Hence, it is desirable to apply GEP to such mining tas...

Adding a temporal dimension to multimedia data is an interesting research topic, in particular with reference to the fruition of the cultural heritage. Time may be viewed either as valid-time or as transaction-time. In the rst sense, planning a virtual visit in time means working out a path that leads through the centuries taking into account the di erent historical contexts when the works of a...

Much research work has recently focused on the problem of representing historical information in XML. In this paper, we describe an ongoing work to represent XML changes. Our model is a three-dimensional XML-based model (3D_XML in short) for representing and querying histories of XML documents. The proposed model incorporates three time dimensions, valid time, transaction time, and efficacy tim...

A standard relation is two-dimensional with attributes and tuples as dimensions. A temporal relation contains two additional, orthogonal time dimensions, namely valid time and transaction time. Valid time records when facts are true in the modeled reality, and transaction time records when facts are stored in the temporal relation. While, in general, there are no restrictions between the valid ...

Knowledge graph (KG) completion adds new facts to a KG by making inferences from existing facts. Most existing methods ignore the time information and only learn from time-unknown fact triples. In dynamic environments that evolve over time, it is important and challenging for knowledge graph completion models to take into account the temporal aspects of facts. In this paper, we present a novel ...

We propose a method for integrity checking in the context of temporal deductive databases. A temporal deductive database is a deductive database that supports some aspect of time, in our case valid time, in which valid time is the time when the fact is true in the modelled reality. Our method augments a database with a set of transition and event rules, which explicitly define the insertions an...

We show that for pure and mixed states the problem of maximizing correlation measure in Clauser-Horne-Shimony-Holt inequality reduces to perimeter a parallelogram enclosed by an ellipse characterized entanglement contained bipartite system. Our geometrical description is valid nonmaximally entangled state. also determine corresponding optimal measurements.

In quantum physics, measurement error and disturbance were first naively thought to be simply constrained by the Heisenberg uncertainty relation. Later, more rigorous analysis showed that the error and disturbance satisfy more subtle inequalities. Several versions of universally valid errordisturbance relations (EDR) have already been obtained and experimentally verified in the regimes where na...

Most research in robust optimization has so far been focused on inequality-only, convex conic programming with simple linear models for uncertain parameters. Many practical optimization problems, however, are nonlinear and non-convex. Even in linear programming, coefficients may still be nonlinear functions of uncertain parameters. In this paper, we propose robust formulations (see (1) versus (...

Designing statistical procedures that are provably almost as accurate as the best one in a given family is one of central topics in statistics and learning theory. Oracle inequalities offer then a convenient theoretical framework for evaluating different strategies, which can be roughly classified into two classes: selection and aggregation strategies. The ultimate goal is to design strategies ...