This paper will highlight the complicated political contexts that underpin discussions of intellectual property and Indigenous knowledge within Australia. On one level it aims to provide some contextual information about the development of new intellectual property strategies for protecting Indigenous knowledge. It seeks to respond to an increasing disjuncture: where international discussions d...

UWE has obtained warranties from all depositors as to their title in the material deposited and as to their right to deposit such material. UWE makes no representation or warranties of commercial utility, title, or fitness for a particular purpose or any other warranty, express or implied in respect of any material deposited. UWE makes no representation that the use of the materials will not in...

After the Agreement on the Trade-Related Aspects of Intellectual Property Rights (TRIPS) came into operation in 1995 developing countries have found themselves in a process of continual negotiation over intellectual property rights and access to medicines. These negotiations have taken place in the World Trade Organization and in the context of free trade agreements. The paper suggests that the...

• This work is protected by copyright and other intellectual property rights, which are retained by the thesis author, unless otherwise stated. • A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. • This thesis cannot be reproduced or quoted extensively from without first obtaining permission in writing from the author. • The content must...

in this paper, we introduce a notion of property (t) for a c∗-dynamical system (a, g, α) consisting of a unital c∗-algebra a,a locally compact group g, and an action α on a. as a result,we show that if a has strong property (t) and g has kazhdan’sproperty (t), then the triple (a, g, α) has property (t).

This article documents two programmatic comments regarding testing graph properties, which I made during the Dagstuhl workshop on Sublinear-Time Algorithms (July 2005). The first comment advocates paying more attention to the dependence of the tester’s complexity on the proximity parameter. The second comment advocates paying more attention to the question of testing general graphs (rather than...

We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving any answers. We call a property non-trivial if it does not depend only on the degree distribution of the nodes. We show that every tester for a non-trivial property that makes o ( √ n/d) queries to the input graph on n v...