All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 13 of 13

Showing per page

Wavelet transform and binary coalescence detection

Jean-Michel Innocent, Bruno Torrésani (1997)

Banach Center Publications

We give a short account of some time-frequency methods which are relevant in the context of gravity waves detection. We focus on the case of wavelet analysis which we believe is particularly appropriate. We show how wavelet transforms can lead to efficient algorithms for detection and parameter estimation of binary coalescence signals. In addition, we give in an appendix some of the ingredients needed for the construction of discrete wavelet decompositions and corresponding fast algorithms.

Weighted entropies

Bruce Ebanks (2010)

Open Mathematics

We present an axiomatic characterization of entropies with properties of branching, continuity, and weighted additivity. We deliberately do not assume that the entropies are symmetric. The resulting entropies are generalizations of the entropies of degree α, including the Shannon entropy as the case α = 1. Such “weighted” entropies have potential applications to the “utility of gambling” problem.

Weighted sums of aggregation operators.

Tomasa Calvo, Bernard De Baets, Radko Mesiar (1999)

Mathware and Soft Computing

The aim of this work is to investigate when a weighted sum, or in other words, a linear combination, of two or more aggregation operators leads to a new aggregation operator. For weights belonging to the real unit interval, we obtain a convex combination and the answer is known to be always positive. However, we will show that also other weights can be used, depending upon the aggregation operators involved. A first set of suitable weights is obtained by a general method based on the variation of...

What is Q-extension?

Bouyukliev, Iliya (2007)

Serdica Journal of Computing

In this paper we present a developed software in the area of Coding Theory. Using it, codes with given properties can be classified. A part of this software can be used also for investigations (isomorphisms, automorphism groups) of other discrete structures-combinatorial designs, Hadamard matrices, bipartite graphs etc.

What is the inverse of repeated square and multiply algorithm?

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy (2009)

Colloquium Mathematicae

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete...

Wiener amalgam spaces for the fundamental identity of Gabor analysis.

Hans G. Feichtinger, Franz Luef (2006)

Collectanea Mathematica

In the last decade it has become clear that one of the central themes within Gabor analysis (with respect to general time-frequency lattices) is a duality theory for Gabor frames, including the Wexler-Raz biorthogonality condition, the Ron-Shen duality principle and the Janssen representation of a Gabor frame operator. All these results are closely connected with the so-called Fundamental Identity of Gabor Analysis, which we derive from an application of Poisson's summation formula for the symplectic...

WWW-based Boolean function minimization

Sebastian Tomaszewski, Ilgaz Celik, George Antoniou (2003)

International Journal of Applied Mathematics and Computer Science

In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful...

Currently displaying 1 – 13 of 13

Page 1