Freeway Travel Time Estimation and Prediction Using Dynamic Neural Networks

Providing transportation system operators and travelers with accurate travel time information allows them to make more informed decisions, yielding benefits for individual travelers and for the entire transportation system. Most existing advanced traveler information systems (ATIS) and advanced traffic management systems (ATMS) use instantaneous travel time values estimated based on the current measurements, assuming that traffic conditions remain constant in the near future. For more effective applications, it has been proposed that ATIS and ATMS should use travel times predicted for short-term future conditions rather than instantaneous travel times measured or estimated for current conditions. This dissertation research investigates short-term freeway travel time prediction using Dynamic Neural Networks (DNN) based on traffic detector data collected by radar traffic detectors installed along a freeway corridor. DNN comprises a class of neural networks that are particularly suitable for predicting variables like travel time, but has not been adequately investigated for this purpose. Before this investigation, it was necessary to identifying methods for data imputation to account for missing data usually encountered when collecting data using traffic detectors. It was also necessary to identify a method to estimate the travel time on the freeway corridor based on data collected using point traffic detectors. A new travel time estimation method referred to as the Piecewise Constant Acceleration Based (PCAB) method was developed and compared with other methods reported in the literatures. The results show that one of the simple travel time estimation methods (the average speed method) can work as well as the PCAB method, and both of them out-perform other methods. This study also compared the travel time prediction performance of three different DNN topologies with different memory setups. The results show that one DNN topology (the time-delay neural networks) out-performs the other two DNN topologies for the investigated prediction problem. This topology also performs slightly better than the simple multilayer perceptron (MLP) neural network topology that has been used in a number of previous studies for travel time prediction.

Identification of Microturbine Model for Long-term Dynamic Analysis of Distribution Networks

As one of the most successfully commercialized distributed energy resources, the long-term effects of microturbines (MTs) on the distribution network has not been fully investigated due to the complex thermo-fluid-mechanical energy conversion processes. This is further complicated by the fact that the parameter and internal data of MTs are not always available to the electric utility, due to different ownerships and confidentiality concerns. To address this issue, a general modeling approach for MTs is proposed in this paper, which allows for the long-term simulation of the distribution network with multiple MTs. First, the feasibility of deriving a simplified MT model for long-term dynamic analysis of the distribution network is discussed, based on the physical understanding of dynamic processes that occurred within MTs. Then a three-stage identification method is developed in order to obtain a piecewise MT model and predict electro-mechanical system behaviors with saturation. Next, assisted with the electric power flow calculation tool, a fast simulation methodology is proposed to evaluate the long-term impact of multiple MTs on the distribution network. Finally, the model is verified by using Capstone C30 microturbine experiments, and further applied to the dynamic simulation of a modified IEEE 37-node test feeder with promising results.

Comments on: Static and dynamic source locations in undirected networks

SCOPUS: ed.j

Dynamic Resource Allocation in Wireless Heterogeneous Networks

Deployment of low power basestations within cellular networks can potentially increase both capacity and coverage. However, such deployments require efficient resource allocation schemes for managing interference from the low power and macro basestations that are located within each other’s transmission range. In this dissertation, we propose novel and efficient dynamic resource allocation algorithms in the frequency, time and space domains. We show that the proposed algorithms perform better than the current state-of-art resource management algorithms. In the first part of the dissertation, we propose an interference management solution in the frequency domain. We introduce a distributed frequency allocation scheme that shares frequencies between macro and low power pico basestations, and guarantees a minimum average throughput to users. The scheme seeks to minimize the total number of frequencies needed to honor the minimum throughput requirements. We evaluate our scheme using detailed simulations and show that it performs on par with the centralized optimum allocation. Moreover, our proposed scheme outperforms a static frequency reuse scheme and the centralized optimal partitioning between the macro and picos. In the second part of the dissertation, we propose a time domain solution to the interference problem. We consider the problem of maximizing the alpha-fairness utility over heterogeneous wireless networks (HetNets) by jointly optimizing user association, wherein each user is associated to any one transmission point (TP) in the network, and activation fractions of all TPs. Activation fraction of a TP is the fraction of the frame duration for which it is active, and together these fractions influence the interference seen in the network. To address this joint optimization problem which we show is NP-hard, we propose an alternating optimization based approach wherein the activation fractions and the user association are optimized in an alternating manner. The subproblem of determining the optimal activation fractions is solved using a provably convergent auxiliary function method. On the other hand, the subproblem of determining the user association is solved via a simple combinatorial algorithm. Meaningful performance guarantees are derived in either case. Simulation results over a practical HetNet topology reveal the superior performance of the proposed algorithms and underscore the significant benefits of the joint optimization. In the final part of the dissertation, we propose a space domain solution to the interference problem. We consider the problem of maximizing system utility by optimizing over the set of user and TP pairs in each subframe, where each user can be served by multiple TPs. To address this optimization problem which is NP-hard, we propose a solution scheme based on difference of submodular function optimization approach. We evaluate our scheme using detailed simulations and show that it performs on par with a much more computationally demanding difference of convex function optimization scheme. Moreover, the proposed scheme performs within a reasonable percentage of the optimal solution. We further demonstrate the advantage of the proposed scheme by studying its performance with variation in different network topology parameters.

Reasoning on the Risks of Dynamic Manufacturing Networks through Cognitive Mapping

Part 17: Risk Analysis

The Dynamic and Changing Development of EERA Networks

In this article the authors use two EERA networks as a case for a discussion on the development of research networks within the European Educational Research Association (EERA). They contend that EERA networks through their way of working create a European research space. As their case shows, the development of networks is diverse. The emergence of networks and the current group of thirty-one networks do not display a coherent and unified system. Thus they argue that EERA networks have to be studied as an open complex system in order to comprehend the multiplicity and creative and innovative space that these networks represent. They create a space for knowledge production in a European context, enabling educational researchers to see and experience their research in a more diverse setting.

User-Created Content and Online Social Networks

Traditional media are under assault from digital technologies. Online advertising is eroding the financial basis of newspapers and television, demarcations between different forms of media are fading, and audiences are fragmenting. We can podcast our favourite radio show, data accompanies television programs, and we catch up with newspaper stories on our laptops. Yet mainstream media remain enormously powerful. The Media and Communications in Australia offers a systematic introduction to this dynamic field. Fully updated and revised to take account of recent developments, this third edition outlines the key media industries and explains how communications technologies are impacting on them. It provides a thorough overview of the main approaches taken in studying the media, and includes new chapters on social media, gaming, telecommunications, sport and cultural diversity. With contributions from some of Australia's best researchers and teachers in the field, The Media and Communications in Australia is the most comprehensive and reliable introduction to media and communications available. It is an ideal student text, and a reference for teachers of media and anyone interested in this influential industry.

Efficient clustering approach for intrusion detection in adhoc networks

Mobile ad-hoc networks (MANETs) are temporary wireless networks useful in emergency rescue services, battlefields operations, mobile conferencing and a variety of other useful applications. Due to dynamic nature and lack of centralized monitoring points, these networks are highly vulnerable to attacks. Intrusion detection systems (IDS) provide audit and monitoring capabilities that offer the local security to a node and help to perceive the specific trust level of other nodes. We take benefit of the clustering concept in MANETs for the effective communication between nodes, where each cluster involves a number of member nodes and is managed by a cluster-head. It can be taken as an advantage in these battery and memory constrained networks for the purpose of intrusion detection, by separating tasks for the head and member nodes, at the same time providing opportunity for launching collaborative detection approach. The clustering schemes are generally used for the routing purposes to enhance the route efficiency. However, the effect of change of a cluster tends to change the route; thus degrades the performance. This paper presents a low overhead clustering algorithm for the benefit of detecting intrusion rather than efficient routing. It also discusses the intrusion detection techniques with the help of this simplified clustering scheme.

Poster abstract : Energy-efficient rate adaptive MAC Protocol (RA-MAC) for long-lived sensor networks

This paper introduces an energy-efficient Rate Adaptive MAC (RA-MAC) protocol for long-lived Wireless Sensor Networks (WSN). Previous research shows that the dynamic and lossy nature of wireless communication is one of the major challenges to reliable data delivery in a WSN. RA-MAC achieves high link reliability in such situations by dynamically trading off radio bit rate for signal processing gain. This extra gain reduces the packet loss rate which results in lower energy expenditure by reducing the number of retransmissions. RA-MAC selects the optimal data rate based on channel conditions with the aim of minimizing energy consumption. We have implemented RA-MAC in TinyOS on an off-the-shelf sensor platform (TinyNode), and evaluated its performance by comparing RA-MAC with state-ofthe- art WSN MAC protocol (SCP-MAC) by experiments.

Transforming agriculture through pervasive wireless sensor networks

A large-scale, outdoor, pervasive computing system based on the Fleck hardware platform applies sensor network technology to farming. Comprising static and animal-borne mobile nodes, the system measures the state of a complex, dynamic system comprising climate, soil, pasture, and animals. This data supports prediction of the land's future state and improved management outcomes through closed-loop control. This article is part of a special issue, Building a Sensor-Rich World.

Urban dynamic origin-destination matrices estimation

The aim of this paper is to explore a new approach to obtain better traffic demand (Origin-Destination, OD matrices) for dense urban networks. From reviewing existing methods, from static to dynamic OD matrix evaluation, possible deficiencies in the approach could be identified: traffic assignment details for complex urban network and lacks in dynamic approach. To improve the global process of traffic demand estimation, this paper is focussing on a new methodology to determine dynamic OD matrices for urban areas characterized by complex route choice situation and high level of traffic controls. An iterative bi-level approach will be used, the Lower level (traffic assignment) problem will determine, dynamically, the utilisation of the network by vehicles using heuristic data from mesoscopic traffic simulator and the Upper level (matrix adjustment) problem will proceed to an OD estimation using optimization Kalman filtering technique. In this way, a full dynamic and continuous estimation of the final OD matrix could be obtained. First results of the proposed approach and remarks are presented.

Development and implementation of the areawide Dynamic ROad traffic NoisE (DRONE) simulator

This paper discusses the areawide Dynamic ROad traffic NoisE (DRONE) simulator, and its implementation as a tool for noise abatement policy evaluation. DRONE involves integrating a road traffic noise estimation model with a traffic simulator to estimate road traffic noise in urban networks. An integrated traffic simulation-noise estimation model provides an interface for direct input of traffic flow properties from simulation model to noise estimation model that in turn estimates the noise on a spatial and temporal scale. The output from DRONE is linked with a geographical information system for visual representation of noise levels in the form of noise contour maps.

Designing for participation in local social ridesharing networks : grass roots prototyping of IT systems

This abstract explores the possibility of a grass roots approach to engaging people in community change initiatives by designing simple interactive exploratory prototypes for use by communities over time that support shared action. The prototype is gradually evolved in response to community use, fragments of data gathered through the prototype, and participant feedback with the goal of building participation in community change initiatives. A case study of a system to support ridesharing is discussed. The approach is compared and contrasted to a traditional IT systems procurement approach.

Networks cities and ecological habitats

As the world’s rural populations continue to migrate from farmland to sprawling cities, transport networks form an impenetrable maze within which monocultures of urban form erupt from the spaces in‐between. These urban monocultures are as problematic to human activity in cities as cropping monocultures are to ecosystems in regional landscapes. In China, the speed of urbanisation is exacerbating the production of mono‐functional private and public spaces. Edges are tightly controlled. Barriers and management practices at these boundaries are discouraging the formation of new synergistic relationships, critical in the long‐term stability of ecosystems that host urban habitats. Some urban planners, engineers, urban designers, architects and landscape architects have recognised these shortcomings in contemporary Chinese cities. The ideology of sustainability, while critically debated, is bringing together thinking people in these and other professions under the umbrella of an ecological ethic. This essay aims to apply landscape ecology theory, a conceptual framework used by many professionals involved in land development processes, to a concept being developed by BAU International called Networks Cities: a city with its various land uses arranged in nets of continuity, adjacency, and superposition. It will consider six lesser‐known concepts in relation to creating enhanced human activity along (un)structured edges between proposed nets and suggest new frontiers that might be challenged in an eco‐city. Ecological theory suggests that sustaining biodiversity in regions and landscapes depends on habitat distribution patterns. Flora and fauna biologists have long studied edge habitats and have been confounded by the paradox that maximising the breadth of edges is detrimental to specialist species but favourable to generalist species. Generalist species of plants and animals tolerate frequent change in the landscape, frequenting two or more habitats for their survival. Specialist species are less tolerant of change, having specific habitat requirements during their life cycle. Protecting species richness then may be at odds with increasing mixed habitats or mixed‐use zones that are dynamic places where diverse activities occur. Forman (1995) in his book Land Mosaics however argues that these two objectives of land use management are entirely compatible. He postulates that an edge may be comprised of many small patches, corridors or convoluting boundaries of large patches. Many ecocentrists now consider humans to be just another species inhabiting the ecological environments of our cities. Hence habitat distribution theory may be useful in planning and designing better human habitats in a rapidly urbanising context like China. In less‐constructed environments, boundaries and edges provide important opportunities for the movement of multi‐habitat species into, along and from adjacent land use areas. For instance, invasive plants may escape into a national park from domestic gardens while wildlife may forage on garden plants in adjoining residential areas. It is at these interfaces that human interactions too flow backward and forward between land types. Spray applications of substances by farmers on cropland may disturb neighbouring homeowners while suburban residents may help themselves to farm produce on neighbouring orchards. Edge environments are some of the most dynamic and contested spaces in the landscape. Since most of us require access to at least two or three habitats diurnally, weekly, monthly or seasonally, their proximity to each other becomes critical in our attempts to improve the sustainability of our cities.