Our article analyzes several research approaches about fertilization strategies, considering the soil-plant-climate ecosystem. We used the systematic literature review methodology, aiming to answer the research questions raised in our study. Yield and productivity of sugar cane crops is closely related to quality and efficiency of fertilization strategies. We approach fertilization strategies in sugar cane crops analyzing old and new methodologies, recognizing their respective strengths and weaknesses, and looking for new improvements on them to prevent the environmental impact caused by crop fertilization.

espanolEl proposito de este articulo es desarrollar un test que permita determinar la auto-similaridad de una Space Filling Curve (SFC), estudiandolas desde el punto de vista de la teoria fractal y concentrandonos en la propiedad de auto-similaridad. El test consiste de dos fases, en la primera se identifica una particion especial de la curva denominada particion CM y luego se muestra que la curva es auto-similar si y solo si es auto-similar bajo dicha particion. Adicionalmente, el test es aplicado a cuatro famosas SFC (Peano, Moore, Meander y Lebesgue) para determinar su auto-similaridad. Se encuentra que algunas SFC como la de Moore con estructura recursiva y aparente auto-similaridad son en realidad no auto-similares, resaltando la necesidad de formalizar el concepto. EnglishWe define exact self-similarity of Space Filling Curves on the plane. For that purpose, we adapt the general definition of exact self-similarity on sets, a typical property of fractals, to the specific characteristics of discrete approximations of Space Filling Curves. We also develop an algorithm to test exact selfsimilarity of discrete approximations of Space Filling Curves on the plane. In addition, we use our algorithm to determine exact self-similarity of discrete approximations of four of the most representative Space Filling Curves. We found that SFCs like Moore’s based on recursive structure are actually not selfsimilar, highlighting the need to establish a formal definition of the concept for SFCs.

We define exact self-similarity of Space Filling Curves on the plane. For that purpose, we adapt the general definition of exact self-similarity on sets, a typical property of fractals, to the specific characteristics of discrete approximations of Space Filling Curves. We also develop an algorithm to test exact selfsimilarity of discrete approximations of Space Filling Curves on the plane. In addition, we use our algorithm to determine exact self-similarity of discrete approximations of four of the most representative Space Filling Curves. We found that SFCs like Moore’s based on recursive structure are actually not selfsimilar, highlighting the need to establish a formal definition of the concept for SFCs.

En este articulo se hace una introduccion a diferentes conceptos y metodologias utilizadas en la construccion de sistemas de vision artificial para el reconocimiento de patrones; asi mismo, se describen los resultados obtenidos durante el estudio y desarrollo de un sistema de vision artificial para el conteo de personas que se mueven dentro de un espacio cerrado. El objetivo de este tipo de sistemas es el de obtener informacion de interes, que se pueda interpretar, a partir de un complejo procesamiento de imagenes obtenidas por medio de dispositivos opticos. En este proceso se deben tener en cuenta varios aspectos: el metodo para obtener las imagenes, las diferentes tecnicas de procesamiento de las mismas y la manera en que se va a interpretar la informacion obtenida a traves de esos procesos de manipulacion. Cualquiera sea el objeto que se desea identificar, la precision de las aplicaciones y la calidad de los resultados dependeran: del nivel de conocimiento que se tenga acerca del objeto de estudio, la resolucion de los dispositivos con los que se obtienen la imagenes y la capacidad de procesamiento de los equipo en que se ejecutan las aplicaciones; sin embargo, estos dos ultimos aspectos pueden ser menos importantes si se logra identificar aquellas caracteristicas de los objetos que permiten basar el algoritmo de vision artificial sobre abstracciones de los objetos, en lugar de realizar una comparacion exhaustiva de los reales.

This article introduces different subjects and methodologies used for building pattern recognition artificial vision systems and expose the results found during the study and development of a people counting artificial vision system for indoors. Getting valuable information through a complex image processing is the goal of this kind of software systems. In this process it must be take in account several factors: the method for getting the images, the way to manipulate them and the way to interpret information about those manipulations. Whichever object you follow, the applications accuracy and the quality of the results depend on: the knowledge level about studied object, the devices' resolution and the processing capabilities of the computer that executes the applications, however, these tvvo last points could be less important if it is possible to identify object's features that allow to support the artificial vision algorithm on object's abstractions instead of making and exhaustive comparisons on the real object.

Contenido: Etica y desarrollo economico – Ley 222 de 1995. Reforma al codigo de Comercio – El IVA en los negocios internacionales – Aprendizaje automatico por clasificacion – Algoritmos Geneticos – Ingenieria Reversa – Modelo basico para el mejoramiento de la calidad de vida del viejo recluso, durante su permanencia en la Carcel de Distrito de Cali – Villahermosa – La ultima leccion – Orador Invitado -- Resena bibliograficas.

This article presents a novel clustering algorithm, based upon topology concepts and Q-analysis. The algorithm allows to create a structural clustering, which does not depend on the knowledge of similarity measures, distances, etc. The clustering is directed in a natural fashion by the internal topology of the network/graph. Such topology becomes evident by applying Q-analysis, by means of the structure vector, which shows the network's internal Q-connectivity.

Contenido: una aproximacion categorial a la modelizacion conceptual de conocimiento -- Revolcon laboral, facultad presidencial limitada por el revolcon legislativo -- La tasa critica de financiacion -en la evaluacion economica de proyectos de inversion -- La calidad total en la Universidad -- El regimen economico en la constitucion de 1991 -- La ultima leccion -- resenas bibliograficas.

El cuello de botella en el desarrollo de sistemas expertos es la extraccion o educacion del conocimiento heuristico del experto por parte del ingeniero del conocimiento. Uno de los aspectos mas dlficiles de las tareas del ingeniero del conocimiento es ayudar al experto a estructurar el dominio del conocimiento, a Identificar y formalizar los conceptos del dominio. Los expertos tienen tendencia a establecer sus conclusiones y el razonamiento que usan, en terminos generales que son demasiado amplios para obtener un analisis efectivo para la maquina. El que hace rapidamente juicios complejos sin reexaminar y reestablecer laboriosamente cada paso en su razonamiento.

Security consoles are among the most widely deployed tools for information security management in today's organizations. This article summarizes the work of our research team, in order to incorporate several enhancements to the OSSIM information security console. Such enhancements include integration with physical security control devices, automatic creation of correlation directives for OSSIM's correlation engine, and a significant improvement in information capture reliability on high-traffic networks.

Polygonal meshes, which approxi­mate the surface of an object, are the most common method for repre­senting three dimensional objects. Here, in order to attain efficiency, the triangle is the most used polygon. However, the number of required triangles increases as more realism is needed in a complex form. For this reason, mesh optimization techniques have been created that keep resolu­tion and enhances performance. This way, the polygonal mesh occupies less memory space. This paper presents a mesh compression technique which is based on mathematical topology and the simplicial representation. This technique was developed in order to compress meshes that were going to be sent through Internet.

Security management consoles are today among the most widely deployed tools for information security management in the enterprise. This article summarizes the work done by our research group, in order to implement a series of improvements to the OSSIM security console, aiming to fulfill the Colombian market needs. The improvements include an interface with physical security devices, the creation of a software module for automatic creation of correlation rules, and a significant enhancement of information capture reliability in highly congested networks.

Polygonal meshes, which approximate the surface of an object, are the most common method for representing three dimensional objects. Here, in order to attain efficiency, the triangle is the most used polygon. However, the number of required triangles increases as more realism is needed in a complex form. For this reason, mesh optimization techniques have been created that keep resolution and enhances performance. This way, the polygonal mesh occupies less memory space. This paper presents a mesh compression technique which is based on mathematical topology and the simplicial representation. This technique was developed in order to compress meshes that were going to be sent through Internet.

This article describes a genetic algorithm and its implementation that it allows the alignment of multiple sequences of amino acids by means of relocations that simulate the gaps insertion (holes) and actions of recombination to obtain higher scores in the alignment. Such scores are obtained by means of the method of the sum of even, in which there are considered all the possible combinations of amino acids in each column of the alignment and they are qualified being based on the punctuations of the matrix BLOSUM62.