Let M be a smooth compact oriented Riemannian manifold, and let ∆ be the Laplace-Beltrami operator on M. Say 0 6= f ∈ S(R), and that f(0) = 0. For t > 0, let Kt(x, y) denote the kernel of f(t∆). Suppose f satisfies Daubechies’ criterion, and b > 0. For each j, write M as a disjoint union of measurable sets Ej,k with diameter at most ba j , and comparable to ba if ba is sufficiently small. Take ...

We consider a variant of the online buffer management problem in network switches, called the k-frame throughput maximization problem (k-FTM). This problem models the situation where a large frame is fragmented into k packets and transmitted through the Internet, and the receiver can reconstruct the frame only if he/she accepts all the k packets. Kesselman et al. introduced this problem and sho...

We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a forking-like notion for types of singleton elements. Theorem 0.1 (Superstability from categoricity). Let K be a (< κ)-tame AEC with amalgamation. If κ = iκ > ...

The purpose of the paper is to analyze g-frames form \(\{\varphi T^{i} \in B(\mathcal {H},\mathcal {K})\}_{i=0}^\infty \), where \(T\in {H})\) and \(\varphi {K})\), discuss properties operator T. We consider stability g-Riesz sequences \). Finally, a weighted representation g frame introduced some its are presented. provide sufficient condition for given g-frame \(\Lambda =\{\Lambda _{i}\in {B(...

We study Weyl-Heisenberg (=Gabor) expansions for either L2(IR ) or a subspace of it. These are expansions in terms of the spanning set X = (EM φ : k ∈ K, l ∈ L,φ ∈ Φ), where K and L are some discrete lattices in IR, Φ ⊂ L2(IR ) is finite, E is the translation operator, and M is the modulation operator. Such sets X are known as WH systems. The analysis of the “basis” properties of WH systems (e....

We present a multistage affine motion segmentation method that combines the benefits of the dominant motion and block-based affine modeling approaches. In particular, we propose two key modifications to a recent motion segmentation algorithm developed by Wang and Adelson (1994). 1) The adaptive k-means clustering step is replaced by a merging step, whereby the affine parameters of a block which...

In this paper, a novel algorithm for content-based video indexing and retrieval using key-frames texture, edge, and motion features is presented. The algorithm extracts key frames from a video using k-means clustering based method, followed by extraction of texture, edge, and motion features to represent a video with the feature vector. The algorithm is evaluated on a database of three hundred ...

ν = q · P M = E − E is the lepton’s energy loss in the nucleon rest frame (in earlier literature sometimes ν = q · P ). Here, E and E′ are the initial and final lepton energies in the nucleon rest frame. Q = −q2 = 2(EE′−−→k · −→k )−ml −ml′ where ml(ml′) is the initial (final) lepton mass. If EE′ sin(θ/2) ≫ m2l , m2l′ , then ≈ 4EE′ sin(θ/2), where θ is the lepton’s scattering angle with respect ...

Abstract Few years ago Găvruţa gave the notions of K -frame and atomic system for a linear bounded operator in Hilbert space $$\mathcal {H}$$ H order to decompose {R}(K)$$ R ( K ) , range with frame-like expansion. Thes...

ν = q · P M = E − E′ is the lepton’s energy loss in the nucleon rest frame (in earlier literature sometimes ν = q · P ). Here, E and E′ are the initial and final lepton energies in the nucleon rest frame. Q = −q2 = 2(EE′−−→k · −→k )−ml −m2l′ where ml(ml′) is the initial (final) lepton mass. If EE′ sin(θ/2) ≫ m2l , m2l′ , then ≈ 4EE′ sin(θ/2), where θ is the lepton’s scattering angle with respec...