We solve the problem of computing the residual reliability (the RES problem) for all classes of P-threshold graphs for which efficient structural characterizations based on decomposition to indecomposable components have been established. In particular, we give a constructive proof of existence of linear algorithms for computing residual reliability of pseudodomishold, domishold, matrogenic and...

Using language of dg PROPs we give a new short proof of existence of star products on (formal) germs of Poisson manifolds.

Using language of dg PROPs we give a new proof of existence of star products on (formal) germs of Poisson manifolds.

We provide cubature formulas for the calculation of derivatives of expected values in the spririt of Terry Lyons and Nicolas Victoir. In financial mathematics derivatives of option prices with respect to initial values, so called Greeks, are of particular importance as hedging parameters. The proof of existence of Cubature formulas for Greeks is based on an argument, which leads to the calculat...

Estimating Recovery Rate and Recovery Amount has become important in consumer credit because of the new Basel Accord regulation and because of the increase in number of defaulters due to the recession. We compare linear regression and survival analysis models for modelling Recovery rates and Recovery amounts, so as to predict Loss Given Default (LGD) for unsecured consumer loans or credit cards...

With the increase in structural complexities in modern cities, many operations, be they military, police, fire service, intelligence, rescue, or other field operations, require localization services and online situation awareness to make them effective. The digital data collected from such systems are sensitive hence security concerns regarding the transmission of such digital data across secur...

In 1984, Raoult proposed a formalization of graph rewritings using pushouts in the category of graphs and partial functions. This note generalizes his method and formulates algebraic graph structure to introduce a more general framework for graph rewritings and to give a simple proof of existence theorem of pushouts using relational calculus.

We present a computer assisted proof of existence of a family of Lyapunov orbits which stretches from L2 (the collinear libration point between the primaries) up to half the distance to the smaller primary in the Jupiter-Sun planar circular restricted three body problem. We then focus on a small family of Lyapunov orbits with energies close to comet Oterma and show that their associated invaria...

We describe a set of algorithms (and corresponding codes) that serve as a basis for an automated proof of existence of a certain dynamical behaviour in a given dynamical system. In particular it is in principle possible to automatically verify the presence of complicated dynamics using these tools. The Hénon map is used to illustrate these techniques.

In 1970, E. M. Andreev published a classification of all three dimensional compact hyperbolic polyhedra having non-obtuse dihedral angles [3]. Given a combinatorial description of a polyhedron, C, Andreev’s Theorem provides five classes of linear inequalities, depending on C, for the dihedral angles, which are necessary and sufficient conditions for the existence of a hyperbolic polyhedron real...