. The Caltech Mosaic was an experiment to "push the envelope " of multicomputer design and programming toward a system with up to tens of thousands of small, single-chip nodes rather than hundreds of circuit-board-size nodes. The fine-grain multicomputer places more extreme demands

that require on the order of 100 seconds to render typical data sets on a workstation. Algorithms with optimizations that exploit coherence in the data have reduced rendering times to the range of ten seconds but are still not fast enough for interactive visualization applications. In this thesis we present a

problems are represented by a set of binary classifiers using different output coding schemes. While regularization is used to control the effective number of parameters of the LS-SVM classifier, the sparseness property of SVMs is lost due to the choice of the 2-norm. Sparseness can be imposed in a second

, which we call zones to avoid confusion, and associates attributes with each zone. Unlike DNS, zones are not bound to specific servers, the attributes may be highly dynamic, and updates propagate quickly; typically, in tens of seconds

this paper will describe the configuration that not only delivered over 3500 transactions per second, but was able to fail over in less than ten seconds and continue to deliver the same level of transaction throughput. This study was not an in-house demonstration of availability. Rather, this test

Remote sensing from satellite or airborne platforms of land or sea surfaces in the visible and near infrared is strongly affected by the presence of the atmosphere along the path from Sun to Target (surface) to Sensor. This paper presents 6S (Second Simulation of the Satellite Signal in the Solar

that use human tTG as antigen have recently become available. We evaluated commercially available assays with human tTG antigen to estimate their diagnostic accuracies and to determine whether they agree suffi-ciently to be used interchangeably. Methods: Ten commercially available second

but the memory requirements and complexity of existing interior point methods are prohibitive for problems with more than tens of nodes. We present two new algorithms for solving problems with at least a thousand nodes in the Gaussian case. Our first algorithm uses block coordinate descent, and can

that achieves near-capacity at sum rates of tens of bits/channel use. The algorithm is a variation on channel inversion that regularizes the inverse and uses a “sphere encoder ” to perturb the data to reduce the power of the transmitted signal. This paper is comprised of two parts. In this first part, we show

, it is feasible to construct systems with aggregate capacities of tens of terabits per second and that e ciently support highly dynamic data communication applications with individual channel rates of 10 Gb/s. The integrated architectures allow greater scalability and superior performance, but their viability