The system of computer algebra Mathematica contains advanced tools of algebraic ex-pressions simplification (Simplify and a newer one FullSimplify). Its external package ...

The theory of NP-completeness is fundamental to computational complexity and the SATISFIABILITY problem of Boolean Logic is the seminal NP-complete problem on which the ...

Slop (or backlash) in mechanical assemblies is often present and is usually undesirable from both craftsmanship and performance points of view. It is our belief that this ...

MathLink for AppleScript is a Scripting Addition (OSAX) that makes it possible to use Mathematica as a computational engine in AppleScript programs. The second use of ...

Tensor calculations and manipulations are frequently required to treat physics problems in physics classes. Given that tensor analysis is considered difficult, physicists ...

Modeling chemical kinetics in a reactor easily ends up with a long piece of source code. Writing down the model on a piece of paper is much shorter, because we interpret the ...

Advances in luminescence dosimetry have made geochronological dating of materials from extreme environments possible through the use of optically stimulated luminescence ...

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric- type ...

According to the American Institute of Physics, the physics department at SUNY-Geneseo is ranked 2nd in the nation in terms of the number of Bachelor's physics degrees ...

Analog filters are an essential part of modern electronics; however, their design, realization and verification can be arduous and time consuming. This paper describes a ...