Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

We study under what conditions bound consistency (BC) and arc consistency (AC), two forms of propagation used in constraint solvers, are equivalent to each other. We show that they prune exactly the same values when the propagated constraint is connected row convex / closed under median and its complement is row convex. This characterization is exact for binary constraints. Since row convexity ...

This thesis presents a new method for detection of complex curvatures such as corners, circles, and star patterns. The method is based on a second degree local polynomial model applied to a local orientation description in double angle representation. The theory of rotational symmetries is used to compute curvature responses from the parameters of the polynomial model. The responses are made mo...

The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...

one of the water resources modeling requirements is sufficient knowledge of long-term series of meteorological and hydrological parameters. in this study the nearest neighbor resampling method presented by lall and sharma was developed. in the developed model, the knn regression was used for time series forecasting instead of local polynomial used in the developed algorithm by prairie. in this ...

Let f (x) be a separable polynomial over a local field. The Montes algorithm computes certain approximations to the different irreducible factors of f (x), with strong arithmetic properties. In this paper, we develop an algorithm to improve any one of these approximations, till a prescribed precision is attained. The most natural application of this ‘‘single-factor lifting’’ routine is to combi...

A locally testable semigroup S is a semigroup with the property that for some nonnegative integer k, called the order or level of local testability, two words u and v in some set of generators for S are equal in the semigroup if (1) the pre x and su x of the words of length k coincide, and (2) the set of intermediate substrings of length k of the words coincide. The local testability problem fo...

We present an algorithm that finds the splitting field of a polynomial over a local field. Our algorithm is an OM algorithm modified for this task.

We suggest a one dimensional jump detection algorithm based on local polynomial tting for jumps in regression functions (zero-order jumps) or jumps in derivatives ((rst-order or higher-order jumps). If jumps exist in the m-th order derivative of the underlying regression function, then an (m + 1) order polynomial is tted in a neighborhood of each design point. We then characterize the jump info...