| 1. |
- Andersson, Fredrik K., et al.
(författare)
-
The mathematics of internet search engines
- 2008
-
Ingår i: Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications. - : Springer. - 0167-8019 .- 1572-9036. ; 104:2, s. 211-242
-
Tidskriftsartikel (refereegranskat)abstract
- This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.
|
|
| 2. |
-
Algebra, Geometry, and Mathematical Physics 2010
- 2012
-
Ingår i: Journal of Physics: Conference Series. - : IOP Publishing. - 1742-6596 .- 1742-6588.
-
Samlingsverk (redaktörskap) (övrigt vetenskapligt/konstnärligt)abstract
- This proceedings volume presents results obtained by the participants of the 6th Baltic–Nordic workshop 'Algebra, Geometry, and Mathematical Physics (AGMP-6)' held at the Sven Lovén Centre for Marine Sciences in Tjärnö, Sweden on October 25–30, 2010. The Baltic–Nordic Network AGMP 'Algebra, Geometry, and Mathematical Physics' http://www.agmp.eu was created in 2005 on the initiative of two Estonian universities and two Swedish universities: Tallinn University of Technology represented by Eugen Paal (coordinator of the network), Tartu University represented by Viktor Abramov, Lund University represented by Sergei Silvestrov, and Chalmers University of Technology and the University of Gothenburg represented by Alexander Stolin. The goal was to promote international and interdisciplinary cooperation between scientists and research groups in the countries of the Baltic–Nordic region in mathematics and mathematical physics, with special emphasis on the important role played by algebra and geometry in modern physics, engineering and technologies. The main activities of the AGMP network consist of a series of regular annual international workshops, conferences and research schools. The AGMP network also constitutes an important educational forum for scientific exchange and dissimilation of research results for PhD students and Postdocs. The network has expanded since its creation, and nowadays its activities extend beyond countries in the Baltic–Nordic region to universities in other European countries and participants from elsewhere in the world. As one of the important research-dissimilation outcomes of its activities, the network has a tradition of producing high-quality research proceedings volumes after network events, publishing them with various international publishers.
|
|
| 3. |
- Lundengård, Karl, 1987-
(författare)
-
Generalized Vandermonde matrices and determinants in electromagnetic compatibility
- 2017
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Matrices whose rows (or columns) consists of monomials of sequential powers are called Vandermonde matrices and can be used to describe several useful concepts and have properties that can be helpful for solving many kinds of problems. In this thesis we will discuss this matrix and some of its properties as well as a generalization of it and how it can be applied to curve fitting discharge current for the purpose of ensuring electromagnetic compatibility.In the first chapter the basic theory for later chapters is introduced. This includes the Vandermonde matrix and some of its properties, history, applications and generalizations, interpolation and regression problems, optimal experiment design and modelling of electrostatic discharge currents with the purpose to ensure electromagnetic compatibility.The second chapter focuses on finding the extreme points for the determinant for the Vandermonde matrix on various surfaces including spheres, ellipsoids, cylinders and tori. The extreme points are analysed in three dimensions or more.The third chapter discusses fitting a particular model called the p-peaked Analytically Extended Function (AEF) to data taken either from a standard for electromagnetic compatibility or experimental measurements. More specifically the AEF will be fitted to discharge currents from the IEC 62305-1 and IEC 61000-4-2 standards for lightning protection and electrostatic discharge immunity as well as some experimentally measured data of similar phenomena.
|
|
| 4. |
- Dupuch, Marie, et al.
(författare)
-
Comparison of Clustering Approaches through Their Application to Pharmacovigilance Terms
- 2013
-
Ingår i: Artificial Intelligence in Medicine. Lecture Notes in Computer Science, vol. 7885. - Berlin Heidelberg : Springer. - 9783642383250 - 9783642383267 ; , s. 58-67
-
Bokkapitel (refereegranskat)abstract
- In different applications (i.e., information retrieval, filteringor analysis), it is useful to detect similar terms and to provide the possibilityto use them jointly. Clustering of terms is one of the methods whichcan be exploited for this. In our study, we propose to test three methodsdedicated to the clustering of terms (hierarchical ascendant classification,Radius and maximum), to combine them with the semantic distance algorithmsand to compare them through the results they provide whenapplied to terms from the pharmacovigilance area. The comparison indicatesthat the non disjoint clustering (Radius and maximum) outperformthe disjoint clusters by 10 to up to 20 points in all the experiments.
|
|
| 5. |
- Engström, Christopher, 1987-, et al.
(författare)
-
PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph
- 2016
-
Ingår i: Engineering Mathematics II. - Cham : Springer. - 9783319421049 - 9783319421056 ; , s. 223-247
-
Bokkapitel (refereegranskat)abstract
- In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its main focus in the understanding of the behavior of PageRank as the system dynamically changes either by contracting or expanding such as when adding or subtracting nodes or links or groups of nodes or links. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others. We will look at PageRank as the solution of a linear system of equations and do our examination in both the ordinary normalized version of PageRank as well as the non-normalized version found by solving corresponding linear system. We will show that using two different methods we can find explicit formulas for the PageRank of some simple link structures.
|
|
| 6. |
- Engström, Christopher, 1987-, et al.
(författare)
-
PageRank, Connecting a Line of Nodes with a Complete Graph
- 2016
-
Ingår i: Engineering Mathematics II. - Cham : Springer. - 9783319421049 - 9783319421056
-
Bokkapitel (refereegranskat)abstract
- The focus of this article is the PageRank algorithm originally defined by S. Brin and L. Page as the stationary distribution of a certain random walk on a graph used to rank homepages on the Internet. We will attempt to get a better understanding of how PageRank changes after you make some changes to the graph such as adding or removing edge between otherwise disjoint subgraphs. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others and different ways to combine the two. Both the ordinary normalized version of PageRank as well as a non-normalized version of PageRank found by solving corresponding linear system will be considered. We will see that it is possible to find explicit formulas for the PageRank in some simple link structures and using these formulas take a more in-depth look at the behavior of the ranking as the system changes.
|
|
| 7. |
-
Engineering Mathematics II : Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization
- 2016
-
Samlingsverk (redaktörskap) (refereegranskat)abstract
- This book highlights the latest advances in engineering mathematics with a main focus on the mathematical models, structures, concepts, problems and computational methods and algorithms most relevant for applications in modern technologies and engineering. It addresses mathematical methods of algebra, applied matrix analysis, operator analysis, probability theory and stochastic processes, geometry and computational methods in network analysis, data classification, ranking and optimisation.The individual chapters cover both theory and applications, and include a wealth of figures, schemes, algorithms, tables and results of data analysis and simulation. Presenting new methods and results, reviews of cutting-edge research, and open problems for future research, they equip readers to develop new mathematical methods and concepts of their own, and to further compare and analyse the methods and results discussed.The book consists of contributed chapters covering research developed as a result of a focused international seminar series on mathematics and applied mathematics and a series of three focused international research workshops on engineering mathematics organised by the Research Environment in Mathematics and Applied Mathematics at Mälardalen University from autumn 2014 to autumn 2015: the International Workshop on Engineering Mathematics for Electromagnetics and Health Technology; the International Workshop on Engineering Mathematics, Algebra, Analysis and Electromagnetics; and the 1st Swedish-Estonian International Workshop on Engineering Mathematics, Algebra, Analysis and Applications.It serves as a source of inspiration for a broad spectrum of researchers and research students in applied mathematics, as well as in the areas of applications of mathematics considered in the book.
|
|
| 8. |
|
|
| 9. |
- Silvestrov, Dmitrii S.
(författare)
-
Upper bounds for exponential moments of hitting times for semi-Markov processes
- 2004
-
Ingår i: Communications in Statistics - Theory and Methods. - 0361-0926 .- 1532-415X. ; 33:3, s. 533-544
-
Tidskriftsartikel (refereegranskat)abstract
- Necessary and sufficient conditions for the existence of exponential moments for hitting times for semi-Markov processes are found. These conditions and the corresponding upper bounds for exponential moments are given in terms of test-functions. Applications to hitting times forsemi-Markov random walks and queuing systems illustrate the results.
|
|
| 10. |
- Backlund, Ulf, et al.
(författare)
-
Semi-Bloch Functions in Several Complex Variables
- 2016
-
Ingår i: Journal of Geometric Analysis. - : Springer Science and Business Media LLC. - 1050-6926 .- 1559-002X. ; 26:1, s. 463-473
-
Tidskriftsartikel (refereegranskat)abstract
- Let M be an n-dimensional complex manifold. A holomorphic function f : M -> C is said to be semi-Bloch if for every lambda is an element of C the function g(lambda) = exp(lambda f(z)) is normal on M. We characterize semi-Bloch functions on infinitesimally Kobayashi non-degenerate M in geometric as well as analytic terms. Moreover, we show that on such manifolds, semi-Bloch functions are normal.
|
|
