Estudo epidemiologico do complexo teníase-cisticercose: nova abordagem

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

Short-term expansion planning of radial electrical distribution systems using mixed-integer linear programming

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

Development of neurofuzzy architecture for solving the N-Queens problem

Neural networks are dynamic systems consisting of highly interconnected and parallel nonlinear processing elements that are shown to be extremely effective in computation. This paper presents an architecture of recurrent neural networks for solving the N-Queens problem. More specifically, a modified Hopfield network is developed and its internal parameters are explicitly computed using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points, which represent a solution of the considered problem. The network is shown to be completely stable and globally convergent to the solutions of the N-Queens problem. A fuzzy logic controller is also incorporated in the network to minimize convergence time. Simulation results are presented to validate the proposed approach.

A matheuristic for the selection of beam directions and dose distribution in radiotherapy planning

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

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks

The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by Generic Framing Procedure (GFP) and Virtual Concatenation (VC). The core of the network tends to be a meshed architecture equipped with Multi-Service Switches (MSSs). In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy loadbalancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

Virtual Topology Reconfiguration of Wavelength-routed Optical WDM Networks

The bandwidth requirements of the Internet are increasing every day and there are newer and more bandwidth-thirsty applications emerging on the horizon. Wavelength division multiplexing (WDM) is the next step towards leveraging the capabilities of the optical fiber, especially for wide-area backbone networks. The ability to switch a signal at intermediate nodes in a WDM network based on their wavelengths is known as wavelength-routing. One of the greatest advantages of using wavelength-routing WDM is the ability to create a virtual topology different from the physical topology of the underlying network. This virtual topology can be reconfigured when necessary, to improve performance. We discuss the previous work done on virtual topology design and also discuss and propose different reconfiguration algorithms applicable under different scenarios.

An Analytical Model for Virtual Topology Reconfiguration in Optical Networks and A Case Study

An analytical model for Virtual Topology Reconfiguration (VTR) in optical networks is developed. It aims at the optical networks with a circuit-based data plane and an IPlike control plane. By identifying and analyzing the important factors impacting the network performance due to VTR operations on both planes, we can compare the benefits and penalties of different VTR algorithms and policies. The best VTR scenario can be adaptively chosen from a set of such algorithms and policies according to the real-time network situations. For this purpose, a cost model integrating all these factors is created to provide a comparison criterion independent of any specific VTR algorithm and policy. A case study based on simulation experiments is conducted to illustrate the application of our models.

Efficient Placement of Fault Indicators in an Actual Distribution System Using Evolutionary Computing

This paper proposes an evolutionary computing strategy to solve the problem of fault indicator (FI) placement in primary distribution feeders. More specifically, a genetic algorithm (GA) is employed to search for an efficient configuration of FIs, located at the best positions on the main feeder of a real-life distribution system. Thus, the problem is modeled as one of optimization, aimed at improving the distribution reliability indices, while, at the same time, finding the least expensive solution. Based on actual data, the results confirm the efficiency of the GA approach to the FI placement problem.

Distribution and molecular characterization of hepatitis C virus (HCV) genotypes in patients with chronic infection from Pernambuco State, Brazil

Hepatitis C virus (HCV) is a public health problem throughout the world and 3% of the world population is infected with this virus. It is estimated that 3-4 millions individuals are being infected every year. It has been estimated that around 1.5% of Brazilian population is anti-HCV positive and the Northeast region showed the highest prevalence in Brazil. The aim of this study was to characterize HCV genotypes circulating in Pernambuco State (PE), Brazil, located in the Northeast region of the country. This study included 85 anti-HCV positive patients followed up between 2004 and 2011. For genotyping, a 380bp fragment of HCV RNA in the NS5B region was amplified by nested PCR. Phylogenetic analysis was conducted using Bayesian Markov chain Monte Carlo simulation (MCMC) using BEAST v.1.5.3. From 85 samples, 63 (74.1%) positive to NS5B fragment were successfully sequenced. Subtype 1b was the most prevalent in this population (42-66.7%), followed by 3a (16-25.4%), 1a (4-6.3%) and 2b (1-1.6%). Twelve (63.1%) and seven (36.9%) patients with HCV and schistosomiasis were infected with subtypes 1b and 3a, respectively. Brazil is a large country with many different population backgrounds; a large variation in the frequencies of HCV genotypes is predictable throughout its territory. This study reports HCV genotypes from Pernambuco State where subtype 1b was found to be the most prevalent. Phylogenetic analysis suggests the presence of the different HCV strains circulating within this population. (C) 2012 Elsevier B.V. All rights reserved.

Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution

The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e. g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.

Architectures, stability and optimization for clock distribution networks

Synchronous telecommunication networks, distributed control systems and integrated circuits have its accuracy of operation dependent on the existence of a reliable time basis signal extracted from the line data stream and acquirable to each node. In this sense, the existence of a sub-network (inside the main network) dedicated to the distribution of the clock signals is crucially important. There are different solutions for the architecture of the time distribution sub-network and choosing one of them depends on cost, precision, reliability and operational security. In this work we expose: (i) the possible time distribution networks and their usual topologies and arrangements. (ii) How parameters of the network nodes can affect the reachability and stability of the synchronous state of a network. (iii) Optimizations methods for synchronous networks which can provide low cost architectures with operational precision, reliability and security. (C) 2011 Elsevier B. V. All rights reserved.

Mistletoes Play Different Roles in a Modular Host-Parasite Network

Antagonistic interactions between host plants and mistletoes often form complex networks of interacting species. Adequate characterization of network organization requires a combination of qualitative and quantitative data. Therefore, we assessed the distribution of interactions between mistletoes and hosts in the Brazilian Pantanal and characterized the network structure in relation to nestedness and modularity. Interactions were highly asymmetric, with mistletoes presenting low host specificity (i.e., weak dependence) and with hosts being highly susceptible to mistletoe-specific infections. We found a non-nested and modular pattern of interactions, wherein each mistletoe species interacted with a particular set of host species. Psittacanthus spp. infected more species and individuals and also caused a high number of infections per individual, whereas the other mistletoes showed a more specialized pattern of infection. For this reason, Psittacanthus spp. were regarded as module hubs while the other mistletoe species showed a peripheral role. We hypothesize that this pattern is primarily the result of different seed dispersal systems. Although all mistletoe species in our study are bird dispersed, the frugivorous assemblage of Psittacanthus spp. is composed of a larger suite of birds, whereas Phoradendron are mainly dispersed by Euphonia species. The larger assemblage of bird species dispersing Psittacanthus seeds may also increase the number of hosts colonized and, consequently, its dominance in the study area. Nevertheless, other restrictions on the interactions among species, such as the differential capacity of mistletoe infections, defense strategies of hosts and habitat types, can also generate or enhance the observed pattern.

Cation Distribution and Local Order in Mixed Sodium Metaphosphate Glasses

Two structural properties in mixed alkali metal phosphate glasses that seem to be crucial to the development of the mixed ion effect in dc conductivity were systematically analyzed in Na mixed metaphosphates: the local order around the mobile species, and their distribution and mixing in the glass network. The set of glasses considered here, Na1-xMxPO3 with M = Li, Ag, K, Rb, and Cs and 0 <= x <= 1, encompass a broad degree of size mismatch between the mixed cation species. A comprehensive solid-state nuclear magnetic resonance study was carried out using P-31 MAS, Na-23 triple quantum MAS, Rb-87 QCPMG, P-31-Na-23 REDOR, Na-23-Li-7 and Li-7-Li-6 SEDOR, and Na-23 spin echo decay. It was observed that the arrangement of P atoms around Na in the mixed glasses was indistinguishable from that observed in the NaPO3 glass. However, systematic distortions in the local structure of the 0 environments around Na were observed, related to the presence of the second cation. The average Na-O distances show an expansion/compression When Na+ ions are replaced by cations with respectively smaller/bigger radii. The behavior of the nuclear electric quadrupole coupling. constants indicates that this expansion reduces the local symmetry, while the compression produces the opposite effect These effects become marginally small when the site mismatch between the cations is small, as in Na-Ag mixed glasses. The present study confirms the intimate mixing of cation species at the atomic scale, but clear deviations from random mixing were detected in systems with larger alkali metal ions (Cs-Na, K-Na, Rb-Na). In contrast, no deviations from the statistical ion mixture were found in the systems Ag-Na and Li-Na, where mixed cations are either of radii comparable to (Ag+) or smaller than (Li+) Na+. The set of results supports two fundamental structural features of the models proposed to explain the mixed ion effect: the. structural specificity of the sites occupied by each cation species and their mixing at the atomic scale.