Linking Agentive Objects in Mandarin Chinese

This paper is concerned with the problem of argument-function mismatch observed in the apparent subject-object inversion in Chinese consumption verbs, e.g., chi 'eat' and he 'drink', and accommodation verbs, e.g., zhu 'live' and shui 'sleep'. These verbs seem to allow the linking of [agent-SUBJ theme-OBJ] as well as [agent-OBJ theme-SUBJ], but only when the agent is also the semantic role denoting the measure or extent of the action. The account offered is formulated within LFG's lexical mapping theory. Under the simplest and also the strictest interpretation of the one-to-one argument-function mapping principle (or the theta-criterion), a composite role such as ag-ext receives syntactic assignment via one composing role only. One-to-one linking thus entails the suppression of the other composing role. Apparent subject-object inversion occurs when the more prominent agent role is suppressed and thus allows the less prominent extent role to dictate the linking of the entire ag-ext composite role. This LMT account also potentially facilitates a natural explanation of markedness among the competing syntactic structures.

Prosody of tone Sandhi in Vietnamese reduplications

In this paper we take advantage of the segmental control afforded by full and partial Vietnamese reduplication on a constant carrier phrase to obtain acoustic evidence of assymetrical prominence relations (van der Hulst 2005), in support of a hypothesis that Vietnamese reduplications are phonetically right headed and that tone sandhi is a reduction phenomenon occurring on prosodically weak positions (Shih 2005). Acoustic parameters of syllable duration (onset, nucleus and coda), F0 range, F0 contour, vowel intensity, spectral tilt and vowel formant structure are analyzed to determine: (1) which syllable of the two (base or reduplicant) is more prominent and (2) how the tone sandhi forms differ from their full reduplicated counterparts. Comparison of full and partial reduplicant syllables in tone sandhi forms provide additional support for this analysis.

Modal functions of future tenses in French

The paper disputes two influential claims in the Romance Linguistics literature. The first is that the synthetic future tenses in spoken Western Romance are now rivalled, if not supplanted, as temporal functors by the more recently developed GO futures. The second is that these synthetic futures now have modal rather than temporal meanings in spoken Romance. These claims are seen as reflecting a universal cycle of diachronic change, in which verb forms originally expressing modal (or aspectual) values take on future temporal reference, becoming tenses. The new modal meanings supplant the temporal, which are then taken up by new forms. Challenges to this theory for French are raised on the basis of empirical evidence of two sorts. Positively, future tenses in spoken Romance continue to be used with temporal meaning. Negatively, evidence of modal meaning for these forms is lacking. The evidence comes froma corpora of spoken French, native speaker judgements and verb data from a daily broadsheet. Cumulatively, it points to the reverse of the claims noted above: the synthetic future in spoken French has temporal but little modal meaning.

The predicate marker li in Mauritian Creole

There is a morpheme 'li' in Mauritian Creole (MC), which is homophonous with the 3sg pronoun, and which, in the early creole, occurs frequently between the subject and the predicate in affirmative, present tense clauses. I propose that that 'li' may have originated as a resumptive pronoun, co-referential with the subject, but following the grammaticalization of new determiner elements to mark the semantic contrasts of [±definite] and singular vs. plural, 'li' has now grammaticalized into a predicate marker. Its presence is sensitive to both the nature of the predicate, and to the definiteness and specificity features of the subject NP. My analysis is within the framework of Truth Conditional Semantics, where indefinite NPs are analyzed as variables that get introduced into the discourse, and must be bound by an operator to yield a closed proposition, with a truth value. Drawing on a comparison with a cognative morpheme 'i' in Seychellois Creole, I claim that its path to grammaticalization is linked to that of the specificity marking 'la'.

From possessive pronoun to emphatic determiner: 'so' in Mauritian Creole

This paper argues that at a particular stage in the genesis of Mauritian Creole (MC), the 3sg possessive pronoun 'so', inherited from the French 'son' was used as a definite determiner as well as a possessive pronoun. It was used when there was a need to single out a unique element in the discourse, or to introduce a new referent which was to become the focus of attention. 'So' was mostly used with genitive constructions, where a phonologically null determiner was equally grammatical. This paper argues that, in the early creole, genitive constructions licensed the determinative use of this pronoun. The use of 'so' with genitive constructions is no longer grammatical in modern MC, but this particle continues to be used as an emphatic determiner, where it now modifies both singular and plural NPs.

University of Queensland Working Papers in Linguistics

University of Queensland Working Papers in Linguistics is an opportunity to share and showcase ongoing research by staff, students, and associates of UQ’s Linguistics program, housed in the School of English, Media Studies, and Art History. This, the first volume, covers a number of topics ranging from formal syntactic theory to second language acquisition, and is representative of the broad spectrum of research that is carried out at The University of Queensland. While the papers herein represent works in progress, they have all been reviewed by two peer assessors, and revised in accordance with the assessors’ reports.

An assumption-driven case-specific model editor

A case sensitive intelligent model editor has been developed for constructing consistent lumped dynamic process models and for simplifying them using modelling assumptions. The approach is based on a systematic assumption-driven modelling procedure and on the syntax and semantics of process,models and the simplifying assumptions.

Structuring real-time Object-Z specifications

This paper presents a means of structuring specifications in real-time Object-Z: an integration of Object-Z with the timed refinement calculus. Incremental modification of classes using inheritance and composition of classes to form multi-component systems are examined. Two approaches to the latter are considered: using Object-Z's notion of object instantiation and introducing a parallel composition operator similar to those found in process algebras. The parallel composition operator approach is both more concise and allows more general modelling of concurrency. Its incorporation into the existing semantics of real-time Object-Z is presented.

Special issue: Selected papers from the sixth IFIP 2.6 working conference on visual database systems: Guest editors' introduction

While multimedia data, image data in particular, is an integral part of most websites and web documents, our quest for information so far is still restricted to text based search. To explore the World Wide Web more effectively, especially its rich repository of truly multimedia information, we are facing a number of challenging problems. Firstly, we face the ambiguous and highly subjective nature of defining image semantics and similarity. Secondly, multimedia data could come from highly diversified sources, as a result of automatic image capturing and generation processes. Finally, multimedia information exists in decentralised sources over the Web, making it difficult to use conventional content-based image retrieval (CBIR) techniques for effective and efficient search. In this special issue, we present a collection of five papers on visual and multimedia information management and retrieval topics, addressing some aspects of these challenges. These papers have been selected from the conference proceedings (Kluwer Academic Publishers, ISBN: 1-4020- 7060-8) of the Sixth IFIP 2.6 Working Conference on Visual Database Systems (VDB6), held in Brisbane, Australia, on 29–31 May 2002.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.