Publications related to Model of computation

Analytical Model of Single-Sided Linear Induction Motors for High-Speed Applications

Mario Paolone, André Hodder, Lucien André Félicien Pierrejean, Simone Rametti

This article describes a field-based analytical model of single-sided linear induction motors (SLIMs) that explicitly considers the following effects altogether: finite motor length, magnetomotive force mmf space harmonics, slot effect, edge effect, and ta ...

IEEE2024

Seeking the new, learning from the unexpected: Computational models of surprise and novelty in the brain

Alireza Modirshanechi

Human babies have a natural desire to interact with new toys and objects, through which they learn how the world around them works, e.g., that glass shatters when dropped, but a rubber ball does not. When their predictions are proven incorrect, such as whe ...

EPFL2024

Optimizing Dynamic Aperture Studies with Active Learning

Tatiana Pieloni, Ekaterina Krymova, Mike Seidel, Davide Di Croce, Massimo Giovannozzi

Dynamic aperture is an important concept for the study of non-linear beam dynamics in circular accelerators. It describes the extent of the phase-space region where a particle's motion remains bounded over a given number of turns. Understanding the feature ...

Iop Publishing Ltd2024

Butterfly effects in perceptual development: A review of the 'adaptive initial degradation' hypothesis

Lukas Vogelsang, Marin Vogelsang

Human perceptual development evolves in a stereotyped fashion, with initially limited perceptual capabilities maturing over the months or years following the commencement of sensory experience into robust proficiencies. This review focuses on the functiona ...

Academic Press Inc Elsevier Science2024

Pseudo-Three-Dimensional Analytical Model of Linear Induction Motors for High-Speed Applications

Mario Paolone, André Hodder, Lucien André Félicien Pierrejean, Simone Rametti

Literature on linear induction motors (LIMs) has proposed several approaches to model the behavior of such devices for different applications. In terms of accuracy and fidelity, field analysis-based models are the most relevant. Closed-form or numerical so ...

2024

Computational modeling of interval distributions in tonal space reveals paradigmatic stylistic changes in Western music history

Martin Alois Rohrmeier, Fabian Claude Moss, Robert Lieck

Diachronic stylistic changes in music are to a large extent affected by composers' different choices, for example regarding the usage of tones, intervals, and harmonies. Analyzing the tonal content of pieces of music and observing them over time is thus in ...

Springernature2024

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Daniel Kressner, Alice Cortinovis

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

Neurobiological and metabolic basis of motivation and effort-based decision-making - A human 1H-MRS, fMRI and machine learning study

Arthur Barakat

Motivation is a multifaceted phenomenon that we explore within the framework of decision-making. Through this cognitive process, actions are directed towards specific goals by performing a trade-off between the cost and benefit of an action. The dorsomedia ...

EPFL2024

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Laura Grigori

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

Siam Publications2024

Computational models of episodic-like memory in food-caching birds

Wulfram Gerstner, Johanni Michael Brea

How the 'what', 'where', and 'when' of past experiences are stored in episodic memories and retrieved for suitable decisions remains unclear. In an effort to address these questions, the authors present computational models of neural networks that behave l ...

Nature Portfolio2023

Hardware-Software co-design Methodologies for Edge AI Optimization

Flavio Ponzina

ML-based edge devices may face memory and computational errors that affect applications' reliability and performance. These errors can be the result of particular working conditions (e.g., radiation areas in physical experiments or avionics) or could be th ...

EPFL2023

EOS: Efficient Private Delegation of zkSNARK Provers

Alessandro Chiesa, Yinuo Zhang

Succinct zero knowledge proofs (i.e. zkSNARKs) are powerful cryptographic tools that enable a prover to convince a verifier that a given statement is true without revealing any additional information. Their attractive privacy properties have led to much ac ...

Usenix Assoc2023

The Societal and Scientific Importance of Inclusivity, Diversity, and Equity in Machine Learning for Chemistry

Daniel Probst

While the introduction of practical deep learning has driven progress across scientific fields, recent research highlighted that the requirement of deep learning for ever-increasing computational resources and data has potential negative impacts on the sci ...

2023

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

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

Textual Explanations and Critiques in Recommendation Systems

Diego Matteo Antognini

Artificial intelligence and machine learning algorithms have become ubiquitous. Although they offer a wide range of benefits, their adoption in decision-critical fields is limited by their lack of interpretability, particularly with textual data. Moreover, ...

EPFL2022

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

Paolo Ienne, Lana Josipovic

A central task in high-level synthesis is scheduling: the allocation of operations to clock cycles. The classic approach to scheduling is static, in which each operation is mapped to a clock cycle at compile-time, but recent years have seen the emergence o ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

A Prony-based approach for accelerating the lightning electromagnetic fields computation above a perfectly conducting ground

Farhad Rachidi-Haeri, Marcos Rubinstein

Lightning strikes can seriously affect the reliability and availability of electrical infrastructures. The computation of lightning-electromagnetic fields represents one of the most crucial steps in the evaluation of the induced effects; thus, having at di ...

Elsevier2022

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

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021