Given an integer polyhedron PI ⊂ R, an integer point x̄ ∈ PI , and a point x∗ ∈ R \ PI , the primal separation problem is the problem of finding a linear inequality which is valid for PI , violated by x∗, and satisfied at equality by x̄. The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for se...

The objective of current paper is 3D simulation of turbulent, developing flow and unsteady within a circular duct in presence of the body force vector persuaded by Dielectric barrier discharge (DBD) plasma actuator inside the surface of geometry for the first time. This article aims at investigating of applying plasma actuator to control separation with special arrangement of electrodes. For th...

Image separation is defined as decomposing a real world image mixture into individual images objects. Independent component analysis is an active area of research and is being utilized for its capability in statistically independent separation images. Neural network algorithm ICA has been used to extract interference and mixed images and a very rapid developed statistical method during last few...

Certain hierarchical laminates with a wide separation of length scales are known theoretically to have optimal transport and mechanical properties. We derive analytical expressions for the n-point probability functions that statistically characterize the microstructure for more general hierarchical laminates with an arbitrary number of stages and a finite separation of length scales. Using two-...

The 0/1 primal separation problem is: Given an extreme point x̄ of a 0/1 polytope P and some point x , find an inequality which is tight at x̄, violated by x and valid for P or assert that no such inequality exists. It is known that this separation variant can be reduced to the standard separation problem for P. We show that 0/1 optimization and 0/1 primal separation are polynomial time equivalen...