| 11. |
- Silvestrov, Dmitrii S.
(author)
-
Upper bounds for exponential moments of hitting times for semi-Markov processes
- 2004
-
In: Communications in Statistics - Theory and Methods. - 0361-0926 .- 1532-415X. ; 33:3, s. 533-544
-
Journal article (peer-reviewed)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.
|
|
| 12. |
|
|
| 13. |
- Andrén, Daniel, 1973-, et al.
(author)
-
On the complexity of matrix reduction over finite fields
- 2007
-
In: Advances in Applied Mathematics. - : Academic Press. - 0196-8858 .- 1090-2074. ; 39:4, s. 428-452
-
Journal article (peer-reviewed)abstract
- We study matrix elimination over finite fields, and present an algorithm which is asymptotically faster than the traditional Gauss--Jordan elimination. We also bound the average and worst-case complexity for the problem, proving that our algorithm is close to being optimal, and show related concentration results for random matrices.Next we present the results of a large computational study of the complexities for small matrices and fields. Here we determine the exact distribution of the complexity for matrices from $\mathrm{GL}_{n}(\mathbb{F}_{q})$, with $n$ an $q$ smallFinally we consider an extension of the problems studied for finite fields to finite semifields. We give a conjecture on the behaviour of a natural analogue of $\mathrm{GL}_{n}$ for semifields and prove this for a certain class of semifields.
|
|
| 14. |
- Bengtsson, Lars, 1963, et al.
(author)
-
Transformer : Från jw till wavelets
- 2007
-
Book (other academic/artistic)abstract
- Den här boken beskriver idéerna och matematiken bakom de vanligaste transformerna, Laplace-, Fourier- och z-transformen, sett framför allt ur elektroingnejörens perspektiv. Boken knyter också ihop transformernan, dles med den vanliga jw-metoden, och dels med en introduktion till wavelet-transform. Boken har ett stort antal övningar med fullständiga lösningar och lämpar sig väl som kursbok i transformkuresr eller som bredvidläsningsbok i signalbehandlingsnära kurser.
|
|
| 15. |
- Bengtsson, Lars, 1963, et al.
(author)
-
Transformer
- 2007
-
Book (other academic/artistic)abstract
- Den här boken beskriver idéerna och matematiken bakom de vanligaste transformerna, Laplace-, Fourier- och z-transformen, sett framför allt ur elektroingnejörens perspektiv. Boken knyter också ihop transformernan, dles med den vanliga jw-metoden, och dels med en introduktion till wavelet-transform. Boken har ett stort antal övningar med fullständiga lösningar och lämpar sig väl som kursbok i transformkuresr eller som bredvidläsningsbok i signalbehandlingsnära kurser.
|
|
| 16. |
- Dahl, Ingolf, 1950
(author)
-
Obtuse-Angle Shadowing Networks and Distance-Based Interpolation
- 2009
-
In: The Wolfram Demonstrations Project.
-
Journal article (peer-reviewed)abstract
- Bad data is much more common than good data. Suppose that you have a set of scattered points in any or an unknown number of dimensions and that although you may not know their coordinates, you know how to calculate the distances between them. You can use this information to define an obtuse-angle shadowing network connecting nearby points in the set. If you have a function defined on this point set, you might use this network to define a distance-based interpolation function to estimate the function value for a new point of the same kind. Such networks and this kind of interpolation should have applications in various fields, for example, image processing and machine learning. This Demonstration applies obtuse-angle shadowing networks to small 2D point sets and also illustrates distance-based interpolation, assuming random function values at the points. The interpolated function is shown as a contour plot. You can change the function value at the green point.
|
|
| 17. |
- Eriksson, Kimmo, et al.
(author)
-
Optimal Expected Rank in a Two-Sided Secretary Problem
- 2007
-
In: Operations Research. - : Institute for Operations Research and the Management Sciences (INFORMS). - 0030-364X .- 1526-5463. ; 55:5, s. 921-931
-
Journal article (peer-reviewed)abstract
- 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.
|
|
| 18. |
- Gerlee, Philip, 1980, et al.
(author)
-
The Emergence of Overlapping Scale-free Genetic Architecture in
- 2008
-
In: Artificial Life. - 1064-5462 .- 1530-9185. ; 14:3, s. 265-275
-
Journal article (peer-reviewed)abstract
- We have studied the evolution of genetic architecture in digital organisms and found that the gene overlap follows a scale-free distribution, which is commonly found in metabolic networks of many organisms. Our results show that the slope of the scale-free distribution depends on the mutation rate and that the gene development is driven by expansion of already existing genes, which is in direct correspondence to the preferential growth algorithm that gives rise to scale-free networks. To further validate our results we have constructed a simple model of gene development, which recapitulates the results from the evolutionary process and shows that the mutation rate affects the tendency of genes to cluster. In addition we could relate the slope of the scale-free distribution to the genetic complexity of the organisms and show that a high mutation rate gives rise to a more complex genetic architecture.
|
|
| 19. |
|
|
| 20. |
|
|
