Parallel linear system solution and its application to railway power network simulation

The Streaming SIMD extension (SSE) is a special feature embedded in the Intel Pentium III and IV classes of microprocessors. It enables the execution of SIMD type operations to exploit data parallelism. This article presents improving computation performance of a railway network simulator by means of SSE. Voltage and current at various points of the supply system to an electrified railway line are crucial for design, daily operation and planning. With computer simulation, their time-variations can be attained by solving a matrix equation, whose size mainly depends upon the number of trains present in the system. A large coefficient matrix, as a result of congested railway line, inevitably leads to heavier computational demand and hence jeopardizes the simulation speed. With the special architectural features of the latest processors on PC platforms, significant speed-up in computations can be achieved.

Parallel solution for railway power network simulation

The Streaming SIMD extension (SSE) is a special feature that is available in the Intel Pentium III and P4 classes of microprocessors. As its name implies, SSE enables the execution of SIMD (Single Instruction Multiple Data) operations upon 32-bit floating-point data therefore, performance of floating-point algorithms can be improved. In electrified railway system simulation, the computation involves the solving of a huge set of simultaneous linear equations, which represent the electrical characteristic of the railway network at a particular time-step and a fast solution for the equations is desirable in order to simulate the system in real-time. In this paper, we present how SSE is being applied to the railway network simulation.

The conflict resolution in connected railway junctions

Purpose of study: Traffic conflicts occur when trains on different routes approach a converging junction in a railway network at the same time. To prevent collisions, a right-of-way assignment is needed to control the order in which the trains should pass the junction. Such control action inevitably requires the braking and/or stopping of trains, which lengthens their travelling times and leads to delays. Train delays cause a loss of punctuality and hence directly affect the quality of service. It is therefore important to minimise the delays by devising a suitable right-of-way assignment. One of the major difficulties in attaining the optimal right-of-way assignment is that the number of feasible assignments increases dramatically with the number of trains. Connected-junctions further complicate the problem. Exhaustive search for the optimal solution is time-consuming and infeasible for area control (multi-junction). Even with the more intelligent deterministic optimisation method revealed in [1], the computation demand is still considerable, which hinders real-time control. In practice, as suggested in [2], the optimality may be traded off by shorter computation time, and heuristic searches provide alternatives for this optimisation problem.

A sensitivity analysis of train speed and its effect on railway capacity

Increasing train speeds is conceptually a simple and straight forward method to expand railway capacity, for example in comparison to other more extensive and elaborate alternatives. In this article an analytical capacity model has been investigated as a means of performing a sensitivity analysis of train speeds. The results of this sensitivity analysis can help improve the operation of this railway system and to help it cope with additional demands in the future. To test our approach a case study of the Rah Ahane Iran (RAI) national railway network has been selected. The absolute capacity levels for this railway network have been determined and the analysis shows that increasing trains speeds may not be entirely cost effective in all circumstances.

Protection of a Static Frequency Converter fed traction network, a case study

Aurizon, Australia's largest rail freight operator, is introducing the Static Frequency Converter (SFC) technology into its electric railway network as part of the Bauhinia Electrification Project. The introduction of SFCs has significant implications on the protection systems of the 50kV traction network. The traditional distance protection calculation method does not work in this configuration because of the effect that the SFC in combination with the remote grid has on the apparent impedance, and was substantially reviewed. The standard overcurrent (OC) protection scheme is not suitable due to the minimum fault level being below the maximum load level and was revised to incorporate directionality and under-voltage inhibit. Delta protection was reviewed to improve sensitivity. A new protection function was introduced to prevent back-feeding faults in the transmission network through the grid connection. Protection inter-tripping was included to ensure selectivity between the SFC protection and the system downstream.

Real-time simulation for power systems based on parallel computing - an empirical study

Abstract Computer simulation is a versatile and commonly used tool for the design and evaluation of systems with different degrees of complexity. Power distribution systems and electric railway network are areas for which computer simulations are being heavily applied. A dominant factor in evaluating the performance of a software simulator is its processing time, especially in the cases of real-time simulation. Parallel processing provides a viable mean to reduce the computing time and is therefore suitable for building real-time simulators. In this paper, we present different issues related to solving the power distribution system with parallel computing based on a multiple-CPU server and we will concentrate, in particular, on the speedup performance of such an approach.

Incorporating complex train paths to an analysis of absolute capacity

Railways are an important mode of transportation. They are however large and complex and their construction, management and operation is time consuming and costly. Evidently planning the current and future activities is vital. Part of that planning process is an analysis of capacity. To determine what volume of traffic can be achieved over time, a variety of railway capacity analysis techniques have been created. A generic analytical approach that incorporates more complex train paths however has yet to be provided. This article provides such an approach. This article extends a mathematical model for determining the theoretical capacity of a railway network. The main contribution of this paper is the modelling of more complex train paths whereby each section can be visited many times in the course of a train’s journey. Three variant models are formulated and then demonstrated in a case study. This article’s numerical investigations have successively shown the applicability of the proposed models and how they may be used to gain insights into system performance.

A near Optimal Cane Rail Scheduler under Limited and Unlimited Capacity Constraints

Australia is the world’s third largest exporter of raw sugar after Brazil and Thailand, with around $2.0 billion in export earnings. Transport systems play a vital role in the raw sugar production process by transporting the sugarcane crop between farms and mills. In 2013, 87 per cent of sugarcane was transported to mills by cane railway. The total cost of sugarcane transport operations is very high. Over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. A cane railway network mainly involves single track sections and multiple track sections used as passing loops or sidings. The cane railway system performs two main tasks: delivering empty bins from the mill to the sidings for filling by harvesters; and collecting the full bins of cane from the sidings and transporting them to the mill. A typical locomotive run involves an empty train (locomotive and empty bins) departing from the mill, traversing some track sections and delivering bins at specified sidings. The locomotive then, returns to the mill, traversing the same track sections in reverse order, collecting full bins along the way. In practice, a single track section can be occupied by only one train at a time, while more than one train can use a passing loop (parallel sections) at a time. The sugarcane transport system is a complex system that includes a large number of variables and elements. These elements work together to achieve the main system objectives of satisfying both mill and harvester requirements and improving the efficiency of the system in terms of low overall costs. These costs include delay, congestion, operating and maintenance costs. An effective cane rail scheduler will assist the traffic officers at the mill to keep a continuous supply of empty bins to harvesters and full bins to the mill with a minimum cost. This paper addresses the cane rail scheduling problem under rail siding capacity constraints where limited and unlimited siding capacities were investigated with different numbers of trains and different train speeds. The total operating time as a function of the number of trains, train shifts and a limited number of cane bins have been calculated for the different siding capacity constraints. A mathematical programming approach has been used to develop a new scheduler for the cane rail transport system under limited and unlimited constraints. The new scheduler aims to reduce the total costs associated with the cane rail transport system that are a function of the number of bins and total operating costs. The proposed metaheuristic techniques have been used to find near optimal solutions of the cane rail scheduling problem and provide different possible solutions to avoid being stuck in local optima. A numerical investigation and sensitivity analysis study is presented to demonstrate that high quality solutions for large scale cane rail scheduling problems are obtainable in a reasonable time. Keywords: Cane railway, mathematical programming, capacity, metaheuristics

Optimization models for expanding a railway’s theoretical capacity

Changing the topology of a railway network can greatly affect its capacity. Railway networks however can be altered in a multitude of different ways. As each way has significant immediate and long term financial ramifications, it is a difficult task to decide how and where to expand the network. In response some railway capacity expansion models (RCEM) have been developed to help capacity planning activities, and to remove physical bottlenecks in the current railway system. The exact purpose of these models is to decide given a fixed budget, where track duplications and track sub divisions should be made, in order to increase theoretical capacity most. These models are high level and strategic, and this is why increases to the theoretical capacity is concentrated upon. The optimization models have been applied to a case study to demonstrate their application and their worth. The case study evidently shows how automated approaches of this nature could be a formidable alternative to current manual planning techniques and simulation. If the exact effect of track duplications and sub-divisions can be sufficiently approximated, this approach will be very applicable.

A new constraint programming approach for optimising a coal rail system

Because of the bottlenecking operations in a complex coal rail system, millions of dollars are costed by mining companies. To handle this issue, this paper investigates a real-world coal rail system and aims to optimise the coal railing operations under constraints of limited resources (e.g., limited number of locomotives and wagons). In the literature, most studies considered the train scheduling problem on a single-track railway network to be strongly NP-hard and thus developed metaheuristics as the main solution methods. In this paper, a new mathematical programming model is formulated and coded by optimization programming language based on a constraint programming (CP) approach. A new depth-first-search technique is developed and embedded inside the CP model to obtain the optimised coal railing timetable efficiently. Computational experiments demonstrate that high-quality solutions are obtainable in industry-scale applications. To provide insightful decisions, sensitivity analysis is conducted in terms of different scenarios and specific criteria. Keywords Train scheduling · Rail transportation · Coal mining · Constraint programming

Monitoring the Australian Blogosphere through the 2007 Australian Federal Election

This paper examines the observable patterns of content creation by Australian political bloggers dur‐ing the 2007 election and its aftermath, thereby providing insight into the level and nature of activity in the Australian political blogosphere during that time. The performance indicators which are identi‐fied through this process enable us to target for further in‐depth research, to be reported in subse‐quent papers, those individual blogs and blog clusters showing especially high or unusual activity as compared to the overall baseline. This research forms the first stage in a larger project to investigate the shape and internal dynamics of the Australian political blogosphere. In this first stage, we tracked the activities of some 230 political blogs and related Websites in Australia from 2 November 2007 (the final month of the federal election campaign, with the election itself taking place on 24 Novem‐ber) to 24 January 2008. We harvested more than 65,000 articles for this study.

NELR Editorial Federal Updates Issue 2012:3

Despite opposition from environmentalists, farmers and parts of the fishing industry, on 23 August 2012, the $6.4bn Alpha Coal mine and rail project in Queensland was approved under the EPBC Act, subject to 19 conditions.1 The approval relates to the proposed construction and operation of an open-cut coal mine and 495km railway line to Abbott Point...

Citizen journalism and political participation : the youdecide project and the 2007 Australian Federal Election

The 2007 Australian Federal election not only saw the election of a Labor government after 11 years of John Howard’s conservative Coalition government. It also saw new levels of political engagement through the Internet, including the rise of citizen journalism as an alternative outlet and mode of reporting on the election. This paper reports on the You Decide 2007 project, an initiative undertaken by a QUT-based research team to facilitate online news reporting on the election on a ‘hyper-local’, electorate-based model. We evaluate the You Decide initiative on the basis of: promoting greater citizen participation in Australian politics; new ways of engaging citizens and key stakeholders in policy deliberation; establishing new links between mainstream media and independent online media; and broadening the base of political participation to include a wider range of citizen and groups.

Citizen journalism as social networking : reporting the 2007 Australian Federal Election

One of the perceived Achilles heels of online citizen journalism is its perceived inability to conduct investigative and first-hand reporting. A number of projects have recently addressed this problem, with varying success: the U.S.-based Assignment Zero was described as "a highly satisfying failure" (Howe 2007), while the German MyHeimat.de appears to have been thoroughly successful in attracting a strong community of contributors, even to the point of being able to generate print versions of its content, distributed free of charge to households in selected German cities. In Australia, citizen journalism played a prominent part in covering the federal elections held on 24 November 2007; news bloggers and public opinion Websites provided a strong counterpoint to the mainstream media coverage of the election campaign (Bruns et al., 2007). Youdecide2007.org, a collaboration between researchers at Queensland University of Technology and media practitioners at the public service broadcaster SBS, the public opinion site On Line Opinion, and technology company Cisco Systems, was developed as a dedicated space for a specifically hyperlocal coverage of the election campaign in each of Australia's 150 electorates from the urban sprawls of Sydney and Brisbane to the sparsely populated remote regions of outback Australia. YD07 provided training materials for would-be citizen journalists and encouraged them to contribute electorate profiles, interview candidates, and conduct vox-pops with citizens in their local area. The site developed a strong following especially in its home state of Queensland, and its interviewers influenced national public debate by uncovering the sometimes controversial personal views of mainstream and fringe candidates. At the same time, the success of YD07 was limited by external constraints determined by campaign timing and institutional frameworks. As part of a continuing action research cycle, lessons learnt from Youdecide2007.org are going to be translated into further iterations of the project, which will cover the local government elections in the Australian state of Queensland, to be held in March 2008, and developments subsequent to these elections. This paper will present research outcomes from the Youdecide2007.org project. In particular, it will examine the roles of staff contributors and citizen journalists in attracting members, providing information, promoting discussion, and fostering community on the site: early indications from a study of interaction data on the site indicate notably different contribution patterns and effects for staff and citizen participants, which may point towards the possibility of developing more explicit pro-am collaboration models in line with the Pro-Am phenomenon outlined by Leadbeater & Miller (2004). The paper will outline strengths and weaknesses of the Youdecide model and highlight requirements for the successful development of active citizen journalism communities. In doing so, it will also evaluate the feasibility of hyperlocal citizen journalism approaches, and their interrelationship with broader regional, state, and national journalism in both its citizen and industrial forms.

The Federal circuit in Bilski : the machine-or-transformation test

In a much anticipated judgment, the Federal Circuit has sought to clarify the standards applicable in determining whether a claimed method constitutes patent-eligible subject matter. In Bilski, the Federal Circuit identified a test to determine whether a patentee has made claims that pre-empt the use of a fundamental principle or an abstract idea or whether those claims cover only a particular application of a fundamental principle or abstract idea. It held that the sole test for determining subject matter eligibility for a claimed process under § 101 is that: (1) it is tied to a particular machine or apparatus, or (2) it transforms a particular article into a different state or thing. The court termed this the “machine-or-transformation test.” In so doing it overruled its earlier State Street decision to the extent that it deemed its “useful, tangible and concrete result” test as inadequate to determine whether an alleged invention recites patent-eligible subject matter.