1.1 INTRODUCTION An important component of parallel scientific computing is the assignment of work to processors. This assignment problem is also known as partitioning or mapping. The goal of the assignment problem is to find a task-to-processor mapping that will minimize the total execution time. Although efficient optimal solutions for certain restricted variations, such as chain-or tree-stru...

Consider a client who intends to perform a massive computing task comprsing a number of sub-tasks, while both storage and computation are outsourced by a third-party service provider. How could the client ensure the integrity and completeness of the computation result? Meanwhile, how could the assurance mechanism incur no disincentive, e.g., excessive communication cost, for any service provide...

Unconventional computers can perform embodied computation that can directly exploit the natural dynamics of the substrate. But such in materio devices are often limited, special purpose machines. To be practically useful, unconventional devices are usually be combined with classical computers or control systems. However, there is currently no established way to do this, or to combine different ...

Predictive legal analytics is a technology used to predict the chances of successful and unsuccessful outcomes in particular case. performed through automated document classification for facilitating experts their court documents retrieve understand details specific factors from judgments accurate analysis. However, extracting these texts time-consuming process. In order facilitate task classif...

This paper presents a programmable, energy-efficient and realtime object detection accelerator using deformable parts models (DPM), with 2x higher accuracy than traditional rigid body models. With 8 deformable parts detection, three methods are used to address the high computational complexity: classification pruning for 33x fewer parts classification, vector quantization for 15x memory size re...

We describe a metalanguage MMML, which makes explicit the order of evaluation (in the spirit of monadic metalanguages) and the staging of computations (as in languages for multi-level binding-time analysis). The operational semantics of MMML is very intuitive and consists of two parts: local (semantic preserving) simplification rules, and steps of computation executed in a deterministic order (...