SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "AMNE:(NATURVETENSKAP) AMNE:(Matematik) AMNE:(Matematisk analys) srt2:(2020-2024)"

Sökning: AMNE:(NATURVETENSKAP) AMNE:(Matematik) AMNE:(Matematisk analys) > (2020-2024)

  • Resultat 1-10 av 1190
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Sorooshian, Shahryar, 1980, et al. (författare)
  • Expedited analytical hierarchical process for multicriteria decision making
  • 2022
  • Ingår i: ICIC Express Letters. - 1881-803X. ; 16:2, s. 145-151
  • Tidskriftsartikel (refereegranskat)abstract
    • In this study, a procedure to overcome analytical hierarchical process (AHP) limitations was developed and tested, and a tool created via pairwise comparison chart and weighted sum method hybridization was introduced. In addition, a multicriteria decision-making software was selected to validate the constructed hybrid decision-making tool. The software was formulated based on an established decision-making technique. Data for the comparison analysis were obtained from an ongoing research, and output from the comparison analysis provided evidence for the accuracy of the constructed tool. The proposed hybridized method aligned with AHP reasoning but demonstrated a faster process; hence, it was called ‘expedited AHP’.
  •  
2.
  • Sorooshian, Shahryar, 1980, et al. (författare)
  • Performance of the decision-making trial and evaluation laboratory
  • 2023
  • Ingår i: AIMS Mathematics. - : American Institute of Mathematical Sciences (AIMS). - 2473-6988. ; 8:3, s. 7490-7514
  • Tidskriftsartikel (refereegranskat)abstract
    • Multiple attribute decision-making (MADM) techniques constitute a practical approach for solving complex problems involving multiple and often conflicting criteria. Decision-making trial and evaluation laboratory (DEMATEL) is a popular MADM technique with both admirers and critics. This study presents a comprehensive review of DEMATEL through bibliometric analysis using the Scopus database. This article examined 3,521 papers published in journals, conferences or books between 1981 and 2023. We examined a few parameters for commenting on the performance of the technique. Among them are research outputs, the network of DEMATEL users, implementation subject areas, research zones, financing opportunities and publication hosts and their impact trends. We conclude from the findings of this study that the DEMATEL is capable of dealing with modern problem-solving in future environments. Although the growth of new MADMs is obvious, based on the gathered data, we forecast that more than 776 documents will be published in 2025 using DEMATEL for problem-solving. This expanding tendency will continue in the future. As distinct MADMs have diverse constraints, foundations, computing complexity and standpoints, which result in different performances, outmoded low-performance MADM techniques must be reported by researchers to continue this paper’s objective to minimize ambiguity among decision-makers and practitioners. To facilitate such a comparison in the future, a quantitative performance coefficient was also developed here.
  •  
3.
  • Strömberg, Ann-Brith, 1961, et al. (författare)
  • Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods
  • 2020
  • Ingår i: Numerical Nonsmooth Optimization: State of the Art Algorithms. - Cham : Springer International Publishing. ; , s. 499-547, s. 499-547
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • This chapter presents several solution methodologies for mixed-integer linear optimization, stated as mixed-binary optimization problems, by means of Lagrangian duals, subgradient optimization, cutting-planes, and recovery of primal solutions. It covers Lagrangian duality theory for mixed-binary linear optimization, a problem framework for which ultimate success—in most cases—is hard to accomplish, since strong duality cannot be inferred. First, a simple conditional subgradient optimization method for solving the dual problem is presented. Then, we show how ergodic sequences of Lagrangian subproblem solutions can be computed and used to recover mixed-binary primal solutions. We establish that the ergodic sequences accumulate at solutions to a convexified version of the original mixed-binary optimization problem. We also present a cutting-plane approach to the Lagrangian dual, which amounts to solving the convexified problem by Dantzig–Wolfe decomposition, as well as a two-phase method that benefits from the advantages of both subgradient optimization and Dantzig–Wolfe decomposition. Finally, we describe how the Lagrangian dual approach can be used to find near optimal solutions to mixed-binary optimization problems by utilizing the ergodic sequences in a Lagrangian heuristic, to construct a core problem, as well as to guide the branching in a branch-and-bound method. The chapter is concluded with a section comprising notes, references, historical downturns, and reading tips.
  •  
4.
  •  
5.
  • Gerken, Jan, 1991, et al. (författare)
  • Equivariance versus augmentation for spherical images
  • 2022
  • Ingår i: Proceedings of Machine Learning Resaerch. ; 162, s. 7404-7421
  • Konferensbidrag (refereegranskat)abstract
    • We analyze the role of rotational equivariance in convolutional neural networks (CNNs) applied to spherical images. We compare the performance of the group equivariant networks known as S2CNNs and standard non-equivariant CNNs trained with an increasing amount of data augmentation. The chosen architectures can be considered baseline references for the respective design paradigms. Our models are trained and evaluated on single or multiple items from the MNIST- or FashionMNIST dataset projected onto the sphere. For the task of image classification, which is inherently rotationally invariant, we find that by considerably increasing the amount of data augmentation and the size of the networks, it is possible for the standard CNNs to reach at least the same performance as the equivariant network. In contrast, for the inherently equivariant task of semantic segmentation, the non-equivariant networks are consistently outperformed by the equivariant networks with significantly fewer parameters. We also analyze and compare the inference latency and training times of the different networks, enabling detailed tradeoff considerations between equivariant architectures and data augmentation for practical problems.
  •  
6.
  • Brandes, Julia, et al. (författare)
  • On generating functions in additive number theory, II: lower-order terms and applications to PDEs
  • 2021
  • Ingår i: Mathematische Annalen. - : Springer Science and Business Media LLC. - 0025-5831 .- 1432-1807. ; 379, s. 347-76
  • Tidskriftsartikel (refereegranskat)abstract
    • We obtain asymptotics for sums of the form Sigma(p)(n=1) e(alpha(k) n(k) + alpha(1)n), involving lower order main terms. As an application, we show that for almost all alpha(2) is an element of [0, 1) one has sup(alpha 1 is an element of[0,1)) | Sigma(1 <= n <= P) e(alpha(1)(n(3) + n) + alpha(2)n(3))| << P3/4+epsilon, and that in a suitable sense this is best possible. This allows us to improve bounds for the fractal dimension of solutions to the Schrodinger and Airy equations.
  •  
7.
  • Ericsson, Niklas, 1968 (författare)
  • A Framework for Approximation of the Stokes Equations in an Axisymmetric Domain
  • 2021
  • Ingår i: Computational Methods in Applied Mathematics. - : Walter de Gruyter GmbH. - 1609-4840 .- 1609-9389. ; 21:4
  • Tidskriftsartikel (refereegranskat)abstract
    • We develop a framework for solving the stationary, incompressible Stokes equations in an axisymmetric domain. By means of Fourier expansion with respect to the angular variable, the three-dimensional Stokes problem is reduced to an equivalent, countable family of decoupled two-dimensional problems. By using decomposition of three-dimensional Sobolev norms, we derive natural variational spaces for the two-dimensional problems, and show that the variational formulations are well-posed. We analyze the error due to Fourier truncation and conclude that, for data that are sufficiently regular, it suffices to solve a small number of two-dimensional problems. © 2021 Ericsson, published by De Gruyter 2021.
  •  
8.
  • Kim, Inkang, et al. (författare)
  • Toledo invariant of lattices in SU(2,1) via symmetric square
  • 2020
  • Ingår i: Journal of Mathematical Physics. - : AIP Publishing. - 1089-7658 .- 0022-2488. ; 61:11
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we address the issue of the quaternionic Toledo invariant to study the character variety of two-dimensional complex hyperbolic uniform lattices into SU(n, 2), n ≥ 4. We construct four distinct representations to prove that the character variety contains at least seven distinct components. We also show the existence of holomorphic horizontal lift to various period domains of SU(n, 2).
  •  
9.
  • Malik, Adam, 1991 (författare)
  • Mathematical Modelling of Cell Migration and Polarization
  • 2020
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Cell migration plays a fundamental role in both development and disease. It is a complex process during which cells interact with one another and with their local environment. Mathematical modelling offers tools to investigate such processes and can give insights into the underlying biological details, and can also guide new experiments. The first two papers of this thesis are concerned with modelling durotaxis, which is the phenomena where cells migrate preferentially up a stiffness gradient. Two distinct mechanisms which potentially drive durotaxis are investigated. One is based on the hypothesis that adhesion sites of migrating cells become reinforced and have a longer lifespan on stiffer substrates. The second mechanism is based on cells being able to generate traction forces, the magnitude of which depend on the stiffness of the substrate. We find that both mechanisms can indeed give rise to biased migration up a stiffness gradient. Our results encourages new experiments which could determine the importance of the two mechanisms in durotaxis. The third paper is devoted to a population-level model of cancer cells in the brain of mice. The model incorporates diffusion tensor imaging data, which is used to guide the migration of the cells. Model simulations are compared to experimental data, and highlights the model’s difficulty in producing irregular growth patterns observed in the experiments. As a consequence, the findings encourage further model development. The fourth paper is concerned with modelling cell polarization, in the absence of environmental cues, referred to as spontaneous symmetry breaking. Polarization is an important part of cell migration, but also plays a role during division and differentiation. The model takes the form of a reaction diffusion system in 3D and describes the spatio-temporal evolution of three forms of Cdc42 in the cell. The model is able to produce biologically relevant patterns, and numerical simulations show how model parameters influence key features such as pattern formation and time to polarization.
  •  
10.
  • Zhao, D., et al. (författare)
  • Low Phase-Rank Approximation
  • 2022
  • Ingår i: Linear Algebra and Its Applications. - : Elsevier BV. - 0024-3795. ; 639, s. 177-204
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we propose and solve low phase-rank approximation problems, which serve as a counterpart to the well-known low-rank approximation problem and the Schmidt-Mirsky theorem. It is well known that a nonzero complex number can be specified by its gain and phase, and while it is generally accepted that the gains of a matrix may be defined by its singular values, there is no widely accepted definition for its phases. In this work, we consider sectorial matrices, whose numerical ranges do not contain the origin, and adopt the canonical angles of such matrices as their phases. Similarly to the rank of a matrix being defined as the number of its nonzero singular values, we define the phase-rank of a sectorial matrix as the number of its nonzero phases. While a low-rank approximation problem is associated with the matrix arithmetic mean, it turns out that a natural parallel for the low phase-rank approximation problem is to use the matrix geometric mean to measure the approximation error. Importantly, we derive a majorization inequality between the phases of the geometric mean and the arithmetic mean of the phases, similarly to the Ky-Fan inequality for eigenvalues of Hermitian matrices. A characterization of the solutions to the proposed problem, with the same flavor as the Schmidt-Mirsky theorem, is then obtained in the case where both the objective matrix and the approximant are restricted to be positive-imaginary. In addition, we provide an alternative formulation of the low phase-rank approximation problem using geodesic distances between sectorial matrices. The two formulations give rise to the exact same set of solutions when the involved matrices are additionally assumed to be unitary. © 2022 Elsevier Inc.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 1190
Typ av publikation
tidskriftsartikel (1031)
konferensbidrag (65)
doktorsavhandling (29)
bokkapitel (27)
licentiatavhandling (16)
annan publikation (8)
visa fler...
bok (7)
rapport (3)
forskningsöversikt (3)
patent (1)
visa färre...
Typ av innehåll
refereegranskat (1104)
övrigt vetenskapligt/konstnärligt (85)
populärvet., debatt m.m. (1)
Författare/redaktör
Nyström, Kaj, 1969- (23)
Lenells, Jonatan, 19 ... (22)
Rozenblioum, Grigori ... (18)
Persson, Lars-Erik (17)
Björn, Jana (17)
Björn, Anders (16)
visa fler...
Silvestrov, Sergei, ... (15)
Shahgholian, Henrik (15)
Mazya, Vladimir (15)
Zhang, Genkai, 1963 (15)
Charlier, Christophe (14)
Staubach, Wolfgang (14)
Kovacs, Mihaly, 1977 (13)
Nika, Grigor (12)
Maligranda, Lech, 19 ... (12)
Andersson, Mats, 195 ... (11)
Kavallaris, Nikos I. (11)
Björklund, Michael, ... (11)
Wall, Peter (10)
Malman, Bartosz (10)
Kozlov, Vladimir (9)
Rowlett, Julie, 1978 (9)
Aleman, Alexandru (9)
Lang, Annika, 1980 (9)
Sjögren, Peter, 1948 (9)
Wulcan, Elizabeth, 1 ... (9)
Berman, Robert, 1976 (9)
Kim, Sunghan (9)
Persson, Daniel, 197 ... (8)
Berndtsson, Bo, 1950 (8)
Ashyraliyev, Maksat (8)
Modin, Klas, 1979 (8)
Folkow, Peter, 1968 (7)
Cederwall, Martin, 1 ... (7)
Rohleder, Jonathan, ... (7)
Hedenmalm, Håkan, 19 ... (7)
Burtseva, Evgeniya, ... (7)
Ameur, Yacin (7)
Hallnäs, Martin, 197 ... (7)
Wahlén, Erik (7)
Czyz, Rafal (7)
Cohen, David (6)
Persson, Tomas (6)
Turowska, Lyudmyla, ... (6)
Beilina, Larisa, 197 ... (6)
Fabricius, John (6)
Andreasson, Håkan, 1 ... (6)
Cui, Weiwei (6)
Tephnadze, George (6)
Larson, Simon (6)
visa färre...
Lärosäte
Chalmers tekniska högskola (430)
Göteborgs universitet (206)
Kungliga Tekniska Högskolan (185)
Uppsala universitet (154)
Lunds universitet (139)
Linköpings universitet (85)
visa fler...
Karlstads universitet (60)
Stockholms universitet (52)
Luleå tekniska universitet (45)
Mälardalens universitet (39)
Umeå universitet (38)
Linnéuniversitetet (18)
Örebro universitet (13)
Malmö universitet (8)
Mittuniversitetet (7)
Högskolan Väst (4)
Högskolan i Borås (4)
Blekinge Tekniska Högskola (4)
Jönköping University (3)
RISE (3)
Karolinska Institutet (2)
VTI - Statens väg- och transportforskningsinstitut (2)
Högskolan i Halmstad (1)
Högskolan i Gävle (1)
Sveriges Lantbruksuniversitet (1)
IVL Svenska Miljöinstitutet (1)
visa färre...
Språk
Engelska (1182)
Polska (5)
Svenska (3)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (1190)
Teknik (133)
Samhällsvetenskap (10)
Humaniora (9)
Medicin och hälsovetenskap (8)

Å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