989 resultados para CONNECTIVITY DISTRIBUTION
Resumo:
FSodium phosphate tellurite glasses in the system (NaPO3)(x)(TeO2)(1-x) were prepared and structurally characterized by thermal analysis, vibrational spectroscopy, X-ray photoelectron spectroscopy (XPS) and a variety of complementary solid-state nuclear magnetic resonance (NMR) techniques. Unlike the situation in other mixed-network-former glasses, the interaction between the two network formers tellurium oxide and phosphorus oxide produces no new structural units, and no sharing of the network modifier Na2O takes place. The glass structure can be regarded as a network of interlinked metaphosphate-type P(2) tetrahedral and TeO4/2 antiprismotic units. The combined interpretation of the O 1s XPS data and the P-31 solid-state NMR spectra presents clear quantitative evidence for a nonstatistical connectivity distribution. Rather the formation of homootomic P-O-P and Te-O-Te linkages is favored over mixed P-O-Te connectivities. As a consequence of this chemical segregation effect, the spatial sodium distribution is not random, as also indicated by a detailed analysis of P-31/No-23 rotational echo double-resonance (REDOR) experiments. ACHTUNGTRENUNG(TeO2)1 x were prepared and structurally characterized by thermal analysis,vibrat ional spectroscopy,X-ray photoelectron spectroscopy (XPS) and a variety of complementary solid-state nuclear magnetic resonance (NMR) techniques. Unlike the situation in other mixed-network-former glasses,the interaction between the two network formers tellurium oxide and phosphorus oxide produces no new structural units,and no sharing of the network modifier Na2O takes place. The glass structure can be regarded as a network of interlinked metaphosphate-type P(2) tetrahedral and TeO4/2 antiprismatic units. The combined interpretation of the O 1s XPS data and the 31P solid-state NMR spectra presents clear quantitative evidence for a nonstatistical connectivity distribution. Rather,the formation of homoatomic P O P and Te O Te linkages is favored over mixed P O Te connectivities. As a consequence of this chemical segregation effect,the spatial sodium distribution is not random,as also indicated by a detailed analysis of 31P/23Na rotational echo double-resonance (REDOR) experiments.
Resumo:
Background: We report an analysis of a protein network of functionally linked proteins, identified from a phylogenetic statistical analysis of complete eukaryotic genomes. Phylogenetic methods identify pairs of proteins that co-evolve on a phylogenetic tree, and have been shown to have a high probability of correctly identifying known functional links. Results: The eukaryotic correlated evolution network we derive displays the familiar power law scaling of connectivity. We introduce the use of explicit phylogenetic methods to reconstruct the ancestral presence or absence of proteins at the interior nodes of a phylogeny of eukaryote species. We find that the connectivity distribution of proteins at the point they arise on the tree and join the network follows a power law, as does the connectivity distribution of proteins at the time they are lost from the network. Proteins resident in the network acquire connections over time, but we find no evidence that 'preferential attachment' - the phenomenon of newly acquired connections in the network being more likely to be made to proteins with large numbers of connections - influences the network structure. We derive a 'variable rate of attachment' model in which proteins vary in their propensity to form network interactions independently of how many connections they have or of the total number of connections in the network, and show how this model can produce apparent power-law scaling without preferential attachment. Conclusion: A few simple rules can explain the topological structure and evolutionary changes to protein-interaction networks: most change is concentrated in satellite proteins of low connectivity and small phenotypic effect, and proteins differ in their propensity to form attachments. Given these rules of assembly, power law scaled networks naturally emerge from simple principles of selection, yielding protein interaction networks that retain a high-degree of robustness on short time scales and evolvability on longer evolutionary time scales.
Resumo:
Currently the interest in large-scale systems with a high degree of complexity has been much discussed in the scientific community in various areas of knowledge. As an example, the Internet, protein interaction, collaboration of film actors, among others. To better understand the behavior of interconnected systems, several models in the area of complex networks have been proposed. Barabási and Albert proposed a model in which the connection between the constituents of the system could dynamically and which favors older sites, reproducing a characteristic behavior in some real systems: connectivity distribution of scale invariant. However, this model neglects two factors, among others, observed in real systems: homophily and metrics. Given the importance of these two terms in the global behavior of networks, we propose in this dissertation study a dynamic model of preferential binding to three essential factors that are responsible for competition for links: (i) connectivity (the more connected sites are privileged in the choice of links) (ii) homophily (similar connections between sites are more attractive), (iii) metric (the link is favored by the proximity of the sites). Within this proposal, we analyze the behavior of the distribution of connectivity and dynamic evolution of the network are affected by the metric by A parameter that controls the importance of distance in the preferential binding) and homophily by (characteristic intrinsic site). We realized that the increased importance as the distance in the preferred connection, the connections between sites and become local connectivity distribution is characterized by a typical range. In parallel, we adjust the curves of connectivity distribution, for different values of A, the equation P(k) = P0e
Resumo:
In this work a study of social networks based on analysis of family names is presented. A basic approach to the mathematical formalism of graphs is developed and then main theoretical models for complex networks are presented aiming to support the analysis of surnames networks models. These, in turn, are worked so as to be drawn leading quantities, such as aggregation coefficient, minimum average path length and connectivity distribution. Based on these quantities, it can be stated that surnames networks are an example of complex network, showing important features such as preferential attachment and small-world character
Resumo:
Glasses in the system [Na2S](2/3)[(B2S3)(x)(P2S5)(1-x)](1/3) (0.0 <= x <= 1.0) were prepared by the melt quenching technique, and their properties were characterized by thermal analysis and impedance spectroscopy. Their atomic-level structures were comprehensively characterized by Raman spectroscopy and B-11, P-31, and Na-23 high resolution solid state magic-angle spinning (MAS) NMR techniques. P-31 MAS NMR peak assignments were made by the presence or absence of homonuclear indirect P-31-P-31 spin-spin interactions as detected using homonuclear J-resolved and refocused INADEQUATE techniques. The extent of B-S-P connectivity in the glassy network was quantified by P-31{B-11} and B-11{P-31} rotational echo double resonance spectroscopy. The results clearly illustrate that the network modifier alkali sulfide, Na2S, is not proportionally shared between the two network former components, B and P. Rather, the thiophosphate (P) component tends to attract a larger concentration of network modifier species than predicted by the bulk composition, and this results in the conversion of P2S74-, pyrothiophosphate, Na/P = 2:1, units into PS43-, orthothiophosphate, Na/P = 3:1, groups. Charge balance is maintained by increasing the net degree of polymerization of the thioborate (B) units through the formation of covalent bridging sulfur (BS) units, B S B. Detailed inspection of the B-11 MAS NMR spectra reveals that multiple thioborate units are formed, ranging from neutral BS3/2 groups all the way to the fully depolymerized orthothioborate (BS33-) species. On the basis of these results, a comprehensive and quantitative structural model is developed for these glasses, on the basis of which the compositional trends in the glass transition temperatures (T-g) and ionic conductivities can be rationalized. Up to x = 0.4, the dominant process can be described in a simplified way by the net reaction equation P-1 + B-1 reversible arrow P-0 + B-4, where the superscripts denote the number of BS atoms for the respective network former species. Above x = 0.4, all of the thiophosphate units are of the P-0 type and both pyro-(B-1) and orthothioborate (B-0) species make increasing contributions to the network structure with increasing x. In sharp contrast to the situation in sodium borophosphate glasses, four-coordinated thioborate species are generally less abundant and heteroatomic B-S-P linkages appear to not exist. On the basis of this structural information, compositional trends in the ionic conductivities are discussed in relation to the nature of the charge-compensating anionic species and the spatial distribution of the charge carriers.
Resumo:
Glasses in the system xGeO(2)-(1-x)NaPO3 (0 <= x <= 0.50) were prepared by conventional melting quenching and characterized by thermal analysis, Raman spectroscopy, X-ray photoelectron spectroscopy (XPS), and P-31 nuclear magnetic resonance (MAS NMR) techniques. The deconvolution of the latter spectra was aided by homonuclear J-resolved and refocused INADEQUATE techniques. The combined analyses of P-31 MAS NMR and O-1s XPS lineshapes, taking charge and mass balance considerations into account, yield the detailed quantitative speciations of the phosphorus, germanium, and oxygen atoms and their respective connectivities. An internally consistent description is possible without invoking the formation of higher-coordinated germanium species in these glasses, in agreement with experimental evidence in the literature. The structure can be regarded, to a first approximation, as a network consisting of P-(2) and P-(3) tetrahedra linked via four-coordinate germanium. As implied by the appearance of P-(3) units, there is a moderate extent of network modifier sharing between phosphate and germanate network formers, as expressed by the formal melt reaction P-(2) + Ge-(4) -> P-(3) + Ge-(3). The equilibrium constant of this reaction is estimated as K = 0.52 +/- 0.11, indicating a preferential attraction of network modifier by the phosphorus component. These conclusions are qualitatively supported by Raman spectroscopy as well as P-31{Na-23} and P-31{Na-23} rotational echo double resonance (REDOR) NMR results. The combined interpretation of O-1s XPS and P-31 MAS NMR spectra shows further that there are clear deviations from a random connectivity scenario: heteroatomic P-O-Ge linkages are favored over homoatomic P-O-P and Ge-O-Ge linkages.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The study of soil structure, i.e., the pores, is of vital importance in different fields of science and technology. Total pore volume (porosity), pore surface, pore connectivity and pore size distribution are some (probably the most important) of the geometric measurements of pore space. The technology of X-ray computed tomography allows us to obtain 3D images of the inside of a soil sample enabling study of the pores without disturbing the samples. In this work we performed a set of geometrical measures, some of them from mathematical morphology, to assess and quantify any possible difference that tillage may have caused on the soil. We compared samples from tilled soil with samples from a soil with natural vegetation taken in a very close area. Our results show that the main differences between these two groups of samples are total surface area and pore connectivity per unit pore volume.
Resumo:
Recent research into resting-state functional magnetic resonance imaging (fMRI) has shown that the brain is very active during rest. This thesis work utilizes blood oxygenation level dependent (BOLD) signals to investigate the spatial and temporal functional network information found within resting-state data, and aims to investigate the feasibility of extracting functional connectivity networks using different methods as well as the dynamic variability within some of the methods. Furthermore, this work looks into producing valid networks using a sparsely-sampled sub-set of the original data.
In this work we utilize four main methods: independent component analysis (ICA), principal component analysis (PCA), correlation, and a point-processing technique. Each method comes with unique assumptions, as well as strengths and limitations into exploring how the resting state components interact in space and time.
Correlation is perhaps the simplest technique. Using this technique, resting-state patterns can be identified based on how similar the time profile is to a seed region’s time profile. However, this method requires a seed region and can only identify one resting state network at a time. This simple correlation technique is able to reproduce the resting state network using subject data from one subject’s scan session as well as with 16 subjects.
Independent component analysis, the second technique, has established software programs that can be used to implement this technique. ICA can extract multiple components from a data set in a single analysis. The disadvantage is that the resting state networks it produces are all independent of each other, making the assumption that the spatial pattern of functional connectivity is the same across all the time points. ICA is successfully able to reproduce resting state connectivity patterns for both one subject and a 16 subject concatenated data set.
Using principal component analysis, the dimensionality of the data is compressed to find the directions in which the variance of the data is most significant. This method utilizes the same basic matrix math as ICA with a few important differences that will be outlined later in this text. Using this method, sometimes different functional connectivity patterns are identifiable but with a large amount of noise and variability.
To begin to investigate the dynamics of the functional connectivity, the correlation technique is used to compare the first and second halves of a scan session. Minor differences are discernable between the correlation results of the scan session halves. Further, a sliding window technique is implemented to study the correlation coefficients through different sizes of correlation windows throughout time. From this technique it is apparent that the correlation level with the seed region is not static throughout the scan length.
The last method introduced, a point processing method, is one of the more novel techniques because it does not require analysis of the continuous time points. Here, network information is extracted based on brief occurrences of high or low amplitude signals within a seed region. Because point processing utilizes less time points from the data, the statistical power of the results is lower. There are also larger variations in DMN patterns between subjects. In addition to boosted computational efficiency, the benefit of using a point-process method is that the patterns produced for different seed regions do not have to be independent of one another.
This work compares four unique methods of identifying functional connectivity patterns. ICA is a technique that is currently used by many scientists studying functional connectivity patterns. The PCA technique is not optimal for the level of noise and the distribution of the data sets. The correlation technique is simple and obtains good results, however a seed region is needed and the method assumes that the DMN regions is correlated throughout the entire scan. Looking at the more dynamic aspects of correlation changing patterns of correlation were evident. The last point-processing method produces a promising results of identifying functional connectivity networks using only low and high amplitude BOLD signals.
Resumo:
Islanded operation, protection, reclosing and arc extinguishing are some of the challenging issues related to the connection of converter interfaced distributed generators (DGs) into a distribution network. The isolation of upstream faults in grid connected mode and fault detection in islanded mode using overcurrent devices are difficult. In the event of an arc fault, all DGs must be disconnected in order to extinguish the arc. Otherwise, they will continue to feed the fault, thus sustaining the arc. However, the system reliability can be increased by maximising the DG connectivity to the system: therefore, the system protection scheme must ensure that only the faulted segment is removed from the feeder. This is true even in the case of a radial feeder as the DG can be connected at various points along the feeder. In this paper, a new relay scheme is proposed which, along with a novel current control strategy for converter interfaced DGs, can isolate permanent and temporary arc faults. The proposed protection and control scheme can even coordinate with reclosers. The results are validated through PSCAD/EMTDC simulation and MATLAB calculations.
Resumo:
Patterns of connectivity among local populations influence the dynamics of regional systems, but most ecological models have concentrated on explaining the effect of connectivity on local population structure using dynamic processes covering short spatial and temporal scales. In this study, a model was developed in an extended spatial system to examine the hypothesis that long term connectivity levels among local populations are influenced by the spatial distribution of resources and other habitat factors. The habitat heterogeneity model was applied to local wild rabbit populations in the semi-arid Mitchell region of southern central Queensland (the Eastern system). Species' specific population parameters which were appropriate for the rabbit in this region were used. The model predicted a wide range of long term connectivity levels among sites, ranging from the extreme isolation of some sites to relatively high interaction probabilities for others. The validity of model assumptions was assessed by regressing model output against independent population genetic data, and explained over 80% of the variation in the highly structured genetic data set. Furthermore, the model was robust, explaining a significant proportion of the variation in the genetic data over a wide range of parameters. The performance of the habitat heterogeneity model was further assessed by simulating the widely reported recent range expansion of the wild rabbit into the Mitchell region from the adjacent, panmictic Western rabbit population system. The model explained well the independently determined genetic characteristics of the Eastern system at different hierarchic levels, from site specific differences (for example, fixation of a single allele in the population at one site), to differences between population systems (absence of an allele in the Eastern system which is present in all Western system sites). The model therefore explained the past and long term processes which have led to the formation and maintenance of the highly structured Eastern rabbit population system. Most animals exhibit sex biased dispersal which may influence long term connectivity levels among local populations, and thus the dynamics of regional systems. When appropriate sex specific dispersal characteristics were used, the habitat heterogeneity model predicted substantially different interaction patterns between female-only and combined male and female dispersal scenarios. In the latter case, model output was validated using data from a bi-parentally inherited genetic marker. Again, the model explained over 80% of the variation in the genetic data. The fact that such a large proportion of variability is explained in two genetic data sets provides very good evidence that habitat heterogeneity influences long term connectivity levels among local rabbit populations in the Mitchell region for both males and females. The habitat heterogeneity model thus provides a powerful approach for understanding the large scale processes that shape regional population systems in general. Therefore the model has the potential to be useful as a tool to aid in the management of those systems, whether it be for pest management or conservation purposes.
Resumo:
Secure communications in wireless sensor networks operating under adversarial conditions require providing pairwise (symmetric) keys to sensor nodes. In large scale deployment scenarios, there is no prior knowledge of post deployment network configuration since nodes may be randomly scattered over a hostile territory. Thus, shared keys must be distributed before deployment to provide each node a key-chain. For large sensor networks it is infeasible to store a unique key for all other nodes in the key-chain of a sensor node. Consequently, for secure communication either two nodes have a key in common in their key-chains and they have a wireless link between them, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path have a key in common. Length of the key-path is the key factor for efficiency of the design. This paper presents novel deterministic and hybrid approaches based on Combinatorial Design for deciding how many and which keys to assign to each key-chain before the sensor network deployment. In particular, Balanced Incomplete Block Designs (BIBD) and Generalized Quadrangles (GQ) are mapped to obtain efficient key distribution schemes. Performance and security properties of the proposed schemes are studied both analytically and computationally. Comparison to related work shows that the combinatorial approach produces better connectivity with smaller key-chain sizes.
Resumo:
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor deployment scenario, there will be no prior knowledge of post deployment configuration. For security solutions requiring pair wise keys, it is impossible to decide how to distribute key pairs to sensor nodes before the deployment. Existing approaches to this problem are to assign more than one key, namely a key-chain, to each node. Key-chains are randomly drawn from a key-pool. Either two neighbouring nodes have a key in common in their key-chains, or there is a path, called key-path, among these two nodes where each pair of neighbouring nodes on this path has a key in common. Problem in such a solution is to decide on the key-chain size and key-pool size so that every pair of nodes can establish a session key directly or through a path with high probability. The size of the key-path is the key factor for the efficiency of the design. This paper presents novel, deterministic and hybrid approaches based on Combinatorial Design for key distribution. In particular, several block design techniques are considered for generating the key-chains and the key-pools. Comparison to probabilistic schemes shows that our combinatorial approach produces better connectivity with smaller key-chain sizes.
Resumo:
We consider the problem of maximizing the secure connectivity in wireless ad hoc networks, and analyze complexity of the post-deployment key establishment process constrained by physical layer properties such as connectivity, energy consumption and interference. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by shared keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one extends the first problem by increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We prove that both problems are NP-hard and MAX-SNP with a reduction to MAX3SAT problem.