946 resultados para Spectral theory, differential operators, quantum graphs, indefinite operators


Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 42B20; Secondary 42B15, 42B25

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 30C45, Secondary 26A33, 30C80

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 44A35; 42A75; 47A16, 47L10, 47L80

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 35E45

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 34A60, 34K40, 93B05

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Mathematics Subject Classification: 47A56, 47A57,47A63

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This study surveys the ordered weighted averaging (OWA) operator literature using a citation network analysis. The main goals are the historical reconstruction of scientific development of the OWA field, the identification of the dominant direction of knowledge accumulation that emerged since the publication of the first OWA paper, and to discover the most active lines of research. The results suggest, as expected, that Yager's paper (IEEE Trans. Systems Man Cybernet, 18(1), 183-190, 1988) is the most influential paper and the starting point of all other research using OWA. Starting from his contribution, other lines of research developed and we describe them.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 74B20, 74D10, 74L15

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Stochastic arithmetic has been developed as a model for exact computing with imprecise data. Stochastic arithmetic provides confidence intervals for the numerical results and can be implemented in any existing numerical software by redefining types of the variables and overloading the operators on them. Here some properties of stochastic arithmetic are further investigated and applied to the computation of inner products and the solution to linear systems. Several numerical experiments are performed showing the efficiency of the proposed approach.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

MSC 2010: 26A33

Relevância:

40.00% 40.00%

Publicador:

Resumo:

MSC 2010: 26A33, 44A45, 44A40, 65J10

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 41A25, 41A27, 41A36.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 46E15, 54C55; Secondary 28B20.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this paper, we use the quantum Jensen-Shannon divergence as a means of measuring the information theoretic dissimilarity of graphs and thus develop a novel graph kernel. In quantum mechanics, the quantum Jensen-Shannon divergence can be used to measure the dissimilarity of quantum systems specified in terms of their density matrices. We commence by computing the density matrix associated with a continuous-time quantum walk over each graph being compared. In particular, we adopt the closed form solution of the density matrix introduced in Rossi et al. (2013) [27,28] to reduce the computational complexity and to avoid the cumbersome task of simulating the quantum walk evolution explicitly. Next, we compare the mixed states represented by the density matrices using the quantum Jensen-Shannon divergence. With the quantum states for a pair of graphs described by their density matrices to hand, the quantum graph kernel between the pair of graphs is defined using the quantum Jensen-Shannon divergence between the graph density matrices. We evaluate the performance of our kernel on several standard graph datasets from both bioinformatics and computer vision. The experimental results demonstrate the effectiveness of the proposed quantum graph kernel.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2010 Mathematics Subject Classification: 42B10, 47A07, 35S05.