Assisting decision-making in Queensland barley production through chance constrained programming

A chance constrained programming model is developed to assist Queensland barley growers make varietal and agronomic decisions in the face of changing product demands and volatile production conditions. Unsuitable or overlooked in many risk programming applications, the chance constrained programming approach nonetheless aptly captures the single-stage decision problem faced by barley growers of whether to plant lower-yielding but potentially higher-priced malting varieties, given a particular expectation of meeting malting grade standards. Different expectations greatly affect the optimal mix of malting and feed barley activities. The analysis highlights the suitability of chance constrained programming to this specific class of farm decision problem.

Risk attitude, planting conditions and the value of seasonal forecasts to a dryland wheat grower

The value of a seasonal forecasting system based on phases of the Southern Oscillation was estimated for a representative dryland wheat grower in the vicinity of Goondiwindi. In particular the effects on this estimate of risk attitude and planting conditions were examined. A recursive stochastic programming approach was used to identify the grower's utility-maximising action set in the event of each of the climate patterns over the period 1894-1991 recurring In the imminent season. The approach was repeated with and without use of the forecasts. The choices examined were, at planting, nitrogen application rate and cultivar and, later in the season, choices of proceeding with or abandoning each wheat activity, The value of the forecasting system was estimated as the maximum amount the grower could afford to pay for its use without expected utility being lowered relative to its non use.

Formal methods within a totally functional approach to programming

Taking functional programming to its extremities in search of simplicity still requires integration with other development (e.g. formal) methods. Induction is the key to deriving and verifying functional programs, but can be simplified through packaging proofs with functions, particularly folds, on data (structures). Totally Functional Programming avoids the complexities of interpretation by directly representing data (structures) as platonic combinators - the functions characteristic to the data. The link between the two simplifications is that platonic combinators are a kind of partially-applied fold, which means that platonic combinators inherit fold-theoretic properties, but with some apparent simplifications due to the platonic combinator representation. However, despite observable behaviour within functional programming that suggests that TFP is widely-applicable, significant work remains before TFP as such could be widely adopted.

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.

Nurturing communication by health professionals toward patients: A communication accommodation theory approach

This study explores the role of nurturing communication in distinguishing interpersonal and intergroup interactions between health professionals and patients, from the perspective of communication accommodation theory (CAT). Participants (47 men and 87 women) rated videotapes of actual hospital consultations on 12 goal and 16 strategy items derived from CAT. Health professionals in interpersonal interactions were perceived to pay more attention to relationship and emotional needs and to use more nurturant discourse management and emotional expression. These results point the way toward elucidating the perceived optimal balance in accommodative behavior, both group based and interpersonal, in these contexts, and they highlight the importance of nurturant communication to this process.

Optimal release strategies for biological control agents: an application of stochastic dynamic programming to population management

1. Establishing biological control agents in the field is a major step in any classical biocontrol programme, yet there are few general guidelines to help the practitioner decide what factors might enhance the establishment of such agents. 2. A stochastic dynamic programming (SDP) approach, linked to a metapopulation model, was used to find optimal release strategies (number and size of releases), given constraints on time and the number of biocontrol agents available. By modelling within a decision-making framework we derived rules of thumb that will enable biocontrol workers to choose between management options, depending on the current state of the system. 3. When there are few well-established sites, making a few large releases is the optimal strategy. For other states of the system, the optimal strategy ranges from a few large releases, through a mixed strategy (a variety of release sizes), to many small releases, as the probability of establishment of smaller inocula increases. 4. Given that the probability of establishment is rarely a known entity, we also strongly recommend a mixed strategy in the early stages of a release programme, to accelerate learning and improve the chances of finding the optimal approach.

Technical, allocative, cost and scale efficiencies in Bangladesh rice cultivation: A non-parametric approach

Applying programming techniques to detailed data for 406 rice farms in 21 villages, for 1997, produces inefficiency measures, which differ substantially from the results of simple yield and unit cost measures. For the Boro (dry) season, mean technical efficiency was efficiency was 56.2 per cent and 69.4 per cent, allocative efficiency was 81.3 per cent, cost efficiency was 56.2 per cent and scale efficiency 94.9 per cent. The Aman (wet) season results are similar, but a few points lower. Allocative inefficiency is due to overuse of labour, suggesting population pressure, and of fertiliser, where recommended rates may warrant revision. Second-stage regressions show that large families are more inefficient, whereas farmers with better access to input markets, and those who do less off-farm work, tend to be more efficient. The information on the sources of inter-farm performance differentials could be used by the extension agents to help inefficient farmers. There is little excuse for such sub-optimal use of survey data, which are often collected at substantial costs.

Visual Biology of Hawaiian Coral Reef Fishes. III. Environmental Light and an Integrated Approach to the Ecology of Reef Fish Vision

In the previous two papers in this three-part series, we have examined visual pigments, ocular media transmission, and colors of the coral reef fish of Hawaii. This paper first details aspects of the light field and background colors at the microhabitat level on Hawaiian reefs and does so from the perspective and scale of fish living on the reef. Second, information from all three papers is combined in an attempt to examine trends in the visual ecology of reef inhabitants. Our goal is to begin to see fish the way they appear to other fish. Observations resulting from the combination of results in all three papers include the following. Yellow and blue colors on their own are strikingly well matched to backgrounds on the reef such as coral and bodies of horizontally viewed water. These colors, therefore, depending on context, may be important in camouflage as well as conspicuousness. The spectral characteristics of fish colors are correlated to the known spectral sensitivities in reef fish single cones and are tuned for maximum signal reliability when viewed against known backgrounds. The optimal positions of spectral sensitivity in a modeled dichromatic visual system are generally close to the sensitivities known for reef fish. Models also predict that both UV-sensitive and red-sensitive cone types are advantageous for a variety of tasks. UV-sensitive cones are known in some reef fish, red-sensitive cones have yet to be found. Labroid colors, which appear green or blue to us, may he matched to the far-red component of chlorophyll reflectance for camouflage. Red cave/hole dwelling reef fish are relatively poorly matched to the background they are often viewed against but this may be visually irrelevant. The model predicts that the task of distinguishing green algae from coral is optimized with a relatively long wavelength visual pigment pair. Herbivorous grazers whose visual pigments are known possess the longest sensitivities so far found. Labroid complex colors are highly contrasting complementary colors close up but combine, because of the spatial addition, which results from low visual resolution, at distance, to match background water colors remarkably well. Therefore, they are effective for simultaneous communication and camouflage.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 1. Methodology for residual generation

For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.

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.

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.

The moderating effects of goal orientations on reactions to goal-performance discrepancies

Due to the growing popularity of goal setting programs within organisations, an understanding of the mechanisms underlying the dynamic regulation of performance is paramount (Williams, Donovan, & Dodge, 2000). Goals serve as standards or referents by which behaviour is directed and evaluated. Whilst their importance is well established in the existing literature (e.g. Locke & Latham, 1990), more recent research has highlighted the potential importance of goal-performance discrepancies. Moreover, the relationship between goal-performance discrepancies and outcomes such as self-efficacy and personal goals appears to vary between people (Schmidt & Chambers, 2002). Of interest in the current study was how these relationships were impacted by goal orientation. Ninety-seven participants completed 30 two-minute trials of an Air Traffic Control task. Task specific goal orientation was measured prior to commencement of the task and measures of self-efficacy and personal task goals were taken at each trial to assess the within-person relationships between goal performance discrepancies and each of these dependant variables, as well as the moderating effects of goal orientations on these relationships. Analysis supported the existence of a positive relationship between goal-performance discrepancies and outcome variables, with performance-approach and –avoidance orientations significantly moderating these associations. Implications and future directions are discussed.

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE

The effects of domain-specific avoid and prove goal orientations on performance: A multilevel analysis

Recently, goal orientation, a mental framework for understanding how individuals approach learning and achievement situadons, has emerged as an important predictor of performance. This study addressed the effects of domain-specific avoid and prove orientations on performance from the betweenand within-person levels of analysis. One hundred and three participants performed thirty trials of an airtraffic control task. Domain-specific avoid and prove orientations were measured before each trial to assess the effects of changes in goal orientadon on changes in performance (i.e. within-person relationships). Average levels of avoid and prove orientations were calculated to assess the effect of goal orientation on overall performance (i.e. between-person relationships). Findings from the between-person level of analysis revealed that high prove-orientated individuals performed better than low proveorientated individuals. Results also revealed that average goal orientation levels moderated the withinperson relationships. The effect of changes in avoid orientation on changes in performance was stronger for low versus high avoid-oriented individuals while the effect of changes in prove orientadon on changes in performances was stronger for low versus highprove oriented individuals. Implications of these findings are considered.

Goal orientation, ability and task performance: A moderated analysis

Achievement goal orientation represents an individual's general approach to an achievement situation, and has important implications for how individuals react to novel, challenging tasks. However, theorists such as Yeo and Neal (2004) have suggested that the effects of goal orientation may emerge over time. Bell and Kozlowski (2002) have further argued that these effects may be moderated by individual ability. The current study tested the dynamic effects of a new 2x2 model of goal orientation (mastery/performance x approach/avoidance) on performance on a simulated air traffic control (ATC) task, as moderated by dynamic spatial ability. One hundred and one first-year participants completed a self-report goal orientation measure and computerbased dynamic spatial ability test and performed 30 trials of an ATC task. Hypotheses were tested using a two-level hierarchical linear model. Mastery-approach orientation was positively related to task performance, although no interaction with ability was observed. Performance-avoidance orientation was negatively related to task performance; this association was weaker at high levels of ability. Theoretical and practical implications will be discussed.