Foliar Spraying of Silicon Associated with Salicylic Acid Increases Silicon Absorption and Peanut Growth

Silicon - Silicon (Si) combined with foliar spraying of salicylic acid (SA) can affect the absorption of this beneficial element. A study with Si non-accumulators plants (soybean and bean) observed...     

Pattern Recognition Theory in Nonlinear Signal Processing

A body of research has developed within the context of nonlinear signal and image processing that deals with the automatic, statistical design of digital window-based filters. Based on pairs of ideal and observed signals, a filter is designed in an effort to minimize the error between the ideal and filtered signals. The goodness of an optimal filter depends on the relation between the ideal and observed signals, but the goodness of a designed filter also depends on the amount of sample data from which it is designed. In order to lessen the design cost, a filter is often chosen from a given class of filters, thereby constraining the optimization and increasing the error of the optimal filter. To a great extent, the problem of filter design concerns striking the correct balance between the degree of constraint and the design cost. From a different perspective and in a different context, the problem of constraint versus sample size has been a major focus of study within the theory of pattern recognition. This paper discusses the design problem for nonlinear signal processing, shows how the issue naturally transitions into pattern recognition, and then provides a review of salient related pattern-recognition theory. In particular, it discusses classification rules, constrained classification, the Vapnik-Chervonenkis theory, and implications of that theory for morphological classifiers and neural networks. The paper closes by discussing some design approaches developed for nonlinear signal processing, and how the nature of these naturally lead to a decomposition of the error of a designed filter into a sum of the following components: the Bayes error of the unconstrained optimal filter, the cost of constraint, the cost of reducing complexity by compressing the original signal distribution, the design cost, and the contribution of prior knowledge to a decrease in the error. The main purpose of the paper is to present fundamental principles of pattern recognition theory within the framework of active research in nonlinear signal processing.     

Multiresolution Design of Aperture Operators

The design of an aperture operator is based on adequately constraining the spatial domain and the graylevel range in order to diminish the space of operators and, consequently, the estimation error. The design of a resolution constrained operator is based on adequately combining information from two or more different resolutions and has the same motivation, that is, diminish the space of operators to facilitate design. This paper joins these approaches and studies multiresolution design of aperture operators for grayscale images. Spatial resolution constraint, range resolution constraint and the combination of both constraints are characterized, and the error increase by using the constrained filter in place of the optimal unconstrained one is analyzed. Pyramidal multiresolution design involves applying the resolution constraint approach hierarchically, from the higher to the lower resolution space. These approaches are also characterized and their error increase analyzed. The system that has been implemented to design pyramidal multiresolution operators is described and has its complexity (memory and runtime) analyzed. Several simulations and two applications for deblurring are shown and compared to optimal linear filters. The results confirm the usefulness of the approach.     

Congestion-aware ant colony based routing algorithms for efficient application execution on Network-on-Chip platform

Networks-on-Chip (NoC) is an interesting option in design of communication infrastructures for embedded systems. It provides a scalable structure and balanced communication between the cores. Parallel applications that take advantage of the NoC architectures, are usually are communication-intensive. Thus, a big deal of data packets is transmitted simultaneously through the network. In order to avoid congestion delays that deteriorate the execution time of the implemented applications, an efficient routing strategy must be thought of carefully. In this paper, the ant colony optimization paradigm is explored to find and optimize routes in a mesh-based NoC. The proposed routing algorithms are simple yet efficient. The routing optimization is driven by the minimization of total latency during packets transmission between the tasks that compose the application. The presented performance evaluation is threefold: first, the impact of well-known synthetic traffic patterns is assessed; second, randomly generated applications are mapped into the NoC infrastructure and some synthetic communication traffics, that follow known patterns, are used to simulate real situations; third, sixteen real-world applications of the E3S and one specific application for digital image processing are mapped and their execution time evaluated. In both cases, the obtained results are compared to those obtained with known general purpose algorithms for deadlock free routing. The comparison avers the effectiveness and superiority of the ant colony inspired routing.     

Hierarchical Reliable Multicast: Performance Analysis and Optimal Placement of Proxies

This paper studies the use of multicast together with proxy nodes for reliably disseminating data from a single source to a large number of receivers. In order to achieve reliability, data must be retransmitted in case of loss either by the source or by special network nodes, called proxies. Each proxy is responsible for reliably delivering the data to a subgroup it is assigned. The multicast tree is partitioned into subgroups that form a hierarchy rooted at the source, hence the term hierarchical reliable multicast. The performance of this approach strongly depends on the topology and the loss characteristics of the underlying tree and the location of proxies. In the first part of the paper, we study the processing and bandwidth performance of such a reliable multicast dissemination given the tree and the placement of proxies. In the second part of the paper, we develop dynamic programming algorithms that give a placement of a fixed number of proxies on an arbitrary tree that minimizes the bandwidth used for reliable transfer. The first algorithm provides an optimal solution to the multicast proxies location problem in polynomial time, in the number of nodes and proxies. The second is an approximation algorithm that gives a solution with cost within a chosen precision from the optimal, in an improved running time. An optimal and an approximate solution are also provided for the proxies location problem if unicast is used for transmissions. Applications of this dynamic programming approach to related problems are discussed.     

Managing a hybrid energy smart grid with a renewable energy source

The aim of this work is to develop tools for optimal power flow management control in a micro grid (MG). The latter consists of a wind turbine, energy storage system, two gas turbines (GTs), and the main grid. Unlike the traditional approach, which is limited to the distribution of active power, this paper models an electrical system to coordinate and optimize the flow of both active and reactive power using discrete controls. The proposed optimal power distribution strategy has two objectives. First, it aims at forecasting over a time horizon of 24 hours the optimal distribution of the active and reactive power required for each power source connected to the MG. The proposed management incorporates the forecasts of consumption, weather, and tariffs. Second, it aims at reducing the CO₂ emissions rate by optimizing both the operating point of the two GTs and the usage of the storage unit. The proposed optimization problem for the energy management system is solved using the Bellman algorithm through dynamic programming. Its effectiveness is illustrated with various simulations carried out in the Matlab environment. The supremacy of the proposed management algorithm is highlighted by comparing its performance with conventional (restricted) management.     

Regulator problem for uncertain linear discrete-time systems with constrained control

A necessary and sufficient condition to test the robustness of a regulator of uncertain linear systems with constrained control is given. The candidate regulator for this test is that stabilizing nominal systems. An illustrative example is also given.