This package defines the type class MonadControlIO, a subset of
MonadIO into which generic control operations such as catch can be
lifted from IO. Instances are based on monad transformers in
MonadTransControl, which includes all standard monad transformers in
the transformers library except ContT. For convenience, it provides a
wrapped version of Control.Exception with types generalized from IO to
all monads in MonadControlIO.
Note that this package is a rewrite of Anders Kaseorg's monad-peel
library. The main difference is that this package provides CPS style
operators and exploits the RankNTypes language extension to simplify
most definitions.
BWPing is a tool to measure bandwidth and response times between
two hosts using Internet Control Message Protocol (ICMP) echo
request/echo reply mechanism. It does not require any special
software on the remote host. The only requirement is the ability
to respond on ICMP echo request messages.
Given a sparse matrix A the SPAI Algorithm computes a sparse approximate inverse
M by minimizing || AM - I || in the Frobenius norm. The approximate inverse is
computed explicitly and can then be applied as a preconditioner to an iterative
method.The sparsity pattern of the approximate inverse is either fixed a priori
or captured automatically:
* Fixed sparsity: The sparsity pattern of M is either banded or a subset
of the sparsity pattern of A.
* Adaptive sparsity: The algorithm proceeds until the 2-norm of each column
of AM-I is less than eps. By varying eps the user controls the quality and
the cost of computing the preconditioner. Usually the optimal eps lies between 0.5 and 0.7.
A very sparse preconditioner is very cheap to compute but may not lead to much
improvement, while if M becomes rather dense it becomes too expensive to
compute. The optimal preconditioner lies between these two extremes and is
problem and computer architecture dependent. The approximate inverse M can also
be used as a robust (parallel) smoother for (algebraic) multi-grid methods
PySE is an environemnt written in Python for solving partial differnetial equations, using the finite difference method. It is heavily based on the 'Stencil' concept in FDM methods.
Fwrap wraps Fortran code in C, Cython and Python. It focuses on Fortran 90 and 95, and will work with Fortran 77 so long as you limit yourself to “sane” Fortran 77
Polylib is a free C library for doing computations on polyhedra. The library is
operating on objects like vectors, matrices, lattices, polyhedra, Z-polyhedra,
unions of polyhedra and other intermediary structures. It provides functions
for all important operations on these structures
genus2reduction is a program for computing the conductor and reduction types
for a genus 2 hyperelliptic curve.
As an example of genus2reduction's functionality, let C be a proper smooth curve
of genus 2 defined by a hyperelliptic equation y^2+Q(x)y=P(x), where P(x)
and Q(x) are polynomials with rational coefficients such that deg(Q(x))<4,
deg(P(x))<7. Let J(C) be the Jacobian of C, let X be the minimal regular model
of C over the ring of integers Z.
This program determines the reduction of C at any prime number p
(that is the special fiber X_p of X over p), and the exponent f of
the conductor of J(C) at p
- NetBSD PR/30294: nawk doesn't handle RS as a RE but
as a single character
- NetBSD PR/42320: LC_NUMERIC in awk is not POSIX compliant
- NetBSD PR/43981: too small limit on a number of -f options
- NetBSD PR/44063: setting NF doesn't change $<fieldnum>
- NetBSD PR/44876: incorrect return value of function srand()
- Other changes
stkSolver is a Boundary Element Method solver for 3D Stokes flow.
I originally developed this code to calculate accurately the drag experienced
by arbitrarily shaped bodies. The current implementation is limited to using
given velocities as the boundary conditins of the problem
Reduze is a computer program for reducing Feynman Integrals to master integrals
employing the Gauss/Laporta algorithm. Reduze is written in C++ and uses classes
provided by the GiNaC library to perform the simplifications.
of the algebraic prefactors in the system of equations.
Fix HOMEPAGE
Update to epm-4.2
- EPM now supports a %arch conditional directive (STR #27)
- EPM now uses hard links whenever possible instead of copying
files for distribution (STR #21)
- EPM no longer puts files in /export in the root file set for AIX
packages (STR #15)
- EPM did not work with newer versions of RPM (STR #23, STR #25)
- EPM did not clean up temporary files
from Solaris packages (STR #20)
- Building Solaris gzip'd packages failed if the pkg.gz file already
existed (STR #16)
- Fixed handling of %preremove and %postremove
for AIX packages (STR #22)
- Fixed directory permissions in HP-UX packages (STR #24)
- Removed unnecessary quoting of "!" in filenames (STR #26)
- Added support for signed RPM packages (STR #19)
- Added support for inclusion of format-specific packaging files and
directives via a %literal directive (STR #5)
- *BSD init scripts were not installed properly.
- EPM now displays a warning message when a variable is undefined
(STR #10)
- *BSD dependencies on versioned packages are now specified
correctly (STR #4)
- EPM now uses /usr/sbin/pkg_create on FreeBSD (STR #2)
- FreeBSD packages are now created with a .tbz extension (STR #1)
- FreeBSD packages incorrectly assumed that chown was installed in
/bin (STR #3)
- Added support for an "lsb" package format which uses RPM with the
LSB dependencies (STR #7)
- The configure script now supports a --with-archflags and no longer
automatically builds universal binaries on Mac OS X.
- The epm program now automatically detects when the setup GUI is
not available, displays a warning message, and then creates a non-GUI
package.
- RPM packages did not map %replaces to Obsoletes:
