English
Related papers

Related papers: Counting Path Configurations in Parallel Diffusion

200 papers

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an…

Statistical Mechanics · Physics 2015-05-28 Elmar Bittner , Wolfhard Janke

We show the asymptotic long-time equivalence of a generic power law waiting time distribution to the Mittag-Leffler waiting time distribution, characteristic for a time fractional CTRW. This asymptotic equivalence is effected by a…

Statistical Mechanics · Physics 2008-05-18 Rudolf Gorenflo , Francesco Mainardi

This paper presents our work on developing parallel computational methods for two-phase flow on modern parallel computers, where techniques for linear solvers and nonlinear methods are studied and the standard and inexact Newton methods are…

Computational Engineering, Finance, and Science · Computer Science 2017-01-24 Hui Liu , Lihua Shen , Yan Chen , Kun Wang , Bo Yang , Zhangxin Chen

We study the applicability of the {\it parallel tempering method} (PT) in the investigation of first- order phase transitions. In this method, replicas of the same system are simulated simultaneously at different temperatures and the…

Statistical Mechanics · Physics 2009-11-13 Carlos E. Fiore

This paper studies end-to-end latency minimization for a multi-band radar sensing and deep neural network (DNN) inference pipeline. Unlike conventional stage-wise designs that treat radar sensing and DNN inference as two sequential stages,…

Signal Processing · Electrical Eng. & Systems 2026-04-21 Yanan Du , Sai Xu , Kezhi Wang , Yansha Deng

Polymorphism in programming languages enables code reuse. Here, we show that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of…

Programming Languages · Computer Science 2014-11-07 Jiahao Chen , Alan Edelman

Self-adjusting computation is an approach for automatically producing dynamic algorithms from static ones. The approach works by tracking control and data dependencies, and propagating changes through the dependencies when making an update.…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-17 Daniel Anderson , Guy E. Blelloch , Anubhav Baweja , Umut A. Acar

A diffusion process for charge distributions in a phase space is examined. The corresponding charge moves in a force field and under an action of a random field. There are the diffusion motions for coordinates and for momenta. In our model,…

Mathematical Physics · Physics 2008-03-19 E. M. Beniaminov

In this partly expository paper, we discuss three results. (1) That the two-sided continued fraction of the normalized square root (an important part of the SQUFOF algorithm) has several very attractive properties - periodicity, a symmetry…

Number Theory · Mathematics 2007-05-23 S. McMath , F. Crabbe , D. Joyner

The shortest Disjoint Path problem (SDPP) requires us to find pairwise vertex disjoint paths between k designated pairs of terminal vertices such that the sum of the path lengths is minimum. The focus here is on SDPP restricted to planar…

Data Structures and Algorithms · Computer Science 2025-03-21 Srijan Chakraborty , Samir Datta

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. At the beginning of each time…

Probability · Mathematics 2024-12-03 Umberto De Ambroggio , Tamás Makai , Konstantinos Panagiotou

Recent advances in computing architectures and networking are bringing parallel computing systems to the masses so increasing the number of potential users of these kinds of systems. In particular, two important technological evolutions are…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-04-05 Gabriele D'Angelo , Moreno Marzolla

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…

Probability · Mathematics 2024-04-25 Umberto De Ambroggio , Tamás Makai , Konstantinos Panagiotou , Annika Steibel

We present a shared-memory parallelization of flow-based refinement, which is considered the most powerful iterative improvement technique for hypergraph partitioning at the moment. Flow-based refinement works on bipartitions, so current…

Data Structures and Algorithms · Computer Science 2022-01-06 Lars Gottesbüren , Tobias Heuer , Peter Sanders

Diffusion Transformer (DiT), an emerging diffusion model for image generation, has demonstrated superior performance but suffers from substantial computational costs. Our investigations reveal that these costs stem from the static inference…

Computer Vision and Pattern Recognition · Computer Science 2024-10-10 Wangbo Zhao , Yizeng Han , Jiasheng Tang , Kai Wang , Yibing Song , Gao Huang , Fan Wang , Yang You

In present study, in order to improve the performance and reduce the amount of power which is dissipated in heterogeneous multicore processors, the ability of detecting the program execution phases is investigated. The programs execution…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-01-14 A. Z. Jooya , M. Analoui

Quantum walks are versatile simulators of topological phases and phase transitions as observed in condensed matter physics. Here, we utilize a step dependent coin in quantum walks and investigate what topological phases we can simulate with…

Quantum Physics · Physics 2019-12-16 S. Panahiyan , S. Fritzsche

Diffusion Transformers (DiTs) have emerged as the state-of-the-art backbone for high-fidelity image and video generation. However, their massive computational cost and memory footprint hinder deployment on edge devices. While post-training…

Computer Vision and Pattern Recognition · Computer Science 2026-02-11 Shaoqiu Zhang , Zizhong Ding , Kaicheng Yang , Junyi Wu , Xianglong Yan , Xi Li , Bingnan Duan , Jianping Fang , Yulun Zhang

Degradation analysis is used to analyze the useful lifetimes of systems, their failure rates, and various other system parameters like mean time to failure (MTTF), mean time between failures (MTBF), and the system failure rate (SFR). In…

Performance · Computer Science 2014-04-23 Avinash Saxena , Shrisha Rao

Parallel coordinates plotting is one of the most popular methods for multivariate visualization. However, when applied to larger data sets, there tends to be a "black screen problem," with the screen becoming so cluttered and full that…

Human-Computer Interaction · Computer Science 2017-09-05 Vincent Yang , Harrison Nguyen , Norman Matloff , Yingkang Xie