Enabling Open Access to Public Sector Information With Creative Commons Licences : The Australian Experience

This chapter considers how open content licences of copyright-protected materials – specifically, Creative Commons (CC) licences - can be used by governments as a simple and effective mechanism to enable reuse of their PSI, particularly where materials are made available in digital form online or distributed on disk.

Modeling and Verification of Privacy Enhancing Protocols

Privacy enhancing protocols (PEPs) are a family of protocols that allow secure exchange and management of sensitive user information. They are important in preserving users’ privacy in today’s open environment. Proof of the correctness of PEPs is necessary before they can be deployed. However, the traditional provable security approach, though well established for verifying cryptographic primitives, is not applicable to PEPs. We apply the formal method of Coloured Petri Nets (CPNs) to construct an executable specification of a representative PEP, namely the Private Information Escrow Bound to Multiple Conditions Protocol (PIEMCP). Formal semantics of the CPN specification allow us to reason about various security properties of PIEMCP using state space analysis techniques. This investigation provides us with preliminary insights for modeling and verification of PEPs in general, demonstrating the benefit of applying the CPN-based formal approach to proving the correctness of PEPs.

Space and Cyberspace: on the enclosure of consciousness

In this chapter I argue that the global privatisation of elctromagnetic spectrum marks this period as historically unique. I also put forward conceptual categories for understanding the nature of an emergent cybereconomy. They correspond to classical conceptions of property, value and labour, but in no way treat these categories as singular, simple or unproblematic. From a perspective informed largely by Marx’s critique of classical political economy, I frame the creation of a global cyberspace as the enclosure, or “privatisation”, of conscious activity. I argue that a full and formally defined cyberspace, at least as it is currenty conceived of, must prefigure the eventual alienation of human social existence at its most fundamental and definitive level: consciousness.

Numerical methods for fractional partial differential equations with Riesz space fractional derivatives

In this paper, we consider the numerical solution of a fractional partial differential equation with Riesz space fractional derivatives (FPDE-RSFD) on a finite domain. Two types of FPDE-RSFD are considered: the Riesz fractional diffusion equation (RFDE) and the Riesz fractional advection–dispersion equation (RFADE). The RFDE is obtained from the standard diffusion equation by replacing the second-order space derivative with the Riesz fractional derivative of order αset membership, variant(1,2]. The RFADE is obtained from the standard advection–dispersion equation by replacing the first-order and second-order space derivatives with the Riesz fractional derivatives of order βset membership, variant(0,1) and of order αset membership, variant(1,2], respectively. Firstly, analytic solutions of both the RFDE and RFADE are derived. Secondly, three numerical methods are provided to deal with the Riesz space fractional derivatives, namely, the L1/L2-approximation method, the standard/shifted Grünwald method, and the matrix transform method (MTM). Thirdly, the RFDE and RFADE are transformed into a system of ordinary differential equations, which is then solved by the method of lines. Finally, numerical results are given, which demonstrate the effectiveness and convergence of the three numerical methods.

The Media City: Media, Architecture and Urban Space

The article reviews the book "The Media City: Media, Architecture and Urban Space," by Scott McQuire.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.

Open occupations - Why work should be free

The benefits of openness are widely apparent everywhere except, seemingly, in occupations. Yet the case against occupational licensing still remains strong. Consideration of dynamic costs strengthens the case further.

Cost-effectiveness of a telephone-delivered intervention for physical activity and diet

Background: Given escalating rates of chronic disease, broad-reach and cost-effective interventions to increase physical activity and improve dietary intake are needed. The cost-effectiveness of a Telephone Counselling intervention to improve physical activity and diet, targeting adults with established chronic diseases in a low socio-economic area of a major Australian city was examined. Methodology/Principal Findings: A cost-effectiveness modelling study using data collected between February 2005 and November 2007 from a cluster-randomised trial that compared Telephone Counselling with a “Usual Care” (brief intervention) alternative. Economic outcomes were assessed using a state-transition Markov model, which predicted the progress of participants through five health states relating to physical activity and dietary improvement, for ten years after recruitment. The costs and health benefits of Telephone Counselling, Usual Care and an existing practice (Real Control) group were compared. Telephone Counselling compared to Usual Care was not cost-effective ($78,489 per quality adjusted life year gained). However, the Usual Care group did not represent existing practice and is not a useful comparator for decision making. Comparing Telephone Counselling outcomes to existing practice (Real Control), the intervention was found to be cost-effective ($29,375 per quality adjusted life year gained). Usual Care (brief intervention) compared to existing practice (Real Control) was also cost-effective ($12,153 per quality adjusted life year gained). Conclusions/Significance: This modelling study shows that a decision to adopt a Telephone Counselling program over existing practice (Real Control) is likely to be cost-effective. Choosing the ‘Usual Care’ brief intervention over existing practice (Real Control) shows a lower cost per quality adjusted life year, but the lack of supporting evidence for efficacy or sustainability is an important consideration for decision makers. The economics of behavioural approaches to improving health must be made explicit if decision makers are to be convinced that allocating resources toward such programs is worthwhile.

Introduction to the Proceedings of the 1st EDOC 2009 Workshop on Service-Oriented Business Networks and Ecosystems (SOBNE '09)

The first Workshop on Service-Oriented Business Networks and Ecosystems (SOBNE ’09) is held in conjunction with the 13th IEEE International EDOC Conference on 2 September 2009 in Auckland, New Zealand. The SOBNE ’09 program includes 9 peer-reviewed papers (7 full and 2 short papers) and an open discussion session. This introduction to the Proceedings of SOBNE ’09 starts with a brief background of the motivation for the workshop. Next, it contains a short description of the peer-reviewed papers, and finally, after some concluding statements and the announcement of the winners of the Best Reviewer Award and the Most Promising Research Award, it lists the members of the SOBNE ’09 Program Committee and external reviewers of the workshop submissions.

Generative Music editorial

An issue on generative music in Contemporary Music Review allows space to explore many of these controversies, and to explore the rich algorithmic scene in contemporary practice, as well as the diverse origins and manifestations of such a culture. A roster of interesting exponents from both academic and arts practice backgrounds are involved, matching the broad spectrum of current work. Contributed articles range from generative algorithms in live systems, from live coding to interactive music systems to computer games, through algorithmic modelling of longer-term form, evolutionary algorithms, to interfaces between modalities and mediums, in algorithmic choreography. A retrospective on the intensive experimentation into algorithmic music and sound synthesis at the Institute of Sonology in the 1960s and 70s creates a complementary strand, as well as an open paper on the issues raised by open source, as opposed to proprietary, software and operating systems, with consequences in the creation and archiving of algorithmic work.

Learning to program : from pear-shaped to pairs

The consistently high failure rate in Queensland University of Technology’s introductory programming subject reflects a similar dilemma facing other universities worldwide. Experiments were conducted to quantify the effectiveness of collaborative learning on introductory level programming students over a number of semesters, replicating previous studies in this area. A selection of workshops in the introductory programming subject required students to problem-solve and program in pairs, mimicking the eXtreme Programming concept of pair programming. The failure rate for the subject fell from what had been an average of 30% since 2003 (with a high of 41% in 2006), to just 5% for those students who worked consistently in pairs.

Motivation, development and validation of a new spectral greenness index : a spectral dimension related to foliage projective cover

A method is presented for the development of a regional Landsat-5 Thematic Mapper (TM) and Landsat-7 Enhanced Thematic Mapper plus (ETM+) spectral greenness index, coherent with a six-dimensional index set, based on a single ETM+ spectral image of a reference landscape. The first three indices of the set are determined by a polar transformation of the first three principal components of the reference image and relate to scene brightness, percent foliage projective cover (FPC) and water related features. The remaining three principal components, of diminishing significance with respect to the reference image, complete the set. The reference landscape, a 2200 km2 area containing a mix of cattle pasture, native woodland and forest, is located near Injune in South East Queensland, Australia. The indices developed from the reference image were tested using TM spectral images from 19 regionally dispersed areas in Queensland, representative of dissimilar landscapes containing woody vegetation ranging from tall closed forest to low open woodland. Examples of image transformations and two-dimensional feature space plots are used to demonstrate image interpretations related to the first three indices. Coherent, sensible, interpretations of landscape features in images composed of the first three indices can be made in terms of brightness (red), foliage cover (green) and water (blue). A limited comparison is made with similar existing indices. The proposed greenness index was found to be very strongly related to FPC and insensitive to smoke. A novel Bayesian, bounded space, modelling method, was used to validate the greenness index as a good predictor of FPC. Airborne LiDAR (Light Detection and Ranging) estimates of FPC along transects of the 19 sites provided the training and validation data. Other spectral indices from the set were found to be useful as model covariates that could improve FPC predictions. They act to adjust the greenness/FPC relationship to suit different spectral backgrounds. The inclusion of an external meteorological covariate showed that further improvements to regional-scale predictions of FPC could be gained over those based on spectral indices alone.

Moving towards open standards

Standards are designed to promote the interoperability of products and systems by enabling different parties to develop technologies that can be used together. There is an increasing expectation in many technical communities, including open source communities, that standards will be ‘open’. However, standards are subject to legal rights which impact upon, not only their development, but also their implementation. Of central importance are intellectual property rights: technical standards may incorporate patented technologies, while the specification documents of standards are protected by copyright. This article provides an overview of the processes by which standards are developed and considers the concept of ‘interoperability’, the meaning of the term ‘open standard’ and how open standards contribute to interoperability. It explains how intellectual property rights operate in relation to standards and how they can be managed to create standards that are open, not only during their development, but also in implementation.