SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "AMNE:(NATURVETENSKAP Matematik) "

Sökning: AMNE:(NATURVETENSKAP Matematik)

  • Resultat 21-30 av 33494
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
21.
  • Önskog, Thomas, 1979-, et al. (författare)
  • The Skorohod oblique reflection problem in time-dependent domains
  • 2010
  • Ingår i: Annals of Probability. - : Project Euclid. - 0091-1798 .- 2168-894X. ; 38:6, s. 2170-2223
  • Tidskriftsartikel (refereegranskat)abstract
    • The deterministic Skorohod problem plays an important role in the construction and analysis of diffusion processes with reflection. In the form studied here, the multidimensional Skorohod problem was introduced, in time-independent domains, by H. Tanaka and further investigated by P.-L. Lions and A.-S. Sznitman in their celebrated article. Subsequent results of several researchers have resulted in a large literature on the Skorohod problem in time-independent domains. In this article we conduct a thorough study of the multidimensional Skorohod problem in time-dependent domains. In particular, we prove the existence of càdlàg solutions (x, λ) to the Skorohod problem, with oblique reflection, for (D,,w) assuming, in particular, that D is a time-dependent domain (Theorem 1.2). In addition, we prove that if w is continuous, then x is continuous as well (Theorem 1.3). Subsequently, we use the established existence results to construct solutions to stochastic differential equations with oblique reflection (Theorem 1.9) in time-dependent domains. In the process of proving these results we establish a number of estimates for solutions to the Skorohod problem with bounded jumps and, in addition, several results concerning the convergence of sequences of solutions to Skorohod problems in the setting of time-dependent domains.
  •  
22.
  • 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.
  •  
23.
  • Asratian, Armen, et al. (författare)
  • Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs
  • 2009
  • Ingår i: Journal of Graph Theory. - : Wiley Periodicals Inc.. - 0364-9024 .- 1097-0118. ; 61:2, s. 88-97
  • Tidskriftsartikel (refereegranskat)abstract
    • An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigraph is a bipartite graph in which each vertex of one part has degree 3 and each vertex of the other has degree 4; it is unknown whether these all have interval colorings. We prove that G has an interval coloring using 6 colors when G is a (3,4)-biregular bigraph having a spanning subgraph whose components are paths with endpoints at 3-valent vertices and lengths in {2, 4, 6, 8}. We provide several sufficient conditions for the existence of such a subgraph.
  •  
24.
  • Geli, Patricia (författare)
  • Modeling the Mechanism of Postantibiotic Effect and Determining Implications for Dosing Regimens
  • 2009
  • Ingår i: Journal of Mathematical Biology. - : Springer Science and Business Media LLC. - 0303-6812 .- 1432-1416. ; 59:5, s. 1416-1432
  • Tidskriftsartikel (refereegranskat)abstract
    • A stochastic model is proposed to explain one possible underlying mechanism of the postantibiotic effect (PAE). This phenomenon, of continued inhibition of bacterial growth after removal of the antibiotic drug, is of high relevance in the context of optimizing dosing regimens. One clinical implication of long PAE lies in the possibility of increasing intervals between drug administrations. The model describes the dynamics of synthesis, saturation and removal of penicillin binding proteins (PBPs). High fractions of saturated PBPs are in the model associated with a lower growth capacity of bacteria. An analytical solution for the bivariate probability of saturated and unsaturated PBPs is used as a basis to explore optimal antibiotic dosing regimens. Our finding that longer PAEs do not necessarily promote for increased intervals between doses, might help for our understanding of data provided from earlier PAE studies and for the determination of the clinical relevance of PAE in future studies.
  •  
25.
  • Gaidashev, Denis, 1973-, et al. (författare)
  • A numerical study of infinitely renormalizable area-preserving maps
  • 2012
  • Ingår i: Dynamical systems. - : Informa UK Limited. - 1468-9367 .- 1468-9375. ; 27:3, s. 283-301
  • Tidskriftsartikel (refereegranskat)abstract
    • It has been shown in Gaidashev and Johnson [D. Gaidashev and T. Johnson, Dynamics of the universal area-preserving map associated with period doubling: stable sets, J. Mod. Dyn. 3(4) (2009), pp. 555–587.] and Gaidashev et al. [D. Gaidashev, T. Johnson, and M. Martens, Rigidity for infinitely renormalizable area-preserving maps, in preparation.] that infinitely renormalizable area-preserving maps admit invariant Cantor sets with a maximal Lyapunov exponent equal to zero. Furthermore, the dynamics on these Cantor sets for any two infinitely renormalizable maps is conjugated by a transformation that extends to a differentiable function whose derivative is Hölder continuous of exponent α > 0. In this article we investigate numerically the specific value of α. We also present numerical evidence that the normalized derivative cocycle with the base dynamics in the Cantor set is ergodic. Finally, we compute renormalization eigenvalues to a high accuracy to support a conjecture that the renormalization spectrum is real.
  •  
26.
  • 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.
  •  
27.
  • Arnlind, Joakim, et al. (författare)
  • Construction of n-Lie algebras and n-ary Hom-Nambu-Lie algebras
  • 2011
  • Ingår i: Journal of Mathematical Physics. - : AIP Publishing. - 0022-2488 .- 1089-7658. ; 52:12, s. 123502-
  • Tidskriftsartikel (refereegranskat)abstract
    • As n-ary operations, generalizing Lie and Poisson algebras, arise in many different physical contexts, it is interesting to study general ways of constructing explicit realizations of such multilinear structures. Generically, they describe the dynamics of a physical system, and there is a need of understanding their quantization. Hom-Nambu-Lie algebras provide a framework that might be an appropriate setting in which n-Lie algebras (n-ary Nambu-Lie algebras) can be deformed, and their quantization studied. We present a procedure to construct (n + 1)-ary Hom-Nambu-Lie algebras from n-ary Hom-Nambu-Lie algebras equipped with a generalized trace function. It turns out that the implications of the compatibility conditions, that are necessary for this construction, can be understood in terms of the kernel of the trace function and the range of the twisting maps. Furthermore, we investigate the possibility of defining (n + k)-Lie algebras from n-Lie algebras and a k-form satisfying certain conditions. (C) 2011 American Institute of Physics. [doi:10.1063/1.3653197]
  •  
28.
  • Discrete Geometry and Mathematical Morphology : First International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24–27, 2021, Proceedings
  • 2021
  • Samlingsverk (redaktörskap) (refereegranskat)abstract
    • This book constitutes the proceedings of the First IAPR International Conference on Discrete Geometry and Mathematical Morphology, DGMM 2021, which was held during May 24-27, 2021, in Uppsala, Sweden.The conference was created by joining the International Conference on Discrete Geometry for computer Imagery, DGCI, with the International Symposium on Mathematical Morphology, ISMM.The 36 papers included in this volume were carefully reviewed and selected from 59 submissions. They were organized in topical sections as follows: applications in image processing, computer vision, and pattern recognition; discrete and combinatorial topology; discrete geometry - models, transforms, visualization; discrete tomography and inverse problems; hierarchical and graph-based models, analysis and segmentation; learning-based approaches to mathematical morphology; multivariate and PDE-based mathematical morphology, morphological filtering.The book also contains 3 invited keynote papers.
  •  
29.
  •  
30.
  • Gäfvert, Oliver, 1991- (författare)
  • Topological and geometrical methods in data analysis
  • 2021
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • This thesis concerns two related data analysis pipelines, using topological and geometrical methods respectively, to extract relevant information. The first pipeline, referred to as the topological data analysis (TDA) pipeline, constructs a filtered simplicial complex on a given data set in order to describe its shape. The shape is described using a persistence module, which characterizes the topological features of the filtration, and the final step of the pipeline extracts algebraic invariants from this object. The second pipeline, referred to as the geometric data analysis (GDA) pipeline, associates an algebraic variety to a given data set and aims to describe the structure of this variety. Its structure is described using homology, an invariant which for most algebraic varieties can only be computed numerically using sampling methods.In Paper A we consider invariants on multi-parameter persistence modules. We explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate  this process by constructing stable invariants for multi-parameter persistence modules with respect to the interleaving distance and so called simple noise systems. For one parameter, we recover the standard barcode information. For more than one parameter we prove that  the constructed invariants are in general NP-hard to calculate. A consequence is that computing the feature counting function, proposed by Scolamiero et. al. (2016), is NP-hard.In Paper B we introduce an efficient algorithm to compute a minimal presentation of a multi-parameter persistent homology module, given a chain complex of free modules as input.  Our approach extends previous  work on this problem in the 2-parameter case, and draws on ideas underlying the F4 and F5 algorithms for Gröbner basis computation. In the r-parameter case, our algorithm computes a presentation for the homology of C ->F A ->G B, with modules of rank l,n,m respectively, in O(r2nr+1 + nrm + nr-1m2 + rn2 l) arithmetic operations. We implement this approach in our new software Muphasa, written in C++. In preliminary computational experiments on synthetic TDA examples,      we compare our approach to a version of a classical approach based on Schreyer's algorithm, and find that ours is substantially faster and more memory efficient. In the course of developing our algorithm for computing presentations, we also introduce algorithms for the closely related problems of computing Gröbner bases for the image and kernel of the morphism G.  This algorithm runs in time O(nrm + nr-1m2) and memory O(n2 + mn + nr + K), where K is the size of the output.Paper C analyzes the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in RN. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDD) of a certain variety called the hypothesis variety as the number of points in the configuration increases. Finally, we establish a connection to complexity of architectures of polynomial neural networks. For the problem of fitting an (N-1)-sphere to a configuration of m points in RN, we give a closed formula for the algebraic complexity of the hypothesis variety as m grows for the case of N=1. For the case N>1 we conjecture a generalization of this formula supported by numerical experiments.In Paper D we present an efficient algorithm to produce a provably dense sample of a smooth compact variety. The procedure is partly based on computing bottlenecks of the variety. Using geometric information such as the bottlenecks and the local reach we also provide bounds on the density of the sample needed in order to guarantee that the homology of the variety can be recovered from the sample. An implementation of the algorithm is provided together with numerical experiments and a computational     comparison to the algorithm by Dufresne et. al. (2019).
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 21-30 av 33494
Typ av publikation
tidskriftsartikel (19288)
konferensbidrag (5265)
annan publikation (2230)
doktorsavhandling (2106)
rapport (1673)
bokkapitel (1196)
visa fler...
licentiatavhandling (897)
bok (459)
forskningsöversikt (127)
samlingsverk (redaktörskap) (100)
proceedings (redaktörskap) (79)
recension (64)
konstnärligt arbete (9)
patent (9)
visa färre...
Typ av innehåll
refereegranskat (23769)
övrigt vetenskapligt/konstnärligt (9387)
populärvet., debatt m.m. (335)
Författare/redaktör
Persson, Lars-Erik (429)
Öberg, Sven (262)
Khrennikov, Andrei, ... (250)
Nordström, Jan (241)
Khrennikov, Andrei (231)
Maligranda, Lech (218)
visa fler...
Jones, R. (203)
Briddon, P. R. (200)
Åström, Karl (170)
Patriksson, Michael, ... (158)
Silvestrov, Sergei, ... (151)
Beilina, Larisa, 197 ... (150)
Muntean, Adrian, 197 ... (146)
Serra-Capizzano, Ste ... (139)
Heyden, Anders (128)
Jakobsson, Andreas (127)
Silvestrov, Sergei, ... (125)
Mazorchuk, Volodymyr (125)
Wall, Peter (120)
von Rosen, Dietrich (120)
Larson, Mats G. (119)
Kurasov, Pavel (116)
Ibragimov, Nail H. (115)
Shestopalov, Yury, 1 ... (112)
Lötstedt, Per (112)
Häggström, Olle, 196 ... (112)
Janson, Svante (111)
Kahl, Fredrik (110)
Asadzadeh, Mohammad, ... (104)
Rychlik, Igor, 1952 (104)
Malyarenko, Anatoliy ... (103)
Kreiss, Gunilla (100)
Lindgren, Georg (97)
Larsson, Stig, 1952 (96)
Nyström, Kaj, 1969- (96)
Lenells, Jonatan, 19 ... (93)
Yu, Jun, 1962- (93)
Janson, Svante, 1955 ... (91)
Nordström, Jan, 1953 ... (90)
Podgórski, Krzysztof (88)
Carlson, Johan, 1972 (86)
Andersson, Mats, 195 ... (83)
Strömberg, Ann-Brith ... (82)
Gustafsson, Bertil (81)
Toft, Joachim, 1964- (81)
Shahgholian, Henrik (81)
Wiberg, Marie, 1976- (81)
Frisén, Marianne, 19 ... (81)
Euler, Norbert (81)
Hansbo, Peter (81)
visa färre...
Lärosäte
Chalmers tekniska högskola (6605)
Uppsala universitet (5108)
Göteborgs universitet (4679)
Kungliga Tekniska Högskolan (4175)
Lunds universitet (3392)
Linköpings universitet (2838)
visa fler...
Stockholms universitet (2548)
Umeå universitet (2037)
Luleå tekniska universitet (1873)
Linnéuniversitetet (1354)
Mälardalens universitet (1002)
Karlstads universitet (817)
Örebro universitet (624)
Mittuniversitetet (480)
Blekinge Tekniska Högskola (443)
Jönköping University (354)
Sveriges Lantbruksuniversitet (290)
Högskolan i Gävle (287)
Högskolan Dalarna (157)
Handelshögskolan i Stockholm (154)
Högskolan i Skövde (136)
Karolinska Institutet (134)
Högskolan i Borås (132)
Högskolan i Halmstad (128)
Högskolan Väst (104)
RISE (104)
Malmö universitet (103)
Södertörns högskola (70)
VTI - Statens väg- och transportforskningsinstitut (41)
Högskolan Kristianstad (32)
Försvarshögskolan (8)
Gymnastik- och idrottshögskolan (6)
Nordiska Afrikainstitutet (2)
Naturvårdsverket (2)
Naturhistoriska riksmuseet (2)
Havs- och vattenmyndigheten (2)
Stockholms konstnärliga högskola (1)
IVL Svenska Miljöinstitutet (1)
Marie Cederschiöld högskola (1)
visa färre...
Språk
Engelska (32055)
Svenska (879)
Latin (315)
Ryska (71)
Polska (54)
Tyska (34)
visa fler...
Franska (33)
Norska (9)
Kinesiska (9)
Spanska (8)
Esperanto (7)
Ukrainska (6)
Finska (4)
Danska (2)
Italienska (2)
Nederländska (1)
Arabiska (1)
Portugisiska (1)
Estniska (1)
Ungerska (1)
Färöiska (1)
visa färre...
Forskningsämne (UKÄ/SCB)
Naturvetenskap (33461)
Teknik (3338)
Samhällsvetenskap (1562)
Medicin och hälsovetenskap (543)
Humaniora (328)
Lantbruksvetenskap (125)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy