in the present work, the effects of operating conditions including ph, transmembrane pressure, oil concentration, and temperature on fouling resistance and the rejection of turbidity for a polymeric membrane in an ultrafiltration system of wastewater treatment were studied. a new modeling technique called evolutionary polynomial regression (epr) was investigated. epr is a method based on regres...

this article addresses an efficient and novel method for singularity-free path planning and obstacle avoidance of parallel manipulator based on neural networks. a modified 4-5-6-7 interpolating polynomial is used to plan a trajectory for a spherical parallel manipulator. the polynomial function which is smooth and continuous in displacement, velocity, acceleration and jerk is used to find a pat...

In this lecture1, we will give a local algorithm to test whether a given function is close to a low degree polynomial, i.e. check whether the function f : Fm → F (given as a truth-table) is close to the evaluation of some multi-variate polynomial of low degree without reading all of f . This problem is refered to as the “low-degree testing”. The main references for this lecture include Lecture ...

it is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular cdma/tdma networks can be mapped to a multi-dimensional multiple-choice knapsack problem (mmkp) which is np-hard. in this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. numerical results indicate significant computational performance impr...

In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by k. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee (k + 2)/3. This local search algorithm is a special case of a more general procedure that allows to swap up to Θ(log n) elements per iteration. We also design problem instances with...

As a method of function approximation, polynomial fitting has always been the main research hotspot in mathematical modeling. In many disciplines such as computer, physics, biology, neural networks have widely used, and most applications transformed into problems using networks. One reasons that can be used is it certain sense universal approximation. order to fit polynomial, this paper constru...

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

We give an efficient algorithm for partitioning the domain of a numeric function f into segments. The function f is realized as a polynomial in each segment, and a lookup table stores the coefficients of the polynomial. Such an algorithm is an essential part of the design of lookup table methods [5,8,9,12,14,15] for realizing numeric functions, such as sin(πx), ln(x), and √ −ln(x). Our algorith...