Assessment of commercial network RTK user positioning performance over long inter-station distances

The paper provides an assessment of the performance of commercial Real Time Kinematic (RTK) systems over longer than recommended inter-station distances. The experiments were set up to test and analyse solutions from the i-MAX, MAX and VRS systems being operated with three triangle shaped network cells, each having an average inter-station distance of 69km, 118km and 166km. The performance characteristics appraised included initialization success rate, initialization time, RTK position accuracy and availability, ambiguity resolution risk and RTK integrity risk in order to provide a wider perspective of the performance of the testing systems. ----- ----- The results showed that the performances of all network RTK solutions assessed were affected by the increase in the inter-station distances to similar degrees. The MAX solution achieved the highest initialization success rate of 96.6% on average, albeit with a longer initialisation time. Two VRS approaches achieved lower initialization success rate of 80% over the large triangle. In terms of RTK positioning accuracy after successful initialisation, the results indicated a good agreement between the actual error growth in both horizontal and vertical components and the accuracy specified in the RMS and part per million (ppm) values by the manufacturers. ----- ----- Additionally, the VRS approaches performed better than the MAX and i-MAX when being tested under the standard triangle network with a mean inter-station distance of 69km. However as the inter-station distance increases, the network RTK software may fail to generate VRS correction and then may turn to operate in the nearest single-base RTK (or RAW) mode. The position uncertainty reached beyond 2 meters occasionally, showing that the RTK rover software was using an incorrect ambiguity fixed solution to estimate the rover position rather than automatically dropping back to using an ambiguity float solution. Results identified that the risk of incorrectly resolving ambiguities reached 18%, 20%, 13% and 25% for i-MAX, MAX, Leica VRS and Trimble VRS respectively when operating over the large triangle network. Additionally, the Coordinate Quality indicator values given by the Leica GX1230 GG rover receiver tended to be over-optimistic and not functioning well with the identification of incorrectly fixed integer ambiguity solutions. In summary, this independent assessment has identified some problems and failures that can occur in all of the systems tested, especially when being pushed beyond the recommended limits. While such failures are expected, they can offer useful insights into where users should be wary and how manufacturers might improve their products. The results also demonstrate that integrity monitoring of RTK solutions is indeed necessary for precision applications, thus deserving serious attention from researchers and system providers.

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.

Network governance in US airport taxicab planning activities

This thesis examines the use of network governance in US airport transportation planning activities involving taxicab services for airport patrons. The research provides US airports with new insights whereby they can successfully engage with both transportation regulatory agencies and taxicab service providers in developing mutually agreeable policies that foster the development of supply-side taxicab service improvements. A mix of quantitative and qualitative research methods is used to unearth how US airports interact with these actors, and to identify attitudes held by airport staff in their engagements involving airport taxicab planning matters. The research may ultimately lead to the achievement of sustainable increases in the air passenger ground transportation modal share at US airports, resulting in both desirable long-term operational and environmental benefits for airport management, those involved with the provision of airport taxicab services, and the traveling public.

Recent advances in modeling the vulnerability of transportation networks

It is well known that, for major infrastructure networks such as electricity, gas, railway, road, and urban water networks, disruptions at one point have a knock on effect throughout the network. There is an impressive amount of individual research projects examining the vulnerability of critical infrastructure network. However, there is little understanding of the totality of the contribution made by these projects and their interrelationships. This makes their review a difficult process for both new and existing researchers in the field. To address this issue, a two-step literature review process is used, to provide an overview of the vulnerability of the transportation network in terms of four main themes - research objective, transportation mode, disruption scenario and vulnerability indicator –involving the analysis of related articles from 2001 to 2013. Two limitations of existing research are identified: (1) the limited amount of studies relating to multi-layer transportation network vulnerability analysis, and (2) the lack of evaluation methods to explore the relationship between structure vulnerability and dynamical functional vulnerability. In addition to indicating that more attention needs to be paid to these two aspects in future, the analysis provides a new avenue for the discovery of knowledge, as well as an improved understanding of transportation network vulnerability.

Comparing China's city transportation and economic networks

The city system has been a prevailing research issue in the fields of urban geography and regional economics. Not only do the relationships between cities in the city system exist in the form of rankings, but also in a more general network form. Previous work has examined the spatial structure of the city system in terms of its separate industrial networks, such as in transportation and economic activity, but little has been done to compare different networks. To rectify this situation, this study analyzes and reveals the spatial structural features of China’s city system by comparing its transportation and economic urban networks, thus providing new avenues for research on China’s city network. The results indicate that these two networks relate with each other by sharing structural equivalence with a basic diamond structure and a layered intercity structure decreasing outwards from the national centers. A decoupling effect also exists between them as the transportation network contributes to a balanced regional development, while the economic network promotes agglomeration economies. The law of economic development and the government both play important roles in the articulation between these two networks, and the gap between them can be shortened by related policy reforms and the improvement of the transportation network.

Enhancing 'Mobility' through Integrated Transportation and Traffic Management

During the course of preparation of a master plan for the transportation networks in Bangalore city, mapping the various initiatives and interventions planned towards addressing mobility, existing situation and implications of some of the proposed interventions was analysed. The inferences are based on existing transportation network; synthesis of various transportation related studies and proposed infrastructure initiatives (road works) in Bangalore. Broadly, they can be summarized as following five aspects: I. Need for ~Sreclassifying~T existing road networks (arterial and sub-arterial) with effective geospatial database in the back-end. II. The proposed Core Ring Road at surface grade may not be feasible. III. Current interventions encouraging more independent motorable transport by way of road widening, construction of underpasses, flyovers and grade-separators would not ease traffic congestion when addressed in isolation. IV. Factors affecting time and cost-overruns in infrastructure projects and ways to tackle are discussed. V. Initiatives required for addressing effective planning for operations recommended.

Large scale heterogeneous networks, the Davis-Wielandt shell, and graph separation

We consider a large scale network of interconnected heterogeneous dynamical components. Scalable stability conditions are derived that involve the input/output properties of individual subsystems and the interconnection matrix. The analysis is based on the Davis-Wielandt shell, a higher dimensional version of the numerical range with important convexity properties. This can be used to allow heterogeneity in the agent dynamics while relaxing normality and symmetry assumptions on the interconnection matrix. The results include small gain and passivity approaches as special cases, with the three dimensional shell shown to be inherently connected with corresponding graph separation arguments. © 2012 Society for Industrial and Applied Mathematics.

Geomorfologiczne uwarunkowania rozwoju sieci komunikacyjnej na obszarze młodoglacjalnym (zlewnia Perznicy, Pojezierze Drawskie

The aim of the studies in the Perznica River catchment were relief changes caused by the development of transportation infrastructure. This type of transformation is dependable on the state of economy and the settlements. The development of transportation network in the last two hundred years was examined through the analysis of archival cartographic materials – maps from the years 1789, 1855, 1877, 1935 – and the comparison with the situation from mid 1980s. The Perznica River catchment has an area of 249 km2 and it is located in north-western Poland in the central part of the Drawskie Lakeland macroregion, which belongs to the West Pomeranian Lakeland. The heterogeneous Perznica River catchment relief has a denivelation of 159 m and is within 60 and 219 m a.s.l. The study area is within the Parsęta River lobe. A number of subzones, whose morphological diversity and diversity of sediments lithofacies is mainly a reflection of areal deglaciation of the continental ice-sheet marginal zone, has been distinguished and these are: • subzone of the internal kame moraine – the undulated moraine upland, diversified by kame forms and kettle holes, • subzone of ice-free space forms – the uplands of kame plateaux, • subzone of melt-out lake basins – Lake Wielatowo basin with a characteristic collar ridge, • morphological levels of the northern Pomeranian sloping surface – mainly flat moraine uplands and small outwashes. The economic development of the Perznica River catchment advanced in close connection with the physical and geographical context, mainly with the relief, soils and hydrological conditions. As a result, the flat moraine uplands and marginal outflow plains, which were easiest to cultivate, have been developed and populated faster than any other. Since the early medieval period, large, compact villages, often centered around big estates, were emerging in those areas. In areas with a high relief energy–kame-melt moraines, ice-free space forms and ridges around melt-out lake basins–farming entered on a larger scale from the eighteenth century. Scattered settlements in those areas forced the creation of a dense access road network to farms and fields. In the case of anthropogenic forms of transportation with denivelation exceeding 1 m in the study area, road excavations are present for 37.3 km, road undercuttings for 43.8 km and road embankments for 38.7 km in total length. That gives a high ratio of density of such forms, equal to 2.1 km per km–2.

Characterization of Network-Wide Anomalies in Traffic Flows

Detecting and understanding anomalies in IP networks is an open and ill-defined problem. Toward this end, we have recently proposed the subspace method for anomaly diagnosis. In this paper we present the first large-scale exploration of the power of the subspace method when applied to flow traffic. An important aspect of this approach is that it fuses information from flow measurements taken throughout a network. We apply the subspace method to three different types of sampled flow traffic in a large academic network: multivariate timeseries of byte counts, packet counts, and IP-flow counts. We show that each traffic type brings into focus a different set of anomalies via the subspace method. We illustrate and classify the set of anomalies detected. We find that almost all of the anomalies detected represent events of interest to network operators. Furthermore, the anomalies span a remarkably wide spectrum of event types, including denial of service attacks (single-source and distributed), flash crowds, port scanning, downstream traffic engineering, high-rate flows, worm propagation, and network outage.

Typed Abstraction of Complex Network Compositions

The heterogeneity and open nature of network systems make analysis of compositions of components quite challenging, making the design and implementation of robust network services largely inaccessible to the average programmer. We propose the development of a novel type system and practical type spaces which reflect simplified representations of the results and conclusions which can be derived from complex compositional theories in more accessible ways, essentially allowing the system architect or programmer to be exposed only to the inputs and output of compositional analysis without having to be familiar with the ins and outs of its internals. Toward this end we present the TRAFFIC (Typed Representation and Analysis of Flows For Interoperability Checks) framework, a simple flow-composition and typing language with corresponding type system. We then discuss and demonstrate the expressive power of a type space for TRAFFIC derived from the network calculus, allowing us to reason about and infer such properties as data arrival, transit, and loss rates in large composite network applications.

An efficient method for optimal location and sizing of fixed and switched shunt capacitors in large distribution systems

This paper proposes a computationally efficient methodology for the optimal location and sizing of static and switched shunt capacitors in large distribution systems. The problem is formulated as the maximization of the savings produced by the reduction in energy losses and the avoided costs due to investment deferral in the expansion of the network. The proposed method selects the nodes to be compensated, as well as the optimal capacitor ratings and their operational characteristics, i.e. fixed or switched. After an appropriate linearization, the optimization problem was formulated as a large-scale mixed-integer linear problem, suitable for being solved by means of a widespread commercial package. Results of the proposed optimizing method are compared with another recent methodology reported in the literature using two test cases: a 15-bus and a 33-bus distribution network. For the both cases tested, the proposed methodology delivers better solutions indicated by higher loss savings, which are achieved with lower amounts of capacitive compensation. The proposed method has also been applied for compensating to an actual large distribution network served by AES-Venezuela in the metropolitan area of Caracas. A convergence time of about 4 seconds after 22298 iterations demonstrates the ability of the proposed methodology for efficiently handling large-scale compensation problems.

Dynamics in large scale networks

In this thesis we study the properties of two large dynamic networks, the competition network of advertisers on the Google and Bing search engines and the dynamic network of friend relationships among avatars in the massively multiplayer online game (MMOG) Planetside 2. We are particularly interested in removal patterns in these networks. Our main finding is that in both of these networks the nodes which are most commonly removed are minor near isolated nodes. We also investigate the process of merging of two large networks using data captured during the merger of servers of Planetside 2. We found that the original network structures do not really merge but rather they get gradually replaced by newcomers not associated with the original structures. In the final part of the thesis we investigate the concept of motifs in the Barabási-Albert random graph. We establish some bounds on the number of motifs in this graph.

An ATM distributed simulator for network management research

Due to the high cost of a large ATM network working up to full strength to apply our ideas about network management, i.e., dynamic virtual path (VP) management and fault restoration, we developed a distributed simulation platform for performing our experiments. This platform also had to be capable of other sorts of tests, such as connection admission control (CAC) algorithms, routing algorithms, and accounting and charging methods. The platform was posed as a very simple, event-oriented and scalable simulation. The main goal was the simulation of a working ATM backbone network with a potentially large number of nodes (hundreds). As research into control algorithms and low-level, or rather cell-level methods, was beyond the scope of this study, the simulation took place at a connection level, i.e., there was no real traffic of cells. The simulated network behaved like a real network accepting and rejecting SNMP ones, or experimental tools using the API node

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.

An optimal transportation routing approach using GIS-based dynamic traffic flows

This paper examines the value of real-time traffic information gathered through Geographic Information Systems for achieving an optimal vehicle routing within a dynamically stochastic transportation network. We present a systematic approach in determining the dynamically varying parameters and implementation attributes that were used for the development of a Web-based transportation routing application integrated with real-time GIS services. We propose and implement an optimal routing algorithm by modifying Dijkstra’s algorithm in order to incorporate stochastically changing traffic flows. We describe the significant features of our Web application in making use of the real-time dynamic traffic flow information from GIS services towards achieving total costs savings and vehicle usage reduction. These features help users and vehicle drivers in improving their service levels and productivity as the Web application enables them to interactively find the optimal path and in identifying destinations effectively.