Dealing with structured data needs the use of expressive representation formalisms that, however, puts the problem to deal with the computational complexity of the machine learning process. Furthermore, real world domains require tools able to manage their typical uncertainty. Many statistical relational learning approaches try to deal with these problems by combining the construction of releva...

The application of simulation software has proven to be a crucial tool for tsunami hazard assessment studies. Understanding the potentially devastating effects tsunamis leads development safety and resilience measures, such as design evacuation plans or planning economic investment necessary quickly mitigate their consequences. This article introduces pseudo-probabilistic seismic-triggered appr...

Fault-tolerant systems designed with redundancy techniques are typically subject to common-cause failures, which are multiple dependent component failures caused by a shared root cause or a common cause (also known as a shock). There are two types of shocks: fatal and non-fatal. A fatal shock (FS) will fail all components of a system. A non-fatal shock (NFS) will affect only a subset of system ...

Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when triggered by external events require to be executed within a given deadline from the triggering time. The feasibility analysis problem for such a real-time system asks whether it is possible to schedule all such blocks of code s...

title: An Error Bound for the Pseudo Expectation: 1D Case author: Osamu Watanabe and Johannes Schneider affiliation: Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology W8-25, Tokyo 152-8552 email: [email protected] acknowledgments to financial supports: Supported in part by a Grant-in-Aid for Scientific Research on Priority Areas “Statical-Mechanical Approach to ...

Background modeling and subtraction is a core component in motion analysis. The central idea behind such module is to create a probabilistic representation of the static scene that is compared with the current input to perform subtraction. Such approach is efficient when the scene to be modeled refers to a static structure with limited perturbation. In this paper, we address the problem of mode...

We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial Time), a complexity verifier tool that is sound and extensionally complete for the Probabilistic Polynomial Time (PP) complexity class. iSAPP works on an imperative programming language for stack machines. The certificate of polynomiality can be built in polytime, with respect to the number of stacks used. 1998 ACM Subjec...

Probabilistic inference is a technique used in expert systems for reasoning under uncertainty. A typical inference task is to determine the probability of some events (say diseases) given evidence about other events (say ndings). Inference is conveniently represented as the propagation of evidence in a graph called a belief network. Probabilistic inference is computationally very expensive (NP-...

Abstract With the rapid development of renewable energy, a large number energy stations are connected to power system, which leads decrease in inertia system and an increase safety risks suffered. Thus, online static security assessment (SSA) is increasingly necessary. However, because uncertainty it not feasible check all possible scenarios SSA. To reduce calculations achieve SSA short time, n...

We consider multivariate pseudo-linear functions over finite fields of characteristic two. A pseudo-linear polynomial is a sum of guarded linear-terms, where a guarded linear-term is a product of one or more linear-guards and a single linear term, and each linear-guard is again a linear term but raised to the power q-1, where q is the field size. Pseudo-linear functions over GF(2) are given by ...