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...

This paper is concerned with an indefinite weight linear eigenvalue problem in cylindrical domains. We investigate the minimization of the positive principal eigenvalue under the constraint that the weight is bounded by a positive and a negative constant and the total weight is a fixed negative constant. Biologically, this minimization problem is motivated by the question of determining the opt...

‎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‎.

is a modular form of weight n/2 on Γ0(N), where N is the level of Q, i.e. NQ−1 is integral and NQ−1 has even diagonal entries. This was proved by Schoeneberg [5] for even n and by Pfetzer [3] for odd n. Shimura [6] uses the Poisson summation formula to generalize their results for arbitrary n and he also computes the theta multiplier explicitly. Stark [8] gives a different proof by converting θ...

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.