Home

Concept

Computational resource

Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...

About
Privacy
Disclaimer

Graph Chatbot

Related publications (32)

cRacklet: a spectral boundary integral method library for interfacial rupture simulation

Jean-François Molinari, Thibault Didier Roch, Fabian Barras

The study of dynamically propagating rupture along interfaces is of prime importance in various fields and system sizes, including tribology (nm to m), engineering (mm to m) and geophysics (m to km) (Armstrong-Hélouvry et al., 1994; Ben-Zion, 2008; Vanossi ...

2022

On Succinct Non-interactive Arguments in Relativized Worlds

Alessandro Chiesa

Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

A finiteness result for p-adic families of Bianchi modular forms

Vlad Serban

We study p-adic families of cohomological automorphic forms for GL(2) over imaginary quadratic fields and prove that families interpolating a Zariski-dense set of classical cuspidal automorphic forms only occur under very restrictive conditions. We show ho ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Mesh d-refinement: a data-based computational framework to account for complex material response

Jean-François Molinari, Antonio Joaquin Garcia Suarez, Sacha Zenon Wattel

Model-free data-driven computational mechanics (DDCM) is a new paradigm for simulations in solid mechanics. The modeling step associated to the definition of a material constitutive law is circumvented through the introduction of an abstract phase space in ...

2023

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Robert Granger, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Bistable Auxetic Surface Structures

Mark Pauly, Tian Chen, Francis Julian Panetta, Max Schnaubelt

We present Bistable Auxetic Surface Structures, a novel deployable material system based on optimized bistable auxetic cells. Such a structure can be flat-fabricated from elastic sheet material, then deployed towards a desired double-curved target shape by ...

2021

Fast Bayesian estimation of spatial count data models

Prateek Bansal, Rico Krüger

Spatial count data models are used to explain and predict the frequency of phenomena such as traffic accidents in geographically distinct entities such as census tracts or road segments. These models are typically estimated using Bayesian Markov chain Mont ...

2021

A general and efficient framework for atomistic machine learning

Félix Benedito Clément Musil

Over the last two decades, many technological and scientific discoveries, ranging from the development of materials for energy conversion and storage through the design of new drugs, have been accelerated by the use of preliminary in silico experiments, to ...

EPFL2021

Using Machine Learning to estimate the technical potential of shallow ground-source heat pumps with thermal interference

Roberto Castello, Jean-Louis Scartezzini, Nahid Mohajeri Pour Rayeni, Alina Ursula Rosa Walch

The increasing use of ground-source heat pumps (GSHPs) for heating and cooling of buildings raises questions regarding the technical potential of GSHPs and their impact on the temperature in the shallow subsurface. In this paper, we develop a method using ...

IOP PUBLISHING LTD2021

Analytical Computation of Power Grids’ Sensitivity Coefficients with Voltage-Dependent Injections

Mario Paolone, Sherif Alaa Salaheldin Fahmy

With the increasing need of real-time regulation in power systems, grid-aware-control-frameworks are relying more often on sensitivity coefficients (SCs) to formulate and efficiently solve optimal control problems. As known, SCs are the derivatives of cont ...

IEEE2021

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Pablo Antolin Sanchez

This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...

2020

Development and verification of pin-by-pin homogenized simplified transport solver Tortin for PWR core analysis

Andreas Pautz, Petra Mala

Currently, the pin-by-pin homogenized solvers are a very active research field as they can, unlike the nodal codes, directly predict the local power, while requiring significantly less computational resources than the heterogeneous transport codes. This pa ...

2020

Page 2 of 2