Rendering of large, detailed 3D terrains on commodity hardware has become possible through the use of raycasting, data caching and prefetching. Adding dynamic shadows as they appear during a day-night cycle remais a challenge however, because shadow rendering requires access to the entire terrain, invalidating data streaming strategies. In this work we present a novel, practicable shadow render...

We present a simple representation for analytically continued nested harmonic sums the arbitrary complex arguments. This can be obtained wide range of from precomputed database pole expressions these near negative integers. describe procedure precise numerical evaluations corresponding results dispersion representation.

This paper suggests to use rounded Gaussians in place of discrete Gaussians in rejection-sampling-based lattice signature schemes like BLISS. We show that this distribution can efficiently be sampled from while additionally making it easy to sample in constant time, systematically avoiding recent timing-based side-channel attacks on lattice-based signatures. We show the effectiveness of the new...

One of the most efficient ways to implement a scalar multiplication on elliptic curves with precomputed points is to use mixed coordinates (affine and Jacobian). We show how to relax these preconditions by introducing relative Jacobian coordinates and give an algorithm to compute a scalar multiplication where the precomputed points can be given in Jacobian coordinates. We also show that this ne...

A large-eddy simulation (LES) of a bluff-body-stabilized flame has been carried out using a new strategy for LES grid generation. The recursive filter-refinement procedure (RFRP) has been used to generate optimized clustering for variable density combustion simulations. A methane–hydrogen fuel-based bluff-body-stabilized experimental configuration has been simulated using state-of-the-art LES a...

In our previous work Crux , we used an additively homomorphic elliptic-curve cryptosystem, based on El Gamal, to compute privacy-preserving statistics for the Tor network [4]. The decryption algorithm of our cryptographic scheme required the computation of a small discrete logarithm (DL). For small values, the computation of the DLP should have been trivial as an exhaustive search would quickly...

This paper proposes a decomposition approach for uncertainty analysis of systems governed by partial differential equations (PDEs). The system is split into local components using domain decomposition. Our domain-decomposed uncertainty quantification (DDUQ) approach performs uncertainty analysis independently on each local component in an “offline” phase, and then assembles global uncertainty a...

Deep neural networks are an attractive tool for compressing the control policy lookup tables in systems such as Airborne Collision Avoidance System (ACAS). It is vital to ensure safety of controllers via verification techniques. The problem analyzing ACAS Xu has motivated many successful network verifiers. These verifiers typically analyze internal computation decide whether a property regardin...

Realistic image synthesis is one of the most relevant subjects in computer graphics, and many algorithms have been developed to try to reproduce the visual complexity perceived in the real world. However, rendering realistic images in real time remains a challenge even with the support of modern graphics hardware. Precomputed Radiance Transfer (PRT) is a new graphics technique capable of synthe...

Ambient occlusion is widely used for improving the realism of real-time lighting simulations. We present a new method for precomputed ambient occlusion, where we store and retrieve unprocessed ambient occlusion values in a 3D grid. Our method is very easy to implement, has a reasonable memory cost, and the rendering time is independent from the complexity of both the occluder and the receiving ...