A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The present paper intends to give a short introduction into the field and to present some preliminary discussion on the complexity of...

A topological space X is said to be semi-re-connected at a point xGA" provided there exists an open set U containing x such that every Cech re-cycle on a compact subset of U bounds on X. (If X is regular, "a compact subset of" may be omitted.) If X is semi-re-connected at every point, then X is said to be semi-w-connected [l].2 As shown in [l], if a space has a finite 1-dimensional Betti number...

SOME CONTRIBUTIONS TO SEMI-SUPERVISED LEARNING

The eigenvalue equation of a semirelativistic Hamiltonian composed of the relativistic kinetic term of spin-0 particles and static interactions is called spinless Salpeter equation. It is regarded as relativistic generalization of the nonrelativistic Schrödinger approach, or as approximation to the homogeneous Bethe–Salpeter equation in its instantaneous limit. The nonlocality inherent to this ...

A signed graph (or sigraph in short) is an ordered pair S = (Su, σ), where Su is a graph G = (V,E), called the underlying graph of S and σ : E → {+,−} is a function from the edge set E of Su into the set {+,−}, called the signature of S. The ×-line sigraph of S denoted by L×(S) is a sigraph defined on the line graph L(S u) of the graph Su by assigning to each edge ef of L(Su), the product of si...