user interface for specifying interested regions in cases of occlusions when handling volumetric data or video sequences. Experiments on a variety of datasets, including images (up to 15K × 10K), videos (up to 2.5K × 1.5K × 50), and volumetric data, achieve high quality results and a maximum 164-fold

. In this paper, we propose a novel algorithm for buffer insertion to consider process variations. The major contribution of this work is two-fold: (1) an efficient technique to handle correlated process variations under nonlinear operations; (2) a provable transitive closure pruning rule that makes linear

for the ligand. An average 4–5-fold speed-up in docking times and a similar success rate is estimated with respect to the standard DOCK protocol.

. We find that up to 32 processors can fit on an XC2V6000 FPGA. Using this device, the computational kernel of the machine learning system Progol, when applied to common bioinformatics data sets for learning to identify mutagenesis and protein folds, can yield speedups of up to 15 times over software

membranes. Altogether, ∼1.5 μs simulations were performed on three systems: a pure POPC bilayer, a pure DMPC bilayer, and a mixed POPC:DMPC bilayer. Overall, the aMD simulations are found to produce significant speedup in trans gauche isomerization and lipid lateral diffusion versus those in conventional MD

.1 seconds to reconstruct a 5123-voxel volume from 360 5122-pixel projection images. This execution time is equivalent to a 15.6-fold speedup over a CPU implementation, showing 10% higher performance as compared with a previous OpenGL-based method that requires the single-slice rebinning of projections

Abstract. This paper analyzes the expected performance of a simplied version BM 0 of the Boyer{Moore string matching algorithm. A probabilistic automaton A is set up which models the expected behavior of BM 0 under the assumption that both text and pattern are generated by a source which emits independent and uncorrelated symbols with an arbitrary distribution of probabilities. Formal developments lead then to the conclusion that A takes expected sublinear time in a variety of situations. The sublinear behavior can be quantitatively predicted by simple formulae involving the pattern length m and the alphabet's probabilistic properties. Finally, empirical evidence is provided which is in satisfactory accordance with the theory.

Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real-world network traffic is largely legitimate and that telltales manifested by exploits rarely appear in network streams lead us to the proposal of Fingerprinter. This framework integrates fingerprinting and PM methods to rapidly distinguish well-behaved from malicious traffic. Fingerprinter produces concise digests or fingerprints for attack signatures during its programming phase. In its querying phase, the framework quickly identifies attack-free connections by transforming input traffic into its fingerprint space and matching its digest against those of attack signatures. If the legitimacy of a stream cannot be determined by fingerprints alone, our framework uses the Boyer–Moore algorithm to ascertain whether attack signatures appear in the stream. To reduce false matches, we resort to multiple fingerprinting techniques including Bloom–Filter and Rabin–Fingerprint. Experimentation with a prototype and a variety of traces has helped us establish that Fingerprinter significantly accelerates the attack detection process.

Algebraic cryptanalysis of the round-reduced and side channel analysis of the full PRINTCipher-48

together with superscalar kernels produce new algorithms that give 10-fold speedups compared to existing routines in the SLICOT and LAPACK libraries. We show that our recursive algorithms also have a significant impact on the execution time of solving unreduced problems and when used in condition