The effect of piezoresistive microcantilever geometry on cantilever sensitivity during surface stress chemical sensing

We have designed, fabricated, and tested five piezoresistive cantilever configurations to investigate the effect of shape and piezoresistor placement on the sensitivity of microcantilevers under both point loading and surface stress loading. The experimental study reveals that: (1) high aspect ratio cantilevers that are much longer than they are wide are optimal for point-loading applications such as microscopy and force measurements; (2) low aspect ratio cantilevers that are short and wide are optimal for surface stress-loading scenarios such as those that occur in biological and chemical sensor applications. The sensitivity data for both point loads and surface stress are consistent with previously developed finite-element models.     

From Berman and Hafner’s teleological context to Baude and Sachs’ interpretive defaults: an ontological challenge for the next decades of AI and Law

This paper revisits the challenge of Berman and Hafner’s “missing link” paper on representing teleological structure in case-based legal reasoning. It is noted that this was mainly an ontological challenge to represent some of what made legal reasoning distinctive, which was given less attention than factual similarity in the dominant AI and Law paradigm, deriving from HYPO. The response to their paper is noted and briefly evaluated. A parallel is drawn to a new challenge to provide deep structure to the legal context of textual meaning, drawing on the forthcoming work of two Constitutional law scholars who appear to place some faith in the ways of thinking that AI and Law has developed.     

Reconstructing a Minimum Spanning Tree after Deletion of Any Node

Abstract. Updating a minimum spanning tree (MST) is a basic problem for communication networks. In this paper we consider single node deletions in MSTs. Let G=(V,E) be an undirected graph with n nodes and m edges, and let T be the MST of G . For each node v in V , the node replacement for v is the minimum weight set of edges R(v) that connect the components of T-v . We present a sequential algorithm and a parallel algorithm that find R(v) for all V simultaneously. The sequential algorithm takes O(m log n) time, but only O(m α (m,n)) time when the edges of E are presorted by weight. The parallel algorithm takes O(log ² n) time using m processors on a CREW PRAM.     

On time versus space III

Paul and Reischuk devised space efficient simulations of logarithmic cost random access machines and multidimensional Turing machines. We simplify their general space reduction technique and extend it to other computational models, including pointer machines, which model computations on graphs and data structures. Every pointer machine of time complexityT(n) can be simulated by a pointer machine of space complexityO(T(n)/logT(n)).     

The case for assembly language programming

A successful educational course on assembly language programming at the University of Illinois is described with particular emphasis on its pedagogical innovations, including the treatment of multitasking and the provision of library versions of subroutines. The course reinforces fundamental concepts of both data and control structures by illustrating their machine-level implementations. The machine problems provide experience with the design of large programs and with real-time data acquisition and control graphic devices     

On the worst case performance of buddy systems

Summary The worst-case performance of both binary and Fibonacci buddy systems is analyzed. For both unrestricted and allocation-only request sequences, exact bounds on both the external and total fragmentation are derived.Partially supported under NSF Grant MCS-8103713Partially supported under NSF Grant IST-8012242