| 1. |
- Berndtsson, Bo, 1950
(författare)
-
Probability measures associated to geodesics in the space of kähler metrics
- 2018
-
Ingår i: Springer Proceedings in Mathematics and Statistics. - Cham : Springer International Publishing. - 2194-1017 .- 2194-1009. ; 269, s. 395-419
-
Konferensbidrag (refereegranskat)abstract
- We associate certain probability measures on R to geodesics in the space HL of positively curved metrics on a line bundle L, and to geodesics in the finite dimensional symmetric space of hermitian norms on H0(X, kL). We prove that the measures associated to the finite dimensional spaces converge weakly to the measures related to geodesics in HL as k goes to infinity. The convergence of second order moments implies a recent result of Chen and Sun on geodesic distances in the respective spaces, while the convergence of first order moments gives convergence of Donaldson’s Z-functional to the Aubin–Yau energy. We also include a result on approximation of infinite dimensional geodesics by Bergman kernels which generalizes work of Phong and Sturm.
|
|
| 2. |
- Dhamal, Swapnil Vilas, 1988, et al.
(författare)
-
Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy
- 2018
-
Ingår i: AAAI 2018 - Proceedings of the 32nd AAAI Conference on Artificial Intelligence. ; , s. 997-1006
-
Konferensbidrag (refereegranskat)abstract
- We consider a two-player resource allocation polytope game, in which the strategy of a player is restricted by the strategy of the other player, with common coupled constraints. With respect to such a game, we formally introduce the notions of independent optimal strategy profile, which is the profile when players play optimally in the absence of the other player; and common contiguous set, which is the set of top nodes in the preference orderings of both the players that are exhaustively invested on in the independent optimal strategy profile. We show that for the game to have a unique PSNE, it is a necessary and sufficient condition that the independent optimal strategies of the players do not conflict, and either the common contiguous set consists of at most one node or all the nodes in the common contiguous set are invested on by only one player in the independent optimal strategy profile. We further derive a socially optimal strategy profile, and show that the price of anarchy cannot be bound by a common universal constant. We hence present an efficient algorithm to compute the price of anarchy and the price of stability, given an instance of the game. Under reasonable conditions, we show that the price of stability is 1. We encounter a paradox in this game that higher budgets may lead to worse outcomes.
|
|
| 3. |
- Fotedar, Sunney, 1989, et al.
(författare)
-
Mathematical optimization of the tactical allocation of machining resources for an efficient capacity utilization in aerospace component manufacturing
- 2019
-
Ingår i: Proceedings of the 10th Aerospace Technology Congress. - : Linköping University Electronic Press. - 1650-3686 .- 1650-3740. - 9789175190068 ; , s. 183-188
-
Konferensbidrag (refereegranskat)abstract
- In the aerospace industry, with low volumes and many products, there is a critical need to efficiently use available manufacturing resources. Currently, at GKN Aerospace, resource allocation decisions that in many cases will last for several years are to some extent made with a short-term focus so as to minimize machining time, which results in a too high load on the most capable machines, and too low load on the less capable ones. This creates an imbalance in capacity utilization that leads to unnecessary queuing at some machines, resulting in long lead times and in an increase in tied-up capital. Tactical resource allocation on the medium to long-range planning horizon (six months to several years) aims to address this issue by allocating resources to meet the predicted future demand as effectively as possible, in order to ensure long range profitability. Our intent is to use mathematical optimization to find the best possible allocations.
|
|
| 4. |
- Khesin, Boris, et al.
(författare)
-
Newton's Equation on Diffeomorphisms and Densities
- 2017
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. - 9783319684451 ; 10589, s. 873-873
-
Konferensbidrag (refereegranskat)abstract
- We develop a geometric framework for Newton-type equations on the infinite-dimensional configuration space of probability densities. It can be viewed as a second order analogue of the "Otto calculus" framework for gradient flow equations. Namely, for an n-dimensional manifold M we derive Newton's equations on the group of diffeomorphisms Diff(M) and the space of smooth probability densities Dens(M), as well as describe the Hamiltonian reduction relating them. For example, the compressible Euler equations are obtained by a Poisson reduction of Newton's equation on Diff(M) with the symmetry group of volume-preserving diffeomorphisms, while the Hamilton-Jacobi equation of fluid mechanics corresponds to potential solutions. We also prove that the Madelung transform between Schrodinger-type and Newton's equations is a symplectomorphism between the corresponding phase spaces T* Dens(M) and PL2 (M, C). This improves on the previous symplectic submersion result of von Renesse [1]. Furthermore, we prove that the Madelung transform is a Kahler map provided that the space of densities is equipped with the (prolonged) Fisher-Rao information metric and describe its dynamical applications. This geometric setting for the Madelung transform sheds light on the relation between the classical Fisher-Rao metric and its quantum counterpart, the Bures metric. In addition to compressible Euler, Hamilton-Jacobi, and linear and nonlinear Schrodinger equations, the framework for Newton equations encapsulates Burgers' inviscid equation, shallow water equations, two-component and mu-Hunter-Saxton equations, the Klein-Gordon equation, and infinite-dimensional Neumann problems.
|
|
| 5. |
- Rowlett, Julie, 1978, et al.
(författare)
-
How to hear the corners of a drum
- 2019
-
Ingår i: Matrix Annals. - Cham : Springer International Publishing. ; 2017, s. 243-278, s. 243-278
-
Konferensbidrag (refereegranskat)abstract
- We prove that the existence of corners in a class of planar domain, which includes all simply connected polygonal domains and all smoothly bounded domains, is a spectral invariant of the Laplacian with both Neumann and Robin boundary conditions. The main ingredient in the proof is a locality principle in the spirit of Kac’s “principle of not feeling the boundary,” but which holds uniformly up to the boundary. Albeit previously known for Dirichlet boundary condition, this appears to be new for Robin and Neumann boundary conditions, in the geometric generality presented here. For the case of curvilinear polygons, we describe how the same arguments using the locality principle are insufficient to obtain the analogous result. However, we describe how one may be able to harness powerful microlocal methods and combine these with the locality principles demonstrated here to show that corners are a spectral invariant; this is current work-in-progress (Nursultanov et al., Preprint).
|
|
| 6. |
- Hamon, Thierry, et al.
(författare)
-
Term Ranking Adaptation to the Domain : Genetic Algorithm-Based Optimisation of the C-Value
- 2014
-
Ingår i: Advances in Natural Language Processing. - Cham : Springer International Publishing. - 9783319108889 ; , s. 71-83
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 7. |
- Olsson, Carl, 1978, et al.
(författare)
-
Relaxations for Non-Separable Cardinality/Rank Penalties
- 2021
-
Ingår i: Proceedings of the IEEE International Conference on Computer Vision. - 1550-5499. ; 2021-October, s. 162-171
-
Konferensbidrag (refereegranskat)abstract
- Rank and cardinality penalties are hard to handle in optimization frameworks due to non-convexity and discontinuity. Strong approximations have been a subject of intense study and numerous formulations have been proposed. Most of these can be described as separable, meaning that they apply a penalty to each element (or singular value) based on size, without considering the joint distribution. In this paper we present a class of non-separable penalties and give a recipe for computing strong relaxations suitable for optimization. In our analysis of this formulation we first give conditions that ensure that the global ly optimal solution of the relaxation is the same as that of the original (unrelaxed) objective. We then show how a stationary point can be guaranteed to be unique under the restricted isometry property (RIP) assumption.1
|
|
| 8. |
- Beilina, Larisa, 1970, et al.
(författare)
-
Numerical studies of the lagrangian approach for reconstruction of the conductivity in a waveguide
- 2018
-
Ingår i: Springer Proceedings in Mathematics and Statistics. - Cham : Springer International Publishing. - 2194-1017 .- 2194-1009. ; 243, s. 93-117
-
Konferensbidrag (refereegranskat)abstract
- We consider an inverse problem of reconstructing the conductivity function in a hyperbolic equation using single space-time domain noisy observations of the solution on the backscattering boundary of the computational domain. We formulate our inverse problem as an optimization problem and use Lagrangian approach to minimize the corresponding Tikhonov functional. We present a theorem of a local strong convexity of our functional and derive error estimates between computed and regularized as well as exact solutions of this functional, correspondingly. In numerical simulations we apply domain decomposition finite element-finite difference method for minimization of the Lagrangian. Our computational study shows efficiency of the proposed method in the reconstruction of the conductivity function in three dimensions.
|
|
| 9. |
- Coquand, Thierry, 1961
(författare)
-
A logical approach to abstract algebra
- 2005
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. ; 3526, s. 86-95
-
Konferensbidrag (refereegranskat)abstract
- Recent work in constructive mathematics show that Hilbert's program works for a large part of abstract algebra. Furthermore the arguments we get are not only elementary but also mathematically simpler. We present an example where the simplification was significant enough to suggest an improved version of a classical theorem. For this we use a general method to transform some logically complex first-order formulae in a geometrical form which may be interesting in itself.
|
|
| 10. |
- Hamon, Thierry, et al.
(författare)
-
Combining Compositionality and Pagerank for the Identification of Semantic Relations between Biomedical Words
- 2012
-
Ingår i: BioNLP. - 9781937284206 - 1937284204 ; , s. 109-117
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
