‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

Ulam asked in 1945 if there is an everywhere dense rational set, i.e. a point set in the plane with all its pairwise distances rational. Erdős conjectured that if a set S has a dense rational subset, then S should be very special. The only known types of examples of sets with dense (or even just infinite) rational subsets are lines and circles. In this paper we prove Erdős’ conjecture for algeb...

In this paper we solve for the quantum propagator of a general time dependent system quadratic in both position and momentum, linearly coupled to an infinite bath of harmonic oscillators. We work in the regime where the quantum optical master equation is valid. We map this master equation to a Schroedinger equation on Super-Hilbert space and utilize Lie Algebraic techniques to solve for the dyn...

In this paper, a new numerical algorithm is introduced to solve the Blasius equation, which is a third-order nonlinear ordinary differential equation arising in the problem of two-dimensional steady state laminar viscous flow over a semi-infinite flat plate. The proposed approach is based on the first kind of Bessel functions collocation method. The first kind of Bessel function is an infinite ...

Recall that a complete first-order theory with infinite models is strongly minimal if in any of its models, every parameter-definable subset of the model is finite or cofinite. Classical examples are theories of vector spaces and algebraically closed fields; also the degenerate example of the theory of infinite ‘pure’ sets where the only structure comes from equality. Algebraic closure in a str...

Monadic MV –algebras are an algebraic model of the predicate calculus of the Lukasiewicz infinite valued logic in which only a single individual variable occurs. GMV -algebras are a non-commutative generalization of MV -algebras and are an algebraic counterpart of the non-commutative Lukasiewicz infinite valued logic. We introduce monadic GMV -algebras and describe their connections to certain ...

degenerate kernel approximation method is generalized to solve hammerstein system of fredholm integral equations of the second kind. this method approximates the system of integral equations by constructing degenerate kernel approximations and then the problem is reduced to the solution of a system of algebraic equations. convergence analysis is investigated and on some test problems, the propo...

This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...

In the present paper, a solution for the boundary value problem over a semi-infinite interval has been obtained by transforming the two-dimensional laminar boundary equations into a nonlinear ordinary equation using similarity variables. Moreover, a collocation method is proposed to solve the Falkner-Skan equation. This method is based on rational Legendre functions and convert the Falkner-Skan...

this paper introduces a new approach to topology, based on category theory and universal algebra, and called categorically-algebraic (catalg) topology. it incorporates the most important settings of lattice-valued topology, including poslat topology of s.~e.~rodabaugh, $(l,m)$-fuzzy topology of t.~kubiak and a.~v{s}ostak, and $m$-fuzzy topology on $l$-fuzzy sets of c.~guido. moreover, its respe...