Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudoBoolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application area...

Simple Temporal Networks with Uncertainty (STNUs) allow the representation of temporal problems where some durations are uncontrollable (determined by nature), as is often the case for actions in planning. It is essential to verify that such networks are dynamically controllable (DC) – executable regardless of the outcomes of uncontrollable durations – and to convert them to an executable form....

The wave type field equation θ = λθ, where θ is a coframe field on a space-time, was recently proposed to describe the gravity field. This equation has a unique static, spherical-symmetric, asymptotically-flat solution, which leads to the viable Yilmaz-Rosen metric. We show that the wave type field equation is satisfied by the pseudo-conformal frame if the conformal factor is determined by a sc...

We show that using max-algebraic techniques it is possible to generate the set of all solutions to a system of inequalities xi xj bij ; i; j = 1; :::; n using n generators. This e¢ cient description enables us to develop a pseudopolynomial algorithm which either …nds a bounded mixed-integer solution, or decides that no such solution exists. AMS Classi…cation [2000]: Primary 68Q25, 15A18; Second...

The Quadratic Travelling Salesman Problem (QTSP) is to find a least-cost Hamiltonian cycle in an edge-weighted graph, where costs are defined on all pairs of edges such that each edge in the pair is contained in the Hamiltonian cycle. This is a more general version than the one that appears in the literature as the QTSP, denoted here as the adjacent quadratic TSP, which only considers costs for...

background: one of the challenges of pet/mri combined systems is to derive an attenuation map to correct the pet image. for that, the pseudo-ct image could be used to correct the attenuation. until now, most existing scientific researches construct this pseudo-ct image using the registration techniques. however, these techniques suffer from the local minima of the non-rigid deformation energy f...

In this research, Graphene Oxide- Gold nanoparticles (AuNP/GO) were easily fabricated by a redox reaction between GO and chloroauric acid without using any additional reductant and then used to stabilize Pickering emulsions. (AuNP/GO) was investigated by FT-IR spectroscopy. The changes of parameters such as contact time, pH, Amoxicillin initial concentration and temperature were tested and inve...

In this paper we discuss various problems and conjectures concered the pseudo-Smarandache squarefree function.

Charles Ashbacher [1] has posed a number of questions relating to the pseudo-Smarandache function Z(n). In this note we show that the ratio of consecutive values Z(n + 1)/Z(n) and Z(n − 1)/Z(n) are unbounded; that Z(2n)/Z(n) is unbounded; that n/Z(n) takes every integer value infinitely often; and that the series ∑ n 1/Z(n) is convergent for any α > 1.

Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...