Design of a reconfigurable pseudorandom number generator for use in intelligent systems

This paper deals with the design of a network-on-chip reconfigurable pseudorandom number generation unit that can map and execute meta-heuristic algorithms in hardware. The unit can be configured to implement one of the following five linear generator algorithms: a multiplicative congruential, a mixed congruential, a standard multiple recursive, a mixed multiple recursive, and a multiply-with-carry. The generation unit can be used both as a pseudorandom and a message passing-based server, which is able to produce pseudorandom numbers on demand, sending them to the network-on-chip blocks that originate the service request. The generator architecture has been mapped to a field programmable gate array, and showed that millions of numbers in 32-, 64-, 96-, or 128-bit formats can be produced in tens of milliseconds. (C) 2011 Elsevier B.V. All rights reserved.

Vectorized algorithms for quadtree construction and descent

This paper presents vectorized methods of construction and descent of quadtrees that can be easily adapted to message passing parallel computing. A time complexity analysis for the present approach is also discussed. The proposed method of tree construction requires a hash table to index nodes of a linear quadtree in the breadth-first order. The hash is performed in two steps: an internal hash to index child nodes and an external hash to index nodes in the same level (depth). The quadtree descent is performed by considering each level as a vector segment of a linear quadtree, so that nodes of the same level can be processed concurrently. © 2012 Springer-Verlag.

Alocação de canais em sistemas de comunicação celular empregando algoritmo genético distribuído

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

Algoritmos busca tabu paralelos aplicados ao planejamento da expansão da transmissão de energia elétrica

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

Using Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment Algorithms

Sao Paulo State Research Foundation-FAPESP

A graphical tool for the tomographic characterisation of microstructural features on metal matrix composites

Research on the micro-structural characterization of metal-matrix composites uses X-ray computed tomography to collect information about the interior features of the samples, in order to elucidate their exhibited properties. The tomographic raw data needs several steps of computational processing in order to eliminate noise and interference. Our experience with a program (Tritom) that handles these questions has shown that in some cases the processing steps take a very long time and that it is not easy for a Materials Science specialist to interact with Tritom in order to define the most adequate parameter values and the proper sequence of the available processing steps. For easing the use of Tritom, a system was built which addresses the aspects described before and that is based on the OpenDX visualization system. OpenDX visualization facilities constitute a great benefit to Tritom. The visual programming environment of OpenDX allows an easy definition of a sequence of processing steps thus fulfilling the requirement of an easy use by non-specialists on Computer Science. Also the possibility of incorporating external modules in a visual OpenDX program allows the researchers to tackle the aspect of reducing the long execution time of some processing steps. The longer processing steps of Tritom have been parallelized in two different types of hardware architectures (message-passing and shared-memory); the corresponding parallel programs can be easily incorporated in a sequence of processing steps defined in an OpenDX program. The benefits of our system are illustrated through an example where the tool is applied in the study of the sensitivity to crushing – and the implications thereof – of the reinforcements used in a functionally graded syntactic metallic foam.

GRAPHICAL REPRESENTATIONS of MESSAGE EXCHANGES INTO WEB SERVICE-BASED APPLICATIONS

Web service-based application is an architectural style, where a collection of Web services communicate to each other to execute processes. With the popularity increase of Web service-based applications and since messages exchanged inside of this applications can be complex, we need tools to simplify the understanding of interrelationship among Web services. This work present a description of a graphical representation of Web service-based applications and the mechanisms inserted among Web service requesters and providers to catch information to represent an application. The major contribution of this paper is to discus and use HTTP and SOAP information to show a graphical representation similar to a UML sequence diagram of Web service-based applications.

Prediction of R plus R-2 gravity for the deflection of a photon passing close to the Sun

The cross-section for the scattering of a photon by the Sun's gravitational field, treated as an external field, is computed in the framework of R + R-2 gravity. Using this result, we found that for a photon just grazing the Sun's surface the deflection is 1.75 which is exactly the same as that given by Einstein's theory. An explanation for this pseudo-paradox is provided.

(m,k)-Gur game: Exploiting message discards in order to increase the lifetime and spatial diversity in autonomic wireless sensor networks

The main concern in Wireless Sensor Networks (WSN) algorithms and protocols are the energy consumption. Thus, the WSN lifetime is one of the most important metric used to measure the performance of the WSN approaches. Another important metric is the WSN spatial coverage, where the main goal is to obtain sensed data in a uniform way. This paper has proposed an approach called (m,k)-Gur Game that aims a trade-off between quality of service and the increasement of spatial coverage diversity. Simulation results have shown the effectiveness of this approach. © 2012 IEEE.

MODEL-BASED COMPENSATION FOR BURST MESSAGE LOSS IN WIRELESS NETWORKED CONTROL SYSTEMS: EXPERIMENTAL RESULTS

A recent trend in networked control systems (NCSs) is the use of wireless networks enabling interoperability between existing wired and wireless systems. One of the major challenges in these wireless NCSs (WNCSs) is to overcome the impact of the message loss that degrades the performance and stability of these systems. Moreover, this impact is greater when dealing with burst or successive message losses. This paper discusses and presents the experimental results of a compensation strategy to deal with this burst message loss problem in which a NCS mathematical model runs in parallel with the physical process, providing sensor virtual data in case of packet losses. Running in real-time inside the controller, the mathematical model is updated online with real control signals sent to the actuator, which provides better reliability for the estimated sensor feedback (virtual data) transmitted to the controller each time a message loss occurs. In order to verify the advantages of applying this model-based compensation strategy for burst message losses in WNCSs, the control performance of a motor control system using CAN and ZigBee networks is analyzed. Experimental results led to the conclusion that the developed compensation strategy provided robustness and could maintain the control performance of the WNCS against different message loss scenarios.

Dynamics of Space Particles and Spacecrafts Passing by the Atmosphere of the Earth

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

Effects of railway track vibration induced by passing trains on an energy harvesting device

Pós-graduação em Engenharia Mecânica - FEIS