enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Williams–Landel–Ferry equation - Wikipedia

    en.wikipedia.org/wiki/Williams–Landel–Ferry...

    The equation can be used to fit (regress) discrete values of the shift factor a T vs. temperature. Here, values of shift factor a T are obtained by horizontal shift log(a T ) of creep compliance data plotted vs. time or frequency in double logarithmic scale so that a data set obtained experimentally at temperature T superposes with the data set ...

  3. Time–temperature superposition - Wikipedia

    en.wikipedia.org/wiki/Time–temperature...

    The time–temperature shift factor can also be described in terms of the activation energy (E a). By plotting the shift factor a T versus the reciprocal of temperature (in K), the slope of the curve can be interpreted as E a /k, where k is the Boltzmann constant = 8.64x10 −5 eV/K and the activation energy is expressed in terms of eV.

  4. Sieve of Eratosthenes - Wikipedia

    en.wikipedia.org/wiki/Sieve_of_Eratosthenes

    Find the smallest number in the list greater than p that is not marked. If there was no such number, stop. Otherwise, let p now equal this new number (which is the next prime), and repeat from step 3. When the algorithm terminates, the numbers remaining not marked in the list are all the primes below n.

  5. Linear-feedback shift register - Wikipedia

    en.wikipedia.org/wiki/Linear-feedback_shift_register

    In computing, a linear-feedback shift register (LFSR) is a shift register whose input bit is a linear function of its previous state. The most commonly used linear function of single bits is exclusive-or (XOR). Thus, an LFSR is most often a shift register whose input bit is driven by the XOR of some bits of the overall shift register value.

  6. Cross-correlation - Wikipedia

    en.wikipedia.org/wiki/Cross-correlation

    As an example, consider two real valued functions and differing only by an unknown shift along the x-axis. One can use the cross-correlation to find how much g {\displaystyle g} must be shifted along the x-axis to make it identical to f {\displaystyle f} .

  7. Step detection - Wikipedia

    en.wikipedia.org/wiki/Step_detection

    In statistics and signal processing, step detection (also known as step smoothing, step filtering, shift detection, jump detection or edge detection) is the process of finding abrupt changes (steps, jumps, shifts) in the mean level of a time series or signal.

  8. Mean shift - Wikipedia

    en.wikipedia.org/wiki/Mean_shift

    Mean shift is a non-parametric feature-space mathematical analysis technique for locating the maxima of a density function, a so-called mode-seeking algorithm. [1] Application domains include cluster analysis in computer vision and image processing .

  9. Shor's algorithm - Wikipedia

    en.wikipedia.org/wiki/Shor's_algorithm

    The problem that we are trying to solve is: given an odd composite number, find its integer factors. To achieve this, Shor's algorithm consists of two parts: A classical reduction of the factoring problem to the problem of order-finding.