SPAnDX: a process-based population dynamics model to explore management and climate change impacts on an invasive alien plant, Acacia nilotica

This paper describes a process-based metapopulation dynamics and phenology model of prickly acacia, Acacia nilotica, an invasive alien species in Australia. The model, SPAnDX, describes the interactions between riparian and upland sub-populations of A. nilotica within livestock paddocks, including the effects of extrinsic factors such as temperature, soil moisture availability and atmospheric concentrations of carbon dioxide. The model includes the effects of management events such as changing the livestock species or stocking rate, applying fire, and herbicide application. The predicted population behaviour of A. nilotica was sensitive to climate. Using 35 years daily weather datasets for five representative sites spanning the range of conditions that A. nilotica is found in Australia, the model predicted biomass levels that closely accord with expected values at each site. SPAnDX can be used as a decision-support tool in integrated weed management, and to explore the sensitivity of cultural management practices to climate change throughout the range of A. nilotica. The cohort-based DYMEX modelling package used to build and run SPAnDX provided several advantages over more traditional population modelling approaches (e.g. an appropriate specific formalism (discrete time, cohort-based, process-oriented), user-friendly graphical environment, extensible library of reusable components, and useful and flexible input/output support framework). (C) 2003 Published by Elsevier Science B.V.

Quantifying the complexity of relative clause and cleft sentences

Explanations of the difficulty of relative-clause sentences implicate complexity but the measurement of complexity remains controversial. Four experiments investigated how far relational complexity (RC) theory, that has been found valid for cognitive development and human reasoning, accounts for the difficulty of 16 types of English, object- and subject-extracted relative-clause constructions. RC corresponds to the number of nouns assigned to thematic roles in the same decision. Complexity estimates based on RC and those based on maximal integration cost (MIC) were strongly correlated and accounted for similar variance in sentence difficulty (subjective ratings, comprehension accuracy, reading times). Consistent with RC theory, sentences that required more than 4 role assignments in the same decision were extremely difficult for many participants. Performance on nonlinguistic relational tasks predicted comprehension of object-extracted sentences, before and after controlling for subject-extractions. Working memory tasks predicted comprehension of object-extractions before controlling for subjectextractions. The studies extend the RC approach to a linguistic domain.

The role of animacy and definiteness in the clitic-DP nexus

We extend Cuervo's (2003) analysis of the Lower Applicative Dative DP in Spanish to account for the animate definite DP preceded by a and the fact that it is not possible to have both an animate dative definite direct object and a dative indirect object in the same clause. We argue that the presence of such a dative DP 'blocks' the upward movement of the direct object DP to the specifier of the Lower Applicative phrase. We analyse the case ‘mismatch’ between the third person accusative clitic and the co-referring dative DP with animate definite reference in River Plate Spanish as resulting from the raising of the accusative clitic to the head of the Applicative phrase and the movement of the DP to its specifier, where dative case is always assigned in Spanish. We propose that similar phenomena observed in some Australian languages are amenable to a similar analysis.

Rough Notes on Programming AVR Microcontrollers in C

These notes follow on from the material that you studied in CSSE1000 Introduction to Computer Systems. There you studied details of logic gates, binary numbers and instruction set architectures using the Atmel AVR microcontroller family as an example. In your present course (METR2800 Team Project I), you need to get on to designing and building an application which will include such a microcontroller. These notes focus on programming an AVR microcontroller in C and provide a number of example programs to illustrate the use of some of the AVR peripheral devices.

Simultaneous pooled auctions

Suppose a seller wants to sell k similar or identical objects and there are n > k potential buyers. Suppose that each buyer wants only one object. In this case, we suggest the use of a simultaneous auction that would work as follows. Players are asked to submit sealed bids for one object. The individual with the highest bid chooses an object first; the individual with the second-highest bid chooses the next object; and this process continues until the individual with the kth highest bid receives the last object. Each individual pays the equivalent to his or her bid. When objects are identical, we show that the proposed auction generates the same revenue as a first-price sealed-bid sequential auction. When objects are perfectly correlated, there is no known solution for sequential auctions, whereas we can characterize bidding strategies in the proposed auction. Moreover, the proposed auction is optimal (given an appropriately chosen reserve price), and it may be easier and cheaper to run than a sequential auction.

Reserve price commitments in auctions

It is well known that the optimal auction-one that maximizes the seller's expected revenue-can be implemented using a standard auction format with a suitably chosen reserve price. This reserve price is above the seller's value of retaining the object and the mechanism requires a commitment not to sell the object below the reserve. This commitment is what makes the reserve valuable to the seller. However, in practice, a reserve price commits the seller to sell the object if the reserve is reached, but does not commit her to withhold the object from sale if bidding falls short of the reserve. In this note we investigate whether reserve prices remain valuable for the seller when she may negotiate with the highest bidder if the reserve is not met. We show that the value of the reserve price may be completely undermined if the seller is a sufficiently weak bargainer. (c) 2004 Elsevier B.V. All rights reserved.

A simple rule of thumb for elegant prehension

Reaching out to grasp an object (prehension) is a deceptively elegant and skilled behavior. The movement prior to object contact can be described as having two components [1], the movement of the hand to an appropriate location for gripping the object, the transport component, and the opening and closing of the aperture between the fingers as they prepare to grip the target, the grasp component. The grasp component is sensitive to the size of the object, so that a larger grasp aperture is formed for wider objects [1]; the maximum grasp aperture (MGA) is a little wider than the width of the target object and occurs later in the movement for larger objects [1, 2]. We present a simple model that can account for the temporal relationship between the transport and grasp components, We report the results of an experiment providing empirical support for our rule of thumb. The model provides a simple, but plausible, account of a neural control strategy that has been the center of debate over the last two decades.

Entanglement creation using quantum interrogation

We present some applications of high-efficiency quantum interrogation (interaction-free measurement) for the creation of entangled states of separate atoms and of separate photons. The quantum interrogation of a quantum object in a superposition of object-in and object-out leaves the object and probe in an entangled state. The probe can then be further entangled with other objects in subsequent quantum interrogations. By then projecting out those cases in which the probe is left in a particular final state, the quantum objects can themselves be left in various entangled states. In this way, we show how to generate two-, three-, and higher-qubit entanglement between atoms and between photons. The effect of finite efficiency for the quantum interrogation is delineated for the various schemes.

Specification, refinement and verification of concurrent systems - An integration of Object-Z and CSP

This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of modelling complex data structures needed to define the component processes of such systems, and CSP enables the concise specification of process interactions. The basis of the integration is a semantics of Object-Z classes identical to that of CSP processes. This allows classes specified in Object-Z to he used directly within the CSP part of the specification. In addition to specification, we also discuss refinement and verification in this model. The common semantic basis enables a unified method of refinement to be used, based upon CSP refinement. To enable state-based techniques to be used fur the Object-Z components of a specification we develop state-based refinement relations which are sound and complete with respect to CSP refinement. In addition, a verification method for static and dynamic properties is presented. The method allows us to verify properties of the CSP system specification in terms of its component Object-Z classes by using the laws of the the CSP operators together with the logic for Object-Z.

Structural refinement of systems specified in object-z and CSP

This paper is concerned with methods for refinement of specifications written using a combination of Object-Z and CSP. Such a combination has proved to be a suitable vehicle for specifying complex systems which involve state and behaviour, and several proposals exist for integrating these two languages. The basis of the integration in this paper is a semantics of Object-Z classes identical to CSP processes. This allows classes specified in Object-Z to be combined using CSP operators. It has been shown that this semantic model allows state-based refinement relations to be used on the Object-Z components in an integrated Object-Z/CSP specification. However, the current refinement methodology does not allow the structure of a specification to be changed in a refinement, whereas a full methodology would, for example, allow concurrency to be introduced during the development life-cycle. In this paper, we tackle these concerns and discuss refinements of specifications written using Object-Z and CSP where we change the structure of the specification when performing the refinement. In particular, we develop a set of structural simulation rules which allow single components to be refined to more complex specifications involving CSP operators. The soundness of these rules is verified against the common semantic model and they are illustrated via a number of examples.