Theoretical frameworks for analysing turn-based computer strategy games

This paper argues for a more specific formal methodology for the textual analysis of individual game genres. In doing so, it advances a set of formal analytical tools and a theoretical framework for the analysis of turn-based computer strategy games. The analytical tools extend the useful work of Steven Poole, who suggests a Peircian semiotic approach to the study of games as formal systems. The theoretical framework draws upon postmodern cultural theory to analyse and explain the representation of space and the organisation of knowledge in these games. The methodology and theoretical framework is supported by a textual analysis of Civilization II, a significant and influential turn-based computer strategy game. Finally, this paper suggests possibilities for future extensions of this work.

Measuring market power in electricity generation: A long-term perspective using a programming model

This paper focuses on measuring the extent to which market power has been exercised in a recently deregulated electricity generation sector. Our study emphasises the need to consider the concept of market power in a long-run dynamic context. A market power index is constructed focusing on differences between actual market returns and long-run competitive returns, estimated using a programming model devised by the authors. The market power implications of hedge contracts are briefly considered. The state of Queensland Australia is used as a context for the analysis. The results suggest that generators have exercised significant market power since deregulation.

Conceptualizing special interest tourism - frameworks for analysis

To advance understanding of Special Interest Tourism (SIT), this paper will explore the complexities of this phenomenon in the early 21st century. First, a look at what is out there, both from a supply and demand perspective, will serve to paint a broad picture at macro-level. The paper will present a discussion of the SIT phenomenon at the macro-level within a triangular relationship of supply, demand and media. Then, a more specific look at SIT attempts to clarify the ambiguity of the term. Finally, a look at micro-level from the consumer's perspective will introduce the concepts of enduring and situational involvement, and the nature of the product. Proposed frameworks are presented to provide structure and possible directions for future research and as a means of progressing conceptual development. (c) 2004 Elsevier Ltd. All rights reserved.

Stochastic dynamic programming for election timing: A game theory approach

In this paper, we consider dynamic programming for the election timing in the majoritarian parliamentary system such as in Australia, where the government has a constitutional right to call an early election. This right can give the government an advantage to remain in power for as long as possible by calling an election, when its popularity is high. On the other hand, the opposition's natural objective is to gain power, and it will apply controls termed as "boosts" to reduce the chance of the government being re-elected by introducing policy and economic responses. In this paper, we explore equilibrium solutions to the government, and the opposition strategies in a political game using stochastic dynamic programming. Results are given in terms of the expected remaining life in power, call and boost probabilities at each time at any level of popularity.

Electrostatically mediated specific adsorption of small molecules in metallo-organic frameworks

We investigate the interaction of ethylene and ethane with a Cu-tricarboxylate complex and show that at low loadings the lighter molecule has a higher binding energy as a result of an increased interaction with the framework Cu and stronger hydrogen bonding with the basic framework oxygens. This leads to selective adsorption of ethylene by a factor of about 2 at low pressure, which is overcome by the stronger van der Waals interaction of ethane at high loadings, explaining recent literature data. The results suggest the possibility of separation of light hydrocarbons at low pressures or in trace amounts.

Embedding defeasible logic into logic programming

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

Conceptual Frameworks for SIA Revisited: a cumulative effects study on lead contamination and economic change

This article trials three conceptual frameworks on an Australian case study of a small remote city suffering lead contamination, with cumulative effects from concurrent economic change due to downsizing in the mining industry. It interprets the usefulness of these frameworks, and explores two questions: can they apply to circumstances other than project assessment, and what are their relative merits as guides to SIA? All the frameworks reviewed can be used in non-project and cumulative SIA, although, if they had been used to predict the impacts in our case study, we may easily have been misled as to the resilience of the community. Choosing among these frameworks becomes a matter personal preference: each has different merits.

Fast stereo matching by iterated dynamic programming and quadtree subregioning

The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a few seconds of computation. In this paper, we present our iterated dynamic programming algorithm along with a quadtree subregioning process for fast stereo matching.

An approach to specifying software frameworks

A framework is a reusable design that requires software components to function. To instantiate a framework, a software engineer must provide the software components required by the framework. To do this effectively, the framework-component interfaces must be specified so the software engineer knows what assumptions the framework makes about the components, and so the components can be verified against these assumptions. This paper presents an approach to specifying software frameworks. The approach involves the specification of the framework’s syntax, semantics, and the interfaces between the framework and its components. The approach is demonstrated with a simple case study.

Obstacles to a totally functional programming style

"Totally functional programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practice in language extensibility and functional programming. Its technical essence extends the role of "fold" functions in structuring functional programs to include methods that make comparisons on elements of data structures. The obstacles that currently prevent the immediate uptake of TFP as a style within functional programming equally indicate future research directions in the areas of theoretical foundations, supporting technical infrastructure, demonstrated practical applicability, and relationship to OOP.