mdh.sePublications
Change search
Refine search result
123 1 - 50 of 136
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 1.
    Ambainis, A.
    et al.
    University of California, Berkeley, USA.
    Bonner, R.
    Mälardalen University, Department of Mathematics and Physics.
    Freivalds, R.
    University of Latvia, Latvia.
    Golovkins, M.
    University of Latvia, Latvia.
    Karpinski, M.
    University of Bonn, Germany.
    Quantum finite multitape automata1999In: SOFSEM’99: Theory and Practice of Informatics: 26th Conference on Current Trends in Theory and Practice of Informatics Milovy, Czech Republic, November 27 — December 4, 1999 Proceedings, 1999, Vol. 1725, p. 340-348Conference paper (Refereed)
    Abstract [en]

    Quantum finite automata were introduced by C. Moore, J. P. Crutchfield [4], and by A. Kondacs and J. Watrous [3]. This notion is not a generalization of the deterministic finite automata. Moreover, in [3] it was proved that not all regular languages can be recognized by quantum finite automata. A. Ambainis and R. Freivalds [1] proved Chat for some languages quantum finite automats may be exponentially more concise rather than both deterministic and probabilistic finite automata. In this paper we introduce the notion of quantum finite multi-tape automata and prove that there is a language recognized by a quantum finite automaton but not by deterministic or probabilistic finite automats. This is the first result on a problem which can be solved by a quantum computer but not by a deterministic or probabilistic computer. Additionally we discover unexpected probabilistic automata recognizing complicated languages.

  • 2.
    Andersson, Fredrik K.
    et al.
    WorldLight.com AB, Sweden.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication.
    The mathematics of internet search engines2008In: Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications, ISSN 0167-8019, E-ISSN 1572-9036, Vol. 104, no 2, p. 211-242Article in journal (Refereed)
    Abstract [en]

    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.

  • 3.
    Andersson, Magnus
    et al.
    Mälardalen University, School of Education, Culture and Communication.
    Palm, Johan
    Mälardalen University, School of Education, Culture and Communication.
    Forecasting the Stock Market: A Neural Network Approch2009Student thesis
    Abstract [en]

    Forecasting the stock market is a complex task, partly because of the random walk behavior of the stock price series. The task is further complicated by the noise, outliers and missing values that are common in financial time series. Despite of this, the subject receives a fair amount of attention, which probably can be attributed to the potential rewards that follows from being able to forecast the stock market.

    Since artificial neural networks are capable of exploiting non-linear relations in the data, they are suitable to use when forecasting the stock market. In addition to this, they are able to outperform the classic autoregressive linear models.

    The objective of this thesis is to investigate if the stock market can be forecasted, using the so called error correction neural network. This is accomplished through the development of a method aimed at finding the optimum forecast model.

    The results of this thesis indicates that the developed method can be applied successfully when forecasting the stock market. Of the five stocks that were forecasted in this thesis using forecast models based on the developed method, all generated positive returns. This suggests that the stock market can be forecasted using neural networks.

  • 4.
    Andren, Daniel
    et al.
    Umeå University.
    Hellström, Lars
    Umeå University.
    Markström, Klas
    Umeå University.
    Fast multiplication of matrices over a finitely generated semiring2008In: Information Processing Letters, ISSN 0020-0190, E-ISSN 1872-6119, Vol. 107, no 6, p. 230-234Article in journal (Refereed)
  • 5.
    Calvo, Diego R.
    et al.
    Mälardalen University, School of Education, Culture and Communication.
    Musatov, Michail
    Mälardalen University, School of Education, Culture and Communication.
    Pricing American Style Asian OptionsUsing Dynamic Programming2010Independent thesis Advanced level (degree of Master (Two Years)), 30 credits / 45 HE creditsStudent thesis
    Abstract [en]

    The objective of this study is to implement a Java applet for calculating Bermudan/American-Asian call option prices and to obtain their respective optimal exercise strategies. Additionally, the study presents a computational time analysis and the effect of the variables on the option price.

  • 6.
    Canhanga, Betuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Faculty of Sciences, Department of Mathematics and Computer Sciences, Eduardo Mondlane University, Maputo, Mozambique.
    Malyarenko, Anatoliy
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Ni, Ying
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Rancic, Milica
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Analytical and Numerical Studies on the Second Order Asymptotic Expansion Method for European Option Pricing under Two-factor Stochastic Volatilities2018In: Communications in Statistics - Theory and Methods, ISSN 0361-0926, E-ISSN 1532-415X, Vol. 47, no 6, p. 1328-1349Article in journal (Refereed)
    Abstract [en]

    The celebrated Black–Scholes model made the assumption of constant volatility but empirical studies on implied volatility and asset dynamics motivated the use of stochastic volatilities. Christoffersen in 2009 showed that multi-factor stochastic volatilities models capture the asset dynamics more realistically. Fouque in 2012 used it to price European options. In 2013 Chiarella and Ziveyi considered Christoffersen's ideas and introduced an asset dynamics where the two volatilities of the Heston type act separately and independently on the asset price, and using Fourier transform for the asset price process and double Laplace transform for the two volatilities processes, solved a pricing problem for American options. This paper considers the Chiarella and Ziveyi model and parameterizes it so that the volatilities revert to the long-run-mean with reversion rates that mimic fast(for example daily) and slow(for example seasonal) random effects. Applying asymptotic expansion method presented by Fouque in 2012, we make an extensive and detailed derivation of the approximation prices for European options. We also present numerical studies on the behavior and accuracy of our first and the second order asymptotic expansion formulas.

  • 7.
    Casazza, P. G.
    et al.
    University of Missouri.
    Jorgensen, Palle E. T.
    The University of Iowa.
    Kornelson, Keri A.
    University of Oklahoma.
    Kutyniok, Gitta
    Technische Universität Berlin.
    Larson, David R.
    Texas A&M University.
    Massopust, Peter
    Institute for Biomathematics and Biometry, Helmholtz Zentrum München.
    Olafsson, Gestur
    Lousiana State University.
    Packer, Judith A.
    University of Colorado at Boulder.
    Silvestrov, Sergei D.
    Mälardalen University, School of Education, Culture and Communication.
    Sun, Qiyu
    University of Central Florida.
    Preface2012In: Numerical Functional Analysis and Optimization, ISSN 0163-0563, E-ISSN 1532-2467, Vol. 33, no 7-9, p. 705-707Article in journal (Other academic)
  • 8.
    Cattani, Carlo
    et al.
    University of Tuscia Largo dell’Universita, Italy.
    Guariglia, Emanuel
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. University of Salerno, Italy.
    Wang, Shuihua
    Nanjing University, China.
    On the Critical Strip of the Riemann zeta Fractional derivative2017In: Fundamenta Informaticae, ISSN 0169-2968, E-ISSN 1875-8681, Vol. 151, p. 459-472Article in journal (Refereed)
    Abstract [en]

    The fractional derivative of the Dirichlet eta function is computed in order to investigate the behavior of the fractional derivative of the Riemann zeta function on the critical strip. Its convergence is studied. In particular, its half-plane of convergence gives the possibility to better understand the fractional derivative of the Riemann zeta function and its critical strip. As an application, two signal processing networks, corresponding to the fractional derivative of the eta function and to its Fourier transform, respectively, are shortly described.

  • 9.
    Dimitrov, Marko
    Mälardalen University, School of Education, Culture and Communication.
    Estimation and Testing the Quotient of Two Models2018Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    In the thesis, we introduce linear regression models such as Simple Linear Regression, Multiple Regression, and Polynomial Regression. We explain basic methods of the model parameters estimation, Ordinary Least Squares (OLS) and Maximum Likelihood Estimation (MLE). The properties of the estimates, and what assumptions need to be made for the model for the estimates to be the Best Linear Unbiased Estimates (BLUE) are given. The basic Bootstrap methods are introduced. The real world problem is simulated in order to see how measurement error affects the quotient of two estimated models.

  • 10.
    Dupuch, Marie
    et al.
    CNRS UMR 8163 STL, Universit´e Lille 3, 59653 Villeneuve d’Ascq, France.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Hamon, Thierry
    LIM&BIO UFR SMBH Universit´e Paris 13, France.
    Grabar, Natalia
    CNRS UMR 8163 STL, Universit´e Lille 3, 59653 Villeneuve d’Ascq, France.
    Comparison of Clustering Approaches through Their Application to Pharmacovigilance Terms2013In: Artificial Intelligence in Medicine. Lecture Notes in Computer Science, vol. 7885 / [ed] Niels Peek, Roque Marín Morales, Mor Peleg, Berlin Heidelberg: Springer, 2013, p. 58-67Chapter in book (Refereed)
    Abstract [en]

    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.

  • 11.
    Ehn, Micael
    Mälardalen University, School of Education, Culture and Communication.
    On the causes and effects of specialization: A mathematical approach2009Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    Division of labor and division of knowledge are so important andcommon in society today that it is almost impossible to imagine asociety where everyone knows the same things and perform the sametasks. This would be a society where everyone grows, or gathers, andprepares their own food, makes their own tools, builds their ownhouse, and so on.

    Cultural evolution is the field of research that studies the creationand diffusion of ideas and societies. It is very uncommon for thesestudies to take into account the effects of specialization. Thisthesis will show that specialization is of great importance tocultural evolution.

    The thesis is divided into three parts: one introduction and two papers. The introduction covers the mathematical models used byeconomists to study the relation between the market and division oflabor. The first paper is an interdisciplinary survey of the researchon division of labor and specialization, including both theoretic andempirical studies. The second paper is a mathematical model of howspecialization of knowledge (i.e. higher education) leads to socialstratification. The model is tested against statistical data fromseveral countries and found to be a good predictor of the differencesin income between people of high and low education.

  • 12.
    EL OUARDI, Abdelghafour
    Mälardalen University, School of Education, Culture and Communication.
    Applying Autonomous Methods for Signal Analysis and Correction with Applications in the ship Industry2018Independent thesis Advanced level (degree of Master (Two Years)), 40 credits / 60 HE creditsStudent thesis
    Abstract [en]

    The manufacturing and transportation industries generate a large amount of data sets which are often of inconsistent quality. The goal of this project is to find the mathematical principles of a system which learns automatically the essential statistical and analytical properties of datasets in order to detect and correct certain classes of faults in real time.

  • 13.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    A componentwise PageRank algorithm2015In: ASMDA 2015 Proceedings: 16th Applied Stochastic Models and Data Analysis International Conference with 4th Demographics 2015 Workshop / [ed] Christos H Skiadas, ISAST: International Society for the Advancement of Science and Technology , 2015, p. 185-198Conference paper (Refereed)
    Abstract [en]

    In this article we will take a look at a variant of the PageRank algorithminitially used by S. Brinn and L. Page to rank homepages on the Internet. The aim ofthe article is to see how we can use the topological structure of the graph to speed upcalculations of PageRank without doing any additional approximations. We will seethat by considering a non-normalized version of PageRank it is easy to see how wecan handle dierent types of vertices or strongly connected components in the graphmore eciently. Using this we propose two PageRank algorithms, one similar to theLumping algorithm proposed by Qing et al which handles certain types of verticesfaster and last another PageRank algorithm which can handle more types of verticesas well as strongly connected components more eectively. In the last sections we willlook at some specic types of components as well as verifying the time complexity ofthe algorithm.

  • 14.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Calculating PageRank in a changing network with added or removed edges2017In: AIP Conference Proceedings, Volume 1798 / [ed] Seenith Sivasundaram, American Institute of Physics (AIP), 2017, Vol. 1798, p. 020052-1-020052-8, article id 020052Conference paper (Refereed)
    Abstract [en]

    PageRank was initially developed by S. Brinn and L. Page in 1998 to rank homepages on the Internet using the stationary distribution of a Markov chain created using the web graph. Due to the large size of the web graph and many other real worldnetworks fast methods to calculate PageRank is needed and even if the original way of calculating PageRank using a Power iterations is rather fast, many other approaches have been made to improve the speed further. In this paper we will consider the problem of recalculating PageRank of a changing network where the PageRank of a previous version of the network is known. In particular we will consider the special case of adding or removing edges to a single vertex in the graph or graph component

  • 15.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Graph partitioning and a component wise PageRank algorithmManuscript (preprint) (Other academic)
    Abstract [en]

    In this article we will present a graph partitioning algorithm which partitions a graphinto two different types of components: the well known ‘strongly connected components’ as well as another type of components we call ‘connected acyclic component’. We will give analgorithm based on Tarjan’s algorithm for finding strongly connected components used to find such a partitioning. We will also show that the partitioning given by the algorithm is unique and that the underlying graph can be represented as a directed acyclic graph (similar to a pure strongly connected component partitioning). In the second part we will show how such an partitioning of a graph can be used to calculate PageRank of a graph effectively by calculating PageRank for different componentson the same ‘level’ in parallel as well as allowing for the use of different types of PageRankalgorithms for different types of components. To evaluate the method we have calculated PageRank on four large example graphs and compared it with a basic approach, as well as our algorithm in a serial as well as parallel implementation.

  • 16.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Non-normalized PageRank and random walks on N-partite graphs2014In: SMTDA 2014 Proceedings / [ed] H. Skiadas (Ed), 2014, p. 193-202Conference paper (Refereed)
    Abstract [en]

    In this article we will look at a variation of the PageRank algorithmoriginally used by L. Page and S. Brin to rank home pages on the Web. Wewill look at a non-normalized variation of PageRank and show how this version ofPageRank relates to a random walk on a graph. The article has its main focus inunderstanding the behavior of the ranking depending on the structure of the graphand how the ranking changes as the graph change. More specic we will look atN-partite graphs and see that by considering a random walk on the graph we cannd explicit formulas for PageRank of the vertices in the graph. Both the case withuniform and non-uniform personalization vector are considered.

  • 17.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph2016In: Engineering Mathematics II: Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization / [ed] Sergei Silvestrov; Milica Rancic, Springer, 2016, p. 223-247Chapter in book (Refereed)
    Abstract [en]

    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.

  • 18.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    PageRank, Connecting a Line of Nodes with a Complete Graph2016In: Engineering Mathematics II: Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization / [ed] Sergei Silvestrov; Milica Rancic, Springer, 2016Chapter in book (Refereed)
    Abstract [en]

    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.

  • 19.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    PageRank for networks, graphs and Markov chains2017In: Theory of Probability and Mathematical Statistics, ISSN 0868-6904, Vol. 96, p. 61-83Article in journal (Refereed)
    Abstract [en]

    In this work it is described how a partitioning of a graph into components can be used to calculate PageRank in a large network and how such a partitioning can be used to re-calculate PageRank as the network changes. Although considered problem is that of calculating PageRank, it is worth to note that the same partitioning method could be used when working with Markov chains in general or solving linear systems as long as the method used for solving a single component is chosen appropriately. An algorithm for calculating PageRank using a modified partitioning of the graph into strongly connected components is described. Moreover, the paper focuses also on the calculation of PageRank in a changing graph from two different perspectives, by considering specific types of changes in the graph and calculating the difference in rank before and after certain types of edge additions or removals between components. Moreover, some common specific types of graphs for which it is possible to find analytic expressions for PageRank are considered, and in particular the complete bipartite graph and how PageRank can be calculated for such a graph. Finally, several open directions and problems are described.

  • 20.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Using graph partitioning to calculate PageRank in a changing network2016In: Proceedings of the 4th Stochastic Modeling Techniques and DataAnalysis International Conference with Demographics Workshop (SMTDA2016) / [ed] Christos H Skiadas, 2016, p. 155-164Conference paper (Refereed)
    Abstract [en]

    PageRank was rst dened by S. Brinn and L. Page in 1998 in order torank homepages on the Internet for use in search engines using a random walk on theweb graph. While the original way to calculate PageRank is fast, due to the hugesize and growth of the web there have been many attempts at improving upon thecalculation speed of PageRank through various means. In this article we will lookat a slightly dierent but equally important problem, namely how to improve thecalculation speed of PageRank in a changing network where PageRank of an earlierstage of the network is available.In particular we consider two types of changes in the graph, the change in rank afterchanging the personalization vector used in calculating PageRank as well as addedor removed edges between dierent strongly connected components in the network.

  • 21.
    Engström, Christopher
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Using graph partitioning to calculate PageRank in a changing networkManuscript (preprint) (Other academic)
    Abstract [en]

    PageRank was first defined by S. Brinn and L. Page in 1998 in order to rank homepages on the Internet by ranking pages according to the stationary distribution of a random walk on the web graph. While the original way to calculate PageRank is fast, due to the huge size and growth of the web there have been many attempts at improving upon the calculation speed of PageRank through various means. In this article we will look at a slightly different but equally important problem, namely how to improve the calculation of PageRank in a changing network where PageRank of an earlier stage of the network is available. In particular we consider two types of changes in the graph, the change in rank after changing the personalization vector used in calculating PageRank as well as added or removed edges between different strongly connected components in the network.

  • 22.
    Eriksson, Kimmo
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Sjöstrand, Jonas
    Royal Institute of Technology,Stockholm, Sweden .
    On two theorems of Quinzii and rent controlled housing allocation in Sweden2007In: International Game Theory Review, ISSN 0219-1989, Vol. 9, no 3, p. 515-526Article in journal (Refereed)
    Abstract [en]

    The Swedish rent control system creates a white market for swapping rental contracts and a black market for selling rental contracts. Empirical data suggests that in this black-and-white market some people act according to utility functions that are both discontinuous and locally decreasing in money. We discuss Quinzii's theorem for the nonemptiness of the core of generalized house-swapping games, and show how it can be extended to cover the Swedish game. In a second part, we show how this theorem of Quinzii and her second theorem on nonemptiness of the core in two-sided models are both special cases of a more general theorem.

  • 23.
    Eriksson, Kimmo
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Sjöstrand, Jonas
    Mälardalen University, Department of Mathematics and Physics.
    Strimling, Pontus
    Mälardalen University, Department of Mathematics and Physics.
    Optimal Expected Rank in a Two-Sided Secretary Problem2007In: Operations Research, ISSN 0030-364X, Vol. 55, no 5, p. 921-931Article in journal (Refereed)
    Abstract [en]

    In a two-sided version of the famous secretary problem, employers search for a secretary at the same time as secretaries search for an employer. Nobody accepts being put on hold, and nobody is willing to take part in more than N interviews. Preferences are independent, and agents seek to optimize the expected rank of the partner they obtain among the N potential partners. We find that in any subgame perfect equilibrium, the expected rank grows as the square root of N (whereas it tends to a constant in the original secretary problem). We also compute how much agents can gain by cooperation.

  • 24.
    Eriksson, Kimmo
    et al.
    Mälardalen University, School of Education, Culture and Communication.
    Strimling, Pontus
    Stockhom Univ.
    Partner Search Heuristics in the Lab: Stability of Matchings Under Various Preference Structures2009In: Adaptive Behavior, ISSN 1059-7123, E-ISSN 1741-2633, Vol. 17, no 6, p. 524-536Article in journal (Refereed)
    Abstract [en]

    When agents search for partners, the outcome is a matching. K. Eriksson and O. Häggström (2008)defined a measure of instability of matchings and proved that under a certain partner search heuristic,outcomes are likely to have low instability. They also showed that with regards to stability, the preferencestructure known as common preferences lie somewhere in between the extreme cases of homotypicand antithetical preferences. Following up on this theoretical work, we let human subjectssearch for a good partner in a computer game where preferences were set to be either common,homotypic, or antithetical. We find that total search effort and instability of the outcome vary in thepredicted ways with the preference structure and the number of agents. A set of simulations showthat these results are consistent with a model where agents use a simple search heuristic with a slightpossibility of error.

  • 25.
    Ghimire, Sushil
    et al.
    Pulchowk Campus, Institute of Engineering, Tribhuvan University, Nepal.
    Gyan, Bahadur Thapa
    Pulchowk Campus, Institute of Engineering, Tribhuvan University, Nepal.
    Ghimire, Ram Prasad
    Department of Mathematical Sciences, School of Science, Kathmandu University, Nepal.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    A Survey on Queueing Systems with Mathematical Models and Applications2017In: American Journal of Operational Research, ISSN 2324-6537, E-ISSN 2324-6545, ISSN 2324-6537, Vol. 7, no 1, p. 1-14Article in journal (Refereed)
    Abstract [en]

    Queuing systems consist of one or more servers that provide some sort of services to arriving customers. Almost everyone has some experience of tedious time being in a queue during several daily life activities. It is reasonable to accept that service should be provided to the one who arrives first in the queue. But this rule always may not work. Sometimes the last comer or the customer in the high priority gets service earlier than the one who is waiting in the queue for a long time. All these characteristics are the interesting areas of research in the queueing theory. In this paper, we present some of the previous works of various researchers with brief explanations. We then carry out some of the mathematical expressions which represent the different queueing behaviors. In almost all the literatures, these queueing behaviors are examined with the help of mathematical simulations. Based on the previous contributions of researchers, our specific point of attraction is to study the finite capacity queueing models in which limited number of customers are served by a single or multiple number of servers and the batch queueing models where arrival or service or both occur in a bulk. Furthermore, we present some performance measure equations of some queueing models together with necessary components used in the queueing theory. Finally, we report some applications of queueing systems in supply chain management pointing out some areas of research as further works.

  • 26.
    Guariglia, Emanuel
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. University of Salerno, Italy.
    Entropy and fractal antennas2016In: Entropy, ISSN 1099-4300, E-ISSN 1099-4300, Vol. 18, no 3, article id 84Article in journal (Refereed)
    Abstract [en]

    The entropies of Shannon, Rényi and Kolmogorov are analyzed and compared together with their main properties. The entropy of some particular antennas with a pre-fractal shape, also called fractal antennas, is studied. In particular, their entropy is linked with the fractal geometrical shape and the physical performance.

  • 27.
    Guariglia, Emanuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. University of Salerno, Italy.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    A functional equation for the Riemann zeta fractional derivative2017In: Proceedings of INCPAA 2016, 11th International Conference on Mathematical Problems in Engineering, Aerospace and Sciences / [ed] Sivasundaram, S, American Institute of Physics (AIP), 2017, Vol. 1798, p. 020063-1-020063-10, article id UNSP 020063Conference paper (Refereed)
    Abstract [en]

    In this paper a functional equation for the fractional derivative of the Riemann zeta function is presented. The fractional derivative of the zeta function is computed by a generalization of the Grunwald-Letnikov fractional operator, which satisfies the generalized Leibniz rule. It is applied to the asymmetric functional equation of the Rieman zeta function in order to obtain the result sought. Moreover, further properties of this fractional derivative are proposed and discussed.

  • 28.
    Guariglia, Emanuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Fractional Derivative of Riemann zeta function and Main Properties2016Conference paper (Other academic)
    Abstract [en]

    The Caputo-Ortigueira fractional derivative provides the fractional derivativeof complex functions. This derivative plays an important role in the number theory, and has been shown suitable for the analysis of the Dirichlet series, Hurwitz zeta function and Riemann zeta function. An integral representation for the fractional derivative of the Riemann zeta function was discovered. Since the Riemann zeta function is widely used in Physics, the unilateral Fourier transform of its fractional derivative is computed to investigate its applications in Quantum Theory and Signal Processing.

  • 29.
    Guariglia, Emanuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on D’(C)2016In: Engineering Mathematics II: Algebraic, Stochastic and Analysis Structures for Networks, Data Classification and Optimization / [ed] Silvestrov, Sergei; Rančić, Milica, Springer, 2016, p. 337-353Chapter in book (Refereed)
    Abstract [en]

    In the following chapter we describe a wavelet expansion theory for positivedefinite distributions over the real line and define a fractional derivative operator for complex functions in the distribution sense. In order to obtain a characterisation of the complex fractional derivative through the distribution theory, the Ortigueira-Caputo fractional derivative operator is rewritten as a convolution product according to the fractional calculus of real distributions. In particular, the fractional derivative of the Gabor-Morlet wavelet is computed together with its plots and main properties.

  • 30.
    Guariglia, Emanuel
    et al.
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Qi, Xiaomin
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    A spectral analysis of the Weierstrass-Mandelbrot function on the Cantor set2016Conference paper (Other academic)
    Abstract [en]

    In this paper, the Weierstrass-Mandelbrot function on the Cantor set is presented with emphasis on possible applications in science and engineering. An asymptotic estimation of its one-sided Fourier transform, in accordance with the simulation results, is analytically derived. Moreover, a time-frequency analysis of the Weierstrass-Mandelbrot function is provided by the numerical computation of its continuous wavelet transform.

  • 31. Hagelin, N
    et al.
    Pramborg, B
    Stenberg, F
    Mälardalen University, Department of Mathematics and Physics.
    Hedge Fund Allocation under Higher Moments and Illiquidity2005In: HEDGE FUNDS: INSIGHTS IN PERFORMANCE MEASUREMENT, RISK ANALYSIS, AND PORTFOLIO ALLOCATION, John Wiley & Sons , 2005Chapter in book (Other academic)
    Abstract [en]

    We use the discrete-time dynamic investment model to evaluate the gains from including hedge funds in the investment opportunity set. In this multi-period framework, an investor's utility is affected by all moments of the return distribution. We assume that investors rebalance their portfolios on a monthly basis, and we compare the performance of portfolios which may include hedge funds versus portfolios consisting of stocks and bonds only. Our findings show that: (1) investors will allocate wealth to hedge funds even when they take into account deviations from normality in hedge fund returns. Those ex ante optimal allocations result in portfolios that ex post have higher geometric returns compared to the case in which hedge fund investing is not permitted; (2) investors that form portfolios taking all moments of the return distribution into account construct portfolios that are very similar to the portfolios being constructed by investors who care only about expected return and standard deviation, suggesting that the two first moments of the return distribution dominate higher moments; (3) the positive effect on capital growth from including hedge funds into the portfolios remains, although smaller, when the so-called "stale-pricing effect" is considered; and (4) lock-up periods and advance notice periods may force investors to have portfolios that deviate from their targeted ex ante optimal portfolios. Through a simple experiment we show that this inability to rebalance hedge fund allocations may seriously impact the benefits that hedge fund allocations appear to offer.

  • 32.
    Hagelin, N.
    et al.
    Stockholm University.
    Pramborg, B.
    Stockholm University.
    Stenberg, Fredrik
    Mälardalen University, Department of Mathematics and Physics.
    Gains from Adding Funds of Hedge Funds to Portfolios of Traditional Assets: An International Perspective2005In: FUNDS OF HEDGE FUNDS: Performance, Assessment, Diversification, and Statistical Properties, BUTTERWORTH HEINEMANN , 2005, p. 171-187Chapter in book (Other academic)
    Abstract [en]

    We investigate the certainty-equivalent wealth gain from adding funds of hedge funds to portfolios of traditional assets for investors in G7 countries. The allows us to incorporate the effect of currency exposure and different proxies of equity performance. We find that for many investors, access to funds of hedge funds is as valuable as access to international equity markets. Difference between investors in different countries are documented. These differences are due to the relative performance of the different equity markets as well as the fact that hedge fund exposure contains currency exposure that vigilant investors should take care in hedging to reduce unnecessary volatility.

  • 33.
    Hamon, Thierry
    et al.
    LIM&BIO (EA3969), Université Paris 13, France.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Manser, Mounira
    Université Paris 13, France.
    Badji, Zina
    Universiteá Lille, Villeneuve d'Ascq, France.
    Grabar, Natalia
    Universiteá Lille, Villeneuve d'Ascq, France.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Combining Compositionality and Pagerank for the Identification of Semantic Relations between Biomedical Words2012In: BioNLP: Proceedings of the 2012 Workshop on Biomedical Natural Language Processing, 2012, p. 109-117Conference paper (Refereed)
    Abstract [en]

    The acquisition of semantic resources and relations is an important task for several applications, such as query expansion, information retrieval and extraction, machine translation. However, their validity should also be computed and indicated, especially for automatic systems and applications. We exploit the compositionality based methods for the acquisition of synonymy relations and of indicators of these synonyms. We then apply pagerank-derived algorithm to the obtained semantic graph in order to filter out the acquired synonyms. Evaluation performed with two independent experts indicates that the quality of synonyms is systematically improved by 10 to 15% after their filtering.

  • 34.
    Hamon, Thierry
    et al.
    LIMSI-CNRS, Orsay, France.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Term Ranking Adaptation to the Domain: Genetic Algorithm-Based Optimisation of the C-Value2014In: Advances in Natural Language Processing: 9th International Conference on NLP, PolTAL 2014, Warsaw, Poland, September 17-19, 2014. Proceedings, Springer International Publishing , 2014, Vol. 8686, p. 71-83Conference paper (Refereed)
    Abstract [en]

    Term extraction methods based on linguistic rules have been proposed to help the terminology building from corpora. As they face the difficulty of identifying the relevant terms among the noun phrases extracted, statistical measures have been proposed. However, the term selection results may depend on corpus and strong assumptions reflecting specific terminological practice. We tackle this problem by proposing a parametrised C-Value which optimally considers the length and the syntactic roles of the nested terms thanks to a genetic algorithm. We compare its impact on the ranking of terms extracted from three corpora. Results show average precision increased by 9% above the frequency-based ranking and by 12% above the C-Value-based ranking.

  • 35.
    Holmström, Kenneth
    Mälardalen University, Department of Mathematics and Physics.
    A Global Optimization Approach for Integrated Design and Parameter Estimation in Process Engineering2006Other (Other academic)
  • 36.
    Holmström, Kenneth
    Mälardalen University, Department of Mathematics and Physics.
    An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization2008In: Journal of Global Optimization, ISSN 1573-2916, Vol. 41, no 3, p. 447-464Article in journal (Refereed)
    Abstract [en]

    Powerful response surface methods based on kriging and radial basis function (RBF) interpolation have been developed for expensive, i.e. computationally costly, global nonconvex optimization. We have implemented some of these methods in the solvers rbfSolve and EGO in the TOMLAB Optimization Environment (http://www.tomopt.com/tomlab/). In this paper we study algorithms based on RBF interpolation. The practical performance of the RBF algorithm is sensitive to the initial experimental design, and to the static choice of target values. A new adaptive radial basis interpolation (ARBF) algorithm, suitable for parallel implementation, is presented. The algorithm is described in detail and its efficiency is analyzed on the standard test problem set of Dixon-Szego. Results show that it outperforms the published results of rbfSolve and several other solvers.

  • 37.
    Holmström, Kenneth
    Mälardalen University, Department of Mathematics and Physics.
    An Adaptive Radial Basis Algorithm (ARBF) for Expensive Black-Box Mixed-Integer Constrained Global Optimization2005In: Conference on Least Squares and Optimization: In honour of professor Per-Åke Wedin, Umeå University, November 16-17, 2005, 2005Conference paper (Refereed)
  • 38.
    Holmström, Kenneth
    Mälardalen University, Department of Mathematics and Physics.
    An Adaptive Radial Basis Algorithm (ARBF) for Mixed-Integer Expensive Constrained Global Optimization2005In: Proceedings of the International Workshop on Global Optimization: San Jose, Almeria, Spain, September 18-22, 2005, 2005, p. 133-140Conference paper (Refereed)
  • 39.
    Holmström, Kenneth
    Mälardalen University, Department of Mathematics and Physics.
    Nonlinear Systems Modeling and Optimization: State-of-Art and Perspectives: Panel presentation2006In: EURO XXI, 21th European Conference on Operational Research, Reykavik, Iceland, July 2-5, 2006: OR for Better Management of Sustainable Development, 2006Conference paper (Refereed)
  • 40.
    Holmström, Kenneth
    Mälardalen University, Department of Mathematics and Physics.
    Radial Basis Algorithms for Expensive Derivative-Free Black-Box Mixed-Integer Constrained Global Optimization2007In: Conference Proceeding GOR Workshop on Global Optimization: 79th Meeting of the GOR Working Group, Physikzentrum, Bad Honnef, 18-19 October 2007, 2007Conference paper (Refereed)
  • 41.
    Holmström, Kenneth
    Mälardalen University, Department of Mathematics and Physics.
    TOMLAB - Unique Features for Advanced Optimization in MATLAB2006Other (Other academic)
  • 42.
    Holmström, Kenneth
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Edvall, Marcus
    Göran, Anders
    Daily Milk Cow Feed Optimization in the Nordic Countries with TOMLAB2006In: EURO XXI, 21th European Conference on Operational Research, Reykavik, Iceland, July 2-5, 2006: OR for Better Management of Sustainable Development, 2006Conference paper (Refereed)
  • 43.
    Holmström, Kenneth
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Edvall, Marcus
    Göran, Anders
    TOMLAB - Large-Scale Optimization in MATLAB, LABVIEW and .NET2007In: ICCOPT II & MOPTA-07, 2nd Mathematical Programming Society International Conference on Continuous Optimization: McMaster University, Hamilton, Canada, August 12-16, 2007, 2007Conference paper (Refereed)
  • 44.
    Holmström, Kenneth
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Edvall, Marcus M.
    Göran, Anders
    Mixed-Integer expensive constrained global optimization with TOMLAB2005In: The eight SIAM conference about Optimization: Stockholm, May 15-19, 2005, 2005Conference paper (Refereed)
  • 45.
    Holmström, Kenneth
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Quttineh, Nils-Hassan
    Mälardalen University, Department of Mathematics and Physics.
    Radial Basis Algorithms for Mixed-Integer Expensive Constrained Global Optimization2006In: Second International Workshop on SURROGATE MODELLING AND SPACE MAPPING FOR ENGINEERING OPTIMIZATION: SMSMEO-06, Copenhagen, Denmark, November 9-11, 2006, 2006Conference paper (Refereed)
  • 46.
    Hoolmström, Kenneth
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Quttineh, Nils-Hassan
    Mälardalen University, Department of Mathematics and Physics.
    An Adaptive Radial Basis Algorithm (ARBF) for Expensive Black-Box Mixed-Integer Constrained Global Optimization2006In: EURO XXI, 21th European Conference on Operational Research, Reykavik, Iceland, July 2-5, 2006: OR for Better Management of Sustainable Development, 2006Conference paper (Refereed)
  • 47.
    Hosain, Md Lokman
    et al.
    Mälardalen University, School of Business, Society and Engineering, Future Energy Center. ABB AB, Corporate Research, Västerås, Sweden.
    Fdhila, Rebei Bel
    Mälardalen University, School of Business, Society and Engineering, Future Energy Center. ABB AB, Corporate Research, Västerås, Sweden.
    Rönnberg, Kristian
    ABB AB, Corporate Research.
    Air-Gap Flow and Thermal Analysis of Rotating Machines using CFD2017In: Energy Procedia, ISSN 1876-6102, E-ISSN 1876-6102, Vol. 105, p. 5153-5159Article in journal (Refereed)
    Abstract [en]

    Thermal management of the rotating electrical machines is a very challenging area which needs appropriate solutions for each machine and operating condition. The heat is generated by the electromagnetic losses and the mechanical friction during the rotation. Computational Fluid Dynamics (CFD) is used in this study to predict and analyze the thermal performance of a rotating electrical machine where high speed rotation is coupled with small flow gaps. The investigation presented in this paper is based on a geometry used for model assessment and verification purposes. However, the approach outlined and the observations made are transferrable to other geometries. ANSYS Fluent has been used to perform CFD simulation where both the air velocity field and the temperature distribution are obtained. The results are qualitatively highly interesting to understand the thermal behavior within an electrical machine operations. The results show a periodic temperature distribution on the stator surface with similar periodic pattern for the heat transfer coefficient on the rotor surface. The simulated average heat transfer coefficient at the rotor surface is compared with the correlations from published literature with an overall good agreement.

  • 48.
    Jada, Pratap Kumar
    et al.
    Department of Mathematics Gulbarga University Gulbarga, Karnataka, India.
    Jawali, Umavathi C
    Department of Mathematics, Gulbarga University, Gulbarga, Karnataka, India, and Department of Engineering, University of Sannio, Benevento, Italy.
    Metri, Prashant G
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Effect of First Order Chemical Reaction on Magneto Convection in a Vertical Double Passage Channel2016In: Engineering Mathematics I: Electromagnetics, Fluid Mechanics, Material Physics and Financial Engineering / [ed] Sergei Silvestrov, Milica Rancic, Springer, 2016, p. 247-279Chapter in book (Refereed)
    Abstract [en]

    The objective of this paper is to study magnetohydrodynamic flow in a vertical double passage channel taking into account the presence of the first order chemical reaction. The channel is divided into two passages by means of a thin,perfectly conducting plane baffle and hence the velocity will be individual in each stream. The governing equations are solved by using regular perturbation technique valid for small values of the Brinkman number and differential transform method valid for all values of the Brinkman number. The results are obtained for velocity, temperature and concentration. The effects of various dimensionless parameters such as thermal Grashof number, mass Grashof number, Brinkman number, first order chemical reaction parameter, and Hartman number on the flow variables are discussed and presented graphically for open and short circuits. The validity of solutions obtained by differential transform method and regular perturbation method are in good agreement for small values of the Brinkman number. Further the effects of governing parameters on the volumetric flow rate, species concentration, total heart rate, skin friction and Nusselt number are also observed and tabulated.

  • 49.
    Jankoski, Radoslav
    et al.
    Ss. Cyril and Methodius University, FEIT, Skopje, Macedonia .
    Rancic, Milica
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Arnautovski-Toseva, Vesna
    Ss. Cyril and Methodius University, FEIT, Skopje, Macedonia .
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Comparison of TL, Point-Matching and Hybrid Circuit Method Analysis of a Horizontal Dipole Antenna Immersed in Lossy Soil2016In: Engineering Mathematics I: Electromagnetics, Fluid Mechanics, Material Physics and Financial Engineering / [ed] Sergei Silvestrov, Milica Rančić, Heidelberg: Springer, 2016, p. 51-63Chapter in book (Refereed)
    Abstract [en]

    HF analysis of a horizontal dipole antenna buried in lossy ground has been performed in this paper. The soil is treated as a homogenous half-space of known electrical parameters. The authors compare the range of applicability of two forms of transmission line model , a hybrid circuit method, and a point-matching method in such analysis.

  • 50.
    Javor, Vesna
    University of Nis, Faculty of Electronic Eng., Serbia.
    Rancic, Milica
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Electrostatic Discharge Currents and Their Derivatives Approximation by Piecewise Power-Exponential FunctionsIn: IEEE transactions on dielectrics and electrical insulation, ISSN 1070-9878, E-ISSN 1558-4135Article in journal (Refereed)
123 1 - 50 of 136
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf