329 resultados para large transportation network
Resumo:
As critical infrastructure such as transportation hubs continue to grow in complexity, greater importance is placed on monitoring these facilities to ensure their secure and efficient operation. In order to achieve these goals, technology continues to evolve in response to the needs of various infrastructure. To date, however, the focus of technology for surveillance has been primarily concerned with security, and little attention has been placed on assisting operations and monitoring performance in real-time. Consequently, solutions have emerged to provide real-time measurements of queues and crowding in spaces, but have been installed as system add-ons (rather than making better use of existing infrastructure), resulting in expensive infrastructure outlay for the owner/operator, and an overload of surveillance systems which in itself creates further complexity. Given many critical infrastructure already have camera networks installed, it is much more desirable to better utilise these networks to address operational monitoring as well as security needs. Recently, a growing number of approaches have been proposed to monitor operational aspects such as pedestrian throughput, crowd size and dwell times. In this paper, we explore how these techniques relate to and complement the more commonly seen security analytics, and demonstrate the value that can be added by operational analytics by demonstrating their performance on airport surveillance data. We explore how multiple analytics and systems can be combined to better leverage the large amount of data that is available, and we discuss the applicability and resulting benefits of the proposed framework for the ongoing operation of airports and airport networks.
Resumo:
In the mining optimisation literature, most researchers focused on two strategic-level and tactical-level open-pit mine optimisation problems, which are respectively termed ultimate pit limit (UPIT) or constrained pit limit (CPIT). However, many researchers indicate that the substantial numbers of variables and constraints in real-world instances (e.g., with 50-1000 thousand blocks) make the CPIT’s mixed integer programming (MIP) model intractable for use. Thus, it becomes a considerable challenge to solve the large scale CPIT instances without relying on exact MIP optimiser as well as the complicated MIP relaxation/decomposition methods. To take this challenge, two new graph-based algorithms based on network flow graph and conjunctive graph theory are developed by taking advantage of problem properties. The performance of our proposed algorithms is validated by testing recent large scale benchmark UPIT and CPIT instances’ datasets of MineLib in 2013. In comparison to best known results from MineLib, it is shown that the proposed algorithms outperform other CPIT solution approaches existing in the literature. The proposed graph-based algorithms leads to a more competent mine scheduling optimisation expert system because the third-party MIP optimiser is no longer indispensable and random neighbourhood search is not necessary.
Resumo:
Traffic congestion has been a growing issue in many metropolitan areas during recent years, which necessitates the identification of its key contributors and development of sustainable strategies to help decrease its adverse impacts on traffic networks. Road incidents generally and crashes specifically have been acknowledged as the cause of a large proportion of travel delays in urban areas and account for 25% to 60% of traffic congestion on motorways. Identifying the critical determinants of travel delays has been of significant importance to the incident management systems which constantly collect and store the incident duration data. This study investigates the individual and simultaneous differential effects of the relevant determinants on motorway crash duration probabilities. In particular, it applies parametric Accelerated Failure Time (AFT) hazard-based models to develop in-depth insights into how the crash-specific characteristic and the associated temporal and infrastructural determinants impact the duration. AFT models with both fixed and random parameters have been calibrated on one year of traffic crash records from two major Australian motorways in South East Queensland and the differential effects of determinants on crash survival functions have been studied on these two motorways individually. A comprehensive spectrum of commonly used parametric fixed parameter AFT models, including generalized gamma and generalized F families, have been compared to random parameter AFT structures in terms of goodness of fit to the duration data and as a result, the random parameter Weibull AFT model has been selected as the most appropriate model. Significant determinants of motorway crash duration included traffic diversion requirement, crash injury type, number and type of vehicles involved in a crash, day of week and time of day, towing support requirement and damage to the infrastructure. A major finding of this research is that the motorways under study are significantly different in terms of crash durations; such that motorway exhibits durations that are on average 19% shorter compared to the durations on motorway. The differential effects of explanatory variables on crash durations are also different on the two motorways. The detailed presented analysis confirms that, looking at the motorway network as a whole, neglecting the individual differences between roads, can lead to erroneous interpretations of duration and inefficient strategies for mitigating travel delays along a particular motorway.
Resumo:
The Distributed Network Protocol v3.0 (DNP3) is one of the most widely used protocols to control national infrastructure. The move from point-to-point serial connections to Ethernet-based network architectures, allowing for large and complex critical infrastructure networks. However, networks and con- figurations change, thus auditing tools are needed to aid in critical infrastructure network discovery. In this paper we present a series of intrusive techniques used for reconnaissance on DNP3 critical infrastructure. Our algorithms will discover DNP3 outstation slaves along with their DNP3 addresses, their corresponding master, and class object configurations. To validate our presented DNP3 reconnaissance algorithms and demonstrate it’s practicality, we present an implementation of a software tool using a DNP3 plug-in for Scapy. Our implementation validates the utility of our DNP3 reconnaissance technique. Our presented techniques will be useful for penetration testing, vulnerability assessments and DNP3 network discovery.
Resumo:
The brain's functional network exhibits many features facilitating functional specialization, integration, and robustness to attack. Using graph theory to characterize brain networks, studies demonstrate their small-world, modular, and "rich-club" properties, with deviations reported in many common neuropathological conditions. Here we estimate the heritability of five widely used graph theoretical metrics (mean clustering coefficient (γ), modularity (Q), rich-club coefficient (ϕnorm), global efficiency (λ), small-worldness (σ)) over a range of connection densities (k=5-25%) in a large cohort of twins (N=592, 84 MZ and 89 DZ twin pairs, 246 single twins, age 23±2.5). We also considered the effects of global signal regression (GSR). We found that the graph metrics were moderately influenced by genetic factors h2 (γ=47-59%, Q=38-59%, ϕnorm=0-29%, λ=52-64%, σ=51-59%) at lower connection densities (≤15%), and when global signal regression was implemented, heritability estimates decreased substantially h2 (γ=0-26%, Q=0-28%, ϕnorm=0%, λ=23-30%, σ=0-27%). Distinct network features were phenotypically correlated (|r|=0.15-0.81), and γ, Q, and λ were found to be influenced by overlapping genetic factors. Our findings suggest that these metrics may be potential endophenotypes for psychiatric disease and suitable for genetic association studies, but that genetic effects must be interpreted with respect to methodological choices.
Resumo:
This paper describes the types of support that teachers are accessing through the Social Network Site (SNS) 'Facebook'. It describes six ways in which teachers support one another within online groups. It presents evidence from a study of a large, open group of teachers online over a twelve week period, repeated with multiple groups a year later over a one week period. The findings suggest that large open groups in SNSs can be a useful source of pragmatic advice for teachers but that these groups are rarely a place for reflection on or feedback about teaching practice.