Results 21 to 30 of about 61,133 (171)
Almost-distribution cosine functions and integrated cosine functions [PDF]
Studia Mathematica, 2005 We introduce the notion of almost-distribution cosine functions in a setting similar to that of distribution semigroups dened by Lions. We prove general results on equivalence between almost-distribution cosine functions and -times integrated cosine functions.
openaire +2 more sources
Identities and inequalities for the cosine and sine functions [PDF]
arXiv, 2020 Identities and inequalities for the cosine and sine functions are obtained.
arxiv
An Inequality for Cosine Polynomials
Journal of Mathematical Analysis and Applications, 1997 AbstractWe prove that ifa0,a1,…,anare real numbers, then∫0π|12a0+∑k=1nakcos(kx)|dx/∫0π|12+∑k=1ncos(kx)|dx≥min1≤i≤n+1(1i∑k=1ian+1−k),with equality holding if and only ifa0=a1=···=an≥0. This inequality refines a result of L. Fejes.
openaire +2 more sources
On the distribution of cosine similarity with application to biology [PDF]
arXiv, 2023 Cosine similarity is an established similarity metric for computing associations on vectors, and it is commonly used to identify related samples from biological perturbational data. The distribution of cosine similarity changes with the covariance of the data, and this in turn affects the statistical power to identify related signals.
arxiv
DISTRIBUTION COSINE FUNCTIONS [PDF]
Taiwanese Journal of Mathematics, 2006 A class of distribution cosine functions is introduced and systematically analyzed. Connections with (local) integrated cosine functions as well as some characterizations and related examples are given.
openaire +3 more sources
The Discrete Cosine Transform on Triangles [PDF]
ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019 The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by combining algebraic signal processing theory with a specific kind of multivariate Chebyshev polynomials.
Bastian Seifert, Knut Hüper
openaire +3 more sources
Fourier Cosine and Sine Transform on fractal space [PDF]
arXiv, 2011 In this paper, we establish local fractional Fourier Cosine and Sine Transforms on fractal space, considered some properties of local fractional Cosine and Sine Transforms, show applications of local fractional Fourier Cosine and Sine transform to local fractional equations with local fractional derivative.
arxiv
A deterministic algorithm to compute the cosine measure of a finite positive spanning set [PDF]
arXiv, 2020 Originally developed in 1954, positive bases and positive spanning sets have been found to be a valuable concept in derivative-free optimization (DFO). The quality of a positive basis (or positive spanning set) can be quantified via the {\em cosine measure} and convergence properties of certain DFO algorithms are intimately linked to the value of this ...
arxiv
On discrete cosine transform [PDF]
arXiv, 2011 The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In simulating the discrete cosine transform, we propose a generalized discrete cosine transform with three ...
arxiv