Abstract A new class of high order weighted essentially non-oscillatory (WENO) schemes [J. Comput. Phys., 318 (2016), 110-121] is applied to solve Euler equations with steady state solutions. It is known that the classical WENO schemes [J. Comput. Phys., 126 (1996), 202-228] might suffer from slight post-shock oscillations. Even though such post-shock oscillations are small enough in magnitude ...

In model-based decomposition algorithms using polarimetric synthetic aperture radar (PolSAR) data, urban targets are typically identified based on the existence of strong double-bounced scattering. However, urban targets with large azimuth orientation angles (AOAs) produce strong volumetric scattering that appears similar to scattering characteristics from tree canopies. Due to scattering ambig...

In functional encryption (FE) schemes, ciphertexts and private keys are associated with attributes and decryption is possible whenever key and ciphertext attributes are suitably related. It is known that expressive realizations can be obtained from a simple functional encryption flavor called inner product encryption (IPE), where decryption is allowed whenever ciphertext and key attributes form...

The problem of multiple suppression is of interest up to now despite of its long-standing. A new approach for attenuation of multiples in a "locally 1-D" environment is suggested, which is illustrated here with well-controlled processing of synthetic data. The method is based on a rigorous forward model and a non-Wiener lter design in the context of predictive deconvolution. Due to the linearit...

We introduce a variant of (sparse) PCA in which the set of feasible support sets is determined by a graph. In particular, we consider the following setting: given a directed acyclic graph G on p vertices corresponding to variables, the non-zero entries of the extracted principal component must coincide with vertices lying along a path in G. From a statistical perspective, information on the und...

This paper studies precision matrix estimation for multiple related Gaussian graphical models from a dataset consisting of different classes, based upon the formulation of this problem as group graphical lasso. In particular, this paper proposes a novel hybrid covariance thresholding algorithm that can effectively identify zero entries in the precision matrices and split a large joint graphical...

We provide a framework for constructing leakage-resilient identification (ID) protocols in the bounded retrieval model (BRM) from proofs of storage (PoS) that hide partial information about the file. More precisely, we describe a generic transformation from any zero-knowledge PoS to a leakage-resilient ID protocol in the BRM. We then describe a ZK-PoS based on RSA which, under our transformatio...

We characterize the class of problems accepted by a class of program schemes with arrays, NPSA, as the class of problems deened by the sentences of a logic formed by extending rst-order logic with a particular uniform (or vectorized) sequence of Lindstrr om quantiiers. A simple extension of a known result thus enables us to prove that our logic, and consequently our class of program schemes, ha...

For a Noetherian scheme X, let Xreg denote the regular locus of X. The scheme X is said to admit a resolution of singularities if there exists a blowup X ′ → X with center disjoint from Xreg and regular X ′. More generally, for a closed subscheme Z ⊂ X, let (X,Z)reg denote the set of points x ∈ Xreg such that, in an open neighborhood of x, Z is defined by an equation of the form t1 1 · · · · · ...