检索结果-内蒙古大学图书馆

Socratrees: Exploring the Design of Argument Technology for Layman Users

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Jeuris, Steven Department of Health Technology Technical University of Denmark Denmark

Terms like ‘misinformation’, ‘fake news’, and ‘echo chambers’ permeate current discussions on the state of the Internet. We believe a lack of technological support to evaluate, contest, and reason about information online—as opposed to merely disseminating it—lies at the root of these problems. Several argument technologies support such functionality, but have seen limited use outside of niche communities. Most research systems overemphasize argument analysis and structure, standing in stark contrast with the informal dialectical nature of everyday argumentation. Conversely, non-academic systems overlook important implications for design which can be derived from theory. In this paper, we present the design of a system aiming to strike a balance between structured argumentation and ease of use. Socratrees is a website for collaborative argumentative discussion targeting layman users, but includes sophisticated community guidelines and novel features inspired by informal logic. During an exploratory study, we evaluate the usefulness of our imposed structure on argumentation and investigate how users perceive it. Contributing to arguments remains a complex task, but most users learned to do so effectively with minimal guidance and all recognized that the structure of Socratrees may improve online discussion and results in a clearer overview of arguments. Copyright © 2018, The Authors. All rights reserved.

关键词： computation theory

Arena-independent Memory Bounds for Nash Equilibria in Reachability Games

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Main, James C.A. F.R.S.-FNRS UMONS – Université de Mons Belgium

We study the memory requirements of Nash equilibria in turn-based multiplayer games on possibly infinite graphs with reachability, shortest path and Büchi objectives. We present constructions for finite-memory Nash equilibria in these games that apply to arbitrary game graphs, bypassing the finite-arena requirement that is central in existing approaches. We show that, for these three types of games, from any Nash equilibrium, we can derive another Nash equilibrium where all strategies are finite-memory such that the same players accomplish their objective, without increasing their cost for shortest path games. Furthermore, we provide memory bounds that are independent of the size of the game graph for reachability and shortest path games. These bounds depend only on the number of players. To the best of our knowledge, we provide the first results pertaining to finite-memory constrained Nash equilibria in infinite arenas and the first arena-independent memory bounds for Nash equilibria. Copyright © 2023, The Authors. All rights reserved.

关键词： computation theory

A generalized theory for full microtremor horizontal-to-vertical [H/V (z, f)] spectral ratio interpretation in offshore and onshore environments

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lontsi, Agostiny Marrios García-Jerez, Antonio Molina-Villegas, Juan Camilo Sánchez-Sesma, Francisco José Molkenthin, Christian Ohrnberger, Matthias Krüger, Frank Wang, Rongjiang Fäh, Donat Swiss Seismological Service ETH Zürich Switzerland Departamento de Química y Física Universidad de Almeria Spain Facultad de Ingenierías Universidad de Medellín Colombia Instituto de Ingeniería Universidad Nacional Autónoma de México Mexico Institute of Mathematics University of Potsdam Germany Institute of earth and environmental Science University of Potsdam Germany GFZ German Research Centre for Geosciences Potsdam Germany Instituto Andaluz de Geofísica Universidad de Granada Spain Departamento de ingeniería civil Facultad de Minas Universidad Nacional de Colombia Sede Medellín Colombia

Advances in the field of seismic interferometry have provided a basic theoretical interpretation to the full spectrum of the microtremor horizontal-to-vertical spectral ratio [H/V (f)]. The interpretation has been applied to ambient seismic noise data recorded both at the surface and at depth. The new algorithm, based on the diffuse wavefield assumption, has been used in inversion schemes to estimate seismic wave velocity profiles that are useful input information for engineering and exploration seismology both for earthquake hazard estimation and to characterize surficial sediments. However, until now, the developed algorithms are only suitable for on land environments with no offshore consideration. Here, the microtremor H/V (z, f) modeling is extended for applications to marine sedimentary environments for a 1D layered medium. The layer propagator matrix formulation is used for the computation of the required Green’s functions. Therefore, in the presence of a water layer on top, the propagator matrix for the uppermost layer is defined to account for the properties of the water column. As an application example we analyze eight simple canonical layered earth models. Frequencies ranging from 0.2 to 50 Hz are considered as they cover a broad wavelength interval and aid in practice to investigate subsurface structures in the depth range from a few meters to a few hundreds of meters. Results show a marginal variation of 8 percent at most for the fundamental frequency when a water layer is present. The water layer leads to variations in H/V peak amplitude of up to 50 percent atop the solid layers. Copyright © 2019, The Authors. All rights reserved.

关键词： computation theory

Penalised t-walk MCMC

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Medina-Aguayo, Felipe J. Andrés Christen, J. A.C. Jalisco S/N Col. Valenciana GuanajuatoGtoCP: 36023 Mexico

Handling multimodality that commonly arises from complicated statistical models remains a challenge. Current Markov chain Monte Carlo (MCMC) methodology tackling this subject is based on an ensemble of chains targeting a product of power-tempered distributions. Despite the theoretical validity of such methods, practical implementations typically suffer from bad mixing and slow convergence due to the high-computation cost involved. In this work we study novel extensions of the twalk algorithm, an existing MCMC method that is inexpensive and invariant to affine transformations of the state space, for dealing with multimodal distributions. We acknowledge that the effectiveness of the new method will be problem dependent and might struggle in complex scenarios;for such cases we propose a post-processing technique based on pseudo-marginal theory for combining isolated samples. © 2020, CC BY.

关键词： computation theory

More on a dessin on the base: Kodaira exceptional fibers and mutually (non-)local branes

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Fukuchi, Shin Kan, Naoto Kuramochi, Rinto Mizoguchi, Shun'ya Tashiro, Hitomi Theory Center Institute of Particle and Nuclear Studies KEK Tsukuba Ibaraki305-0801 Japan Tsukuba Ibaraki305-0801 Japan

A "dessin d’enfant" is a graph embedded on a two-dimensional oriented surface named by Grothendieck. Recently we have developed a new way to keep track of non-localness among 7-branes in F-theory on an elliptic fibration over P1 by drawing a triangulated "dessin" on the base. To further demonstrate the usefulness of this method, we provide three examples of its use. We first consider a deformation of the I0∗ Kodaira fiber. With a dessin, we can immediately find out which pairs of 7-branes are (non-)local and compute their monodromies. We next identify the paths of string(-junction)s on the dessin by solving the mass geodesic equation. By numerically computing their total masses, we find that the Hanany-Witten effect has not occurred in this example. Finally, we consider the orientifold limit in the spectral cover/Higgs bundle approach. We observe the characteristic configuration presenting the cluster sub-structure of an O-plane found previously. Copyright © 2019, The Authors. All rights reserved.

关键词： computation theory

Intercomparison of Warm-Rain Bulk Microphysics Schemes using Asymptotics

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Rosemeier, Juliane Baumgartner, Manuel Spichtinger, Peter Institute for Atmospheric Physics Johannes Gutenberg University Mainz Germany Data Center Johannes Gutenberg University Mainz Germany

Clouds are important components of the atmosphere. Since it is usually not possible to treat them as ensembles of huge numbers of particles, parameterizations on the basis of averaged quantities (mass and/or number concentration) must be derived. Since no first-principles derivations of such averaged schemes are available today, many alternative approximating schemes of cloud processes exist. Most of these come in the form of nonlinear differential equations. It is unclear whether these different cloud schemes behave similarly under controlled local conditions, and much less so when they are embedded dynamically in a full atmospheric flow model. We use mathematical methods from the theory of dynamical systems and asymptotic analysis to compare two operational cloud schemes and one research scheme qualitatively in a simplified context in which the moist dynamics is reduced to a system of ODEs. It turns out that these schemes behave qualitatively differently on shorter time scales, whereas at least their long time behavior is similar under certain conditions. These results show that the quality of computational forecasts of moist atmospheric flows will generally depend strongly on the formulation of the cloud schemes used. Copyright © 2018, The Authors. All rights reserved.

关键词： computation theory

Modified discrete laguerre polynomials for efficient computation of exponentially bounded matsubara sums

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Xu, Guanpeng A. Johnson, Steven G. Department of Mathematics Massachusetts Institute of Technology CambridgeMA United States

We develop a new type of orthogonal polynomial, the modified discrete Laguerre (MDL) polynomials, designed to accelerate the computation of bosonic Matsubara sums in statistical physics. The MDL polynomials lead to a rapidly convergent Gaussian "quadrature" scheme for Matsubara sums, and more generally for any sum F(0)/2 + F(h) + F(2h) + ··· of exponentially decaying summands F(nh) = f(nh)e−nhs where hs > 0. We demonstrate this technique for computation of finite-temperature Casimir forces arising from quantum field theory, where evaluation of the summand F requires expensive electromagnetic simulations. A key advantage of our scheme, compared to previous methods, is that the convergence rate is nearly independent of the spacing h (proportional to the thermodynamic temperature). We also prove convergence for any polynomially decaying F. © 2021, CC BY-SA.

关键词： computation theory

Solving large sequential games with the excessive gap technique

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Kroer, Christian Farina, Gabriele Sandholm, Tuomas Department of Computer Science Carnegie Mellon University PittsburghPA15213 United States

There has been tremendous recent progress on equilibrium-finding algorithms for zero-sum imperfect-information extensive-form games, but there has been a puzzling gap between theory and practice. First-order methods have significantly better theoretical convergence rates than any counterfactual-regret minimization (CFR) variant. Despite this, CFR variants have been favored in practice. Experiments with first-order methods have only been conducted on small- and medium-sized games because those methods are complicated to implement in this setting, and because CFR variants have been enhanced extensively for over a decade they perform well in practice. In this paper we show that a particular first-order method, a state-of-the-art variant of the excessive gap technique-instantiated with the dilated entropy distance function-can efficiently solve large real-world problems competitively with CFR and its variants. We show this on large endgames encountered by the Libratus poker AI, which recently beat top human poker specialist professionals at no-limit Texas hold'em. We show experimental results on our variant of the excessive gap technique as well as a prior version. We introduce a numerically friendly implementation of the smoothed best response computation associated with first-order methods for extensive-form game solving. We present, to our knowledge, the first GPU implementation of a first-order method for extensive-form games. We present comparisons of several excessive gap technique and CFR variants. Copyright © 2018, The Authors. All rights reserved.

关键词： computation theory

Amplitudes in the Multi-Regge Limit of N = 4 SYM

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Del Duca, Vittorio Druc, Stefan Drummond, James Duhr, Claude Dulat, Falko Marzucca, Robin Papathanasiou, Georgios Verbeek, Bram Institute for Theoretical Physics ETH Zürich Zürich8093 Switzerland School of Physics & Astronomy University of Southampton Highfield SouthamptonSO17 1BJ United Kingdom Theoretical Physics Department CERN Geneva 23CH-1211 Switzerland UCLouvain Chemin du Cyclotron 2 Louvain-La-Neuve1348 Belgium SLAC National Accelerator Laboratory Stanford University StanfordCA94309 United States DESY Theory Group DESY Hamburg Notkestraße 85 HamburgD-22607 Germany

A novel way of computing high-order amplitudes in the multi-Regge limit of planar maximally supersymmetric Yang-Mills theory is presented. In this framework, we are able to obtain high-loop and high-leg results by an easy operation on known amplitudes with fewer loops and lower multiplicity. This mechanism will be reviewed, along with an ensuing factorisation which allows us to determine leading logarithmic MHV results for any number of legs at a fixed loop order. Copyright © 2018, The Authors. All rights reserved.

关键词： computation theory