1. |
- Sorooshian, Shahryar, 1980, et al.
(author)
-
Performance of the decision-making trial and evaluation laboratory
- 2023
-
In: AIMS Mathematics. - : American Institute of Mathematical Sciences (AIMS). - 2473-6988. ; 8:3, s. 7490-7514
-
Journal article (peer-reviewed)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.
|
|
2. |
- Sorooshian, Shahryar, 1980, et al.
(author)
-
Expedited analytical hierarchical process for multicriteria decision making
- 2022
-
In: ICIC Express Letters. - 1881-803X. ; 16:2, s. 145-151
-
Journal article (peer-reviewed)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’.
|
|
3. |
- Brandes, Julia, et al.
(author)
-
On generating functions in additive number theory, II: lower-order terms and applications to PDEs
- 2021
-
In: Mathematische Annalen. - : Springer Science and Business Media LLC. - 0025-5831 .- 1432-1807. ; 379, s. 347-76
-
Journal article (peer-reviewed)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.
|
|
4. |
- Berman, Robert, 1976
(author)
-
Convergence Rates for Discretized Monge-Ampere Equations and Quantitative Stability of Optimal Transport
- 2021
-
In: Foundations of Computational Mathematics. - : Springer Science and Business Media LLC. - 1615-3375 .- 1615-3383. ; 21, s. 1099-1140
-
Journal article (peer-reviewed)abstract
- In recent works-both experimental and theoretical-it has been shown how to use computational geometry to efficiently construct approximations to the optimal transport map between two given probability measures on Euclidean space, by discretizing one of the measures. Here we provide a quantitative convergence analysis for the solutions of the corresponding discretized Monge-Ampere equations. This yields H-1-converge rates, in terms of the corresponding spatial resolution h, of the discrete approximations of the optimal transport map, when the source measure is discretized and the target measure has bounded convex support. Periodic variants of the results are also established. The proofs are based on new quantitative stability results for optimal transport maps, shown using complex geometry.
|
|
5. |
- Gerken, Jan, 1991, et al.
(author)
-
Equivariance versus augmentation for spherical images
- 2022
-
In: Proceedings of Machine Learning Resaerch. ; , s. 7404-7421
-
Conference paper (peer-reviewed)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. |
- Casarino, V., et al.
(author)
-
On the variation operator for the Ornstein-Uhlenbeck semigroup in dimension one
- 2024
-
In: Annali Di Matematica Pura Ed Applicata. - 0373-3114 .- 1618-1891. ; 203:1, s. 205-219
-
Journal article (peer-reviewed)abstract
- Consider the variation seminorm of the Ornstein-Uhlenbeck semigroup Ht in dimension one, taken with respect to t. We show that this seminorm defines an operator of weak type (1, 1) for the relevant Gaussian measure. The analogous Lp estimates for 1 < p < 8 were already known.
|
|
7. |
- Strömberg, Ann-Brith, 1961, et al.
(author)
-
Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods
- 2020
-
In: Numerical Nonsmooth Optimization: State of the Art Algorithms. - Cham : Springer International Publishing. ; , s. 499-547, s. 499-547
-
Book chapter (other academic/artistic)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.
|
|
8. |
- Atai, F., et al.
(author)
-
Super-Macdonald Polynomials: Orthogonality and Hilbert Space Interpretation
- 2021
-
In: Communications in Mathematical Physics. - : Springer Science and Business Media LLC. - 0010-3616 .- 1432-0916. ; 388:1, s. 435-468
-
Journal article (peer-reviewed)abstract
- The super-Macdonald polynomials, introduced by Sergeev andVeselov (Commun Math Phys 288: 653-675, 2009), generalise the Macdonald polynomials to (arbitrary numbers of) two kinds of variables, and they are eigenfunctions of the deformed Macdonald-Ruijsenaars operators introduced by the same authors in Sergeev and Veselov (CommunMath Phys 245: 249-278, 2004). We introduce a Hermitian form on the algebra spanned by the super-Macdonald polynomials, prove their orthogonality, compute their (quadratic) norms explicitly, and establish a corresponding Hilbert space interpretation of the super-Macdonald polynomials and deformed MacdonaldRuijsenaars operators. This allows for a quantum mechanical interpretation of the models defined by the deformedMacdonald-Ruijsenaars operators. Motivated by recent results in the nonrelativistic (q -> 1) case, we propose that these models describe the particles and anti-particles of an underlying relativistic quantum field theory, thus providing a natural generalisation of the trigonometric Ruijsenaars model.
|
|
9. |
- Arkeryd, Leif, 1940, et al.
(author)
-
On stationary solutions to normal, coplanar discrete Boltzmann equation models
- 2020
-
In: Communications in Mathematical Sciences. - 1539-6746 .- 1945-0796. ; 18:8, s. 2215-2234
-
Journal article (peer-reviewed)abstract
- The paper proves existence of renormalized solutions for a class of velocity-discrete coplanar stationary Boltzmann equations with given indata. The proof is based on the construction of a sequence of approximations with L-1- compactness for the integrated collision frequency and gain term. L-1-compactness of a sequence of approximations is obtained using the Kolmogorov-Riesz theorem and replaces the L-1-compactness of velocity averages in the continuous velocity case, not available when the velocities are discrete.
|
|
10. |
- Bandara, L., et al.
(author)
-
Eigenvalue asymptotics for weighted Laplace equations on rough Riemannian manifolds with boundary
- 2021
-
In: Annali Della Scuola Normale Superiore Di Pisa-Classe Di Scienze. - : Scuola Normale Superiore - Edizioni della Normale. - 0391-173X .- 2036-2145. ; 22:4, s. 1843-1878
-
Journal article (peer-reviewed)abstract
- Our topological setting is a smooth compact manifold of dimension two or higher with smooth boundary. Although this underlying topological structure is smooth, the Riemannian metric tensor is only assumed to be bounded and measurable. This is known as a rough Riemannian manifold. For a large class of boundary conditions we demonstrate a Weyl law for the asymptotics of the eigenvalues of the Laplacian associated to a rough metric. Moreover, we obtain eigenvalue asymptotics for weighted Laplace equations associated to a rough metric. Of particular novelty is that the weight function is not assumed to be of fixed sign, and thus the eigenvalues may be both positive and negative. Key ingredients in the proofs were demonstrated by Birman and Solomjak nearly fifty years ago in their seminal work on eigenvalue asymptotics. In addition to determining the eigenvalue asymptotics in the rough Riemannian manifold setting for weighted Laplace equations, we also wish to promote their achievements which may have further applications to modern problems.
|
|