48 resultados para Linear chains, critical exponents, complex networks, vehicular traffic
Resumo:
We investigate the critical behavior of the spectral weight of a single quasiparticle, one of the key observables in experiment, for the particular case of the transverse Ising model. Series expansions are calculated for the linear chain and the square and simple cubic lattices. For the chain model, a conjectured exact result is discovered. For the square and simple cubic lattices, series analyses are used to estimate the critical exponents. The results agree with the general predictions of Sachdev [Quantum Phase Transitions (Cambridge University Press, Cambridge, England, 1999)].
Resumo:
A dinuclear macrocyclic complex is synthesized via the one-pot reaction of dipotassium nitroacetate, formaldehyde and a linear tetraamine copper(II) complex; the X-ray crystal structure of the product reveals an association of two dinuclear complexes to form a novel tetracopper(II) species.
Resumo:
Traditional methods of R&D management are no longer sufficient for embracing innovations and leveraging complex new technologies to fully integrated positions in established systems. This paper presents the view that the technology integration process is a result of fundamental interactions embedded in inter-organisational activities. Emerging industries, high technology companies and knowledge intensive organisations owe a large part of their viability to complex networks of inter-organisational interactions and relationships. R&D organisations are the gatekeepers in the technology integration process with their initial sanction and motivation to develop technologies providing the first point of entry. Networks rely on the activities of stakeholders to provide the foundations of collaborative R&D activities, business-to-business marketing and strategic alliances. Such complex inter-organisational interactions and relationships influence value creation and organisational goals as stakeholders seek to gain investment opportunities. A theoretical model is developed here that contributes to our understanding of technology integration (adoption) as a dynamic process, which is simultaneously structured and enacted through the activities of stakeholders and organisations in complex inter-organisational networks of sanction and integration.
Resumo:
For purposes of interstate and international fruit trade, it is necessary to demonstrate that in areas in which fruit fly species have not previously established permanent populations, but which are subject to introductions of fruit flies from outside the area, the introduced population once detected, has not become established. In this paper, we apply methodology suggested mainly by Carey (1991, 1995) to introductions of Mediterranean fruit fly (Medfly), Ceratitis capitata Weid., and Queensland fruit fly (QFF) Bactrocera tryoni Froggatt (Diptera: Tephritidae) to South Australia, a state in which these species do not occur naturally and in which introductions, once detected, are actively treated. By analysing historical data associated with fruit fly outbreaks in South Australia, we demonstrate that: (i) fruit flies occur seasonally, as would occur in established populations, except there is no evidence of the critical spring generation of either species; (ii) there is no evidence of increasing frequency of outbreaks, trapped flies or larval occurrences over 29 years; (iii) there is no evidence of decreasing time between catches of adult flies as the years progress; (iv) there is no decrease in the mean number of years between outbreaks in the same locations; (v) there is no statistically significant recurrence of outbreaks in the same locations in successive years; (vi) there is no evidence of spread of outbreaks outwards from a central location; (vii) the likelihood of outbreaks in a city or town is related to the size of the human population; (viii) introduction pathways by road from Western Australia (for Medfly) and eastern Australia (for QFF) are shown to exist and to illegally or accidentally carry considerable amounts of fruit into South Australia; and (ix) there was no association between the numbers of either Queensland fruit fly or Medfly and the spatial pattern of either loquat or cumquat trees as sources of larval food in spring. This analysis supports the hypothesis that most fruit fly outbreaks in South Australia have been the result of separate introductions of infested fruit by vehicular traffic and that most of the resultant fly outbreaks were detected and died out within a few weeks of the application of eradication procedures. An alternative hypothesis, that populations of fruit flies are established in South Australia at below detectable levels, is impossible to disprove with conventional technology, but the likelihood of it being true is minimised by our analysis. Both hypotheses could be tested soon with newly developed genetic techniques.
Resumo:
Many growing networks possess accelerating statistics where the number of links added with each new node is an increasing function of network size so the total number of links increases faster than linearly with network size. In particular, biological networks can display a quadratic growth in regulator number with genome size even while remaining sparsely connected. These features are mutually incompatible in standard treatments of network theory which typically require that every new network node possesses at least one connection. To model sparsely connected networks, we generalize existing approaches and add each new node with a probabilistic number of links to generate either accelerating, hyperaccelerating, or even decelerating network statistics in different regimes. Under preferential attachment for example, slowly accelerating networks display stationary scale-free statistics relatively independent of network size while more rapidly accelerating networks display a transition from scale-free to exponential statistics with network growth. Such transitions explain, for instance, the evolutionary record of single-celled organisms which display strict size and complexity limits.
Resumo:
We present existence results for a Neumann problem involving critical Sobolev nonlinearities both on the right hand side of the equation and at the boundary condition.. Positive solutions are obtained through constrained minimization on the Nehari manifold. Our approach is based on the concentration 'compactness principle of P. L. Lions and M. Struwe.
Resumo:
International trade and investment economies are highly integrated and interdependent and can be exploited by organized, international terrorism. The network of inter dependencies in the international economy means that a terrorist attack has the potential to disrupt the functioning of the network, so the effects can reverberate around the world. Governments can control the distributed effects of terrorism by auditing industrial networks to reveal and protect critical hubs and by promoting flexibility in production and distribution of goods and services to improve resilience in the economy. To explain these network effects, the authors draw on the new science of complex networks which has been applied to the physical sciences and is now increasingly being used to explain organizational and economic phenomena.
Resumo:
We present the temperature dependence of the uniform susceptibility of spin-half quantum antiferromagnets on spatially anisotropic triangular lattices, using high-temperature series expansions. We consider a model with two exchange constants J1 and J2 on a lattice that interpolates between the limits of a square lattice (J1=0), a triangular lattice (J2=J1), and decoupled linear chains (J2=0). In all cases, the susceptibility, which has a Curie-Weiss behavior at high temperatures, rolls over and begins to decrease below a peak temperature Tp. Scaling the exchange constants to get the same peak temperature shows that the susceptibilities for the square lattice and linear chain limits have similar magnitudes near the peak. Maximum deviation arises near the triangular-lattice limit, where frustration leads to much smaller susceptibility and with a flatter temperature dependence. We compare our results to the inorganic materials Cs2CuCl4 and Cs2CuBr4 and to a number of organic molecular crystals. We find that the former (Cs2CuCl4 and Cs2CuBr4) are weakly frustrated and their exchange parameters determined through the temperature dependence of the susceptibility are in agreement with neutron-scattering measurements. In contrast, the organic materials considered are strongly frustrated with exchange parameters near the isotropic triangular-lattice limit.
Resumo:
This paper discusses a multi-layer feedforward (MLF) neural network incident detection model that was developed and evaluated using field data. In contrast to published neural network incident detection models which relied on simulated or limited field data for model development and testing, the model described in this paper was trained and tested on a real-world data set of 100 incidents. The model uses speed, flow and occupancy data measured at dual stations, averaged across all lanes and only from time interval t. The off-line performance of the model is reported under both incident and non-incident conditions. The incident detection performance of the model is reported based on a validation-test data set of 40 incidents that were independent of the 60 incidents used for training. The false alarm rates of the model are evaluated based on non-incident data that were collected from a freeway section which was video-taped for a period of 33 days. A comparative evaluation between the neural network model and the incident detection model in operation on Melbourne's freeways is also presented. The results of the comparative performance evaluation clearly demonstrate the substantial improvement in incident detection performance obtained by the neural network model. The paper also presents additional results that demonstrate how improvements in model performance can be achieved using variable decision thresholds. Finally, the model's fault-tolerance under conditions of corrupt or missing data is investigated and the impact of loop detector failure/malfunction on the performance of the trained model is evaluated and discussed. The results presented in this paper provide a comprehensive evaluation of the developed model and confirm that neural network models can provide fast and reliable incident detection on freeways. (C) 1997 Elsevier Science Ltd. All rights reserved.
Resumo:
The traditional idea of proteins as linear chains of amino acids is being challenged with the discovery of miniproteins that contain a circular backbone. The cyclotide family is the largest group of circular proteins and is characterized by an amide-circularized protein backbone and six conserved cysteine residues. These conserved cysteines are paired to form a knotted network of disulfide bonds. The combination of the circular backbone and a cystine knot, known as the cyclic cystine knot (CCK) motif, confers exceptional stability upon the cyclotides. This review discusses the role of the circular backbone based on studies of both the oxidative folding of kalata B1, the prototypical cyclotide, and a comparison of the structure and activity of kalata B1 and its acyclic permutants.
Resumo:
In Australia more than 300 vertebrates, including 43 insectivorous bat species, depend on hollows in habitat trees for shelter, with many species using a network of multiple trees as roosts, We used roost-switching data on white-striped freetail bats (Tadarida australis; Microchiroptera: Molossidae) to construct a network representation of day roosts in suburban Brisbane, Australia. Bats were caught from a communal roost tree with a roosting group of several hundred individuals and released with transmitters. Each roost used by the bats represented a node in the network, and the movements of bats between roosts formed the links between nodes. Despite differences in gender and reproductive stages, the bats exhibited the same behavior throughout three radiotelemetry periods and over 500 bat days of radio tracking: each roosted in separate roosts, switched roosts very infrequently, and associated with other bats only at the communal roost This network resembled a scale-free network in which the distribution of the number of links from each roost followed a power law. Despite being spread over a large geographic area (> 200 km(2)), each roost was connected to others by less than three links. One roost (the hub or communal roost) defined the architecture of the network because it had the most links. That the network showed scale-free properties has profound implications for the management of the habitat trees of this roosting group. Scale-free networks provide high tolerance against stochastic events such as random roost removals but are susceptible to the selective removal of hub nodes. Network analysis is a useful tool for understanding the structural organization of habitat tree usage and allows the informed judgment of the relative importance of individual trees and hence the derivation of appropriate management decisions, Conservation planners and managers should emphasize the differential importance of habitat trees and think of them as being analogous to vital service centers in human societies.
Resumo:
Topological measures of large-scale complex networks are applied to a specific artificial regulatory network model created through a whole genome duplication and divergence mechanism. This class of networks share topological features with natural transcriptional regulatory networks. Specifically, these networks display scale-free and small-world topology and possess subgraph distributions similar to those of natural networks. Thus, the topologies inherent in natural networks may be in part due to their method of creation rather than being exclusively shaped by subsequent evolution under selection. The evolvability of the dynamics of these networks is also examined by evolving networks in simulation to obtain three simple types of output dynamics. The networks obtained from this process show a wide variety of topologies and numbers of genes indicating that it is relatively easy to evolve these classes of dynamics in this model. (c) 2006 Elsevier Ireland Ltd. All rights reserved.
Resumo:
Admission controls, such as trunk reservation, are often used in loss networks to optimise their performance. Since the numerical evaluation of performance measures is complex, much attention has been given to finding approximation methods. The Erlang Fixed-Point (EFP) approximation, which is based on an independent blocking assumption, has been used for networks both with and without controls. Several more elaborate approximation methods which account for dependencies in blocking behaviour have been developed for the uncontrolled setting. This paper is an exploratory investigation of extensions and synthesis of these methods to systems with controls, in particular, trunk reservation. In order to isolate the dependency factor, we restrict our attention to a highly linear network. We will compare the performance of the resulting approximations against the benchmark of the EFP approximation extended to the trunk reservation setting. By doing this, we seek to gain insight into the critical factors in constructing an effective approximation. (C) 2003 Elsevier Ltd. All rights reserved.
Resumo:
Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ODEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.