Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems

ln) iterations, where ν is the parameter of a self-concordant barrier for the cone, ε is a relative accuracy and ρ_f is a feasibility measure. We also discuss the behavior of path-following methods as applied to infeasible problems. We prove that strict infeasibility (primal or dual) can be detected in O(ln) iterations, where ρ_· is a primal or dual infeasibility measure. Received April 25, 1996 / Revised version received March 4, 1998 Published online October 9, 1998     

Hybrid spectral gradient method for the unconstrained minimization problem

We present a hybrid algorithm that combines a genetic algorithm with the Barzilai–Borwein gradient method. Under specific assumptions the new method guarantees the convergence to a stationary point of a continuously differentiable function, from any arbitrary initial point. Our preliminary numerical results indicate that the new methodology finds efficiently and frequently the global minimum, in comparison with the globalized Barzilai–Borwein method and the genetic algorithm of the Toolbox of Genetic Algorithms of MatLab.      

AIS Based Distributed Wireless Sensor Network for Mobile Search and Rescue Robot Tracking

This research presents the implementation of GSCF, an AIS-based control framework, on a distributed wireless sensor network for tracking search and rescue robots in open fields. The General Suppression Control Framework (GSCF) is a framework inspired by the suppression hypothesis of the immune discrimination theory. The framework consists of five distinct components; each carries a specific function that can generate long-term and short-term influences to other components by the use of humoral and cellular signals. The goal of the research is to develop mathematical models that can assist the control and analyses of robots behavior through the use of Suppressor Cells in the Suppression Modulator. Acquire data from the physical robot will be used as simulation parameters in future search and rescue research.     

Metabolic Systemic Computing: Exploiting Innate Immunity within an Artificial Organism for On-line Self-Organisation and Anomaly Detection

Previous work suggests that innate immunity and representations of tissue can be useful when combined with artificial immune systems. Here we provide a new implementation of tissue for artificial immune systems using systemic computation, a new model of computation and corresponding computer architecture based on a systemics world-view and supplemented by the incorporation of natural characteristics. We show using systemic computation how to create an artificial organism, a program with metabolism that eats data, expels waste, self-organise cells based on the nature of its food and emits danger signals suitable for an artificial immune system. The implementation is tested by application to two standard machine learning sets and shows excellent abilities to recognise anomalies in its diet as well as a consistent datawise self-organisation.     

Deformation Techniques for Sparse Systems

We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral deformation of Huber and Sturmfels. The complexity of our algorithm is cubic in the size of the combinatorial structure of the input system. This size is mainly represented by the cardinality and mixed volume of Newton polytopes of the input polynomials and an arithmetic analogue of the mixed volume associated to the deformations under consideration. Research was partially supported by the following grants: UBACyT X112 (2004–2007), UBACyT X847 (2006–2009), PIP CONICET 2461, PIP CONICET 5852/05, ANPCyT PICT 2005 17-33018, UNGS 30/3005, MTM2004-01167 (2004–2007), MTM2007-62799 and CIC 2007–2008.