R. Hassan
2008-01-01
Full Text Available This study presented a new data link layer design for the virtual bus architecture. The virtual bus is a hierarchical access network offered a broadcast capability for data and signaling. The proposed of the study is to support Quality of Service (QoS in network. During study, the most promising technology capable of delivering full service access at high data rates is Synchronous Digital Hierarchy (SDH/Synchronous Optical Networking (SONET. For that reason, we develop SDH/SONET as a physical layer for the virtual bus network. The main goal of this investigation was to study the performance of transmission medium and the overall performance of the network. We exemplify a Multiple Access Protocol (MAP with Generic Frame Procedure (GFP for transmitting IP network protocol datagram over SDH/SONET. This is a novel method for transmitting MAP with GFP. The protocol adds multi-terminal access capability to an inherently point-to-point link. It enabled the design of seamless networking environments using SDH/SONET as the transmission medium for Metropolitan Area Network (MAN. The new frame mapping protocol is known as Virtual Bus Transport (VBT. The performance of multiple traffic generators in a virtual bus network is of major interest for mobile network provider. We used OMNeT simulation tool to evaluate the result. Through the simulation it proved that the VBT scheduling technique offers better treatment mainly to the higher Qos requirement traffic.
Hierarchy Measure for Complex Networks
Mones, Enys; Vicsek, Lilla; Vicsek, Tamás
2012-01-01
Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477
Hierarchy measure for complex networks
Mones, Enys; Vicsek, Tamás
2012-01-01
Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks...
Detectability of ranking hierarchies in directed networks
Letizia, Elisa; Lillo, Fabrizio
2016-01-01
Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications such as social network analysis, biology, economics, and finance. A recently proposed method identifies the hierarchy by finding the ordered partition of nodes which minimizes a score function, termed agony. This function penalizes the links violating the hierarchy in a way depending on the strength of the violation. To investigate the detectability of ranking hierarchies we introduce an ensemble of random graphs, the Hierarchical Stochastic Block Model. We find that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network. We analytically characterize the detectability threshold and we show that an iterated version of agony can partly overcome this resolution limit.
The network motif architecture of dominance hierarchies.
Shizuka, Daizaburo; McDonald, David B
2015-04-01
The widespread existence of dominance hierarchies has been a central puzzle in social evolution, yet we lack a framework for synthesizing the vast empirical data on hierarchy structure in animal groups. We applied network motif analysis to compare the structures of dominance networks from data published over the past 80 years. Overall patterns of dominance relations, including some aspects of non-interactions, were strikingly similar across disparate group types. For example, nearly all groups exhibited high frequencies of transitive triads, whereas cycles were very rare. Moreover, pass-along triads were rare, and double-dominant triads were common in most groups. These patterns did not vary in any systematic way across taxa, study settings (captive or wild) or group size. Two factors significantly affected network motif structure: the proportion of dyads that were observed to interact and the interaction rates of the top-ranked individuals. Thus, study design (i.e. how many interactions were observed) and the behaviour of key individuals in the group could explain much of the variations we see in social hierarchies across animals. Our findings confirm the ubiquity of dominance hierarchies across all animal systems, and demonstrate that network analysis provides new avenues for comparative analyses of social hierarchies.
Solving moment hierarchies for chemical reaction networks
Krishnamurthy, Supriya; Smith, Eric
2017-10-01
The study of chemical reaction networks (CRN’s) is a very active field. Earlier well-known results (Feinberg 1987 Chem. Enc. Sci. 42 2229, Anderson et al 2010 Bull. Math. Biol. 72 1947) identify a topological quantity called deficiency, for any CRN, which, when exactly equal to zero, leads to a unique factorized steady-state for these networks. No results exist however for the steady states of non-zero-deficiency networks. In this paper, we show how to write the full moment-hierarchy for any non-zero-deficiency CRN obeying mass-action kinetics, in terms of equations for the factorial moments. Using these, we can recursively predict values for lower moments from higher moments, reversing the procedure usually used to solve moment hierarchies. We show, for non-trivial examples, that in this manner we can predict any moment of interest, for CRN’s with non-zero deficiency and non-factorizable steady states.
Heterarchies: Reconciling Networks and Hierarchies.
Cumming, Graeme S
2016-08-01
Social-ecological systems research suffers from a disconnect between hierarchical (top-down or bottom-up) and network (peer-to-peer) analyses. The concept of the heterarchy unifies these perspectives in a single framework. Here, I review the history and application of 'heterarchy' in neuroscience, ecology, archaeology, multiagent control systems, business and organisational studies, and politics. Recognising complex system architecture as a continuum along vertical and lateral axes ('flat versus hierarchical' and 'individual versus networked') suggests four basic types of heterarchy: reticulated, polycentric, pyramidal, and individualistic. Each has different implications for system functioning and resilience. Systems can also shift predictably and abruptly between architectures. Heterarchies suggest new ways of contextualising and generalising from case studies and new methods for analysing complex structure-function relations.
Do Convolutional Neural Networks Learn Class Hierarchy?
Alsallakh, Bilal; Jourabloo, Amin; Ye, Mao; Liu, Xiaoming; Ren, Liu
2017-08-29
Convolutional Neural Networks (CNNs) currently achieve state-of-the-art accuracy in image classification. With a growing number of classes, the accuracy usually drops as the possibilities of confusion increase. Interestingly, the class confusion patterns follow a hierarchical structure over the classes. We present visual-analytics methods to reveal and analyze this hierarchy of similar classes in relation with CNN-internal data. We found that this hierarchy not only dictates the confusion patterns between the classes, it furthermore dictates the learning behavior of CNNs. In particular, the early layers in these networks develop feature detectors that can separate high-level groups of classes quite well, even after a few training epochs. In contrast, the latter layers require substantially more epochs to develop specialized feature detectors that can separate individual classes. We demonstrate how these insights are key to significant improvement in accuracy by designing hierarchy-aware CNNs that accelerate model convergence and alleviate overfitting. We further demonstrate how our methods help in identifying various quality issues in the training data.
How transportation hierarchy shapes human mobility
Gallotti, Riccardo; Rambaldi, Sandro; Barthelemy, Marc
2015-01-01
The recent availability of data allowing to monitor the position of individuals triggered a wealth of quantitative studies on human mobility. In particular, it is now believed that displacements can be described by a L\\'evy type of walk, characterized by many small movements and some rare long jumps. We show here that this view is not correct and that effective movements in urban and inter-urban areas are much simpler. We use a database containing the trajectories of $780,000$ private vehicles in Italy and an open dataset describing the temporal characteristics of the entire public transportation system in Great Britain. We observe that trips for both private and public transportation are on average accelerated as a consequence of the multilayer hierarchy of transportation infrastructures. In other terms, the speed depends on the duration of the trip, with larger speed for longer trips. This sole ingredient leads, starting from the observed exponential distribution of travel-times and velocities, to a distrib...
Emergence of hierarchy in cost driven growth of spatial networks
Louf, Rémi; Barthelemy, Marc
2013-01-01
One of the most important features of spatial networks such as transportation networks, power grids, Internet, neural networks, is the existence of a cost associated with the length of links. Such a cost has a profound influence on the global structure of these networks which usually display a hierarchical spatial organization. The link between local constraints and large-scale structure is however not elucidated and we introduce here a generic model for the growth of spatial networks based on the general concept of cost benefit analysis. This model depends essentially on one single scale and produces a family of networks which range from the star-graph to the minimum spanning tree and which are characterised by a continuously varying exponent. We show that spatial hierarchy emerges naturally, with structures composed of various hubs controlling geographically separated service areas, and appears as a large-scale consequence of local cost-benefit considerations. Our model thus provides the first building bloc...
The Impact of Formal Hierarchies on Enterprise Social Networking Behavior
Behrendt, Sebastian; Klier, Julia; Klier, Mathias
2015-01-01
With more and more companies using enterprise social networks (ESN) for employee communication and collaboration, the influence of ESN on organizational hierarchies has been subject of countless discussions in practice-oriented media and first academic studies. Conversely, the question whether...... impact on social networking behavior. By applying means of social network analysis and supported by statements from interviews, we illustrate how deeply formal hierarchy impacts the three examined types of relationships. Our results motivate academics to further study the interrelation between hierarchy...
Detecting Hidden Hierarchy of Non Hierarchical Terrorist Networks
Memon, Nasrullah
to analyze terrorist networks and prioritize their targets. Applying recently introduced mathematical methods for constructing the hidden hierarchy of "nonhierarchical" terrorist networks; we present case studies of the terrorist attacks occurred / planned in the past, in order to identify hidden hierarchy...
The Impact of Formal Hierarchies on Enterprise Social Networking Behavior
Behrendt, Sebastian; Klier, Julia; Klier, Mathias;
2015-01-01
and how formal organizational hierarchies influence ESN usage behavior has not yet been addressed. Drawing on a rich data set comprising 2.5 years of relationship building via direct messages, confirmed contact requests, and group messages, we are able to show that formal hierarchies have an important...... impact on social networking behavior. By applying means of social network analysis and supported by statements from interviews, we illustrate how deeply formal hierarchy impacts the three examined types of relationships. Our results motivate academics to further study the interrelation between hierarchy...
The Impact of Formal Hierarchies on Enterprise Social Networking Behavior
Behrendt, Sebastian; Klier, Julia; Klier, Mathias
2015-01-01
With more and more companies using enterprise social networks (ESN) for employee communication and collaboration, the influence of ESN on organizational hierarchies has been subject of countless discussions in practice-oriented media and first academic studies. Conversely, the question whether...... and how formal organizational hierarchies influence ESN usage behavior has not yet been addressed. Drawing on a rich data set comprising 2.5 years of relationship building via direct messages, confirmed contact requests, and group messages, we are able to show that formal hierarchies have an important...... impact on social networking behavior. By applying means of social network analysis and supported by statements from interviews, we illustrate how deeply formal hierarchy impacts the three examined types of relationships. Our results motivate academics to further study the interrelation between hierarchy...
On the origins of hierarchy in complex networks
Corominas-Murtra, Bernat; Goñi, Joaquín; Solé, Ricard V.; Rodríguez-Caso, Carlos
2013-01-01
Hierarchy seems to pervade complexity in both living and artificial systems. Despite its relevance, no general theory that captures all features of hierarchy and its origins has been proposed yet. Here we present a formal approach resulting from the convergence of theoretical morphology and network theory that allows constructing a 3D morphospace of hierarchies and hence comparing the hierarchical organization of ecological, cellular, technological, and social networks. Embedded within large voids in the morphospace of all possible hierarchies, four major groups are identified. Two of them match the expected from random networks with similar connectivity, thus suggesting that nonadaptive factors are at work. Ecological and gene networks define the other two, indicating that their topological order is the result of functional constraints. These results are consistent with an exploration of the morphospace, using in silico evolved networks. PMID:23898177
Hierarchy and information in feedforward networks
Corominas-Murtra, Bernat; Rodríguez-Caso, Carlos; Solé, Ricard
2010-01-01
In this paper we define a hierarchical index for feedforward structures taking, as the starting point, three fundamental concepts underlying hierarchy: order, predictability and pyramidal structure. Our definition applies to the so called causal graphs, i.e., connected, directed acyclic graphs in which the arrows depict a direct causal relation between two elements defining the nodes. The estimator of hierarchy is obtained by evaluating the complexity of causal paths against the uncertainty in recovering them from a given end point. This naturally leads us to a definition of mutual information which, properly normalized and weighted through the layered structure of the graph, results in suitable index of hierarchy with strong theoretical grounds.
Global network structure of dominance hierarchy of ant workers.
Shimoji, Hiroyuki; Abe, Masato S; Tsuji, Kazuki; Masuda, Naoki
2014-10-06
Dominance hierarchy among animals is widespread in various species and believed to serve to regulate resource allocation within an animal group. Unlike small groups, however, detection and quantification of linear hierarchy in large groups of animals are a difficult task. Here, we analyse aggression-based dominance hierarchies formed by worker ants in Diacamma sp. as large directed networks. We show that the observed dominance networks are perfect or approximate directed acyclic graphs, which are consistent with perfect linear hierarchy. The observed networks are also sparse and random but significantly different from networks generated through thinning of the perfect linear tournament (i.e. all individuals are linearly ranked and dominance relationship exists between every pair of individuals). These results pertain to global structure of the networks, which contrasts with the previous studies inspecting frequencies of different types of triads. In addition, the distribution of the out-degree (i.e. number of workers that the focal worker attacks), not in-degree (i.e. number of workers that attack the focal worker), of each observed network is right-skewed. Those having excessively large out-degrees are located near the top, but not the top, of the hierarchy. We also discuss evolutionary implications of the discovered properties of dominance networks. © 2014 The Author(s) Published by the Royal Society. All rights reserved.
Improving resource utilization in hierarchy network by optimizing topological structure
Liu, G. L.; Peng, H. P.; Li, L. X.; Sun, F.; Yang, Y. X.
2012-02-01
We study the performance of peer-to-peer (P2P) network built on the top of hierarchy topological structure of local area networks (LAN). We find that the topological structure of the underlying physical network has significant impacts on the resource utilization of the P2P overlay network. The larger size of the physical network is, the lower resource utilization of the overlay network is. Through optimizing the topological structure of physical network, we propose two novel schemes to improve the resource utilization. The experimental results show that in any case the resource utilization of P2P network can always achieve 100% by these two schemes.
Hierarchy in directed random networks: analytical and numerical results
Mones, Enys
2012-01-01
In recent years, the theory and application of complex networks has been quickly developing in a markable way due to the increasing amount of data from real systems and to the fruitful application of powerful methods used in statistical physics. Many important characteristics of social or biological systems can be described by the study of their underlying structure of interactions. Hierarchy is one of these features that can be formulated in the language of networks. In this paper we present the analytic results on the hierarchical properties of random network models with zero correlations and also investigate the effects of different type of correlations. The behavior of hierarchy is different in the absence and the presence of the giant components. We show that the hierarchical structure can be drastically different if there are one-point correlations in the network. We also show numerical results suggesting that hierarchy does not change monotonously with the correlations and there is an optimal level of ...
Improving the hierarchy sensitivity of ICAL using neural network
Ajmi, Ali; Dev, Abhish; Nizam, Mohammad; Nayak, Nitish; Sankar, S. Uma
2017-09-01
Atmospheric neutrino experiments can determine the neutrino mass hierarchy for any value of δCP . The Iron Calorimeter (ICAL) detector at the India-based Neutrino Observatory can distinguish between the charged current interactions of νμ and {\\overline ν _π } by determining the charge of the produced muon. Hence it is particularly well suited to determine the hierarchy. The hierarchy signature is more prominent in neutrinos with energy of a few GeV and with pathlength of a few thousand kilometers, i.e. neutrinos whose direction is not close to horizontal. We use adaptive neural networks to identify such events with good efficiency and good purity. The hierarchy sensitivity, calculated from these selected events, is above 3σ level.
Next Generation Reliable Transport Networks
Zhang, Jiang
of criticality and security, there are certain physical or logical segregation requirements between the avionic systems. Such segregations can be implemented on the proposed avionic networks with different hierarchies. In order to fulfill the segregation requirements, a tailored heuristic approach for solving......This thesis focuses the efforts on ensuring the reliability of transport networks and takes advantages and experiences from the transport networks into the networks for particular purposes. Firstly, the challenges of providing reliable multicast services on Multipath Label Switching......-Transport Profile (MPLS-TP) ring networks are addressed. Through the proposed protection structure and protection switching schemes, the recovery mechanism is enhanced in terms of recovery label consumption, operation simplicity and fine traffic engineering granularity. Furthermore, the extensions for existing...
Prioritization of Integrated Bicycle Network Clusters in Istanbul Using Analytic Hierarchy Process
Dilek Çol Yılmaz
2014-06-01
Full Text Available In this study, the impact of the integration of nonmotorized transport and public transport on hypermobility was evaluated. The role of bicycle in non-motorized transportation, and its contribution to sustainable travel goals were examined. A decision support model was established in order to plan the phases of a bicycle network integrated with the public transport sytem in Istanbul Metropolitan Area. Data such as public transport routes planned for the target year 2023, locations of transfer centers, number of passengers at transfer centers, and a revised bicycle network were used as layers for the Geographic Information Systems (GIS map produced. Based on the survey data collected from the experts, Analytic Hierarchy Process (AHP which is a multi-criteria decision-making procedure that contains both qualitative and quantitative factors was used to prioritize the bicycle network clusters integrated with public transport system in Istanbul.
Clustered Hierarchy in Sensor Networks: Performance and Security
Mohammed Abuhelaleh
2009-07-01
Full Text Available Many papers have been proposed in order to increase the wireless sensor networks performance; This kind of network has limited resources, where the energy in each sensor came from a small battery that sometime is hard to be replaced or recharged. Transmission energy is the most concern part where the higher energy consumption takes place. Clustered hierarchy has been proposed in many papers; in most cases, it provides the network with better performance than other protocols. In our paper, first we discuss some of techniques,relates to this protocol, that have been proposed for energy efficiency; some of them were proposed to provide the network with more security level. Our proposal then suggests some modifications to some of these techniques to provide the network with more energy saving that should lead to high performance; also we apply our technique on an existing one that proposed to increase the security level of cluster sensor networks.
Evolvability and hierarchy in rewired bacterial gene networks
Isalan, Mark; Lemerle, Caroline; Michalodimitrakis, Konstantinos; Beltrao, Pedro; Horn, Carsten; Raineri, Emanuele; Garriga-Canut, Mireia; Serrano, Luis
2009-01-01
Sequencing DNA from several organisms has revealed that duplication and drift of existing genes have primarily molded the contents of a given genome. Though the effect of knocking out or over-expressing a particular gene has been studied in many organisms, no study has systematically explored the effect of adding new links in a biological network. To explore network evolvability, we constructed 598 recombinations of promoters (including regulatory regions) with different transcription or σ-factor genes in Escherichia coli, added over a wild-type genetic background. Here we show that ~95% of new networks are tolerated by the bacteria, that very few alter growth, and that expression level correlates with factor position in the wild-type network hierarchy. Most importantly, we find that certain networks consistently survive over the wild-type under various selection pressures. Therefore new links in the network are rarely a barrier for evolution and can even confer a fitness advantage. PMID:18421347
Organizing product innovation: hierarchy, market or triple-helix networks?
Fitjar, Rune Dahl; Gjelsvik, Martin; Rodríguez-Pose, Andrés
This paper assesses the extent to which the organization of the innovation effort in firms, as well as the geographical scale at which this effort is pursued, affects the capacity to benefit from product innovations. Three alternative modes of organization are studied: hierarchy, market and triple-helix-type networks. Furthermore, we consider triple-helix networks at three geographical scales: local, national and international. These relationships are tested on a random sample of 763 firms located in five urban regions of Norway which reported having introduced new products or services during the preceding 3 years. The analysis shows that firms exploiting internal hierarchy or triple-helix networks with a wide range of partners managed to derive a significantly higher share of their income from new products, compared to those that mainly relied on outsourcing within the market. In addition, the analysis shows that the geographical scale of cooperation in networks, as well as the type of partner used, matters for the capacity of firms to benefit from product innovation. In particular, firms that collaborate in international triple-helix-type networks involving suppliers, customers and R&D institutions extract a higher share of their income from product innovations, regardless of whether they organize the processes internally or through the network.
Spatial hierarchy and emerging typologies inside world city network
Chubarov Ilya
2015-12-01
Full Text Available The first part of the paper provides a new approach to measuring a spatial structure of world city network (WCN. Based upon the results of media- popular ‘global city rankings’ produced by several international think tanks, our calculation allowed to reveal global urban hierarchy and identify several subnetworks inside of world cities. The second part of the paper devotes to recent discussions on nature of globalization and urban macrosystems, bearing in mind ranking results. It is shown that a typological approach can provide more insights to a role of city as part of WCN from functional and relationships prospective.
Animal transportation networks.
Perna, Andrea; Latty, Tanya
2014-11-01
Many group-living animals construct transportation networks of trails, galleries and burrows by modifying the environment to facilitate faster, safer or more efficient movement. Animal transportation networks can have direct influences on the fitness of individuals, whereas the shape and structure of transportation networks can influence community dynamics by facilitating contacts between different individuals and species. In this review, we discuss three key areas in the study of animal transportation networks: the topological properties of networks, network morphogenesis and growth, and the behaviour of network users. We present a brief primer on elements of network theory, and then discuss the different ways in which animal groups deal with the fundamental trade-off between the competing network properties of travel efficiency, robustness and infrastructure cost. We consider how the behaviour of network users can impact network efficiency, and call for studies that integrate both network topology and user behaviour. We finish with a prospectus for future research.
Animal transportation networks
Perna, Andrea; Latty, Tanya
2014-01-01
Many group-living animals construct transportation networks of trails, galleries and burrows by modifying the environment to facilitate faster, safer or more efficient movement. Animal transportation networks can have direct influences on the fitness of individuals, whereas the shape and structure of transportation networks can influence community dynamics by facilitating contacts between different individuals and species. In this review, we discuss three key areas in the study of animal transportation networks: the topological properties of networks, network morphogenesis and growth, and the behaviour of network users. We present a brief primer on elements of network theory, and then discuss the different ways in which animal groups deal with the fundamental trade-off between the competing network properties of travel efficiency, robustness and infrastructure cost. We consider how the behaviour of network users can impact network efficiency, and call for studies that integrate both network topology and user behaviour. We finish with a prospectus for future research. PMID:25165598
Complexity of Public Transport Networks
LU Huapu; SHI Ye
2007-01-01
The theory of complex networks was used to classify public transport networks into public transportation route networks, public transportation transfer networks, and bus station networks. The practical significance of the network parameters was then analyzed. The public transport networks in Langfang, Jining, and Dalian were then chosen as specific research cases. The results show that the public transportation networks have the characteristics of complex networks. In addition, the urban transportation network parameters all significantly affect the accessibility, convenience, and terrorist security capability of the urban public transportation network. The results link the findings with the actual situations to explore means to solve transportation system problems.
Packet transport network in metro
Huang, Feng; Yi, Xiaobo; Zhang, Hanzheng; Gong, Ping
2008-11-01
IP packet based services such as high speed internet, IP voice and IP video will be widely deployed in telecom network, which make transport network evolution to packet transport network. Characteristics of transport network and requirements of packet transport network are analyzed, T-MPLS/MPLS-TP based PTN technology is given and it will be used in metro (access, aggregation and core) network.
Equal-Time Hierarchies for Quantum Transport Theory
Zhuang, P; Zhuang, Pengfei; Heinz, Ulrich
1998-01-01
We investigate in the equal-time formalism the derivation and truncation of infinite hierarchies of equations of motion for the energy moments of the covariant Wigner function. From these hierarchies we then extract kinetic equations for the physical distribution functions which are related to low-order energy moments, and show how to determine the higher order moments in terms of these lowest order ones. We apply the general formalism to scalar and spinor QED with classical background fields and compare with the results derived from the three-dimensional Wigner transformation method.
Extracting Hidden Hierarchies in 3D Distribution Networks
Modes, Carl D.; Magnasco, Marcelo O.; Katifori, Eleni
2016-07-01
Natural and man-made transport webs are frequently dominated by dense sets of nested cycles. The architecture of these networks, as defined by the topology and edge weights, determines how efficiently the networks perform their function. Yet, the set of tools that can characterize such a weighted cycle-rich architecture in a physically relevant, mathematically compact way is sparse. In order to fill this void, we have developed a new algorithm that rests on an abstraction of the physical "tiling" in the case of a two-dimensional network to an effective tiling of an abstract surface in 3-space that the network may be thought to sit in. Generically, these abstract surfaces are richer than the flat plane because there are now two families of fundamental units that may aggregate upon cutting weakest links—the plaquettes of the tiling and the longer "topological" cycles associated with the abstract surface itself. Upon sequential removal of the weakest links, as determined by a physically relevant edge weight, such as flow volume or capacity, neighboring plaquettes merge and a new tree graph characterizing this merging process results. The properties of this characteristic tree can provide the physical and topological data required to describe the architecture of the network and to build physical models. The new algorithm can be used for automated phenotypic characterization of any weighted network whose structure is dominated by cycles, such as mammalian vasculature in the organs or the force networks in jammed granular matter.
Spatial hierarchy and emerging typologies inside world city network
Ilya Chubarov
2015-01-01
...). Based upon the results of media- popular ‘global city rankings’ produced by several international think tanks, our calculation allowed to reveal global urban hierarchy and identify several subnetworks inside of world cities...
Rethinking Local Governance: Hierarchies and Networks in Mexican Cities
Francisco Porras
2007-10-01
Full Text Available In recent years, the literature of governance has gained relevance in public administration studies. One of its main contributions has been to propose that the use of networks in policy processes, instead of hierarchies, has modified our understanding of contemporary government. Governance literature has been produced mainly in AngloSaxon countries; nevertheless, this article argues that it has some value as a tool to explain present dynamisms in Mexican municipalities. Local networks have become more important to policymaking in Mexico and, as a result, nongovernmental actors are now more influential in some policy sectors. The article proposes that this partial shift from government to governance has increased bureaucratic fragmentation, the blurredness between the public and private spheres, and non-governmental self-organization. Defined in these broad categories, governance theoretical frameworks are useful to understand Mexican cities. Resumen: Reconsiderando la gobernanza local: Jerarquías y redes en ciudades mexicanasEn los últimos años, el enfoque teórico de la gobernanza (governance ha ganado terreno en los estudios de la administración pública. La gobernanza propone básicamente que al introducir redes (en lugar de jerarquías en los procesos de políticas públicas, se modifica el significado tradicional de lo que es el gobierno. Aunque la literatura de la gobernanza se ha generado sobre todo en países anglosajones, este artículo sostiene que posee un cierto valor para analizar los gobiernos locales de México. Las redes ahora son más importantes en los procesos de políticas públicas locales y, por consiguiente, los actores no-gubernamentales son más influyentes en algunos sectores. El artículo propone que este cambio parcial del gobierno a la gobernanza ha incrementado la fragmentación burocrática, la borrosidad entre lo público y lo privado, y la auto
Transportation Network Topologies
Holmes, Bruce J.; Scott, John
2004-01-01
A discomforting reality has materialized on the transportation scene: our existing air and ground infrastructures will not scale to meet our nation's 21st century demands and expectations for mobility, commerce, safety, and security. The consequence of inaction is diminished quality of life and economic opportunity in the 21st century. Clearly, new thinking is required for transportation that can scale to meet to the realities of a networked, knowledge-based economy in which the value of time is a new coin of the realm. This paper proposes a framework, or topology, for thinking about the problem of scalability of the system of networks that comprise the aviation system. This framework highlights the role of integrated communication-navigation-surveillance systems in enabling scalability of future air transportation networks. Scalability, in this vein, is a goal of the recently formed Joint Planning and Development Office for the Next Generation Air Transportation System. New foundations for 21st thinking about air transportation are underpinned by several technological developments in the traditional aircraft disciplines as well as in communication, navigation, surveillance and information systems. Complexity science and modern network theory give rise to one of the technological developments of importance. Scale-free (i.e., scalable) networks represent a promising concept space for modeling airspace system architectures, and for assessing network performance in terms of scalability, efficiency, robustness, resilience, and other metrics. The paper offers an air transportation system topology as framework for transportation system innovation. Successful outcomes of innovation in air transportation could lay the foundations for new paradigms for aircraft and their operating capabilities, air transportation system architectures, and airspace architectures and procedural concepts. The topology proposed considers air transportation as a system of networks, within which
HIERtalker: A default hierarchy of high order neural networks that learns to read English aloud
An, Z.G.; Mniszewski, S.M.; Lee, Y.C.; Papcun, G.; Doolen, G.D.
1988-01-01
A new learning algorithm based on a default hierarchy of high order neural networks has been developed that is able to generalize as well as handle exceptions. It learns the ''building blocks'' or clusters of symbols in a stream that appear repeatedly and convey certain messages. The default hierarchy prevents a combinatoric explosion of rules. A simulator of such a hierarchy, HIERtalker, has been applied to the conversion of English words to phonemes. Achieved accuracy is 99% for trained words and ranges from 76% to 96% for sets of new words. 8 refs., 4 figs., 1 tab.
WHY FUZZY ANALYTIC HIERARCHY PROCESS APPROACH FOR TRANSPORT PROBLEMS?
2011-01-01
The evaluation of transport projects has become increasingly complex. Different aspects have to be taken into account and the consequences of the problems are usually far reaching and the different policy alternatives are numerous and difficult to predict. Several pressure or action groups have also emerged causing an even more complex decision making process. The use of multi criteria analysis for the evaluation of transport projects has increased due to this increasing complexity of the pro...
Towards Optimal Transport Networks
Erik P. Vargo
2010-08-01
Full Text Available Our ultimate goal is to design transportation net- works whose dynamic performance metrics (e.g. pas- senger throughput, passenger delay, and insensitivity to weather disturbances are optimized. Here the fo- cus is on optimizing static features of the network that are known to directly aﬀect the network dynamics. First, we present simulation results which support a connection between maximizing the ﬁrst non-trivial eigenvalue of a network's Laplacian and superior air- port network performance. Then, we explore the ef- fectiveness of a tabu search heuristic for optimizing this metric by comparing experimental results to the- oretical upper bounds. We also consider generating upper bounds on a network's algebraic connectivity via the solution of semideﬁnite programming (SDP relaxations. A modiﬁcation of an existing subgraph extraction algorithm is implemented to explore the underlying regional structures in the U.S. airport net- work, with the hope that the resulting localized struc- tures can be optimized independently and reconnected via a "backbone" network to achieve superior network performance.
DECISION MAKING-THE ANALYTIC HIERARCHY AND NETWORK PROCESSES(AHP/ANP)
Thomas L.SAATY
2004-01-01
This is the first part of an introduction to multicriteria decision making using the Analytic Hierarchy Process (AHP) and its generalization, the Analytic Network Process (ANP). The discussion involves individual and group decisions both with the independence of the criteria from the alternatives as in the AHP and also with dependence and feedback in the entire decision structure as in the ANP. This part explains the Analytic Hierarchy Process, with examples, and presents in some detail the mathematical foundations. An exposition of the Analytic Network Process and its applications will appear in later issues of this journal.
Authority and Hierarchy within Anonymous Internet Relay Chat Networks
Stewart Kenton Bertram
2015-09-01
Full Text Available 'The protest group Anonymous has emerged as one of the most significant social movements of recent years, announcing their arrival as a globally recognized brand with regular disruptive cyber attacks and the leak of large volumes of sensitive data. Despite the obvious significance of Anonymous, to date, little academic research has been focused on what role hierarchy and internal authority play (if any within the group. Bespoke software was used to structure over 5000 examples of IRC log files, so that a base line descriptive statistical picture could be drawn, as well as a more granular enumeration of the privileges associated with individual users.'
An Efficient Hierarchy Algorithm for Community Detection in Complex Networks
Lili Zhang
2014-01-01
Full Text Available Community structure is one of the most fundamental and important topology characteristics of complex networks. The research on community structure has wide applications and is very important for analyzing the topology structure, understanding the functions, finding the hidden properties, and forecasting the time-varying of the networks. This paper analyzes some related algorithms and proposes a new algorithm—CN agglomerative algorithm based on graph theory and the local connectedness of network to find communities in network. We show this algorithm is distributed and polynomial; meanwhile the simulations show it is accurate and fine-grained. Furthermore, we modify this algorithm to get one modified CN algorithm and apply it to dynamic complex networks, and the simulations also verify that the modified CN algorithm has high accuracy too.
Cree, Johnathan Vee [Washington State Univ., Pullman, WA (United States); Delgado-Frias, Jose [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2016-03-01
Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configure the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.
The cooperative game theory of networks and hierarchies
Gilles, Robert P
2010-01-01
This book details standard concepts in cooperative game theory with applications to the analysis of social networks and hierarchical authority organizations. It covers the multi-linear extension, the Core, the Shapley value, and the cooperative potential.
A Hierarchy of Linear Threshold Models for the Spread of Political Revolutions on Social Networks
Lang, John C
2015-01-01
We study a linear threshold agent-based model (ABM) for the spread of political revolutions on social networks using empirical network data. We propose new techniques for building a hierarchy of simplified ordinary differential equation (ODE) based models that aim to capture essential features of the ABM, including effects of the actual networks, and give insight in the parameter regime transitions of the ABM. We relate the ABM and the hierarchy of models to a population-level compartmental ODE model that we proposed previously for the spread of political revolutions [1], which is shown to be mathematically consistent with the proposed ABM and provides a way to analyze the global behaviour of the ABM. This consistency with the linear threshold ABM also provides further justification a posteriori for the compartmental model of [1]. Extending concepts from epidemiological modelling, we define a basic reproduction number $R_0$ for the linear threshold ABM and apply it to predict ABM behaviour on empirical networ...
Yang Li
2016-01-01
Full Text Available Studying optimization and decision for opening electromagnetic loop networks plays an important role in planning and operation of power grids. First, the basic principle of fuzzy analytic hierarchy process (FAHP is introduced, and then an improved FAHP-based scheme evaluation method is proposed for decoupling electromagnetic loop networks based on a set of indicators reflecting the performance of the candidate schemes. The proposed method combines the advantages of analytic hierarchy process (AHP and fuzzy comprehensive evaluation. On the one hand, AHP effectively combines qualitative and quantitative analysis to ensure the rationality of the evaluation model; on the other hand, the judgment matrix and qualitative indicators are expressed with trapezoidal fuzzy numbers to make decision-making more realistic. The effectiveness of the proposed method is validated by the application results on the real power system of Liaoning province of China.
HSUPA Transport Network Congestion Control
Szilveszter Nádas
2009-01-01
Full Text Available The introduction of High Speed Uplink Packet Access (HSUPA greatly improves achievable uplink bitrate but it presents new challenges to be solved in the WCDMA radio access network. In the transport network, bandwidth reservation for HSUPA is not efficient and TCP cannot efficiently resolve congestion because of lower layer retransmissions. This paper proposes an HSUPA transport network flow control algorithm that handles congestion situations efficiently and supports Quality of Service differentiation. In the Radio Network Controller (RNC, transport network congestion is detected. Relying on the standardized control frame, the RNC notifies the Node B about transport network congestion. In case of transport network congestion, the Node B part of the HSUPA flow control instructs the air interface scheduler to reduce the bitrate of the flow to eliminate congestion. The performance analysis concentrates on transport network limited scenarios. It is shown that TCP cannot provide efficient congestion control. The proposed algorithm can achieve high end-user perceived throughput, while maintaining low delay, loss, and good fairness in the transport network.
Yuichi Yamashita
2008-11-01
Full Text Available It is generally thought that skilled behavior in human beings results from a functional hierarchy of the motor control system, within which reusable motor primitives are flexibly integrated into various sensori-motor sequence patterns. The underlying neural mechanisms governing the way in which continuous sensori-motor flows are segmented into primitives and the way in which series of primitives are integrated into various behavior sequences have, however, not yet been clarified. In earlier studies, this functional hierarchy has been realized through the use of explicit hierarchical structure, with local modules representing motor primitives in the lower level and a higher module representing sequences of primitives switched via additional mechanisms such as gate-selecting. When sequences contain similarities and overlap, however, a conflict arises in such earlier models between generalization and segmentation, induced by this separated modular structure. To address this issue, we propose a different type of neural network model. The current model neither makes use of separate local modules to represent primitives nor introduces explicit hierarchical structure. Rather than forcing architectural hierarchy onto the system, functional hierarchy emerges through a form of self-organization that is based on two distinct types of neurons, each with different time properties ("multiple timescales". Through the introduction of multiple timescales, continuous sequences of behavior are segmented into reusable primitives, and the primitives, in turn, are flexibly integrated into novel sequences. In experiments, the proposed network model, coordinating the physical body of a humanoid robot through high-dimensional sensori-motor control, also successfully situated itself within a physical environment. Our results suggest that it is not only the spatial connections between neurons but also the timescales of neural activity that act as important mechanisms
Yamashita, Yuichi; Tani, Jun
2008-11-01
It is generally thought that skilled behavior in human beings results from a functional hierarchy of the motor control system, within which reusable motor primitives are flexibly integrated into various sensori-motor sequence patterns. The underlying neural mechanisms governing the way in which continuous sensori-motor flows are segmented into primitives and the way in which series of primitives are integrated into various behavior sequences have, however, not yet been clarified. In earlier studies, this functional hierarchy has been realized through the use of explicit hierarchical structure, with local modules representing motor primitives in the lower level and a higher module representing sequences of primitives switched via additional mechanisms such as gate-selecting. When sequences contain similarities and overlap, however, a conflict arises in such earlier models between generalization and segmentation, induced by this separated modular structure. To address this issue, we propose a different type of neural network model. The current model neither makes use of separate local modules to represent primitives nor introduces explicit hierarchical structure. Rather than forcing architectural hierarchy onto the system, functional hierarchy emerges through a form of self-organization that is based on two distinct types of neurons, each with different time properties ("multiple timescales"). Through the introduction of multiple timescales, continuous sequences of behavior are segmented into reusable primitives, and the primitives, in turn, are flexibly integrated into novel sequences. In experiments, the proposed network model, coordinating the physical body of a humanoid robot through high-dimensional sensori-motor control, also successfully situated itself within a physical environment. Our results suggest that it is not only the spatial connections between neurons but also the timescales of neural activity that act as important mechanisms leading to functional
Neural basis of social status hierarchy across species.
Chiao, Joan Y
2010-12-01
Social status hierarchy is a ubiquitous principle of social organization across the animal kingdom. Recent findings in social neuroscience reveal distinct neural networks associated with the recognition and experience of social hierarchy in humans, as well as modulation of these networks by personality and culture. Additionally, allelic variation in the serotonin transporter gene is associated with prevalence of social hierarchy across species and cultures, suggesting the importance of the study of genetic factors underlying social hierarchy. Future studies are needed to determine how genetic and environmental factors shape neural systems involved in the production and maintenance of social hierarchy across ontogeny and phylogeny. Copyright Â© 2010 Elsevier Ltd. All rights reserved.
Epidemic Network Failures in Optical Transport Networks
Ruepp, Sarah Renée; Katsikas, Dimitrios; Fagertun, Anna Manolova
2013-01-01
This paper presents a failure propagation model for transport networks which are affected by epidemic failures. The network is controlled using the GMPLS protocol suite. The Susceptible Infected Disabled (SID) epidemic model is investigated and new signaling functionality of GMPLS to support epid...... epidemic failure resolution is proposed. The results provide important input to service recovery mechanisms under epidemic failures....
SLEACH: Secure Low- Energy Adaptive Clustering Hierarchy Protocol for Wireless Sensor Networks
WANG Xiao-yun; YANG Li-zhen; CHEN Ke-fei
2005-01-01
LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol is a basic clustering-based routing protocol of sensor networks. In this paper, we present the design of SLEACH, a secure extension for the LEACH protocol. We divide SLEACH into four phases and fit inexpensive cryptographic operations to each part of the protocol functionality to create an efficient, practical protocol. Then we give security analyses of SLEACH. Our security analyses show that our scheme is robust against any external attacker or compromised nodes in the sensor network
李新春; 范力军
1998-01-01
It always adopts the direct hierarchy analysis to value the exploitation conditions of surface mining areas. This way has some unavoidable shortcomings because it is mainly under theaid of experts and it is affected by the subjective thinking of the experts. This paper puts forwards a new approach that divides the whole exploitation conditions into sixteen subsidiary systems and each subsidiary system forms a neural network system. The whole decision system of exploitation conditions of surface mining areas is composed of sixteen subsidiary neural network systems. Each neural network is practiced with the data of the worksite, which is reasonable and scientific. This way will be a new decision approach for exploiting the surface mining areas.
Time signal distribution in communication networks based on synchronous digital hierarchy
Imaoka, Atsushi; Kihara, Masami
1993-01-01
A new method that uses round-trip paths to accurately measure transmission delay for time synchronization is proposed. The performance of the method in Synchronous Digital Hierarchy networks is discussed. The feature of this method is that it separately measures the initial round trip path delay and the variations in round-trip path delay. The delay generated in SDH equipment is determined by measuring the initial round-trip path delay. In an experiment with actual SDH equipment, the error of initial delay measurement was suppressed to 30ns.
Zhang, Luoying; Lear, Bridget C; Seluzicki, Adam; Allada, Ravi
2009-12-15
Circadian clocks in the brain are organized as coupled oscillators that integrate seasonal cues such as light and temperature to time daily behaviors. In Drosophila, the PIGMENT DISPERSING FACTOR (PDF) neuropeptide-expressing morning (M) and non-PDF evening (E) cells are coupled cell groups important for morning and evening behavior, respectively. Depending on day length, either M cells (short days) or E cells (long days) dictate both the morning and the evening phase, a phenomenon that we term network hierarchy. To examine the role of PDF in light-dark conditions, we examined flies lacking both the PDF receptor (PDFR) and the circadian photoreceptor CRYPTOCHROME (CRY). We found that subsets of E cells exhibit molecular oscillations antiphase to those of wild-type flies, single cry mutants, or single Pdfr mutants, demonstrating a potent role for PDF in light-mediated entrainment, specifically in the absence of CRY. Moreover, we find that the evening behavioral phase is more strongly reset by PDF(+) M cells in the absence of CRY. On the basis of our findings, we propose that CRY can gate PDF signaling to determine behavioral phase and network hierarchy.
Quantitative Efficiency Evaluation Method for Transportation Networks
Jin Qin
2014-11-01
Full Text Available An effective evaluation of transportation network efficiency/performance is essential to the establishment of sustainable development in any transportation system. Based on a redefinition of transportation network efficiency, a quantitative efficiency evaluation method for transportation network is proposed, which could reflect the effects of network structure, traffic demands, travel choice, and travel costs on network efficiency. Furthermore, the efficiency-oriented importance measure for network components is presented, which can be used to help engineers identify the critical nodes and links in the network. The numerical examples show that, compared with existing efficiency evaluation methods, the network efficiency value calculated by the method proposed in this paper can portray the real operation situation of the transportation network as well as the effects of main factors on network efficiency. We also find that the network efficiency and the importance values of the network components both are functions of demands and network structure in the transportation network.
EECHDA: Energy Efficient Clustering Hierarchy and Data Accumulation For Sensor Networks
Dilip Kumar
2010-01-01
Full Text Available A wireless sensor network with a large number of tiny sensornodes can be used as an effective tool for gathering data forvarious applications under different situations. One of themajor issues in wireless sensor network is developing anenergy–efficient routing protocol which has a significantimpact on the overall lifetime of the sensor network. Clusteringsensor nodes is an effective technique in wireless sensornetworks which can increase network energy efficiency,scalability and lifetime. In this paper, we have proposed anenergy–efficient clustering based protocol for wireless sensornetworks. We have considered a set of cluster heads for controland management of the network. On rotation basis, a clusterhead receives data from the neighboring nodes and transmitsthe aggregated data to the base station. Adopting thisapproach, Energy Efficient Clustering Hierarchy and DataAccumulation (EECHDA is better than existing protocols interms of energy consumption and network lifetime. Oursimulation results demonstrated that EECHDA is able toprolong the time interval of the death of first node in thenetwork.
HOW DO STUDENTS SELECT SOCIAL NETWORKING SITES? AN ANALYTIC HIERARCHY PROCESS (AHP MODEL
Chun Meng Tang
2015-12-01
Full Text Available Social networking sites are popular among university students, and students today are indeed spoiled for choice. New emerging social networking sites sprout up amid popular sites, while some existing ones die out. Given the choice of so many social networking sites, how do students decide which one they will sign up for and stay on as an active user? The answer to this question is of interest to social networking site designers and marketers. The market of social networking sites is highly competitive. To maintain the current user base and continue to attract new users, how should social networking sites design their sites? Marketers spend a fairly large percent of their marketing budget on social media marketing. To formulate an effective social media strategy, how much do marketers understand the users of social networking sites? Learning from website evaluation studies, this study intends to provide some answers to these questions by examining how university students decide between two popular social networking sites, Facebook and Twitter. We first developed an analytic hierarchy process (AHP model of four main selection criteria and 12 sub-criteria, and then administered a questionnaire to a group of university students attending a course at a Malaysian university. AHP analyses of the responses from 12 respondents provided an insight into the decision-making process involved in students’ selection of social networking sites. It seemed that of the four main criteria, privacy was the top concern, followed by functionality, usability, and content. The sub-criteria that were of key concern to the students were apps, revenue-generating opportunities, ease of use, and information security. Between Facebook and Twitter, the students thought that Facebook was the better choice. This information is useful for social networking site designers to design sites that are more relevant to their users’ needs, and for marketers to craft more effective
Adaptive Reliable Routing Based on Cluster Hierarchy for Wireless Multimedia Sensor Networks
Chen Min
2010-01-01
Full Text Available As a multimedia information acquisition and processing method, wireless multimedia sensor network(WMSN has great application potential in military and civilian areas. Compared with traditional wireless sensor network, the routing design of WMSN should obtain more attention on the quality of transmission. This paper proposes an adaptive reliable routing based on clustering hierarchy named ARCH, which includes energy prediction and power allocation mechanism. To obtain a better performance, the cluster structure is formed based on cellular topology. The introduced prediction mechanism makes the sensor nodes predict the remaining energy of other nodes, which dramatically reduces the overall information needed for energy balancing. ARCH can dynamically balance the energy consumption of nodes based on the predicted results provided by power allocation. The simulation results prove the efficiency of the proposed ARCH routing.
Enlightenment on Computer Network Reliability From Transportation Network Reliability
Hu Wenjun; Zhou Xizhao
2011-01-01
Referring to transportation network reliability problem, five new computer network reliability definitions are proposed and discussed. They are computer network connectivity reliability, computer network time reliability, computer network capacity reliability, computer network behavior reliability and computer network potential reliability. Finally strategies are suggested to enhance network reliability.
Transport optimization on complex networks
Danila, Bogdan; Marsh, John A; Bassler, Kevin E
2007-01-01
We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the maximum node betweenness with as little path lengthening as possible. We show that by using this optimal routing, a network can sustain significantly higher traffic without jamming than in the case of shortest path routing. A formula is proved that allows quick computation of the average number of hops along the path and of the average travel times once the betweennesses of the nodes are computed. Using this formula, we show that routing optimization preserves the small-world character exhibited by networks under shortest path routing, and that it significantly reduces the average travel time on congested networks with only a negligible increase in the average travel time at low loads. Finally, we study the correlation between the weights of the links in the case of optimal ...
Zhengyu Xie
2015-01-01
Full Text Available We consider the sensor networks hierarchical optimization problem in high-speed railway transport hub (HRTH. The sensor networks are optimized from three hierarchies which are key area sensors optimization, passenger line sensors optimization, and whole area sensors optimization. Case study on a specific HRTH in China showed that the hierarchical optimization method is effective to optimize the sensor networks for security monitoring in HRTH.
Finding modules and hierarchy in weighted financial network using transfer entropy
Yook, Soon-Hyung; Chae, Huiseung; Kim, Jinho; Kim, Yup
2016-04-01
We study the modular structure of financial network based on the transfer entropy (TE). From the comparison with the obtained modular structure using the cross-correlation (CC), we find that TE and CC both provide well organized modular structure and the hierarchical relationship between each industrial group when the time scale of the measurement is less than one month. However, when the time scale of the measurement becomes larger than one month, we find that the modular structure from CC cannot correctly reflect the known industrial classification and their hierarchy. In addition the measured maximum modularity, Qmax, for TE is always larger than that for CC, which indicates that TE is a better weight measure than CC for the system with asymmetric relationship.
A.A.M. Meuleman (Louis)
2008-01-01
textabstractWhat is modern governance? Is it the battle against "oldfashioned" hierarchy, or is it the restoration of key hierarchical values? Is it optimizing network management, or maximizing the benefits of market thinking in the publicsector? This book argues that it is the combination of all
Biological transportation networks: Modeling and simulation
Albi, Giacomo
2015-09-15
We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation and angiogenesis) and ion transportation networks (e.g., neural networks) is explained in detail and basic analytical features like the gradient flow structure of the fluid transportation network model and the impact of the model parameters on the geometry and topology of network formation are analyzed. We also present a numerical finite-element based discretization scheme and discuss sample cases of network formation simulations.
Memon, Nasrullah
2007-01-01
- Data collection is difficult to any network analysis because it is difficult to create a complete network. It is not easy to gain information on terrorist networks. It is fact that terrorist organizations do not provide information on their members and the government rarely allows researchers...... to use their intelligence data (Ressler S., 2006). Very few researchers (Krebs, V., 2002, Sageman, M., 2004 and Rodriguez, J. A., 2004) collected data from open sources, and to the best of our knowledge, no knowledge base is available in academia for the analysis of the terrorist events. To counter...... of Investigative Data Mining (IDM). In addition, we present iMiner Information Harvesting System and describe how intelligence agencies could be benefited from detecting hierarchy in non-hierarchical terrorist networks. In this paper we present results of detection of hidden hierarchy of Riyadh Bombing Terrorist...
Erick P. Massami
2016-03-01
Full Text Available Transportation is a key to the economy and social welfare; it makes mobility more accessible and enhances the social and economic interactions. On the other hand, the increase of urban population, pollution and other negative impacts has directly affected the existing transportation system in Dar es Salaam City - Tanzania. As the transportation challenges cannot be overcome simultaneously due to the scarcity of financial resources, a decision support tool is needed to prioritize these challenges. In this study, a composite model of Vague Set Theory (VST and Analytical Hierarchy Process (AHP is applied to appraise the challenges. The Vague Analytical Hierarchy Process (VAHP uses opinions of experts collected from a survey questionnaire. The computational results reveal the ranking in descending order of the urban transportation challenges as poor traffic management, inadequacy of proper public transit service and inadequacy of road transport infrastructure. The results also depict that the VAHP model is a useful decision support tool for transport planners, transport policy makers and other industry stakeholders.
Manufacturing plant location selection in logistics network using Analytic Hierarchy Process
Ping-Yu Chang
2015-11-01
Full Text Available Purpose: In recent years, numerous companies have moved their manufacturing plants to China to capitalize on lower cost and tax. Plant location has such an impact on cost, stocks, and logistics network but location selection in the company is usually based on subjective preference of high ranking managers. Such a decision-making process might result in selecting a location with a lower fixed cost but a higher operational cost. Therefore, this research adapts real data from an electronics company to develop a framework that incorporates both quantitative and qualitative factors for selecting new plant locations. Design/methodology/approach: In-depth interviews were conducted with 12 high rank managers (7 of them are department manager, 2 of them are vice-president, 1 of them is senior engineer, and 2 of them are plant manager in the departments of construction, finance, planning, production, and warehouse to determine the important factors. A questionnaire survey is then conducted for comparing factors which are analyzed using the Analytic Hierarchy Process (AHP. Findings: Results show that the best location chosen by the developed framework coincides well with the company’s primal production base. The results have been presented to the company’s high ranking managers for realizing the accuracy of the framework. Positive responses of the managers indicate usefulness of implementing the proposed model into reality, which adds to the value of this research. Practical implications: The proposed framework can save numerous time-consuming meetings called to compromise opinions and conflictions from different departments in location selection. Originality/value: This paper adapts the Analytic Hierarchy Process (AHP to incorporate quantitative and qualitative factors which are obtained through in-depth interviews with high rank managers in a company into the location decision.
Correlations, hierarchies and networks of the world’s automotive companies
Kocakaplan, Yusuf; Doğan, Şerafettin; Deviren, Bayram; Keskin, Mustafa
2013-06-01
We investigate, within the scope of econophysics, the correlations, hierarchies and networks of the world’s automotive companies over the 2003-2010 period by using the concept of a minimal spanning tree (MST) and hierarchical tree (HT). We derive a hierarchical organization and construct the MSTs and HTs for the 2003-2010 period and illustrate how the MSTs and their associated HTs developed over time. These periods are divided into two subperiods, such as 2003-2006 and 2007-2010, in order to test various time-windows and understand the temporal evolution of the correlation structure over time. We perform the bootstrap techniques to investigate a value of the statistical reliability to the links of the MSTs. We also use average linkage cluster analysis (ALCA) to observe the cluster structure more clearly in HTs. From the structural topologies of these trees, we identify different clusters of companies according to their geographical proximity and economic ties. Our results show that some companies are more important within the network, due to a tighter connection with other companies. We also find that these important companies play a predominant role in the world’s automotive industry.
Cross-Domain Shoe Retrieval with a Semantic Hierarchy of Attribute Classification Network.
Zhan, Huijing; Shi, Boxin; Kot, Alex C
2017-08-04
Cross-domain shoe image retrieval is a challenging problem, because the query photo from the street domain (daily life scenario) and the reference photo in the online domain (online shop images) have significant visual differences due to the viewpoint and scale variation, self-occlusion, and cluttered background. This paper proposes the Semantic Hierarchy Of attributE Convolutional Neural Network (SHOE-CNN) with a three-level feature representation for discriminative shoe feature expression and efficient retrieval. The SHOE-CNN with its newly designed loss function systematically merges semantic attributes of closer visual appearances to prevent shoe images with the obvious visual differences being confused with each other; the features extracted from image, region, and part levels effectively match the shoe images across different domains. We collect a large-scale shoe dataset composed of 14341 street domain and 12652 corresponding online domain images with fine-grained attributes to train our network and evaluate our system. The top-20 retrieval accuracy improves significantly over the solution with the pre-trained CNN features.
Information transport in multiplex networks
Pu, Cunlai; Yang, Xianxia; Yang, Jian
2015-01-01
In this paper, we study information transport in multiplex networks comprised of two coupled subnetworks. The upper subnetwork, called the logical layer, employs the shortest paths protocol to determine the logical paths for packets transmission, while the lower subnetwork acts as the physical layer, in which packets are delivered by the biased random walk mechanism characterized with a parameter $\\alpha$. Through simulation, we obtain the optimal $\\alpha$ corresponding to the maximum network lifetime and the maximum number of the arrival packets. Assortative coupling is better than the random coupling and the disassortative coupling, since it achieves much better transmission performances. Generally, the more homogeneous the lower subnetwork, the better the transmission performances are, which is opposite for the upper subnetwork. Finally, we propose an attack centrality for nodes based on the topological information of both subnetworks, and further investigate the transmission performances under targeted at...
Charge transport network dynamics in molecular aggregates
Jackson, Nicholas E. [Northwestern Univ., Evanston, IL (United States). Dept. of Chemistry; Chen, Lin X. [Argonne National Lab. (ANL), Argonne, IL (United States). Chemical Science and Engineering Division; Ratner, Mark A. [Northwestern Univ., Evanston, IL (United States). Dept. of Chemistry
2016-07-20
Due to the nonperiodic nature of charge transport in disordered systems, generating insight into static charge transport networks, as well as analyzing the network dynamics, can be challenging. Here, we apply time-dependent network analysis to scrutinize the charge transport networks of two representative molecular semiconductors: a rigid n-type molecule, perylenediimide, and a flexible p-type molecule, bBDT(TDPP)2. Simulations reveal the relevant timescale for local transfer integral decorrelation to be ~100 fs, which is shown to be faster than that of a crystalline morphology of the same molecule. Using a simple graph metric, global network changes are observed over timescales competitive with charge carrier lifetimes. These insights demonstrate that static charge transport networks are qualitatively inadequate, whereas average networks often overestimate network connectivity. Finally, a simple methodology for tracking dynamic charge transport properties is proposed.
Circadian Rhythms in Rho1 Activity Regulate Neuronal Plasticity and Network Hierarchy.
Petsakou, Afroditi; Sapsis, Themistoklis P; Blau, Justin
2015-08-13
Neuronal plasticity helps animals learn from their environment. However, it is challenging to link specific changes in defined neurons to altered behavior. Here, we focus on circadian rhythms in the structure of the principal s-LNv clock neurons in Drosophila. By quantifying neuronal architecture, we observed that s-LNv structural plasticity changes the amount of axonal material in addition to cycles of fasciculation and defasciculation. We found that this is controlled by rhythmic Rho1 activity that retracts s-LNv axonal termini by increasing myosin phosphorylation and simultaneously changes the balance of pre-synaptic and dendritic markers. This plasticity is required to change clock network hierarchy and allow seasonal adaptation. Rhythms in Rho1 activity are controlled by clock-regulated transcription of Puratrophin-1-like (Pura), a Rho1 GEF. Since spinocerebellar ataxia is associated with mutations in human Puratrophin-1, our data support the idea that defective actin-related plasticity underlies this ataxia. Copyright © 2015 Elsevier Inc. All rights reserved.
Su Yang; Xu Zhanqi; Zhao Ruiqin; Liu Zengji
2008-01-01
A layered network model for optical transport networks is proposed in this paper, which involves Internet Protocol (IP), Synchronous Digital Hierarchy (SDH) and Wavelength Division Multiplexing (WDM) layers. The strategy of Dynamic Joint Routing and Resource Allocation (DJRRA) and its algorithm description are also presented for the proposed layered network model. DJRRA optimizes the bandwidth usage of interface links between different layers and the logic links inside all layers. The simulation results show that DJRRA can reduce the blocking probability and increase network throughput effectively, which is in contrast to the classical separate sequential routing and resource allocation solutions.
Cytoskeletal network morphology regulates intracellular transport dynamics
Ando, David; Huang, Kerwyn Casey; Gopinathan, Ajay
2016-01-01
Intracellular transport is essential for maintaining proper cellular function in most eukaryotic cells, with perturbations in active transport resulting in several types of disease. Efficient delivery of critical cargos to specific locations is accomplished through a combination of passive diffusion and active transport by molecular motors that ballistically move along a network of cytoskeletal filaments. Although motor-based transport is known to be necessary to overcome cytoplasmic crowding and the limited range of diffusion within reasonable time scales, the topological features of the cytoskeletal network that regulate transport efficiency and robustness have not been established. Using a continuum diffusion model, we observed that the time required for cellular transport was minimized when the network was localized near the nucleus. In simulations that explicitly incorporated network spatial architectures, total filament mass was the primary driver of network transit times. However, filament traps that r...
Symmetry and Quantum Transport on Networks
Salimi, S; Soltanzadeh, M M
2011-01-01
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition probabilities between two nodes of the network. We numerically show that there is a high probability to find the walker at the initial node for CTQWs on the underlying networks due to the interference phenomenon, even for long times. To get global information (independent of the starting node) about the transport efficiency, we average the return probability over all nodes of the network. We apply the decay rate and the asymptotic value of the average of the return probability to evaluate the transport efficiency. Our numerical results prove that the existence of the symmetry in the underlying networks makes quantum transport less efficient than the classical one. In addition, we find that the increasing of the symmetry of these networks decreases the efficiency of quantum t...
Travelling hierarchies : roads in and out of slave status in a Central Malian Fulbe network
Pelckmans, L.
2011-01-01
Based on rich and wide-ranging data, the thesis describes the sensitive issue of the contemporary emancipation trajectories of agro-pastoralist Fulbe in Central Mali. It explores how people are currently dealing with hierarchies they inherited from past master-slave relations and focuses on the rela
A four-tiered hierarchy in a converged fixed-mobile architecture enabling personal networks
Baken, N.H.G.; Boven, E.F.M. van; Hartog, F.T.H. den; Hekmat, R.
2004-01-01
We present a new way of capturing the future technical infrastructure of a converged fixed-mobile infrastructure by means of a four-tiered hierarchy of one fixed and three different mobile and wireless (access) layers. With such a view, the current range of heterogeneous interconnected public and
Optimal transport on supply-demand networks.
Chen, Yu-Han; Wang, Bing-Hong; Zhao, Li-Chao; Zhou, Changsong; Zhou, Tao
2010-06-01
In the literature, transport networks are usually treated as homogeneous networks, that is, every node has the same function, simultaneously providing and requiring resources. However, some real networks, such as power grids and supply chain networks, show a far different scenario in which nodes are classified into two categories: supply nodes provide some kinds of services, while demand nodes require them. In this paper, we propose a general transport model for these supply-demand networks, associated with a criterion to quantify their transport capacities. In a supply-demand network with heterogeneous degree distribution, its transport capacity strongly depends on the locations of supply nodes. We therefore design a simulated annealing algorithm to find the near optimal configuration of supply nodes, which remarkably enhances the transport capacity compared with a random configuration and outperforms the degree target algorithm, the betweenness target algorithm, and the greedy method. This work provides a start point for systematically analyzing and optimizing transport dynamics on supply-demand networks.
Transport Network in Concept European Road
Stegaroiu Valentin
2010-12-01
Full Text Available Formation of the Single Market for services, transport, includes the right of freedom to provide services throughout the Community. Liberalization of the transporter interacts with the construction of Trans- European Networks (TENS which are generated by the process of European integration against the background of economy globalization. European Union gives priority to road transport networks into a single coherent and easy to move factors of w ealth creators, to ensure resource flows between European countries and between them and the world. This complex dynamic process and is stimulated generating factors such as opening of national borders, increased competition, etc. Transport network is localized both in the class of networks established in stages, as political decision-making networks and in networks mainly economic category (pan- European. Currently EU countries work together in committees established for each of the 10 pan-European corridors for implementation of projects for new construction or modernization of transport infrastructure, conditions for the gradual homogenization of transport in the EU. It is estimated that 2010 will mark the upper limit of the quantitative development of European transport.
Traffic Management for Next Generation Transport Networks
Yu, Hao
their network capacities. However, in order to provide more advanced video services than simply porting the traditional television services to the network, the service provider needs to do more than just augment the network capacity. Advanced traffic management capability is one of the relevant abilities...... management functions at the edge of the network, scheduling traffic on behalf of the other nodes. The topology-based hierarchical scheduling scheme is able to provide outstanding flow isolation due to its centralized scheduling ability, which is essential for providing IPTV services. In order to reduce...... the required bandwidth, multicast is favored for providing IPTV services. Currently, transport networks lack sufficient multicast abilities. With the increase of the network capacity, it is challenging to build a multicast-enabled switch for the transport network, because, from the traffic management’s...
Optimal transportation networks models and theory
Bernot, Marc; Morel, Jean-Michel
2009-01-01
The transportation problem can be formalized as the problem of finding the optimal way to transport a given measure into another with the same mass. In contrast to the Monge-Kantorovitch problem, recent approaches model the branched structure of such supply networks as minima of an energy functional whose essential feature is to favour wide roads. Such a branched structure is observable in ground transportation networks, in draining and irrigation systems, in electrical power supply systems and in natural counterparts such as blood vessels or the branches of trees. These lectures provide mathematical proof of several existence, structure and regularity properties empirically observed in transportation networks. The link with previous discrete physical models of irrigation and erosion models in geomorphology and with discrete telecommunication and transportation models is discussed. It will be mathematically proven that the majority fit in the simple model sketched in this volume.
Dominance hierarchy arising from the evolution of a complex small RNA regulatory network.
Durand, Eléonore; Méheust, Raphaël; Soucaze, Marion; Goubet, Pauline M; Gallina, Sophie; Poux, Céline; Fobis-Loisy, Isabelle; Guillon, Eline; Gaude, Thierry; Sarazin, Alexis; Figeac, Martin; Prat, Elisa; Marande, William; Bergès, Hélène; Vekemans, Xavier; Billiard, Sylvain; Castric, Vincent
2014-12-05
The prevention of fertilization through self-pollination (or pollination by a close relative) in the Brassicaceae plant family is determined by the genotype of the plant at the self-incompatibility locus (S locus). The many alleles at this locus exhibit a dominance hierarchy that determines which of the two allelic specificities of a heterozygous genotype is expressed at the phenotypic level. Here, we uncover the evolution of how at least 17 small RNA (sRNA)-producing loci and their multiple target sites collectively control the dominance hierarchy among alleles within the gene controlling the pollen S-locus phenotype in a self-incompatible Arabidopsis species. Selection has created a dynamic repertoire of sRNA-target interactions by jointly acting on sRNA genes and their target sites, which has resulted in a complex system of regulation among alleles. Copyright © 2014, American Association for the Advancement of Science.
Chen, Yanguang
2015-01-01
An analogy between the fractal nature of networks of arteries and that of systems of rivers has been drawn in the previous works. However, the deep structure of the hierarchy of blood vessels has not yet been revealed. This paper is devoted to researching the fractals, allometric scaling, and hierarchy of blood vessels. By analogy with Horton-Strahler's laws of river composition, three exponential laws have been put forward. These exponential laws can be reconstructed and transformed into three linear scaling laws, which can be named composition laws of blood vessels network. From these linear scaling laws it follows a set of power laws, including the three-parameter Zipf's law on the rank-size distribution of blood vessel length and the allometric scaling law on the length-diameter relationship of blood vessels in different orders. The models are applied to the observed data on human beings and animals early given by other researchers, and an interesting finding is that human bodies more conform to natural r...
Strategy development management of Multimodal Transport Network
Nesterova Natalia S.
2016-01-01
Full Text Available The article gives a brief overview of works on the development of transport infrastructure for multimodal transportation and integration of Russian transport system into the international transport corridors. The technology for control of the strategy, that changes shape and capacity of Multi-modal Transport Network (MTN, is considered as part of the methodology for designing and development of MTN. This technology allows to carry out strategic and operational management of the strategy implementation based on the use of the balanced scorecard.
Transportation dynamics on networks of mobile agents
Yang, Han-Xin; Xie, Yan-Bo; Lai, Ying-Cheng; Wang, Bing-Hong
2011-01-01
Most existing works on transportation dynamics focus on networks of a fixed structure, but networks whose nodes are mobile have become widespread, such as cell-phone networks. We introduce a model to explore the basic physics of transportation on mobile networks. Of particular interest are the dependence of the throughput on the speed of agent movement and communication range. Our computations reveal a hierarchical dependence for the former while, for the latter, we find an algebraic power law between the throughput and the communication range with an exponent determined by the speed. We develop a physical theory based on the Fokker-Planck equation to explain these phenomena. Our findings provide insights into complex transportation dynamics arising commonly in natural and engineering systems.
HOW DO STUDENTS SELECT SOCIAL NETWORKING SITES? AN ANALYTIC HIERARCHY PROCESS (AHP) MODEL
Chun Meng Tang; Miang Hong Ngerng
2015-01-01
Social networking sites are popular among university students, and students today are indeed spoiled for choice. New emerging social networking sites sprout up amid popular sites, while some existing ones die out. Given the choice of so many social networking sites, how do students decide which one they will sign up for and stay on as an active user? The answer to this question is of interest to social networking site designers and marketers. The market of social networking sites is highly co...
Quantum Transport Theory for Photonic Networks
Lei, Chan U
2010-01-01
In this paper, we develop a quantum transport theory to describe photonic transport in photonic networks. The photonic networks concerned in the paper consist of all-optical circuits incorporating photonic bandgap waveguides and driven resonators. The photoncurrents flowing through waveguides are entirely determined from the exact master equation of the driven resonators. The master equation of the driven resonators is obtained by explicitly eliminating all the waveguide degrees of freedom while the back-reactions between resonators and waveguides are fully taken into account. The relations between the driven photonic dynamics and photoncurrents are obtained. The quantum dissipation and quantum noise effects in photonic transport are also fully addressed. As an illustration, the theory is applied to the transport phenomena of a driven nanocavity coupled to two waveguides in photonic crystals. The controllability of photonic transport through the driven resonator is demonstrated.
Optimal urban networks via mass transportation
Buttazzo, Giuseppe; Stepanov, Eugene; Solimini, Sergio
2009-01-01
Recently much attention has been devoted to the optimization of transportation networks in a given geographic area. One assumes the distributions of population and of services/workplaces (i.e. the network's sources and sinks) are known, as well as the costs of movement with/without the network, and the cost of constructing/maintaining it. Both the long-term optimization and the short-term, "who goes where" optimization are considered. These models can also be adapted for the optimization of other types of networks, such as telecommunications, pipeline or drainage networks. In the monograph we study the most general problem settings, namely, when neither the shape nor even the topology of the network to be constructed is known a priori.
Demand and Congestion in Multiplex Transportation Networks
al-Awwad, Zeyad; Jiang, Shan; González, Marta C.
2016-01-01
Urban transportation systems are multimodal, sociotechnical systems; however, while their multimodal aspect has received extensive attention in recent literature on multiplex networks, their sociotechnical aspect has been largely neglected. We present the first study of an urban transportation system using multiplex network analysis and validated Origin-Destination travel demand, with Riyadh’s planned metro as a case study. We develop methods for analyzing the impact of additional transportation layers on existing dynamics, and show that demand structure plays key quantitative and qualitative roles. There exist fundamental geometrical limits to the metro’s impact on traffic dynamics, and the bulk of environmental accrue at metro speeds only slightly faster than those planned. We develop a simple model for informing the use of additional, “feeder” layers to maximize reductions in global congestion. Our techniques are computationally practical, easily extensible to arbitrary transportation layers with complex transfer logic, and implementable in open-source software. PMID:27657738
Hierarchical transport networks optimizing dynamic response of permeable energy-storage materials.
Nilson, Robert H; Griffiths, Stewart K
2009-07-01
Channel widths and spacing in latticelike hierarchical transport networks are optimized to achieve maximum extraction of gas or electrical charge from nanoporous energy-storage materials during charge and discharge cycles of specified duration. To address a range of physics, the effective transport diffusivity is taken to vary as a power, m , of channel width. Optimal channel widths and spacing in all levels of the hierarchy are found to increase in a power-law manner with normalized system size, facilitating the derivation of closed-form approximations for the optimal dimensions. Characteristic response times and ratios of channel width to spacing are both shown to vary by the factor 2/m between successive levels of any optimal hierarchy. This leads to fractal-like self-similar geometry, but only for m=2 . For this case of quadratic dependence of diffusivity on channel width, the introduction of transport channels permits increases in system size on the order of 10;{4} , 10;{8} , and 10;{10} , without any reduction in extraction efficiency, for hierarchies having 1, 2 and, 8 levels, respectively. However, we also find that for a given system size there is an optimum number of hierarchical levels that maximizes extraction efficiency.
Strategies for optical transport network recovery under epidemic network failures
Ruepp, Sarah Renée; Fagertun, Anna Manolova; Kosteas, Vasileios
2015-01-01
The current trend in deploying automatic control plane solutions for increased flexibility in the optical transport layer leads to numerous advantages for both the operators and the customers, but also pose challenges related to the stability of the network and its ability to operate in a robust ...... requiring recovery, which translates in improved quality of service to customers and lower recovery expenses for the network operator....
Progress in photonic transport network systems
Sato, Ken-Ichi
2002-07-01
The network paradigm is changing rapidly spurred by the dramatic increase in IP traffic and recent progress in photonic network technologies. A key requirement, enhancing the performance of existing IP-based multimedia communication networks, can be most effectively achieved by introducing optical path technologies that exploit wavelength routing. Cost effective and reliable optical cross-connection is essential. Different optical switch technologies have been proposed and tested. Among them, the PLC (Planer Lightwave Circuit) switch has demonstrated excellent performance, particularly with regard to system reliability. Network control mechanisms based on the overlay and peer model models have been developed. The presentation will highlight some of the key system technologies. To develop very large scale and robust networks, effective traffic engineering capabilities are necessary. This will be achieved through optical path control. To develop future IP-centric networks, an operation mechanism based on distributed control is important. The degree to which the necessary transport and IP routing functions are integrated will determine system cost-effectiveness. The Photonic MPLS (Multi Protocol Label Switching) router, which integrates all the functions and provides seamless operation between IP and optical layers, has been proposed and developed. The technical feasibility of a recent prototype system has been proven. Finally, some of the cutting-edge photonic transport technologies that we have recently developed are demonstrated; these technologies will enable us to achieve another level of network performance enhancement in the future.
Taming macroscopic jamming in transportation networks
Ezaki, Takahiro; Nishinari, Katsuhiro
2015-01-01
In transportation networks, a spontaneous jamming transition is often observed, e.g in urban road networks and airport networks. Because of this instability, flow distribution is significantly imbalanced on a macroscopic level. To mitigate the congestion, we consider a simple control method, in which congested nodes are closed temporarily, and investigate how it influences the overall system. Depending on the timing of the node closure and opening, and congestion level of a network, the system displays three different phases: free-flow phase, controlled phase, and deadlock phase. We show that when the system is in the controlled phase, the average flow is significantly improved, whereas when in the deadlock phase, the flow drops to zero. We study how the control method increases the network flow and obtain their transition boundary analytically.
Hub location problems in transportation networks
Gelareh, Shahin; Nickel, Stefan
2011-01-01
In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root node....... also introduce fixed cost values for Australian Post (AP) dataset....
Transport Network Technologies – Study and Testing
Bozorgebrahimi, K.; Channegowda, M.; Colmenero, A.
Following on from the theoretical research into Carrier Class Transport Network Technologies (CCTNTs) documented in DJ1.1.1, this report describes the extensive testing performed by JRA1 Task 1. The tests covered EoMPLS, Ethernet OAM, Synchronous Ethernet, PBB-TE, MPLS-TP, OTN and GMPLS...
Optimally designed quantum transport across disordered networks.
Walschaers, Mattia; Diaz, Jorge Fernandez-de-Cossio; Mulet, Roberto; Buchleitner, Andreas
2013-11-01
We establish a general mechanism for highly efficient quantum transport through finite, disordered 3D networks. It relies on the interplay of disorder with centrosymmetry and a dominant doublet spectral structure and can be controlled by the proper tuning of only coarse-grained quantities. Photosynthetic light harvesting complexes are discussed as potential biological incarnations of this design principle.
Feedback network models for quantum transport.
Gough, John
2014-12-01
Quantum feedback networks have been introduced in quantum optics as a framework for constructing arbitrary networks of quantum mechanical systems connected by unidirectional quantum optical fields, and has allowed for a system theoretic approach to open quantum optics systems. Our aim here is to establish a network theory for quantum transport systems where typically the mediating fields between systems are bidirectional. Mathematically, this leads us to study quantum feedback networks where fields arrive at ports in input-output pairs, making it a special case of the unidirectional theory where inputs and outputs are paired. However, it is conceptually important to develop this theory in the context of quantum transport theory-the resulting theory extends traditional approaches which tend to view the components in quantum transport as scatterers for the various fields, in the process allowing us to consider emission and absorption of field quanta by these components. The quantum feedback network theory is applicable to both Bose and Fermi fields, moreover, it applies to nonlinear dynamics for the component systems. We advance the general theory, but study the case of linear passive quantum components in some detail.
Particle Swarm Transport in Fracture Networks
Pyrak-Nolte, L. J.; Mackin, T.; Boomsma, E.
2012-12-01
Colloidal particles of many types occur in fractures in the subsurface as a result of both natural and industrial processes (e.g., environmental influences, synthetic nano- & micro-particles from consumer products, chemical and mechanical erosion of geologic material, proppants used in gas and oil extraction, etc.). The degree of localization and speed of transport of such particles depends on the transport mechanisms, the chemical and physical properties of the particles and the surrounding rock, and the flow path geometry through the fracture. In this study, we investigated the transport of particle swarms through artificial fracture networks. A synthetic fracture network was created using an Objet Eden 350V 3D printer to build a network of fractures. Each fracture in the network had a rectangular cross-sectional area with a constant depth of 7 mm but with widths that ranged from 2 mm to 11 mm. The overall dimensions of the network were 132 mm by 166 mm. The fracture network had 7 ports that were used either as the inlet or outlet for fluid flow through the sample or for introducing a particle swarm. Water flow rates through the fracture were controlled with a syringe pump, and ranged from zero flow to 6 ml/min. Swarms were composed of a dilute suspension (2% by mass) of 3 μm fluorescent polystyrene beads in water. Swarms with volumes of 5, 10, 20, 30 and 60 μl were used and delivered into the network using a second syringe pump. The swarm behavior was imaged using an optical fluorescent imaging system illuminated by green (525 nm) LED arrays and captured by a CCD camera. For fracture networks with quiescent fluids, particle swarms fell under gravity and remained localized within the network. Large swarms (30-60 μl) were observed to bifurcate at shallower depths resulting in a broader dispersal of the particles than for smaller swarm volumes. For all swarm volumes studied, particle swarms tended to bifurcate at the intersection between fractures. These
Haridas, Mandar; Caragea, Doina
The outgrowth of social networks in the recent years has resulted in opportunities for interesting data mining problems, such as interest or friendship recommendations. A global ontology over the interests specified by the users of a social network is essential for accurate recommendations. We propose, evaluate and compare three approaches to engineering a hierarchical ontology over user interests. The proposed approaches make use of two popular knowledge bases, Wikipedia and Directory Mozilla, to extract interest definitions and/or relationships between interests. More precisely, the first approach uses Wikipedia to find interest definitions, the latent semantic analysis technique to measure the similarity between interests based on their definitions, and an agglomerative clustering algorithm to group similar interests into higher level concepts. The second approach uses the Wikipedia Category Graph to extract relationships between interests, while the third approach uses Directory Mozilla to extract relationships between interests. Our results show that the third approach, although the simplest, is the most effective for building a hierarchy over user interests.
Evaluating transport in irregular pore networks
Klimenko, Dimitri A; Klimenko, Alexander Y; 10.1103/PhysRevE.86.011112
2012-01-01
A general approach for investigating transport phenomena in porous media is presented. This approach has the capacity to represent various kinds of irregularity in porous media without the need for excessive detail or computational effort. The overall method combines a generalized Effective Medium Approximation (EMA) with a macroscopic continuum model in order to derive a transport equation with explicit analytical expressions for the transport coefficients. The proposed form of the EMA is an anisotropic and heterogeneous extension of Kirkpatrick's EMA [Rev. Mod. Phys. 45, 574 (1973)] which allows the overall model to account for microscopic alterations in connectivity (with the locations of the pores and the orientation and length of the throat) as well as macroscopic variations in transport properties. A comparison to numerical results for randomly generated networks with different properties is given, indicating the potential for this methodology to handle cases that would pose significant difficulties to ...
An object-oriented network-transparent data transportation framework
Steinbeck, T. M.; Lindenstruth, V.; Schulz, M. W.
2002-04-01
An object-oriented data transportation framework based upon the publisher-subscriber (producer-consumer) principle has been developed that transparently incorporates a network transport mechanism independently of the underlying network technology and protocol.
Population-weighted efficiency in transportation networks
Dong, Lei; Li, Ruiqi; Zhang, Jiang; di, Zengru
2016-05-01
Transportation efficiency is critical for the operation of cities and is attracting great attention worldwide. Improving the transportation efficiency can not only decrease energy consumption, reduce carbon emissions, but also accelerate people’s interactions, which will become more and more important for sustainable urban living. Generally, traffic conditions in less-developed countries are not so good due to the undeveloped economy and road networks, while this issue is rarely studied before, because traditional survey data in these areas are scarce. Nowadays, with the development of ubiquitous mobile phone data, we can explore the transportation efficiency in a new way. In this paper, based on users’ call detailed records (CDRs), we propose an indicator named population-weighted efficiency (PWE) to quantitatively measure the efficiency of the transportation networks. PWE can provide insights into transportation infrastructure development, according to which we identify dozens of inefficient routes at both the intra- and inter-city levels, which are verified by several ongoing construction projects in Senegal. In addition, we compare PWE with excess commuting indices, and the fitting result of PWE is better than excess commuting index, which also proves the validity of our method.
Language Networks in Anophthalmia: Maintained Hierarchy of Processing in "Visual" Cortex
Watkins, Kate E.; Cowey, Alan; Alexander, Iona; Filippini, Nicola; Kennedy, James M.; Smith, Stephen M.; Ragge, Nicola; Bridge, Holly
2012-01-01
Imaging studies in blind subjects have consistently shown that sensory and cognitive tasks evoke activity in the occipital cortex, which is normally visual. The precise areas involved and degree of activation are dependent upon the cause and age of onset of blindness. Here, we investigated the cortical language network at rest and during an…
The climatogenetic factors and the transport network
Vasile MAXIM
2010-03-01
Full Text Available The article analyses the climatogenic factors and how they influence the transport system (network of the Republic of Moldova. The following climatogenetic factors were analysed: dynamic, physical-geographic, etc. as well as some specific climatic elements as the temperature of the air, cloud amount, humidity, direction and speed of the wind. As a conclusion it can be mentioned that when tracing the terrestrial transport system it is necessary to take into consideration the climatic factors which directly influence this field of human activity.
Hardy, W Reef; Moldovan, Nicanor I; Moldovan, Leni; Livak, Kenneth J; Datta; Goswami, Chirayu; Corselli, Mirko; Traktuev, Dmitry O; Murray, Iain R; Péault, Bruno; March, Keith
2017-02-24
Adipose tissue is a rich source of multipotent mesenchymal stem-like cells, located in the perivascular niche. Based on their surface markers, these have been assigned to two main categories: CD34+CD31-CD45-CD146- cells (adventitial stromal/stem cells, ASCs), and CD146+CD31-CD34-CD45- cells (pericytes, PCs). These populations display heterogeneity of unknown significance. We hypothesized that aldehyde dehydrogenase (ALDH) activity, a functional marker of primitivity, could help to better define ASC and PC subclasses. To this end, the stromal vascular fraction from a human lipoaspirate was simultaneously stained with fluorescent antibodies to CD31, CD45, CD34, and CD146 antigens and the ALDH substrate Aldefluor®, then sorted by FACS. Individual ASCs (n=67) and PCs (n=73) selected from the extremities of the ALDH-staining spectrum were transcriptionally profiled by Fluidigm single-cell quantitative PCR for a predefined set (n=429) of marker genes. To these single-cell data, we applied differential expression and principal component and clustering analysis, as well as an original gene co-expression network reconstruction algorithm. Despite the stochasticity at the single-cell level, covariation gene expression analysis yielded multiple network connectivity parameters suggesting that these perivascular progenitor cell subclasses possess the following order of maturity: i) ALDH(br) ASC (most primitive); ii) ALDH(dim) ASC; iii) ALDH(br) PC; iv) ALDH(dim) PC (least primitive). This order was independently supported by specific combinations of class-specific expressed genes and further confirmed by the analysis of associated signaling pathways. In conclusion, single-cell transcriptional analysis of four populations isolated from fat by surface markers and enzyme activity suggests a developmental hierarchy among perivascular mesenchymal stem cells supported by markers and co-expression networks. This article is protected by copyright. All rights reserved.
High capacity carrier ethernet transport networks
Rasmussen, Anders; Zhang, Jiang; Yu, Hao
2009-01-01
Ethernet as a transport technology has, up to now, lacked the features such as network layer architecture, customer separation and manageability that carriers require for wide-scale deployment. However, with the advent of PBB-TE and T-MPLS, it is now possible to use Ethernet as a transport...... technology, making the use of Ethernet as a convergence layer for Next Generation Networks a distinct possibility. Triple Play services, in particular IPTV, are expected to be a main drivers for carrier Ethernet, however, a number of challenges must be addressed including QoS enabled control plane, enhanced...... OAM functions, survivability and the increased bandwidth requirements of carrier class systems. This article provides an overview of PBB-TE and T-MPLS and demonstrates how IPTV services can be realized in the framework of Carrier Ethernet. In addition we provide a case study on performing bit error...
Towards 100 gigabit carrier ethernet transport networks
Rasmussen, Anders; Zhang, Jiang; Yu, Hao
2010-01-01
Ethernet as a transport technology has, up to now, lacked the features such as network layer architecture, customer separation and manageability that carriers require for wide-scale deployment. However, with the advent of PBB-TE and TMPLS, it is now possible to use Ethernet as a transport...... technology, making the use of Ethernet as a convergence layer for Next Generation Networks a distinct possibility. Triple Play services, in particular IPTV, are expected to be a main drivers for carrier Ethernet, however, a number of challenges must be addressed including QoS enabled control plane, enhanced...... OAM functions, survivability and the increased bandwidth requirements of carrier class systems. This article provides an overview of PBB-TE and T-MPLS and demonstrates how IPTV services can be realized in the framework of Carrier Ethernet. In addition we provide a case study on performing bit error...
Towards 100 gigabit carrier ethernet transport networks
Rasmussen, Anders; Zhang, Jiang; Yu, Hao;
2010-01-01
Ethernet as a transport technology has, up to now, lacked the features such as network layer architecture, customer separation and manageability that carriers require for wide-scale deployment. However, with the advent of PBB-TE and TMPLS, it is now possible to use Ethernet as a transport...... technology, making the use of Ethernet as a convergence layer for Next Generation Networks a distinct possibility. Triple Play services, in particular IPTV, are expected to be a main drivers for carrier Ethernet, however, a number of challenges must be addressed including QoS enabled control plane, enhanced...... OAM functions, survivability and the increased bandwidth requirements of carrier class systems. This article provides an overview of PBB-TE and T-MPLS and demonstrates how IPTV services can be realized in the framework of Carrier Ethernet. In addition we provide a case study on performing bit error...
High capacity carrier ethernet transport networks
Rasmussen, Anders; Zhang, Jiang; Yu, Hao;
2009-01-01
Ethernet as a transport technology has, up to now, lacked the features such as network layer architecture, customer separation and manageability that carriers require for wide-scale deployment. However, with the advent of PBB-TE and T-MPLS, it is now possible to use Ethernet as a transport...... technology, making the use of Ethernet as a convergence layer for Next Generation Networks a distinct possibility. Triple Play services, in particular IPTV, are expected to be a main drivers for carrier Ethernet, however, a number of challenges must be addressed including QoS enabled control plane, enhanced...... OAM functions, survivability and the increased bandwidth requirements of carrier class systems. This article provides an overview of PBB-TE and T-MPLS and demonstrates how IPTV services can be realized in the framework of Carrier Ethernet. In addition we provide a case study on performing bit error...
A Quantitative Evaluation Method for Transportation Network Efficiency
Jin Qin
2014-02-01
Full Text Available The efficiency of a transportation network is the comprehensive performance index of the network. In order to evaluate the operation situation of the transportation network objectively, the scientific quantitative evaluation method for the network efficiency is very important. In this study, a new quantitative evaluation method for transportation network efficiency is developed, which could evaluate the transportation network performance comprehensively and reasonably. The method is defined in the context of network equilibrium, which could reflect the influences of travel behavior, travel cost, travel demands and link flows, all in equilibrium state, on network efficiency. The computation results compared with a previously proposed one by numerical example, which denote that the new method can quantitatively reflect the influence on the transportation network efficiency induced by traffic flows, user behavior and network structure, which accords with the practical situation.
Structural Properties of the Brazilian Air Transportation Network.
Couto, Guilherme S; da Silva, Ana Paula Couto; Ruiz, Linnyer B; Benevenuto, Fabrício
2015-09-01
The air transportation network in a country has a great impact on the local, national and global economy. In this paper, we analyze the air transportation network in Brazil with complex network features to better understand its characteristics. In our analysis, we built networks composed either by national or by international flights. We also consider the network when both types of flights are put together. Interesting conclusions emerge from our analysis. For instance, Viracopos Airport (Campinas City) is the most central and connected airport on the national flights network. Any operational problem in this airport separates the Brazilian national network into six distinct subnetworks. Moreover, the Brazilian air transportation network exhibits small world characteristics and national connections network follows a power law distribution. Therefore, our analysis sheds light on the current Brazilian air transportation infrastructure, bringing a novel understanding that may help face the recent fast growth in the usage of the Brazilian transport network.
Topological Effects on the Performance of Transportation Networks
ZHAO Xiao-Mei; GAO Zi-You
2007-01-01
@@ We investigate the influence of the network topology on the performance (characterized by the total system cost and maximal traffic volume) of transportation networks, where the weights are not static (constant), but dynamic (a function of the flow on the link). Four classes of networks are used in the simulation, including regular networks, random networks, small-world networks and scale-free networks. The initial simulation results show that topologies play important roles on the performance of transportation networks, and random networks have better performance than other networks. Also, we find that there are distinct difference of the link flow distribution for various networks in both the distribution function form and the span between the minimum and the maximum of the link flow, explaining the difference of the performance among distinct networks. These findings will be useful in network design problems of transportation systems.
Jones, Jeff
The single celled organism Physarum polycephalum efficiently constructs and minimises dynamical nutrient transport networks resembling proximity graphs. We present a model multi-agent population which collectively approximates the network behaviours of Physarum. We demonstrate spontaneous transport network formation and evolution and show that the collective population also exhibits quasi-physical emergent properties, allowing the collective population to be considered as a virtual computing material - a synthetic plasmodium. This material is used as an unconventional method to approximate spatially represented geometry problems. We demonstrate three different methods for the construction, evolution and minimisation of Physarum-like transport networks which approximate Steiner trees, relative neighbourhood graphs, convex hulls and concave hulls. The results span the Toussaint hierarchy of proximity graphs, suggesting that the foraging and minimising behaviours of Physarum reflect interplay between maximising foraging area and minimising transport distance. The properties and behaviours of the synthetic virtual plasmodium may be useful in future physical instances of unconventional computing devices, and may also provide clues to the generation of emergent computation behaviours by Physarum.
Causal hierarchy within the thalamo-cortical network in spike and wave discharges.
Anna E Vaudano
Full Text Available BACKGROUND: Generalised spike wave (GSW discharges are the electroencephalographic (EEG hallmark of absence seizures, clinically characterised by a transitory interruption of ongoing activities and impaired consciousness, occurring during states of reduced awareness. Several theories have been proposed to explain the pathophysiology of GSW discharges and the role of thalamus and cortex as generators. In this work we extend the existing theories by hypothesizing a role for the precuneus, a brain region neglected in previous works on GSW generation but already known to be linked to consciousness and awareness. We analysed fMRI data using dynamic causal modelling (DCM to investigate the effective connectivity between precuneus, thalamus and prefrontal cortex in patients with GSW discharges. METHODOLOGY AND PRINCIPAL FINDINGS: We analysed fMRI data from seven patients affected by Idiopathic Generalized Epilepsy (IGE with frequent GSW discharges and significant GSW-correlated haemodynamic signal changes in the thalamus, the prefrontal cortex and the precuneus. Using DCM we assessed their effective connectivity, i.e. which region drives another region. Three dynamic causal models were constructed: GSW was modelled as autonomous input to the thalamus (model A, ventromedial prefrontal cortex (model B, and precuneus (model C. Bayesian model comparison revealed Model C (GSW as autonomous input to precuneus, to be the best in 5 patients while model A prevailed in two cases. At the group level model C dominated and at the population-level the p value of model C was approximately 1. CONCLUSION: Our results provide strong evidence that activity in the precuneus gates GSW discharges in the thalamo-(fronto cortical network. This study is the first demonstration of a causal link between haemodynamic changes in the precuneus -- an index of awareness -- and the occurrence of pathological discharges in epilepsy.
Broadband Traffic Forecasting in the Transport Network
Valentina Radojičić
2012-07-01
Full Text Available This paper proposes a modification of traffic forecast model generated by residential and small business (SOHO, Small Office Home Office users. The model includes forecasted values of different relevant factors and competition on broadband market. It allows forecasting the number of users for various broadband technologies and interaction impact of long-standing technologies as well as the impact of the new technology entrant on the market. All the necessary parameters are evaluated for the Serbian broadband market. The long-term forecasted results of broadband traffic are given. The analyses and evaluations performed are important inputs for the transport network resources planning.
Evaluating transport in irregular pore networks
Klimenko, Dimitri A.; Hooman, Kamel; Klimenko, Alexander Y.
2012-07-01
A general approach for investigating transport phenomena in porous media is presented. This approach has the capacity to represent various kinds of irregularity in porous media without the need for excessive detail or computational effort. The overall method combines a generalized effective medium approximation (EMA) with a macroscopic continuum model in order to derive a transport equation with explicit analytical expressions for the transport coefficients. The proposed form of the EMA is an anisotropic and heterogeneous extension of Kirkpatrick's EMA [Rev. Mod. Phys.RMPHAT0034-686110.1103/RevModPhys.45.574 45, 574 (1973)] which allows the overall model to account for microscopic alterations in connectivity (with the locations of the pores and the orientation and length of the throat) as well as macroscopic variations in transport properties. A comparison to numerical results for randomly generated networks with different properties is given, indicating the potential for this methodology to handle cases that would pose significant difficulties to many other analytical models.
层次网络中的拓扑压缩算法及性能比较%Topology Aggregation Algorithm in Hierarchy Network and Performance Comparison
杨敏; 向勇; 史美林; 陆慧梅
2002-01-01
Future Internet will be a hierarchy topology. To guarantee peer-to-peer QoS, QoS-based routing protocolwill be adopted. Considering scalability and security, topology information used by routing protocol should be com-pressed before distribution in network. Routing protocol would route the packets without knowing the complete net-work topology information. This article investigates several different topology aggregation schemes and their applica-tion area. We also compare the performance of different topology aggregation schemes under different topology struc-tures and update policies.
Anti-jamming in a fungal transport network
Hickey, Patrick C; Foshe, Sierra; Roper, Marcus
2016-01-01
Congestion limits the efficiency of transport networks ranging from highways to the internet. Fungal hyphal networks are studied as an examples of optimal biological transport networks, but the scheduling and direction of traffic to avoid congestion has not been examined. We show here that the Neurospora crassa fungal network exhibits anticongestion: more densely packed nuclei flow faster along hyphal highways, and transported nuclei self-organize into fast flowing solitons. Concentrated transport by solitons may allow cells to cycle between growing and acting as transport conduits.
Global Optimization for Transport Network Expansion and Signal Setting
Haoxiang Liu
2015-01-01
Full Text Available This paper proposes a model to address an urban transport planning problem involving combined network design and signal setting in a saturated network. Conventional transport planning models usually deal with the network design problem and signal setting problem separately. However, the fact that network capacity design and capacity allocation determined by network signal setting combine to govern the transport network performance requires the optimal transport planning to consider the two problems simultaneously. In this study, a combined network capacity expansion and signal setting model with consideration of vehicle queuing on approaching legs of intersection is developed to consider their mutual interactions so that best transport network performance can be guaranteed. We formulate the model as a bilevel program and design an approximated global optimization solution method based on mixed-integer linearization approach to solve the problem, which is inherently nnonlinear and nonconvex. Numerical experiments are conducted to demonstrate the model application and the efficiency of solution algorithm.
Inventory theory, mode choice and network structure in freight transport
Combes, F.; Tavasszy, L.A.
2016-01-01
In passenger transport, hub-and-spoke networks allow the transportation of small passenger flows with competitive frequencies, in a way that direct line networks cannot. Equivalently, in freight transport, it can be expected that small shipper-receiver flows of high added value commodities transit t
Long-Range Connections in Transportation Networks
Viana, Matheus P
2010-01-01
Since its recent introduction, the small-world effect has been identified in several important real-world systems. Frequently, it is a consequence of the existence of a few long-range connections, which dominate the original regular structure of the systems and implies each node to become accessible from other nodes after a small number of steps, typically of order $\\ell \\propto \\log N$. However, this effect has been observed in pure-topological networks, where the nodes have no spatial coordinates. In this paper, we present an alalogue of small-world effect observed in real-world transportation networks, where the nodes are embeded in a hree-dimensional space. Using the multidimensional scaling method, we demonstrate how the addition of a few long-range connections can suubstantially reduce the travel time in transportation systems. Also, we investigated the importance of long-range connections when the systems are under an attack process. Our findings are illustrated for two real-world systems, namely the L...
Kristiansen, Marianne; Bloch-Poulsen, Jørgen
2016-01-01
is to show that a participatory approach can unintentionally create new hierarchies or reinforce existing ones, thus leading to the exclusion of certain employees (or action researchers) in terms of voice and/or choice. Second, the theoretical purpose is to show how participation in OAR projects can......This article focuses on employee participation in organisational action research (OAR), presenting three examples of OAR in one private and two public organisations in Denmark, respectively. Each of these examples shows how participatory hierarchies between employees and between them and action...... researchers are constructed in OAR projects, leading in these cases to the exclusion of silent pedagogues, elderly foremen, and a critical employee. Based on these examples, the article has three mutually connected purposes, an empirical, theoretical, and methodological purpose. First, the empirical purpose...
Advances in dynamic network modeling in complex transportation systems
Ukkusuri, Satish V
2013-01-01
This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.
Mixed-state quantum transport in correlated spin networks
Ajoy, Ashok; 10.1103/PhysRevA.85.042305
2012-01-01
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be relaxed, allowing for complex coupling topologies and general initial states. Here we analyze transport in complex quantum spin networks in the maximally mixed state and derive explicit conditions that should be satisfied by propagators for perfect state transport. Using a description of the transport process as a quantum walk over the network, we show that it is necessary to phase correlate the transport processes occurring along all the possible paths in the network. We provide a Hamiltonian that achieves this correlation, and use it in a constructive method to derive engineered couplings for perfect transport in complicated network topologies.
Balancing building and maintenance costs in growing transport networks
Bottinelli, Arianna; Gherardi, Marco
2016-01-01
The costs associated to the length of links impose unavoidable constraints to the growth of natural and artificial transport networks. When future network developments can not be predicted, building and maintenance costs require competing minimization mechanisms, and can not be optimized simultaneously. Hereby, we study the interplay of building and maintenance costs and its impact on the growth of transportation networks through a non-equilibrium model of network growth. We show cost balance is a suffcient ingredient for the emergence of tradeoffs between the network's total length and transport effciency, of optimal strategies of construction, and of power-law temporal correlations in the growth history of the network. Analysis of empirical ant transport networks in the framework of this model suggests different ant species may adopt similar optimization strategies.
Travelling hierarchies : moving in and out of slave status in a Central Malian FulBe network
Pelckmans, Lotte
2011-01-01
Based on rich and wide-ranging data, this thesis describes the sensitive issue of the contemporary emancipation trajectories of agro-pastoralist Fulɓe in Central Mali. It explores how people are currently dealing with hierarchies they inherited from past master-slave relations and focuses on the rel
Travelling hierarchies: Moving in and out of slave status in a Central Malian FulBe network
Pelckmans, L.
2011-01-01
Based on rich and wide-ranging data, the thesis describes the sensitive issue of the contemporary emancipation trajectories of agro-pastoralist Fulbe in Central Mali. It explores how people are currently dealing with hierarchies they inherited from past master-slave relations and focuses on the rela
The Evolutionary Origins of Hierarchy.
Mengistu, Henok; Huizinga, Joost; Mouret, Jean-Baptiste; Clune, Jeff
2016-06-01
Hierarchical organization-the recursive composition of sub-modules-is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments). Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force-the cost of connections-promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics.
The Evolutionary Origins of Hierarchy.
Henok Mengistu
2016-06-01
Full Text Available Hierarchical organization-the recursive composition of sub-modules-is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments. Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force-the cost of connections-promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics.
The Evolutionary Origins of Hierarchy.
Henok Mengistu
2016-06-01
Full Text Available Hierarchical organization-the recursive composition of sub-modules-is ubiquitous in biological networks, including neural, metabolic, ecological, and genetic regulatory networks, and in human-made systems, such as large organizations and the Internet. To date, most research on hierarchy in networks has been limited to quantifying this property. However, an open, important question in evolutionary biology is why hierarchical organization evolves in the first place. It has recently been shown that modularity evolves because of the presence of a cost for network connections. Here we investigate whether such connection costs also tend to cause a hierarchical organization of such modules. In computational simulations, we find that networks without a connection cost do not evolve to be hierarchical, even when the task has a hierarchical structure. However, with a connection cost, networks evolve to be both modular and hierarchical, and these networks exhibit higher overall performance and evolvability (i.e. faster adaptation to new environments. Additional analyses confirm that hierarchy independently improves adaptability after controlling for modularity. Overall, our results suggest that the same force-the cost of connections-promotes the evolution of both hierarchy and modularity, and that these properties are important drivers of network performance and adaptability. In addition to shedding light on the emergence of hierarchy across the many domains in which it appears, these findings will also accelerate future research into evolving more complex, intelligent computational brains in the fields of artificial intelligence and robotics.
Anomalous motor mediated cargo transport in microtubule networks
Vandal, Steven; Macveigh-Fierro, Daniel; Shen, Zhiyuan; Lemoi, Kyle; Vidali, Luis; Ross, Jennifer; Tuzel, Erkan
Cargo transport is an important biological mechanism by which cells locomote, self-organize, and actively transport organelles. This transport is mediated by the cytoskeletal network and molecular motors; however, it is not known how network self-organization and dynamics affect these transport processes. In order to develop a mechanistic understanding of cargo transport, we use a coarse-grained Brownian dynamics model that incorporates the dynamics of these networks, as well as experimentally determined motor properties. We will test these models with two experimental systems: (1) in vitro microtubule networks with kinesin-1 motors, and quantum dot cargos on recreated microtubule networks, and (2) an excellent model organism, the moss Physcomitrella patens, in which chloroplasts are transported via the microtubule network by means of kinesin-like proteins. Phenomenological network characterizations are made, both in vivo and in vitro, and cargo motility is characterized using Mean Squared Displacement (MSD) measurements. Our simulations shed light on the role of network density and motor properties on the observed transport behavior, and improve our understanding of cargo transport in cells.
Reliability in urban public transport network assessment and design
Tahmasseby, S.
2009-01-01
This research focuses on the influence of reliability of urban public transport services on network evaluation and network design. Public transport services suffer from all kind of disturbances, varying demand patterns, weather conditions, incidents, road works, et cetera. Current practice uses all
New integrable lattice hierarchies
Pickering, Andrew [Area de Matematica Aplicada, ESCET, Universidad Rey Juan Carlos, c/ Tulipan s/n, 28933 Mostoles, Madrid (Spain); Zhu Zuonong [Departamento de Matematicas, Universidad de Salamanca, Plaza de la Merced 1, 37008 Salamanca (Spain) and Department of Mathematics, Shanghai Jiao Tong University, Shanghai 200030 (China)]. E-mail: znzhu2@yahoo.com.cn
2006-01-23
In this Letter we give a new integrable four-field lattice hierarchy, associated to a new discrete spectral problem. We obtain our hierarchy as the compatibility condition of this spectral problem and an associated equation, constructed herein, for the time-evolution of eigenfunctions. We consider reductions of our hierarchy, which also of course admit discrete zero curvature representations, in detail. We find that our hierarchy includes many well-known integrable hierarchies as special cases, including the Toda lattice hierarchy, the modified Toda lattice hierarchy, the relativistic Toda lattice hierarchy, and the Volterra lattice hierarchy. We also obtain here a new integrable two-field lattice hierarchy, to which we give the name of Suris lattice hierarchy, since the first equation of this hierarchy has previously been given by Suris. The Hamiltonian structure of the Suris lattice hierarchy is obtained by means of a trace identity formula.
Flow networks: A characterization of geophysical fluid transport
Ser-Giacomi, Enrico; Lopez, Cristobal; Hernandez-Garcia, Emilio
2014-01-01
We represent transport between different regions of a fluid domain by flow networks, constructed from the discrete representation of the Perron-Frobenius or transfer operator associated to the fluid advection dynamics. The procedure is useful to analyze fluid dynamics in geophysical contexts, as illustrated by the construction of a flow network associated to the surface circulation in the Mediterranean sea. We use network-theory tools to analyze the flow network and gain insights into transport processes. In particular we quantitatively relate dispersion and mixing characteristics, classically quantified by Lyapunov exponents, to the degree of the network nodes. A family of network entropies is defined from the network adjacency matrix, and related to the statistics of stretching in the fluid, in particular to the Lyapunov exponent field. Finally we use a network community detection algorithm, Infomap, to partition the Mediterranean network into coherent regions, i.e. areas internally well mixed, but with lit...
Palotai, Robin
2009-01-01
Complex systems are successfully reduced to interacting elements via the network concept. Transport plays a key role in the survival of networks. For example the specialized signaling cascades of cellular networks filter noise and efficiently adapt the network structure to new stimuli. However, our general understanding of transport mechanisms and signaling pathways in complex systems is yet limited. Here we summarize the key network structures involved in transport, list the solutions available to overloaded systems for relaxing their load and outline a possible method for the computational determination of signaling pathways. We highlight that in addition to hubs, bridges and the network skeleton, the overlapping modular structure is also essential in network transport. Moreover, by locating network elements in the space of overlapping network modules and evaluating their distance in this "module space", it may be possible to approximate signaling pathways computationally, which, in turn could serve the ide...
Topological Effects and Performance Optimization in Transportation Continuous Network Design
Jianjun Wu
2014-01-01
Full Text Available Because of the limitation of budget, in the planning of road works, increased efforts should be made on links that are more critical to the whole traffic system. Therefore, it would be helpful to model and evaluate the vulnerability and reliability of the transportation network when the network design is processing. This paper proposes a bilevel transportation network design model, in which the upper level is to minimize the performance of the network under the given budgets, while the lower level is a typical user equilibrium assignment problem. A new solution approach based on particle swarm optimization (PSO method is presented. The topological effects on the performance of transportation networks are studied with the consideration of three typical networks, regular lattice, random graph, and small-world network. Numerical examples and simulations are presented to demonstrate the proposed model.
Transport on Complex Networks: Flow, Jamming and Optimization
Tadic, B; Thurner, S; Tadic, Bosiljka; Thurner, Stefan
2006-01-01
Many transport processes on networks depend crucially on the underlying network geometry, although the exact relationship between the structure of the network and the properties of transport processes remain elusive. In this paper we address this question by using numerical models in which both structure and dynamics are controlled systematically. We consider the traffic of information packets that include driving, searching and queuing. We present the results of extensive simulations on two classes of networks; a correlated cyclic scale-free network and an uncorrelated homogeneous weakly clustered network. By measuring different dynamical variables in the free flow regime we show how the global statistical properties of the transport are related to the temporal fluctuations at individual nodes (the traffic noise) and the links (the traffic flow). We then demonstrate that these two network classes appear as representative topologies for optimal traffic flow in the regimes of low density and high density traff...
Uncovering transportation networks from traffic flux by compressed sensing
Tang, Si-Qi; Shen, Zhesi; Wang, Wen-Xu; Di, Zengru
2015-08-01
Transportation and communication networks are ubiquitous in nature and society. Uncovering the underlying topology as well as link weights, is fundamental to understanding traffic dynamics and designing effective control strategies to facilitate transmission efficiency. We develop a general method for reconstructing transportation networks from detectable traffic flux data using the aid of a compressed sensing algorithm. Our approach enables full reconstruction of network topology and link weights for both directed and undirected networks from relatively small amounts of data compared to the network size. The limited data requirement and certain resistance to noise allows our method to achieve real-time network reconstruction. We substantiate the effectiveness of our method through systematic numerical tests with respect to several different network structures and transmission strategies. We expect our approach to be widely applicable in a variety of transportation and communication systems.
Random representation of spatially embedded complex transportation networks
Hackl, Jürgen
2016-01-01
Random networks are increasingly used to analyse complex transportation networks, such as airline routes, roads and rail networks. So far, this research has been focused on describing the properties of the networks with the help of random networks, often without considering their spatial properties. In this article, a methodology is proposed to create random networks conserving their spatial properties. The produced random networks are not intended to be an accurate model of the real-world network being investigated, but are to be used to gain insight into the functioning of the network taking into consideration its spatial properties, which has potential to be useful in many types of analysis, e.g. estimating the network related risk. The proposed methodology combines a spatial non-homogeneous point process for vertex creation, which accounts for the spatial distribution of vertices, considering clustering effects of the network and a hybrid connection model for the edge creation. To illustrate the ability o...
Determining the Permeable Efficiency of Elements in Transport Networks
V. Svoboda
2001-01-01
Full Text Available The transport network is simulated by a directed graph. Its edges are evaluated by length (in linear units or time units, by permeability and by the cost of driving through in a transport unit. Its peaks (nodes are evaluated in terms of permeability, the time of driving through the node in time units and the cost of driving a transport unit (set through this node.For such a conception of the transport network a role of optimisation and disintegration of transport flow was formulated, defined by a number of transport units (transport sets. These units enter the network at the initial node and exit the network (or vanish at the defined node. The aim of optimization was to disintegrate the transport flow so that the permeability was not exceeded in any element of the network (edge, nod, so that the relocation of the defined transport flow was completed in a prearranged time and so that the cost of driving through the transport net between the entry and exit knots was minimal.
Modeling sediment transport in river networks
Wang, Xu-Ming; Hao, Rui; Huo, Jie; Zhang, Jin-Feng
2008-11-01
A dynamical model is proposed to study sediment transport in river networks. A river can be divided into segments by the injection of branch streams of higher rank. The model is based on the fact that in a real river, the sediment-carrying capability of the stream in the ith segment may be modulated by the undergone state, which may be erosion or sedimentation, of the i-1th and ith segments, and also influenced by that of the ith injecting branch of higher rank. We select a database about the upper-middle reach of the Yellow River in the lower-water season to test the model. The result shows that the data, produced by averaging the erosion or sedimentation over the preceding transient process, are in good agreement with the observed average in a month. With this model, the steady state after transience can be predicted, and it indicates a scaling law that the quantity of erosion or sedimentation exponentially depends on the number of the segments along the reach of the channel. Our investigation suggests that fluctuation of the stream flow due to random rainfall will prevent this steady state from occurring. This is owing to the phenomenon that the varying trend of the quantity of erosion or sedimentation is opposite to that of sediment-carrying capability of the stream.
Structural and robustness properties of smart-city transportation networks
Zhang, Zhen-Gang; Ding, Zhuo; Fan, Jing-Fang; Meng, Jun; Ding, Yi-Min; Ye, Fang-Fu; Chen, Xiao-Song
2015-09-01
The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. Project supported by the Major Projects of the China National Social Science Fund (Grant No. 11 & ZD154).
Hashem Salarzadeh Jenatabadi
2016-09-01
Full Text Available This study is an attempt to overcome the lack of reliable estimates on the willingness of Malaysian users to pay for public transportation (particularly buses through a combined analysis of a fuzzy analytical hierarchy process (F-AHP and the Taguchi method. This is a ground-breaking study in the attempt to evaluate the bus users’ satisfaction factors based on the F-AHP, and find the pattern for the users’ willingness to pay (WTP characteristic by reducing the travel time with the Taguchi application. The data were collected from the public transportation users’ intentions in Kelang Valley, Kuala Lumpur, Malaysia. The results convinced us that, for complex data, one requires flexible approaches that can adjust their combination methods to the properties of analyzed datasets. This study is interested in initiating the use of a system combination strategy to have a better understanding of the factors that motivate the public transportation users to be willing to pay for the public transportation’s fare.
Complex Quantum Networks: From Universal Breakdown to Optimal Transport
Muelken, Oliver; Galiceanu, Mircea
2015-01-01
We show that all sequentially growing networks yield the same universal behavior at the breakdown of single-particle quantum transport. For this, we study the global time-averaged transport efficiency of excitations on complex quantum networks. Further, we observe the transition to optimal transport by starting from a network with complete-graph-like sequential subgraphs and systematically reducing the number of loops. These effects are explained on the basis of the spectral properties of the network's Hamiltonian. Our theoretical considerations are supported by numerical Monte-Carlo simulations for complex quantum networks with a scale-free size distribution of sequential subgraphs and a small-world-type transition to optimal transport.
Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher
2005-01-01
This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.
Transportation dynamic on coupled networks with limited bandwidth
Li, Ming; Wang, Bing-Hong
2016-01-01
The communication networks in real world often couple with each other to save costs, which results in any network does not have a stand-alone function and efficiency. To investigate this, in this paper we propose a transportation model on two coupled networks with bandwidth sharing. We find that the free-flow state and the congestion state can coexist in the two coupled networks, and the free-flow path and congestion path can coexist in each network. Considering three bandwidth-sharing mechanisms, random, assortative and disassortative couplings, we also find that the transportation capacity of the network only depends on the coupling mechanism, and the fraction of coupled links only affects the performance of the system in the congestion state, such as the traveling time. In addition, with assortative coupling, the traffic capacity of the system will decrease significantly. However, the disassortative coupling has little influence on the transportation capacity of the system, which provides a good strategy t...
The vulnerability of the global container shipping network to targeted link disruption
Viljoen, NM
2016-11-01
Full Text Available Using complex network theory to describe the relational geography of maritime networks has provided great insights regarding their hierarchy and evolution over the past two decades. Unlike applications in other transport fields, notably air...
Transport efficiency in topologically disordered networks with environmentally induced diffusion
Schijven, Petrus; Blumen, Alexander; Muelken, Oliver
2011-01-01
We study transport in topologically disordered networks that are subjected to an environment that induces classical diffusion. The dynamics is phenomenologically described within the framework of the recently introduced quantum stochastic walk, allowing to study the crossover between coherent transport and purely classical diffusion. We find that the coupling to the environment removes all effects of localization and quickly leads to classical transport. Furthermore, we find that on the level of the transport efficiency, the system can be well described by reducing it to a two-node network (a dimer).
Glamočanin, D.
2017-05-01
In order to maintain the continuity of the telecom operators’ network construction, while monitoring development needs, increasing customers’ demands and application of technological improvements, it is necessary to migrate optical transport core network to the next generation networks - Carrier Grade Ethernet Optical Transport Network (OTN CE). The primary objective of OTN CE is to realize an environment that is based solely on the switching in the optical domain, i.e. the realization of transparent optical networks and optical switching to the second layer of ISO / OSI model. The realization of such a network provides opportunities for further development of existing, but also technologically more demanding, new services. It is also a prerequisite to provide higher scalability, reliability, security and quality of QoS service, as well as prerequisites for the establishment of SLA (Service Level Agreement) for existing services, especially traffic in real time. This study aims to clarify the proposed model, which has the potential to be eventually adjusted in accordance with new scientific knowledge in this field as well as market requirements.
Computer-Supported Modelling of Multi modal Transportation Networks Rationalization
Ratko Zelenika
2007-09-01
Full Text Available This paper deals with issues of shaping and functioning ofcomputer programs in the modelling and solving of multimoda Itransportation network problems. A methodology of an integrateduse of a programming language for mathematical modellingis defined, as well as spreadsheets for the solving of complexmultimodal transportation network problems. The papercontains a comparison of the partial and integral methods ofsolving multimodal transportation networks. The basic hypothesisset forth in this paper is that the integral method results inbetter multimodal transportation network rationalization effects,whereas a multimodal transportation network modelbased on the integral method, once built, can be used as the basisfor all kinds of transportation problems within multimodaltransport. As opposed to linear transport problems, multimodaltransport network can assume very complex shapes. This papercontains a comparison of the partial and integral approach totransp01tation network solving. In the partial approach, astraightforward model of a transp01tation network, which canbe solved through the use of the Solver computer tool within theExcel spreadsheet inteiface, is quite sufficient. In the solving ofa multimodal transportation problem through the integralmethod, it is necessmy to apply sophisticated mathematicalmodelling programming languages which supp01t the use ofcomplex matrix functions and the processing of a vast amountof variables and limitations. The LINGO programming languageis more abstract than the Excel spreadsheet, and it requiresa certain programming knowledge. The definition andpresentation of a problem logic within Excel, in a manner whichis acceptable to computer software, is an ideal basis for modellingin the LINGO programming language, as well as a fasterand more effective implementation of the mathematical model.This paper provides proof for the fact that it is more rational tosolve the problem of multimodal transportation networks by
Comparative Traffic Performance Analysis of Urban Transportation Network Structures
Amini, Behnam; Mojarradi, Morteza; Derrible, Sybil
2015-01-01
The network structure of an urban transportation system has a significant impact on its traffic performance. This study uses network indicators along with several traffic performance measures including speed, trip length, travel time, and traffic volume, to compare a selection of seven transportation networks with a variety of structures and under different travel demand conditions. The selected network structures are: modified linear, branch, grid, 3-directional grid, 1-ring web, 2-ring web, and radial. For the analysis, a base origin-destination matrix is chosen, to which different growth factors are applied in order to simulate various travel demand conditions. Results show that overall the 2-ring web network offers the most efficient traffic performance, followed by the grid and the 1-ring networks. A policy application of this study is that the branch, 3-directional grid, and radial networks are mostly suited for small cities with uncongested traffic conditions. In contrast, the 2-ring web, grid, and 1-r...
A distributed wireless sensor network system for transportation safety and security
Chowdhury, Mashrur; Wang, Kuang-Ching; Fries, Ryan; Ma, Yongchang; Bagaria, Devang
2007-04-01
Given the anticipated increases in highway traffic, the scale and complexity of the traffic infrastructure will continue to grow progressively in time and in distributed geographical areas. To assure transportation efficiency, safety, and security in the presence of such growth, it is critical to identify an infrastructure development methodology that can adapt to expansions while assuring reliable operation for both centralized monitoring and distributed management. In this paper, a wireless sensor network design methodology is presented, aimed at providing effective distributed surveillance, anomaly detection, and coordinated response. The proposed methodology integrates state-of-the-art traffic sensors, with flexibly programmable controller devices that can integrate with the available traffic control equipments. The system methodology provides a paradigm in which sensors and controllers can be progressively incorporated and programmed to autonomously coordinate with peer sensors and a hierarchy of controllers to detect, notify, and react to anomalous events. Since the system can tolerate failure of parts of the system, as the network connectivity continues to increase, the proposed sensor network will have positive implications on evacuation plans during natural disasters or terrorist attacks. To illustrate the design methodology and usage, a simulated system along a freeway corridor in South Carolina was constructed in an integrated microscopic traffic and wireless sensor network simulation platform, in which distributed incident detection and response functions were implemented. The test results, including detection and false alarm rates and wireless communication latencies, are analyzed to identify insights of the system's operation and potential enhancement strategies.
Optimal traffic control in highway transportation networks using linear programming
Li, Yanning
2014-06-01
This article presents a framework for the optimal control of boundary flows on transportation networks. The state of the system is modeled by a first order scalar conservation law (Lighthill-Whitham-Richards PDE). Based on an equivalent formulation of the Hamilton-Jacobi PDE, the problem of controlling the state of the system on a network link in a finite horizon can be posed as a Linear Program. Assuming all intersections in the network are controllable, we show that the optimization approach can be extended to an arbitrary transportation network, preserving linear constraints. Unlike previously investigated transportation network control schemes, this framework leverages the intrinsic properties of the Halmilton-Jacobi equation, and does not require any discretization or boolean variables on the link. Hence this framework is very computational efficient and provides the globally optimal solution. The feasibility of this framework is illustrated by an on-ramp metering control example.
Universality at Breakdown of Quantum Transport on Complex Networks.
Kulvelis, Nikolaj; Dolgushev, Maxim; Mülken, Oliver
2015-09-18
We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by the time-averaged return probability. For treelike networks, we show analytically that a transition from efficient to inefficient transport occurs depending on the (average) functionality of the nodes of the network. In the infinite system size limit, this transition can be characterized by an exponent which is universal for all treelike networks. Our findings are corroborated by analytic results for specific deterministic networks, dendrimers and Vicsek fractals, and by Monte Carlo simulations of iteratively built scale-free trees.
Cities and transport networks in shipping and logistics research
Ducruet, César; Lugo, Igor
2013-01-01
International audience; While shipping and logistics studies often describe the flows and networks on the level of firms and terminals rather than cities, urban studies pay limited attention to transport infrastructure and material flows. The renewal of network analysis based on complex systems will be discussed in this paper as a potential bridge between those two approaches. It particularly focuses on how transport and urban elements can be mutually integrated. The main conclusion points at...
Offset Trace-Based Video Quality Evaluation Network Transport
Seeling, P.; Reisslein, M.; Fitzek, Frank
2006-01-01
after networking transport that includes losses and delays. In this work, we provide (i) an overview of frame dependencies that have to be taken into consideration when working with video traces, (ii) an algorithmic approach to combine traditional video traces and offset distortion traces to determine...... the video quality or distortion after lossy network transport, (iii) offset distortion and quality characteristics and (iv) the offset distortion trace format and tools to create offset distortion traces....
Ernst, Erik
2003-01-01
. Finally, it must be possible to write generic code that works on every hierarchy derived from the hierarchy for which it was written. This paper presents a language design that supports such a notion of higher-order hierarchies. It has been implemented in context of a full-fledged, statically typed...... be possible to create hierarchies incrementally based on existing hierarchies, such that commonalities are expressed via reuse, not duplication. Second, the hierarchies must themselves be organized into hierarchies, such that their relationships are made explicit and can be exploited in a type safe manner...... language....
Flexible Transport Network Expansion via Open WDM Interfaces
Fagertun, Anna Manolova; Skjoldstrup, Bjarke
2013-01-01
This paper presents a successful test-bed implementation of a multi-vendor transport network interconnection via open WDM interfaces. The concept of applying Alien Wavelengths (AWs) for network expansion was successfully illustrated via deployment of multi-domain/multi-vendor end-to-end OTN servi...
TRISNET; a Network of Transportation Information Services and Activities.
Department of Transportation, Washington, DC. Office of the Assistant Secretary for Systems Development and Technology.
A national Transportation Research Information Services Network (TRISNET) is being developed by the Department of Transportation (DOT) linking libraries, data bases, and retrieval services with DOT information activities. Core services provide switch and referral, indexing and abstracting, online retrieval, and document delivery. (JY)
A GIS Tool for simulating Nitrogen transport along schematic Network
Tavakoly, A. A.; Maidment, D. R.; Yang, Z.; Whiteaker, T.; David, C. H.; Johnson, S.
2012-12-01
An automated method called the Arc Hydro Schematic Processor has been developed for water process computation on schematic networks formed from the NHDPlus and similar GIS river networks. The sechemtaic network represents the hydrologic feature on the ground and is a network of links and nodes. SchemaNodes show hydrologic features, such as catchments or stream junctions. SchemaLinks prescripe the connections between nodes. The schematic processor uses the schematic network to pass informatin through a watershed and move water or pollutants dwonstream. In addition, the schematic processor has a capability to use additional programming applied to the passed and/or received values and manipulating data trough network. This paper describes how the schemtic processor can be used to simulate nitrogen transport and transformation on river networks. For this purpose the nitrogen loads is estimated on the NHDPlus river network using the Schematic Processor coupled with the river routing model for the Texas Gulf Coast Hydrologic Region.
Network Performance Improvement under Epidemic Failures in Optical Transport Networks
Fagertun, Anna Manolova; Ruepp, Sarah Renée
2013-01-01
. First we identify the most vulnerable and the most strategic nodes in the network. Then, via extensive simulations we show that strategic placement of resources for improved failure recovery has better performance than randomly assigning lower repair times among the network nodes. Our OPNET simulation...
Bazylak, A; Markicevic, B; Sinton, D; Djilali, N
2008-01-01
Pore network modelling has traditionally been used to study displacement processes in idealized porous media related to geological flows, with applications ranging from groundwater hydrology to enhanced oil recovery. Very recently, pore network modelling has been applied to model the gas diffusion layer (GDL) of a polymer electrolyte membrane (PEM) fuel cell. Discrete pore network models have the potential to elucidate transport phenomena in the GDL with high computational efficiency, in contrast to continuum or molecular dynamics modelling that require extensive computational resources. However, the challenge in studying the GDL with pore network modelling lies in defining the network parameters that accurately describe the porous media as well as the conditions of fluid invasion that represent realistic transport processes. In this work, we discuss the first stage of developing and validating a GDL-representative pore network model. We begin with a two-dimensional pore network model with a single mobile pha...
Analysis of the Chinese provincial air transportation network
Du, Wen-Bo; Liang, Bo-Yuan; Hong, Chen; Lordan, Oriol
2017-01-01
The air transportation system is of a great impact on the economy and globalization of a country. In this paper, we analyze the Chinese air transportation network (ATN) from a provincial perspective via the complex network framework, where all airports located in one province are abstracted as a single node and flights between two provinces are denoted by a link. The results show that the network exhibits small-world property, homogeneous structure and disassortative mixing. The variation of the flight flow within 24 h is investigated and an obvious tide phenomenon is found in the dynamics of Chinese provincial ATN for high output level of tertiary industry. Our work will offer a novel approach for understanding the characteristic of the Chinese air transportation network.
Stability Analysis of Transportation Networks with Multiscale Driver Decisions
Como, Giacomo; Acemoglu, Daron; Dahleh, Munther A; Frazzoli, Emilio
2011-01-01
Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers' route choices are influenced by information at multiple temporal and spatial scales. The considered model involves a continuum of indistinguishable drivers commuting between a common origin/destination pair in an acyclic transportation network. The drivers' route choices are affected by their, relatively infrequent, perturbed best responses to global information about the current network congestion levels, as well as their instantaneous local observation of the immediate surroundings as they transit through the network. A novel model is proposed for the drivers' route choice behavior, exhibiting local consistency with their preference toward globally less congested paths as well as myopic decisions in favor of locally less congested paths. The simultaneous evolution of the traffic congestion on the network and of the aggregate path preference is modeled by a system of coupled ordinary differential equations...
Topology and energy transport in networks of interacting photosynthetic complexes
Allegra, Michele
2012-01-01
We take inspiration from light-harvesting networks present in purple bacteria and simulate an incoherent dissipative energy transfer process on more general and abstract networks, considering both regular structures (Cayley trees and hyperbranched fractals) and randomly-generated ones. We focus on the the two primary light harvesting complexes of purple bacteria, i.e. the LH1 and LH2, and we use network-theoretical centrality measures in order to select different LH1 arrangements. We show that different choices cause significant differences in the transport efficiencies, and that for regular networks centrality measures allow to identify arrangements that ensure transport efficiencies which are better than those obtained with a random disposition of the complexes. The optimal arrangements strongly depend on the dissipative nature of the dynamics and on the topological properties of the networks considered, and depending on the latter they are achieved by using global vs. local centrality measures. Finally, we...
Information slows down hierarchy growth
Czaplicka, Agnieszka; Minano, Borja; Trias, Miquel; Holyst, Janusz A
2013-01-01
We consider models of a growing tree with the growth process driven by the rules of tournament selection, where a new node is attached to a contestant node at the best hierarchy level (closest to the tree root). The proposed evolution reflects limited information about the network topology that is available for new nodes. Two cases are considered: the constant tournament (CT) model where the number of tournament participants is constant throughout the tree evolution, and the proportional tournament (PT) model where it is grows proportionally to the actual tree size. The results of analytical calculations based on a rate equation fit well to numerical simulations for both models. In the CT model all hierarchy levels emerge in the tree but the birth time of the hierarchy level increases exponentially or faster with level number. The number of nodes at the first hierarchy level (just below the root) grows logarithmically in time, while the size of the last, "worst" hierarchy level oscillates quasi log-periodical...
陈小君
2015-01-01
大都市区轨道交通网络在新型城镇化、工业化、运输化快速推进过程中的基础作用毋庸置疑。而针对目前我国大都市区轨道交通网络结构演进过程中存在服务半径与大都市区交通需求分布不一致的问题，应重视从协同发展视角而非等级视角来明晰轨道交通网络结构中线路与节点的转变内容及特征，重新确立市郊铁路及重要节点在我国大都市区轨道交通网络结构演进过程中的地位与作用，补充完善我国大都市区轨道交通网络结构演变的指标内容，以期推进我国大都市区轨道交通网络演进过程的顺利进行。%Metropolitan rail transit network plays a foundational role in promoting the fast development of new-type urbanization ,industrialization and transportation .In response to the inconsistency between the service radius and the distribution of metropolitan transportation needs the evolution of metropolitan rail transit network in China ,this paper argues that the perspective of synergy rather than that of hierarchy shall be taken to fulfill three purposes ,namely ,to clarify the transformation and features of the lines and the nodes in rail transit network ,to re-establish the status and functions of suburban railway and important nodes and to complete the index system of the structural evolution of metropolitan rail transit network .It is hoped thus the evolution of metropolitan rail transit network in China can be promoted .
Heuristic urban transportation network design method, a multilayer coevolution approach
Ding, Rui; Ujang, Norsidah; Hamid, Hussain bin; Manan, Mohd Shahrudin Abd; Li, Rong; Wu, Jianjun
2017-08-01
The design of urban transportation networks plays a key role in the urban planning process, and the coevolution of urban networks has recently garnered significant attention in literature. However, most of these recent articles are based on networks that are essentially planar. In this research, we propose a heuristic multilayer urban network coevolution model with lower layer network and upper layer network that are associated with growth and stimulate one another. We first use the relative neighbourhood graph and the Gabriel graph to simulate the structure of rail and road networks, respectively. With simulation we find that when a specific number of nodes are added, the total travel cost ratio between an expanded network and the initial lower layer network has the lowest value. The cooperation strength Λ and the changeable parameter average operation speed ratio Θ show that transit users' route choices change dramatically through the coevolution process and that their decisions, in turn, affect the multilayer network structure. We also note that the simulated relation between the Gini coefficient of the betweenness centrality, Θ and Λ have an optimal point for network design. This research could inspire the analysis of urban network topology features and the assessment of urban growth trends.
A computational study of routing algorithms for realistic transportation networks
Jacob, R.; Marathe, M.V.; Nagel, K.
1998-12-01
The authors carry out an experimental analysis of a number of shortest path (routing) algorithms investigated in the context of the TRANSIMS (Transportation Analysis and Simulation System) project. The main focus of the paper is to study how various heuristic and exact solutions, associated data structures affected the computational performance of the software developed especially for realistic transportation networks. For this purpose the authors have used Dallas Fort-Worth road network with very high degree of resolution. The following general results are obtained: (1) they discuss and experimentally analyze various one-one shortest path algorithms, which include classical exact algorithms studied in the literature as well as heuristic solutions that are designed to take into account the geometric structure of the input instances; (2) they describe a number of extensions to the basic shortest path algorithm. These extensions were primarily motivated by practical problems arising in TRANSIMS and ITS (Intelligent Transportation Systems) related technologies. Extensions discussed include--(i) time dependent networks, (ii) multi-modal networks, (iii) networks with public transportation and associated schedules. Computational results are provided to empirically compare the efficiency of various algorithms. The studies indicate that a modified Dijkstra`s algorithm is computationally fast and an excellent candidate for use in various transportation planning applications as well as ITS related technologies.
Bus transport network model with ideal n-depth clique network topology
Yang, Xu-Hua; Chen, Guang; Sun, Bao; Chen, Sheng-Yong; Wang, Wan-Liang
2011-11-01
We propose an ideal n-depth clique network model. In this model, the original network is composed of cliques (maximal complete subgraphs) that overlap with each other. The network expands continuously by the addition of new cliques. The final diameter of the network can be set in advance, namely, it is controllable. Assuming that the diameter of the network is n, the network exhibits a logistic structure with (n+1) layers. In this structure, the 0th layer represents the original network and each node of the (m)th layer (1≤m≤n) corresponds to a clique in the (m-1)th layer. In the growth process of the network, we ensure that any (m)th layer network is composed of overlapping cliques. Any node in an (m)th layer network corresponds to an m-depth community in the original network, and the diameter of an m-depth community is m. Therefore, the (n-1)th layer network will contain only one clique, the (n)th layer network will contain only one node, and the diameter of the corresponding original network is n. Then an ideal n-depth clique network will be obtained. Based on the ideal n-depth clique network model, we construct a bus transport network model with an ideal n-depth clique network topology (ICNBTN). Moreover, our study compares this model with the real bus transport network (RealBTN) of three major cities in China and a recently introduced bus transport network model (BTN) whose network properties correspond well with those of real BTNs. The network properties of the ICNBTN are much closer to those of the RealBTN than those of the BTN are. At the same time, the ICNBTN has higher clustering extent of bus routes, smaller network diameter, which corresponds to shorter maximum transfer times in a bus network, and lower average shortest path time coefficient than the BTN and the RealBTN. Therefore, the ICNBTN can achieve higher transfer efficiency for a bus transport system.
Wagner, Edward Dishman
2002-01-01
This paper compares two technologies, Public Key Infrastructure (PKI) and Virtual Private Network (VPN). PKI and VPN are two approaches currently in use to resolve the problem of securing data in computer networks. Making this comparison difficult is the lack of available data. Additionally, an organization will make their decision based on circumstances unique to their information security needs. Therefore, this paper will illustrate a method using a utility function and the Analytic Hie...
Analyzing competition in intermodal freight transport networks
Saeedi, Hamid; Wiegmans, Bart; Behdani, Behzad; Zuidwijk, Rob
2017-01-01
To cope with an intense and competitive environment, intermodal freight transport operators have increasingly adopted business practices —like horizontal and vertical business integration—which aim to reduce the operational costs, increase the profit margins, and improve their competitive position
Impulse Artificial Neural Networks in Internal Transport
Ochelska-Mierzejewska Joanna
2014-06-01
Full Text Available The second most important function of a warehouse, apart from the storing of goods, is internal transport with a focus on time-effectiveness. When there is a time gap between the production and export of products, the goods need to be stored until they are dispatched to the consumers. An important problem that concerns both large and small warehouses is the selection of priorities, that is handling the tasks in order of importance. Another problem is to identify the most efficient routes for forklift trucks to transport goods from a start-point to a desired destination and prevent the routes from overlapping. In automated warehouses, the transport of objects (the so called pallets of goods is performed by machines controlled by a computer instead of a human operator. Thus, it is the computer, not the man, that makes the difficult decisions regarding parallel route planning, so that the materials are transported within the warehouse in near-optimal time. This paper presents a method for enhancing this process.
Sahoo, Nilamani; Narasimhan, Arunn; Dhar, Purbarun; Das, Sarit K
2017-07-09
Comprehending the mechanism of thermal transport through biological tissues is an important factor for optimal ablation of cancerous tissues and minimising collateral tissue damage. The present study reports detailed mapping of the rise in internal temperature within the tissue mimics due to NIR (1064 nm) laser irradiation, both for bare mimics and with gold nanostructures infused. Gold nanostructures such as mesoflowers and nanospheres have been synthesised and used as photothermal converters to enhance the temperature rise, resulting in achieving the desired degradation of malignant tissue in targeted region. Thermal history was observed experimentally and simulated considering non-Fourier dual phase lag (DPL) model incorporated Pennes bio-heat transfer equation using COMSOL Multiphysics software. The gross deviation in temperature i.e. rise from the classical Fourier model for bio-heat conduction suggests additional effects of temperature rise on the secondary structures and morphological and physico-chemical changes to the collagen ultrastructures building the tissue mass. The observed thermal denaturation in the collagen fibril morphologies have been explained based on the physico-chemical structure of collagen and its response to thermal radiation. The large shift in frequency of amides A and B is pronounced at a depth of maximum temperature rise compared with other positions in tissue phantom. Observations for change in band of amide I, amide II, and amide III are found to be responsible for damage to collagen ultra-structure. Variation in the concentration of gold nanostructures shows the potentiality of localised hyperthermia treatment subjected to NIR radiation through a proposed free radical mechanism.
Breakdown in traffic networks fundamentals of transportation science
Kerner, Boris S
2017-01-01
This book offers a detailed investigation of breakdowns in traffic and transportation networks. It shows empirically that transitions from free flow to so-called synchronized flow, initiated by local disturbances at network bottlenecks, display a nucleation-type behavior: while small disturbances in free flow decay, larger ones grow further and lead to breakdowns at the bottlenecks. Further, it discusses in detail the significance of this nucleation effect for traffic and transportation theories, and the consequences this has for future automatic driving, traffic control, dynamic traffic assignment, and optimization in traffic and transportation networks. Starting from a large volume of field traffic data collected from various sources obtained solely through measurements in real world traffic, the author develops his insights, with an emphasis less on reviewing existing methodologies, models and theories, and more on providing a detailed analysis of empirical traffic data and drawing consequences regarding t...
Network bipartivity and the transportation efficiency of European passenger airlines
Estrada, Ernesto; Gómez-Gardeñes, Jesús
2016-06-01
The analysis of the structural organization of the interaction network of a complex system is central to understand its functioning. Here, we focus on the analysis of the bipartivity of graphs. We first introduce a mathematical approach to quantify bipartivity and show its implementation in general and random graphs. Then, we tackle the analysis of the transportation networks of European airlines from the point of view of their bipartivity and observe significant differences between traditional and low cost carriers. Bipartivity shows also that alliances and major mergers of traditional airlines provide a way to reduce bipartivity which, in its turn, is closely related to an increase of the transportation efficiency.
Molecular transport network security using multi-wavelength optical spins.
Tunsiri, Surachai; Thammawongsa, Nopparat; Mitatha, Somsak; Yupapin, Preecha P
2016-01-01
Multi-wavelength generation system using an optical spin within the modified add-drop optical filter known as a PANDA ring resonator for molecular transport network security is proposed. By using the dark-bright soliton pair control, the optical capsules can be constructed and applied to securely transport the trapped molecules within the network. The advantage is that the dark and bright soliton pair (components) can securely propagate for long distance without electromagnetic interference. In operation, the optical intensity from PANDA ring resonator is fed into gold nano-antenna, where the surface plasmon oscillation between soliton pair and metallic waveguide is established.
Memon, Nasrullah
2007-01-01
- Data collection is difficult to any network analysis because it is difficult to create a complete network. It is not easy to gain information on terrorist networks. It is fact that terrorist organizations do not provide information on their members and the government rarely allows researchers...... to use their intelligence data (Ressler S., 2006). Very few researchers (Krebs, V., 2002, Sageman, M., 2004 and Rodriguez, J. A., 2004) collected data from open sources, and to the best of our knowledge, no knowledge base is available in academia for the analysis of the terrorist events. To counter...... the information scarcity, we at Software Intelligence Security Research Center, Aalborg University Esbjerg Denmark designed and developed terrorism knowledge base by harvesting information from authenticated websites. In this paper we discuss data collection and analysis results on our on-going research...
Operational performance of the primary transport telecommunication network of Ukraine
Bondarenko O. V.
2013-12-01
Full Text Available The paper presents statistical data on the number, nature and causes of the damage to underground fiber-optic communication lines, on which the transport telecommunication primary network is based, using an example of Donetsk and Lugansk regions for the period between 2001 and 2010. Comparison of these characteristics with the values of similar parameters over 2001—2005 allows to develop recommendations for the improvement of the reliability of telecommunication networks.
Secure Media Independent Handover Message Transport in Heterogeneous Networks
Cho Choong-Ho; Leung VictorCM; Won Jeong-Jae; Vadapalli Murahari
2009-01-01
The IEEE 802.21 framework for Media Independent Handover (MIH) provides seamless vertical handover support for multimode mobile terminals. MIH messages are exchanged over various wireless media between mobile terminals and access networks to facilitate seamless handover. This calls for the need to secure MIH messages against network security threats in the wireless medium. In this paper, we first analyze IPSec/IKEv2 and DTLS security solution for secure MIH message transport. We show that ha...
COMPUTER NETWORK SECURITY ASSESSMENT WITH FUZZY ANALYTIC HIERARCHY PROCESS%基于模糊层次分析法的计算机网络安全评价
费军; 余丽华
2011-01-01
The hierarchy model of computer network security assessment was constructed in light of the characteristics of computer network and the factors influencing the network security. The fuzzy analytic hierarchy process based on triangular fuzzy numbers was applied to assess the network security comprehensively and quantitatively. Computation results of example indicate that the fuzzy analytic hierarchy process is suitable for quantitative integration of qualitative judgement, and it provides an exploratory approach for computer network security assessment.%根据计算机网络的特点及网络安全涉及的因素,建立计算机网络安全评价的层次结构模型,运用基于三角模糊数的模糊层次分析法实现对网络安全的综合量化评价.实例的计算结果表明模糊层次分析法适用于定性判断的量化综合,它为计算机网络安全评价提供了一种探索性方法.
Bulk Restoration for SDN-Based Transport Network
Yang Zhao
2016-01-01
Full Text Available We propose a bulk restoration scheme for software defined networking- (SDN- based transport network. To enhance the network survivability and improve the throughput, we allow disrupted flows to be recovered synchronously in dynamic order. In addition backup paths are scheduled globally by applying the principles of load balance. We model the bulk restoration problem using a mixed integer linear programming (MILP formulation. Then, a heuristic algorithm is devised. The proposed algorithm is verified by simulation and the results are analyzed comparing with sequential restoration schemes.
Traffic optimization in transport networks based on local routing
Scellato, S.; Fortuna, L.; Frasca, M.; Gómez-Gardeñes, J.; Latora, V.
2010-01-01
Congestion in transport networks is a topic of theoretical interest and practical importance. In this paper we study the flow of vehicles in urban street networks. In particular, we use a cellular automata model on a complex network to simulate the motion of vehicles along streets, coupled with a congestion-aware routing at street crossings. Such routing makes use of the knowledge of agents about traffic in nearby roads and allows the vehicles to dynamically update the routes towards their destinations. By implementing the model in real urban street patterns of various cities, we show that it is possible to achieve a global traffic optimization based on local agent decisions.
Enhanced energy transport in genetically engineered excitonic networks
Park, Heechul; Heldman, Nimrod; Rebentrost, Patrick; Abbondanza, Luigi; Iagatti, Alessandro; Alessi, Andrea; Patrizi, Barbara; Salvalaggio, Mario; Bussotti, Laura; Mohseni, Masoud; Caruso, Filippo; Johnsen, Hannah C.; Fusco, Roberto; Foggi, Paolo; Scudo, Petra F.; Lloyd, Seth; Belcher, Angela M.
2016-02-01
One of the challenges for achieving efficient exciton transport in solar energy conversion systems is precise structural control of the light-harvesting building blocks. Here, we create a tunable material consisting of a connected chromophore network on an ordered biological virus template. Using genetic engineering, we establish a link between the inter-chromophoric distances and emerging transport properties. The combination of spectroscopy measurements and dynamic modelling enables us to elucidate quantum coherent and classical incoherent energy transport at room temperature. Through genetic modifications, we obtain a significant enhancement of exciton diffusion length of about 68% in an intermediate quantum-classical regime.
Dephasing-assisted transport: quantum networks and biomolecules
Plenio, M B [QOLS, Blackett Laboratory, Imperial College London, Prince Consort Road, London SW7 2BW (United Kingdom); Huelga, S F [School of Physics, Astronomy and Mathematics, University of Hertfordshire, Hatfield, Herts AL10 9AB (United Kingdom)], E-mail: m.plenio@imperial.ac.uk
2008-11-15
Transport phenomena are fundamental in physics. They allow for information and energy to be exchanged between individual constituents of communication systems, networks or even biological entities. Environmental noise will generally hinder the efficiency of the transport process. However, and contrary to intuition, there are situations in classical systems where thermal fluctuations are actually instrumental in assisting transport phenomena. Here we show that, even at zero temperature, transport of excitations across dissipative quantum networks can be enhanced by local dephasing noise. We explain the underlying physical mechanisms behind this phenomenon and propose possible experimental demonstrations in quantum optics. Our results suggest that the presence of entanglement does not play an essential role for energy transport and may even hinder it. We argue that Nature may be routinely exploiting dephasing noise and show that the transport of excitations in simplified models of light harvesting molecules does benefit from such noise assisted processes. These results point toward the possibility for designing optimized structures for transport, for example in artificial nanostructures, assisted by noise.
Mathematical hierarchies and biology
Mirkin, Boris; Roberts, Fred S; Roberts, Fred S; Rzhetsky, Andrey
1997-01-01
The mathematical approach to the study of hierarchies presents the theoretical basis for many important areas of current scientific investigation. Biology has benefited from this research and has also stimulated the mathematical study of hierarchies. This collection presents papers devoted to theoretical, algorithmical, and application issues related to (1) reconstructing hierarchies (trees or ranking) from (dis)similarity or entity-to-character data, (2) using hierarchies for modeling evolution and other processes, and (3) combining (gene) trees. The papers in this volume provide a contemporary sample of many new results in hierarchy theory with applications in biology, psychology, data analysis, and systems engineering. Features: Mathematical treatment of hierarchies in several interconnected frameworks: set systems, linear subspaces, graph objects, and tree metrics. The relationship of hierarchies to many issues of current application-from learning robots to wavelets to intron evolution to the evolution ...
Application of Analytic Hierarchy Process in the computer network technology%层次分析法在计算机网络技术中的应用探讨
王加梁
2013-01-01
本文从常用的网络构建出发分析了层次分析法在计算机网络组网过程中的应用，包括网络安全性能分析、网络安全体系构建、网络安全防护技术以及基于网络层次的各种故障检测、排除技术等重点技术的应用研究。%This article from the network to build the departure of Analytic Hierarchy Process in the process of networking of computer network applications,including network security performance analysis,network security system construction,and network security technology based on network-level fault detection to excludetechnology and other key technologies.
Iterative Available Bandwidth Estimation for Mobile Transport Networks
Ubeda Castellanos, Carlos; López Villa, Dimas; Teyeb, Oumer Mohammed;
2007-01-01
Available bandwidth estimation has lately been proposed to be used for end-to-end resource management in existing and emerging mobile communication systems, whose transport networks could end up being the bottleneck rather than the air interface. Algorithms for admission control, handover and ada...
杨健康; 汤晓晨; 陈颖颖
2016-01-01
Tactical Networks is typical Ad Hoc Network. Its structure leads to relative ifxation for hierarchy and clustering. In order to maintain the cluster stabilization and network function in particular cases, Group leader election can be reached by address list message.%文章分析了战术互联网是典型的Ad Hoc网络，其结构导致层次及分群相对固定，可通过地址列表信息来完成群首的选举，以维护特殊情况下的群稳定性和网络功能。
Transport efficiency and dynamics of hydraulic fracture networks
Sachau, Till; Bons, Paul; Gomez-Rivas, Enrique
2015-08-01
Intermittent fluid pulses in the Earth's crust can explain a variety of geological phenomena, for instance the occurrence of hydraulic breccia. Fluid transport in the crust is usually modeled as continuous darcian flow, ignoring that sufficient fluid overpressure can cause hydraulic fractures as fluid pathways with very dynamic behavior. Resulting hydraulic fracture networks are largely self-organized: opening and healing of hydraulic fractures depends on local fluid pressure, which is, in turn, largely controlled by the fracture network. We develop a crustal-scale 2D computer model designed to simulate this process. To focus on the dynamics of the process we chose a setup as simple as possible. Control factors are constant overpressure at a basal fluid source and a constant 'viscous' parameter controlling fracture-healing. Our results indicate that at large healing rates hydraulic fractures are mobile, transporting fluid in intermittent pulses to the surface and displaying a 1/fα behavior. Low healing rates result in stable networks and constant flow. The efficiency of the fluid transport is independent from the closure dynamics of veins or fractures. More important than preexisting fracture networks is the distribution of fluid pressure. A key requirement for dynamic fracture networks is the presence of a fluid pressure gradient.
Transport efficiency and dynamics of hydraulic fracture networks
Till eSachau
2015-08-01
Full Text Available Intermittent fluid pulses in the Earth's crust can explain a variety of geological phenomena, for instance the occurrence of hydraulic breccia. Fluid transport in the crust is usually modeled as continuous darcian flow, ignoring that sufficient fluid overpressure can cause hydraulic fractures as fluid pathways with very dynamic behavior. Resulting hydraulic fracture networks are largely self-organized: opening and healing of hydraulic fractures depends on local fluid pressure, which is, in turn, largely controlled by the fracture network. We develop a crustal-scale 2D computer model designed to simulate this process. To focus on the dynamics of the process we chose a setup as simple as possible. Control factors are constant overpressure at a basal fluid source and a constant 'viscous' parameter controlling fracture-healing. Our results indicate that at large healing rates hydraulic fractures are mobile, transporting fluid in intermittent pulses to the surface and displaying a 1/fα behavior. Low healing rates result in stable networks and constant flow. The efficiency of the fluid transport is independent from the closure dynamics of veins or fractures. More important than preexisting fracture networks is the distribution of fluid pressure. A key requirement for dynamic fracture networks is the presence of a fluid pressure gradient.
Analysis regarding the transport network models. Case study on finding the optimal transport route
Stîngă, V.-G.
2017-08-01
Transport networks are studied most of the time from a graph theory perspective, mostly studied in a static way, in order to emphasize their characteristics like: topology, morphology, costs, traffic flows etc. There are many methods used to describe these characteristics at local and global level. Usually when analysing the transport network models, the aim is to achieve minimum capacity transit or minimum cost of operating or investment. Throughout this paper we will get an insight into the many models of the transport network that were presented over the years and we will try to make a short analysis regarding the most important ones. We will make a case study on finding the optimal route by using one of the models presented within this paper.
Effect of seismic retrofit of bridges on transportation networks
Masanobu Shinozuka; Yuko Murachi; Xuejiang Dong; Youwei Zhou; Michal J. Orlikowski
2003-01-01
The objective of this research is to determine the effect earthquakes have on the performance of transportation network systems. To do this, bridge fragility curves, expressed as a function of peak ground acceleration (PGA) and peak ground velocity (PGV), were developed. Network damage was evaluated under the 1994 Northridge earthquake and scenario earthquakes. A probabilistic model was developed to determine the effect of repair of bridge damage on the improvement of the network performance as days passed after the event. As an example, the system performance degradation measured in terms of an index, "Drivers Delay," is calculated for the Los Angeles area transportation system, and losses due to Drivers Delay with and without retrofit were estimated.
Mixed transportation network design under a sustainable development perspective.
Qin, Jin; Ni, Ling-lin; Shi, Feng
2013-01-01
A mixed transportation network design problem considering sustainable development was studied in this paper. Based on the discretization of continuous link-grade decision variables, a bilevel programming model was proposed to describe the problem, in which sustainability factors, including vehicle exhaust emissions, land-use scale, link load, and financial budget, are considered. The objective of the model is to minimize the total amount of resources exploited under the premise of meeting all the construction goals. A heuristic algorithm, which combined the simulated annealing and path-based gradient projection algorithm, was developed to solve the model. The numerical example shows that the transportation network optimized with the method above not only significantly alleviates the congestion on the link, but also reduces vehicle exhaust emissions within the network by up to 41.56%.
Mixed Transportation Network Design under a Sustainable Development Perspective
Jin Qin
2013-01-01
Full Text Available A mixed transportation network design problem considering sustainable development was studied in this paper. Based on the discretization of continuous link-grade decision variables, a bilevel programming model was proposed to describe the problem, in which sustainability factors, including vehicle exhaust emissions, land-use scale, link load, and financial budget, are considered. The objective of the model is to minimize the total amount of resources exploited under the premise of meeting all the construction goals. A heuristic algorithm, which combined the simulated annealing and path-based gradient projection algorithm, was developed to solve the model. The numerical example shows that the transportation network optimized with the method above not only significantly alleviates the congestion on the link, but also reduces vehicle exhaust emissions within the network by up to 41.56%.
Secure Media Independent Handover Message Transport in Heterogeneous Networks
Cho Choong-Ho
2009-01-01
Full Text Available The IEEE 802.21 framework for Media Independent Handover (MIH provides seamless vertical handover support for multimode mobile terminals. MIH messages are exchanged over various wireless media between mobile terminals and access networks to facilitate seamless handover. This calls for the need to secure MIH messages against network security threats in the wireless medium. In this paper, we first analyze IPSec/IKEv2 and DTLS security solution for secure MIH message transport. We show that handover latency can be an impediment to the use of IPSec and DTLS solutions. To overcome the handover overhead and hence minimize authentication time, a new secure MIH message transport solution, referred as MIHSec in this paper, is proposed. Experimental results are obtained for MIH between WLAN and Ethernet networks and the impacts of MIH message security on the handover latency are evaluated for IPSec, DTLS, and MIHSec security solutions. The effectiveness of MIHSec is demonstrated.
Transporting live video over high packet loss networks
Werdin, Dave
2013-05-01
Transport of live video requires a robust backbone as live video decoders are subject to dropouts and buffer starvation. A short duration packet loss will many times cause a decoder to go black for many seconds as it reacquires the stream and clock. IP networks due to their connectionless approach and support for variable length packets, inherently display packet delivery variability. These characteristics most typically include packet loss, packet delay variation, and packets being delivered out of order. Deep Packet Recovery (DPR) techniques provide correction to IP network induced errors and issues. DPR can provide a much broader and stronger protection than traditional Forward Error Correction techniques enabling transport of live video across severely impaired networks.
Kerner, Boris S
2016-01-01
We show that the minimization of travel times in a network as generally accepted in classical traffic and transportation theories deteriorates the traffic system through a considerable increase in the probability of traffic breakdown in the network. We introduce a network characteristic {\\it minimum network capacity} that shows that rather than the minimization of travel times in the network, the minimization of the probability of traffic breakdown in the network maximizes the network throughput at which free flow persists in the whole network.
Experimental Study of Heat Transport in Fractured Network
Pastore, Nicola; Cherubini, Claudia; Giasi, Concetta I.; Allegretti, Nicoletta M.; Redondo, Jose M.; Tarquis, Ana Maria
2015-04-01
Fractured rocks play an important role in transport of natural resources or contaminants transport through subsurface systems. In recent years, interest has grown in investigating heat transport by means of tracer tests, driven by the important current development of geothermal applications. In literature different methods are available for predicting thermal breakthrough in fractured reservoirs based on the information coming from tracer tests. Geothermal energy is one of the largest sources of renewable energies that are extracted from the earth. The growing interest in this new energy source has stimulated attempts to develop methods and technologies for extracting energy also from ground resource at low temperature. An example is the exploitation of low enthalpy geothermal energy that can be obtained at any place with the aid of ground-source heat pump system from the soil, rock and groundwater. In such geothermal systems the fluid movement and thermal behavior in the fractured porous media is very important and critical. Existing theory of fluid flow and heat transport through porous media is of limited usefulness when applied to fractured rocks. Many field and laboratory tracer tests in fractured media show that fracture -matrix exchange is more significant for heat than mass tracers, thus thermal breakthrough curves (BTCs) are strongly controlled by matrix thermal diffusivity. In this study the behaviour of heat transport in a fractured network at bench scale has been investigated. Heat tracer tests on an artificially created fractured rock sample have been carried out. The observed thermal BTCs obtained with six thermocouple probes located at different locations in the fractured medium have been modeled with the Explicit Network Model (ENM) based an adaptation of Tang's solution for solute transport in a semi-infinite single fracture embedded in a porous matrix. The ENM model is able to represent the behavior of observed heat transport except where the
Barbara Ferri
2017-02-01
Full Text Available Social housing requires appropriate evaluation models of projects, considering them from multiple perspectives: architectural, technical, environmental, economic, financial, paying particular attention to social aspects. The study proposes the use of a multi criteria evaluation model, based on the hierarchical (AHP and network (ANP analysis, as support in decision-making to guide practitioners and policy on the choice among alternative interventions. These methods allow to consider the overall effect of projects on urban system and the different points of view of those concerned, in an integrated and participatory approach. Interesting research perspectives concern the application of these evaluation approaches to case studies related to neighborhoods in which urban planning provides for social housing. The analysis will address the recent proposals for social housing in the city of Pescara (Italy, and in particular the urban transformation that is expected to achieve by means of the Integrated Urban Development Programme on the south-west of the city, whose regeneration was started by the Community Programme Urban 2. Un’Analisi Multi Criteri per la Valutazione delle Proposte di Housing Sociale: dall’Analytic Hierarchy Process (AHP all’Analytic Network Process (ANP I modelli insediativi di social housing richiedono idonei strumenti valutativi degli interventi immobiliari, considerandoli da molteplici punti di vista: architettonici, urbanistici, ambientali, economici, finanziari, con particolare attenzione agli aspetti sociali. Lo studio propone l’impiego di un modello valutativo multicriteri basato sull’analisi gerarchica (AHP e a rete (ANP, come supporto ai processi decisionali riguardanti la scelta tra interventi alternativi di edilizia residenziale sociale, considerando il loro effetto complessivo sul sistema urbano secondo un approccio integrato e partecipativo. Parole Chiave: analisi multicriteri, edilizia residenziale sociale
2003-01-01
"Sorrento Networks, a supplier of optical transport networking equipment for carriers and enterprises worldwide, today announced that SWITCH successfully completed 10 Gbps BER tests on the 220 km Zurich to Manno and 360 km Zurich to Geneva links in September and November 2003, using Sorrento's GigaMux DWDM system" (1/2 page).
Zhao, Yongli; Hu, Liyazhou; Wang, Wei; Li, Yajie; Zhang, Jie
2017-01-01
With the continuous opening of resource acquisition and application, there are a large variety of network hardware appliances deployed as the communication infrastructure. To lunch a new network application always implies to replace the obsolete devices and needs the related space and power to accommodate it, which will increase the energy and capital investment. Network function virtualization1 (NFV) aims to address these problems by consolidating many network equipment onto industry standard elements such as servers, switches and storage. Many types of IT resources have been deployed to run Virtual Network Functions (vNFs), such as virtual switches and routers. Then how to deploy NFV in optical transport networks is a of great importance problem. This paper focuses on this problem, and gives an implementation architecture of NFV-enabled optical transport networks based on Software Defined Optical Networking (SDON) with the procedure of vNFs call and return. Especially, an implementation solution of NFV-enabled optical transport node is designed, and a parallel processing method for NFV-enabled OTN nodes is proposed. To verify the performance of NFV-enabled SDON, the protocol interaction procedures of control function virtualization and node function virtualization are demonstrated on SDON testbed. Finally, the benefits and challenges of the parallel processing method for NFV-enabled OTN nodes are simulated and analyzed.
Spontaneous synchronization driven by energy transport in interconnected networks
Nicosia, Vincenzo; Latora, Vito; Arenas, Alex
2014-01-01
The existence of intertwined dynamical processes in interconnected networks is a distinctive aspect of complex systems. For example, cerebral circulation delivers oxygenated blood to the brain through blood vessels, and in turn the neural system in the brain is responsible, through neural network connections, for mediating changes in cerebral blood flow. To understand the effects of the coupling between different processes we study the case of two interconnected networks, one accounting for energy transport and the other for a synchronization dynamics. We observe the emergence of switch-like spontaneous synchronization, similar to that seen in the transition between resting-state and cognitive activity in the human brain, for a wide range of control parameters and for different network topologies. We suggest that similarly interconnected dynamical processes could be responsible for spontaneous synchronization transitions observed in natural systems.
Active patterning and asymmetric transport in a model actomyosin network
Wang, Shenshen; Wolynes, Peter G.
2013-12-01
Cytoskeletal networks, which are essentially motor-filament assemblies, play a major role in many developmental processes involving structural remodeling and shape changes. These are achieved by nonequilibrium self-organization processes that generate functional patterns and drive intracellular transport. We construct a minimal physical model that incorporates the coupling between nonlinear elastic responses of individual filaments and force-dependent motor action. By performing stochastic simulations we show that the interplay of motor processes, described as driving anti-correlated motion of the network vertices, and the network connectivity, which determines the percolation character of the structure, can indeed capture the dynamical and structural cooperativity which gives rise to diverse patterns observed experimentally. The buckling instability of individual filaments is found to play a key role in localizing collapse events due to local force imbalance. Motor-driven buckling-induced node aggregation provides a dynamic mechanism that stabilizes the two-dimensional patterns below the apparent static percolation limit. Coordinated motor action is also shown to suppress random thermal noise on large time scales, the two-dimensional configuration that the system starts with thus remaining planar during the structural development. By carrying out similar simulations on a three-dimensional anchored network, we find that the myosin-driven isotropic contraction of a well-connected actin network, when combined with mechanical anchoring that confers directionality to the collective motion, may represent a novel mechanism of intracellular transport, as revealed by chromosome translocation in the starfish oocyte.
Locating inefficient links in a large-scale transportation network
Sun, Li; Liu, Like; Xu, Zhongzhi; Jie, Yang; Wei, Dong; Wang, Pu
2015-02-01
Based on data from geographical information system (GIS) and daily commuting origin destination (OD) matrices, we estimated the distribution of traffic flow in the San Francisco road network and studied Braess's paradox in a large-scale transportation network with realistic travel demand. We measured the variation of total travel time Δ T when a road segment is closed, and found that | Δ T | follows a power-law distribution if Δ T 0. This implies that most roads have a negligible effect on the efficiency of the road network, while the failure of a few crucial links would result in severe travel delays, and closure of a few inefficient links would counter-intuitively reduce travel costs considerably. Generating three theoretical networks, we discovered that the heterogeneously distributed travel demand may be the origin of the observed power-law distributions of | Δ T | . Finally, a genetic algorithm was used to pinpoint inefficient link clusters in the road network. We found that closing specific road clusters would further improve the transportation efficiency.
Towards Terabit Carrier Ethernet and Energy Efficient Optical Transport Networks
Rasmussen, Anders
error correction and energy efficiency. Scheduling and address lookup are key functions and potential bottle necks in high speed network nodes, as the minimum packet/frame sizes in both the popular Ethernet protocol, as well as the Internet Protocol (IP) still remains constant (84B and 40B, respectively...... requirements. Forward Error Correction (FEC) is already a standard component of the Optical Transport Network (OTN) protocol as a means of increasing the bitrate-length product of optical links. However, the requirements for higher bitrates also drive a requirement for higher spectral efficiency in order...
Statistical theory of designed quantum transport across disordered networks.
Walschaers, Mattia; Mulet, Roberto; Wellens, Thomas; Buchleitner, Andreas
2015-04-01
We explain how centrosymmetry, together with a dominant doublet of energy eigenstates in the local density of states, can guarantee interference-assisted, strongly enhanced, strictly coherent quantum excitation transport between two predefined sites of a random network of two-level systems. Starting from a generalization of the chaos-assisted tunnelling mechanism, we formulate a random matrix theoretical framework for the analytical prediction of the transfer time distribution, of lower bounds of the transfer efficiency, and of the scaling behavior of characteristic statistical properties with the size of the network. We show that these analytical predictions compare well to numerical simulations, using Hamiltonians sampled from the Gaussian orthogonal ensemble.
A Statistical Theory of Designed Quantum Transport Across Disordered Networks
Walschaers, Mattia; Wellens, Thomas; Buchleitner, Andreas
2014-01-01
We explain how centrosymmetry, together with a dominant doublet in the local density of states, can guarantee interference-assisted, strongly enhanced, strictly coherent quantum excitation transport between two predefined sites of a random network of two-level systems. Starting from a generalisation of the chaos assisted tunnelling mechanism, we formulate a random matrix theoretical framework for the analytical prediction of the transfer time distribution, of lower bounds of the transfer efficiency, and of the scaling behaviour of characteristic statistical properties with the size of the network.
Optimal resource allocation in random networks with transportation bandwidths
Yeung, C. H.; Wong, K. Y. Michael
2009-03-01
We apply statistical physics to study the task of resource allocation in random sparse networks with limited bandwidths for the transportation of resources along the links. Recursive relations from the Bethe approximation are converted into useful algorithms. Bottlenecks emerge when the bandwidths are small, causing an increase in the fraction of idle links. For a given total bandwidth per node, the efficiency of allocation increases with the network connectivity. In the high connectivity limit, we find a phase transition at a critical bandwidth, above which clusters of balanced nodes appear, characterized by a profile of homogenized resource allocation similar to the Maxwell construction.
Shuttle Planning for Link Closures in Urban Public Transport Networks
van der Hurk, Evelien; Koutsopoulos, Haris N.; Wilson, Nigel
2016-01-01
Urban public transport systems must periodically close certain links for maintenance, which can have significant effects on the service provided to passengers. In practice, the effects of closures are mitigated by replacing the closed links with a simple shuttle service. However, alternative...... cost, which includes transfers and frequency-dependent waiting time costs. This model is applied to a shuttle design problem based on a real-world case study of the Massachusetts Bay Transportation Authority network of Boston, Massachusetts. The results show that additional shuttle routes can reduce...
Shuttle Planning for Link Closures in Urban Public Transport Networks
van der Hurk, Evelien; Koutsopoulos, Haris N.; Wilson, Nigel
2016-01-01
Urban public transport systems must periodically close certain links for maintenance, which can have significant effects on the service provided to passengers. In practice, the effects of closures are mitigated by replacing the closed links with a simple shuttle service. However, alternative...... cost, which includes transfers and frequency-dependent waiting time costs. This model is applied to a shuttle design problem based on a real-world case study of the Massachusetts Bay Transportation Authority network of Boston, Massachusetts. The results show that additional shuttle routes can reduce...
SNMS: an intelligent transportation system network architecture based on WSN and P2P network
LI Li; LIU Yuan-an; TANG Bi-hua
2007-01-01
With the development of city road networks, the question of how to obtain information about the roads is becoming more and more important. In this article, sensor network with mobile station (SNMS), a novel two-tiered intelligent transportation system (ITS) network architecture based on wireless sensor network (WSN) and peer-to-peer (P2P) network, is proposed to provide significant traffic information about the road and thereby, assist travelers to take optimum decisions when they are driving. A detailed explanation with regard to the strategy of each level as well as the design of two main components in the network, sensor unit (SU) and mobile station (MS), is presented. Finally, a representative scenario is described to display the operation of the system.
Ant Colony Optimization for Route Allocation in Transportation Networks
Zamfirescu, Constantin-Bǎlǎ; Negulescu, Sorin; Oprean, Constantin; Banciu, Dorin
2009-04-01
The paper introduces a bio-inspired approach to solve the route allocation problem (RAP) in the transportation networks. The approach extends a well-known meta-heuristics algorithm with the real life constraints that are dealt with in the scheduling process (i.e. the uniform distribution of routes diversity for vehicles, the average distance travelled in a month, the driver's rest between subsequent trips etc.). The paper is focusing on the engineering aspects of employing bio-inspired algorithms (which proved to have near-optimal results for toy-like problems) to a real-life application domain. The approach proved to be capable of preserving the software components (agents) to the complexity and dynamics of the situation when the RAP requires incremental extensions of constraints to reflect the traffic conditions in the transportation network.
Trans-European transport network and cross-border governance
Guasco, Clement Nicolas
2014-01-01
This article looks at the implementation of trans-European transport corridors in the EU and the influence it has on governance within EU member-states. It considers the implementation of such a scheme in the context of cross-border cooperation and discusses the system of governance necessary...... for coordinating knowledge, efforts and solutions across several national systems. In order to understand this governance setting, one needs to understand the specific quality of transnational governance in the EU, which is neither purely international nor federally integrated. The transport corridor between Malmö...... and Hamburg is taken as a case for discussion. Cross-border governance is analyzed within a multi-level policy network approach including actors from supranational, national and subnational levels, in order to determine the existence of a policy network across the borders. The main finding is a depiction...
Zhang, Rui; Yao, Enjian; Yang, Yang
2017-01-01
Introducing electric vehicles (EVs) into urban transportation network brings higher requirement on travel time reliability and charging reliability. Specifically, it is believed that travel time reliability is a key factor influencing travelers' route choice. Meanwhile, due to the limited cruising range, EV drivers need to better learn about the required energy for the whole trip to make decisions about whether charging or not and where to charge (i.e., charging reliability). Since EV energy consumption is highly related to travel speed, network uncertainty affects travel time and charging demand estimation significantly. Considering the network uncertainty resulted from link degradation, which influences the distribution of travel demand on transportation network and the energy demand on power network, this paper aims to develop a reliability-based network equilibrium framework for accommodating degradable road conditions with the addition of EVs. First, based on the link travel time distribution, the mean and variance of route travel time and monetary expenses related to energy consumption are deduced, respectively. And the charging time distribution of EVs with charging demand is also estimated. Then, a nested structure is considered to deal with the difference of route choice behavior derived by the different uncertainty degrees between the routes with and without degradable links. Given the expected generalized travel cost and a psychological safety margin, a traffic assignment model with the addition of EVs is formulated. Subsequently, a heuristic solution algorithm is developed to solve the proposed model. Finally, the effects of travelers' risk attitude, network degradation degree, and EV penetration rate on network performance are illustrated through an example network. The numerical results show that the difference of travelers' risk attitudes does have impact on the route choice, and the widespread adoption of EVs can cut down the total system travel
Why do Scale-Free Networks Emerge in Nature? From Gradient Networks to Transport Efficiency
Toroczkai, Zoltan
2004-03-01
It has recently been recognized [1,2,3] that a large number of complex networks are scale-free (having a power-law degree distribution). Examples include citation networks [4], the internet [5], the world-wide-web [6], cellular metabolic networks [7], protein interaction networks [8], the sex-web [9] and alliance networks in the U.S. biotechnology industry [10]. The existence of scale-free networks in such diverse systems suggests that there is a simple underlying common reason for their development. Here, we propose that scale-free networks emerge because they ensure efficient transport of some entity. We show that for flows generated by gradients of a scalar "potential'' distributed on a network, non scale-free networks, e.g., random graphs [11], will become maximally congested, while scale-free networks will ensure efficient transport in the large network size limit. [1] R. Albert and A.-L. Barabási, Rev.Mod.Phys. 74, 47 (2002). [2] M.E.J. Newman, SIAM Rev. 45, 167 (2003). [3] S.N. Dorogovtsev and J.F.F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW, Oxford Univ. Press, Oxford, 2003. [4] S. Redner, Eur.Phys.J. B, 4, 131 (1998). [5] M. Faloutsos, P. Faloutsos and C. Faloutsos Comp.Comm.Rev. 29, 251 (1999). [6] R. Albert, H. Jeong, and A.L. Barabási, Nature 401, 130 (1999). [7] H. Jeong et.al. Nature 407, 651 (2000). [8] H. Jeong, S. Mason, A.-L. Barabási and Z. N. Oltvai, Nature 411, 41 (2001). [9] F. Liljeros et. al. Nature 411 907 (2000). [10] W. W. Powell, D. R. White, K. W. Koput and J. Owen-Smith Am.J.Soc. in press. [11] B. Bollobás, Random Graphs, Second Edition, Cambridge University Press (2001).
Decision Support for Countering Terrorist Threats against Transportation Networks
Dr. Richard Adler
2009-01-01
Full Text Available This article presents a dynamic decision support methodology forcounter-terrorism decision support. The initial sections introduce basic objectives and challenges of terrorism risk analysis and risk management. The remainder of the paper describes TRANSEC, a decision support framework for defining, validating, and monitoring strategies focused on managing terrorism risks to international transportation networks. The methodology and software tools underlying TRANSEC are applicable to other homeland security problems, such as critical infrastructure and border protection.
Disruption and adaptation of urban transport networks from flooding
Pregnolato Maria; Ford Alistair; Dawson Richard
2016-01-01
Transport infrastructure networks are increasingly vulnerable to disruption from extreme rainfall events due to increasing surface water runoff from urbanization and changes in climate. Impacts from such disruptions typically extend far beyond the flood footprint, because of the interconnection and spatial extent of modern infrastructure. An integrated flood risk assessment couples high resolution information on depth and velocity from the CityCAT urban flood model with empirical analysis of ...
熊剑
2012-01-01
Based on analysis of characteristic and economic characteristics of rural distribution power network, the economic characteristic evaluation index is built. The application of analytic hierarchy process used in planning decision of rural power distribution network is introduced.%在分析区农村配电网特点与经济特性的基础上,建立区农村配电网规划经济性评估指标体系,并介绍层次分析法在配电网规划经济性分析评估的应用。
Bus transport network of Shenyang considering competitive and cooperative relationship
Hu, Baoyu; Feng, Shumin; Nie, Cen
2017-01-01
Competition and cooperation is a universal phenomenon in bus transport networks (BTNs) because of the shared stations between bus routes. A measuring method is proposed for competitive and cooperative relationship between bus routes. Based on this measurement, we develop a new representation model for BTNs, namely competitive-cooperative space R. This model is applied to investigate empirically bus transport network of Shenyang (BTN-S) from China. We present the histograms of competitive-cooperative coefficients, competitive coefficients and cooperative coefficients to illustrate that competitive and cooperative relationship plays an important role in transporting passengers. The competitive-cooperative situation shows that cooperative relationship holds an absolutely dominant position in BTN-S. To explore the networked characteristics, we present some empirical distributions, for the number of bus stations on a route, the number of shared stations between two routes, degree and weighted degree, competitive strength, and cooperative strength. We also examine the correlations between degree and competitive strength, and between degree and cooperative strength. Besides, we investigate the diversities of competitive strength and cooperative strength in BTN-S. This study can help us to understand the BTN from a deeper level.
Fagertun, Anna Manolova; Ruepp, Sarah Renée
2014-01-01
The current trend in deploying automatic control plane solutions for increased flexibility in the optical transport layer leads to numerous advantages for both the operators and the customers, but also pose challenges related to the stability of the network and its ability to operate in a robust ...... of their transport infrastructures. Applying proactive methods for avoiding areas where epidemic failures spread results in 50% less connections requiring recovery, which translates in improved quality of service to customers....
Liu, Zugang
Network systems, including transportation and logistic systems, electric power generation and distribution networks as well as financial networks, provide the critical infrastructure for the functioning of our societies and economies. The understanding of the dynamic behavior of such systems is also crucial to national security and prosperity. The identification of new connections between distinct network systems is the inspiration for the research in this dissertation. In particular, I answer two questions raised by Beckmann, McGuire, and Winsten (1956) and Copeland (1952) over half a century ago, which are, respectively, how are electric power flows related to transportation flows and does money flow like water or electricity? In addition, in this dissertation, I achieve the following: (1) I establish the relationships between transportation networks and three other classes of complex network systems: supply chain networks, electric power generation and transmission networks, and financial networks with intermediation. The establishment of such connections provides novel theoretical insights as well as new pricing mechanisms, and efficient computational methods. (2) I develop new modeling frameworks based on evolutionary variational inequality theory that capture the dynamics of such network systems in terms of the time-varying flows and incurred costs, prices, and, where applicable, profits. This dissertation studies the dynamics of such network systems by addressing both internal competition and/or cooperation, and external changes, such as varying costs and demands. (3) I focus, in depth, on electric power supply chains. By exploiting the relationships between transportation networks and electric power supply chains, I develop a large-scale network model that integrates electric power supply chains and fuel supply markets. The model captures both the economic transactions as well as the physical transmission constraints. The model is then applied to the New
The Analytical Hierarchy Process
Barfod, Michael Bruhn
2007-01-01
The technical note gathers the theory behind the Analytical Hierarchy Process (AHP) and present its advantages and disadvantages in practical use.......The technical note gathers the theory behind the Analytical Hierarchy Process (AHP) and present its advantages and disadvantages in practical use....
The Analytical Hierarchy Process
Barfod, Michael Bruhn
2007-01-01
The technical note gathers the theory behind the Analytical Hierarchy Process (AHP) and present its advantages and disadvantages in practical use.......The technical note gathers the theory behind the Analytical Hierarchy Process (AHP) and present its advantages and disadvantages in practical use....
How to assess extreme weather impacts - case European transport network
Leviäkangas, P.
2010-09-01
To assess the impacts of climate change and preparing for impacts is a process. This process we must understand and learn to apply. EWENT (Extreme Weather impacts on European Networks of Transport) will be a test bench for one prospective approach. It has the following main components: 1) identifying what is "extreme", 2) assessing the change in the probabilities, 3) constructing the causal impact models, 4) finding appropriate methods of pricing and costing, 5) finding alternative strategy option, 6) assessing the efficiency of strategy option. This process follows actually the steps of standardized risk management process. Each step is challenging, but if EWENT project succeeds to assess the extreme weather impacts on European transport networks, it is one possible benchmark how to carry out similar analyses in other regions and on country level. EWENT approach could particularly useful for weather and climate information service providers, offering tools for transport authorities and financiers to assess weather risks, and then rationally managing the risks. EWENT project is financed by the European Commission and participated by met-service organisations and transport research institutes from different parts of Europe. The presentation will explain EWENT approach in detail and bring forth the findings of the first work packages.
Efficient quantum transport in disordered interacting many-body networks
Ortega, Adrian; Stegmann, Thomas; Benet, Luis
2016-10-01
The coherent transport of n fermions in disordered networks of l single-particle states connected by k -body interactions is studied. These networks are modeled by embedded Gaussian random matrix ensemble (EGE). The conductance bandwidth and the ensemble-averaged total current attain their maximal values if the system is highly filled n ˜l -1 and k ˜n /2 . For the cases k =1 and k =n the bandwidth is minimal. We show that for all parameters the transport is enhanced significantly whenever centrosymmetric embedded Gaussian ensemble (csEGE) are considered. In this case the transmission shows numerous resonances of perfect transport. Analyzing the transmission by spectral decomposition, we find that centrosymmetry induces strong correlations and enhances the extrema of the distributions. This suppresses destructive interference effects in the system and thus causes backscattering-free transmission resonances that enhance the overall transport. The distribution of the total current for the csEGE has a very large dominating peak for n =l -1 , close to the highest observed currents.
The Multilayer Temporal Network of Public Transport in Great Britain
Gallotti, Riccardo
2015-01-01
Despite the widespread availability of information concerning Public Transport from different sources, it is extremely hard to have a complete picture, in particular at a national scale. Here, we integrate timetable data obtained from the United Kingdom open-data program together with timetables of domestic flights, and obtain a comprehensive snapshot of the temporal characteristics of the whole UK public transport system for a week in October 2010. In order to focus on the multi-modal aspects of the system, we use a coarse graining procedure and define explicitly the coupling between different transport modes such as connections at airports, ferry docks, rail, metro, coach and bus stations. The resulting weighted, directed, temporal and multilayer network is provided in simple, commonly used formats, ensuring easy accessibility and the possibility of a straightforward use of old or specifically developed methods on this new and extensive dataset.
The Star Height Hierarchy Vs. The Variable Hierarchy
Belkhir, Walid
2009-01-01
The star height hierarchy (resp. the variable hierarchy) results in classifying $\\mu$-terms into classes according to the nested depth of fixed point operators (resp. to the number of bound variables). We prove, under some assumptions, that the variable hierarchy is a proper refinement of the star height hierarchy. We mean that the non collapse of the variable hierarchy implies the non collapse of the star height hierarchy. The proof relies on the combinatorial characterization of the two hie...
Leavitt, Harold J
2003-03-01
Hardly anyone has a good word to say about hierarchies. Academics, consultants, and management gurus regularly forecast their imminent replacement because hierarchies--even when populated by considerate and intelligent people--can be cruel and stupid. They routinely transform motivated and loyal employees into disaffected Dilberts. It's no wonder that we continue to search for more humane and productive alternatives to them. Yet the intensity with which we struggle against hierarchies only serves to highlight their durability. Hierarchy, it seems, may be intrinsic not only to the natural world but also to our own natures. In this article, organizational behavior expert Harold J. Leavitt presents neither a defense of human hierarchies nor another attack on them. Instead, he offers a reality check, a reminder that hierarchy remains the basic structure of most, if not all, large, ongoing human organizations. That's because although they are often depicted as being out of date, hierarchies have proved to be extraordinarily adaptive. Over the past 50 years, for example, they have co-opted the three major managerial movements--human relations, analytic management, and communities of practice. Hierarchies also persist because they deliver real practical and psychological value, and they fulfill our deep need for order and security. Despite the good they may do, hierarchies are inevitably authoritarian. That authoritarianism shows up in all kinds of ways and influences everything in organizations, particularly communication. In multilevel organizations, for instance, messages get distorted as they travel up and down the ladder of command. Self-protection and self-interest weigh in, and relevant information is lost as messages make stops along the route. Sensitive leaders take steps to make speaking the truth as painless as possible. But it never is in organizations, because authoritarianism is an immutable element of hierarchy.
Soil organic carbon, macropore networks and preferential transport
Larsbo, Mats; Koestel, John; Kätterer, Thomas; Jarvis, Nick
2016-04-01
Agricultural management practices such as tillage, crop rotations, residue management and fertilization can have a strong influence on soil organic carbon (SOC) stocks. An increase in SOC content will generally improve soil structure, which in turn determines the solute transport pathways through the soil. The aim of this study was to quantify the architecture of macropore networks in undisturbed soil columns (15 cm high, 12.7 cm diameter) sampled along a transect with natural variations in SOC using X-ray tomography and to relate the network characteristics to the degree of preferential transport in the columns. Two tracer experiments were carried out at constant irrigation rates of 2 and 5 mm h-1. We used the normalised 5% arrival time which reflects the tendency for early arrival of the solutes as a measure of the degree of preferential transport. The soil macropore networks were analysed in cylindrical sub-volumes (8 cm high, 10 cm diameter) located centrally within the soil columns. These sub-volumes were considered unaffected by sampling artefacts. Analyses were also carried out the for whole sample volumes to enable comparisons with the results from the transport experiments. Image processing and analysis were carried out in ImageJ and R. The same grey value threshold was applied to all images after harmonisation of grey values using the PVC column walls and the air outside the columns. This approach resulted in a satisfactory separation between the pore space and the surrounding soil matrix and organic matter. The SOC content along the transect, which varied from 4.2 to 15% , was correlated to all measures of the pore network for the sub-volumes except for the connectivity probability. Columns with high SOC content were associated with large macroporosities (both total and connected), large specific surface areas, large fractal dimensions and small mean pore thicknesses. The SOC content for whole sample volumes was positively correlated to 5% arrival times
O'Danleyman, Grastivia; Seebens, Hanno; Blasius, Bernd; Brockmann, Dirk
2011-01-01
We present a comparative network theoretic analysis of the two largest global transportation networks: The worldwide air-transportation network (WAN) and the global cargoship network (GCSN). We show that both networks exhibit striking statistical similarities despite significant differences in topology and connectivity. Both networks exhibit a discontinuity in node and link betweenness distributions which implies that these networks naturally segragate in two different classes of nodes and links. We introduce a technique based on effective distances, shortest paths and shortest-path trees for strongly weighted symmetric networks and show that in a shortest-path-tree representation the most significant features of both networks can be readily seen. We show that effective shortest-path distance, unlike conventional geographic distance measures, strongly correlates with node centrality measures. Using the new technique we show that network resilience can be investigated more precisely than with contemporary tech...
Green Transport Balanced Scorecard Model with Analytic Network Process Support
David Staš
2015-11-01
Full Text Available In recent decades, the performance of economic and non-economic activities has required them to be friendly with the environment. Transport is one of the areas having considerable potential within the scope. The main assumption to achieve ambitious green goals is an effective green transport evaluation system. However, these systems are researched from the industrial company and supply chain perspective only sporadically. The aim of the paper is to design a conceptual framework for creating the Green Transport (GT Balanced Scorecard (BSC models from the viewpoint of industrial companies and supply chains using an appropriate multi-criteria decision making method. The models should allow green transport performance evaluation and support of an effective implementation of green transport strategies. Since performance measures used in Balanced Scorecard models are interdependent, the Analytic Network Process (ANP was used as the appropriate multi-criteria decision making method. The verification of the designed conceptual framework was performed on a real supply chain of the European automotive industry.
Nonlinear transport of soft droplets in pore networks
Vernerey, Franck; Benet Cerda, Eduard; Koo, Kanghyeon
A large number of biological and technological processes depend on the transport of soft colloidal particles through porous media; this includes the transport and separation of cells, viruses or drugs through tissues, membranes and microfluidic devices. In these systems, the interactions between soft particles, background fluid and the surrounding pore space yield complex, nonlinear behaviors such as non-Darcy flows, localization and jamming. We devise a computational strategy to investigate the transport of non-wetting and deformable water droplets in a microfluidic device made of a random distribution of cylindrical obstacles. We first derive scaling laws for the entry of the droplet in a single pore and discuss the role of surface tension, contact angle and size in this process. This information is then used to study the transport of multiple droplets in an obstacle network. We find that when the droplet size is close to the pore size, fluid flow and droplet trafficking strongly interact, leading to local redistributions in pressure fields, intermittent clogging and jamming. Importantly, it is found that the overall droplet and fluid transport display three different scaling regimes depending on the forcing pressure, and that these regimes can be related to droplet properties.
Sediment transport mechanisms through the sustainable vegetated flow networks
Allen, Deonie; Haynes, Heather; Arthur, Scott
2016-04-01
Understanding the pollution treatment efficiency of a sustainable urban drainage (SuDS) asset or network requires the influx, transport, detention and discharge of the pollutant within the system. To date event specific monitoring of sediment (primarily total suspended solids) concentrations in the inflow and discharge from SuDS have been monitored. Long term analysis of where the sediment is transported to and the residency time of this pollutant within the SuDS asset or network have not been unraveled due to the difficulty in monitoring specific sediment particulate movement. Using REO tracing methodology, sediment particulate movement has become possible. In tracing sediment movement from an urban surface the internal residency and transportation of this sediment has illustrated SuDS asset differences in multi-event detention. Of key importance is the finding that sediment remains within the SuDS asset for extended periods of time, but that the location sediment detention changes. Thus, over multiple rainfall-runoff events sediment is seen to move through the SuDS assets and network proving the assumption that detained sediment is permanent and stationary to be inaccurate. Furthermore, mass balance analysis of SuDS sediment indicates that there is notable re-suspension and ongoing release of sediment from the SuDS over time and cumulative rainfall-runoff events. Continued monitoring of sediment deposition and concentration in suspension illustrates that sediment detention within SuDS decreases over time/multiple events, without stabilizing within a 12 month period. Repeated experiments show a consistent pattern of detention and release for the three SuDS networks monitored in Scotland. Through consideration of both rainfall and flow factors the drivers of sediment transport within the monitored SuDS have been identified. Within the limitation of this field study the key drivers to SuDS sediment detention efficiency (or transport of sediment through the system
Random walk approach for dispersive transport in pipe networks
Sämann, Robert; Graf, Thomas; Neuweiler, Insa
2016-04-01
Keywords: particle transport, random walk, pipe, network, HYSTEM-EXTAN, OpenGeoSys After heavy pluvial events in urban areas the available drainage system may be undersized at peak flows (Fuchs, 2013). Consequently, rainwater in the pipe network is likely to spill out through manholes. The presence of hazardous contaminants in the pipe drainage system represents a potential risk to humans especially when the contaminated drainage water reaches the land surface. Real-time forecasting of contaminants in the drainage system needs a quick calculation. Numerical models to predict the fate of contaminants are usually based on finite volume methods. Those are not applicable here because of their volume averaging elements. Thus, a more efficient method is preferable, which is independent from spatial discretization. In the present study, a particle-based method is chosen to calculate transport paths and spatial distribution of contaminants within a pipe network. A random walk method for particles in turbulent flow in partially filled pipes has been developed. Different approaches for in-pipe-mixing and node-mixing with respect to the geometry in a drainage network are shown. A comparison of dispersive behavior and calculation time is given to find the fastest model. The HYSTEM-EXTRAN (itwh, 2002) model is used to provide hydrodynamic conditions in the pipe network according to surface runoff scenarios in order to real-time predict contaminant transport in an urban pipe network system. The newly developed particle-based model will later be coupled to the subsurface flow model OpenGeoSys (Kolditz et al., 2012). References: Fuchs, L. (2013). Gefährdungsanalyse zur Überflutungsvorsorge kommunaler Entwässerungssysteme. Sanierung und Anpassung von Entwässerungssystemen-Alternde Infrastruktur und Klimawandel, Österreichischer Wasser-und Abfallwirtschaftsverband, Wien, ISBN, 978-3. itwh (2002). Modellbeschreibung, Institut für technisch-wissenschaftliche Hydrologie Gmb
Balasubramonian, Rajeev
2011-01-01
A key determinant of overall system performance and power dissipation is the cache hierarchy since access to off-chip memory consumes many more cycles and energy than on-chip accesses. In addition, multi-core processors are expected to place ever higher bandwidth demands on the memory system. All these issues make it important to avoid off-chip memory access by improving the efficiency of the on-chip cache. Future multi-core processors will have many large cache banks connected by a network and shared by many cores. Hence, many important problems must be solved: cache resources must be allocat
Jacobs-Crisioni, C.; Koopmans, C. C.
2016-07-01
This paper introduces a GIS-based model that simulates the geographic expansion of transport networks by several decision-makers with varying objectives. The model progressively adds extensions to a growing network by choosing the most attractive investments from a limited choice set. Attractiveness is defined as a function of variables in which revenue and broader societal benefits may play a role and can be based on empirically underpinned parameters that may differ according to private or public interests. The choice set is selected from an exhaustive set of links and presumably contains those investment options that best meet private operator's objectives by balancing the revenues of additional fare against construction costs. The investment options consist of geographically plausible routes with potential detours. These routes are generated using a fine-meshed regularly latticed network and shortest path finding methods. Additionally, two indicators of the geographic accuracy of the simulated networks are introduced. A historical case study is presented to demonstrate the model's first results. These results show that the modelled networks reproduce relevant results of the historically built network with reasonable accuracy.
Bornard, P. [Reseau de Transport d' Electricite (RTE), Div. Systeme Electrique, 92 - Paris la Defense (France); Pavard, M. [Electricite de France (EDF), 75 - Paris (France); Testud, G. [Reseau de Transport d' Electricite (RTE), Dept. Exploitation du Systeme Electrique, 92 - Paris la Defense (France)
2005-10-01
For economical or technical reasons, the power generation units are in general grouped together in the same geographical areas, while the consumption points are much more dispersed. The power transportation and interconnection networks ensure the link between the big generation areas and the big consumption areas, and also with other foreign networks. The network manager must keep the balance between the available offer and the potential demand and ensures the transit of energy between the production units and the end-users with respecting the contractual voltage and frequency ranges. Incidents must be mastered to limit the inconvenience to users and to avoid the complete collapse of the power transportation system. This article describes the operation of such systems: 1 - problems linked with networks operation; 2 - transits distribution: general problem, transmissible power in a power line, voltage drop, calculations of power distributions; 3 - voltage and frequency adjustments; 4 - operation in disturbed regime: mastery of common incidents, mechanisms of major incidents (operation of a power system in strongly disturbed regime), protection of the power system, recovery; 5 - conclusion. (J.S.)
Climate and change: simulating flooding impacts on urban transport network
Pregnolato, Maria; Ford, Alistair; Dawson, Richard
2015-04-01
National-scale climate projections indicate that in the future there will be hotter and drier summers, warmer and wetter winters, together with rising sea levels. The frequency of extreme weather events is expected to increase, causing severe damage to the built environment and disruption of infrastructures (Dawson, 2007), whilst population growth and changed demographics are placing new demands on urban infrastructure. It is therefore essential to ensure infrastructure networks are robust to these changes. This research addresses these challenges by focussing on the development of probabilistic tools for managing risk by modelling urban transport networks within the context of extreme weather events. This paper presents a methodology to investigate the impacts of extreme weather events on urban environment, in particular infrastructure networks, through a combination of climate simulations and spatial representations. By overlaying spatial data on hazard thresholds from a flood model and a flood safety function, mitigated by potential adaptation strategies, different levels of disruption to commuting journeys on road networks are evaluated. The method follows the Catastrophe Modelling approach and it consists of a spatial model, combining deterministic loss models and probabilistic risk assessment techniques. It can be applied to present conditions as well as future uncertain scenarios, allowing the examination of the impacts alongside socio-economic and climate changes. The hazard is determined by simulating free surface water flooding, with the software CityCAT (Glenis et al., 2013). The outputs are overlapped to the spatial locations of a simple network model in GIS, which uses journey-to-work (JTW) observations, supplemented with speed and capacity information. To calculate the disruptive effect of flooding on transport networks, a function relating water depth to safe driving car speed has been developed by combining data from experimental reports (Morris et
A model of the sediment transport on a river network
Wang, Xu-Ming; Hao, Rui; Zhang, Jin-Feng; Huo, Jie
2007-03-01
A dynamical model is proposed to mimic the sediment transport on a river network. A river can be divided into some segments. For the ith segment the schlepping sediment ability of the flow may be scouring or depositing, which is influenced by that of the (i- 1)th segment. In order to compare our model simulation results with the empirical data obtained in Yellow River, the model is equipped with an experiential relation between the flow rate and the depositing rate of the Yellow River. After this, the simulation results show an excellent agreement with the empirical conclusions obtained with the upper and middle parts of Yellow River when it is in the low-water periods (for instance, in Dec., Jan. and Feb.). This indicates that our model may successfully describe the scouring-depositing of river networks.
Urban transport, the environment and the network society
Hansen, Carsten Jahn
2005-01-01
Netherlands), and Aalborg (Denmark). The cases illustrate how local political goals and strategies for environmentally oriented transport solutions have been influenced by international environmental discourses as well as by national strategies and plans. The paper provides insight into the possibilities......Based on the conclusions of a completed Ph.D. thesis and post doctoral research activities, this paper describes and analyses environmental objectives and strategies have materialised in three cases of local transport policy making and planning; in the urban areas of Lund (Sweden), Groningen (The...... of renewed public policy, mainly in terms of collaborative approaches. The cases show the importance of open-ended discursive interactions as well as of more flexible institutional arrangements across sectors and political levels. Interactive and more network-based policymaking practices seem to have...
Information System for the Goods Transport Service Network
Caj Holm
2008-05-01
Full Text Available Intermodal transport can reduce the load of the road infrastructure.Knowledge gives it the necessary competitiveness andhelps to control its costs. Fast reaction to changing conditions,opportunities and requirements gives remarkable advantage.Setting up integrated logistic chains using alternative transportmodes requires the trust and close interaction of a variety of actorsinvolved in managing the chain. Especially in the dynamicmobile environment, knowledge has so far not been effectivelyused. FREIGHTWISE tackles this complexity by developing aframework architecture anchored and validated in a range ofdemonstration cases involving commercial and public actors.This paper discusses the general FREIGHTWISE objectivesand its North-East Case, the Logistiikkainfo goods transportservice network information system to be implemented for theEstonian - Finnish transport chain.
Transport and Storage Economics of CCS Networks in the Netherlands
NONE
2013-04-15
A team from the Rotterdam Climate Initiative, CATO-2 (the Dutch national R and D programme on CCS) and the Clinton Climate Initiative, developed a financial model to assess the economics of alternative CO2 transport and storage options in the North Sea, based on common user infrastructure. The purpose of the financial model is to introduce a simple planning tool relating to the transport and storage components of an integrated CCS project using readily available, non-confidential data. A steering group of major emitters with advanced plans for CCS projects in the Netherlands and Belgium guided the project. Although the report focusses on potential projects in the Netherlands (Rotterdam and Eemshaven) and Belgium (Antwerp) in the short to medium term, the analysis and lessons could be useful to other regions considering CO2 network solutions.
An Algorithm for the Mixed Transportation Network Design Problem.
Liu, Xinyu; Chen, Qun
2016-01-01
This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. The idea of the proposed solution algorithm (DDIA) is to reduce the dimensions of the problem. A group of variables (discrete/continuous) is fixed to optimize another group of variables (continuous/discrete) alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems) and DNDPs (discrete network design problems) repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions). Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately.
Formal Description and Verification of a Transport Protocol for Local Networks
李腊元
1990-01-01
This paper discusses a transport protocol and its formal description techniques for local network.The transport layer function,The transport services and a transport protocol design in a local network architecture model are presente.A transport protocol specification using the finite state automate(FSA)is given.The correcness of the protocol is verified by using the reachability tree technique with respect to the protocol properties of completeness.deadlock and livelock freeness,termination and reachability.
Centrosymmetry enhances quantum transport in disordered molecular networks
Zech, Tobias; Mulet, Roberto; Wellens, Thomas; Buchleitner, Andreas
2014-05-01
For more than 50 years we have known that photosynthetic systems harvest solar energy with almost unit quantum efficiency. However, recent experimental evidence of quantum coherence during the excitonic energy transport in photosynthetic organisms challenges our understanding of this fundamental biological function. Currently, and despite numerous efforts, the causal connection between coherence and efficiency is still a matter of debate. We show, through extensive simulations of quantum coherent transport on networks, that three dimensional structures characterized by centro-symmetric Hamiltonians are statistically more efficient than random arrangements. Moreover, a strong correlation of centro-symmetry with quantum efficiency is also observed under the coherent transport dynamics induced by experimentally estimated electronic Hamiltonians of the Fenna-Mathew-Olson complex of sulfur bacteria and of the cryptophyte PC645 complex of marine algae. The application of a genetic algorithm results in a set of optimized Hamiltonians only when seeded from the experimentally estimated Hamiltonian. These results suggest that what appears to be geometrically disordered complexes may well exhibit an inherent hidden symmetry which enhances the energy transport between chromophores. We are confident that our results will motivate research to explore the properties of nearly centro-symmetric Hamiltonians in realistic environments, and to unveil the role of symmetries for quantum effects in biology. The unravelling of such symmetries may open novel perspectives and suggest new design principles in the development of artificial devices.
Building WDM wide area resilient transport network from 4-node semi-mesh and mesh sub-networks
Limal, Emmanuel; Mikkelsen, Benny; Stubkjær, Kristian
1997-01-01
This paper deals with optical transport network design using wavelength division multiplexing (WDM) facilities. It proposes a method for building networks from sub-network combinations. Two types of 4-node sub-networks and their properties are presented. For each sub-network, any fiber break can...... be recovered using re-routing paths. A European network set-up illustrates the method capabilities. The network has 19 nodes connected through 39 links distributed within 9 semi-mesh sub-networks. Comparison is made between local and non-local re-routing and between channel capacities of 2.5 and 10 Gb...
Gergely Tibély
Full Text Available Tagging items with descriptive annotations or keywords is a very natural way to compress and highlight information about the properties of the given entity. Over the years several methods have been proposed for extracting a hierarchy between the tags for systems with a "flat", egalitarian organization of the tags, which is very common when the tags correspond to free words given by numerous independent people. Here we present a complete framework for automated tag hierarchy extraction based on tag occurrence statistics. Along with proposing new algorithms, we are also introducing different quality measures enabling the detailed comparison of competing approaches from different aspects. Furthermore, we set up a synthetic, computer generated benchmark providing a versatile tool for testing, with a couple of tunable parameters capable of generating a wide range of test beds. Beside the computer generated input we also use real data in our studies, including a biological example with a pre-defined hierarchy between the tags. The encouraging similarity between the pre-defined and reconstructed hierarchy, as well as the seemingly meaningful hierarchies obtained for other real systems indicate that tag hierarchy extraction is a very promising direction for further research with a great potential for practical applications. Tags have become very prevalent nowadays in various online platforms ranging from blogs through scientific publications to protein databases. Furthermore, tagging systems dedicated for voluntary tagging of photos, films, books, etc. with free words are also becoming popular. The emerging large collections of tags associated with different objects are often referred to as folksonomies, highlighting their collaborative origin and the "flat" organization of the tags opposed to traditional hierarchical categorization. Adding a tag hierarchy corresponding to a given folksonomy can very effectively help narrowing or broadening the scope of
Tibély, Gergely; Pollner, Péter; Vicsek, Tamás; Palla, Gergely
2013-01-01
Tagging items with descriptive annotations or keywords is a very natural way to compress and highlight information about the properties of the given entity. Over the years several methods have been proposed for extracting a hierarchy between the tags for systems with a "flat", egalitarian organization of the tags, which is very common when the tags correspond to free words given by numerous independent people. Here we present a complete framework for automated tag hierarchy extraction based on tag occurrence statistics. Along with proposing new algorithms, we are also introducing different quality measures enabling the detailed comparison of competing approaches from different aspects. Furthermore, we set up a synthetic, computer generated benchmark providing a versatile tool for testing, with a couple of tunable parameters capable of generating a wide range of test beds. Beside the computer generated input we also use real data in our studies, including a biological example with a pre-defined hierarchy between the tags. The encouraging similarity between the pre-defined and reconstructed hierarchy, as well as the seemingly meaningful hierarchies obtained for other real systems indicate that tag hierarchy extraction is a very promising direction for further research with a great potential for practical applications. Tags have become very prevalent nowadays in various online platforms ranging from blogs through scientific publications to protein databases. Furthermore, tagging systems dedicated for voluntary tagging of photos, films, books, etc. with free words are also becoming popular. The emerging large collections of tags associated with different objects are often referred to as folksonomies, highlighting their collaborative origin and the "flat" organization of the tags opposed to traditional hierarchical categorization. Adding a tag hierarchy corresponding to a given folksonomy can very effectively help narrowing or broadening the scope of search. Moreover
Tibély, Gergely; Pollner, Péter; Vicsek, Tamás; Palla, Gergely
2013-01-01
Tagging items with descriptive annotations or keywords is a very natural way to compress and highlight information about the properties of the given entity. Over the years several methods have been proposed for extracting a hierarchy between the tags for systems with a "flat", egalitarian organization of the tags, which is very common when the tags correspond to free words given by numerous independent people. Here we present a complete framework for automated tag hierarchy extraction based on tag occurrence statistics. Along with proposing new algorithms, we are also introducing different quality measures enabling the detailed comparison of competing approaches from different aspects. Furthermore, we set up a synthetic, computer generated benchmark providing a versatile tool for testing, with a couple of tunable parameters capable of generating a wide range of test beds. Beside the computer generated input we also use real data in our studies, including a biological example with a pre-defined hierarchy between the tags. The encouraging similarity between the pre-defined and reconstructed hierarchy, as well as the seemingly meaningful hierarchies obtained for other real systems indicate that tag hierarchy extraction is a very promising direction for further research with a great potential for practical applications. Tags have become very prevalent nowadays in various online platforms ranging from blogs through scientific publications to protein databases. Furthermore, tagging systems dedicated for voluntary tagging of photos, films, books, etc. with free words are also becoming popular. The emerging large collections of tags associated with different objects are often referred to as folksonomies, highlighting their collaborative origin and the “flat” organization of the tags opposed to traditional hierarchical categorization. Adding a tag hierarchy corresponding to a given folksonomy can very effectively help narrowing or broadening the scope of search
王亚飞
2015-01-01
The safety evaluation of computer network is influenced by many factors, such as operation mentality, network characteristics, external environment and so on. So, it is important to take comprehensive assessment for the safety performance of it. This paper evaluates the safety of computer network by fuzzy analytical hierarchy process and gives full play to the advantages of fuzzy mathematics to get the best evaluation effect.%计算机网络安全评价受到操作心理、网络特征、外界环境等多种因素的影响，必须对其安全性能展开综合评价。本文使用模糊综合评价法对计算机网络安全进行评价，充分发挥模糊数学的优势，获取最佳的评价效果。
Hierarchy in complex systems: the possible and the actual
Corominas-Murtra, Bernat; Solé, Ricard V; Rodríguez-Caso, Carlos
2013-01-01
Hierarchy seems to pervade complexity in both living and artificial systems. Despite its relevance, no general theory that captures all features of hierarchy and its origins has been proposed yet. Here we present a formal approach resulting from the convergence of theoretical morphology and network theory that allows constructing a 3D morphospace of hierarchies and hence comparing the hierarchical organization of ecological, cellular, technological and social networks. Embedded within large voids in the morphospace of all possible hierarchies, four major groups are identified. Two of them match the expected from random networks with similar connectivity, thus suggesting that non-adaptive factors are at work. Ecological and gene networks define the other two, indicating that their topological order is the result of functional constraints. These results are consistent with an exploration of the morphospace using {\\em in silico} evolved networks.
Karpenko Oksana O.
2013-11-01
Full Text Available Development of mixed transportation is a prospective direction of development of the transportation system of Ukraine. The article analyses the modern state of development of mixed transportation of freight in Ukraine. The most popular types of combined transportation (refers to multi-modal are container and contrailer trains, which are formed both in Ukraine (Viking and Yaroslav and in other countries, first of all, Belarus (Zubr. One of the reasons of underdevelopment of mixed transportation of freight in Ukraine is absence of a developed network of transportation and logistic centres. The article offers to form a network of transportation and logistic centres in Ukraine as a way of intensification of development of mixed transportations of freight, since they facilitate co-ordination of use of various types of transport and support integrated management of material flows. Transportation and logistic centres should become a start-up complex, around which transportation and logistic clusters would be gradually formed. Transportation and logistic clusters is a new efficient form of network organisation and management of transportation and logistic services and they also ensure growth of efficiency of use of the regional transportation and logistic potential of Ukraine. The article shows prospective supporting transportation and logistic centres and centres of formation of transportation and logistic clusters in the territory of Ukraine. Formation of efficient transportation and logistic system of Ukraine on the basis of a network of transportation and logistic clusters would facilitate entering of Ukraine into the world transportation environment and would allow acceleration of introduction of efficient logistic schemes of freight delivery, in particular, mixed transportation of freight.
Disruption and adaptation of urban transport networks from flooding
Pregnolato Maria
2016-01-01
Full Text Available Transport infrastructure networks are increasingly vulnerable to disruption from extreme rainfall events due to increasing surface water runoff from urbanization and changes in climate. Impacts from such disruptions typically extend far beyond the flood footprint, because of the interconnection and spatial extent of modern infrastructure. An integrated flood risk assessment couples high resolution information on depth and velocity from the CityCAT urban flood model with empirical analysis of vehicle speeds in different depths of flood water, to perturb a transport accessibility model and determine the impact of a given event on journey times across the urban area. A case study in Newcastle-upon-Tyne (UK shows that even minor flooding associate with a 1 in 10 year event can cause traffic disruptions of nearly half an hour. Two adaptation scenarios are subsequently tested (i hardening (i.e. flood protection a single major junction, (ii introduction of green roofs across all buildings. Both options have benefits in terms of reduced disruption, but for a 1 in 200 year event greening all roofs in the city provided only three times the benefit of protecting one critical road junction, highlighting the importance of understanding network attributes such as capacity and flows.
Trans-Canada Slimeways: Slime mould imitates the Canadian transport network
Adamatzky, Andrew
2011-01-01
Slime mould Physarum polycephalum builds up sophisticated networks to transport nutrients between distant part of its extended body. The slime mould's protoplasmic network is optimised for maximum coverage of nutrients yet minimum energy spent on transportation of the intra-cellular material. In laboratory experiments with P. polycephalum we represent Canadian major urban areas with rolled oats and inoculated slime mould in the Toronto area. The plasmodium spans the urban areas with its network of protoplasmic tubes. We uncover similarities and differences between the protoplasmic network and the Canadian national highway network, analyse the networks in terms of proximity graphs and evaluate slime mould's network response to contamination.
王悦; 曾小舟; 傅骏
2015-01-01
运用层次聚类法和FCM算法，从Kotler四维顾客价值角度构建航空客运市场细分量表，形成施测问卷，获取样本数据。将因子分析与基于层次聚类的FCM算法相结合，获得4类差距明显的子市场，并验证了市场细分的有效性。研究结果表明，基于层次聚类的FCM算法细分航空客运市场能够获得较为满意的结果，也验证了该混合算法的合理性、有效性和可操作性，其中细分量表与基于层次聚类的FCM算法可作为航空客运主体细分市场的依据和方法。%Combining the strengths of the hierarchy clustering method and the fuzzy c -means ( FCM) algorithm, the practi-cal issue of the market segmentation ( MS) of the air passenger transport was analyzed .The market segmentation scale for the air passenger transport was constructed from the Kotler's four-dimensional customer value ( CV) .On the basis of the scale , a ques-tionnaire was formed and the correspondent data were collected .Combining the factor analysis and the joint algorithm of hierarchy clustering and FCM , four segmented markets with significant differences were finally obtained .The mean value analysis and the variance analysis were applied to verify the effectiveness of the result .The results demonstrate that by applying the joint algorithm of hierarchy clustering and FCM , combining Kotler's four-dimensional CV , the market of air passenger transport could be desira-bly segmented.In turn, the results also confirm the feasibility and reasonableness of the joint algorithm .The market segmentation scale and the joint algorithm can be utilized for the MS for the operational subjects in civil aviation .
Hierarchy of gene expression data is predictive of future breast cancer outcome
Chen, Man; Deem, Michael W.
2013-10-01
We calculate measures of hierarchy in gene and tissue networks of breast cancer patients. We find that the likelihood of metastasis in the future is correlated with increased values of network hierarchy for expression networks of cancer-associated genes, due to the correlated expression of cancer-specific pathways. Conversely, future metastasis and quick relapse times are negatively correlated with the values of network hierarchy in the expression network of all genes, due to the dedifferentiation of gene pathways and circuits. These results suggest that the hierarchy of gene expression may be useful as an additional biomarker for breast cancer prognosis.
Density-Based and Transport-Based Core-Periphery Structures in Networks
Lee, Sang Hoon; Porter, Mason A
2013-01-01
Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transportation. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks---including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that this new diagnostic i...
Secure Data Network System (SDNS) network, transport, and message security protocols
Dinkel, C.
1990-03-01
The Secure Data Network System (SDNS) project, implements computer to computer communications security for distributed applications. The internationally accepted Open Systems Interconnection (OSI) computer networking architecture provides the framework for SDNS. SDNS uses the layering principles of OSI to implement secure data transfers between computer nodes of local area and wide area networks. Four security protocol documents developed by the National Security Agency (NSA) as output from the SDNS project are included. SDN.301 provides the framework for security at layer 3 of the OSI Model. Cryptographic techniques to provide data protection for transport connections or for connectionless-mode transmission are described in SDN.401. Specifications for message security service and protocol are contained in SDN.701. Directory System Specifications for Message Security Protocol are covered in SDN.702.
Adaptive fuzzy-neural-network control for maglev transportation system.
Wai, Rong-Jong; Lee, Jeng-Dao
2008-01-01
A magnetic-levitation (maglev) transportation system including levitation and propulsion control is a subject of considerable scientific interest because of highly nonlinear and unstable behaviors. In this paper, the dynamic model of a maglev transportation system including levitated electromagnets and a propulsive linear induction motor (LIM) based on the concepts of mechanical geometry and motion dynamics is developed first. Then, a model-based sliding-mode control (SMC) strategy is introduced. In order to alleviate chattering phenomena caused by the inappropriate selection of uncertainty bound, a simple bound estimation algorithm is embedded in the SMC strategy to form an adaptive sliding-mode control (ASMC) scheme. However, this estimation algorithm is always a positive value so that tracking errors introduced by any uncertainty will cause the estimated bound increase even to infinity with time. Therefore, it further designs an adaptive fuzzy-neural-network control (AFNNC) scheme by imitating the SMC strategy for the maglev transportation system. In the model-free AFNNC, online learning algorithms are designed to cope with the problem of chattering phenomena caused by the sign action in SMC design, and to ensure the stability of the controlled system without the requirement of auxiliary compensated controllers despite the existence of uncertainties. The outputs of the AFNNC scheme can be directly supplied to the electromagnets and LIM without complicated control transformations for relaxing strict constrains in conventional model-based control methodologies. The effectiveness of the proposed control schemes for the maglev transportation system is verified by numerical simulations, and the superiority of the AFNNC scheme is indicated in comparison with the SMC and ASMC strategies.
Sediment Transport Model For Storm Sewer Networks Towards The Operational Risks
I. RÁTKY
2016-11-01
Full Text Available Sediment transport in sewer networks can be critical in economical and safety point of view. To improve the operation of the sewer networks we are presenting a model, which is capable of numerical simulations of the sediment transport in storm water network. The developed model is calculating the change of the particle distribution of the sediment fractions including the effects of settling and mixing up processes. The results of the model calculations in a simplified network are also presented. We are also planning to apply the developed sediment transport module by coupling to a hydrodynamic simulation for practical tasks supporting the design and operation of sewers networks.
León-Montiel, Roberto de J.; Quiroz-Juárez, Mario A.; Quintero-Torres, Rafael; Domínguez-Juárez, Jorge L.; Moya-Cessa, Héctor M.; Torres, Juan P.; Aragón, José L.
2015-01-01
Noise is generally thought as detrimental for energy transport in coupled oscillator networks. However, it has been shown that for certain coherently evolving systems, the presence of noise can enhance, somehow unexpectedly, their transport efficiency; a phenomenon called environment-assisted quantum transport (ENAQT) or dephasing-assisted transport. Here, we report on the experimental observation of such effect in a network of coupled electrical oscillators. We demonstrate that by introducing stochastic fluctuations in one of the couplings of the network, a relative enhancement in the energy transport efficiency of 22.5 ± 3.6% can be observed. PMID:26610864
Enhancing energy transport in electrical-oscillator networks via off-diagonal dynamical disorder
León-Montiel, Roberto de J; Quintero-Torres, Rafael; Domínguez-Juárez, Jorge L; Moya-Cessa, Héctor M; Torres, Juan P; Aragón, José L
2015-01-01
Noise is generally thought as detrimental for energy transport in coupled oscillator networks. However, it has been shown that for certain coherently evolving systems, the presence of noise can enhance, somehow unexpectedly, their transport efficiency; a phenomenon called environment-assisted quantum transport (ENAQT) or dephasing-assisted transport. Here, we report on the experimental observation of such effect in a network of coupled electrical oscillators. We demonstrate that by introducing stochastic fluctuations in one of the couplings of the network, a relative enhancement in the energy transport efficiency of $22.5 \\pm 3.6\\,\\%$ can be observed.
Dobrajska, Magdalena; Billinger, Stephan; Karim, Samina
2015-01-01
We investigate trade-offs associated with delegating authority over multiple interrelated decisions in a complex task structure. The empirical setting is a business process of a global Fortune 50 firm. The firm decentralized its organization and redefined decision authority across organizational......-relevant knowledge, the matching of required knowledge and managers’ expertise, and information processing intensity affect (a) the occurrence of delegation and, (b) if delegation occurs, how far down the organizational hierarchy authority is delegated. We discuss how these findings complement existing theories...... hierarchies between 2008 and 2011. We employ regression analysis of microlevel data on the allocation of decision authority between formal and real authority, and further on the organization design of 761 decision tasks within a hierarchy. Our findings show how the specialization of decision...
Rethinking the waste hierarchy
Rasmussen, C.; Vigsoe, D. (eds.)
2005-03-01
There is an increasing need to couple environmental and economic considerations within waste management. Consumers and companies alike generate ever more waste. The waste-policy challenges of the future lie in decoupling growth in waste generation from growth in consumption, and in setting priorities for the waste management. This report discusses the criteria for deciding priorities for waste management methods, and questions the current principles of EU waste policies. The basis for the discussion is the so-called waste hierarchy which has dominated the waste policy in the EU since the mid-1970s. The waste hierarchy ranks possible methods of waste management. According to the waste hierarchy, the very best solution is to reduce the amount of waste. After that, reuse is preferred to recycling which, in turn, is preferred to incineration. Disposal at a landfill is the least favourable solution. (BA)
Tibély, Gergely; Vicsek, Tamás; Palla, Gergely
2014-01-01
Tagging items with descriptive annotations or keywords is a very natural way to compress and highlight information about the properties of the given entity. Over the years several methods have been proposed for extracting a hierarchy between the tags for systems with a "flat", egalitarian organization of the tags, which is very common when the tags correspond to free words given by numerous independent people. Here we present a complete framework for automated tag hierarchy extraction based on tag occurrence statistics. Along with proposing new algorithms, we are also introducing different quality measures enabling the detailed comparison of competing approaches from different aspects. Furthermore, we set up a synthetic, computer generated benchmark providing a versatile tool for testing, with a couple of tunable parameters capable of generating a wide range of test beds. Beside the computer generated input we also use real data in our studies, including a biological example with a pre-defined hierarchy betwe...
TRACKING VEHICLE IN GSM NETWORK TO SUPPORT INTELLIGENT TRANSPORTATION SYSTEMS
Z. Koppanyi
2012-07-01
Full Text Available The penetration of GSM capable devices is very high, especially in Europe. To exploit the potential of turning these mobile devices into dynamic data acquisition nodes that provides valuable data for Intelligent Transportation Systems (ITS, position information is needed. The paper describes the basic operation principles of the GSM system and provides an overview on the existing methods for deriving location data in the network. A novel positioning solution is presented that rely on handover (HO zone measurements; the zone geometry properties are also discussed. A new concept of HO zone sequence recognition is introduced that involves application of Probabilistic Deterministic Finite State Automata (PDFA. Both the potential commercial applications and the use of the derived position data in ITS is discussed for tracking vehicles and monitoring traffic flow. As a practical cutting edge example, the integration possibility of the technology in the SafeTRIP platform (developed in an EC FP7 project is presented.
Resilient design of recharging station networks for electric transportation vehicles
Kris Villez; Akshya Gupta; Venkat Venkatasubramanian
2011-08-01
As societies shift to 'greener' means of transportation using electricity-driven vehicles one critical challenge we face is the creation of a robust and resilient infrastructure of recharging stations. A particular issue here is the optimal location of service stations. In this work, we consider the placement of battery replacing service station in a city network for which the normal traffic flow is known. For such known traffic flow, the service stations are placed such that the expected performance is maximized without changing the traffic flow. This is done for different scenarios in which roads, road junctions and service stations can fail with a given probability. To account for such failure probabilities, the previously developed facility interception model is extended. Results show that service station failures have a minimal impact on the performance following robust placement while road and road junction failures have larger impacts which are not mitigated easily by robust placement.
Tracking Vehicle in GSM Network to Support Intelligent Transportation Systems
Koppanyi, Z.; Lovas, T.; Barsi, A.; Demeter, H.; Beeharee, A.; Berenyi, A.
2012-07-01
The penetration of GSM capable devices is very high, especially in Europe. To exploit the potential of turning these mobile devices into dynamic data acquisition nodes that provides valuable data for Intelligent Transportation Systems (ITS), position information is needed. The paper describes the basic operation principles of the GSM system and provides an overview on the existing methods for deriving location data in the network. A novel positioning solution is presented that rely on handover (HO) zone measurements; the zone geometry properties are also discussed. A new concept of HO zone sequence recognition is introduced that involves application of Probabilistic Deterministic Finite State Automata (PDFA). Both the potential commercial applications and the use of the derived position data in ITS is discussed for tracking vehicles and monitoring traffic flow. As a practical cutting edge example, the integration possibility of the technology in the SafeTRIP platform (developed in an EC FP7 project) is presented.
Güntert, Manuel
2008-01-01
This is a research about hierarchies in student groups. It shows how they are built und what sense they have. The position of a student in his student peer group is evaluated. The influence of the look, the style, the behaviour of the other sex, the gender, the origin, the prehistory, the appearance, achievement and their effect on hierarchies is analysed and the impact of charisma and organisation are compared. The meaning of this research is to indicate how a student must be to get the lead...
Nonlinear electrokinetic transport in networks of microscale and nanoscale pores
Alizadeh, Shima; Andersen, Mathias B.; Mani, Ali
2012-11-01
The objective of this study is to develop the understanding of nonlinear electrohydrodynamic effects in a wide range of systems including lab-on-a-chip systems, electroosmotic pumps, and, in general, porous media with random or fabricated pore morphology. We present a continuum model in which these systems are described as massive networks of long and thin pores. The thickness of the pores can vary from nanoscale to microscale, corresponding to the highly overlapped electric double layers (EDL) to the thin double layer limit. Within each pore the transport in the wall-normal direction is assumed to be in equilibrium leading to a reduced order model for the axial transport of species in the form of a transient one-dimensional partial differential equation (PDE). PDEs from different pores are coupled through boundary conditions at the pore intersections by proper implementation of the conservation laws. We show that this model can capture important nonlinear dynamics, which are typically ignored in homogenized models. Specifically, our model captures concentration polarization shocks and flow recirculation zones respectively formed when micropores and nanopores are connected in series and in parallel. We present a comparison between our model and recent experiments in microfluidics, and will discuss applications in porous media modeling for energy storage and water purification systems.
Optimization of China Crude Oil Transportation Network with Genetic Ant Colony Algorithm
Yao Wang
2015-08-01
Full Text Available Taking into consideration both shipping and pipeline transport, this paper first analysed the risk factors for different modes of crude oil import transportation. Then, based on the minimum of both transportation cost and overall risk, a multi-objective programming model was established to optimize the transportation network of crude oil import, and the genetic algorithm and ant colony algorithm were employed to solve the problem. The optimized result shows that VLCC (Very Large Crude Carrier is superior in long distance sea transportation, whereas pipeline transport is more secure than sea transport. Finally, this paper provides related safeguard suggestions on crude oil import transportation.
FANG Jin-Qing; LUO Xiao-Shu; HUANG Guo-Xian
2006-01-01
Subject of the halo-chaos control in beam transport networks (channels) has become a key concerned issue for many important applications of high-current proton beam since 1990'. In this paper, the magnetic field adaptive control based on the neuralnetwork with time-delayed feedback is proposed for suppressing beam halo-chaos in the beam transport network with periodic focusing channels. The envelope radius of high-current proton beam is controlled to reach the matched beam radius by suitably selecting the control structure and parameter of the neural network, adjusting the delayed-time and control coefficient of the neural network.
Criteria for optimizing cortical hierarchies with continuous ranges
Antje Krumnack
2010-03-01
Full Text Available In a recent paper (Reid et al.; 2009, NeuroImage we introduced a method to calculate optimal hierarchies in the visual network that utilizes continuous, rather than discrete, hierarchical levels, and permits a range of acceptable values rather than attempting to fit fixed hierarchical distances. There, to obtain a hierarchy, the sum of deviations from the constraints that define the hierarchy was minimized using linear optimization. In the short time since publication of that paper we noticed that many colleagues misinterpreted the meaning of the term optimal hierarchy. In particular, a majority of them were under the impression that there was perhaps only one optimal hierarchy, but a substantial difficulty in finding that one. However, there is not only more than one optimal hierarchy but also more than one option for defining optimality. Continuing the line of this work we look at additional options for optimizing the visual hierarchy: minimizing the number of violated constraints and minimizing the maximal size of a constraint violation using linear optimization and mixed integer programming. The implementation of both optimization criteria is explained in detail. In addition, using constraint sets based on the data from Felleman and Van Essen, optimal hierarchies for the visual network are calculated for both optimization methods.
Forness, Steven R.
1973-01-01
Reinforcement hierarchy implies movement along a continuum from top to bottom, from primitive levels of reinforcement to more sophisticated levels. Unless it is immediately obvious that a child cannot function without the use of lower-order reinforcers, we should approach him as though he responds to topmost reinforcers until he demonstrates…
黄超; 程乃平
2013-01-01
Heterogeneous network is popular in the development of mobile network,in which the switching technology plays an important role. The vertical switching technology is studied based on the heterogeneous network. Analytic hierarchy pro⁃cess is used to solve the problem of the weighting coefficient with the different attributes in the cost function. It provides a reference for the network switching when the network status is affected by multiple factors.% 异构网络是移动互联网的热门发展方向，切换技术是其研究的重要内容。基于异构网络，对其垂直切换技术进行研究。采用系统研究中的层次分析方法，解决目标代价函数中不同属性的加权系数计算问题，为多个因素共同影响网络状态时进行网络切换选择提供了参考依据。
Optimal transportation network with concave cost functions: loop analysis and algorithms.
Shao, Zhen; Zhou, Haijun
2007-06-01
Transportation networks play a vital role in modern societies. Structural optimization of a transportation system under a given set of constraints is an issue of great practical importance. For a general transportation system whose total cost C is determined by C = Sigma(ioptimal network topology is a tree if C(ij) proportional |I(ij)|(gamma) with 0 optimality of tree-formed networks is given. The simple intuitive picture of this proof then leads to an efficient global algorithm for the searching of optimal structures for a given transportation system with concave cost functions.
An extension of heat hierarchy
Wang, Joe S.
2014-01-01
We propose a formally completely integrable extension of heat hierarchy based on the space of symmetries isomorphic to the Weyl algebra $\\mathcal{A}_1$. The extended heat hierarchy will be the basic model for the analysis of the extension of KP hierarchy, and other integrable equations.
Network Modelling of the Influence of Swelling on the Transport Behaviour of Bentonite
Ignatios Athanasiadis; Simon Wheeler; Peter Grassl
2016-01-01
Wetting of bentonite is a complex hydro-mechanical process that involves swelling and, if confined, significant structural changes in its void structure. A coupled structural transport network model is proposed to investigate the effect of wetting of bentonite on retention conductivity and swelling pressure response. The transport network of spheres and pipes, representing voids and throats, respectively, relies on Laplace–Young’s equation to model the wetting process. The structural network ...
Ansatz for dynamical hierarchies
Rasmussen, S.; Baas, N.A.; Mayer, B.
2001-01-01
Complex, robust functionalities can be generated naturally in at least two ways: by the assembly of structures and by the evolution of structures. This work is concerned with spontaneous formation of structures. We define the notion of dynamical hierarchies in natural systems and show...... the importance of this particular kind of organization for living systems. We then define a framework that enables us to formulate, investigate, and manipulate such dynamical hierarchies. This framework allows us to simultaneously investigate different levels of description together with them interrelationship...... three. Formulating this system as a simple two-dimensional molecular dynamics (MD) lattice gas allows us within one dynamical system to demonstrate the successive emergence of two higher levels (three levels all together) of robust structures with associated properties. Second, we demonstrate how...
Hierarchies in Dependence Logic
Durand, Arnaud
2011-01-01
We study fragments of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these fragments of dependence logic. We also show that these both ways of defining fragments of dependence logic give rise to a hierarchy in expressive power with respect to k.
Ma, Xiaolei; Dai, Zhuang; He, Zhengbing; Ma, Jihui; Wang, Yong; Wang, Yunpeng
2017-04-10
This paper proposes a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy. Spatiotemporal traffic dynamics are converted to images describing the time and space relations of traffic flow via a two-dimensional time-space matrix. A CNN is applied to the image following two consecutive steps: abstract traffic feature extraction and network-wide traffic speed prediction. The effectiveness of the proposed method is evaluated by taking two real-world transportation networks, the second ring road and north-east transportation network in Beijing, as examples, and comparing the method with four prevailing algorithms, namely, ordinary least squares, k-nearest neighbors, artificial neural network, and random forest, and three deep learning architectures, namely, stacked autoencoder, recurrent neural network, and long-short-term memory network. The results show that the proposed method outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time. The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks.
Lagrangian Flow networks: a new way to characterize transport and connectivity in geophysical flows
Ser-Giacomi, Enrico; Hernandez-Garcia, Emilio; Lopez, Cristobal; Rossi, Vincent; Vasile, Ruggero
2015-04-01
Water and air transport are among the basic processes shaping the climate of our planet. Heat and salinity fluxes change sea water density, and thus drive the global thermohaline circulation. Atmospheric winds force the ocean motion, and also transport moisture, heat or chemicals, impacting the regional climate. We describe transport among different regions of the ocean or the atmosphere by flow networks, giving a discrete and robust representation of the fluid advection dynamics. We use network-theory tools to gain insights into transport problem. Local and global features of the networks are extracted from many numerical experiments to give a time averaged description of the system. Classical concepts like dispersion, mixing and connectivity are finally related to a set of network-like objects contributing to build a "dictionary" between network measures and physical quantities in geophysical flows.
Chinthavali, Supriya [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2016-04-01
Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) and the criticality index is found to be effective for one test network to identify the vulnerable nodes.
Pruning to Increase Taylor Dispersion in Physarum polycephalum Networks
Marbach, Sophie; Andrew, Natalie; Pringle, Anne; Brenner, Michael P
2016-01-01
How do the topology and geometry of a tubular network affect the spread of particles within fluid flows? We investigate patterns of effective dispersion in the hierarchical, biological transport network formed by Physarum polycephalum. We demonstrate that a change in topology - pruning in the foraging state - causes a large increase in effective dispersion throughout the network. By comparison, changes in the hierarchy of tube radii result in smaller and more localized differences. Pruned networks capitalize on Taylor dispersion to increase the dispersion capability.
Distributed Approach for Solving Time-Dependent Problems in Multimodal Transport Networks
Carlos Galvez-Fernandez
2009-01-01
Full Text Available This paper presents an alternative approach for time-dependent multimodal transport problem. We describe a new graph structure to abstract multimodal networks, called transfer graph, which adapts to the distributed nature of real information sources of transportation networks. A decomposition of the Shortest Path Problem in transfer graph is proposed to optimize the computation time. This approach was computationally tested in several experimental multimodal networks having different size and complexity. The approach was integrated in the multimodal transport service of the European Carlink platform, where it has been validated in real scenarios. Comparision with other related works is provided.
Nonlinear Integrable Couplings of Levi Hierarchy and WKI Hierarchy
Zhengduo Shan
2014-01-01
Full Text Available With the help of the known Lie algebra, a type of new 8-dimensional matrix Lie algebra is constructed in the paper. By using the 8-dimensional matrix Lie algebra, the nonlinear integrable couplings of the Levi hierarchy and the Wadati-Konno-Ichikawa (WKI hierarchy are worked out, which are different from the linear integrable couplings. Based on the variational identity, the Hamiltonian structures of the above hierarchies are derived.
Nonlinear Integrable Couplings of Levi Hierarchy and WKI Hierarchy
Zhengduo Shan; Hongwei Yang; Baoshu Yin
2014-01-01
With the help of the known Lie algebra, a type of new 8-dimensional matrix Lie algebra is constructed in the paper. By using the 8-dimensional matrix Lie algebra, the nonlinear integrable couplings of the Levi hierarchy and the Wadati-Konno-Ichikawa (WKI) hierarchy are worked out, which are different from the linear integrable couplings. Based on the variational identity, the Hamiltonian structures of the above hierarchies are derived.
Analysis on Topological Properties of Dalian Hazardous Materials Road Transportation Network
Pengyun Chong
2015-01-01
Full Text Available To analyze the topological properties of hazardous materials road transportation network (HMRTN, this paper proposed two different ways to construct the cyberspace of HMRTN and constructed their complex network models, respectively. One was the physical network model of HMRTN based on the primal approach and the other was the service network model of HMRTN based on neighboring nodes. The two complex network models were built by using the case of Dalian HMRTN. The physical network model contained 154 nodes and 238 edges, and the statistical analysis results showed that (1 the cumulative node degree of physical network was subjected to exponential distribution, showing the network properties of random network and that (2 the HMRTN had small characteristic path length and large network clustering coefficient, which was a typical small-world network. The service network model contained 569 nodes and 1318 edges, and the statistical analysis results showed that (1 the cumulative node degree of service network was subjected to power-law distribution, showing the network properties of scale-free network and that (2 the relationship between nodes strength and their descending order ordinal and the relationship between nodes strength and cumulative nodes strength were both subjected to power-law distribution, also showing the network properties of scale-free network.
Framework for path finding in multi-layer transport networks
F. Dijkstra
2009-01-01
In only a few decades the use of computer networks has dramatically increased. Today, networks are ubiquitous in society: they are used for surfing, email and financial transactions. The capacity of the network has increased so much, that it is now possible to transfer massive data sets that recentl
Design of multimodal transport networks: A hierarchical approach
Van Nes, R.
2002-01-01
Multimodal transport, that is using two or more transport modes for a trip between which a transfer is necessary, seems an interesting approach to solving today's transportation problems with respect to the deteriorating accessibility of city centres, recurrent congestion, and environmental impact.
Design of multimodal transport networks: A hierarchical approach
Van Nes, R.
2002-01-01
Multimodal transport, that is using two or more transport modes for a trip between which a transfer is necessary, seems an interesting approach to solving today's transportation problems with respect to the deteriorating accessibility of city centres, recurrent congestion, and environmental impact.
Intermodal Barge Transport: Network Design, Nodes and Competitiveness
Konings, J.W.
2009-01-01
The thesis addresses the opportunities and conditions to increase the market share of intermodal barge transport in Northwest Europe. In particular, it focuses on strategies to improve the performances of the different links of the intermodal transport chain: the barge transport services, the transh
Coherent site-directed transport in complex molecular networks: an effective Hamiltonian approach.
Weissman, Shira; Peskin, Uri
2010-03-21
Defining the conditions for coherent site-directed transport from an electron donor to a specific acceptor through tunneling barriers in a network of multiple donor/acceptors sites is an important step toward controlling electronic processes in molecular networks. The required analysis is most challenging since the entire network in essentially involved in coherent transport. In this work we introduce an efficient approach for formulating an effective donor/acceptor coupling in terms of the entire network parameters. The approach is based on implementation of Feshbach projection operators to map the entire network Hamiltonian onto a subspace defined by two specific donor and acceptor sites. This nonperturbative approach enables to define regimes of network parameters in which the effective donor-acceptor coupling is optimal. This is demonstrated numerically for simple models of molecular networks.
A link-adding strategy for transport efficiency of complex networks
Ma, Jinlong; Han, Weizhan; Guo, Qing; Wang, Zhenyong; Zhang, Shuai
2016-12-01
The transport efficiency is one of the critical parameters to evaluate the performance of a network. In this paper, we propose an improved efficient (IE) strategy to enhance the network transport efficiency of complex networks by adding a fraction of links to an existing network based on the node’s local degree centrality and the shortest path length. Simulation results show that the proposed strategy can bring better traffic capacity and shorter average shortest path length than the low-degree-first (LDF) strategy under the shortest path routing protocol. It is found that the proposed strategy is beneficial to the improvement of overall traffic handling and delivering ability of the network. This study can alleviate the congestion in networks, and is helpful to design and optimize realistic networks.
Adamatzky, Andrew; Van Dessel, Wesley
2011-01-01
Belgium is amongst few artificial countries, established on purpose, when Dutch and French speaking parts were joined in a single unit. This makes Belgium a particularly interesting testbed for studying bio-inspired techniques for simulation and analysis of vehicular transport networks. We imitate growth and formation of a transport network between major urban areas in Belgium using the acellular slime mould Physarum polycephalum. We represent the urban areas with the sources of nutrients. The slime mould spans the sources of nutrients with a network of protoplasmic tubes. The protoplasmic tubes represent the motorways. In an experimental laboratory analysis we compare the motorway network approximated by P. polycephalum and the man-made motorway network of Belgium. We evaluate the efficiency of the slime mould network and the motorway network using proximity graphs.
User-based representation of time-resolved multimodal public transportation networks
Alessandretti, Laura; Gauvin, Laetitia
2015-01-01
Multimodal transportation systems can be represented as time-resolved multilayer networks where different transportation modes connecting the same set of nodes are associated to distinct network layers. Their quantitative description became possible recently due to openly accessible datasets describing the geolocalised transportation dynamics of large urban areas. Advancements call for novel analytics, which combines earlier established methods and exploits the inherent complexity of the data. Here, our aim is to provide a novel user-based methodological framework to represent public transportation systems considering the total travel time, its variability across the schedule, and taking into account the number of transfers necessary. Using this framework we analyse public transportation systems in several French municipal areas. We incorporate travel routes and times over multiple transportation modes to identify efficient transportation connections and non-trivial connectivity patterns. The proposed method ...
Bureau of Transportation Statistics U.S. Road Networks - Cape Hatteras National Seashore
National Park Service, Department of the Interior — This data set portrays a Bureau of Transportation Statistics overview of the road networks for all fifty States, the District of Columbia, and Puerto Rico.
Consideration for wavelength multiplexing versus time multiplexing in optical transport network
Limal, Emmanuel; Stubkjær, Kristian Elmholdt
1999-01-01
We compare optical wavelength multiplexing and time multiplexing techniquesfor optical transport network by studying the space switch sizes of OXCs andtheir interfaces as a function of the fraction of add/drop traffic....
Delegated Contracting and Corporate Hierarchies
Choe, Chongwoo; Park, In-Uck
2004-01-01
In a typical corporate hierarchy, the manager is delegated the authority to make decisions that set directions for the organization, employ subordinates and contract with external suppliers. This paper explains when such delegation of authority can be optimal, using a model of a firm with three parties: the principal, the manager and the worker. In centralization with two two-tier hierarchies, the principal designs contracts for both agents. In delegation with a three-tier hierarchy, the prin...
MODELS AND METHODS FOR LOGISTICS HUB LOCATION: A REVIEW TOWARDS TRANSPORTATION NETWORKS DESIGN
Carolina Luisa dos Santos Vieira
Full Text Available ABSTRACT Logistics hubs affect the distribution patterns in transportation networks since they are flow-concentrating structures. Indeed, the efficient moving of goods throughout supply chains depends on the design of such networks. This paper presents a literature review on the logistics hub location problem, providing an outline of modeling approaches, solving techniques, and their applicability to such context. Two categories of models were identified. While multi-criteria models may seem best suited to find optimal locations, they do not allow an assessment of the impact of new hubs on goods flow and on the transportation network. On the other hand, single-criterion models, which provide location and flow allocation information, adopt network simplifications that hinder an accurate representation of the relationshipbetween origins, destinations, and hubs. In view of these limitations we propose future research directions for addressing real challenges of logistics hubs location regarding transportation networks design.
Hierarchies of Inefficient Kernelizability
Hermelin, Danny; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi
2011-01-01
The framework of Bodlaender et al. (ICALP 2008) and Fortnow and Santhanam (STOC 2008) allows us to exclude the existence of polynomial kernels for a range of problems under reasonable complexity-theoretical assumptions. However, there are also some issues that are not addressed by this framework, including the existence of Turing kernels such as the "kernelization" of Leaf Out Branching(k) into a disjunction over n instances of size poly(k). Observing that Turing kernels are preserved by polynomial parametric transformations, we define a kernelization hardness hierarchy, akin to the M- and W-hierarchy of ordinary parameterized complexity, by the PPT-closure of problems that seem likely to be fundamentally hard for efficient Turing kernelization. We find that several previously considered problems are complete for our fundamental hardness class, including Min Ones d-SAT(k), Binary NDTM Halting(k), Connected Vertex Cover(k), and Clique(k log n), the clique problem parameterized by k log n.
Palmkvist, Jakob, E-mail: palmkvist@ihes.fr [Institut des Hautes Etudes Scientifiques, 35 Route de Chartres, FR-91440 Bures-sur-Yvette (France)
2014-01-15
We introduce an infinite-dimensional Lie superalgebra which is an extension of the U-duality Lie algebra of maximal supergravity in D dimensions, for 3 ⩽ D ⩽ 7. The level decomposition with respect to the U-duality Lie algebra gives exactly the tensor hierarchy of representations that arises in gauge deformations of the theory described by an embedding tensor, for all positive levels p. We prove that these representations are always contained in those coming from the associated Borcherds-Kac-Moody superalgebra, and we explain why some of the latter representations are not included in the tensor hierarchy. The most remarkable feature of our Lie superalgebra is that it does not admit a triangular decomposition like a (Borcherds-)Kac-Moody (super)algebra. Instead the Hodge duality relations between level p and D − 2 − p extend to negative p, relating the representations at the first two negative levels to the supersymmetry and closure constraints of the embedding tensor.
Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks
Vizcaíno, Jorge López; Ye, Yabin; Tafur Monroy, Idelfonso
2012-01-01
The energy efficiency in telecommunication networks is gaining more relevance as the Internet traffic is growing. The introduction of OFDM and dynamic operation opens new horizons in the operation of optical networks, improving the network flexibility and its efficiency. In this paper, we compare...... the performance in terms of energy efficiency of a flexible-grid OFDM-based solution with a fixed-grid WDM network in a dynamic scenario with time-varying connections. We highlight the benefits that the bandwidth elasticity and the flexibility of selecting different modulation formats can offer compared...
Vanishing point: Scale independence in geomorphological hierarchies
Phillips, Jonathan D.
2016-08-01
Scale linkage problems in geosciences are often associated with a hierarchy of components. Both dynamical systems perspectives and intuition suggest that processes or relationships operating at fundamentally different scales are independent with respect to influences on system dynamics. But how far apart is "fundamentally different"-that is, what is the "vanishing point" at which scales are no longer interdependent? And how do we reconcile that with the idea (again, supported by both theory and intuition) that we can work our way along scale hierarchies from microscale to planetary (and vice-versa)? Graph and network theory are employed here to address these questions. Analysis of two archetypal hierarchical networks shows low algebraic connectivity, indicating low levels of inferential synchronization. This explains the apparent paradox between scale independence and hierarchical linkages. Incorporating more hierarchical levels results in an increase in complexity or entropy of the network as a whole, but at a nonlinear rate. Complexity increases as a power α of the number of levels in the hierarchy, with α < 1 and usually ≤ 0.6. However, algebraic connectivity decreases at a more rapid rate. Thus, the ability to infer one part of the hierarchical network from other level decays rapidly as more levels are added. Relatedness among system components decreases with differences in scale or resolution, analogous to distance decay in the spatial domain. These findings suggest a strategy of identifying and focusing on the most important or interesting scale levels, rather than attempting to identify the smallest or largest scale levels and work top-down or bottom-up from there. Examples are given from soil geomorphology and karst flow networks.
Bornard, P. [Reseau de Transport d' Electricite (RTE), Div. Systeme Electrique, 92 - Paris la Defense (France); Pavard, M. [Electricite de France (EDF), 75 - Paris (France); Testud, G. [Reseau de Transport d' Electricite (RTE), Dept. Exploitation du Systeme Electrique, 92 - Paris la Defense (France)
2005-10-01
Keeping the mastery of the safety of a power transportation system and respecting the contractual commitments with respect to the network users implies the implementation of efficient frequency and voltage adjustment systems. This article presents a synthetic overview of the methods and means implemented to ensure the adjustment of the voltage and frequency and the stability of very-high voltage power transportation networks: 1 - recalls of the general problem; 2 - frequency and active power adjustment: adapting generation to consumption, adapting consumption to generation; 3 - voltage and reactive power adjustment: duality of the voltage-reactive compensation adjustment, compensation of the reactive power, voltage adjustment chain, voltage adjustment of very high voltage networks, collapse of the voltage plan; 4 - alternators stability: static stability, transient stability, numerical simulation methods, stability improvement; 5 - conclusion. (J.S.)
Haiping Shi
2016-08-01
Full Text Available The capacity of the ship-lock at the Three Gorges Dam has become bottleneck of waterway transport and caused serious congestion. In this article, a continual network design model is established to solve the problem with minimizing the transport cost and environmental emission as well as infrastructure construction cost. In this bi-level model, the upper model gives the schemes of ship-lock expansion or construction of pass-dam highway. The lower model assigns the containers in the multi-mode network and calculates the transport cost, environmental emission, and construction investment. The solution algorithm to the model is proposed. In the numerical study, scenario analyses are done to evaluate the schemes and determine the optimal one in the context of different traffic demands. The result shows that expanding the ship-lock is better than constructing pass-dam highway.
Feminist Praxis, Critical Theory and Informal Hierarchies
Eva Giraud
2015-05-01
Full Text Available This article draws on my experiences teaching across two undergraduate media modules in a UK research-intensive institution to explore tactics for combatting both institutional and informal hierarchies within university teaching contexts. Building on Sara Motta’s (2012 exploration of implementing critical pedagogic principles at postgraduate level in an elite university context, I discuss additional tactics for combatting these hierarchies in undergraduate settings, which were developed by transferring insights derived from informal workshops led by the University of Nottingham’s Feminism and Teaching network into the classroom. This discussion is framed in relation to the concepts of “cyborg pedagogies” and “political semiotics of articulation,” derived from the work of Donna Haraway, in order to theorize how these tactics can engender productive relationships between radical pedagogies and critical theory.
A Methodology for Physical Interconnection Decisions of Next Generation Transport Networks
Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Madsen, Ole Brun
2011-01-01
The physical interconnection for optical transport networks has critical relevance in the overall network performance and deployment costs. As telecommunication services and technologies evolve, the provisioning of higher capacity and reliability levels is becoming essential for the proper...... development of Next Generation Networks. Currently, there is a lack of specific procedures that describe the basic guidelines to design such networks better than "best possible performance for the lowest investment". Therefore, the research from different points of view will allow a broader space...... of possibilities when designing the physical network interconnection. This paper develops and presents a methodology in order to deal with aspects related to the interconnection problem of optical transport networks. This methodology is presented as independent puzzle pieces, covering diverse topics going from...
daily mobility and adequacy of the urban transportation network a gis application
Véronique Mondou
2001-06-01
Full Text Available The subject of this paper is to define with precision which population groups are served by an urban transport network. The study takes into consideration the spatial and social aspects. Inequalities regarding the access to the network have been observed based on the distance to the centre and the social and professional statutes of the households.
Pore-network modeling of solute transport and biofilm growth in porous media
Qin, Chao Zhong; Hassanizadeh, S. Majid
2015-01-01
In this work, a pore-network (PN) model for solute transport and biofilm growth in porous media was developed. Compared to previous studies of biofilm growth, it has two new features. First, the constructed pore network gives a better representation of a porous medium. Second, instead of using a con
Application Research of Computer Network Technology in Mining Railway Transport Management System
余静; 王振军; 才庆祥
2002-01-01
This paper discussed the necessity of establishing a computer network in a mining railway transport management system. The network structure and the system security design, associated with the real development condition of a mining area, were brought forward, and the system evaluation was given.
Hummel, T.
2001-01-01
This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information i
Hummel, T.
2001-01-01
This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information
Hummel, T.
2001-01-01
This report is one in a series of publications, used in the development of the network planning tool ‘Safer Transportation Network Planning’ (Safer-TNP). The publications were used to guide the development of planning structures, diagnostic tools, planning recommendations, and research information
Building Accurate 3D Spatial Networks to Enable Next Generation Intelligent Transportation Systems
Kaul, Manohar; Yang, Bin; Jensen, Christian S.
2013-01-01
The use of accurate 3D spatial network models can enable substantial improvements in vehicle routing. Notably, such models enable eco-routing, which reduces the environmental impact of transportation. We propose a novel filtering and lifting framework that augments a standard 2D spatial network...
Evolving Model for the Complex Traffic and Transportation Network Considering Self-Growth Situation
Wei Zhang
2012-01-01
Full Text Available It has been approved that the scale-free feature exists in various complex networks, such as the internet, the cell or the biological networks. In order to analyze the influence of the self-growth phenomenon during the growth on the structure of traffic and transportation network, we formulated an evolving model. Based on the evolving model, we prove in mathematics that, even that the self-growth situation happened, the traffic and transportation network owns the scale-free feature due to that the node degree follows a power-law distribution. A real traffic and transportation network, China domestic airline network is tested to consolidate our conclusions. We find that the airline network has a node degree distribution equivalent to the power-law of which the estimated scaling parameter is about 3.0. Moreover the standard error of the estimated scaling parameter changes according to the self-growth probability. Our findings could provide useful information for determining the optimal structure or status of the traffic and transportation network.
Pore-network modeling of solute transport and biofilm growth in porous media
Qin, Chao Zhong; Hassanizadeh, S. Majid
2015-01-01
In this work, a pore-network (PN) model for solute transport and biofilm growth in porous media was developed. Compared to previous studies of biofilm growth, it has two new features. First, the constructed pore network gives a better representation of a porous medium. Second, instead of using a
THE ACCESSIBILITY ASSESSMENT OF REGIONAL TRANSPORT NETWORK IN THE SOUTH EAST EUROPE
Ana Šimecki
2013-12-01
Full Text Available Development of transport infrastructure and establishment of effective transport systems is a prerequisite for the achievement of broad based economic growth which is one of the European and Southeast European major development goals. Due to the lack of intraregional connectivity within the South East Europe (SEE, certain parts of the region have limited access to regional, European and global markets. Mentioned imbalance of accessibility to services, markets and opportunities for further social and economic progress is an obstacle for overall development of the SEE region. The research is thematically oriented on the assessment of road, rail and air passenger transport accessibility in the SEE with the aim of providing scientific overview of current regional transport network connectivity serving as basis for further identification of potential improvement measures. The research is conducted on the SEETO Comprehensive Network that was established as a main output of joint cooperation between seven Regional Participants and the European Commission as a result of signing of the Memorandum of Understanding for the Development of the Core Regional Transport Network (MoU in 2004. The multimodal Core Regional Transport Network defined under the MoU represents a commonly agreed main and ancillary transport infrastructure in the SEE, which is the base for the implementation of transport related investments programmes.
Ying Wang
2016-03-01
Full Text Available Currently, high-income countries use multimodal transportation to export large quantities of secondhand vehicles to low-income countries. Secondhand vehicle export has shown its highest growth in recent years, especially in Korea. The problem of transporting secondhand vehicles from Korea to Central Asia is becoming an important issue, but few researchers are interested in it. The objective of this research is to determine the optimal transport network for exporting secondhand vehicles from Korea to Central Asian countries by combining experts’ opinions and real data from existing transport networks. The fuzzy Delphi method was applied to obtain factors to evaluate alternative multimodal transport networks for moving secondhand vehicles from Korea to Central Asian countries by judgment from experts. The analysis shows that among the five factors (total cost, total time, reliability, security, and transportation capability, total cost is the most considerable factor, followed by reliability, transportation capability, total time, and security. Additionally, in the mainly three multimodal transport networks, the sea+Trans-China Railway route is ranked first, followed by the sea+Trans-Siberian Railway and sea+truck routes.
Reliability of travel times and robustness of transport networks
Immers, L.H.; Egeter, B.; Snelder, M.; Tampere, C.
2010-01-01
The ever increasing mobility of the population in many countries means the arterial road network is subject to heavy usage; in many places, it is almost fully used during rush hours. This not only causes many daily recurring traffic jams, but also leads to increased vulnerability of the road network
Choice set generation in multi-modal transportation networks
Fiorenzo-Catalano, M.S.
2007-01-01
Multi-modal transport relates to trips for which travellers use two or more transport modes, for example bicycle and train, train and bus, or private car and metro. The main theme in this dissertation is to establish a choice set generation model and algorithm, and demonstrate its validity and
Intermodal freight terminals : marketing channels and transport networks
Nijkamp, Peter; Wiegmans, Bart
1999-01-01
The goal of this paper is to combine the current theory about marketing channels withcombined transport and logistics in order to develop a customer-based and broadly applicable approach to the study of combined freight transport inEurope. Furthermore, this paper seeks to provide an analytical frame
Intermodal freight terminals : marketing channels and transport networks
Nijkamp, Peter; Wiegmans, Bart
1999-01-01
The goal of this paper is to combine the current theory about marketing channels withcombined transport and logistics in order to develop a customer-based and broadly applicable approach to the study of combined freight transport inEurope. Furthermore, this paper seeks to provide an analytical
Intermodal freight terminals : marketing channels and transport networks
Nijkamp, Peter; Wiegmans, Bart
1999-01-01
The goal of this paper is to combine the current theory about marketing channels withcombined transport and logistics in order to develop a customer-based and broadly applicable approach to the study of combined freight transport inEurope. Furthermore, this paper seeks to provide an analytical frame
The Gas Transportation Network as a ‘Lego’ Game: How to Play with It?
Glachant, Jean-Michel; Hallack, Michelle
2010-01-01
Loyola de Palacio Programme on Energy Policy Gas transportation networks exhibit a quite substantial variety of technical and economical properties ranges roughly from an entrenched natural monopoly to near to an open competition platform. This empirical fact is widely known and accepted. However the corresponding frame of network analysis is lacking or quite fuzzy. As an infrastructure, can a gas network evolve or not from a natural monopoly (an essential facility) to an open ...
A source-based congestion control strategy for real-time video transport on IP network
Chen, Xia; Cai, Canhui
2005-07-01
The goal of this paper is to design a TCP friendly real-time video transport protocol that will not only utilize network resource efficiently, but also prevent network congestion from the real-time video transmitting effectively. To this end, we proposed a source based congestion control scheme to adapt video coding rate to the channel capacity of the IP network, including three stages: rate control, rate-adaptive video encoding, and rate shaping.
Modeling solute transport in distribution networks with variable demand and time step sizes.
Peyton, Chad E.; Bilisoly, Roger Lee; Buchberger, Steven G. (University of Cincinnati, Cincinnati, OH); McKenna, Sean Andrew; Yarrington, Lane
2004-06-01
The effect of variable demands at short time scales on the transport of a solute through a water distribution network has not previously been studied. We simulate flow and transport in a small water distribution network using EPANET to explore the effect of variable demand on solute transport across a range of hydraulic time step scales from 1 minute to 2 hours. We show that variable demands at short time scales can have the following effects: smoothing of a pulse of tracer injected into a distribution network and increasing the variability of both the transport pathway and transport timing through the network. Variable demands are simulated for these different time step sizes using a previously developed Poisson rectangular pulse (PRP) demand generator that considers demand at a node to be a combination of exponentially distributed arrival times with log-normally distributed intensities and durations. Solute is introduced at a tank and at three different network nodes and concentrations are modeled through the system using the Lagrangian transport scheme within EPANET. The transport equations within EPANET assume perfect mixing of the solute within a parcel of water and therefore physical dispersion cannot occur. However, variation in demands along the solute transport path contribute to both removal and distortion of the injected pulse. The model performance measures examined are the distribution of the Reynolds number, the variation in the center of mass of the solute across time, and the transport path and timing of the solute through the network. Variation in all three performance measures is greatest at the shortest time step sizes. As the scale of the time step increases, the variability in these performance measures decreases. The largest time steps produce results that are inconsistent with the results produced by the smaller time steps.
Maslow's Hierarchy of Needs Revisited.
Frame, Douglas
1996-01-01
Reviews Maslow's hierarchy of needs and characterization of the self-actualizing personality, suggesting that since few people meet his self-actualization criteria, an educational system designed to produce such personalities may fail, with teachers attending only to the hierarchy's lower stages (self-esteem and self-actualization) which dilutes…
Loewner equations and dispersionless hierarchies
Takebe, Takashi [Department of Mathematics, Ochanomizu University, Otsuka 2-1-1, Bunkyo-ku, Tokyo, 112-8610 (Japan); Teo, Lee-Peng [Faculty of Information Technology, Multimedia University, Jalan Multimedia, Cyberjaya, 63100, Selangor Darul Ehsan (Malaysia); Zabrodin, Anton [Institute of Biochemical Physics, Kosygina str. 4, 119991 Moscow, Russia and ITEP, Bol. Cheremushkinskaya str. 25, 117259 Moscow (Russian Federation)
2006-09-15
Using the Hirota representation of dispersionless dKP and dToda hierarchies, we show that the chordal Loewner equations and radial Loewner equations respectively serve as consistency conditions for one-variable reductions of these integrable hierarchies. We also clarify the geometric meaning of this result by relating it to the eigenvalue distribution of normal random matrices in the large N limit.
Maslow's Hierarchy of Needs Revisited.
Frame, Douglas
1996-01-01
Reviews Maslow's hierarchy of needs and characterization of the self-actualizing personality, suggesting that since few people meet his self-actualization criteria, an educational system designed to produce such personalities may fail, with teachers attending only to the hierarchy's lower stages (self-esteem and self-actualization) which dilutes…
Pangle, L. A.; Cardoso, C.; Kim, M.; Lora, M.; Wang, Y.; Troch, P. A. A.; Harman, C. J.
2014-12-01
Water molecules traverse myriad flow paths and spend different lengths of time on or within the landscape before they are discharged into a stream channel. The transit-time distribution (TTD) is a probability distribution that represents the range and likelihood of transit times for water and conservative solutes within soils and catchments, and is useful for comparative analysis and prediction of solute transport into streams. The TTD has customarily been assumed to be time-invariant in practical applications, but is understood to vary due to unsteady flow rates, changes in water-balance partitioning, and shifting flow pathways. Recent theoretical advances have clarified how the distribution of transit times experienced by water and solutes within a stream channel at any moment in time is conditional on the specific series of precipitation events preceding that time. Observations resolving how TTDs vary during a specific sequence of precipitation events could be obtained by introducing unique and conservative tracers during each event and quantifying their distinct breakthrough curves in the stream. At present, the number of distinct and conservative tracers available for this purpose is insufficient. Harman and Kim [Harman, C.J. and Kim, M., 2014, Geophysical Research Letters, 41, 1567-1575] proposed a new experimental method—based on the establishment of periodic steady-state conditions—that allows multiple overlapping breakthrough curves of non-unique tracers to be decomposed, thus enabling analysis of the distinct TTDs associated with their specific times of introduction through precipitation. We present results from one of the first physical experiments to test this methodology. Our experiment involves a sloping lysimeter (10° slope) that contains one cubic meter of crushed basalt rock (loamy sand texture), an irrigation system adaptable to controlled tracer introductions, and instruments that enable total water balance monitoring. We imposed a repeated
Opportunistic Hybrid Transport Protocol (OHTP) for Cognitive Radio Ad Hoc Sensor Networks.
Bin Zikria, Yousaf; Nosheen, Summera; Ishmanov, Farruh; Kim, Sung Won
2015-12-15
The inefficient assignment of spectrum for different communications purposes, plus technology enhancements and ever-increasing usage of wireless technology is causing spectrum scarcity. To address this issue, one of the proposed solutions in the literature is to access the spectrum dynamically or opportunistically. Therefore, the concept of cognitive radio appeared, which opens up a new research paradigm. There is extensive research on the physical, medium access control and network layers. The impact of the transport layer on the performance of cognitive radio ad hoc sensor networks is still unknown/unexplored. The Internet's de facto transport protocol is not well suited to wireless networks because of its congestion control mechanism. We propose an opportunistic hybrid transport protocol for cognitive radio ad hoc sensor networks. We developed a new congestion control mechanism to differentiate true congestion from interruption loss. After such detection and differentiation, we propose methods to handle them opportunistically. There are several benefits to window- and rate-based protocols. To exploit the benefits of both in order to enhance overall system performance, we propose a hybrid transport protocol. We empirically calculate the optimal threshold value to switch between window- and rate-based mechanisms. We then compare our proposed transport protocol to Transmission Control Protocol (TCP)-friendly rate control, TCP-friendly rate control for cognitive radio, and TCP-friendly window-based control. We ran an extensive set of simulations in Network Simulator 2. The results indicate that the proposed transport protocol performs better than all the others.
Real-Time Mass Passenger Transport Network Optimization Problems
2005-01-01
The aim of Real-Time Mass Transport Vehicle Routing Problem (MTVRP) is to find a solution to route n vehicles in real time to pick up and deliver m passengers. This problem is described in the context of flexible large-scale mass transportation options that use new technologies for communication among passengers and vehicles. The solution of such a problem is relevant to future transportation options involving large scale real-time routing of shared-ride fleet transit vehicles. However, the g...
Extreme weather impacts on European networks of transport
Leviakangas, P.
2012-04-01
The EWENT project addresses the European Union (EU) policies and strategies related to climate change, with a particular focus on extreme weather impacts on the EU transportation system. This project is funded by the Seventh Framework Programme (Transports, call ID FPT7-TPT-2008-RTD-1). EWENT Work Package 1 (WP1) focuses particularly on identification and definition of extreme weather events within the European transport system. In the context of the EWENT project, the following definition for extreme weather events related to transport systems was used: "Extreme events are generally rare events. The events cause the exceeding of maximum values and/or pre-existing (measured) high (low) thresholds of certain weather parameters and generate impacts that are harmful to any part of the transport system (infrastructures, operations, vehicles, passengers or cargo)". Weather has major impacts on transportation. EWENT WP1 used three different approaches to assess the impacts and consequences extreme weather phenomena cause to the transport system. Firstly, an extensive traditional review of the professional literature has been carried out. Secondly, media mining has been done in order to obtain more empirical data and assess which transport modes in different parts of Europe seem to be most affected. Thirdly, a compilation of specific case studies on past extreme incidents has been prepared, helping to assess the specific consequences of certain phenomena. EWENT WP1 introduces a review of extreme weather phenomena and identifies their impacts and consequences on European transport system. All modes of transport are covered. Critical threshold values for most relevant weather phenomena that affect different transport modes have been established. The related impacts and consequences result in deterioration in the service level of transportation system. A dozen different impact mechanisms have been charted. The collaborators in the team for this part of the EWENT Project are
Railway optimal network simulation for the development of regional transport-logistics system
Mikhail Borisovich Petrov
2013-12-01
Full Text Available The dependence of logistics on mineral fuel is a stable tendency of regions development, though when making strategic plans of logistics in the regions, it is necessary to provide the alternative possibilities of power-supply sources change together with population density, transport infrastructure peculiarities, and demographic changes forecast. On the example of timber processing complex of the Sverdlovsk region, the authors suggest the algorithm of decision of the optimal logistics infrastructure allocation. The problem of regional railway network organization at the stage of slow transition from the prolonged stagnation to the new development is carried out. The transport networks’ configurations of countries on the Pacific Rim, which successfully developed nowadays, are analyzed. The authors offer some results of regional transport network simulation on the basis of artificial intelligence method. These methods let to solve the task with incomplete data. The ways of the transport network improvement in the Sverdlovsk region are offered.
Neural network-genetic programming for sediment transport
Singh, A.K.; Deo, M.C.; SanilKumar, V.
The planning, operation, design and maintenance of almost all harbour and coastal engineering facilities call for an estimation of the longshore sediment transport rate. This is currently and popularly done with the help of empirical equations...
Networking in the Transport Sector: Inter-Firm vs Intra-Firm Perspective
Justas Nugaras
2011-03-01
Full Text Available Changes in the global economic environment have a huge impact on the transport and logistics sector. Experts in the sector emphasize the role of collaboration in order to reach common goals. In theory such phenomena is analyzed through the networking viewpoint. Among the major groups of players in the sector, two types of networks are dominant: inter-firm networking and intra-firm networking. Empirical pilot research is done by comparing two types of networking in global and local companies. Following the results of the pilot research the conclusion was made that inter-firm networking and intra-firm networking in the companies complement each other and require further research.Article in English
Fractional quantum mechanics on networks: Long-range dynamics and quantum transport.
Riascos, A P; Mateos, José L
2015-11-01
In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.
Random-resistor network description for hopping transport in the presence of Hubbard interaction
Bleibaum, O; Bryksin, V V
2003-01-01
On the basis of the linearized rate equations for hopping electrons in the presence of Hubbard interaction we derive a random resistor network analogue of the transport equations. In contrast to the ordinary Miller-Abraham network our network has two nodes per site. The occurrence of the second node is related to the capability of the system to propagate excitations, and thus is characteristic for the interacting situation. Our random resistor network can be used for the investigation of the transport properties in alternating electric fields and for the investigation of properties of excitations. The network analogue is applied to the calculation of the dynamical conductivity in the nearest-neighbour hopping regime for all Hubbard-interaction strength.
Random-resistor network description for hopping transport in the presence of Hubbard interaction
Bleibaum, O [Department of Physics and Materials Science Institute, University of Oregon, Eugene, OR 97403 (United States); Boettger, H [Institut fuer Theoretische Physik, Otto-von-Guericke, Universitaet Magdeburg, 399016 Magdeburg (Germany); Bryksin, V V [A F Ioffe Physico-Technical Institute, 194021 St Petersburg (Russian Federation)
2003-03-19
On the basis of the linearized rate equations for hopping electrons in the presence of Hubbard interaction we derive a random resistor network analogue of the transport equations. In contrast to the ordinary Miller-Abraham network our network has two nodes per site. The occurrence of the second node is related to the capability of the system to propagate excitations, and thus is characteristic for the interacting situation. Our random resistor network can be used for the investigation of the transport properties in alternating electric fields and for the investigation of properties of excitations. The network analogue is applied to the calculation of the dynamical conductivity in the nearest-neighbour hopping regime for all Hubbard-interaction strength.
Improving transportation networks: Effects of population structure and decision making policies.
Pablo-Martí, Federico; Sánchez, Angel
2017-07-03
Transportation networks are one of the fundamental tools for human society to work, more so in our globalized world. The importance of a correct, efficient design of a transportation network for a given region or country cannot be overstated. We here study how network design is affected by the geography of the towns or nuclei to be connected, and also by the decision process necessary to choose which connections should be improved (in a generic sense) first. We begin by establishing that Delaunay networks provide an efficient starting point for the network design and at the same time allow us to introduce a computationally amenable model. Subsequent improvements lead to decentralized designs in geographies where towns are more or less homogeneously distributed, whereas radial designs arise when there is a core-periphery distribution of nodes. We also show that optimization of Delaunay networks outperforms that of complete networks at a lower cost, by allowing for a proper selection of the links to improve. In closing, we draw conclusions relevant to policy making applied to designing transportation networks and point our how our study can be useful to identify mechanisms relevant to the historical development of a region.
Impact of pore size variability and network coupling on electrokinetic transport in porous media
Alizadeh, Shima; Bazant, Martin Z.; Mani, Ali
2016-11-01
We have developed and validated an efficient and robust computational model to study the coupled fluid and ion transport through electrokinetic porous media, which are exposed to external gradients of pressure, electric potential, and concentration. In our approach a porous media is modeled as a network of many pores through which the transport is described by the coupled Poisson-Nernst-Planck-Stokes equations. When the pore sizes are random, the interactions between various modes of transport may provoke complexities such as concentration polarization shocks and internal flow circulations. These phenomena impact mixing and transport in various systems including deionization and filtration systems, supercapacitors, and lab-on-a-chip devices. In this work, we present simulations of massive networks of pores and we demonstrate the impact of pore size variation, and pore-pore coupling on the overall electrokinetic transport in porous media.
Behavioural Models for Route Choice of Passengers in Multimodal Public Transport Networks
Anderson, Marie Karen
The subject of this thesis is behavioural models for route choice of passengers in multimodal public transport networks. While research in sustainable transport has dedicated much attention toward the determinants of choice between car and sustainable travel options, it has devoted less attention...... in the estimation of route choice models of public transport users based upon observed choices. Public transport route choice models have not benefitted from the same technological enhancements as car models because of the necessity (i) to collect additional information concerning lines and transfers, and (ii......) to overcome technical limitations related to GPS signals not always being retrievable in tunnels that are used by metro and urban rail systems. In this PhD project, a questionnaire to collect details about the actual route choice behaviour in public transport networks was developed and tested in a full scale...
SWNT nano-engineered networks strongly increase charge transport in P3HT.
Boulanger, Nicolas; Yu, Junchun; Barbero, David R
2014-10-21
We demonstrate the formation of arrays of 3D nanosized networks of interconnected single-wall carbon nanotubes (SWNTs) with well defined dimensions in a poly-3-hexylthiophene (P3HT) thin film. These novel nanotube nano-networks produce efficient ohmic charge transport, even at very low nanotube loadings and low voltages. An increase in conductivity between one and two orders of magnitude is observed compared to a random network. The formation of these nano-engineered networks is compatible with large area imprinting and roll to roll processes, which makes it highly desirable for opto-electronic and energy conversion applications using carbon nanotubes.
Context-dependent hierarchies in pigeons.
Nagy, Máté; Vásárhelyi, Gábor; Pettit, Benjamin; Roberts-Mariani, Isabella; Vicsek, Tamás; Biro, Dora
2013-08-06
Hierarchical organization is widespread in the societies of humans and other animals, both in social structure and in decision-making contexts. In the case of collective motion, the majority of case studies report that dominant individuals lead group movements, in agreement with the common conflation of the terms "dominance" and "leadership." From a theoretical perspective, if social relationships influence interactions during collective motion, then social structure could also affect leadership in large, swarm-like groups, such as fish shoals and bird flocks. Here we use computer-vision-based methods and miniature GPS tracking to study, respectively, social dominance and in-flight leader-follower relations in pigeons. In both types of behavior we find hierarchically structured networks of directed interactions. However, instead of being conflated, dominance and leadership hierarchies are completely independent of each other. Although dominance is an important aspect of variation among pigeons, correlated with aggression and access to food, our results imply that the stable leadership hierarchies in the air must be based on a different set of individual competences. In addition to confirming the existence of independent and context-specific hierarchies in pigeons, we succeed in setting out a robust, scalable method for the automated analysis of dominance relationships, and thus of social structure, applicable to many species. Our results, as well as our methods, will help to incorporate the broader context of animal social organization into the study of collective behavior.
Modeling an Elastic-Demand Bimodal Transport Network with Park-and-Ride Trips
William H.K.Lam; LI Zhichun; S.C.Wong; ZHU Daoli
2007-01-01
This paper presents a network equilibrium formulation for modeling commuters' travel choices in a bimodal transport system with park-and-ride (P&R) trips while the total demand is elastic to the congestion level of the network. A super-network approach is adopted in the proposed model. It is assumed that commuters' trips are categorized into two types, auto mode only and a combined mode with both auto and transit modes. The former is referred to as the pure mode trip and the latter as the P&R mode trip. The proposed model simultaneously considers the commuter's choice of the pure mode versus the P&R mode, the choice of parking location for the pure mode, the choice of transfer point for the P&R mode, as well as the route choice for each mode. The demand elasticity of transport system, the capacity constraints of transport facilities, and the congestion interaction throughout the super-network are also explicitly incorporated into the proposed model. The results of the numerical experiment show the following key findings: (i) traditional parking/P&R models may overestimate or underestimate travel demand distribution over network; (ii) parking/P&R, transit scheduling, and carpooling schemes bring significant impacts on commuters' travel behavior and network performance; and (iii) different transport policies may be to some extent mutually substituted.
Price of anarchy in transportation networks: efficiency and optimality control.
Youn, Hyejin; Gastner, Michael T; Jeong, Hawoong
2008-09-19
Uncoordinated individuals in human society pursuing their personally optimal strategies do not always achieve the social optimum, the most beneficial state to the society as a whole. Instead, strategies form Nash equilibria which are often socially suboptimal. Society, therefore, has to pay a price of anarchy for the lack of coordination among its members. Here we assess this price of anarchy by analyzing the travel times in road networks of several major cities. Our simulation shows that uncoordinated drivers possibly waste a considerable amount of their travel time. Counterintuitively, simply blocking certain streets can partially improve the traffic conditions. We analyze various complex networks and discuss the possibility of similar paradoxes in physics.
Maksin-Mićić Marija
2004-01-01
Full Text Available The trans-European transport network has different effects at macro regional mezzo-regional and micro-regional level, and its effectiveness rises with the lower regional levels. Possible approaches to the trans-European transport network impact and effect survey and policy options have been pointed out. The importance of increased accessibility and mobility for regional expansion and for a more balanced and polycentric system of city networks has been underlined. Changes in the spatial organization utilization and structure of cities, as well as in social benefits and losses subsequent to impacts of trans-European transport corridor "X" section Belgrade-Niš have been analyzed. The new trans-European or major transport infrastructure does not per se create regional and urban system network development, although it can affect the conditions for the processes that create growth and development. The effects can be increased by co-ordination of measures of regional, spatial and urban policy, land use transport, environmental and other policies. The necessary measure is the introduction of spatial impact assessment as sartorial policy instrument for the large transport infrastructure plans and projects.
Forecasting Beijing Transportation Hub Areas’s Pedestrian Flow Using Modular Neural Network
Shuwei Wang
2015-01-01
Full Text Available Along with the increasing proportion of urban public transportation trip, pedestrian flow in transportation hub areas increased. For effectively improving the emergency handling ability of related management apartments and preventing the incident of pedestrian congestion, this paper studied the method of pedestrian flow forecast in Beijing transportation hub areas. Firstly, 34 typical sidewalks in Beijing transportation hub areas were surveyed to obtain 2200 valid data. Secondly, correlation analysis was used to analyze the relationship between pedestrian flow and its influential factors. 11 significant influential factors were extracted. Thirdly, forecasting model was established with modular neural network. The surveyed pedestrian flow sample was fuzzy clustered according to the regional land use where the transportation hub existed. Then, membership function based on the distance measure was constructed. Through fuzzy discrimination, online selection for the subnetwork of the information can be achieved. Consequently, the self-adaptation of the neural network on information processing was improved. Finally, this paper tested the pedestrian flow sample of a transportation hub in Beijing. It was concluded that the accuracy of pedestrian flow forecasting model using modular neural network was higher than other neural network models. There was also improvement in the adaptability to environment.
Numerical Simulation of Flow and Suspended Sediment Transport in the Distributary Channel Networks
Wei Zhang
2014-01-01
Full Text Available Flow and suspended sediment transport in distributary channel networks play an important role in the evolution of deltas and estuaries, as well as the coastal environment. In this study, a 1D flow and suspended sediment transport model is presented to simulate the hydrodynamics and suspended sediment transport in the distributary channel networks. The governing equations for river flow are the Saint-Venant equations and for suspended sediment transport are the nonequilibrium transport equations. The procedure of solving the governing equations is firstly to get the matrix form of the water level and suspended sediment concentration at all connected junctions by utilizing the transformation of the governing equations of the single channel. Secondly, the water level and suspended sediment concentration at all junctions can be obtained by solving these irregular spare matrix equations. Finally, the water level, discharge, and suspended sediment concentration at each river section can be calculated. The presented 1D flow and suspended sediment transport model has been applied to the Pearl River networks and can reproduce water levels, discharges, and suspended sediment concentration with good accuracy, indicating this that model can be used to simulate the hydrodynamics and suspended sediment concentration in the distributary channel networks.
ELEMENTS OF CONTROL OVER HIERARCHIE SYSTEMS WITH ASSUMED HIERARCHY
Kushnir N. V.
2015-05-01
Full Text Available The article presents a mathematical model of control over dynamic hierarchy system. The model was proposed for dealing with systems with assumed order in the technical problem of predicting destructions depending onto the amount of defects on different scale levels. The problem of the closest to a certain point of shelf life of hierarchy system is solved. The example of approach control during the given time is given. The problem concerns mathematic programming. Formulation of multi-parameter vector optimization criteria (improvement with its own hierarchy and the formal exercise of multi-criteria optimization of the model parameters. The research can achieve clarity about the conditions under which the structure is preserved. Managing sustainable development system with a given level of the hierarchy for the technical systems can only be achieved in keeping
Haba, Naoyuki; Murayama, Hitoshi
2000-09-14
We advocate a new approach to study models of fermion massesand mixings, namely anarchy proposed in hep-ph/9911341. In this approach,we scan the O(1) coefficients randomly. We argue that this is the correctapproach when the fundamental theory is sufficiently complicated.Assuming there is no physical distinction among three generations ofneutrinos, the probability distributions in MNS mixing angles can bepredicted independent of the choice of the measure. This is because themixing angles are distributed according to the Haar measure of the Liegroups whose elements diagonalize the mass matrices. The near-maximalmixings, as observed in the atmospheric neutrino data and as required inthe LMA solution to the solar neutrino problem, are highly probable. Asmall hierarchy between the Delta m2 for the atmospheric and the solarneutrinos is obtained very easily; the complex seesaw case gives ahierarchy of a factor of 20 as the most probable one, even though thisconclusion is more measure-dependent. U_e3 has to be just below thecurrent limit from the CHOOZ experiment. The CP-violating parameter sindelta is preferred to be maximal. We present a simple SU(5)-likeextension of anarchy to the charged-lepton and quark sectors which workswell phenomenologically.
Optimal Organizational Hierarchies: Source Coding: Disaster Relief
Murthy, G Rama
2011-01-01
ulticasting is an important communication paradigm for enabling the dissemination of information selectively. This paper considers the problem of optimal secure multicasting in a communication network captured through a graph (optimal is in an interesting sense) and provides a doubly optimal solution using results from source coding. It is realized that the solution leads to optimal design (in a well defined optimality sense) of organizational hierarchies captured through a graph. In this effort two novel concepts : prefix free path, graph entropy are introduced. Some results of graph entropy are provided. Also some results on Kraft inequality are discussed. As an application Hierarchical Hybrid Communication Network is utilized as a model of structured Mobile Adhoc network for utility in Disaster Management. Several new research problems that naturally emanate from this research are summarized.
Flow and sediment transport in an Indonesian tidal network
Buschman, F.A.
2011-01-01
The Berau river, situated in east Kalimantan (Indonesia), drains a relatively small catchment area and splits into several interconnected tidal channels. This tidal network connects to the sea. The sea is host to extremely diverse coral reef communities. Also the land side of the region is relativel
Integrated modeling of the European trade and transport network
Hu, J.; Ivanova, O.
2013-01-01
Trade and transport statistics are two sides of the same coin. Ideally we would like to have the data on the trade flow between two countries in combination with the information about the split of this flow between various (multi-modal) routes linking the pair of countries. In reality trade and tran
Wireless sensor network data fusion in layer based on hierarchy%基于分层的层内无线传感网络数据融合
李同锋; 杜秀娟; 牛昆
2014-01-01
Data fusion of wireless sensor networks can effectively reduce the data traffic among sensing nodes and energy consumption of nodes,and prolong the life of networks. A node hierarchical algorithm is proposed in this paper. The specific da-ta fusion algorithm is added into the sensing node inside layer. The Pauta criterion is utilized in the algorithm the to detect the abnormal data which are received by nodes. The principal components analysis (PCA) is adopted to fuse the remaining data. The simulations experiment indicates this algorithm has a high data fusion accuracy.%无线传感网络数据融合能够有效减少传感节点的数据通信量，减少节点的能量消耗，延长了网络的寿命。本文提出了节点分层算法，在层内传感节点加入了具体的数据融合算法，利用拉依达准则对节点收到的数据进行异常数据检测，在上层节点利用主成分分析对剩余数据进行数据融合。通过仿真实验得出该算法数据融合结果准确率好。
Kerner, Boris S.
2016-09-01
We have revealed general physical conditions for the maximization of the network throughput at which free flow conditions are ensured, i.e., traffic breakdown cannot occur in the whole traffic or transportation network. A physical measure of the network - network capacity is introduced that characterizes general features of the network with respect to the maximization of the network throughput. The network capacity allows us also to make a general proof of the deterioration of traffic system occurring when dynamic traffic assignment is performed in a network based on the classical Wardrop' user equilibrium (UE) and system optimum (SO) equilibrium.
Hamiltonian Structure of PI Hierarchy
Kanehisa Takasaki
2007-03-01
Full Text Available The string equation of type (2,2g+1 may be thought of as a higher order analogue of the first Painlevé equation that corresponds to the case of g = 1. For g > 1, this equation is accompanied with a finite set of commuting isomonodromic deformations, and they altogether form a hierarchy called the PI hierarchy. This hierarchy gives an isomonodromic analogue of the well known Mumford system. The Hamiltonian structure of the Lax equations can be formulated by the same Poisson structure as the Mumford system. A set of Darboux coordinates, which have been used for the Mumford system, can be introduced in this hierarchy as well. The equations of motion in these Darboux coordinates turn out to take a Hamiltonian form, but the Hamiltonians are different from the Hamiltonians of the Lax equations (except for the lowest one that corresponds to the string equation itself.
Hierarchies of Predominantly Connected Communities
Hamann, Michael; Wagner, Dorothea
2013-01-01
We consider communities whose vertices are predominantly connected, i.e., the vertices in each community are stronger connected to other community members of the same community than to vertices outside the community. Flake et al. introduced a hierarchical clustering algorithm that finds such predominantly connected communities of different coarseness depending on an input parameter. We present a simple and efficient method for constructing a clustering hierarchy according to Flake et al. that supersedes the necessity of choosing feasible parameter values and guarantees the completeness of the resulting hierarchy, i.e., the hierarchy contains all clusterings that can be constructed by the original algorithm for any parameter value. However, predominantly connected communities are not organized in a single hierarchy. Thus, we develop a framework that, after precomputing at most $2(n-1)$ maximum flows, admits a linear time construction of a clustering $\\C(S)$ of predominantly connected communities that contains ...
A turbulent transport network model in MULTIFLUX coupled with TOUGH2
Danko, G.; Bahrami, D.; Birkholzer, J.T.
2011-02-15
A new numerical method is described for the fully iterated, conjugate solution of two discrete submodels, involving (a) a transport network model for heat, moisture, and airflows in a high-permeability, air-filled cavity; and (b) a variably saturated fractured porous medium. The transport network submodel is an integrated-parameter, computational fluid dynamics solver, describing the thermal-hydrologic transport processes in the flow channel system of the cavity with laminar or turbulent flow and convective heat and mass transport, using MULTIFLUX. The porous medium submodel, using TOUGH2, is a solver for the heat and mass transport in the fractured rock mass. The new model solution extends the application fields of TOUGH2 by integrating it with turbulent flow and transport in a discrete flow network system. We present demonstrational results for a nuclear waste repository application at Yucca Mountain with the most realistic model assumptions and input parameters including the geometrical layout of the nuclear spent fuel and waste with variable heat load for the individual containers. The MULTIFLUX and TOUGH2 model elements are fully iterated, applying a programmed reprocessing of the Numerical Transport Code Functionalization model-element in an automated Outside Balance Iteration loop. The natural, convective airflow field and the heat and mass transport in a representative emplacement drift during postclosure are explicitly solved in the new model. The results demonstrate that the direction and magnitude of the air circulation patterns and all transport modes are strongly affected by the heat and moisture transport processes in the surrounding rock, justifying the need for a coupled, fully iterated model solution such as the one presented in the paper.
Postance, Benjamin; Hillier, John; Dijkstra, Tom; Dixon, Neil
2017-01-01
Disruptions to transportation networks by natural hazard events cause direct losses (e.g. by physical damage) and indirect socio-economic losses via travel delays and decreased transportation efficiency. The severity and spatial distribution of these losses varies according to user travel demands and which links, nodes or infrastructure assets are physically disrupted. Increasing transport network resilience, for example by targeted mitigation strategies, requires the identification of the critical network segments which if disrupted would incur undesirable or unacceptable socio-economic impacts. Here, these impacts are assessed on a national road transportation network by coupling hazard data with a transport network model. This process is illustrated using a case study of landslide hazards on the road network of Scotland. A set of possible landslide-prone road segments is generated using landslide susceptibility data. The results indicate that at least 152 road segments are susceptible to landslides, which could cause indirect economic losses exceeding £35 k for each day of closure. In addition, previous estimates for historic landslide events might be significant underestimates. For example, the estimated losses for the 2007 A83 ‘Rest and Be Thankful’ landslide are £80 k day-1, totalling £1.2 million over a 15 day closure, and are ˜60% greater than previous estimates. The spatial distribution of impact to road users is communicated in terms of ‘extended hazard impact footprints’. These footprints reveal previously unknown exposed communities and unanticipated spatial patterns of severe disruption. Beyond cost-benefit analyses for landslide mitigation efforts, the approach implemented is applicable to other natural hazards (e.g. flooding), combinations of hazards, or even other network disruption events.
Harmony search optimization algorithm for a novel transportation problem in a consolidation network
Davod Hosseini, Seyed; Akbarpour Shirazi, Mohsen; Taghi Fatemi Ghomi, Seyed Mohammad
2014-11-01
This article presents a new harmony search optimization algorithm to solve a novel integer programming model developed for a consolidation network. In this network, a set of vehicles is used to transport goods from suppliers to their corresponding customers via two transportation systems: direct shipment and milk run logistics. The objective of this problem is to minimize the total shipping cost in the network, so it tries to reduce the number of required vehicles using an efficient vehicle routing strategy in the solution approach. Solving several numerical examples confirms that the proposed solution approach based on the harmony search algorithm performs much better than CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for realistic size problem instances.
Yamaguchi, Harumasa; Che, Dock-Chil; Hirano, Yoshiaki; Suzuki, Masayuki; Higuchi, Yoshiki; Matsumoto, Takuya
2015-09-01
The redox-active molecule of a cytochrome c3/DNA network exhibits nonlinear current-voltage (I-V) characteristics with a threshold bias voltage at low temperature and zero-bias conductance at room temperature. I-V curves for the cytochrome c3/DNA network are well matched with the Coulomb blockade network model. Comparative studies of the Mn12 cluster, cytochrome c, and cytochrome c3, which have a wide variety of redox potentials, indicate no difference in charge transport, which suggests that the conduction mechanism is not directly related to the redox states. The charge transport mechanism has been discussed in terms of the newly-formed electronic energy states near the Fermi level, induced by the ionic interaction between redox-active molecules with the DNA network.
A network model for electrical transport in sea ice
Zhu, J., E-mail: zhu@math.utah.ed [University of Utah, Department of Mathematics, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090 (United States); Golden, K.M., E-mail: golden@math.utah.ed [University of Utah, Department of Mathematics, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090 (United States); Gully, A., E-mail: gully@math.utah.ed [University of Utah, Department of Mathematics, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090 (United States); Sampson, C., E-mail: christian.sampson@gmail.co [University of Utah, Department of Mathematics, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090 (United States)
2010-07-15
Monitoring the thickness of sea ice is an important tool in assessing the impact of global warming on Earth's polar regions, and most methods of measuring ice thickness depend on detailed knowledge of its electrical properties. We develop a network model for the electrical conductivity of sea ice, which incorporates statistical measurements of the brine microstructure. The numerical simulations are in close agreement with direct measurements we made in Antarctica on the vertical conductivity of first year sea ice.
Strategies for Transporting Data Between Classified and Unclassified Networks
2016-03-01
Uses and Limitations of Unidirectional Network Bridges in a Secure Electronic Commerce Environment,” paper presented at the INC 2004 Conference...research. Among guards, the trusted information system Radiant Mercury appears promising. Further research is required in order to select an...Off-The-Shelf (COTS)]: Net Optics Tap 4 Guard (GOTS): Radiant Mercury 4 Guard (GOTS): Information Support Server Environment Guard 5 Guard (COTS
Principles of synchronous digital hierarchy
Jain, Rajesh Kumar
2012-01-01
The book presents the current standards of digital multiplexing, called synchronous digital hierarchy, including analog multiplexing technologies. It is aimed at telecommunication professionals who want to develop an understanding of digital multiplexing and synchronous digital hierarchy in particular and the functioning of practical telecommunication systems in general. The text includes all relevant fundamentals and provides a handy reference for problem solving or defining operations and maintenance strategies. The author covers digital conversion and TDM principles, line coding and digital
Tolstrup Christensen, Lene
2015-01-01
corporatisation. This layered set-up provided the state with a double governance grip that drove marketisation until 2011. However, the SOE as a hybrid created ripple effects between the market and the hierarchy that hampered the marketisation. The hierarchical governance turned towards centralisation and market....... It presents a case on how hybridity is altered and evolves in SOEs as a hybrid mode of governance between hierarchy and market in marketisation and how this can lead to re-centralisation....
Information slows down hierarchy growth.
Czaplicka, Agnieszka; Suchecki, Krzysztof; Miñano, Borja; Trias, Miquel; Hołyst, Janusz A
2014-06-01
We consider models of growing multilevel systems wherein the growth process is driven by rules of tournament selection. A system can be conceived as an evolving tree with a new node being attached to a contestant node at the best hierarchy level (a level nearest to the tree root). The proposed evolution reflects limited information on system properties available to new nodes. It can also be expressed in terms of population dynamics. Two models are considered: a constant tournament (CT) model wherein the number of tournament participants is constant throughout system evolution, and a proportional tournament (PT) model where this number increases proportionally to the growing size of the system itself. The results of analytical calculations based on a rate equation fit well to numerical simulations for both models. In the CT model all hierarchy levels emerge, but the birth time of a consecutive hierarchy level increases exponentially or faster for each new level. The number of nodes at the first hierarchy level grows logarithmically in time, while the size of the last, "worst" hierarchy level oscillates quasi-log-periodically. In the PT model, the occupations of the first two hierarchy levels increase linearly, but worse hierarchy levels either do not emerge at all or appear only by chance in the early stage of system evolution to further stop growing at all. The results allow us to conclude that information available to each new node in tournament dynamics restrains the emergence of new hierarchy levels and that it is the absolute amount of information, not relative, which governs such behavior.
Mechanical transport in two-dimensional networks of fractures
Endo, H.K.
1984-04-01
The objectives of this research are to evaluate directional mechanical transport parameters for anisotropic fracture systems, and to determine if fracture systems behave like equivalent porous media. The tracer experiments used to measure directional tortuosity, longitudinal geometric dispersivity, and hydraulic effective porosity are conducted with a uniform flow field and measurements are made from the fluid flowing within a test section where linear length of travel is constant. Since fluid flow and mechanical transport are coupled processes, the directional variations of specific discharge and hydraulic effective porosity are measured in regions with constant hydraulic gradients to evaluate porous medium equivalence for the two processes, respectively. If the fracture region behaves like an equivalent porous medium, the system has the following stable properties: (1) specific discharge is uniform in any direction and can be predicted from a permeability tensor; and (2) hydraulic effective porosity is directionally stable. Fracture systems with two parallel sets of continuous fractures satisfy criterion 1. However, in these systems hydraulic effective porosity is directionally dependent, and thus, criterion 2 is violated. Thus, for some fracture systems, fluid flow can be predicted using porous media assumptions, but it may not be possible to predict transport using porous media assumptions. Two discontinuous fracture systems were studied which satisfied both criteria. Hydraulic effective porosity for both systems has a value between rock effective porosity and total porosity. A length-density analysis (LDS) of Canadian fracture data shows that porous media equivalence for fluid flow and transport is likely when systems have narrow aperture distributions. 54 references, 90 figures, 7 tables.
Xiong, Qingrong; Baychev, Todor G.; Jivkov, Andrey P.
2016-09-01
Pore network models have been applied widely for simulating a variety of different physical and chemical processes, including phase exchange, non-Newtonian displacement, non-Darcy flow, reactive transport and thermodynamically consistent oil layers. The realism of such modelling, i.e. the credibility of their predictions, depends to a large extent on the quality of the correspondence between the pore space of a given medium and the pore network constructed as its representation. The main experimental techniques for pore space characterisation, including direct imaging, mercury intrusion porosimetry and gas adsorption, are firstly summarised. A review of the main pore network construction techniques is then presented. Particular focus is given on how such constructions are adapted to the data from experimentally characterised pore systems. Current applications of pore network models are considered, with special emphasis on the effects of adsorption, dissolution and precipitation, as well as biomass growth, on transport coefficients. Pore network models are found to be a valuable tool for understanding and predicting meso-scale phenomena, linking single pore processes, where other techniques are more accurate, and the homogenised continuum porous media, used by engineering community.
Oil spill risk assessment in maritime transportation networks
Yudhbir, L. [Systems Planning and Analysis, Alexandria, VA (United States); Iakovou, E. [Miami Univ., Coral Gables, FL (United States). Dept. of Industrial Engineering
2005-07-01
Commercial shippers and regulatory agencies face the challenge of evaluating the merits of various alternative policies for the transportation of crude oil and petroleum products. This paper presented a new risk estimation and assignment methodology that assesses the risk costs for the bodies of water where shipping lanes exist. The methodology is based on historical spills and uses causal data to estimate risk cost between 2 points of reference for numerous products transported by a variety of vessels. In response to public concerns regarding the environmental impacts of accidental spills from tanker ships, laws have been imposed on companies for all costs relating to environmental damage. This measure has prompted the oil industry to take greater responsibility, but a better understanding of tanker re-routing on environmental sensitive areas is needed in order to implement detailed emergency response plans and greater safety precautions. This methodology addressed the need for an efficient maritime transportation system that provides routing for various vessels carrying different petroleum products. The risk estimation methodology successfully modeled a multi-objective, multi-commodity routing problem. 23 refs., 3 figs.
Li, Yanning
2014-03-01
This article presents a new optimal control framework for transportation networks in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi (H-J) equation and the commonly used triangular fundamental diagram, we pose the problem of controlling the state of the system on a network link, in a finite horizon, as a Linear Program (LP). We then show that this framework can be extended to an arbitrary transportation network, resulting in an LP or a Quadratic Program. Unlike many previously investigated transportation network control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e., discontinuities in the state of the system). As it leverages the intrinsic properties of the H-J equation used to model the state of the system, it does not require any approximation, unlike classical methods that are based on discretizations of the model. The computational efficiency of the method is illustrated on a transportation network. © 2014 IEEE.
Fessel, Adrian; Oettmeier, Christina; Bernitt, Erik; Gauthier, Nils C.; Döbereiner, Hans-Günther
2012-08-01
We study the formation of transportation networks of the true slime mold Physarum polycephalum after fragmentation by shear. Small fragments, called microplasmodia, fuse to form macroplasmodia in a percolation transition. At this topological phase transition, one single giant component forms, connecting most of the previously isolated microplasmodia. Employing the configuration model of graph theory for small link degree, we have found analytically an exact solution for the phase transition. It is generally applicable to percolation as seen, e.g., in vascular networks.
Risk-taking path choice behaviors under ATIS in transportation networks with demand uncertainty
无
2008-01-01
A new travel time reliability-based traffic assignment model is proposed to investigate the effects of an advanced transportation information system (ATIS) on drivers' risk-taking path choice behaviours in transportation networks with demand uncertainty. In the model, drivers are divided into two classes. The first class is not equipped with ATIS, while the second class is equipped with ATIS. Different risk-taking path choice behaviours of the two classes are studied, respectively. A corresponding mixed equ...
Sediment Transport Dynamics in River Networks: A Model for Higher-Water Seasons
Huo, Jie; Wang, Xu-Ming; Hao, Rui; Zhang, Jin-Feng
A dynamical model is proposed to study sediment transport in river networks in higher-water seasons. The model emphasizes the difference between the sediment-carrying capability of the stream in higher-water seasons and that in lower-water seasons. The dynamics of sediment transport shows some complexities such as the complex dependence of the sediment-carrying capability on sediment concentration, the response of the channel(via erosion or sedimentation) to the changes of discharge.
自适应光传送网%Adaptive Optical Transport Network
王加莹; 赵继军; 刘赛
2005-01-01
提出未来光网络的智能化特征,包括连接智能化、业务智能化和传输自适应三个方面.这几个方面的特征将成为未来自适应光传送网的标志.%Intelligent features of future optical transport self-adaptation' ,which will construct an integrated earmark of future self-adaptive optical transport network.
GENERAL: Mean-field Theory for Some Bus Transport Networks with Random Overlapping Clique Structure
Yang, Xu-Hua; Sun, Bao; Wang, Bo; Sun, You-Xian
2010-04-01
Transport networks, such as railway networks and airport networks, are a kind of random network with complex topology. Recently, more and more scholars paid attention to various kinds of transport networks and try to explore their inherent characteristics. Here we study the exponential properties of a recently introduced Bus Transport Networks (BTNs) evolution model with random overlapping clique structure, which gives a possible explanation for the observed exponential distribution of the connectivities of some BTNs of three major cities in China. Applying mean-field theory, we analyze the BTNs model and prove that this model has the character of exponential distribution of the connectivities, and develop a method to predict the growth dynamics of the individual vertices, and use this to calculate analytically the connectivity distribution and the exponents. By comparing mean-field based theoretic results with the statistical data of real BTNs, we observe that, as a whole, both of their data show similar character of exponential distribution of the connectivities, and their exponents have same order of magnitude, which show the availability of the analytical result of this paper.
Large-scale transportation network congestion evolution prediction using deep learning theory.
Ma, Xiaolei; Yu, Haiyang; Wang, Yunpeng; Wang, Yinhai
2015-01-01
Understanding how congestion at one location can cause ripples throughout large-scale transportation network is vital for transportation researchers and practitioners to pinpoint traffic bottlenecks for congestion mitigation. Traditional studies rely on either mathematical equations or simulation techniques to model traffic congestion dynamics. However, most of the approaches have limitations, largely due to unrealistic assumptions and cumbersome parameter calibration process. With the development of Intelligent Transportation Systems (ITS) and Internet of Things (IoT), transportation data become more and more ubiquitous. This triggers a series of data-driven research to investigate transportation phenomena. Among them, deep learning theory is considered one of the most promising techniques to tackle tremendous high-dimensional data. This study attempts to extend deep learning theory into large-scale transportation network analysis. A deep Restricted Boltzmann Machine and Recurrent Neural Network architecture is utilized to model and predict traffic congestion evolution based on Global Positioning System (GPS) data from taxi. A numerical study in Ningbo, China is conducted to validate the effectiveness and efficiency of the proposed method. Results show that the prediction accuracy can achieve as high as 88% within less than 6 minutes when the model is implemented in a Graphic Processing Unit (GPU)-based parallel computing environment. The predicted congestion evolution patterns can be visualized temporally and spatially through a map-based platform to identify the vulnerable links for proactive congestion mitigation.
Large-scale transportation network congestion evolution prediction using deep learning theory.
Xiaolei Ma
Full Text Available Understanding how congestion at one location can cause ripples throughout large-scale transportation network is vital for transportation researchers and practitioners to pinpoint traffic bottlenecks for congestion mitigation. Traditional studies rely on either mathematical equations or simulation techniques to model traffic congestion dynamics. However, most of the approaches have limitations, largely due to unrealistic assumptions and cumbersome parameter calibration process. With the development of Intelligent Transportation Systems (ITS and Internet of Things (IoT, transportation data become more and more ubiquitous. This triggers a series of data-driven research to investigate transportation phenomena. Among them, deep learning theory is considered one of the most promising techniques to tackle tremendous high-dimensional data. This study attempts to extend deep learning theory into large-scale transportation network analysis. A deep Restricted Boltzmann Machine and Recurrent Neural Network architecture is utilized to model and predict traffic congestion evolution based on Global Positioning System (GPS data from taxi. A numerical study in Ningbo, China is conducted to validate the effectiveness and efficiency of the proposed method. Results show that the prediction accuracy can achieve as high as 88% within less than 6 minutes when the model is implemented in a Graphic Processing Unit (GPU-based parallel computing environment. The predicted congestion evolution patterns can be visualized temporally and spatially through a map-based platform to identify the vulnerable links for proactive congestion mitigation.
Yi Wen
2014-08-01
Full Text Available Transportation system disruption due to a disaster results in "ripple effects" throughout the entire transportation system of a metropolitan region. Many researchers have focused on the economic costs of transportation system disruptions in transportation-related industries, specifïcally within commerce and logistics, in the assessment of the regional economic costs. However, the foundation of an assessment of the regional economic costs of a disaster needs to include the evaluation of consumer surplus in addition to the direct cost for reconstruction of the regional transportation system. The objective of this study is to propose a method to estimate the regional consumer surplus based on indirect economic costs of a disaster on intermodal transportation systems in the context of diverting vehicles and trains. The computational methods used to assess the regional indirect economic costs sustained by the highway and railroad system can utilize readily available state departments of transportation (DOTs and metropolitan planning organizations (MPOs traffic models allowing prioritization of regional recovery plans after a disaster and strengthening of infrastructure before a disaster. Hurricane Katrina is one of the most devastating hurricanes in the history of the United States. Due to the significance of Hurricane Katrina, a case study is presented to evaluate consumer surplus in the Gulf Coast Region of Mississippi. Results from the case study indicate the costs of rerouting and congestion delays in the regional highway system and the rent costs of right-of-way in the regional railroad system are major factors of the indirect costs in the consumer surplus.
Display techniques for dynamic network data in transportation GIS
Ganter, J.H.; Cashwell, J.W.
1994-05-01
Interest in the characteristics of urban street networks is increasing at the same time new monitoring technologies are delivering detailed traffic data. These emerging streams of data may lead to the dilemma that airborne remote sensing has faced: how to select and access the data, and what meaning is hidden in them? computer-assisted visualization techniques are needed to portray these dynamic data. Of equal importance are controls that let the user filter, symbolize, and replay the data to reveal patterns and trends over varying time spans. We discuss a prototype software system that addresses these requirements.
Modeling rises and falls in money addicted social hierarchies
Dybiec, Bartłomiej; Mitarai, Namiko; Sneppen, Kim
2014-01-01
ambition by modeling the interplay of social networking and an uneven distribution of external resources. The model naturally generates social hierarchies. Remarkably, this social structure exhibits a rise-and-fall behavior. A well pronounced quasi-periodic dynamics, which is closely associated...
Building Accurate 3D Spatial Networks to Enable Next Generation Intelligent Transportation Systems
Kaul, Manohar; Yang, Bin; Jensen, Christian S.
2013-01-01
model with elevation information extracted from massive aerial laser scan data and thus yields an accurate 3D model. We present a filtering technique that is capable of pruning irrelevant laser scan points in a single pass, but assumes that the 2D network fits in internal memory and that the points......The use of accurate 3D spatial network models can enable substantial improvements in vehicle routing. Notably, such models enable eco-routing, which reduces the environmental impact of transportation. We propose a novel filtering and lifting framework that augments a standard 2D spatial network...
Arthur, Emmanuel; Møldrup, Per; Schjønning, Per
2013-01-01
was done using water retention (pore size distribution), soil gas diffusivity, air permeability, and derived pore network complexity parameters. Significant decreases in bulk density (increased total porosity) and increases in pores > 100 1m was observed for incubated samples compared with SR samples....... The proportion of pores > 100 1m increased in order: smectite gas diffusivity, air permeability, and derived pore network indices was greater for incubated samples than SR. For illitic soils...... for convective air transport when analyzing pore network complexity. Overall, our results showed that short-term regeneration...
Influence of fracture networks on radionuclide transport from solidified waste forms
Seetharam, S.C., E-mail: suresh.seetharam@sckcen.be [Performance Assessments Unit, Institute for Environment, Health and Safety, Belgian Nuclear Research Centre (SCK CEN), Boeretang 200, B-2400 Mol (Belgium); Perko, J.; Jacques, D. [Performance Assessments Unit, Institute for Environment, Health and Safety, Belgian Nuclear Research Centre (SCK CEN), Boeretang 200, B-2400 Mol (Belgium); Mallants, D. [CSIRO Land and Water, Waite Road – Gate 4, Glen Osmond, SA 5064 (Australia)
2014-04-01
Highlights: • Magnitude of peak radionuclide fluxes is less sensitive to the fracture network geometry. • Time of peak radionuclide fluxes is sensitive to the fracture networks. • Uniform flow model mimics a limiting case of a porous medium with large number of fine fractures. • Effect of fracture width on radionuclide flux depends on the ratio of fracture to matrix conductivity. • Effect of increased dispersivity in fractured media does not always result in a lower peak flux for specific fracture networks due to higher concentrations adjacent to the fracture plane. - Abstract: Analysis of the effect of fractures in porous media on fluid flow and mass transport is of great interest in many fields including geotechnical, petroleum, hydrogeology and waste management. This paper presents sensitivity analyses examining the effect of various hypothetical fracture networks on the performance of a planned near surface disposal facility in terms of radionuclide transport behaviour. As it is impossible to predict the initiation and evolution of fracture networks and their characteristics in concrete structures over time scales of interest, several fracture networks have been postulated to test the sensitivity of radionuclide release from a disposal facility. Fluid flow through concrete matrix and fracture networks are modelled via Darcy's law. A single species radionuclide transport equation is employed for both matrix and fracture networks, which include the processes advection, diffusion, dispersion, sorption/desorption and radioactive decay. The sensitivity study evaluates variations in fracture network configuration and fracture width together with different sorption/desorption characteristics of radionuclides in a cement matrix, radioactive decay constants and matrix dispersivity. The effect of the fractures is illustrated via radionuclide breakthrough curves, magnitude and time of peak mass flux, cumulative mass flux and concentration profiles. For the
Opportunistic Hybrid Transport Protocol (OHTP for Cognitive Radio Ad Hoc Sensor Networks
Yousaf Bin Zikria
2015-12-01
Full Text Available The inefficient assignment of spectrum for different communications purposes, plus technology enhancements and ever-increasing usage of wireless technology is causing spectrum scarcity. To address this issue, one of the proposed solutions in the literature is to access the spectrum dynamically or opportunistically. Therefore, the concept of cognitive radio appeared, which opens up a new research paradigm. There is extensive research on the physical, medium access control and network layers. The impact of the transport layer on the performance of cognitive radio ad hoc sensor networks is still unknown/unexplored. The Internet’s de facto transport protocol is not well suited to wireless networks because of its congestion control mechanism. We propose an opportunistic hybrid transport protocol for cognitive radio ad hoc sensor networks. We developed a new congestion control mechanism to differentiate true congestion from interruption loss. After such detection and differentiation, we propose methods to handle them opportunistically. There are several benefits to window- and rate-based protocols. To exploit the benefits of both in order to enhance overall system performance, we propose a hybrid transport protocol. We empirically calculate the optimal threshold value to switch between window- and rate-based mechanisms. We then compare our proposed transport protocol to Transmission Control Protocol (TCP-friendly rate control, TCP-friendly rate control for cognitive radio, and TCP-friendly window-based control. We ran an extensive set of simulations in Network Simulator 2. The results indicate that the proposed transport protocol performs better than all the others.
Timetable-based simulation method for choice set generation in large-scale public transport networks
Rasmussen, Thomas Kjær; Anderson, Marie Karen; Nielsen, Otto Anker
2016-01-01
The composition and size of the choice sets are a key for the correct estimation of and prediction by route choice models. While existing literature has posed a great deal of attention towards the generation of path choice sets for private transport problems, the same does not apply to public...... transport problems. This study proposes a timetable-based simulation method for generating path choice sets in a multimodal public transport network. Moreover, this study illustrates the feasibility of its implementation by applying the method to reproduce 5131 real-life trips in the Greater Copenhagen Area...
Jeon, Hyeon-Ae; Friederici, Angela D
2013-01-01
The lateral prefrontal cortex is known to be organized by cognitive hierarchies following a posterior-to-anterior gradient. Here we test whether this model applies across different cognitive domains by varying levels of cognitive hierarchy in first language, second language and non-language domains. These domains vary in their degree of automaticity with first language being the most automatic. For second language/non-language a clear gradient pattern of activation depending on the level of hierarchy is observed in the prefrontal cortex with the highest level of hierarchy recruiting its most anterior region, whereas for first language the highest level of hierarchy recruits its most posterior region. Moreover, second language/non-language and first language differ in the structural connectivity of their underlying networks. The current data strongly suggest that functional segregation of the prefrontal cortex is determined by cognitive hierarchy and the degree of automaticity.
Jensen, Peter Ruhdal; Van Der Gugten, A. A.; Bier, M.
1995-01-01
in the environment. The biochemical and biophysical processes of the living cell do not constitute a network with random connections. In this paper we shall discuss that cell function is organized in hierarchical substructures. We will briefly touch on the topics of (i) metabolic control and regulated gene...
Designing optimal transportation networks: a knowledge-based computer-aided multicriteria approach
Tung, S.I.
1986-01-01
The dissertation investigates the applicability of using knowledge-based expert systems (KBES) approach to solve the single-mode (automobile), fixed-demand, discrete, multicriteria, equilibrium transportation-network-design problem. Previous works on this problem has found that mathematical programming method perform well on small networks with only one objective. Needed is a solution technique that can be used on large networks having multiple, conflicting criteria with different relative importance weights. The KBES approach developed in this dissertation represents a new way to solve network design problems. The development of an expert system involves three major tasks: knowledge acquisition, knowledge representation, and testing. For knowledge acquisition, a computer aided network design/evaluation model (UFOS) was developed to explore the design space. This study is limited to the problem of designing an optimal transportation network by adding and deleting capacity increments to/from any link in the network. Three weighted criteria were adopted for use in evaluating each design alternative: cost, average V/C ratio, and average travel time.
The Use of Artificial Neural Networks to Assess the Capacity of Transport Measures
Duchaczek Artur
2015-06-01
Full Text Available In the area of logistics management both managers and engineers rely primarily on proven computational algorithms, for this reason, it is often difficult to convince them to the use of artificial neural networks in solving decision problems. The paper presents the possibilities of using the FANN library in building of a computer application applied in the area of logistics. The possibilities of the component are presented on the example of applications of artificial neural networks to estimate the capacity of transport vehicles based on their dimensions. The example presented in the work was solved with the use of a multi-network Layered Perceptron. The example depicted not only the possibility of using artificial neural networks for solving poorly structured tasks but also practical application of the TFannNetwork component
Effective usage of shortest paths promotes transportation efficiency on scale-free networks
Du, Wen-Bo; Wu, Zhi-Xi; Cai, Kai-Quan
2013-09-01
With rapid economic and social development, the problem of traffic congestion is getting more and more serious. Accordingly, network traffic models have attracted extensive attention. In this paper, we introduce a shortest-remaining-path-first queuing strategy into a network traffic model on Barabási-Albert scale-free networks under efficient routing protocol, where one packet’s delivery priority is related to its current distance to the destination. Compared with the traditional first-in-first-out queuing strategy, although the network capacity has no evident changes, some other indexes reflecting transportation efficiency are significantly improved in the congestion state. Extensive simulation results and discussions are carried out to explain the phenomena. Our work may be helpful for the designing of optimal networked-traffic systems.
B. van Riessen (Bart); R.R. Negenborn (Rudy); R. Dekker (Rommert); G. Lodewijks (Gabriel)
2013-01-01
textabstractAn intermodal container transportation network is being developed between Rotterdam and several inland terminals in North West Europe: the EUROPEAN GATEWAY SERVICES (EGS) network. This network is developed and operated by the seaports of EUROPE CONTAINER TERMINALS (ECT). To use this netw
William C. Conner
2007-08-02
These research studies focused on the characterization and transport for porous solids which comprise both microporosity and mesoporosity. Such materials represent membranes made from zeolites as well as for many new nanoporous solids. Several analytical sorption techniques were developed and evaluated by which these multi-dimensional porous solids could be quantitatively characterized. Notably an approach by which intact membranes could be studied was developed and applied to plate-like and tubular supported zeolitic membranes. Transport processes were studied experimentally and theoretically based on the characterization studies.
Kramer, Natalie; Wohl, Ellen
2017-02-01
To effectively manage wood in rivers, we need a better understanding of wood mobility within river networks. Here, we review primarily field-based (and some numerical) studies of wood transport. We distinguish small, medium, large, and great rivers based on wood piece dimensions relative to channel and flow dimensions and dominant controls on wood transport. We suggest further identification and designation of wood transport regimes as a useful way to characterize spatial-temporal network heterogeneity and to conceptualize the primary controls on wood mobility in diverse river segments. We draw analogies between wood and bedload transport, including distinguishing Eulerian and Lagrangian approaches, exploring transport capacity, and quantifying thresholds of wood mobility. We identify mobility envelopes for remobilization of wood with relation to increasing peak discharges, stream size, and dimensionless log lengths. Wood transport in natural channels exhibits high spatial and temporal variability, with discontinuities along the channel network at bankfull flow and when log lengths equal channel widths. Although median mobilization rates increase with increasing channel size, maximum mobilization rates are greatest in medium-sized channels. Most wood is transported during relatively infrequent high flows, but flows under bankfull can transport up to 30% of stored wood. We use conceptual models of dynamic equilibrium of wood in storage and of spiralling wood transport paths through drainage networks, as well as a metaphor of traffic on a road, to explore discontinuous wood movement through a river network. The primary limitations to describing wood transport are inappropriate time scales of observation and lack of sufficient data on mobility from diverse rivers. Improving models of wood flux requires better characterization of average step lengths within the lifetime travel path of a piece of wood. We suggest that future studies focus on: (i) continuous or high
Anion channels/transporters in plants: from molecular bases to regulatory networks.
Barbier-Brygoo, Hélène; De Angeli, Alexis; Filleur, Sophie; Frachisse, Jean-Marie; Gambale, Franco; Thomine, Sébastien; Wege, Stefanie
2011-01-01
Anion channels/transporters are key to a wide spectrum of physiological functions in plants, such as osmoregulation, cell signaling, plant nutrition and compartmentalization of metabolites, and metal tolerance. The recent identification of gene families encoding some of these transport systems opened the way for gene expression studies, structure-function analyses of the corresponding proteins, and functional genomics approaches toward further understanding of their integrated roles in planta. This review, based on a few selected examples, illustrates that the members of a given gene family exhibit a diversity of substrate specificity, regulation, and intracellular localization, and are involved in a wide range of physiological functions. It also shows that post-translational modifications of transport proteins play a key role in the regulation of anion transport activity. Key questions arising from the increasing complexity of networks controlling anion transport in plant cells (the existence of redundancy, cross talk, and coordination between various pathways and compartments) are also addressed.
Dynamics of carbon dioxide transport in a multiple sink network (GHGT-11)
Veltin, J.; Belfroid, S.P.C.
2013-01-01
As Carbon Capture and Storage slowly gets accepted and integrated as a mean for cleaner utilization of fossil fuels, the integration of capture, transport and storage becomes a key component to properly design a CO2 network. While the boundary conditions set by the capture and storage units have bee
A freight transport optimization model for integrated network, service, and policy design
Zhang, M.; Janic, M.; Tavasszy, L.A.
2015-01-01
This paper presents a freight transport optimization model that simultaneously incorporates multimodal infrastructure, hub-based service network structures, and the various design objectives of multiple actors. The model has been calibrated and validated using real-life data from the case study of
A. Bustos
2014-08-01
This paper presents the main features of the model, the theoretical bases and a computational implementation. Experiments were applied in a transport network for the exportation market of ornamental flowers as perishable goods from Mexico to the United States, which considered variations in border crossing times.
Cats, O.; Jenelius, E.
2015-01-01
Disruptions often result with partial capacity reduction without resulting with a complete breakdown. This study aims to move beyond the analysis of complete failure by investigating the impacts of partial capacity reduction on public transport network performance. We analyse the relation between th
Debbarma, Rousan; Behura, Sanjay; Nguyen, Phong; Sreeprasad, T S; Berry, Vikas
2016-04-06
Percolating network of mixed 2D nanomaterials (2DNs) can leverage the unique electronic structures of different 2DNs, their interfacial doping, manipulable conduction pathways, and local traps. Here, we report on the percolation mechanism and electro-capacitive transport pathways of mixed-platelet network of hexagonal boron nitride (hBN) and reduced graphene oxide (rGO), two isostructural and isoelectronic 2DNs. The transport mechanism is explained in terms of electron hopping through isolated hBN defect traps between rGO (possibly via electron tunneling/hopping through "funneling" points). With optical bandgaps of 4.57 and 4.08 eV for the hBN-domains and 2.18 eV for the rGO domains, the network of hBN with rGO exhibits Poole-Frenkel emission-based transport with mean hopping gap of 1.12 nm (∼hBN trilayer) and an activation barrier of ∼15 ± 0.7 meV. Further, hBN (1.7 pF) has a 6-fold lower capacitance than 1:1 hBN:rGO, which has a resistance 2 orders of magnitude higher than that of rGO (1.46 MΩ). These carrier transport results can be applied to other multi-2DN networks for development of next-generation functional 2D-devices.
Influence of embodied energy in the energy efficiency of optical transport networks
Mata, Javier; Ye, Yabin; Lopez, Jorge;
2013-01-01
An energy model including both operational and embodied energy is proposed to evaluate the performance evolution of optical transport networks in a multi-period study up to 15 years. Significant improvements in energy efficiency per GHz and energy reductions can be achieved for flexi-grid OFDM-ba...
Chase, Ivan D; Lindquist, W Brent
2016-01-01
The standard approach in accounting for hierarchical differentiation in biology and the social sciences considers a hierarchy as a static distribution of individuals possessing differing amounts of some valued commodity, assumes that the hierarchy is generated by micro-level processes involving individuals, and attempts to reverse engineer the processes that produced the hierarchy. However, sufficient experimental and analytical results are available to evaluate this standard approach in the case of animal dominance hierarchies (pecking orders). Our evaluation using evidence from hierarchy formation in small groups of both hens and cichlid fish reveals significant deficiencies in the three tenets of the standard approach in accounting for the organization of dominance hierarchies. In consequence, we suggest that a new approach is needed to explain the organization of pecking orders and, very possibly, by implication, for other kinds of social hierarchies. We develop an example of such an approach that considers dominance hierarchies to be dynamic networks, uses dynamic sequences of interaction (dynamic network motifs) to explain the organization of dominance hierarchies, and derives these dynamic sequences directly from observation of hierarchy formation. We test this dynamical explanation using computer simulation and find a good fit with actual dynamics of hierarchy formation in small groups of hens. We hypothesize that the same dynamic sequences are used in small groups of many other animal species forming pecking orders, and we discuss the data required to evaluate our hypothesis. Finally, we briefly consider how our dynamic approach may be generalized to other kinds of social hierarchies using the example of the distribution of empty gastropod (snail) shells occupied in populations of hermit crabs.
Ivan D Chase
Full Text Available The standard approach in accounting for hierarchical differentiation in biology and the social sciences considers a hierarchy as a static distribution of individuals possessing differing amounts of some valued commodity, assumes that the hierarchy is generated by micro-level processes involving individuals, and attempts to reverse engineer the processes that produced the hierarchy. However, sufficient experimental and analytical results are available to evaluate this standard approach in the case of animal dominance hierarchies (pecking orders. Our evaluation using evidence from hierarchy formation in small groups of both hens and cichlid fish reveals significant deficiencies in the three tenets of the standard approach in accounting for the organization of dominance hierarchies. In consequence, we suggest that a new approach is needed to explain the organization of pecking orders and, very possibly, by implication, for other kinds of social hierarchies. We develop an example of such an approach that considers dominance hierarchies to be dynamic networks, uses dynamic sequences of interaction (dynamic network motifs to explain the organization of dominance hierarchies, and derives these dynamic sequences directly from observation of hierarchy formation. We test this dynamical explanation using computer simulation and find a good fit with actual dynamics of hierarchy formation in small groups of hens. We hypothesize that the same dynamic sequences are used in small groups of many other animal species forming pecking orders, and we discuss the data required to evaluate our hypothesis. Finally, we briefly consider how our dynamic approach may be generalized to other kinds of social hierarchies using the example of the distribution of empty gastropod (snail shells occupied in populations of hermit crabs.
Effects of self-organization on transport in granular matter: A network-based approach
Smart, A.; Umbanhowar, P.; Ottino, J.
2007-07-01
Granular matter may be one of the simplest prototypes of what have come to be regarded as complex systems —systems where simple interactions can lead to rich, often surprising, global behavior. For example, interparticle contacts in a granular system give rise to networks that are 1) heterogeneous, i.e., a few particles support high compressive force, while many others support relatively little, and 2) self-organized, i.e., spatially correlated strong forces tend to form a sub-network of interconnecting "force chains". Using numerical simulations, we investigate the influence of heterogeneity and self-organization on the transport properties of granular matter, with particular attention to heat conduction —a phenomenon of ubiquitous importance in engineering and nature. We find that self-organization in the granular network promotes efficient transport. Furthermore, a network-attack experiment suggests that contacts with high betweenness centrality, not necessarily those with highest local heat transfer coefficient, most significantly influence transport behavior. We find that concepts of network theory yield valuable insight —both qualitative and quantitative— into the observed behavior.
Özgür Başkan
2014-09-01
Full Text Available Differential Evolution algorithm has effectively been used to solve engineering optimization problems recently. The Differential Evolution algorithm, which uses similar principles with Genetic Algorithms, is more robust on obtaining optimal solution than many other heuristic algorithms with its simpler structure. In this study, Differential Evolution algorithm is applied to the transportation network design problems and its effectiveness on the solution is investigated. In this context, Differential Evolution based models are developed using bi-level programming approach for the solution of the transportation network design problem and determination of the on-street parking places in urban road networks. In these models, optimal investment and parking strategies are investigated on the upper level. On the lower level, deterministic traffic assignment problem, which represents drivers' responses, is solved using Frank-Wolfe algorithm and VISUM traffic modeling software. In order to determine the effectiveness of the proposed models, numerical applications are carried out on Sioux-Falls test network. Results showed that the Differential Evolution algorithm may effectively been used for the solution of transportation network design problems.
A Hierarchical Energy Efficient Reliable Transport Protocol for Wireless Sensor Networks
Prabhudutta Mohanty
2014-12-01
Full Text Available The two important requirements for many Wireless Senor Networks (WSNs are prolonged network lifetime and end-to-end reliability. The sensor nodes consume more energy during data transmission than the data sensing. In WSN, the redundant data increase the energy consumption, latency and reduce reliability during data transmission. Therefore, it is important to support energy efficient reliable data transport in WSNs. In this paper, we present a Hierarchical Energy Efficient Reliable Transport Protocol (HEERTP for the data transmission within the WSN. This protocol maximises the network lifetime by controlling the redundant data transmission with the co-ordination of Base Station (BS. The proposed protocol also achieves end-to-end reliability using a hop-by-hop acknowledgement scheme. We evaluate the performance of the proposed protocol through simulation. The simulation results reveal that our proposed protocol achieves better performance in terms of energy efficiency, latency and reliability than the existing protocols.
Most probable paths in temporal weighted networks: An application to ocean transport
Ser-Giacomi, Enrico; Hernandez-Garcia, Emilio; Lopez, Cristobal
2014-01-01
We consider paths in weighted and directed temporal networks, introducing tools to compute sets of paths of high probability. We quantify the relative importance of the most probable path between two nodes with respect to the whole set of paths, and to a subset of highly probable paths which incorporate most of the connection probability. These concepts are used to provide alternative definitions of betweenness centrality. We apply our formalism to a transport network describing surface flow in the Mediterranean sea. Despite the full transport dynamics is described by a very large number of paths we find that, for realistic time scales, only a very small subset of high probability paths (or even a single most probable one) is enough to characterize global connectivity properties of the network.
Impact of carbon nanotube length on electron transport in aligned carbon nanotube networks
Lee, Jeonyoon; Stein, Itai Y. [Department of Mechanical Engineering, Massachusetts Institute of Technology, 77 Massachusetts Ave., Cambridge, Massachusetts 02139 (United States); Devoe, Mackenzie E. [Department of Materials Science and Engineering, Massachusetts Institute of Technology, 77 Massachusetts Ave., Cambridge, Massachusetts 02139 (United States); Lewis, Diana J.; Lachman, Noa; Buschhorn, Samuel T.; Wardle, Brian L., E-mail: wardle@mit.edu [Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, 77 Massachusetts Ave., Cambridge, Massachusetts 02139 (United States); Kessler, Seth S. [Metis Design Corporation, 205 Portland St., Boston, Massachusetts 02114 (United States)
2015-02-02
Here, we quantify the electron transport properties of aligned carbon nanotube (CNT) networks as a function of the CNT length, where the electrical conductivities may be tuned by up to 10× with anisotropies exceeding 40%. Testing at elevated temperatures demonstrates that the aligned CNT networks have a negative temperature coefficient of resistance, and application of the fluctuation induced tunneling model leads to an activation energy of ≈14 meV for electron tunneling at the CNT-CNT junctions. Since the tunneling activation energy is shown to be independent of both CNT length and orientation, the variation in electron transport is attributed to the number of CNT-CNT junctions an electron must tunnel through during its percolated path, which is proportional to the morphology of the aligned CNT network.
Impact of carbon nanotube length on electron transport in aligned carbon nanotube networks
Lee, Jeonyoon; Stein, Itai Y.; Devoe, Mackenzie E.; Lewis, Diana J.; Lachman, Noa; Kessler, Seth S.; Buschhorn, Samuel T.; Wardle, Brian L.
2015-02-01
Here, we quantify the electron transport properties of aligned carbon nanotube (CNT) networks as a function of the CNT length, where the electrical conductivities may be tuned by up to 10× with anisotropies exceeding 40%. Testing at elevated temperatures demonstrates that the aligned CNT networks have a negative temperature coefficient of resistance, and application of the fluctuation induced tunneling model leads to an activation energy of ≈14 meV for electron tunneling at the CNT-CNT junctions. Since the tunneling activation energy is shown to be independent of both CNT length and orientation, the variation in electron transport is attributed to the number of CNT-CNT junctions an electron must tunnel through during its percolated path, which is proportional to the morphology of the aligned CNT network.
Network Modelling of the Influence of Swelling on the Transport Behaviour of Bentonite
Ignatios Athanasiadis
2016-12-01
Full Text Available Wetting of bentonite is a complex hydro-mechanical process that involves swelling and, if confined, significant structural changes in its void structure. A coupled structural transport network model is proposed to investigate the effect of wetting of bentonite on retention conductivity and swelling pressure response. The transport network of spheres and pipes, representing voids and throats, respectively, relies on Laplace–Young’s equation to model the wetting process. The structural network uses a simple elasto-plastic approach without hardening to model the rearrangement of the fabric. Swelling is introduced in the form of an eigenstrain in the structural elements, which are adjacent to water filled spheres. For a constrained cell, swelling is shown to produce plastic strains, which result in a reduction of pipe and sphere spaces and, therefore, influence the conductivity and retention behaviour.
Changfeng Zhu
2016-01-01
Full Text Available In order to coordinate the complex relationship between supplies distribution and path selection, some influential factors must be taken into account such as the insufficient remaining capacity of the road and uncertainty of travel time during supplies distribution and transportation. After the structure of emergency logistics network is analyzed, the travel time Bayes risk function of path and the total loss Bayes risk function of the disaster area are proposed. With the emergency supplies total transportation unit loss as the goal, an emergency logistics network optimization model under crowded conditions is established by the Bayes decision theory and solved by the improved ant colony algorithm. Then, a case of the model is validated to prove that the emergency logistics network optimization model is effective in congested conditions.
Silva, Jonny Carlos da; Porciuncula, Gilson Simoes [Santa Catarina Univ., Florianopolis, SC (Brazil). Dept. de Engenharia Mecanica Lab. de Sistemas Hidraulicos e Pneumaticos
2003-07-01
This paper presents a project to integrate expert system and dynamic simulation of natural gas transportation network applying the concept of agents. Natural gas pipeline operation requires the intermittent analysis of hundreds interrelated operational parameters, which represent the network state. The combination of expert system and dynamic simulation is a synergic solution for this kind of problem. With expert system techniques, it is possible to implement rules that describe the relationship between current operational parameters and the network normal operational conditions based on heuristic knowledge. By applying such rules, the system aims to evaluate the real network state and to predict abnormal conditions via dynamic simulation, allowing time analysis of operational situation in advance. At the current stage, the project presents a well defined model. The process of knowledge acquisition and representation has taken place following an incremental approach, considered as development paradigm. The project objectives are to reduce costs, increase the reliability and organize pipeline operation and maintenance information. This work is part of SEGRED project established as partnership among LASHIP/UFSC, SCGAS, TBG and PETROBRAS. The project also received support from FINEP. (author)
Manzoni, S.; Hunt, A. G.
2016-12-01
Vegetation growth modulates cycling of water, carbon, and nutrients at local-to-global scales. It is therefore critical to quantify plant growth rates and how they are constrained by environmental conditions (especially limited resource availability). Various theoretical approaches have been proposed to this aim. Specifically, allometric theory provides a powerful tool to describe plant growth form and function, but it is focused on the properties of plant xylem networks, neglecting any role played by soils in supplying water to plants. On the other hand, percolation theory addresses physical constraints imposed by the soil pore network to water and nutrient transport, neglecting roles of root networks and vegetation taking up soil resources. In this contribution, we merge these two perspectives to derive scaling relations between plant size (namely height) and age. Our guiding hypothesis is that the root network expands in the soil at a rate sufficient to match the rate of transport of water and nutrients in an idealized optimal fractal pore network, as predicted by percolation theory; with nutrient transport distance vs. time scaling exponent 0.82, and water transport (saturated conditions) distance vs. time scaling exponent 1. The root expansion rate is mirrored by growth aboveground, as in allometric theory, which predicts an isometric relation between root extension and plant height. Building on these results, we predict that the scaling of plant height and age should also have exponent 0.82 in natural systems where nutrients are heterogeneously distributed, and 1 in fertilized systems where nutrients are homogeneously distributed. These predictions are successfully tested with extensive datasets covering major plant functional types worldwide, showing that soil and root network properties constrain vegetation growth by setting limits to the rates of water and nutrient supply to plants.
Research on Some Bus Transport Networks with Random Overlapping Clique Structure
YANG Xu-Hua; WANG Bo; WANG Wan-Liang; SUN You-Xian
2008-01-01
On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We' also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs.
Smart Collision Avoidance and Hazard Routing Mechanism for Intelligent Transport Network
Singh, Gurpreet; Gupta, Pooja; Wahab, Mohd Helmy Abd
2017-08-01
The smart vehicular ad-hoc network is the network that consists of vehicles for smooth movement and better management of the vehicular connectivity across the given network. This research paper aims to propose a set of solution for the VANETs consisting of the automatic driven vehicles, also called as the autonomous car. Such vehicular networks are always prone to collision due to the natural or un-natural reasons which must be solved before the large-scale deployment of the autonomous transport systems. The newly designed intelligent transport movement control mechanism is based upon the intelligent data propagation along with the vehicle collision and traffic jam prevention schema [8], which may help the future designs of smart cities to become more robust and less error-prone. In the proposed model, the focus is on designing a new dynamic and robust hazard routing protocol for intelligent vehicular networks for improvement of the overall performance in various aspects. It is expected to improve the overall transmission delay as well as the number of collisions or adversaries across the vehicular network zone.
Strategic network design of Java Island fuel supply with production-transportation solution
Dianawati, Fauzia; Farizal, -; Surjandari, Isti; Marzuli, Rully
2011-10-01
This study aims to find more efficient supply network, from refineries / imports to fuel terminal, which still uses the Tanker, Tank Trucks or Rail Tank Wagon with an alternative pipeline that are considered more efficient than other transport modes, as well as gaining pipeline transportation network optimization analysis tailored to the capabilities/ capacity of refinery production and capacity of the pipe mode. With the complexity of the number of 3 point sources of supply, 19 destination of terminal, 4 kinds of products and 4 types of transport modes, transport-production model modified by adding multi-modal transport and investment costs of new pipeline. Then coded in Lingo program which adopts Branch & Bound technique and input the processed data in order to obtain an optimal distribution pattern produced the lowest distribution costs. This B&B solution was also compared with SCO solution which is a metaheuristic method. The results of this study lead to the development of new modes of pipeline connections in amount of 4 alternatives, generated from the optimal solution, but still potentially earned savings of about IDR 1 Trillion per year from cost-efficiency of product procurement and transportation costs.
Poisson hierarchy of discrete strings
Ioannidou, Theodora, E-mail: ti3@auth.gr [Faculty of Civil Engineering, School of Engineering, Aristotle University of Thessaloniki, 54249, Thessaloniki (Greece); Niemi, Antti J., E-mail: Antti.Niemi@physics.uu.se [Department of Physics and Astronomy, Uppsala University, P.O. Box 803, S-75108, Uppsala (Sweden); Laboratoire de Mathematiques et Physique Theorique CNRS UMR 6083, Fédération Denis Poisson, Université de Tours, Parc de Grandmont, F37200, Tours (France); Department of Physics, Beijing Institute of Technology, Haidian District, Beijing 100081 (China)
2016-01-28
The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.
Dr.S.S.Riaz Ahamed
2010-07-01
Full Text Available Optical networks are high-capacity telecommunications networks based on optical technologies and components that provide routing, grooming, and restoration at the wavelength level as well as wavelength-based services. As networks face increasing bandwidth demand and diminishing fiber availability, network providers are moving towards a crucial milestone in network evolution: the optical network. Optical networks, based on the emergence of the optical layer in transport networks, provide higher capacity and reduced costs for new applications such as the Internet, video and multimedia interaction, and advanced digital services. Synchronous optical network (SONET is a standard for optical telecommunications transport. The increased configuration flexibility and bandwidth availability of SONET provides significant advantages over the older telecommunications system.
Evolving Transport Networks With Cellular Automata Models Inspired by Slime Mould.
Tsompanas, Michail-Antisthenis I; Sirakoulis, Georgios Ch; Adamatzky, Andrew I
2015-09-01
Man-made transport networks and their design are closely related to the shortest path problem and considered amongst the most debated problems of computational intelligence. Apart from using conventional or bio-inspired computer algorithms, many researchers tried to solve this kind of problem using biological computing substrates, gas-discharge solvers, prototypes of a mobile droplet, and hot ice computers. In this aspect, another example of biological computer is the plasmodium of acellular slime mould Physarum polycephalum (P. polycephalum), which is a large single cell visible by an unaided eye and has been proven as a reliable living substrate for implementing biological computing devices for computational geometry, graph-theoretical problems, and optimization and imitation of transport networks. Although P. polycephalum is easy to experiment with, computing devices built with the living slime mould are extremely slow; it takes slime mould days to execute a computation. Consequently, mapping key computing mechanisms of the slime mould onto silicon would allow us to produce efficient bio-inspired computing devices to tackle with hard to solve computational intelligence problems like the aforementioned. Toward this direction, a cellular automaton (CA)-based, Physarum-inspired, network designing model is proposed. This novel CA-based model is inspired by the propagating strategy, the formation of tubular networks, and the computing abilities of the plasmodium of P. polycephalum. The results delivered by the CA model demonstrate a good match with several previously published results of experimental laboratory studies on imitation of man-made transport networks with P. polycephalum. Consequently, the proposed CA model can be used as a virtual, easy-to-access, and biomimicking laboratory emulator that will economize large time periods needed for biological experiments while producing networks almost identical to the tubular networks of the real-slime mould.
Hahm, Myung Gwan; Wang, Hailong; Jung, Hyun Young; Hong, Sanghyun; Lee, Sung-Goo; Kim, Sung-Ryong; Upmanyu, Moneesh; Jung, Yung Joon
2012-05-01
High-density carbon nanotube networks (CNNs) continue to attract interest as active elements in nanoelectronic devices, nanoelectromechanical systems (NEMS) and multifunctional nanocomposites. The interplay between the network nanostructure and its properties is crucial, yet current understanding remains limited to the passive response. Here, we employ a novel superstructure consisting of millimeter-long vertically aligned single walled carbon nanotubes (SWCNTs) sandwiched between polydimethylsiloxane (PDMS) layers to quantify the effect of two classes of mechanical stimuli, film densification and stretching, on the electronic and thermal transport across the network. The network deforms easily with an increase in the electrical and thermal conductivities, suggestive of a floppy yet highly reconfigurable network. Insight from atomistically informed coarse-grained simulations uncover an interplay between the extent of lateral assembly of the bundles, modulated by surface zipping/unzipping, and the elastic energy associated with the bent conformations of the nanotubes/bundles. During densification, the network becomes highly interconnected yet we observe a modest increase in bundling primarily due to the reduced spacing between the SWCNTs. The stretching, on the other hand, is characterized by an initial debundling regime as the strain accommodation occurs via unzipping of the branched interconnects, followed by rapid rebundling as the strain transfers to the increasingly aligned bundles. In both cases, the increase in the electrical and thermal conductivity is primarily due to the increase in bundle size; the changes in network connectivity have a minor effect on the transport. Our results have broad implications for filamentous networks of inorganic nanoassemblies composed of interacting tubes, wires and ribbons/belts.High-density carbon nanotube networks (CNNs) continue to attract interest as active elements in nanoelectronic devices, nanoelectromechanical systems
Optimal paths planning in dynamic transportation networks with random link travel times
孙世超; 段征宇; 杨东援
2014-01-01
A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent (STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers’ robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.
Disorder and dephasing as control knobs for light transport in optical fiber cavity networks
Viciani, Silvia; Gherardini, Stefano; Lima, Manuela; Bellini, Marco; Caruso, Filippo
2016-11-01
Transport phenomena represent a very interdisciplinary topic with applications in many fields of science, such as physics, chemistry, and biology. In this context, the possibility to design a perfectly controllable experimental setup, where to tune and optimize its dynamics parameters, is a challenging but very relevant task to emulate, for instance, the transmission of energy in light harvesting processes. Here, we experimentally build a scalable and controllable transport emulator based on optical fiber cavity networks where the system noise parameters can be finely tuned while maximizing the transfer efficiency. In particular, we demonstrate that disorder and dephasing noise are two control knobs allowing one to play with constructive and destructive interference to optimize the transport paths towards an exit site. These optical setups, on one side, mimic the transport dynamics in natural photosynthetic organisms and, on the other, are very promising platforms to artificially design optimal nanoscale structures for novel, more efficient, clean energy technologies.
Backstepping fuzzy-neural-network control design for hybrid maglev transportation system.
Wai, Rong-Jong; Yao, Jing-Xiang; Lee, Jeng-Dao
2015-02-01
This paper focuses on the design of a backstepping fuzzy-neural-network control (BFNNC) for the online levitated balancing and propulsive positioning of a hybrid magnetic levitation (maglev) transportation system. The dynamic model of the hybrid maglev transportation system including levitated hybrid electromagnets to reduce the suspension power loss and the friction force during linear movement and a propulsive linear induction motor based on the concepts of mechanical geometry and motion dynamics is first constructed. The ultimate goal is to design an online fuzzy neural network (FNN) control methodology to cope with the problem of the complicated control transformation and the chattering control effort in backstepping control (BSC) design, and to directly ensure the stability of the controlled system without the requirement of strict constraints, detailed system information, and auxiliary compensated controllers despite the existence of uncertainties. In the proposed BFNNC scheme, an FNN control is utilized to be the major control role by imitating the BSC strategy, and adaptation laws for network parameters are derived in the sense of projection algorithm and Lyapunov stability theorem to ensure the network convergence as well as stable control performance. The effectiveness of the proposed control strategy for the hybrid maglev transportation system is verified by experimental results, and the superiority of the BFNNC scheme is indicated in comparison with the BSC strategy and the backstepping particle-swarm-optimization control system in previous research.
Dynamics of Air Transport Networks: A Review from a Complex Systems Perspective
Rocha, Luis Enrique Correa
2016-01-01
Air transport systems are highly dynamic at temporal scales from minutes to years. This dynamic behavior not only characterizes the evolution of the system but also affect the system's functioning. Understanding the evolutionary mechanisms is thus fundamental in order to better design optimal air transport networks that benefits companies, passengers and the environment. In this review, we briefly present and discuss the state-of-art on time-evolving air transport networks. We distinguish the structural analysis of sequences of network snapshots, ideal for long-term network evolution (e.g. annual evolution), and temporal paths, preferred for short-term dynamics (e.g. hourly evolution). We emphasize that most previous research focused on the first modeling approach (i.e. long-term) whereas only a few studies look at high-resolution temporal paths. We conclude the review highlighting that much research remains to be done, both to apply already available methods and to develop new measures for temporal paths on ...
Minimum requirements for predictive pore-network modeling of solute transport in micromodels
Mehmani, Yashar; Tchelepi, Hamdi A.
2017-10-01
Pore-scale models are now an integral part of analyzing fluid dynamics in porous materials (e.g., rocks, soils, fuel cells). Pore network models (PNM) are particularly attractive due to their computational efficiency. However, quantitative predictions with PNM have not always been successful. We focus on single-phase transport of a passive tracer under advection-dominated regimes and compare PNM with high-fidelity direct numerical simulations (DNS) for a range of micromodel heterogeneities. We identify the minimum requirements for predictive PNM of transport. They are: (a) flow-based network extraction, i.e., discretizing the pore space based on the underlying velocity field, (b) a Lagrangian (particle tracking) simulation framework, and (c) accurate transfer of particles from one pore throat to the next. We develop novel network extraction and particle tracking PNM methods that meet these requirements. Moreover, we show that certain established PNM practices in the literature can result in first-order errors in modeling advection-dominated transport. They include: all Eulerian PNMs, networks extracted based on geometric metrics only, and flux-based nodal transfer probabilities. Preliminary results for a 3D sphere pack are also presented. The simulation inputs for this work are made public to serve as a benchmark for the research community.
Modeling sediment transport after ditch network maintenance of a forested peatland
Haahti, K.; Marttila, H.; Warsta, L.; Kokkonen, T.; Finér, L.; Koivusalo, H.
2016-11-01
Elevated suspended sediment (SS) loads released from peatlands after drainage operations and the resulting negative effect on the ecological status of the receiving water bodies have been widely recognized. Understanding the processes controlling erosion and sediment transport within the ditch network forms a prerequisite for adequate sediment control. While numerous experimental studies have been reported in this field, model based assessments are rare. This study presents a modeling approach to investigate sediment transport in a peatland ditch network. The transport model describes bed erosion, rain-induced bank erosion, floc deposition, and consolidation of the bed. Coupled to a distributed hydrological model, sediment transport was simulated in a 5.2 ha forestry-drained peatland catchment for 2 years after ditch cleaning. Comparing simulation results to measured SS concentrations suggested that the loose peat material, produced during excavation, contributed markedly to elevated SS concentrations immediately after ditch cleaning. Both snowmelt and summer rainstorms contributed critically to annual loads. Springtime peat erosion during snowmelt was driven by ditch flow whereas during summer rainfalls, bank erosion by raindrop impact was identified as an important process. Relating modeling results to observed spatial topographic changes in the ditch network was challenging and the results were difficult to verify. Nevertheless, the model has potential to identify risk areas for erosion. The results demonstrate that modeling is effective in separating the importance of different processes and complements pure experimental approaches. Modeling results can aid planning and designing efficient sediment control measures and guide the focus of experimental studies.
Quantitative characterization of the microstructure and transport properties of biopolymer networks
Jiao, Yang; Torquato, Salvatore
2012-06-01
Biopolymer networks are of fundamental importance to many biological processes in normal and tumorous tissues. In this paper, we employ the panoply of theoretical and simulation techniques developed for characterizing heterogeneous materials to quantify the microstructure and effective diffusive transport properties (diffusion coefficient De and mean survival time τ) of collagen type I networks at various collagen concentrations. In particular, we compute the pore-size probability density function P(δ) for the networks and present a variety of analytical estimates of the effective diffusion coefficient De for finite-sized diffusing particles, including the low-density approximation, the Ogston approximation and the Torquato approximation. The Hashin-Strikman upper bound on the effective diffusion coefficient De and the pore-size lower bound on the mean survival time τ are used as benchmarks to test our analytical approximations and numerical results. Moreover, we generalize the efficient first-passage-time techniques for Brownian-motion simulations in suspensions of spheres to the case of fiber networks and compute the associated effective diffusion coefficient De as well as the mean survival time τ, which is related to nuclear magnetic resonance relaxation times. Our numerical results for De are in excellent agreement with analytical results for simple network microstructures, such as periodic arrays of parallel cylinders. Specifically, the Torquato approximation provides the most accurate estimates of De for all collagen concentrations among all of the analytical approximations we consider. We formulate a universal curve for τ for the networks at different collagen concentrations, extending the work of Torquato and Yeong (1997 J. Chem. Phys. 106 8814). We apply rigorous cross-property relations to estimate the effective bulk modulus of collagen networks from a knowledge of the effective diffusion coefficient computed here. The use of cross-property relations
Hahm, Myung Gwan; Wang, Hailong; Jung, Hyun Young; Hong, Sanghyun; Lee, Sung-Goo; Kim, Sung-Ryong; Upmanyu, Moneesh; Jung, Yung Joon
2012-06-01
High-density carbon nanotube networks (CNNs) continue to attract interest as active elements in nanoelectronic devices, nanoelectromechanical systems (NEMS) and multifunctional nanocomposites. The interplay between the network nanostructure and its properties is crucial, yet current understanding remains limited to the passive response. Here, we employ a novel superstructure consisting of millimeter-long vertically aligned single walled carbon nanotubes (SWCNTs) sandwiched between polydimethylsiloxane (PDMS) layers to quantify the effect of two classes of mechanical stimuli, film densification and stretching, on the electronic and thermal transport across the network. The network deforms easily with an increase in the electrical and thermal conductivities, suggestive of a floppy yet highly reconfigurable network. Insight from atomistically informed coarse-grained simulations uncover an interplay between the extent of lateral assembly of the bundles, modulated by surface zipping/unzipping, and the elastic energy associated with the bent conformations of the nanotubes/bundles. During densification, the network becomes highly interconnected yet we observe a modest increase in bundling primarily due to the reduced spacing between the SWCNTs. The stretching, on the other hand, is characterized by an initial debundling regime as the strain accommodation occurs via unzipping of the branched interconnects, followed by rapid rebundling as the strain transfers to the increasingly aligned bundles. In both cases, the increase in the electrical and thermal conductivity is primarily due to the increase in bundle size; the changes in network connectivity have a minor effect on the transport. Our results have broad implications for filamentous networks of inorganic nanoassemblies composed of interacting tubes, wires and ribbons/belts.
Latty, Tanya; Holmes, Michael J; Makinson, James C; Beekman, Madeleine
2017-02-15
Transportation networks play a crucial role in human and animal societies. For a transportation network to be efficient, it must have adequate capacity to meet traffic demand. Network design becomes increasingly difficult in situations where traffic demand can change unexpectedly. In humans, network design is often constrained by path dependency because it is difficult to move a road once it is built. A similar issue theoretically faces pheromone-trail-laying social insects; once a trail has been laid, positive feedback makes re-routing difficult because new trails cannot compete with continually reinforced pre-existing trails. In the present study, we examined the response of Argentine ant colonies and their trail networks to variable environments where resources differ in quality and change unexpectedly. We found that Argentine ant colonies effectively tracked changes in food quality such that colonies allocated the highest proportion of foragers to the most rewarding feeder. Ant colonies maximised access to high concentration feeders by building additional trails and routes connecting the nest to the feeder. Trail networks appeared to form via a pruning process in which lower traffic trails were gradually removed from the network. At the same time, we observed several instances where new trails appear to have been built to accommodate a surge in demand. The combination of trail building when traffic demand is high and trail pruning when traffic demand is low results in a demand-driven network formation system that allows ants to monopolise multiple dynamic resources. © 2017. Published by The Company of Biologists Ltd.
Analog and digital transport of RF channels over converged 5G wireless-optical networks
Binh, Le Nguyen
2016-02-01
Under the exponential increase demand by the emerging 5G wireless access networking and thus data-center based Internet, novel and economical transport of RF channels to and from wireless access systems. This paper presents the transport technologies of RF channels over the analog and digital domain so as to meet the demands of the transport capacity reaching multi-Tbps, in the followings: (i) The convergence of 5G broadband wireless and optical networks and its demands on capacity delivery and network structures; (ii) Analog optical technologies for delivery of both the information and RF carriers to and from multiple-input multiple-output (MIMO) antenna sites so as to control the beam steering of MIMO antenna in the mmW at either 28.6 GHz and 56.8 GHz RF carrier and delivery of channels of aggregate capacity reaching several Tbps; (ii) Transceiver employing advanced digital modulation formats and digital signal processing (DSP) so as to provide 100G and beyond transmission rate to meet the ultra-high capacity demands with flexible spectral grids, hence pay-on-demand services. The interplay between DSP-based and analog transport techniques is examined; (iii) Transport technologies for 5G cloud access networks and associate modulation and digital processing techniques for capacity efficiency; and (iv) Finally the integrated optic technologies with novel lasers, comb generators and simultaneous dual function photonic devices for both demultiplexing/multiplexing and modulation are proposed, hence a system on chip structure can be structured. Quantum dot lasers and matrixes of micro ring resonators are integrated on the same Si-on-Silica substrate are proposed and described.
Simonis, Ingo
2015-04-01
Transport infrastructure monitoring and analysis is one of the focus areas in the context of smart cities. With the growing number of people moving into densely populated urban metro areas, precise tracking of moving people and goods is the basis for profound decision-making and future planning. With the goal of defining optimal extensions and modifications to existing transport infrastructures, multi-modal transport has to be monitored and analysed. This process is performed on the basis of sensor networks that combine a variety of sensor models, types, and deployments within the area of interest. Multi-generation networks, consisting of a number of sensor types and versions, are causing further challenges for the integration and processing of sensor observations. These challenges are not getting any smaller with the development of the Internet of Things, which brings promising opportunities, but is currently stuck in a type of protocol war between big industry players from both the hardware and network infrastructure domain. In this paper, we will highlight how the OGC suite of standards, with the Sensor Web standards developed by the Sensor Web Enablement Initiative together with the latest developments by the Sensor Web for Internet of Things community can be applied to the monitoring and improvement of transport infrastructures. Sensor Web standards have been applied in the past to pure technical domains, but need to be broadened now in order to meet new challenges. Only cross domain approaches will allow to develop satisfying transport infrastructure approaches that take into account requirements coming form a variety of sectors such as tourism, administration, transport industry, emergency services, or private people. The goal is the development of interoperable components that can be easily integrated within data infrastructures and follow well defined information models to allow robust processing.
Optimizing the ASC WAN: evaluating network performance tools for comparing transport protocols.
Lydick, Christopher L.
2007-07-01
The Advanced Simulation & Computing Wide Area Network (ASC WAN), which is a high delay-bandwidth network connection between US Department of Energy National Laboratories, is constantly being examined and evaluated for efficiency. One of the current transport-layer protocols which is used, TCP, was developed for traffic demands which are different from that on the ASC WAN. The Stream Control Transport Protocol (SCTP), on the other hand, has shown characteristics which make it more appealing to networks such as these. Most important, before considering a replacement for TCP on any network, a testing tool that performs well against certain criteria needs to be found. In order to try to find such a tool, two popular networking tools (Netperf v.2.4.3 & v.2.4.6 (OpenSS7 STREAMS), and Iperf v.2.0.6) were tested. These tools implement both TCP and SCTP and were evaluated using four metrics: (1) How effectively can the tool reach a throughput near the bandwidth? (2) How much of the CPU does the tool utilize during operation? (3) Is the tool freely and widely available? And, (4) Is the tool actively developed? Following the analysis of those tools, this paper goes further into explaining some recommendations and ideas for future work.
Adapting Memory Hierarchies for Emerging Datacenter Interconnects
江涛; 董建波; 侯锐; 柴琳; 张立新; 孙凝晖; 田斌
2015-01-01
Eﬃcient resource utilization requires that emerging datacenter interconnects support both high performance communication and eﬃcient remote resource sharing. These goals require that the network be more tightly coupled with the CPU chips. Designing a new interconnection technology thus requires considering not only the interconnection itself, but also the design of the processors that will rely on it. In this paper, we study memory hierarchy implications for the design of high-speed datacenter interconnects—particularly as they affect remote memory access—and we use PCIe as the vehicle for our investigations. To that end, we build three complementary platforms: a PCIe-interconnected prototype server with which we measure and analyze current bottlenecks; a software simulator that lets us model microarchitectural and cache hierarchy changes;and an FPGA prototype system with a streamlined switchless customized protocol Thunder with which we study hardware optimizations outside the processor. We highlight several architectural modifications to better support remote memory access and communication, and quantify their impact and limitations.
Application of transport demand modeling in pollution estimation of a street network
Jović Jadranka J.
2009-01-01
Full Text Available The importance of transportation modeling, especially personal car flow modeling, is well recognized in transportation planning. Modern software tools give the possibility of generating many development scenarios of transport system, which can be tested quickly. Transportation models represent a good (and necessary basis in the procedure of environmental traffic impacts and energy emission estimation. Research in this paper deals with the possibility of using transportation modeling as a tool for estimation of some air pollution and global warming indicators on street network, produced by personal cars with internal combustion engines. These indicators could be the basis for defining planning and management solutions for transport system with respect to their environmental impacts. All the analyses are based on several years of research experience in Belgrade. According to the emissions of gases from the model, the values of other green house gases can be estimated using the known relations between the pollutants. There is a possibility that all these data can be used to calculate the transportation systems impact on temperature increase in urban areas.
Assessment of Personal Goal Hierarchies.
Wadsworth, Marlene; Ford, Donald H.
1983-01-01
Developed a new method for measuring goal hierarchies, called the Adult Intentional and Motivational Systems Chart, by interviewing 53 men and constructing a system summarizing their goals. Results suggested the continued use of the chart for research on self-direction and adult development as well as intervention. (LLL)
Maslow's Hierarchy and Student Retention.
Brookman, David M.
1989-01-01
Abraham Maslow's hierarchy of needs offers perspective on student motivation and a rationale for college retention programing. Student affairs and faculty interventions addressing student safety needs and engaging students' sense of purpose reinforce persistence. A mentor program is a possible cooperative effort between student personnel and…
Combinatorial solutions to integrable hierarchies
Kazarian, M.; Lando, S.
2015-01-01
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and combinatorics of symmetric groups and their representations is explained. Applications of the results to constructing efficient computations in problems related to models of quantum field theories are given.
Dressing Technique for Intermediate Hierarchies
Holod, P.; Pakuliak, S.
1994-01-01
A generalized AKNS systems introduced and discussed recently in \\cite{dGHM} are considered. It was shown that the dressing technique both in matrix pseudo-differential operators and formal series with respect to the spectral parameter can be developed for these hierarchies.
Maslow's Hierarchy and Student Retention.
Brookman, David M.
1989-01-01
Abraham Maslow's hierarchy of needs offers perspective on student motivation and a rationale for college retention programing. Student affairs and faculty interventions addressing student safety needs and engaging students' sense of purpose reinforce persistence. A mentor program is a possible cooperative effort between student personnel and…
Quark masses without Yukawa hierarchies
Fanchiotti, H.; Garcia-Canal, C. [Plata Univ. Nacional, Laboratorio de Fisica Teorica, Dept. de Fisica, Facultad de Ciencias Exactas, La Plata (Argentina); Ponce, W.A. [Antioquia Univ., Instituto de Fisica, Colombia La (Argentina)
2005-12-15
A model based on the local gauge group SU(3){sub c}*SU(3){sub L}*U(1){sub X} without particles with exotic electric charges is shown to be able to provide the quark mass spectrum and their mixing, by means of universal see-saw mechanisms, avoiding a hierarchy in the Yukawa coupling constants. (authors)
Characteristics of the oil transport network in the South of Mexico
Juárez, R.; Fernández, I. Y.; Guzmán, L.
2017-01-01
We present a study of some organizational properties of the oil transport network of the Mexican oil company (PEMEX) in a region of the State of Tabasco. Particularly, the generalized centrality and the distribution of connectivities are calculated in order to evaluate some aspects of the structure of the network. We find that the connectivities (k) are characterized by a degree distribution which follows a power-law function of the form, P(k)~k -λ, with λ = 2.6. Moreover, our procedure permits to evalute the importance of lines (ducts) and nodes, which can be wells, production headers, separation batteries and petrochemical complexes.
Resistor-network anomalies in the heat transport of random harmonic chains.
Weinberg, Isaac; de Leeuw, Yaron; Kottos, Tsampikos; Cohen, Doron
2016-06-01
We consider thermal transport in low-dimensional disordered harmonic networks of coupled masses. Utilizing known results regarding Anderson localization, we derive the actual dependence of the thermal conductance G on the length L of the sample. This is required by nanotechnology implementations because for such networks Fourier's law G∝1/L^{α} with α=1 is violated. In particular we consider "glassy" disorder in the coupling constants and find an anomaly which is related by duality to the Lifshitz-tail regime in the standard Anderson model.
Impact of Transport Control Protocol on Full Duplex Performance in 5G Networks
Gatnau, Marta; Berardinelli, Gilberto; Mahmood, Nurul Huda
2016-01-01
Full duplex (FD) communication has attracted the attention of the industry and the academia as an important feature in the design of the future 5th generation (5G) wireless communication system. Such technology allows a device to simultaneously transmit and receive in the same frequency band......, with the potential of providing higher throughput and lower latency compared to traditional half duplex (HD) systems. In this paper, the interaction between Transport Control Protocol (TCP) and FD in 5G ultra-dense small cell networks is studied. TCP is a well-known transport layer protocol for providing reliability...
Zhang, G.M. [China Center of Advanced Science and Technology (CCAST), Beijing, BJ (China)]|[Suzhou Univ. (China). Dept. of Physics
1996-04-01
In this note we consider the geometrical effects of a percolating system on the nonlinear transport properties in a superconductor-normal conductor nonlinear resistor network. For realistic composites, the nonlinearity may play an important role in the electrical transport phenomena. A typical example consists of studying a nonlinear composite medium in which an inclusion with nonlinear current-field (J-E) characteristics is randomly embedded in a host with either linear or nonlinear J-E response. For such a system, substantial progress in studies of the effective nonlinear response has been made in the past few years. 24 refs.
Sørensen, Claus Hedegaard; Gudmundsson, Henrik
2010-01-01
'Sustainable transport' has become a priority for transport planning and policy making around the world. Sustainable transport plans often promote efforts to shift passengers from private cars to other modes such as public transport. However, the actual success of such efforts is likely to depend...... contributions. Second, we apply theoretical notions of 'governance modes', to examine whether the strengths and failures of 'market', 'hierarchy' and 'network' governance respectively can help to explain the results we observe. We find that these concepts are particularly useful to clarify the conditions under...
Modeling Leadership Hierarchy in Multilevel Animal Societies
Ozogány, Katalin
2014-01-01
A typical feature of many natural and social networks is the presence of communities giving rise to multiple levels of organization. We investigate the decision-making process of a group combining self organization and social dynamics, and reproduce the simultaneous emergence of a hierarchical and modular leadership network. All individuals in the model try, with varying degrees of ability, to find a direction of movement, with the result that leader-follower relationships evolve between them, since they tend to follow the more successful ones. The harem-forming ambitions of male individuals inspired by an observed Przewalski horse herd (Hortob\\'agy, Hungary) leads to modular structure. In this approach we find that the harem-leader to harem-member ratio observed in horses corresponds to an optimal network regarding common success, and that modularly structured hierarchy is more benefical than a non-modular one, in the sense that common success is higher, and the underlying network is more hierarchical. We al...
R. Shad
2013-10-01
Full Text Available Time management is a major subject which, in order to optimize trip conditions, emphasizes on interpreting processes and classifying individual's information. In this paper, with the aim of providing an optimal system for urban commuting in proper time in Mashhad, each user using SMS and introducing some of his/her mental priorities to the system, will be able to select the best option depending on the timing of movement of the available public transport system. The present study adopts a newly developed method of time management which is evaluated for urban transportation considering dynamic conditions of a spatial database. For this purpose, regarding time management, processed data such as bus lines, taxi networks, and the subway system are combined in a spatial framework of a designed Mobile GIS based on a wireless network. So, multiple potential paths which end to a desirable destination.
Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network.
Yang, Bin; Zhang, Jianfeng
2017-06-28
Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme.
Ajoy, Ashok; Cappellaro, Paola
2013-05-31
We propose a method for Hamiltonian engineering that requires no local control but only relies on collective qubit rotations and field gradients. The technique achieves a spatial modulation of the coupling strengths via a dynamical construction of a weighting function combined with a Bragg grating. As an example, we demonstrate how to generate the ideal Hamiltonian for perfect quantum information transport between two separated nodes of a large spin network. We engineer a spin chain with optimal couplings starting from a large spin network, such as one naturally occurring in crystals, while decoupling all unwanted interactions. For realistic experimental parameters, our method can be used to drive almost perfect quantum information transport at room temperature. The Hamiltonian engineering method can be made more robust under decoherence and coupling disorder by a novel apodization scheme. Thus, the method is quite general and can be used to engineer the Hamiltonian of many complex spin lattices with different topologies and interactions.
Preferred hierarchy scales from the product landscape
Songlin Lv; Zheng Sun; Lina Wu
2014-01-01
The product landscape method has been recently proposed to solve hierarchy problems such as the cosmological constant problem. We suggest that the parameter distribution on logarithmic scales should be used as a benchmark for hierarchy, and the preferred hierarchy scales can be obtained from the distribution peak. It is shown that generating hierarchy from purely product distribution is very inefficient. To achieve a reasonably acceptable efficiency, other effects such as accumulation of weak...
Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?
Czégel, Dániel
2015-01-01
Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications...
Makedonska, Nataliia; Hyman, Jeffrey D.; Karra, Satish; Painter, Scott L.; Gable, Carl W.; Viswanathan, Hari S.
2016-08-01
The apertures of natural fractures in fractured rock are highly heterogeneous. However, in-fracture aperture variability is often neglected in flow and transport modeling and individual fractures are assumed to have uniform aperture distribution. The relative importance of in-fracture variability in flow and transport modeling within kilometer-scale field-scale fracture networks has been under a matter of debate for a long time because the flow in each single fracture is controlled not only by in-fracture variability but also by boundary conditions. Computational limitations have previously prohibited researchers from investigating the relative importance of in-fracture variability in flow and transport modeling within large-scale fracture networks. We address this question by incorporating internal heterogeneity of individual fractures into flow simulations within kilometer scale three-dimensional fracture networks, where fracture intensity, P32 (ratio between total fracture area and domain volume) is between 0.027 and 0.031 [1/m]. A recently developed discrete fracture network (DFN) simulation capability, dfnWorks, is used to generate DFNs that include in-fracture aperture variability represented by a stationary log-normal stochastic field with various correlation lengths and variances. The Lagrangian transport parameters, non-reacting travel time and cumulative retention, are calculated along particles streamlines. It is observed that due to local flow channeling early particle travel times are more sensitive to in-fracture variability than the tails of travel time distributions, where no significant effect of the in-fracture transmissivity variations and spatial correlation length is observed.
IMPROVING INITIAL GENERATIONS IN PSO ALGORITHM FOR TRANSPORTATION NETWORK DESIGN PROBLEM
2015-01-01
Transportation Network Design Problem (TNDP) aims to select the best project sets among a number of new projects. Recently, metaheuristic methods are applied to solve TNDP in the sense of finding better solutions sooner. PSO as a metaheuristic method is based on stochastic optimization and is a parallel revolutionary computation technique. The PSO system initializes with a number of random solutions and seeks for optimal solution by improving generations. This paper studies the be...
Generalized W-algebras and integrable hierarchies
Burroughs, N J; Hollowood, Timothy J; Miramontes, J L
1992-01-01
We report on generalizations of the KdV-type integrable hierarchies of Drinfel'd and Sokolov. These hierarchies lead to the existence of new classical $W$-algebras, which arise as the second Hamiltonian structure of the hierarchies. In particular, we present a construction of the $W_n^{(l)}$ algebras.
Reductions of Lower Triangular Toda Hierarchies
Helminck, G.F.; Mishina, Marina G.; Polenkova, Svetlana V.
2007-01-01
Deforming commutative algebras in the lower triangular (ℤ×ℤ)-matrices yields lower triangular Toda hierarchies and their associated nonlinear equations. Like for their counterpart in the ring of pseudodifferential operators, the KP-hierarchy, one also has for these hierarchies a geometric picture:
Postance, Benjamin; Hillier, John; Dijkstra, Tom; Dixon, Neil
2016-04-01
The failure of engineered or natural slopes which support or are adjacent to transportation systems often inflicts costly direct physical damage and indirect system disruption. The consequences and severity of indirect impacts vary according to which links, nodes or network facilities are physically disrupted. Moreover, it is often the case that multiple slope failure disruptions are triggered simultaneously following prolonged or intense precipitation events due to a degree of local homogeneity of slope characteristics and materials. This study investigates the application of national commuter statistics and network agent simulation to evaluate indirect impacts of landslide events disrupting the Scottish trunk road transportation network (UK). Previous studies often employ shortest pathway analysis whereas agent simulation has received relatively little attention. British Geological Survey GeoSure landslide susceptibility data is used to select 35 susceptible trunk road segments by means of neighbouring total area at risk. For each of the candidate 35 segments the network and zonal variation in travel time is calculated for a single day of disruption, economic impact is approximated using established governmental and industry transport planning and appraisal values. The results highlight that a number of trunk road segments incur indirect economic losses in the order of tens of thousands of pounds for each day of closure. Calculated losses at the A83 Rest and Be Thankful are 50% greater than previous estimates at £75 thousand per day of closure. Also highlighted are events in which economic impact is relatively minor, yet concentrating on particular communities that can become substantially isolated as a consequence of a single event. The findings of this study are of interest and support wider investigations exploring cost considerations for decision makers and mitigation strategies, in addition to identifying network topological and demand indicators conducive
A Robust and Energy-Efficient Transport Protocol for Cognitive Radio Sensor Networks
Shelly Salim
2014-10-01
Full Text Available A cognitive radio sensor network (CRSN is a wireless sensor network in which sensor nodes are equipped with cognitive radio. CRSNs benefit from cognitive radio capabilities such as dynamic spectrum access and transmission parameters reconfigurability; but cognitive radio also brings additional challenges and leads to higher energy consumption. Motivated to improve the energy efficiency in CRSNs, we propose a robust and energy-efficient transport protocol (RETP. The novelties of RETP are two-fold: (I it combines distributed channel sensing and channel decision with centralized schedule-based data transmission; and (II it differentiates the types of data transmission on the basis of data content and adopts different acknowledgment methods for different transmission types. To the best of our knowledge, no transport layer protocols have yet been designed for CRSNs. Simulation results show that the proposed protocol achieves remarkably longer network lifetime and shorter event-detection delay compared to those achieved with a conventional transport protocol, while simultaneously preserving event-detection reliability.
Estimating the Capacity of Urban Transportation Networks with an Improved Sensitivity Based Method
Muqing Du
2015-01-01
Full Text Available The throughput of a given transportation network is always of interest to the traffic administrative department, so as to evaluate the benefit of the transportation construction or expansion project before its implementation. The model of the transportation network capacity formulated as a mathematic programming with equilibrium constraint (MPEC well defines this problem. For practical applications, a modified sensitivity analysis based (SAB method is developed to estimate the solution of this bilevel model. The high-efficient origin-based (OB algorithm is extended for the precise solution of the combined model which is integrated in the network capacity model. The sensitivity analysis approach is also modified to simplify the inversion of the Jacobian matrix in large-scale problems. The solution produced in every iteration of SAB is restrained to be feasible to guarantee the success of the heuristic search. From the numerical experiments, the accuracy of the derivatives for the linear approximation could significantly affect the converging of the SAB method. The results also show that the proposed method could obtain good suboptimal solutions from different starting points in the test examples.
A robust and energy-efficient transport protocol for cognitive radio sensor networks.
Salim, Shelly; Moh, Sangman
2014-10-20
A cognitive radio sensor network (CRSN) is a wireless sensor network in which sensor nodes are equipped with cognitive radio. CRSNs benefit from cognitive radio capabilities such as dynamic spectrum access and transmission parameters reconfigurability; but cognitive radio also brings additional challenges and leads to higher energy consumption. Motivated to improve the energy efficiency in CRSNs, we propose a robust and energy-efficient transport protocol (RETP). The novelties of RETP are two-fold: (I) it combines distributed channel sensing and channel decision with centralized schedule-based data transmission; and (II) it differentiates the types of data transmission on the basis of data content and adopts different acknowledgment methods for different transmission types. To the best of our knowledge, no transport layer protocols have yet been designed for CRSNs. Simulation results show that the proposed protocol achieves remarkably longer network lifetime and shorter event-detection delay compared to those achieved with a conventional transport protocol, while simultaneously preserving event-detection reliability.
Characterization and Evaluation of TCP and UDP-based Transport on Real Networks
Cottrell, L.
2005-01-25
Standard TCP (Reno TCP) does not perform well on fast long distance networks, due to its AIMD congestion control algorithm. In this paper we consider the effectiveness of various alternatives, in particular with respect to their applicability to a production environment. We then characterize and evaluate the achievable throughput, stability and intra-protocol fairness of different TCP stacks (Scalable, HSTCP, HTCP, Fast TCP, Reno, BICTCP, HSTCP-LP and LTCP) and a UDP based application level transport protocol (UDTv2) on both production and testbed networks. The characterization is made with respect to both the transient traffic (entry and exit of different streams) and the steady state traffic on production Academic and Research networks, using paths with RTTs differing by a factor of 10. We also report on measurements made with 10Gbits/sec NICs with and without TCP Offload Engines, on 10Gbits/s dedicated paths set up for SC2004.
Quantitative Characterization of the Microstructure and Transport Properties of Biopolymer Networks
Jiao, Yang
2012-01-01
Biopolymer networks are of fundamental importance to many biological processes in normal and tumorous tissues. In this paper, we employ the panoply of theoretical and simulation techniques developed for characterizing heterogeneous materials to quantify the microstructure and effective diffusive transport properties (diffusion coefficient $D_e$ and mean survival time $\\tau$) of collagen type I networks at various collagen concentrations. In particular, we compute the pore-size probability density function $P(\\delta)$ for the networks and present a variety of analytical estimates of the effective diffusion coefficient $D_e$ for finite-sized diffusing particles. The Hashin-Strikman upper bound on the effective diffusion coefficient $D_e$ and the pore-size lower bound on the mean survival time $\\tau$ are used as benchmarks to test our analytical approximations and numerical results. Moreover, we generalize the efficient first-passage-time techniques for Brownian-motion simulations in suspensions of spheres to th...
Rossi, Vincent; Ser-Giacomi, Enrico; López, Cristóbal; Hernández-García, Emilio
2014-04-01
Oceanic dispersal and connectivity have been identified as crucial factors for structuring marine populations and designing marine protected areas (MPAs). Focusing on larval dispersal by ocean currents, we propose an approach coupling Lagrangian transport and new tools from Network Theory to characterize marine connectivity in the Mediterranean basin. Larvae of different pelagic durations and seasons are modeled as passive tracers advected in a simulated oceanic surface flow from which a network of connected areas is constructed. Hydrodynamical provinces extracted from this network are delimited by frontiers which match multiscale oceanographic features. By examining the repeated occurrence of such boundaries, we identify the spatial scales and geographic structures that would control larval dispersal across the entire seascape. Based on these hydrodynamical units, we study novel connectivity metrics for existing reserves. Our results are discussed in the context of ocean biogeography and MPAs design, having ecological and managerial implications.
Chen, Yong-Zhou; Fu, Chun-Hua; Chang, Hui; Li, Nan; He, Da-Ren
2008-10-01
In this paper, an empirical investigation is presented, which focuses on unveiling the universality of connectivity correlations in three spaces (the route space, the stop geographical space and bus-transferring space) of urban bus-transport networks (BTNs) in four major cities of China. The underlying features of the connectivity correlations are shown in two statistical ways. One is the correlation between the (weighted) average degree of all the nearest neighbouring vertices with degree k, (Knnw (k)) Knn(k), and k, and the other is the correlations between the assortativity coefficient r and, respectively, the network size N, the network diameter D, the averaged clustering coefficient C, and the averaged distance . The obtained results show qualitatively the same connectivity correlations of all the considered cities under all the three spaces.
Self-organized Balanced Resources in Random Networks with Transportation Bandwidths
Yeung, Chi Ho; Wong, K. Y. Michael
We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths for the transportation of resources along the links. We derive algorithms which searches the optimal solution without the need of a global optimizer. For networks with uniformly high connectivity, the resource shortage of a node becomes a well-defined function of its capacity. An efficient profile of the allocated resources is found, with clusters of node interconnected by an extensive fraction of unsaturated links, enabling the resource shortages among the nodes to remain balanced. The capacity-shortage relation exhibits features similar to the Maxwell’s construction. For scale-free networks, such an efficient profile is observed even for nodes of low connectivity.
Internode Distance-Based Redundancy Reliable Transport in Underwater Sensor Networks
Kaoru Sezaki
2010-01-01
Full Text Available Underwater communication is a very challenging topic. Protocols used in terrestrial sensor networks cannot be directly applied in the underwater world. High-bit error rate and large propagation delay make the design of transport protocols especially awkward. ARQ-based reliable transport schemes are not appropriate in underwater environments due to large propagation delay, low communication bandwidth, and high error probability. Thus, we focus on redundancy-based transport schemes in this paper. We first investigate three schemes that employ redundancy mechanisms at the bit and/or packet level to increase the reliability in a direct link scenario. Then, we show that the broadcast property of the underwater channel allows us to extend those schemes to a case with node cooperative communication. Based on our analysis, an adaptive redundancy transport protocol (ARRTP for underwater sensor networks is proposed. We suggest an architecture for implementation. For two kinds of topologies, namely, regular and random, we show that ARRTP presents a better transmission success probability and energy efficiency tradeoff for single- and multihop transmissions. We also offer an integrated case study to show that ARRTP is not only supplying reliability but also has some positive effect in guiding the deployment of underwater sensor nodes.
The related congestion failure estimating methodology and model in transportation networks
Yuan, PengCheng; Juan, ZhiCai
2013-10-01
Previous works about the probability-based transportation networks evaluation method mainly focus on the static reliability evaluation, they ascribe the stochastic of the travel time to the external long time factors (the traffic supply or the traffic demand). Under this situation, the link’s travel time related relationship can be inferred, and it is efficacious for planners or engineers to make a decision for a long time. Even though some evaluation methodologies about transportation networks’ real-time travel time reliability has been presented, these works assume that the link’s travel time is independent. In this paper we relax this assumption. Using the Gauss copula theory, we present a new method to evaluate the transportation networks’ real-time travel time reliability. The results show that it will overestimate the route or the networks’ travel time reliability when not considering the links’ travel time are related. Not only that, we deep the static reliability evaluation model to the dynamic, we also present the link and transportation network congestion failure evaluation model. Estimations from the model are compared to field-measured data. It shows that, under the error interval ±2 times, the link congestion failure model accuracy rate is above 90.3%, under the error interval ±0.05; the net congestion failure model accuracy rate is above 95%.
Kang, Peter K.; Dentz, Marco; Le Borgne, Tanguy; Lee, Seunghak; Juanes, Ruben
2017-08-01
We investigate tracer transport on random discrete fracture networks that are characterized by the statistics of the fracture geometry and hydraulic conductivity. While it is well known that tracer transport through fractured media can be anomalous and particle injection modes can have major impact on dispersion, the incorporation of injection modes into effective transport modeling has remained an open issue. The fundamental reason behind this challenge is that-even if the Eulerian fluid velocity is steady-the Lagrangian velocity distribution experienced by tracer particles evolves with time from its initial distribution, which is dictated by the injection mode, to a stationary velocity distribution. We quantify this evolution by a Markov model for particle velocities that are equidistantly sampled along trajectories. This stochastic approach allows for the systematic incorporation of the initial velocity distribution and quantifies the interplay between velocity distribution and spatial and temporal correlation. The proposed spatial Markov model is characterized by the initial velocity distribution, which is determined by the particle injection mode, the stationary Lagrangian velocity distribution, which is derived from the Eulerian velocity distribution, and the spatial velocity correlation length, which is related to the characteristic fracture length. This effective model leads to a time-domain random walk for the evolution of particle positions and velocities, whose joint distribution follows a Boltzmann equation. Finally, we demonstrate that the proposed model can successfully predict anomalous transport through discrete fracture networks with different levels of heterogeneity and arbitrary tracer injection modes.
Optimization and Simulation of Collaborative Networks for Sustainable Production and Transportation
Liotta, Giacomo; Kaihara, Toshiya; Stecca, Giuseppe
2016-01-01
Complex and delocalized manufacturing industries require high levels of integration between production and transportation in order to effectively implement lean and agile operations. There are, however, limitations in research and applications simultaneously embodying further sustainability...... dimensions. This paper presents a methodological framework based on optimization and simulation to integrate aggregate optimized plans for production and multimodal transportation with detailed dynamic distribution plans affected by demand uncertainty. The objective function of the optimization model...... considers supply, production, transportation, and CO2 emission costs, as well as collaboration over the multimodal network. Bill-of-materials and capacity constraints are included. A feedback between simulation and optimization is used to plan requirements for materials and components. Computational...
Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
Muelken, Oliver
2011-01-01
This paper reviews recent advances in continuous-time quantum walks (CTQW) and their application to transport in various systems. The introduction gives a brief survey of the historical background of CTQW. After a short outline of the theoretical ideas behind CTQW and of its relation to classical continuous-time random walks (CTRW) in Sec.~2, implications for the efficiency of the transport are presented in Sec.~3. The fourth section gives an overview of different types of networks on which CTQW have been studied so far. Extensions of CTQW to systems with long-range interactions and with static disorder are discussed in section V. Systems with traps, i.e., systems in which the walker's probability to remain inside the system is not conserved, are presented in section IV. Relations to similar approaches to the transport are studied in section VII. The paper closes with an outlook on possible future directions.
Quantum transport in networks and photosynthetic complexes at the steady state.
Daniel Manzano
Full Text Available Recently, several works have analysed the efficiency of photosynthetic complexes in a transient scenario and how that efficiency is affected by environmental noise. Here, following a quantum master equation approach, we study the energy and excitation transport in fully connected networks both in general and in the particular case of the Fenna-Matthew-Olson complex. The analysis is carried out for the steady state of the system where the excitation energy is constantly "flowing" through the system. Steady state transport scenarios are particularly relevant if the evolution of the quantum system is not conditioned on the arrival of individual excitations. By adding dephasing to the system, we analyse the possibility of noise-enhancement of the quantum transport.
Quantum transport in networks and photosynthetic complexes at the steady state.
Manzano, Daniel
2013-01-01
Recently, several works have analysed the efficiency of photosynthetic complexes in a transient scenario and how that efficiency is affected by environmental noise. Here, following a quantum master equation approach, we study the energy and excitation transport in fully connected networks both in general and in the particular case of the Fenna-Matthew-Olson complex. The analysis is carried out for the steady state of the system where the excitation energy is constantly "flowing" through the system. Steady state transport scenarios are particularly relevant if the evolution of the quantum system is not conditioned on the arrival of individual excitations. By adding dephasing to the system, we analyse the possibility of noise-enhancement of the quantum transport.
Comparing the hierarchy of author given tags and repository given tags in a large document archive
Tibély, Gergely; Palla, Gergely
2015-01-01
Folksonomies - large databases arising from collaborative tagging of items by independent users - are becoming an increasingly important way of categorizing information. In these systems users can tag items with free words, resulting in a tripartite item-tag-user network. Although there are no prescribed relations between tags, the way users think about the different categories presumably has some built in hierarchy, in which more special concepts are descendants of some more general categories. Several applications would benefit from the knowledge of this hierarchy. Here we apply a recent method to check the differences and similarities of hierarchies resulting from tags given by independent individuals and from tags given by a centrally managed repository system. The results from out method showed substantial differences between the lower part of the hierarchies, and in contrast, a relatively high similarity at the top of the hierarchies.
Active transport on disordered microtubule networks: The generalized random velocity model
Kahana, Aviv; Kenan, Gilad; Feingold, Mario; Elbaum, Michael; Granek, Rony
2008-11-01
The motion of small cargo particles on microtubules by means of motor proteins in disordered microtubule networks is investigated theoretically using both analytical tools and computer simulations. Different network topologies in two and three dimensions are considered, one of which has been recently studied experimentally by Salman [Biophys. J. 89, 2134 (2005)]. A generalization of the random velocity model is used to derive the mean-square displacement of the cargo particle. We find that all cases belong to the class of anomalous superdiffusion, which is sensitive mainly to the dimensionality of the network and only marginally to its topology. Yet in three dimensions the motion is very close to simple diffusion, with sublogarithmic corrections that depend on the network topology. When details of the thermal diffusion in the bulk solution are included, no significant change to the asymptotic time behavior is found. However, a small asymmetry in the mean microtubule polarity affects the corresponding long-time behavior. We also study a three-dimensional model of the microtubule network in living animal cells. Three first-passage-time problems of intracellular transport are simulated and analyzed for different motor processivities: (i) cargo that originates near the nucleus and has to reach the membrane, (ii) cargo that originates from the membrane and has to reach the nucleus, and (iii) cargo that leaves the nucleus and has to reach a specific target in the cytoplasm. We conclude that while a higher motor processivity increases the transport efficiency in cases (i) and (ii), in case (iii) it has the opposite effect. We conjecture that the balance between the different network tasks, as manifested in cases (i) and (ii) versus case (iii), may be the reason for the evolutionary choice of a finite motor processivity.
A method of examining the structure and topological properties of public-transport networks
Dimitrov, Stavri Dimitri; Ceder, Avishai (Avi)
2016-06-01
This work presents a new method of examining the structure of public-transport networks (PTNs) and analyzes their topological properties through a combination of computer programming, statistical data and large-network analyses. In order to automate the extraction, processing and exporting of data, a software program was developed allowing to extract the needed data from General Transit Feed Specification, thus overcoming difficulties occurring in accessing and collecting data. The proposed method was applied to a real-life PTN in Auckland, New Zealand, with the purpose of examining whether it showed characteristics of scale-free networks and exhibited features of "small-world" networks. As a result, new regression equations were derived analytically describing observed, strong, non-linear relationships among the probabilities of randomly chosen stops in the PTN to be serviced by a given number of routes. The established dependence is best fitted by an exponential rather than a power-law function, showing that the PTN examined is neither random nor scale-free, but a mixture of the two. This finding explains the presence of hubs that are not typical of exponential networks and simultaneously not highly connected to the other nodes as is the case with scale-free networks. On the other hand, the observed values of the topological properties of the network show that although it is highly clustered, owing to its representation as a directed graph, it differs slightly from "small-world" networks, which are characterized by strong clustering and a short average path length.
Highly Scalable, UDP-Based Network Transport Protocols for Lambda Grids and 10 GE Routed Networks
PI: Robert Grossman Co-PI: Stephen Eick
2009-08-04
Summary of Report In work prior to this grant, NCDM developed a high performance data transport protocol called SABUL. During this grant, we refined SABUL’s functionality, and then extended both the capabilities and functionality and incorporated them into a new protocol called UDP-based Data transport Protocol, or UDT. We also began preliminary work on Composable UDT, a version of UDT that allows the user to choose among different congestion control algorithms and implement the algorithm of his choice at the time he compiles the code. Specifically, we: · Investigated the theoretical foundations of protocols similar to SABUL and UDT. · Performed design and development work of UDT, a protocol that uses UDP in both the data and control channels. · Began design and development work of Composable UDT, a protocol that supports the use of different congestion control algorithms by simply including the appropriate library when compiling the code. · Performed experimental studies using UDT and Composable UDT using real world applications such as the Sloan Digital Sky Survey (SDSS) astronomical data sets. · Released several versions of UDT and Composable, the most recent being v3.1.
Measuring Maslow's hierarchy of needs.
Lester, David
2013-08-01
Two scales have been proposed to measure Maslow's hierarchy of needs in college students, one by Lester (1990) and one by Strong and Fiebert (1987). In a sample of 51 college students, scores on the corresponding scales for the five needs did not correlate significantly and positively, except for the measures of physiological needs. Furthermore, there was limited support for Maslow's hypothesis that need deprivation would predict psychopathology (specifically, mania and depression).
The stochastic integrable AKNS hierarchy
Arnaudon, Alexis
2015-01-01
We derive a stochastic AKNS hierarchy using geometrical methods. The integrability is shown via a stochastic zero curvature relation associated with a stochastic isospectral problem. We expose some of the stochastic integrable partial differential equations which extend the stochastic KdV equation discovered by M. Wadati in 1983 for all the AKNS flows. We also show how to find stochastic solitons from the stochastic evolution of the scattering data of the stochastic IST. We finally expose som...
KP hierarchy for Hodge integrals
Kazarian, M.
2008-01-01
Starting from the ELSV formula, we derive a number of new equations on the generating functions for Hodge integrals over the moduli space of complex curves. This gives a new simple and uniform treatment of certain known results on Hodge integrals like Witten's conjecture, Virasoro constrains, Faber's lambda_g conjecture etc. Among other results we show that a properly arranged generating function for Hodge integrals satisfies the equations of the KP hierarchy.
Combinatorial solutions to integrable hierarchies
Kazarian, M. E.; Lando, S. K.
2015-06-01
This paper reviews modern approaches to the construction of formal solutions to integrable hierarchies of mathematical physics whose coefficients are answers to various enumerative problems. The relationship between these approaches and the combinatorics of symmetric groups and their representations is explained. Applications of the results to the construction of efficient computations in problems related to models of quantum field theories are described. Bibliography: 34 titles.
Memory Hierarchy Sensitive Graph Layout
Roy, Amitabha
2012-01-01
Mining large graphs for information is becoming an increasingly important workload due to the plethora of graph structured data becoming available. An aspect of graph algorithms that has hitherto not received much interest is the effect of memory hierarchy on accesses. A typical system today has multiple levels in the memory hierarchy with differing units of locality; ranging across cache lines, TLB entries and DRAM pages. We postulate that it is possible to allocate graph structured data in main memory in a way as to improve the spatial locality of the data. Previous approaches to improving cache locality have focused only on a single unit of locality, either the cache line or virtual memory page. On the other hand cache oblivious algorithms can optimise layout for all levels of the memory hierarchy but unfortunately need to be specially designed for individual data structures. In this paper we explore hierarchical blocking as a technique for closing this gap. We require as input a specification of the units...
2008-01-01
An intelligent geographic information system (GIS) has to handle various types and huge volumes of geoscience-related knowledge as well as enormous amounts of data and information. More recent attention concentrates on collection,represen-tation,management,and usage of knowledge. This article presents a three-tier hi-erarchy for geoscience knowledge in a GIS. The first tier is for knowledge of data. It includes knowledge of feature objects definition,data structure,data model,and relations among data as well as rules,restrictions,and regulations about data. The second tier is for knowledge of processing. It describes analysis models,data processing procedures,workflows,and conditions. The third tier contains knowl-edge of a GIS for the public sector. This tier provides knowledge to people on how to access this GIS and what the GIS can do. The three-tier hierarchy of knowledge in a GIS provides an understandable and practical category frame to handle geo-science knowledge. One of the advantages of this hierarchy is that it separates system resource consumption into different stages so it can avoid exhausting the system at peak times when the GIS handles a complex,large task.
Solving the Wrong Hierarchy Problem
Blinov, Nikita
2016-01-01
Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and $\\mathbb{Z}_2$-symmetric theories where the Standard Model Higgs potential has two vacua. The parity or $\\mathbb{Z}_2$ copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs mass by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop thi...
Solving the wrong hierarchy problem
Blinov, Nikita; Hook, Anson
2016-06-01
Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z_2 -symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z_2 copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs mass by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. We show this mechanism postdicts the top Yukawa to be within 1 σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.
A multi-scale model for electrokinetic transport in networks of micro-scale and nano-scale pores
Alizadeh, Shima
2016-01-01
We present an efficient and robust numerical model for simulation of electrokinetic phenomena in porous networks over a wide range of applications including energy conversion, desalination, and lab-on-a-chip systems. Coupling between fluid flow and ion transport in these networks is governed by the Poisson-Nernst-Planck-Stokes equations. These equations describe a wide range of transport phenomena that can interact in complex and highly nonlinear ways in networks involving multiple pores with variable properties. Capturing these phenomena by direct simulation of the governing equations in multiple dimensions is prohibitively expensive. We present here a reduced order computational model that treats a network of many pores via solutions to 1D equations. Assuming that each pore in the network is long and thin, we derive a 1D model describing the transport in pore's longitudinal direction. We take into account the non-uniformity of potential and ion concentration profiles across the pore cross-section in the for...
Antoniu Ovidiu Balint
2013-09-01
Full Text Available The use of intelligent solution represents the key factor for developing both the logistics sector and the economic environment. This paper analyses the Radio-Frequency Identification (RFID technology and its role in the Supply Chain Management (SCM especially in logistics and transport networks. The main objective is to demonstrate that RFID represents a solution for improving the transport networks and logistics sector by implementing various complex and intelligent solutions that can improve the actual economic environment
Hierarchy in industrial structure: The cases of China and the USA
Hu, Fei; Zhao, Shangmei; Bing, Tao; Chang, Yiming
2017-03-01
Although several studies have investigated the industrial structure from the perspective of network, the focus is mainly on the identification of key sectors, and little is known about the hierarchical structure, and its impact on economic performance. Using the World Input-Output Tables (WIOTs), this paper performs a comparative study of the hierarchy in industrial structures of China and the USA. Specifically, the hierarchy is generally confirmed in the networks of industrial structure, although in different levels for China and the USA: the level of hierarchy in industrial structure of the USA is much higher than that of China. To intuitively comprehend the evolution over time in a much visualized way, we also present the backbone network of industrial structure via minimum spanning tree (MST), leading to interesting insights about the origins of hierarchy. Further, the impact of the hierarchy in network on economic performance is also explored, and the result suggests that a hierarchy of a moderate range might be better for economic growth.
Pore network and pore scale modeling of reactive transport in porous media
Adler, P. M.; Vu, T. M.; Varloteaux, C.; Bekri, S.
2012-12-01
The study of the evolution of a porous medium where a reactive fluid flows is conditioned by the accurate determination of three macroscopic parameters governing the solute displacement, namely the solute velocity, dispersion and mean reaction rate. Of course, a possible application of such studies is CO2 sequestration. This presentation proposes to approach the determination of these parameters by two different ways and to compare them; both are on the pore scale. In the first one called PNM (for pore-network model), a pore-network is extracted from micro tomography images of a real porous medium. This network is composed of spherical pores joined by circular tubes; it is used to calculate transport macroscopic parameters and porosity-permeability evolution during the reactive transport flow as functions of dimensionless numbers representing the reaction and flow rate regimes. The flow is calculated by using Kirchhoff laws. Transport is determined in the asymptotic regime where the solute concentration undergoes an exponential evolution with time. In the second approach called PSM (for pore scale model), the pore-network model is used as a three dimensional medium which is discretized by the Level Set Method. The Stokes equations are solved in order to determine the local flow field and the corresponding permeability. The solute concentration is obtained by solving the local convection-diffusion equation in the 3D pore-network; numerical dispersion is reduced by a Flux Limiting Scheme. Two different geometries of porous media are addressed by both numerical codes. The first pore-network geometry is used to validate the PNM assumptions, whereas the second pore-network is defined for a better understanding of the dominant solute distribution. One of the main results obtained with the first pore-network is the dependence of the concentration profile on the Péclet number Pe in the pore-bodies. When this number increases, one has to switch from an assumption of
Computational modeling of electrokinetic transport in random networks of micro-pores and nano-pores
Alizadeh, Shima; Mani, Ali
2014-11-01
A reduced order model has been developed to study the nonlinear electrokinetic behaviors emerging in the transport of ionic species through micro-scale and nano-scale porous media. In this approach a porous structure is modeled as a network of long and thin pores. By assuming transport equilibrium in the thin dimensions for each pore, a 1D transport equation is developed in the longitudinal direction covering a wide range of conditions including extreme limits of thick and thin electric double layers. This 1D model includes transport via diffusion, electromigration and wide range of advection mechanisms including pressure driven flow, electroosmosis, and diffusion osmosis. The area-averaged equations governing the axial transport from different pores are coupled at the pore intersections using the proper conservation laws. Moreover, an asymptotic treatment has been included in order to remove singularities in the limit of small concentration. The proposed method provides an efficient framework for insightful simulations of porous electrokinetic systems with applications in water desalination and energy storage. PhD student in Mechanical Engineering, Stanford University. She received her Master's degree in Mechanical Engineering from Stanford at 2013. Her research interests include CFD, high performance computing, and optimization.
Tejas Rawal
2015-09-01
Full Text Available The transportation system in Kanyakumari District has met the grim situation over the years due to numerous parameters like increasing population, increasing economic activity, increasing vehicular population, negligence from the administrative officials, unethical practices of the locals, etc.; led it to a pathetic condition, especially on National Highway-47. However, to simplify the situation, the National Highway Authority of India (NHAI, Government of India is taking up the effort for developing the new bypass road to the existing NH-47 by diverting form selected few junctions. Unfortunately, this partial solution for the existing NH-47 will give birth to numerous other physical, socio-economic, and ecological problems. The objectives of this study is to identify the possible causes of the inadequacies in prevailing transportation network of Kanyakumari District and put forward logical, scientific and economical conceptual level solutions for the betterment of road users and people of the district. In order to revamp the present dreadful condition, the authors have worked out some simple remedial measures as a solution by conducting exhaustive observation survey, analytical work, discussions with experts and the locals, etc. It includes assessing the prevailing conditions of transportation system in the district, proposing planning design options for rectifying the short comings of the transportation network of the district, conceptualization of the standard flyover design for the NH-47 and ring roads for selected towns of high importance. Further, the paper concludes with plausible and executable recommendations. It is recommended that, in the light of these findings of opportunities and possibilities, the administrative authorities and officials of Kanyakumari district might look into rejuvenating the road transportation scenario of the district.
Weiya Chen
2014-01-01
Full Text Available This paper presents a mixed integer linear programming model (MILP for optimizing the hybrid hub-and-spoke network operation for a less-than-truckload transportation service. The model aims to minimize the total operation costs (transportation cost and transfer cost, given the determined demand matrix, truck load capacity, and uncapacitated road transportation. The model also incorporates an incremental quantity discount function to solve the reversal of the total cost and the total demand. The model is applied to a real case of a Chinese transportation company engaged in nationwide freight transportation. The numerical example shows that, with uncapacitated road transportation, the total costs and the total vehicle trips of the hybrid hub-and-spoke network operation are, respectively, 8.0% and 15.3% less than those of the pure hub-and-spoke network operation, and the assumed capacity constraints in an extension model result in more target costs on the hybrid hub-and-spoke network. The two models can be used to support the decision making in network operations by transportation and logistics companies.
2012-01-01
The Braess paradox, known for traffic and other classical networks, lies in the fact that adding a new route to a congested network in an attempt to relieve congestion can degrade counterintuitively the overall network performance. Recently, we have extended the concept of the Braess paradox to semiconductor mesoscopic networks, whose transport properties are governed by quantum physics. In this paper, we demonstrate theoretically that, alike in classical systems, congestion plays a key role in the occurrence of a Braess paradox in mesoscopic networks. PMID:22913510
Pala, Marco; Sellier, Hermann; Hackens, Benoit; Martins, Frederico; Bayot, Vincent; Huant, Serge
2012-08-01
The Braess paradox, known for traffic and other classical networks, lies in the fact that adding a new route to a congested network in an attempt to relieve congestion can degrade counterintuitively the overall network performance. Recently, we have extended the concept of the Braess paradox to semiconductor mesoscopic networks, whose transport properties are governed by quantum physics. In this paper, we demonstrate theoretically that, alike in classical systems, congestion plays a key role in the occurrence of a Braess paradox in mesoscopic networks.
Comparing the Hierarchy of Keywords in On-Line News Portals
Tibély, Gergely; Sousa-Rodrigues, David; Pollner, Péter; Palla, Gergely
2016-01-01
Hierarchical organization is prevalent in networks representing a wide range of systems in nature and society. An important example is given by the tag hierarchies extracted from large on-line data repositories such as scientific publication archives, file sharing portals, blogs, on-line news portals, etc. The tagging of the stored objects with informative keywords in such repositories has become very common, and in most cases the tags on a given item are free words chosen by the authors independently. Therefore, the relations among keywords appearing in an on-line data repository are unknown in general. However, in most cases the topics and concepts described by these keywords are forming a latent hierarchy, with the more general topics and categories at the top, and more specialized ones at the bottom. There are several algorithms available for deducing this hierarchy from the statistical features of the keywords. In the present work we apply a recent, co-occurrence-based tag hierarchy extraction method to sets of keywords obtained from four different on-line news portals. The resulting hierarchies show substantial differences not just in the topics rendered as important (being at the top of the hierarchy) or of less interest (categorized low in the hierarchy), but also in the underlying network structure. This reveals discrepancies between the plausible keyword association frameworks in the studied news portals. PMID:27802319
Comparing the Hierarchy of Keywords in On-Line News Portals.
Tibély, Gergely; Sousa-Rodrigues, David; Pollner, Péter; Palla, Gergely
2016-01-01
Hierarchical organization is prevalent in networks representing a wide range of systems in nature and society. An important example is given by the tag hierarchies extracted from large on-line data repositories such as scientific publication archives, file sharing portals, blogs, on-line news portals, etc. The tagging of the stored objects with informative keywords in such repositories has become very common, and in most cases the tags on a given item are free words chosen by the authors independently. Therefore, the relations among keywords appearing in an on-line data repository are unknown in general. However, in most cases the topics and concepts described by these keywords are forming a latent hierarchy, with the more general topics and categories at the top, and more specialized ones at the bottom. There are several algorithms available for deducing this hierarchy from the statistical features of the keywords. In the present work we apply a recent, co-occurrence-based tag hierarchy extraction method to sets of keywords obtained from four different on-line news portals. The resulting hierarchies show substantial differences not just in the topics rendered as important (being at the top of the hierarchy) or of less interest (categorized low in the hierarchy), but also in the underlying network structure. This reveals discrepancies between the plausible keyword association frameworks in the studied news portals.
BILEVEL PROGRAMMING MODEL AND SOLUTION METHOD FOR MIXED TRANSPORTATION NETWORK DESIGN PROBLEM
Haozhi ZHANG; Ziyou GAO
2009-01-01
By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower-level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an all-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.
Suk Ho Jin
2017-07-01
Full Text Available Korea’s national carbon capture and storage (CCS master plan aims to commercialize CCS projects by 2030. Furthermore, the Korean government is forced to reduce emissions from various sectors, including industries and power generation, by 219 million tons by 2030. This study analyzes a few scenarios of Korean CCS projects with a CO2 pipeline transportation network optimization model for minimizing the total facility cost and pipeline cost. Our scenarios are based on the “2030 asic roadmap for reducing greenhouse gases” established by the government. The results for each scenario demonstrate that the effective design and implementation of CO2 pipeline network enables the lowering of CO2 units cost. These suggest that CO2 transportation networks, which connect the capture and sequestration parts, will be more important in the future and can be used to substitute and supplement the emission reduction target in case the execution of other reduction options faces uncertainty. Our mathematical model and scenario designs will be helpful for various countries which plan to introduce CCS technology.
Chaotic Stream Cipher-Based Secure Data Communications over Intelligent Transportation Network
Wei Zhang
2015-01-01
Full Text Available Intelligent transportation systems (ITS are advanced applications in which the transportation industry is adapted to the information technology revolution. As an important development direction of ITS, the electronic toll collection (ETC subsystem, which enables an efficient and speedy toll collection, has gained widespread popularity in the world. In an ETC system, toll transaction data are transmitted over intelligent transportation networks, which is vulnerable to eavesdropping, interfering, and tampering attacks. To address the above security problems, we proposed a chaotic stream cipher-based cryptographic scheme to realise secure data communications over wireless sensor network (WSN, which is a part of ITS. The proposed cryptographic scheme allowed ITS to achieve key negotiation and data encryption between sensor nodes in the WSN, whileas reduced computational costs and power consumption. Security analysis and experimental results showed that the proposed scheme could protect data transmission between wireless sensor nodes from being attacked, and significantly reduced the communication overhead for the whole system compared to the existing ECC_AES scheme, thus satisfying the real-time data transmission requirement of ITS.
Thompson, Mary Kathryn; Brooks, Andrew G.
2010-01-01
to the consideration of specialized systems for realizing quantum leaps in efficiency. We therefore propose a novel variant of an automated transportation system: a dedicated network of transportation robots for delivering small-to-medium scale physical objects within the range of commuter automobiles for use...