laguerre function has many advantages such as good approximation capability for different systems, low computational complexity and the facility of on-line parameter identification. therefore, it is widely adopted for complex industrial process control. in this work, laguerre function based adaptive model predictive control algorithm (ampc) was implemented to control continuous stirred tank rea...

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

The Big Bang-Big Crunch (BB–BC) method is a relatively new meta-heuristic algorithm which inspired by one of the theories of the evolution of universe. In the BB–BC optimization algorithm, firstly random points are produced in the Big Bang phase then these points are shrunk to a single representative point via a center of mass or minimal cost approach in the Big Crunch phase. In this paper, the...

In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...

Wind energy is one of the most promising renewable energy resources. Due to instantaneous variations of the wind speed, an appropriate Maximum Power Point Tracking (MPPT) method is necessary for maximizing the captured energy from the wind at different speeds. The most commonly used MPPT algorithms are Tip Speed Ratio (TSR), Power Signal Feedback (PSF), Optimal Torque Control (OTC) and Hill Cli...

In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...

Window-based elliptic curve multiplication algorithms are more attractive than non-window techniques if precomputation is allowed. Reducing the complexity of elliptic curve point multiplication of the form , which is the dominant operation in elliptic curve cryptography schemes, will reduces the overall complexity of the cryptographic protocol. The wBD is a new window-based elliptic curve multi...

The fundamental matrix is a basic tool in the analysis of scenes taken with two uncalibrated cameras, and the 8-point algorithm is a frequently cited method for computing the fundamental matrix from a set of 8 or more point matches. It has the advantage of simplicity of implementation. The prevailing view is, however, that it is extremely susceptible to noise and hence virtually useless for mos...