Mathematica Information Center

SIMPLE SEARCH

Search       for
Advanced Search»
191 - 200 of 513 for generates Search Results
We present an automated generation of the subtraction terms for next-to-leading order QCD calculations in the Catani–Seymour dipole formalism. For a given scattering ...
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-constrained multiprocessor schedules for array computations: Given a ...
Social Complexity and Global ...   (Conference Proceedings)
This session will discuss how Mathematica 7 can dissect inconspicuous social and organizational changes among flagship research universities in 10 selected states from ...
Gallium Arsenide Crystal Graphics   (MathSource: Packages and Programs)
Renders the GaAs(110) surface within Mathematica. It is similar to the CrystalStructure.m package, which is a representation of the diamond lattice. These packages were ...
Automata, a collection of Mathematica Notebooks that generate and manipulate finite state machines and their syntactic semigroups, supports all the standard operations on ...
Fractional Brownian motion is a generalization of ordinary Brownian motion that has been used successfully to model a variety of natural phenomena, such as terrains, coast ...
TSi Controls Control System Design ...   (MathSource: Packages and Programs)
TSi Controls is a Mathematica package that supports the design of feedback control laws for dynamical systems. It includes functions for the analysis of both linear and ...
We present a MathLink program that generates pseudorandom sequences of integers with extremely long period (approximately 10^16376) and with excellent correlation properties: ...
Translating Mathematica expression ...   (MathSource: Packages and Programs)
This paper introduces some ideas for translating the functional language Mathematica to the data-parallel language High Performance Fortran (HPF). It first discusses why we ...
Curious Properties of an Iterative ...   (Conference Proceedings)
We define a function by dsf[n] = a+ a+ ... + a where {a, a, ..., a} is the list of the digits of an integer n. Suppose we start with any positive integer n, and repeatedly ...
1 ... 171819 20 212223 ... 52  Previous  Next