831 resultados para Multiport Network Model
Resumo:
In this work we elaborate and discuss a Complex Network model which presents connectivity scale free probability distribution (power-law degree distribution). In order to do that, we modify the rule of the preferential attachment of the Bianconi-Barabasi model, including a factor which represents the similarity of the sites. The term that corresponds to this similarity is called the affinity, and is obtained by the modulus of the difference between the fitness (or quality) of the sites. This variation in the preferential attachment generates very interesting results, by instance the time evolution of the connectivity, which follows a power-law distribution ki / ( t t0 )fi, where fi indicates the rate to the site gain connections. Certainly this depends on the affinity with other sites. Besides, we will show by numerical simulations results for the average path length and for the clustering coefficient
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The paper addresses the issue of apportioning of the cost of transmission losses to generators and demands in a multimarket framework. Line flows are unbundled using equivalent bilateral exchanges on a DC-network model and allocated to generators and demands. Losses are then calculated based on unbundled flows and straightforwardly apportioned to generators and demands. The proposed technique is particularly useful in a multimarket framework, where all markets have a common grid operator with complete knowledge of all network data, as is the case of the Brazilian electric-energy system. The methodology proposed is illustrated using the IEEE Reliability Test System and compared numerically with an alternative technique. Appropriate conclusions are drawn. © The Institution of Engineering and Technology 2006.
Resumo:
The energy efficiency of buildings should be a goal at the pre-design phase, though the importance of the design variables is often neglected even during the design process. Highlighting the relevance of these design variables, this research studies the relationships of building location variables with the electrical energy consumption of residential units. The following building design parameters are considered: orientation, story height and sky view factor (SVF). The consideration of the SVF as a location variable contributes to the originality of this research. Data of electrical energy consumption and users' profiles were collected and several variables were considered for the development of an Artificial Neural Network model. This model allows the determination of the relative importance of each variable. The results show that the apartments' orientation is the most important design variable for the energy consumption, although the story height and the sky view factor play a fundamental role in that consumption too. We pointed out that building heights above twenty-four meters do not optimize the energy efficiency of the apartments and also that an increasing SVF can influence the energy consumption of an apartment according to their orientation.
Resumo:
Autism is a neurodevelopmental disorder characterized by impaired social interaction and communication accompanied with repetitive behavioral patterns and unusual stereotyped interests. Autism is considered a highly heterogeneous disorder with diverse putative causes and associated factors giving rise to variable ranges of symptomatology. Incidence seems to be increasing with time, while the underlying pathophysiological mechanisms remain virtually uncharacterized (or unknown). By systematic review of the literature and a systems biology approach, our aims were to examine the multifactorial nature of autism with its broad range of severity, to ascertain the predominant biological processes, cellular components, and molecular functions integral to the disorder, and finally, to elucidate the most central contributions (genetic and/or environmental) in silico. With this goal, we developed an integrative network model for gene-environment interactions (GENVI model) where calcium (Ca2+) was shown to be its most relevant node. Moreover, considering the present data from our systems biology approach together with the results from the differential gene expression analysis of cerebellar samples from autistic patients, we believe that RAC1, in particular, and the RHO family of GTPases, in general, could play a critical role in the neuropathological events associated with autism. © 2013 Springer Science+Business Media New York.
Resumo:
Pós-graduação em Geologia Regional - IGCE
Resumo:
This work shows the importance of taking a good organization of space for the improvement of urban public transport. The model of urban transport is used improperly aggravating factor that generates diseconomies to society. The reduction of the use of public transport, degradation of environmental conditions, chronic congestion, poor accessibility and high rates of traffic accidents are common in many cities. The case study will be done in Jundiaí - SP, where actions were taken to try to reverse this situation of crisis in urban transport, as the change in transport network system. Will analyze the proposals adopted for the implementation of the new network model, steps taken, questionnaires and results from these studies. Verifying the effectiveness of the new transport network model adopted and its reflection with users, those who use the transportation and / or who directly suffer the influences this
Resumo:
Pós-graduação em Design - FAAC
Resumo:
Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.
Resumo:
Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.
Resumo:
Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.
Resumo:
Translucent WDM optical networks use sparse placement of regenerators to overcome the impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks with much less cost. Our previous study proved the feasibility of translucent networks using sparse regeneration technique. We addressed the placement of regenerators based on static schemes allowing only fixed number of regenerators at fixed locations. This paper furthers the study by proposing a suite of dynamical routing schemes. Dynamic allocation, advertisement and discovery of regeneration resources are proposed to support sharing transmitters and receivers between regeneration and access functions. This study follows the current trend in optical networking industry by utilizing extension of IP control protocols. Dynamic routing algorithms, aware of current regeneration resources and link states, are designed to smartly route the connection requests under quality constraints. A hierarchical network model, supported by the MPLS-based control plane, is also proposed to provide scalability. Experiments show that network performance is improved without placement of extra regenerators.
Resumo:
The issue of whether loliginid squid can influence the average structure of marine ecosystems in a keystone role, i.e. a strong effect with relatively low biomass, has not yet been examined. Here, the diet of Loligo plei in inner shelf waters of the South Brazil Bight was examined, as a first step, based on the stomach contents of 2200 squid hand-jigged in shallow water (, 30 m) and taken as bycatch of shrimp trawlers in deeper water (30-100 m). Diet varied by size, season, and fishing zone. Stomachs were not empty in similar to 12%, with more empty during winter. The range of mantle lengths of squid caught by jigging (101-356 mm) appeared to differ from the squid trawled (30-236 mm), and the diet also differed. Food categories recorded in deeper water did not include amphipods or polychaetes, but in both fishing areas, fish were the most common prey. The fish prey identified included Trachurus lathami, small pelagic species, trichiurids, and Merluccius hubbsi. Demersal species, such as Ctenosciaena gracilicirrhus, and flatfish were also present. An ecosystem network model is updated through which a mixed-trophic impact matrix and ""keystoneness"" indicators were calculated. Loligo plei represents an important link between pelagic and demersal energy pathways, with high indices of keystoneness.
Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution
Resumo:
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.
Resumo:
We obtain the Paris law of fatigue crack propagation in a fuse network model where the accumulated damage in each resistor increases with time as a power law of the local current amplitude. When a resistor reaches its fatigue threshold, it burns irreversibly. Over time, this drives cracks to grow until the system is fractured into two parts. We study the relation between the macroscopic exponent of the crack-growth rate -entering the phenomenological Paris law-and the microscopic damage accumulation exponent, gamma, under the influence of disorder. The way the jumps of the growing crack, Delta a, and the waiting time between successive breaks, Delta t, depend on the type of material, via gamma, are also investigated. We find that the averages of these quantities, <Delta a > and <Delta t >/< t(r)>, scale as power laws of the crack length a, <Delta a > proportional to a(alpha) and <Delta t >/< t(r)> proportional to a(-beta), where < t(r)> is the average rupture time. Strikingly, our results show, for small values of gamma, a decrease in the exponent of the Paris law in comparison with the homogeneous case, leading to an increase in the lifetime of breaking materials. For the particular case of gamma = 0, when fatigue is exclusively ruled by disorder, an analytical treatment confirms the results obtained by simulation. Copyright (C) EPLA, 2012