A path- and label-cost propagation approach to speedup the training of the optimum-path forest classifier

In general, pattern recognition techniques require a high computational burden for learning the discriminating functions that are responsible to separate samples from distinct classes. As such, there are several studies that make effort to employ machine learning algorithms in the context of big data classification problems. The research on this area ranges from Graphics Processing Units-based implementations to mathematical optimizations, being the main drawback of the former approaches to be dependent on the graphic video card. Here, we propose an architecture-independent optimization approach for the optimum-path forest (OPF) classifier, that is designed using a theoretical formulation that relates the minimum spanning tree with the minimum spanning forest generated by the OPF over the training dataset. The experiments have shown that the approach proposed can be faster than the traditional one in five public datasets, being also as accurate as the original OPF. (C) 2014 Elsevier B. V. All rights reserved.

Image Re-Ranking Acceleration on GPUs

Huge image collections are becoming available lately. In this scenario, the use of Content-Based Image Retrieval (CBIR) systems has emerged as a promising approach to support image searches. The objective of CBIR systems is to retrieve the most similar images in a collection, given a query image, by taking into account image visual properties such as texture, color, and shape. In these systems, the effectiveness of the retrieval process depends heavily on the accuracy of ranking approaches. Recently, re-ranking approaches have been proposed to improve the effectiveness of CBIR systems by taking into account the relationships among images. The re-ranking approaches consider the relationships among all images in a given dataset. These approaches typically demands a huge amount of computational power, which hampers its use in practical situations. On the other hand, these methods can be massively parallelized. In this paper, we propose to speedup the computation of the RL-Sim algorithm, a recently proposed image re-ranking approach, by using the computational power of Graphics Processing Units (GPU). GPUs are emerging as relatively inexpensive parallel processors that are becoming available on a wide range of computer systems. We address the image re-ranking performance challenges by proposing a parallel solution designed to fit the computational model of GPUs. We conducted an experimental evaluation considering different implementations and devices. Experimental results demonstrate that significant performance gains can be obtained. Our approach achieves speedups of 7x from serial implementation considering the overall algorithm and up to 36x on its core steps.

Atividades exploratório-investigativas em sala de aula de cálculo I com uso de tecnologia

This study presents the results from a qualitative resource, based on research-action methodology, which examined the innovate teaching practices implementations in the Calculus I during 2011 year. The analysis of collected data from three used sources – an initial questionnaire, an exploratory-investigative classroom, and an interview with some students at the end of the second semester – reveals that the students had appropriated of the technological recourses, using it as a tool to look for the knowledge. The investigative activities with the use of information technologies made the use of multiple representations in solving mathematical tasks, making the transition of numerical, algebraic and geometrical results possible for the students when they have looking for validation of their hypotheses and conjectures during mathematical problems solving. This works helped in the insertion of new practices in the discipline, and their results validate the proposal presented by the teacher, which is the discipline of Calculus use, whose character is strongly linked to the training content of the student, as a discipline whose can contributed to the pedagogical formation of the graduation student, leading him to know the Mathematical Education possibilities, specially the Mathematical Investigation - Solving Problems, in the outlook of dialogued classes where the teacher assumes the facilitator role and where the students become actives in their pursuit of knowledge

Explorando abordagens de aprendizado sequencial para floresta de caminhos ótimos

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

On soft limits of large-scale structure correlation functions

We study soft limits of correlation functions for the density and velocity fields in the theory of structure formation. First, we re-derive the (resummed) consistency conditions at unequal times using the eikonal approximation. These are solely based on symmetry arguments and are therefore universal. Then, we explore the existence of equal-time relations in the soft limit which, on the other hand, depend on the interplay between soft and hard modes. We scrutinize two approaches in the literature: the time-flow formalism, and a background method where the soft mode is absorbed into a locally curved cosmology. The latter has been recently used to set up (angular averaged) 'equal-time consistency relations'. We explicitly demonstrate that the time-flow relations and 'equal-time consistency conditions'are only fulfilled at the linear level, and fail at next-to-leading order for an Einstein de-Sitter universe. While applied to the velocities both proposals break down beyond leading order, we find that the 'equal-time consistency conditions'quantitatively approximates the perturbative results for the density contrast. Thus, we generalize the background method to properly incorporate the effect of curvature in the density and velocity fluctuations on short scales, and discuss the reasons behind this discrepancy. We conclude with a few comments on practical implementations and future directions.

The benefits of soft sensor and multi-rate control for the implementation of wireless networked control systems

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

Environmental Innovation: in search of a meaning

The purpose of this paper is to propose a definition of the term “green/environmental innovation”, based on a systematic literature review. Design/methodology/approach– The literature review conducted in this research was based on papers published in ISI Web of Science and Scopus databases. Findings– Environmental innovations are organizational implementations and changes focusing on the environment, with implications for companies’ products, manufacturing processes and marketing, with different degrees of novelty. They can be merely incremental improvements that intensify the performance of something that already exists, or radical ones that promote something completely unprecedented, where the main objective is to reduce the company's environmental impacts. In addition, environmental innovation has a bilateral relationship with the level of proactive environmental management adopted by companies. Increasing of environmental innovation tends to come up against many barriers.

Análise energética e ambiência de modelos arquitetônicos propostos pelo programa nacional de habitação rural

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relação entre a resposta espectral da vegetação em diferentes cultivos e níveis freáticos em área de recarga do Sistema Aquífero Guarani

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

Optical Components for WDM Lightwave Networks

Recently, there has been growing interest in developing optical fiber networks to support the increasing bandwidth demands of multimedia applications, such as video conferencing and World Wide Web browsing. One technique for accessing the huge bandwidth available in an optical fiber is wavelength-division multiplexing (WDM). Under WDM, the optical fiber bandwidth is divided into a number of nonoverlapping wavelength bands, each of which may be accessed at peak electronic rates by an end user. By utilizing WDM in optical networks, we can achieve link capacities on the order of 50 THz. The success of WDM networks depends heavily on the available optical device technology. This paper is intended as a tutorial on some of the optical device issues in WDM networks. It discusses the basic principles of optical transmission in fiber and reviews the current state of the art in optical device technology. It introduces some of the basic components in WDM networks, discusses various implementations of these components, and provides insights into their capabilities and limitations. Then, this paper demonstrates how various optical components can be incorporated into WDM optical networks for both local and wide-area applications. Last, the paper provides a brief review of experimental WDM networks that have been implemented.

Can homework become more meaningful with the inclusion of oral presentations?

In this action research study of my 7th grade math class, I investigated the inclusion of homework presentations to see if they would improve students’ attitude toward mathematics, participation, and understanding. I discovered that although the implementations of presentations into our homework routine did not drastically influence grades, or even improve attitudes (according to test grades and student surveys), a multitude of other changes surfaced. These changes consisted of an increase in discussion, a team effort among students in my class, and an overall “learning community” effect. I plan to continue to pursue presentations as a major part of my homework routine, and also incorporate presentations into review sessions.

Topology Verification for Isosurface Extraction

The broad goals of verifiable visualization rely on correct algorithmic implementations. We extend a framework for verification of isosurfacing implementations to check topological properties. Specifically, we use stratified Morse theory and digital topology to design algorithms which verify topological invariants. Our extended framework reveals unexpected behavior and coding mistakes in popular publicly available isosurface codes.

On the quantumness of correlations in nuclear magnetic resonance

Nuclear magnetic resonance (NMR) was successfully employed to test several protocols and ideas in quantum information science. In most of these implementations, the existence of entanglement was ruled out. This fact introduced concerns and questions about the quantum nature of such bench tests. In this paper, we address some issues related to the non-classical aspects of NMR systems. We discuss some experiments where the quantum aspects of this system are supported by quantum correlations of separable states. Such quantumness, beyond the entanglement-separability paradigm, is revealed via a departure between the quantum and the classical versions of information theory. In this scenario, the concept of quantum discord seems to play an important role. We also present an experimental implementation of an analogue of the single-photon Mach-Zehnder interferometer employing two nuclear spins to encode the interferometric paths. This experiment illustrates how non-classical correlations of separable states may be used to simulate quantum dynamics. The results obtained are completely equivalent to the optical scenario, where entanglement (between two field modes) may be present.

Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis

A deep theoretical analysis of the graph cut image segmentation framework presented in this paper simultaneously translates into important contributions in several directions. The most important practical contribution of this work is a full theoretical description, and implementation, of a novel powerful segmentation algorithm, GC(max). The output of GC(max) coincides with a version of a segmentation algorithm known as Iterative Relative Fuzzy Connectedness, IRFC. However, GC(max) is considerably faster than the classic IRFC algorithm, which we prove theoretically and show experimentally. Specifically, we prove that, in the worst case scenario, the GC(max) algorithm runs in linear time with respect to the variable M=|C|+|Z|, where |C| is the image scene size and |Z| is the size of the allowable range, Z, of the associated weight/affinity function. For most implementations, Z is identical to the set of allowable image intensity values, and its size can be treated as small with respect to |C|, meaning that O(M)=O(|C|). In such a situation, GC(max) runs in linear time with respect to the image size |C|. We show that the output of GC(max) constitutes a solution of a graph cut energy minimization problem, in which the energy is defined as the a"" (a) norm ayenF (P) ayen(a) of the map F (P) that associates, with every element e from the boundary of an object P, its weight w(e). This formulation brings IRFC algorithms to the realm of the graph cut energy minimizers, with energy functions ayenF (P) ayen (q) for qa[1,a]. Of these, the best known minimization problem is for the energy ayenF (P) ayen(1), which is solved by the classic min-cut/max-flow algorithm, referred to often as the Graph Cut algorithm. We notice that a minimization problem for ayenF (P) ayen (q) , qa[1,a), is identical to that for ayenF (P) ayen(1), when the original weight function w is replaced by w (q) . Thus, any algorithm GC(sum) solving the ayenF (P) ayen(1) minimization problem, solves also one for ayenF (P) ayen (q) with qa[1,a), so just two algorithms, GC(sum) and GC(max), are enough to solve all ayenF (P) ayen (q) -minimization problems. We also show that, for any fixed weight assignment, the solutions of the ayenF (P) ayen (q) -minimization problems converge to a solution of the ayenF (P) ayen(a)-minimization problem (ayenF (P) ayen(a)=lim (q -> a)ayenF (P) ayen (q) is not enough to deduce that). An experimental comparison of the performance of GC(max) and GC(sum) algorithms is included. This concentrates on comparing the actual (as opposed to provable worst scenario) algorithms' running time, as well as the influence of the choice of the seeds on the output.

A novel strategy for building interoperable MPI environment in heterogeneous high performance systems

Breakthrough advances in microprocessor technology and efficient power management have altered the course of development of processors with the emergence of multi-core processor technology, in order to bring higher level of processing. The utilization of many-core technology has boosted computing power provided by cluster of workstations or SMPs, providing large computational power at an affordable cost using solely commodity components. Different implementations of message-passing libraries and system softwares (including Operating Systems) are installed in such cluster and multi-cluster computing systems. In order to guarantee correct execution of message-passing parallel applications in a computing environment other than that originally the parallel application was developed, review of the application code is needed. In this paper, a hybrid communication interfacing strategy is proposed, to execute a parallel application in a group of computing nodes belonging to different clusters or multi-clusters (computing systems may be running different operating systems and MPI implementations), interconnected with public or private IP addresses, and responding interchangeably to user execution requests. Experimental results demonstrate the feasibility of this proposed strategy and its effectiveness, through the execution of benchmarking parallel applications.