Adaptivity in programming languages

A programming style can be seen as a particular model of shaping thought or a special way of codifying language to solve a problem. An adaptive device is made up of an underlying formalism, for instance, an automaton, a grammar, a decision tree, etc., and an adaptive mechanism, responsible for providing features for self-modification. Adaptive languages are obtained by using some programming language as the device’s underlying formalism. The conception of such languages calls for a new programming style, since the application of adaptive technology in the field of programming languages suggests a new way of thinking. Adaptive languages have the basic feature of allowing the expression of programs which self-modifying through adaptive actions at runtime. With the adaptive style, programming language codes can be structured in such a way that the codified program therein modifies or adapts itself towards the needs of the problem. The adaptive programming style may be a feasible alternate way to obtain self-modifying consistent codes, which allow its use in modern applications for self-modifying code.

Adaptive languages and a new programming style

A programming style can be seen as a particular model of shaping thought or a special way of codifying language to solve a problem. Adaptive languages have the basic feature of allowing the expression of programs which self-modifying through adaptive actions at runtime. The conception of such languages calls for a new programming style, since the application of adaptive technology in the field of programming languages suggests a new way of thinking. With the adaptive style, programming language codes can be structured in such a way that the codified program therein modifies or adapts itself towards the needs of the problem. The adaptive programming style may be a feasible alternate way to obtain self-modifying consistent codes, which allow its use in modern applications for self-modifying code.

Controle fuzzy espacialmente diferenciado para um sistema de irrigação

Traditional irrigation projects do not locally determine the water availability in the soil. Then, irregular irrigation cycles may occur: some with insufficient amount that leads to water deficit, other with excessive watering that causes lack of oxygen in plants. Due to the nonlinear nature of this problem and the multivariable context of irrigation processes, fuzzy logic is suggested to replace commercial ON-OFF irrigation system with predefined timing. Other limitation of commercial solutions is that irrigation processes either consider the different watering needs throughout plant growth cycles or the climate changes. In order to fulfill location based agricultural needs, it is indicated to monitor environmental data using wireless sensors connected to an intelligent control system. This is more evident in applications as precision agriculture. This work presents the theoretical and experimental development of a fuzzy system to implement a spatially differentiated control of an irrigation system, based on soil moisture measurement with wireless sensor nodes. The control system architecture is modular: a fuzzy supervisor determines the soil moisture set point of each sensor node area (according to the soil-plant set) and another fuzzy system, embedded in the sensor node, does the local control and actuates in the irrigation system. The fuzzy control system was simulated with SIMULINK® programming tool and was experimentally built embedded in mobile device SunSPOTTM operating in ZigBee. Controller models were designed and evaluated in different combinations of input variables and inference rules base

The open capacitated arc routing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

About the Use of the HdHr Algorithm Group in Integrating the Movement Equation with Nonlinear Terms

This work summarizes the HdHr group of Hermitian integration algorithms for dynamic structural analysis applications. It proposes a procedure for their use when nonlinear terms are present in the equilibrium equation. The simple pendulum problem is solved as a first example and the numerical results are discussed. Directions to be pursued in future research are also mentioned. Copyright (C) 2009 H.M. Bottura and A. C. Rigitano.

A neural network approach for robust nonlinear parameter estimation in presence of unknown-but-bounded errors

Systems based on artificial neural networks have high computational rates due to the use of a massive number of simple processing elements and the high degree of connectivity between these elements. This paper presents a novel approach to solve robust parameter estimation problem for nonlinear model with unknown-but-bounded errors and uncertainties. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the network convergence to the equilibrium points. A solution for the robust estimation problem with unknown-but-bounded error corresponds to an equilibrium point of the network. Simulation results are presented as an illustration of the proposed approach. Copyright (C) 2000 IFAC.

A neural system to robust Nonlinear optimization subject to disjoint and constrained sets

The ability of neural networks to realize some complex nonlinear function makes them attractive for system identification. This paper describes a novel method using artificial neural networks to solve robust parameter estimation problems for nonlinear models with unknown-but-bounded errors and uncertainties. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the network convergence to the equilibrium points. A solution for the robust estimation problem with unknown-but-bounded error corresponds to an equilibrium point of the network. Simulation results are presented as an illustration of the proposed approach.

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

KT-invexity in optimal control problems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Dynamics in dumbbell domains II. The limiting problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Periodic waves and solitons in a nonlinear fibre with resonant impurities

We shall consider a coupled nonlinear Schrodinger equation- Bloch system of equations describing the propagation of a single pulse through a nonlinear dispersive waveguide in the presence of resonances; this could be, for example, a doped optical fibre. By making use of the integrability of the dynamic equations, we shall apply the finite-gap integration method to obtain periodic solutions for this system. Next, we consider the problem of the formation of solitons at a sharp front pulse and, by means of the Whitham modulational theory, we derive the amplitude and velocity of the largest soliton.

Formation of soliton trains in Bose-Einstein condensates as a nonlinear Fresnel diffraction of matter waves

The problem of generation of atomic soliton trains in elongated Bose-Einstein condensates is considered in framework of Whitham theory of modulations of nonlinear waves. Complete analytical solution is presented for the case when the initial density distribution has sharp enough boundaries. In this case the process of soliton train formation can be viewed as a nonlinear Fresnel diffraction of matter waves. Theoretical predictions are compared with results of numerical simulations of one- and three-dimensional Gross-Pitaevskii equation and with experimental data on formation of Bose-Einstein bright solitons in cigar-shaped traps. (C) 2003 Elsevier B.V. All rights reserved.

C programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Localized modes of binary mixtures of Bose-Einstein condensates in nonlinear optical lattices

The properties of the localized states of a two-component Bose-Einstein condensate confined in a nonlinear periodic potential (nonlinear optical lattice) are investigated. We discuss the existence of different types of solitons and study their stability by means of analytical and numerical approaches. The symmetry properties of the localized states with respect to nonlinear optical lattices are also investigated. We show that nonlinear optical lattices allow the existence of bright soliton modes with equal symmetry in both components and bright localized modes of mixed symmetry type, as well as dark-bright bound states and bright modes on periodic backgrounds. In spite of the quasi-one-dimensional nature of the problem, the fundamental symmetric localized modes undergo a delocalizing transition when the strength of the nonlinear optical lattice is varied. This transition is associated with the existence of an unstable solution, which exhibits a shrinking (decaying) behavior for slightly overcritical (undercritical) variations in the number of atoms.