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

arXiv 2023年

作者： Gallego, Fernando Trier, Felix Mallik, Srijani Bréhin, Julien Varotto, Sara Vicente-Arche, Luis Moreno Gosavy, Tanay Lin, Chia-Ching Coudevylle, Jean-René Iglesias, Lucía Casanova, Félix Young, Ian Vila, Laurent Attané, Jean-Philippe Bibes, Manuel Unité Mixte de Physique CNRS Thales Université Paris-Saclay Palaiseau91767 France Department of Energy Conservation and Storage Technical University of Denmark Kgs Lyngby2800 Denmark Components Research Intel Corp. HillsboroOR97124 United States Centre de Nanosciences et de Nanotechnologies CNRS Université Paris-Sud Université Paris-Saclay C2N Palaiseau91120 France CIC nanoGUNE BRTA Donostia-San Sebastián Basque Country20018 Spain IKERBASQUE Basque Foundation for Science Basque Country Bilbao48009 Spain Univ. Grenoble Alpes CNRS CEA SPINTEC Grenoble France

The Magnetoelectric Spin-Orbit (MESO) technology aims to bring logic into memory by combining a ferromagnet with a magnetoelectric (ME) element for information writing, and a spin-orbit (SO) element for information read-out through spin-charge conversion. Among candidate SO materials to achieve a large MESO output signal, oxide Rashba two-dimensional electron gases (2DEGs) have shown very large spin-charge conversion efficiencies, albeit mostly in spin-pumping experiments. Here, we report all-electrical spin-injection and spin-charge conversion experiments in nanoscale devices harnessing the inverse Edelstein effect of SrTiO3 2DEGs. We have designed, patterned and fabricated nanodevices in which a spin current injected from a cobalt layer into the 2DEG is converted into a charge current. We optimized the spin-charge conversion signal by applying back-gate voltages, and studied its temperature evolution. We further disentangled the inverse Edelstein contribution from spurious effects such as the planar Hall effect, the anomalous Hall effect or the anisotropic magnetoresistance. The combination of non-volatility and high energy efficiency of these devices could potentially lead to new technology paradigms for beyond-CMOS computing architectures. © 2023, CC BY.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Probabilistic learning on manifolds constrained by nonlinear partial differential equations for small datasets

arXiv

引用

arXiv 2020年

作者： Soize, C. Ghanem, R. Université Gustave Eiffel MSME UMR 8208 CNRS 5 bd Descartes Marne-la-Vallée77454 France University of Southern California 210 KAP Hall Los AngelesCA90089 United States

A novel extension of the Probabilistic Learning on Manifolds (PLoM) is presented. It makes it possible to synthesize solutions to a wide range of nonlinear stochastic boundary value problems described by partial differential equations (PDEs) for which a stochastic computational model (SCM) is available and depends on a vector-valued random control parameter. The cost of a single numerical evaluation of this SCM is assumed to be such that only a limited number of points can be computed for constructing the training dataset (small data). Each point of the training dataset is made up realizations from a vector-valued stochastic process (the stochastic solution) and the associated random control parameter on which it depends. The presented PLoM constrained by PDE allows for generating a large number of learned realizations of the stochastic process and its corresponding random control parameter. These learned realizations are generated so as to minimize the vector-valued random residual of the PDE in the mean-square sense. Appropriate novel methods are developed to solve this challenging problem. Three applications are presented. The first one is a simple uncertain nonlinear dynamical system with a nonstationary stochastic excitation. The second one concerns the 2D nonlinear unsteady Navier-Stokes equations for incompressible flows in which the Reynolds number is the random control parameter. The last one deals with the nonlinear dynamics of a 3D elastic structure with uncertainties. The results obtained make it possible to validate the PLoM constrained by stochastic PDE but also provide further validation of the PLoM without constraint. Copyright © 2020, The Authors. All rights reserved.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Local hidden variable values without optimization procedures

arXiv

引用

arXiv 2020年

作者： Goyeneche, Dardo Bruzda, Wojciech Turek, Ondřej Alsina, Daniel Zyczkowski, Karol Departamento de Física Facultad de Ciencias Básicas Universidad de Antofagasta Casilla 170 Antofagasta Chile Institute of Theoretical Physics Jagiellonian University ul. Lojasiewicza 11 Kraków30-348 Poland Department of Mathematics Faculty of Science University of Ostrava Ostrava701 03 Czech Republic School of Electronic and Electrical Engineering University of Leeds LeedsLS2 9JT United Kingdom Center for Theoretical Physics Polish Academy of Sciences Al. Lotników 32/46 Warsaw02-668 Poland

The problem of computing the local hidden variable (LHV) value of a Bell inequality plays a central role in the study of quantum nonlocality. In particular, this problem is the first step towards characterizing the LHV polytope of a given scenario. In this work, we establish a relation between the LHV value of bipartite Bell inequalities and the mathematical notion of excess of a matrix. Inspired by the well developed theory of excess, we derive several results that directly impact the field of quantum nonlocality. We show infinite families of bipartite Bell inequalities for which the LHV value can be computed exactly, without needing to solve any optimization problem, for any number of measurement settings. We also find tight Bell inequalities for a large number of measurement settings. © 2020, CC BY.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Symplectic Perturbation theory in Massive Ambitwistor Space: A Zig-Zag theory of Massive Spinning Particles

arXiv

引用

arXiv 2023年

作者： Kim, Joon-Hwi Lee, Sangmin Department of Physics California Institute of Technology PasadenaCA91125 United States Department of Physics and Astronomy Seoul National University Seoul08826 Korea Republic of Center for Theoretical Physics Seoul National University Seoul08826 Korea Republic of College of Liberal Studies Seoul National University Seoul08826 Korea Republic of

We develop a theory of massive spinning particles interacting with background fields in four spacetime dimensions in which holomorphy and chirality play a central role. Applying a perturbation theory of symplectic forms to the massive twistor space as a Kähler manifold, we find that the spin precession behavior of a massive spinning particle is directly determined from the manner in which self-dual and anti-self-dual field strengths permeate into "complex spacetime." Especially, the particle shows the minimally coupled precession behavior if self-dual field strength continues holomorphically into the complex: the Newman-Janis shift. In general, computing the momentum impulse shows that the parameters that control generic non-holomorphic continuations are directly related to the coupling constants in the massive-massive-massless spinning on-shell amplitude of Arkani-Hamed, Huang, and Huang, and thus they are interpreted as the single-curvature Wilson coefficients given by Levi and Steinhoff, redefined on complex worldlines. Finally, exact expressions for Kerr and √Kerr actions are bootstrapped in monochromatic self-dual plane-wave backgrounds from symplectivity and a matching between classical scattering and the on-shell amplitude, from which we obtain all-order exact impulses of classical observables. © 2023, CC BY.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Resource-bounded genericity

Resource-bounded genericity

引用

Annual Conference on Structure in Complexity theory

作者： K. Ambos-Spies Mathemtisches Institut Universität Heidelberg Heidelberg Germany

Resource-bounded genericity concepts have been introduced by Ambos-Spies, Fleischhack and Huwig (1984, 1988), Lutz (1990), and Fenner (1991). Though it was known that these concepts are incompatible, the relations among these notions were not fully understood. We survey these notions and clarify the relations among them by specifying the types of diagonalizations captured by the individual concepts. Moreover, we introduce new, stronger resource-bounded genericity concepts corresponding to the fundamental diagonalization concepts in complexity theory. In particular we introduce general genericity, which generalizes the previous concepts and captures both standard finite extension arguments and slow diagonalizations. As we also point out, however, there is no strongest resource-bounded genericity concept. This is shown by giving a strict hierarchy of genericity notions corresponding to delayed diagonalizations. Finally we study some properties of the Baire category notions on E induced by the genericity concepts and we point out the relations between resource-bounded genericity and resource-bounded randomness.

关键词： Complexity theory Delay computation theory Humans Upper bound

来源：评论

学校读者我要写书评

暂无评论

De Sitter-invariant States from Holography

arXiv

引用

arXiv 2017年

作者： Nguyen, Kévin International Solvay Institutes Pleinlaan 2 BrusselsB-1050 Belgium

A class of invariant states under de Sitter isometries is constructed in d-dimensional Conformal Field Theories from the universal sector of AdS/CFT dualities. These states extend the Mottola-Allen α-vacua to theories containing scalar primary operators of arbitrary scaling dimensions, and are proven to explicitly break conformal symmetry. Two-point correlators in these states are shown to satisfy a generalized spectral decomposition in terms of free massive propagators. It is also pointed out that the spectral decomposition of generic Euclidean correlators is known in the mathematics literature as Olevsky index transform, of which computational use can be made. Copyright © 2017, The Authors. All rights reserved.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Flexible Behavior Trees: In search of the mythical HFSMBTH for Collaborative Autonomy in Robotics

arXiv

引用

arXiv 2022年

作者： Zutell, Joshua M. Conner, David C. Schillinger, Philipp Department of Physics Computer Science and Engineering Christopher Newport University Newport NewsVA23606 United States Bosch Center for Artificial Intelligence Robert-Bosch-Campus 1 Renningen71272 Germany

In recent years, the model of computation known as Behavior Trees (BT), first developed in the video game industry, has become more popular in the robotics community for defining discrete behavior switching. BTs are threatening to supplant the venerable Hierarchical Finite State Machine (HFSM) model. In this paper we contrast BT and HFSM, pointing out some potential issues with the BT form, and advocate for a hybrid model of computation that uses both BT and HFSM in ways that leverage their individual strengths. The work introduces a new open-source package for ROS 2 that extends the Flexible Behavior Engine (FlexBE) to enable interaction with BT-based behaviors within a HFSM in a way that supports collaborative autonomy. Simulation and hardware demonstrations illustrate the concepts. Copyright © 2022, The Authors. All rights reserved.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Proactive mitigation of the revocation risk for preemptible virtualized resources

TechRxiv

引用

TechRxiv 2021年

作者： Oikonomou, Panagiotis Kolomvatsos, Kostas Anagnostopoulos, Christos The Department of Informatics and Telecommunications University of Thessaly Papasiopoulou 2-4 Lamia35100 Greece The School of Computing Science University of Glasgow Lilybank Gardens 17 GlasgowG12 8RZ United Kingdom

The provision of resources at the Cloud follows two generic models. The first model guarantees the provided resources for the requested time while the second involves unreliable resources with lower price compared to the former scheme but with no guarantees concerning an unexpected revocation due to a high demand. In this paper, we focus on the latter model and propose a scheme that monitors the course of execution of tasks placed at unreliable resources and decides when to store their current progress avoid jeopardizing intermediate outcomes in unexpected revocations. We rely on the principles of Optimal Stopping theory (OST) to manage multiple tasks and decide for which task and when we have to save its current status. The outcome is a novel checkpointing mechanism fully aligned with the needs of the dynamics of an unreliable *** proposed model builds upon the heterogeneity of the available services in the Cloud and concludes a proactive mitigation approach of the revocation risk for unreliable virtualized resources. We present the theoretical basis of our mechanism and describe the solution of the identified problem. The pros and cons of our approach are evaluated through extensive simulations and a set of performance metrics. © 2021, CC BY.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Emergence of cooperation in the thermodynamic limit

arXiv

引用

arXiv 2018年

作者： Sarkar, Shubhayan Benjamin, Colin National Institute of Science Education and Research HBNI Jatni752050 India

Predicting how cooperative behavior arises in the thermodynamic limit is one of the outstanding problems in evolutionary game theory. For two player games, cooperation is seldom the Nash equilibrium. However, in the thermodynamic limit cooperation is the natural recourse regardless of whether we are dealing with humans or animals. In this work we use the analogy with the Ising model to predict how cooperation arises in the thermodynamic limit. Copyright © 2018, The Authors. All rights reserved.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Pluripotential numerics

arXiv

引用

arXiv 2017年

作者： Piazzon, Federico Department of Mathematics Tullio Levi-Civita Universitá di Padova Italy

We introduce numerical methods for the approximation of the main (global) quantities in Pluripotential theory as the extremal plurisubharmonic function VE∗ of a compact L-regular set E ⊂ Cn, its transfinite diameter δ(E), and the pluripotential equilibrium measure µE := (ddc VE∗ )n . The methods rely on the computation of a polynomial mesh for E and numerical orthonormalization of a suitable basis of polynomials. We prove the convergence of the approximation of δ(E) and the uniform convergence of our approximation to VE∗ on all Cn;the convergence of the proposed approximation to µE follows. Our algorithms are based on the properties of polynomial meshes and Bernstein Markov measures. Numerical tests are presented for some simple cases with E ⊂ R2 to illustrate the performances of the proposed methods. Copyright © 2017, The Authors. All rights reserved.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：