The mirror-ball effect: Investigating channels, messages and participation levels

Journalists have always used equipment which has been generally available in the communities in which they worked. This has been a result both of economy and necessity, since they found they had to connect with their audiences using means that were available to the audience, not just to the sender. Newspapers sold on street corners in the very early media days; SMS and email have become the rule for the early 21st century. This development also admits the possibility of the roles of the communication professional and the community merging during the “public journalism” process, and has become most recently evident in the areas around the Bay of Bengal, struck by the tsunami on December 26, 2004, especially in the Indonesian province of Banda Aceh, and in the Andaman and Nicobar Islands, where tiny portable radios, featuring solar panels and hand-cranked dynamos, have suddenly become part of a vital news media channel. In this article participant-observation and personal interview techniques are used to record and compare many of the digital channels used by news and information senders up to 2005. It also investigates the level of genuine participation which these new technologies have brought to the communications process.

E-Government, targeting and data profiling: Policy and ethical issues of differential treatment

Networked information and communication technologies are rapidly advancing the capacities of governments to target and separately manage specific sub-populations, groups and individuals. Targeting uses data profiling to calculate the differential probabilities of outcomes associated with various personal characteristics. This knowledge is used to classify and sort people for differentiated levels of treatment. Targeting is often used to efficiently and effectively target government resources to the most disadvantaged. Although having many benefits, targeting raises several policy and ethical issues. This paper discusses these issues and the policy responses governments may take to maximise the benefits of targeting while ameliorating the negative aspects.

A geometric approach to quantum circuit lower bounds

What is the minimal size quantum circuit required to exactly implement a specified n-qubit unitary operation, U, without the use of ancilla qubits? We show that a lower bound on the minimal size is provided by the length of the minimal geodesic between U and the identity, I, where length is defined by a suitable Finsler metric on the manifold SU(2(n)). The geodesic curves on these manifolds have the striking property that once an initial position and velocity are set, the remainder of the geodesic is completely determined by a second order differential equation known as the geodesic equation. This is in contrast with the usual case in circuit design, either classical or quantum, where being given part of an optimal circuit does not obviously assist in the design of the rest of the circuit. Geodesic analysis thus offers a potentially powerful approach to the problem of proving quantum circuit lower bounds. In this paper we construct several Finsler metrics whose minimal length geodesics provide lower bounds on quantum circuit size. For each Finsler metric we give a procedure to compute the corresponding geodesic equation. We also construct a large class of solutions to the geodesic equation, which we call Pauli geodesics, since they arise from isometries generated by the Pauli group. For any unitary U diagonal in the computational basis, we show that: (a) provided the minimal length geodesic is unique, it must be a Pauli geodesic; (b) finding the length of the minimal Pauli geodesic passing from I to U is equivalent to solving an exponential size instance of the closest vector in a lattice problem (CVP); and (c) all but a doubly exponentially small fraction of such unitaries have minimal Pauli geodesics of exponential length.

Healthy waterways: Healthy catchments - An integrated research/management program to understand and reduce impacts of sediments and nutrients on waterways in Queensland, Australia

The Moreton Bay Waterways and Catchments Partnership, now branded the Healthy Waterways Partnership, has built on the experience of the past 15 years here in South East Queensland (SEQ). It focuses on water quality and the ecosystem health of our freshwater, estuarine and marine systems through the implementation of actions by individual partners and the collective oversight of a regional work program that assists partners to prioritise their investments and address emerging issues. This regional program includes monitoring, reporting, marketing and communication, development of decision support tools, research that is directed to problem solving, and maintaining extensive consultative and engagement arrangements. The Partnership has produced information-based outcomes which have led to significant cost savings in the protection of water quality and ecosystem resources by its stakeholders. This has been achieved by: – providing a clear focus for management actions that has ownership of governments, industry and community; – targeted scientific research to address issues requiring appropriate management actions; – management actions based on a sound understanding of the waterways and rigorous public consultation; and, – development and implementation of a strategy that incorporates commitments from all levels of stakeholders. While focusing on our waterways, the Partnership’s approach includes addressing catchment management issues particularly relating to the management of diffuse pollution sources in both urban and rural landscapes as well as point source loads. We are now working with other stakeholders to develop a framework for integrated water management that will link water quality and water quantity goals and priorities.

On the distributed compression of quantum information

The problem of distributed compression for correlated quantum sources is considered. The classical version of this problem was solved by Slepian and Wolf, who showed that distributed compression could take full advantage of redundancy in the local sources created by the presence of correlations. Here it is shown that, in general, this is not the case for quantum sources, by proving a lower bound on the rate sum for irreducible sources of product states which is stronger than the one given by a naive application of Slepian-Wolf. Nonetheless, strategies taking advantage of correlation do exist for some special classes of quantum sources. For example, Devetak and Winter demonstrated the existence of such a strategy when one of the sources is classical. Optimal nontrivial strategies for a different extreme, sources of Bell states, are presented here. In addition, it is explained how distributed compression is connected to other problems in quantum information theory, including information-disturbance questions, entanglement distillation and quantum error correction.

Optimal control, geometry, and quantum computing

We prove upper and lower bounds relating the quantum gate complexity of a unitary operation, U, to the optimal control cost associated to the synthesis of U. These bounds apply for any optimal control problem, and can be used to show that the quantum gate complexity is essentially equivalent to the optimal control cost for a wide range of problems, including time-optimal control and finding minimal distances on certain Riemannian, sub-Riemannian, and Finslerian manifolds. These results generalize the results of [Nielsen, Dowling, Gu, and Doherty, Science 311, 1133 (2006)], which showed that the gate complexity can be related to distances on a Riemannian manifold.

Quantum computation as geometry

Quantum computers hold great promise for solving interesting computational problems, but it remains a challenge to find efficient quantum circuits that can perform these complicated tasks. Here we show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms or to prove limitations on the power of quantum computers.

Using context and preferences to implement self-adapting pervasive computing applications

Applications that exploit contextual information in order to adapt their behaviour to dynamically changing operating environments and user requirements are increasingly being explored as part of the vision of pervasive or ubiquitous computing. Despite recent advances in infrastructure to support these applications through the acquisition, interpretation and dissemination of context data from sensors, they remain prohibitively difficult to develop and have made little penetration beyond the laboratory. This situation persists largely due to a lack of appropriately high-level abstractions for describing, reasoning about and exploiting context information as a basis for adaptation. In this paper, we present our efforts to address this challenge, focusing on our novel approach involving the use of preference information as a basis for making flexible adaptation decisions. We also discuss our experiences in applying our conceptual and software frameworks for context and preference modelling to a case study involving the development of an adaptive communication application.

Disability's affect: Or, refugees, communication and community

Cultural theorists have given much attention recently to the notion of 'affect', yet such discussions have not seriously, if at all, raised the question of disability. However we would suggest that disability has very strong relationships with affect. In this paper we argue for the importance of rethinking affect and communication from the perspective of a critical, socio-political account of disability. To illustrate this, we look at affect and disability in two important cases of refugees in Australia.

Developing context-aware pervasive computing applications: Models and approach

There is growing interest in the use of context-awareness as a technique for developing pervasive computing applications that are flexible, adaptable, and capable of acting autonomously on behalf of users. However, context-awareness introduces a variety of software engineering challenges. In this paper, we address these challenges by proposing a set of conceptual models designed to support the software engineering process, including context modelling techniques, a preference model for representing context-dependent requirements, and two programming models. We also present a software infrastructure and software engineering process that can be used in conjunction with our models. Finally, we discuss a case study that demonstrates the strengths of our models and software engineering approach with respect to a set of software quality metrics.

Context-aware vertical handovers between WLAN and 3G networks

Vertical handovers can transform heterogeneous networks into an integrated communication environment. Such integration can lead to seamless communication if context information is used to support vertical handovers. Seamless communication environments are needed for future pervasive/ubiquitous systems, which are context aware and can adapt to context changes, including network disconnections, changes in network quality of service and changes in user preferences. This paper describes a generic, context-aware handover solution for multimedia applications and illustrates how this handover works for redirection of communication between WLANs and GPRS or UMTS networks. A description of a prototype for WLAN/GPRS handover and the results of handover experiments are also presented.

RSA-Grid: A grid computing based framework for power system reliability and security analysis

Grid computing is an emerging technology for providing the high performance computing capability and collaboration mechanism for solving the collaborated and complex problems while using the existing resources. In this paper, a grid computing based framework is proposed for the probabilistic based power system reliability and security analysis. The suggested name of this computing grid is Reliability and Security Grid (RSA-Grid). Then the architecture of this grid is presented. A prototype system has been built for further development of grid-based services for power systems reliability and security assessment based on probabilistic techniques, which require high performance computing and large amount of memory. Preliminary results based on prototype of this grid show that RSA-Grid can provide the comprehensive assessment results for real power systems efficiently and economically.