Networks of workstations (NOWs) are being considered as a costeffective alternative to parallel computers. Many NOWs are arranged as a switchbased network with irregular topology, which makes routing and deadlock avoidance quite complicated. Current proposals use the up∗/down∗ routing algorithm to remove cyclic dependencies between channels and avoid deadlock. Recently, a simple and effective m...

Association rule mining is an important data mining problem. It is found to be useful for conventional relational data. However, previous work has mostly targeted on mining a single table. In real life, a database is typically made up of multiple tables and one important case is where some of the tables form a star schema. The tables typically correspond to entity sets and joining the tables in...

We propose a privacy-preserving protocol for computing aggregation queries over the join of private tables. In this problem, several parties wish to share aggregated information over the join of their tables, but want to conceal the details that generate such information. The join operation presents a challenge to privacy preservation because it requires matching individual records from private...

We propose a privacy-preserving protocol for computing aggregation queries over the join of private tables. In this problem, several parties wish to share aggregated information over the join of their tables, but want to conceal the details that generate such information. The join operation presents a challenge to privacy preservation because it requires matching individual records from private...

A new methodology is introduced for comparing the structures of several contingency tables. The latter, built up from di6erent samples or populations, present the same rows and di6erent columns (or vice versa). This methodology combines some aspects of principal axes methods (global maximum dispersion axes), canonical correlation techniques (canonical dispersion axes) and Procrustes analysis (s...

Field-programmable gate arrays (FPGAs) are nonconventional processors built almost entirely out of lookup tables. In particular, FPGAs contain grids of logic blocks, connected by a grid of wires with programmable connections. Each logic block has one or more lookup tables and several bits of memory. As a result, logic blocks can implement arbitrary logic functions (up to a few bits), or be comb...

Information infrastructures become increasingly decentralized. In these environments, coming up with coherent collective decision systems is difficult, especially in environments where central “authorities” are lacking. In this paper, we explore the idea of using artifacts called Blackboards for Decision Tables to support collaborative and incremental evolution of a network of Semantic Decision...

Basic components of Provider Backbone Bridge (PBB) network models were constructed: PBB interior switch, PBB edge switch—with the dynamic filling up of address tables. The modeling of PBB networks was implemented. The results of simulation reveal definite imperfections of PBB technology caused by the broadcasting and sensitivity to the ageing time of the address tables’ records, which complicat...

We present an algorithm that recognizes tables in document images and extracts their structural information. We use region growing to locate bounding boxes around text, and cluster them into columns by examining spatial relationships between bounding boxes and their vertical neighbors. Once initial clustering is complete, a series of post-processing steps are applied to the clusters to find col...