Comportamiento del trigo candeal en las condiciones ambientales del Valle Bonaerense del Río Colorado

p.101-106Con el fin de evaluar la adaptación del cultivo de trigo para fideos o trigo candeal (Triticum durum Desf.) a las condiciones ambientales del Valle Bonaerense del Río Colorado, las que incluyen riego, se realizó una serie de ensayos durante los años 1985-87. En ellos además se analizó la respuesta a la fertilización nitrogenada, tanto en rendimiento como en calidad de grano, empleando dos fuentes de nitrógeno. El cultivar Buck Candisur superó en rendimiento el resto de los comerciales, alcanzando un máximo de 6651 kg.ha-1 en 1987. Su contenido proteico fue bajo, siendo consistentemente superado por Bonaerense Quilacó. El que mostró un potencial de rendimiento algo menor, aunque no difirió estadísticamente de aquel. Ambos cultivares no difirieron en peso de mil granos o peso hectolítrico. La dosis de 100 kg de N.ha-1resultó la óptima para lograr un buen rendimiento con máxima eficiencia de uso del nitrógeno. A ese nivel no se detectaron diferencias significativas entre las fuentes de nitrógeno urea y sulfato de amonio. La dosis de 200 kg de N.ha-1 maximizó el contenido proteico

Robust control of an evaporator through algebraic Riccati equations and d-k iteration

Evaporation is a process that is widely used in the chemical industry and aims to concentrate a solution consisting of a non-volatile solute and a volatile solvent. In this paper the design of robust control systems for a simple effect evaporation system is presented. Two controllers were designed, the first was based on the Algebraic Riccati Equations (ARE) solutions technique and the second was derived from the D-K iteration method. To show the potentiality of the control system proposed, we present the results of some tests carried out in simulation

Loop-closure candidates selection by exploiting structure in vehicle trajectory

One of the most important problems in robot localisation is the detection of previously visited places (loops). When a robot closes a loop, the association between observed features and present ones can be used to update its position. The computational cost involved in the association process makes exhaustive loop search intractable. Most of the current techniques use observations of the environment as their main features to produce loop hypotheses. In this paper, we investigate the feasibility of producing loop candidates from features of the robot trajectory. We propose a new method for selecting loop-closure candidates based on an alignment likelihood function, which measures similarity between trajectory sequences. The algorithm is validated with data gathered in the city with our experimental platform. Positive results show that the trajectory has, indeed, features that can be extracted and applied to robot localisation. The resulting loop hypotheses may be regarded, for example, as a initialisation step to aid current methods. © 2011 IEEE

On orthogonal realizations for adaptive IIR filters

Convergence speed is one of the main concerns in adaptive IIR filters. Fast convergence can be closely related to adaptive filter realization. However, with the exception of the lattice realization that is based on the nice properties of Szëgo orthonormal polynomials, no other adaptive IIR filter realization using orthonormal characteristics seems to be extensively studied in the literature. Furthermore, many orthogonal realizations for adaptive FIR filters, that are particularly suitable for rational modelling, have been proposed in the past years. Since rational orthogonal basis functions are a powerful tool for efficient system representation they seem attractive for adaptive IIR filters. In this paper, we present some theoretical results related to the properties of a generalized orthonormal realization when used for mean‐square output error minimization in a system identification application. One result is related to the low computational complexity of the updating gradient algorithm when some properties of the orthonormal realization are used. An additional result establishes conditions for the stationary points of the proposed updating algorithm. In order to confirm the expected performance of the new realization, some simulations and comparisons with competing realizations in terms of computational complexity and convergence speed are presented.Fil: Cousseau, Juan Edmundo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; ArgentinaFil: Diniz, P. S. R.. Universidade Federal do Rio de Janeiro; BrasilFil: Sentoni, G.. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; ArgentinaFil: Agamennoni, Osvaldo Enrique. Universidad Nacional del Sur. Departamento de Ingeniería Eléctrica y de Computadoras; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentin