Work at hand : an exploration of gesture in the context of work and everyday life to inform the design of gestural input devices

This research explores gestures used in the context of activities in the workplace and in everyday life in order to understand requirements and devise concepts for the design of gestural information applicances. A collaborative method of video interaction analysis devised to suit design explorations, the Video Card Game, was used to capture and analyse how gesture is used in the context of six different domains: the dentist's office; PDA and mobile phone use; the experimental biologist's laboratory; a city ferry service; a video cassette player repair shop; and a factory flowmeter assembly station. Findings are presented in the form of gestural themes, derived from the tradition of qualitative analysis but bearing some similarity to Alexandrian patterns. Implications for the design of gestural devices are discussed.

"Well, now I'm upset": Moral and social orders in the playground

There is much still to learn about how young children’s membership with peers shapes their constructions of moral and social obligations within everyday activities in the school playground. This paper investigates how a small group of girls, aged four to six years, account for their everyday social interactions in the playground. They were video-recorded as they participated in a pretend game of school. Several days later, a video-recorded excerpt of the interaction was shown to them and invited to comment on what was happening in the video. This conversation was audio-recorded. Drawing on a conversation analysis approach, this chapter shows that, despite their discontent and complaining about playing the game of school, the girls’ actions showed their continued orientation to the particular codes of the game, of ‘no going away’ and ‘no telling’. By making relevant these codes, jointly constructed by the girls during the interview, they managed each other’s continued participation within two arenas of action: the pretend, as a player in a pretend game of school; and the real, as a classroom member of a peer group. Through inferences to explicit and implicit codes of conduct, moral obligations were invoked as the girls attempted to socially exclude or build alliances with others, and enforce their own social position. As well, a shared history that the girls re-constructed has moral implications for present and future relationships. The girls oriented to the history as an interactional resource for accounting for their actions in the pretend game. This paper uncovers how children both participate in, and shape, their everyday social worlds through talk and interaction and the consequences a taken-for-granted activity such as playing school has for their moral and social positions in the peer group.

Experimenting with an intrusion detection system for encrypted networks

Network-based Intrusion Detection Systems (NIDSs) analyse network traffic to detect instances of malicious activity. Typically, this is only possible when the network traffic is accessible for analysis. With the growing use of Virtual Private Networks (VPNs) that encrypt network traffic, the NIDS can no longer access this crucial audit data. In this paper, we present an implementation and evaluation of our approach proposed in Goh et al. (2009). It is based on Shamir's secret-sharing scheme and allows a NIDS to function normally in a VPN without any modifications and without compromising the confidentiality afforded by the VPN.

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.

Port decoupling for small arrays by means of an eigenmode feed network

An alternative approach to port decoupling and matching of arrays with tightly coupled elements is proposed. The method is based on the inherent decoupling effect obtained by feeding the orthogonal eigenmodes of the array. For this purpose, a modal feed network is connected to the array. The decoupled external ports of the feed network may then be matched independently by using conventional matching circuits. Such a system may be used in digital beam forming applications with good signal-to-noise performance. The theory is applicable to arrays with an arbitrary number of elements, but implementation is only practical for smaller arrays. The principle is illustrated by means of two examples.

New modal feed network for a compact monopole array with isolated ports

An element spacing of less than half a wavelength introduces strong mutual coupling between the ports of compact antenna arrays. The strong coupling causes significant system performance degradation. A decoupling network may compensate for the mutual coupling. Alternatively, port decoupling can be achieved using a modal feed network. In response to an input signal at one of the input ports, this feed network excites the antenna elements in accordance with one of the eigenvectors of the array scattering parameter matrix. In this paper, a novel 4-element monopole array is described. The feed network of the array is implemented as a planar ring-type circuit in stripline with four coupled line sections. The new configuration offers a significant reduction in size, resulting in a very compact array.

An analysis of cyclists crashes to identify ITS-based intervention

Cycling provides a number of health and environmental benefits. However, cyclists are more likely to suffer serious injury or be killed in traffic accidents than car drivers and the estimated cost of crashes in Australia is $1.25AU billion per year. Current interventions to reduce bicycle crashes include compulsory helmet use, media campaigns, and the provision of cycling lanes, as well as road user education and training. It is difficult to assess the effectiveness of current interventions as there is no accurate measure of cyclist exposure in South East Queensland (SEQ). This paper analyses cyclist crash characteristics in Queensland with the view to identifying appropriate Intelligent Transport Systems (ITS) based intervention to reduce cyclist injury and death. The inappropriateness of some ITS interventions to improve cyclist safety is highlighted and a set of ITS interventions are identified, based on Queensland crash data 2002-2006.

Working sheep at 'Glen Shiel'

Working Sheep on 'Glen Shiel' is a key work of the author's exhibition Lightsite, which toured Western Australian galleries from February 2006 to November 2007. It is a five-minute-long exposure photographic image captured inside a purpose-built, room-sized pinhole camera which is demountable and does not have a floor. The work depicts octogenarian Ian Mangan who is both one of the first and last soldier settler farmers in the Gairdner-Jerramungup district in the Great Southern Region of Western Australia. Ian, his son, Stuart and Grandson Jacob, are preparing the last mob of sheep for sale before they move off their farm. The pinhole camera-room is sited amongst the sheep in the farm's sheep yards. Stuart and Jacob are depicted here standing amongst the sheep. The light from this exterior landscape is 'projected' inside the camera-room and illuminates the interior scene which includes that part of the sheep yards upon which the floorless room is erected, along with Ian who is standing motionless inside. The image evokes the temporality of light. Here, light itself is portrayed as the primary medium through which we both perceive and describe landscape. In this way it is through the agency of light that we construct our connectivity to landscape.

Single-layer decoupling networks for large circulant symmetric arrays

In this paper, the authors propose a new structure for the decoupling of circulant symmetric arrays of more than four elements. In this case, network element values are again obtained through a process of repeated eigenmode decoupling, here by solving sets of nonlinear equations. However, the resulting circuit is much simpler and can be implemented on a single layer. The corresponding circuit topology for the 6-element array is displayed in figure diagrams. The procedure will be illustrated by considering different examples.

Intrusion detection system for encrypted networks using secret-sharing schemes

Secret-sharing schemes describe methods to securely share a secret among a group of participants. A properly constructed secret-sharing scheme guarantees that the share belonging to one participant does not reveal anything about the shares of others or even the secret itself. Besides the obvious feature which is to distribute a secret, secret-sharing schemes have also been used in secure multi-party computations and redundant residue number systems for error correction codes. In this paper, we propose that the secret-sharing scheme be used as a primitive in a Network-based Intrusion Detection System (NIDS) to detect attacks in encrypted networks. Encrypted networks such as Virtual Private Networks (VPNs) fully encrypt network traffic which can include both malicious and non-malicious traffic. Traditional NIDS cannot monitor encrypted traffic. Our work uses a combination of Shamir's secret-sharing scheme and randomised network proxies to enable a traditional NIDS to function normally in a VPN environment. In this paper, we introduce a novel protocol that utilises a secret-sharing scheme to detect attacks in encrypted networks.

Automatic generation of assertions to detect potential security vulnerabilities in C programs that use union and pointer types

Type unions, pointer variables and function pointers are a long standing source of subtle security bugs in C program code. Their use can lead to hard-to-diagnose crashes or exploitable vulnerabilities that allow an attacker to attain privileged access over classified data. This paper describes an automatable framework for detecting such weaknesses in C programs statically, where possible, and for generating assertions that will detect them dynamically, in other cases. Exclusively based on analysis of the source code, it identifies required assertions using a type inference system supported by a custom made symbol table. In our preliminary findings, our type system was able to infer the correct type of unions in different scopes, without manual code annotations or rewriting. Whenever an evaluation is not possible or is difficult to resolve, appropriate runtime assertions are formed and inserted into the source code. The approach is demonstrated via a prototype C analysis tool.

Detecting attacks in encrypted networks using secret-sharing schemes

Secret-sharing schemes describe methods to securely share a secret among a group of participants. A properly constructed secret-sharing scheme guarantees that the share belonging to one participant does not reveal anything about the shares of others or even the secret itself. Besides being used to distribute a secret, secret-sharing schemes have also been used in secure multi-party computations and redundant residue number systems for error correction codes. In this paper, we propose that the secret-sharing scheme be used as a primitive in a Network-based Intrusion Detection System (NIDS) to detect attacks in encrypted Networks. Encrypted networks such as Virtual Private Networks (VPNs) fully encrypt network traffic which can include both malicious and non-malicious traffic. Traditional NIDS cannot monitor such encrypted traffic. We therefore describe how our work uses a combination of Shamir's secret-sharing scheme and randomised network proxies to enable a traditional NIDS to function normally in a VPN environment.

A Stochastic View of Optimal Regret through Minimax Duality

We study the regret of optimal strategies for online convex optimization games. Using von Neumann's minimax theorem, we show that the optimal regret in this adversarial setting is closely related to the behavior of the empirical minimization algorithm in a stochastic process setting: it is equal to the maximum, over joint distributions of the adversary's action sequence, of the difference between a sum of minimal expected losses and the minimal empirical loss. We show that the optimal regret has a natural geometric interpretation, since it can be viewed as the gap in Jensen's inequality for a concave functional--the minimizer over the player's actions of expected loss--defined on a set of probability distributions. We use this expression to obtain upper and lower bounds on the regret of an optimal strategy for a variety of online learning problems. Our method provides upper bounds without the need to construct a learning algorithm; the lower bounds provide explicit optimal strategies for the adversary. Peter L. Bartlett, Alexander Rakhlin

Design of decoupling networks for circulant symmetric antenna arrays

Small element spacing in compact arrays results in strong mutual coupling between array elements. Performance degradation associated with the strong coupling can be avoided through the introduction of a decoupling network consisting of interconnected reactive elements. We present a systematic design procedure for decoupling networks of symmetrical arrays with more than three elements and characterized by circulant scattering parameter matrices. The elements of the decoupling network are obtained through repeated decoupling of the characteristic eigenmodes of the array, which allows the calculation of element values using closed-form expressions.

Single-layer decoupling networks for circulant symmetric arrays

Reduced element spacing in antenna arrays gives rise to strong mutual coupling between array elements and may cause significant performance degradation. These effects can be alleviated by introducing a decoupling network consisting of interconnected reactive elements. The existing design approach for the synthesis of a decoupling network for circulant symmetric arrays allows calculation of element values using closed-form expressions, but the resulting circuit configuration requires multilayer technology for implementation. In this paper, a new structure for the decoupling of circulant symmetric arrays of more than four elements is presented. Element values are no longer obtained in closed form, but the resulting circuit is much simpler and can be implemented on a single layer.