Control of A Cart-Ball System Using State-Feedback Controller

A cart-ball system is a challenging system from the control engineering point of view. This is due to the nonlinearities, multivariable, and non-minimum phase behavior present in this system. This paper is concerned with the problem of modeling and control of such system. The objective of control strategy is to place the cart at a desired position while balancing the ball on the top of the arc-shaped track fixed on the cart. A State-Feedback Controller (SFC) with a pole-placement method will be designed in order to control the system. At first, the mathematical model of a cart-ball system in the state-space form is developed. Then, the linearization of a model will be established in order to design a SFC. The integral control strategy will be performed as to control the cart position of a system. Simulation work is then performed using MATLAB/SIMULINK software in order to study the performance of SFC when applied to the system.

Self-evolving Artificial Immune System via Developing T and B Cell for Permutation Flow-shop Scheduling Problems

Artificial Immune System is applied as a Heuristic Algorithm for decades. Nevertheless, many of these applications took advantage of the benefit of this algorithm but seldom proposed approaches for enhancing the efficiency. In this paper, a Self-evolving Artificial Immune System is proposed via developing the T and B cell in Immune System and built a self-evolving mechanism for the complexities of different problems. In this research, it focuses on enhancing the efficiency of Clonal selection which is responsible for producing Affinities to resist the invading of Antigens. T and B cell are the main mechanisms for Clonal Selection to produce different combinations of Antibodies. Therefore, the development of T and B cell will influence the efficiency of Clonal Selection for searching better solution. Furthermore, for better cooperation of the two cells, a co-evolutional strategy is applied to coordinate for more effective productions of Antibodies. This work finally adopts Flow-shop scheduling instances in OR-library to validate the proposed algorithm.

Solving Fully Fuzzy Linear Systems by use of a Certain Decomposition of the Coefficient Matrix

In this paper, we give a certain decomposition of the coefficient matrix of the fully fuzzy linear system (FFLS) to obtain a simple algorithm for solving these systems. The new algorithm can solve FFLS in a smaller computing process. We will illustrate our method by solving some examples.

Persistence of Termination for Term Rewriting Systems with Ordered Sorts

A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property. Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema's result can be extended to term rewriting systems on ordered sorts, i.e., termination is persistent for term rewriting systems on ordered sorts without collapsing, decreasing or duplicating rules. Furthermore we give the example as application of this result. Also we obtain that completeness is persistent for this class of term rewriting systems.

An Active Set Method in Image Inpainting

In this paper, we apply a semismooth active set method to image inpainting. The method exploits primal and dual features of a proposed regularized total variation model, following after the technique presented in [4]. Numerical results show that the method is fast and efficient in inpainting sufficiently thin domains.

A Preemptive Link State Spanning Tree Source Routing Scheme for Opportunistic Data Forwarding in MANET

Opportunistic Data Forwarding (ODF) has drawn much attention in mobile adhoc networking research in recent years. The effectiveness of ODF in MANET depends on a suitable routing protocol which provides a powerful source routing services. PLSR is featured by source routing, loop free and small routing overhead. The update messages in PLSR are integrated into a tree structure and no need to time stamp routing updates which reduces the routing overhead.

New Class of Chaotic Mappings in Symbol Space

Symbolic dynamics studies dynamical systems on the basis of the symbol sequences obtained for a suitable partition of the state space. This approach exploits the property that system dynamics reduce to a shift operation in symbol space. This shift operator is a chaotic mapping. In this article we show that in the symbol space exist other chaotic mappings.

An Asymptotic Solution for the Free Boundary Parabolic Equations

In this paper, we investigate the solution of a two dimensional parabolic free boundary problem. The free boundary of this problem is modelled as a nonlinear integral equation (IE). For this integral equation, we propose an asymptotic solution as time is near to maturity and develop an integral iterative method. The computational results reveal that our asymptotic solution is very close to the numerical solution as time is near to maturity.

Motion Planning and Control of Autonomous Robots in a Two-dimensional Plane

This paper proposes a solution to the motion planning and control problem of a point-mass robot which is required to move safely to a designated target in a priori known workspace cluttered with fixed elliptical obstacles of arbitrary position and sizes. A tailored and unique algorithm for target convergence and obstacle avoidance is proposed that will work for any number of fixed obstacles. The control laws proposed in this paper also ensures that the equilibrium point of the given system is asymptotically stable. Computer simulations with the proposed technique and applications to a planar (RP) manipulator will be presented.

Existence and Globally Exponential Stability of Equilibrium for BAM Neural Networks with Mixed Delays and Impulses

In this paper, a class of generalized bi-directional associative memory (BAM) neural networks with mixed delays is investigated. On the basis of Lyapunov stability theory and contraction mapping theorem, some new sufficient conditions are established for the existence and uniqueness and globally exponential stability of equilibrium, which generalize and improve the previously known results. One example is given to show the feasibility and effectiveness of our results.

A Modification on Newton's Method for Solving Systems of Nonlinear Equations

In this paper, we are concerned with the further study for system of nonlinear equations. Since systems with inaccurate function values or problems with high computational cost arise frequently in science and engineering, recently such systems have attracted researcher-s interest. In this work we present a new method which is independent of function evolutions and has a quadratic convergence. This method can be viewed as a extension of some recent methods for solving mentioned systems of nonlinear equations. Numerical results of applying this method to some test problems show the efficiently and reliability of method.

Mixed Convection Boundary Layer Flow from a Vertical Cone in a Porous Medium Filled with a Nanofluid

The steady mixed convection boundary layer flow from a vertical cone in a porous medium filled with a nanofluid is numerically investigated using different types of nanoparticles as Cu (copper), Al2O3 (alumina) and TiO2 (titania). The boundary value problem is solved by using the shooting technique by reducing it into an ordinary differential equation. Results of interest for the local Nusselt number with various values of the constant mixed convection parameter and nanoparticle volume fraction parameter are evaluated. It is found that dual solutions exist for a certain range of mixed convection parameter.

Variational Iteration Method for the Solution of Boundary Value Problems

In this work, we present a reliable framework to solve boundary value problems with particular significance in solid mechanics. These problems are used as mathematical models in deformation of beams. The algorithm rests mainly on a relatively new technique, the Variational Iteration Method. Some examples are given to confirm the efficiency and the accuracy of the method.

New Classes of Salagean type Meromorphic Harmonic Functions

In this paper, a necessary and sufficient coefficient are given for functions in a class of complex valued meromorphic harmonic univalent functions of the form f = h + g using Salagean operator. Furthermore, distortion theorems, extreme points, convolution condition and convex combinations for this family of meromorphic harmonic functions are obtained.

Confidence Intervals for the Normal Mean with Known Coefficient of Variation

In this paper we proposed two new confidence intervals for the normal population mean with known coefficient of variation. This situation occurs normally in environment and agriculture experiments where the scientist knows the coefficient of variation of their experiments. We propose two new confidence intervals for this problem based on the recent work of Searls [5] and the new method proposed in this paper for the first time. We derive analytic expressions for the coverage probability and the expected length of each confidence interval. Monte Carlo simulation will be used to assess the performance of these intervals based on their expected lengths.

An Analysis of Global Stability of a Class of Neutral-Type Neural Systems with Time Delays

This paper derives some new sufficient conditions for the stability of a class of neutral-type neural networks with discrete time delays by employing a suitable Lyapunov functional. The obtained conditions can be easily verified as they can be expressed in terms of the network parameters only. It is shown that the results presented in this paper for neutral-type delayed neural networks establish a new set of stability criteria, and therefore can be considered as the alternative results to the previously published literature results. A numerical example is also given to demonstrate the applicability of our proposed stability criterion.

Laplace Transformation on Ordered Linear Space of Generalized Functions

Aim. We have introduced the notion of order to multinormed spaces and countable union spaces and their duals. The topology of bounded convergence is assigned to the dual spaces. The aim of this paper is to develop the theory of ordered topological linear spaces La,b, L(w, z), the dual spaces of ordered multinormed spaces La,b, ordered countable union spaces L(w, z), with the topology of bounded convergence assigned to the dual spaces. We apply Laplace transformation to the ordered linear space of Laplace transformable generalized functions. We ultimately aim at finding solutions to nonhomogeneous nth order linear differential equations with constant coefficients in terms of generalized functions and comparing different solutions evolved out of different initial conditions. Method. The above aim is achieved by • Defining the spaces La,b, L(w, z). • Assigning an order relation on these spaces by identifying a positive cone on them and studying the properties of the cone. • Defining an order relation on the dual spaces La,b, L(w, z) of La,b, L(w, z) and assigning a topology to these dual spaces which makes the order dual and the topological dual the same. • Defining the adjoint of a continuous map on these spaces and studying its behaviour when the topology of bounded convergence is assigned to the dual spaces. • Applying the two-sided Laplace Transformation on the ordered linear space of generalized functions W and studying some properties of the transformation which are used in solving differential equations. Result. The above techniques are applied to solve non-homogeneous n-th order linear differential equations with constant coefficients in terms of generalized functions and to compare different solutions of the differential equation.

Ranking Alternatives in Multi-Criteria Decision Analysis using Common Weights Based on Ideal and Anti-ideal Frontiers

One of the most important issues in multi-criteria decision analysis (MCDA) is to determine the weights of criteria so that all alternatives can be compared based on the collective performance of criteria. In this paper, one of popular methods in data envelopment analysis (DEA) known as common weights (CWs) is used to determine the weights in MCDA. Two frontiers named ideal and anti-ideal frontiers, instead of ideal and anti-ideal alternatives, are defined based on two new proposed CWs models. Ideal and antiideal frontiers are more flexible than that of alternatives. According to the optimal solutions of these two models, the distances of an alternative from the ideal and anti-ideal frontiers are derived. Then, a relative distance is introduced to measure the value of each alternative. The suggested models are linear and despite weight restrictions are feasible. An example is presented for explaining the method and for comparing to the existing literature.