Fast box-counting algorithm on GPU

Related Experiment Video

Updated: May 19, 2026

Design and Optimization Strategies of a High-Performance Vented Box
14:23

Design and Optimization Strategies of a High-Performance Vented Box

Published on: June 9, 2023

J Jiménez1, J Ruiz de Miras

  • 1Department of Computer Sciences, University of Jaén, Jaén, Spain.

Computer Methods and Programs in Biomedicine
|August 25, 2012
PubMed

More Related Videos

An Automated Squint Method for Time-syncing Behavior and Brain Dynamics in Mouse Pain Studies05:49

An Automated Squint Method for Time-syncing Behavior and Brain Dynamics in Mouse Pain Studies

Published on: November 1, 2024

Related Concept Videos

Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Fast Decoupled and DC Powerflow01:24

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Buffers: Buffer Capacity01:09

Buffers: Buffer Capacity

Buffer capacity is the quantitative measure of a buffer to resist the change in pH. As shown in the following equation, the buffer capacity, denoted by 'beta', is expressed as the number of moles of acid or base needed to change the pH of a one-liter buffer solution by 1 unit. Here, Ca and Cb indicate the number of moles of acid and base, respectively. Note that dpH represents the change in pH.
In the graph, pH is plotted as a function of the number of moles of base (Cb) added to a weak acid...
Buffers: Overview01:30

Buffers: Overview

Buffers play a crucial role in stabilizing the pH of a solution by mitigating the effects of small amounts of added acid or base. They consist of a weak acid and its conjugate base or a weak base and its conjugate acid. A solution of acetic acid and sodium acetate is an example of a buffer that consists of a weak acid and its salt: CH3COOH (aq) + CH3COONa (aq). An example of a buffer that consists of a weak base and its salt is a solution of ammonia and ammonium chloride: NH3 (aq) + NH4Cl (aq).
Parallel-axis Theorem01:06

Parallel-axis Theorem

The parallel-axis theorem provides a convenient and quick method of finding the moment of inertia of an object about an axis parallel to the axis passing through its center of mass. Consider a thin rod as an example. There is a striking similarity between the process of finding the moment of inertia of a thin rod about an axis through its middle, where the center of mass lies, and about an axis through its end using the conventional method. In the conventional method, the concept of linear mass...