The Phoenix Court

Like the famed Phoenix, the United States Court of Appeals for the Federal Circuit rose on October 1, 1982, from the ashes of two former courts. On that day, the 127 year old United States Court of Claims and the 73 year old United States Court of Customs and Patent Appeals went out of existence, leaving a history of outstanding contributions to the administration of justice. Though every federal court serves the role on numerous occasions, the Court of Appeals for the Federal Circuit should in a special way earn the title of The Conscience of the Government. This article briefly discusses the operation of the new court and the role it will fill in the federal court system

The Illawarra at Work: A Summary of the Major Findings of the Illawarra Regional Workplace Industrial Relations Survey

This paper summarises the main results of the Illawarra Regional Workplace Industrial Relations Survey (IRWIRS). The data is unique in that it provides the only comprehensive and statistically reliable source of information about workplace employee relations at the regional level in Australia, and compares regional patterns with national trends. The data collected relates to industrial relations indicators, workplace ownership, market conditions, management organisation and decision- making in the workplace, among other things. The results reveal a positive pattern of employment relations in the Illawarra, distinctive in many respects from national trends.Illawarra Regional Workplace Industrial Relations Survey, workplace employee relations, Australia

On the Complexity of Temporal-Logic Path Checking

Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this task was recently shown to be in NC. In this paper, we present an NC algorithm for MTL, a quantitative (or metric) extension of LTL, and give an NCC algorithm for UTL, the unary fragment of LTL. At the time of writing, MTL is the most expressive logic with an NC path-checking algorithm, and UTL is the most expressive fragment of LTL with a more efficient path-checking algorithm than for full LTL (subject to standard complexity-theoretic assumptions). We then establish a connection between LTL path checking and planar circuits, which we exploit to show that any further progress in determining the precise complexity of LTL path checking would immediately entail more efficient evaluation algorithms than are known for a certain class of planar circuits. The connection further implies that the complexity of LTL path checking depends on the Boolean connectives allowed: adding Boolean exclusive or yields a temporal logic with P-complete path-checking problem

Reconstitution of a lost original via earliest distribution: Die Sächsische Weltchronik

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/43311/1/11061_2005_Article_BF01512362.pd