The New Market for Federal Judicial Law Clerks

In the past, judges have often hired applicants for judicial clerkships as early as the beginning of the second year of law school for positions commencing approximately two years down the road. In the new hiring regime for federal judicial law clerks, by contrast, judges are exhorted to follow a set of start dates for considering and hiring applicants during the fall of the third year of law school. Using the same general methodology as we employed in a study of the market for federal judicial law clerks conducted in 1998-2000, we have broadly surveyed both federal appellate judges and law students about their experiences of the new market for law clerks. This paper analyzes our findings within the prevailing economic framework for studying markets with tendencies toward "early" hiring. Our data make clear that the movement of the clerkship market back to the third year of law school is highly valued by judges, but we also find that a strong majority of the judges responding to our surveys has concluded that nonadherence to the specified start dates is very substantial -- a conclusion we are able to corroborate with specific quantitative data from both judge and student surveys. The consistent experience of a wide range of other markets suggests that such nonadherence in the law clerk market will lead to either a reversion to very early hiring or the use of a centralized matching system such as that used for medical residencies. We suggest, however, potential avenues by which the clerkship market could stabilize at something like its present pattern of mixed adherence and nonadherence, thereby avoiding the complete abandonment of the current system.

Byzantine Fault Tolerance for Nondeterministic Applications

All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency. To the best of our knowledge, only the most simplistic types of replica nondeterminism have been dealt with. Furthermore, there lacks a systematic approach to handling common types of nondeterminism. In this paper, we propose a classification of common types of replica nondeterminism with respect to the requirement of achieving Byzantine fault tolerance, and describe the design and implementation of the core mechanisms necessary to handle such nondeterminism within a Byzantine fault tolerance framework.Comment: To appear in the proceedings of the 3rd IEEE International Symposium on Dependable, Autonomic and Secure Computing, 200

Hierarchical Parallelisation of Functional Renormalisation Group Calculations -- hp-fRG

The functional renormalisation group (fRG) has evolved into a versatile tool in condensed matter theory for studying important aspects of correlated electron systems. Practical applications of the method often involve a high numerical effort, motivating the question in how far High Performance Computing (HPC) can leverage the approach. In this work we report on a multi-level parallelisation of the underlying computational machinery and show that this can speed up the code by several orders of magnitude. This in turn can extend the applicability of the method to otherwise inaccessible cases. We exploit three levels of parallelisation: Distributed computing by means of Message Passing (MPI), shared-memory computing using OpenMP, and vectorisation by means of SIMD units (single-instruction-multiple-data). Results are provided for two distinct High Performance Computing (HPC) platforms, namely the IBM-based BlueGene/Q system JUQUEEN and an Intel Sandy-Bridge-based development cluster. We discuss how certain issues and obstacles were overcome in the course of adapting the code. Most importantly, we conclude that this vast improvement can actually be accomplished by introducing only moderate changes to the code, such that this strategy may serve as a guideline for other researcher to likewise improve the efficiency of their codes

Enhancing Creativity in Interaction Design: Alternative Design Brief

This paper offers a critique of the design brief as it is currently used in teaching interaction design and proposes an alternative way of developing it. Such a design brief requires the exploration of alternative application domains for an already developed technology. The paper presents a case study where such a novel type of design brief has been offered to the students taking part in a collaborative design project and discusses how it supported divergent thinking and creativity as well as helped enhancing the learning objectives

Progress in AI Planning Research and Applications

Planning has made significant progress since its inception in the 1970s, in terms both of the efficiency and sophistication of its algorithms and representations and its potential for application to real problems. In this paper we sketch the foundations of planning as a sub-field of Artificial Intelligence and the history of its development over the past three decades. Then some of the recent achievements within the field are discussed and provided some experimental data demonstrating the progress that has been made in the application of general planners to realistic and complex problems. The paper concludes by identifying some of the open issues that remain as important challenges for future research in planning