Mistletoes Play Different Roles in a Modular Host-Parasite Network

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

Analysis of a hyper-diverse seed dispersal network: modularity and underlying mechanisms

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

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

Visual and acoustic communication in the Brazilian torrent frog, Hylodes asper (Anura : Leptodactylidae)

We studied the signaling, territorial, and courtship behaviors of the diurnal frog Hylodes asper. Visual and acoustic communication were used during intraspecific interactions involving males, females. and subadults. Hylodes aspcr has a complex visual communication system, of which foot-flagging is the most distinctive display observed in the repertoire of visual signals. The splash zone produced by the waterfalls and torrents creates a high, nearly constant, humidity near the streams, reducing the risk of desiccation which enables the diurnal activity of H. asper. Although the ambient sound pressure levels (SPL), measured at the calling sites, are similar to the SPL of the advertisement calls, the high-pitched calls of H, asper, are spectrally different from the noise produced by the water current. Thus. The ambient noise produced by the water current may not interfere significantly with the acoustic communication of this species. The noise and the nearly constant and high humidity produced by the torrents and waterfalls, along with the availability of Light, probably favored the evolution of contrasting colors and visual communication in H. asper: Males of H, aspcr excavate underwater chambers that are probably used to shelter the eggs and to prevent the clutch from being drifted downstream.

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

A social network approach to trust management in VANETs

In the past few years, vehicular ad hoc networks(VANETs) was studied extensively by researchers. VANETs is a type of P2P network, though it has some distinct characters (fast moving, short lived connection etc.). In this paper, we present several limitations of current trust management schemes in VANETs and propose ways to counter them. We first review several trust management techniques in VANETs and argue that the ephemeral nature of VANETs render them useless in practical situations. We identify that the problem of information cascading and oversampling, which commonly arise in social networks, also adversely affects trust management schemes in VANETs. To the best of our knowledge, we are the first to introduce information cascading and oversampling to VANETs. We show that simple voting for decision making leads to oversampling and gives incorrect results in VANETs. To overcome this problem, we propose a novel voting scheme. In our scheme, each vehicle has different voting weight according to its distance from the event. The vehicle which is more closer to the event possesses higher weight. Simulations show that our proposed algorithm performs better than simple voting, increasing the correctness of voting. © 2012 Springer Science + Business Media, LLC.

QK-Means: A clustering technique based on community detection and K-Means for deployment of cluster head nodes

Wireless Sensor Networks (WSN) are a special kind of ad-hoc networks that is usually deployed in a monitoring field in order to detect some physical phenomenon. Due to the low dependability of individual nodes, small radio coverage and large areas to be monitored, the organization of nodes in small clusters is generally used. Moreover, a large number of WSN nodes is usually deployed in the monitoring area to increase WSN dependability. Therefore, the best cluster head positioning is a desirable characteristic in a WSN. In this paper, we propose a hybrid clustering algorithm based on community detection in complex networks and traditional K-means clustering technique: the QK-Means algorithm. Simulation results show that QK-Means detect communities and sub-communities thus lost message rate is decreased and WSN coverage is increased. © 2012 IEEE.

Detecção de eventos de segurança de redes por intermédio de técnicas estatísticas e associativas aplicadas a fluxos de dados

Pós-graduação em Ciência da Computação - IBILCE

Redução de harmônicos de corrente em retificadores de múltiplos pulsos: generalização das conexões diferenciais

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

Sistema embarcado para suporte ao diagnóstico de microcalcificações em mamografias digitais

Pós-graduação em Engenharia Elétrica - FEIS

Resposta imune induzida pelas peçonhas do bagre Cathorops agassizii

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

Propriedades magnéticas de nanoestruturas de metais de transição 3d em superfícies de Pd

Motivados por estudos experimentais acerca de monocamadas de metais de transição 3d sobre superfícies de Pd, nesta dissertação investigamos o complexo magnetismo de nanoestruturas, embebidas ou adsorvidas, em superfícies metálicas através de cálculos de primeiros princípios. Utilizamos o método RS-LMTO-ASA (Real Space - Linear MuffinTin Orbital - Atomic Sphere Approximation), o qual é baseado na teoria do funcional da densidade (DFT - Density Functional Theory) e implementado para o cálculo de estruturas magnéticas não colineares. Com este propósito, investigamos nanoestruturas embebidas e ligas (2 x 2) de metais 3d (Cr, Mn, Fe, Co e Ni) na superfície Pd (110), além de nanoestruturas de Cr adsorvidas sobre a superfície de Pd (111). Primeiro, para as nanoestruturas embebidas na superfície Pd (110), analisamos a variação do momento magnético de spin orbital com relação ao número de vizinhos e de valência dos metais 3d. Também mostramos que estas estruturas têm ordenamento magnético colinear, exceto as de Cr e Mn, que apresentam magnetismo não colinear associado à frustração geométrica. Para o caso de nanofios de Cr adsorvidos sobre a superfície de Pd (111), verificamos uma configuração colinear antiferromagnética para cadeias com até 9 átomos. Para o nanofio com 10 átomos obtivemos uma configuração tipo antiferromagnética inclinada (canted). No caso de nanoestruturas de Cr bidimensionais, verificamos complexas configurações magnéticas não colineares com diferentes quiralidades.

Caracterização topológica dos motivos das redes biológicas integradas da Escherichia coli e da Saccharomyces cerevisiae

The reducionism method has helped in the clari cation of functioning of many biological process. However, such process are extremely complex and have emergent properties that can not be explained or even predicted by reducionism methods. To overcome these limits, researchers have been used a set of methods known as systems biology, a new area of biology aiming to understand the interactions between the multiple components of biological processes. These interactions can be represented by a mathematical object called graph or network, where the interacting elements are represented by a vertex and the interactions by edges that connect a pair of vertexes. Into graphs it is possible to nd subgraphs, occurring in complex networks at numbers that are signi cantly higher than those in randomized networks, they are de ned as motifs. As motifs in biological networks may represent the structural units of biological processess, their detection is important. Therefore, the aim of this present work was detect, count and classify motifs present in biological integrated networks of bacteria Escherichia coli and yeast Saccharomyces cere- visiae. For this purpose, we implemented codes in MathematicaR and Python environments for detecting, counting and classifying motifs in these networks. The composition and types of motifs detected in these integrated networks indicate that such networks are organized in three main bridged modules composed by motifs in which edges are all the same type. The connecting bridges are composed by motifs in which the types of edges are diferent

Implementação do algoritmo de Newman para identificação de comunidades em placas gráficas

Communities are present on physical, chemical and biological systems and their identification is fundamental for the comprehension of the behavior of these systems. Recently, available data related to complex networks have grown exponentially, demanding more computational power. The Graphical Processing Unit (GPU) is a cost effective alternative suitable for this purpose. We investigate the convenience of this for network science by proposing a GPU based implementation of Newman community detection algorithm. We showed that the processing time of matrix multiplications of GPUs grow slower than CPUs in relation to the matrix size. It was proven, thus, that GPU processing power is a viable solution for community dentification simulation that demand high computational power. Our implementation was tested on an integrated biological network for the bacterium Escherichia coli

A realidade contemporânea das relações institucionais: desafios e oportunidades para as Relações Públicas

The contemporary organizations establish complex networks of relationships with their audiences. However, it is the socio-historical setting of the organizations that allow that their internal structures, management and culture as well as their interests and goals in relation to the macro social environment to be understood. To understand what is currently proposed as institutional relations, it is necessary to search on that socio-historical source the progress in the studies of management and organizational communication aiming to prove the assumptions underlying this strategic role within organizations. In order to do that, this project raises ethnographic aspects of the institutional relationships to see what is proposed by the organizations and, therefore, highlights the lack of detailed studies in this area. From this survey, it is clear the possible role of public relations in contributing to studies, plans and execution of institutional relations according to the basement in the humanities and communication processes of networks of relationships between organizations