‎We prove that there do not exist totally contact umbilical‎ ‎proper slant lightlike submanifolds of indefinite Sasakian manifolds other than totally contact geodesic‎ ‎proper slant lightlike submanifolds‎. ‎We also prove that there do‎ ‎not exist totally contact umbilical proper slant lightlike‎ ‎submanifolds of indefinite Sasakian space forms‎.

We present a compared analysis of some properties of indefinite almost S-manifolds and indefinite S-manifolds. We give some characterizations in terms of the Levi-Civita connection and of the characteristic vector fields. We study the sectional and φ-sectional curvature of indefinite almost S-manifolds and state an expression of the curvature tensor field for the indefinite S-space forms. We an...

The subject of this paper is the semantics of propositional disjunctive logic programs and indefinite deductive data bases. The concept of the indefinite model of a disjunctive logic program is introduced. The algorithm of computing the indefinite model and an algorithm of evaluation of clauses in the indefinite model, both using a parallel positive variant of resolution, are presented. The eva...

‎we prove that there do not exist totally contact umbilical‎ ‎proper slant lightlike submanifolds of indefinite sasakian manifolds other than totally contact geodesic‎ ‎proper slant lightlike submanifolds‎. ‎we also prove that there do‎ ‎not exist totally contact umbilical proper slant lightlike‎ ‎submanifolds of indefinite sasakian space forms‎.

Positive definite kernels, such as Gaussian Radial Basis Functions (GRBF), have been widely used in computer vision for designing feature extraction and classification algorithms. In many cases nonpositive definite (npd) kernels and non metric similarity/dissimilarity measures naturally arise (e.g., Hausdorff distance, Kullback Leibler Divergences and Compact Support (CS) Kernels). Hence, there...

We propose a generalization of the Ornstein-Uhlenbeck process in 1 + 1 dimensions which is the product of a temporal Ornstein-Uhlenbeck process with a spatial one and has exponentially decaying autocorrelation. The generalized Langevin equation of the process, the corresponding Fokker-Planck equation, and a discrete integral algorithm for numerical simulation is given. The process is an alterna...

Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper’s algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is inreased.

We obtain factorized domain wall partition functions for two sets of trigonometric vertex models: 1. The N-state Deguchi-Akutsu models, for N ∈ {2, 3, 4} (and conjecture the result for all N ≥ 5), and 2. The sl(r+1|s+1) Perk-Schultz models, for {r, s ∈ N}, where (given the symmetries of these models) the result is independent of {r, s}. 0. Introduction Domain wall partition functions (DWPF’s) w...

Perlmutter (1970) argued that the indefinite article is categorically different from the definite article and proposed that it is a clitic version of the numeral "one". But there are, as Perlmutter himself pointed out, instances of "a" as well as of "one" that don't seem to have the semantics of the numeral. Hence a divorce of "a" (and of "one") from "numeral"-hood is called for. Furthermore, t...

A simple algorithm is presented for evaluating scattering parameters of a two-port network. This technique uses the indefinite admittance matrix to calculate scattering or any other desired set of two-port parameters.