Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

 This paper deals with a short term forecasting non-stationary time series using wavelets and splines. Wavelets can decompose the series as the sum of two low and high frequency components. Aminghafari and Poggi (2007) proposed to predict high frequency component by wavelets and extrapolate low frequency component by local polynomial fitting. We propose to forecast non-stationary process u...

in this paper, solution of nonlinear optimal control problems and the controlled duffing oscillator, as a special class of optimal control problems, are considered and an efficient algorithm is proposed. this algorithm is based on state parametrization as a polynomial with unknown coefficients. by this method, the control and state variables can be approximated as a function of time. also, the ...

We give a polynomial time algorithm for computing the Igusa local zeta function Z(s, f) attached to a polynomial f(x) ∈ Z[x], in one variable, with splitting field Q, and a prime number p. We also propose a new class of linear feedback shift registers based on the computation of Igusa’s local zeta function.

The authors propose an algorithm for detection of three-dimensional bundaries in noisy images based on higher-order polynomial surface fitting and directional smoothing. Fitting a polynomial to the local intensities gives the intensity hypersurface. An isointensity surface i s derived from the hyperplane and directional smwthiag is defined as smoothing along this isointensjty surface. The devel...

We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V,E), with local rewards r : E → Z, and three types of positions: black VB, white VW , and random VR forming a partition of V . It is a longstanding open question whether a polynomial time algorithm for BWR-games exists, or not, even when |VR| = 0. In fact, a pseudo-polyn...

A nonassociative algebra is nilpotent if there is some n such that the product of any n elements, no matter how they are associated, is zero. Several related, but more general, notions are left nilpotency, solvability, local nilpotency, and nillity. First the complexity of several decision problems for these properties is examined. In finite-dimensional algebras over a finite field it is shown ...