Displaying 61 – 80 of 1497

Showing per page

A modified convolution and product theorem for the linear canonical transform derived by representation transformation in quantum mechanics

Navdeep Goel, Kulbir Singh (2013)

International Journal of Applied Mathematics and Computer Science

The Linear Canonical Transform (LCT) is a four parameter class of integral transform which plays an important role in many fields of signal processing. Well-known transforms such as the Fourier Transform (FT), the FRactional Fourier Transform (FRFT), and the FreSnel Transform (FST) can be seen as special cases of the linear canonical transform. Many properties of the LCT are currently known but the extension of FRFTs and FTs still needs more attention. This paper presents a modified convolution...

A multiplication theorem for two-variable positive real matrices

Fazlollah M. Reza (1985)

Aplikace matematiky

A multiplication-division theorem is derived for the positive real functions of two complex variables. The theorem is generalized to encompass the product of positive real functions of two complex variables. The theorem is generalized to encompass the product of positive real matrices whose elements are functions of two complex variables. PRF and PR matrices occur frequantly in the study of electrical multiports and multivariable systems (such as digital filters).

A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications

Hamada, Noboru, Maruta, Tatsuya, Oya, Yusuke (2012)

Serdica Journal of Computing

ACM Computing Classification System (1998): E.4.Let q be a prime or a prime power ≥ 3. The purpose of this paper is to give a necessary and sufficient condition for the existence of an (n, r)-arc in PG(2, q ) for given integers n, r and q using the geometric structure of points and lines in PG(2, q ) for n > r ≥ 3. Using the geometric method and a computer, it is shown that there exists no (34, 3) arc in PG(2, 17), equivalently, there exists no [34, 3, 31] 17 code.This research was partially...

A new approach to mutual information

Fumio Hiai, Dénes Petz (2007)

Banach Center Publications

A new expression as a certain asymptotic limit via "discrete micro-states" of permutations is provided for the mutual information of both continuous and discrete random variables.

A new approach to mutual information. II

Fumio Hiai, Takuho Miyamoto (2010)

Banach Center Publications

A new concept of mutual pressure is introduced for potential functions on both continuous and discrete compound spaces via discrete micro-states of permutations, and its relations with the usual pressure and the mutual information are established. This paper is a continuation of the paper of Hiai and Petz in Banach Center Publications, Vol. 78.

A new approach to the ElGamal encryption scheme

Czesław Kościelny (2004)

International Journal of Applied Mathematics and Computer Science

The ElGamal encryption scheme can be used for both digital signatures and encryption, and its security results from the difficulty of calculating discrete logarithms in a finite field. This algorithm usually works in a multiplicative group of GF(p) and in this case the progress in the discrete logarithm problem forces the users of such a basic ElGamal public key cryptosystem to permanently increase a prime modulus p in order to ensure the desired security. But the task of finding a multiplicative...

A new definition of the fuzzy set

Andrzej Piegat (2005)

International Journal of Applied Mathematics and Computer Science

The present fuzzy arithmetic based on Zadeh's possibilistic extension principle and on the classic definition of a fuzzy set has many essential drawbacks. Therefore its application to the solution of practical tasks is limited. In the paper a new definition of the fuzzy set is presented. The definition allows for a considerable fuzziness decrease in the number of arithmetic operations in comparison with the results produced by the present fuzzy arithmetic.

A new lower bound for the football pool problem for 7 matches

Laurent Habsieger (1996)

Journal de théorie des nombres de Bordeaux

Let K 3 ( 7 , 1 ) denote the minimum cardinality of a ternary code of length 7 and covering radius one. In a previous paper, we improved on the lower bound K 3 ( 7 , 1 ) 147 by showing that K 3 ( 7 , 1 ) 150 . In this note, we prove that K 3 ( 7 , 1 ) 153 .

A New overlapping community detection algorithm based on similarity of neighbors in complex networks

Pelin Çetin, Sahin Emrah Amrahov (2022)

Kybernetika

Community detection algorithms help us improve the management of complex networks and provide a clean sight of them. We can encounter complex networks in various fields such as social media, bioinformatics, recommendation systems, and search engines. As the definition of the community changes based on the problem considered, there is no algorithm that works universally for all kinds of data and network structures. Communities can be disjointed such that each member is in at most one community or...

Currently displaying 61 – 80 of 1497