Search results for "Scheme"
showing 10 items of 527 documents
AnySeq: A High Performance Sequence Alignment Library based on Partial Evaluation
2020
Sequence alignments are fundamental to bioinformatics which has resulted in a variety of optimized implementations. Unfortunately, the vast majority of them are hand-tuned and specific to certain architectures and execution models. This not only makes them challenging to understand and extend, but also difficult to port to other platforms. We present AnySeq - a novel library for computing different types of pairwise alignments of DNA sequences. Our approach combines high performance with an intuitively understandable implementation, which is achieved through the concept of partial evaluation. Using the AnyDSL compiler framework, AnySeq enables the compilation of algorithmic variants that ar…
Hybrid blind robust image watermarking technique based on DFT-DCT and Arnold transform
2018
In this paper, a robust blind image watermarking method is proposed for copyright protection of digital images. This hybrid method relies on combining two well-known transforms that are the discrete Fourier transform (DFT) and the discrete cosine transform (DCT). The motivation behind this combination is to enhance the imperceptibility and the robustness. The imperceptibility requirement is achieved by using magnitudes of DFT coefficients while the robustness improvement is ensured by applying DCT to the DFT coefficients magnitude. The watermark is embedded by modifying the coefficients of the middle band of the DCT using a secret key. The security of the proposed method is enhanced by appl…
The rightmost equal-cost position problem.
2013
LZ77-based compression schemes compress the input text by replacing factors in the text with an encoded reference to a previous occurrence formed by the couple (length, offset). For a given factor, the smallest is the offset, the smallest is the resulting compression ratio. This is optimally achieved by using the rightmost occurrence of a factor in the previous text. Given a cost function, for instance the minimum number of bits used to represent an integer, we define the Rightmost Equal-Cost Position (REP) problem as the problem of finding one of the occurrences of a factor whose cost is equal to the cost of the rightmost one. We present the Multi-Layer Suffix Tree data structure that, for…
WarpCore: A Library for fast Hash Tables on GPUs
2020
Hash tables are ubiquitous. Properties such as an amortized constant time complexity for insertion and querying as well as a compact memory layout make them versatile associative data structures with manifold applications. The rapidly growing amount of data emerging in many fields motivated the need for accelerated hash tables designed for modern parallel architectures. In this work, we exploit the fast memory interface of modern GPUs together with a parallel hashing scheme tailored to improve global memory access patterns, to design WarpCore -- a versatile library of hash table data structures. Unique device-sided operations allow for building high performance data processing pipelines ent…
Blockchain-Based Proof of Location
2016
Location-Based Services (LBSs) build upon geographic information to provide users with location-dependent functionalities. In such a context, it is particularly important that geographic locations claimed by users are trustworthy. Centralized verification approaches proposed in the last few years are not satisfactory, as they entail a high risk to the privacy of users. In this paper, we present and evaluate a novel decentralized, infrastructure-independent proof-of-location scheme based on blockchain technology. Our scheme guarantees both location trustworthiness and user privacy preservation.
Progressive Stochastic Binarization of Deep Networks
2019
A plethora of recent research has focused on improving the memory footprint and inference speed of deep networks by reducing the complexity of (i) numerical representations (for example, by deterministic or stochastic quantization) and (ii) arithmetic operations (for example, by binarization of weights). We propose a stochastic binarization scheme for deep networks that allows for efficient inference on hardware by restricting itself to additions of small integers and fixed shifts. Unlike previous approaches, the underlying randomized approximation is progressive, thus permitting an adaptive control of the accuracy of each operation at run-time. In a low-precision setting, we match the accu…
MAC Design for WiFi Infrastructure Networks: A Game-Theoretic Approach
2011
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios because of non-standard configurations of the nodes. Due to the proliferation of open source drivers and programmable cards, enabling an easy customization of the channel access policies, we propose a game-theoretic analysis of random access schemes. Assuming that each node is rational and implements a best response strategy, we show that…
Simple algorithms for calculation of the axial‐symmetric heat transport problem in a cylinder
2001
The approximation of axial‐symmetric heat transport problem in a cylinder is based on the finite volume method. In the classical formulation of the finite volume method it is assumed that the flux terms in the control volume are approximated with the finite difference expressions. Then in the 1‐D case the corresponding finite difference scheme for the given source function is not exact. There we propose the exact difference scheme. In 2‐D case the corresponding integrals are approximated using different quadrature formulae. This procedure allows one to reduce the heat transport problem described by a partial differential equation to an initial‐value problem for a system of two ordinary diff…
A fully adaptive wavelet algorithm for parabolic partial differential equations
2001
We present a fully adaptive numerical scheme for the resolution of parabolic equations. It is based on wavelet approximations of functions and operators. Following the numerical analysis in the case of linear equations, we derive a numerical algorithm essentially based on convolution operators that can be efficiently implemented as soon as a natural condition on the space of approximation is satisfied. The algorithm is extended to semi-linear equations with time dependent (adapted) spaces of approximation. Numerical experiments deal with the heat equation as well as the Burgers equation.
Diffusion front capturing schemes for a class of Fokker–Planck equations: Application to the relativistic heat equation
2010
In this research work we introduce and analyze an explicit conservative finite difference scheme to approximate the solution of initial-boundary value problems for a class of limited diffusion Fokker-Planck equations under homogeneous Neumann boundary conditions. We show stability and positivity preserving property under a Courant-Friedrichs-Lewy parabolic time step restriction. We focus on the relativistic heat equation as a model problem of the mentioned limited diffusion Fokker-Planck equations. We analyze its dynamics and observe the presence of a singular flux and an implicit combination of nonlinear effects that include anisotropic diffusion and hyperbolic transport. We present numeri…