This paper focuses on the representation and querying of knowledge-based multimodal data. This work stands in the OTIM project which aims at processing multimodal annotation of a large conversational French speech corpus. Within OTIM, we aim at providing linguists with a unique framework to encode and manipulate numerous linguistic domains (from prosody to gesture). Linguists commonly use Typed...

This paper is concerned with perturbation problems of regularity linear systems. Two types of perturbation results are proved: (i) the perturbed system (A + P,B,C) generates a regular linear system provided both (A,B,C) and (A,B, P ) generate regular linear systems; and (ii) the perturbed system ((A−1 +ΔA)|X , B,C Λ ) generates a regular linear system if both (A,B,C) and (A,ΔA,C) generate regul...

This paper presents a development and an evaluation of a mobile mashup generator system to compose mobile mashup applications and Tethered Web services on a mobile device (TeWS). With less programming efforts, our system and description language framework enables a rapid development, a reusability of working components and a delivery of new cooperative mobile mashup applications. Working compon...

The problem of solving a system linear ordinary differential equations with constant coefficients is one the most important problems in both theory and algebra. Therefore, on hand, new methods algorithms are being developed for such systems, other existing systems improved. One well-known method reducing to single higher-order equation, which makes it possible find solutions original form combi...

Transient stability assessment (TSA) is a cornerstone for resilient operations of today’s interconnected power grids. This paper confluence quantum computing, data science and machine learning to potentially address the system TSA issue. We devise (QTSA) method enable efficient data-driven transient prediction bulk systems, which first attempt tackle issue with computing. Our contributions are ...

Abstract Actors are a popular mechanism for indirectly expressing concurrency. This article examines an implementation in the concurrent dialect of C ++, which runs actors on shared‐memory multi‐processor computers. The ++ actor system targets 32–256+ multi‐core computers that form backbone high‐performance computing, rather than distributed communication or robust execution via parentage fallb...

Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources). I define a natural, restricted version of premise semantics, expressible premise semantics, which is based on ordering sources containing onl...

Complex (or Composite) event processing systems have become more popular in a number of areas. Non-deterministic finite automata (NFA) are frequently used to evaluate CEP queries. However, it is complex or difficult to use the traditional NFA-based method to process patterns with conjunction and negation. In this paper, we proposed a new CEP system LogCEP using pushdown automaton to support eff...

In order to study circuit complexity classes within NC in a uniform setting we need a uniformity condition which is more restrictive than those in common use Two such conditions stricter than NC uniformity Ru Co have appeared in recent research Immerman s families of circuits de ned by rst order formulas Im a Im b and a unifor mity corresponding to Buss deterministic log time reductions Bu We s...

We investigate some logics with Henkin quantifiers. For a given logic L, we consider questions of the form: what is the degree of the set of L–tautologies in a poor vocabulary (monadic or empty)? We prove that the set of tautologies of the logic with all Henkin quantifiers in empty vocabulary L∗∅ is of degree 0 . We show that the same holds also for some weaker logics like L∅(Hω) and L∅(Eω). We...