Ports Search

The procmail mail processing program can be used to create mail-servers, mailing lists, sort your incoming mail into separate folders/files (real convenient when subscribing to one or more mailing lists or for prioritising your mail), preprocess your mail, start any programs upon mail arrival (e.g. to generate different chimes on your workstation for different types of mail) or selectively forward certain incoming mail automatically to someone. Procmail can be used: - and installed by an unprivileged user (for himself only). - as a drop in replacement for the local delivery agent /bin/mail (with biff/comsat support). - as a general mailfilter for whole groups of messages (e.g. when called from within sendmail.cf rules). The accompanying formail program enables you to generate autoreplies, split up digests/mailboxes into the original messages, do some very simple header-munging/extraction, or force mail into mail-format (with leading From line).

Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers for various uses. It has specific support for many natural language processing applications such as producing morphological analyzers. Although NLP applications are probably the main use of foma, it is sufficiently generic to use for a large number of purposes. The foma interface is similar to the Xerox xfst interface, and supports most of the commands and the regular expression syntax in xfst. Many grammars written for xfst compile out-of-the-box with foma. The library contains efficient implementations of all classical automata/transducer algorithms: determinization, minimization, epsilon-removal, composition, boolean operations. Also, more advanced construction methods are available: context restriction, quotients, first-order regular logic, transducers from replacement rules, etc.

the Auto Payment Calculator V1.0 Release Copyright (C) 1997 Eric A. Griff Auto Payment Calculator is a simple, xforms based, application for use under the X-windows system, that calculates auto loan payments. It is pretty straight forward. You enter the Principal (Amount), Term (in months), and Rate, and then with either [RETURN] (or [enter] or whatever your keyboard equivelent is), (ALT-C), or clicking the calculate button; you will have the payment in months, as well as number of weeks, and weekly payment. You may also [TAB] through the Amount, Term, and Rate, as well as hold down ALT and press the character in its Name that is underlined to go do that function. As long as all three are filled in, you may hit [ENTER] to Calculate right there. This makes it easy to cycle quickly through numerous terms, amounts, and rates.

FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. The FFTW package was developed at MIT by Matteo Frigo and Steven G. Johnson. Please send email to fftw@theory.lcs.mit.edu so that we can keep track of users and send you information about new releases. The latest version of FFTW, benchmarks, links, and other information can be found at the FFTW home page.

FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. The FFTW package was developed at MIT by Matteo Frigo and Steven G. Johnson. Please send email to fftw@theory.lcs.mit.edu so that we can keep track of users and send you information about new releases. The latest version of FFTW, benchmarks, links, and other information can be found at the FFTW home page.

KmPlot is a program to draw graphs, their integrals or derivatives. It supports different systems of coordinates like the cartesian or the polar coordinate system. The graphs can be colorized and the view is scalable, so that you are able to zoom to the level you need. Features: - Powerful mathematical parser. - Precise metric printing. - Different plot types: cartesian, parametric, polar, implicit, differential. - Highly configurable visual settings (plot line, axes, grid). - Export to bitmap format (BMP and PNG) and scalable vector graphics (SVG). - Save/load complete session in readable XML format. - Trace mode: cross hair following plot, coordinates shown in the status bar. - Supports zooming. - Ability to draw the 1st and 2nd derivative and the integral of a plot function. - Supports user defined constants and parameter values. - Various tools for plot functions: - Find minimum/maximum point. - Get y-value and draw the area between the function and the y-axis.

LASPack (version 1.12.2) LASPack is a package for solving large sparse systems of linear equations like those which arise from discretization of partial differential equations. Main features: - The primary aim of LASPack is the implementation of efficient iterative methods for the solution of systems of linear equations. - Beside the obligatory Jacobi, succesive over-relaxation, Chebyshev, and conjugate gradient solvers, LASPack contains selected state-of-the-art algorithms which are commonly used for large sparse systems: - CG-like methods for non-symmetric systems: CGN, GMRES, BiCG, QMR, CGS, and BiCGStab, - multilevel methods such as multigrid and conjugate gradient method preconditioned by multigrid and BPX preconditioners. A complete description of the package (including the installation procedure) you may find in LASPack Reference Manual:

Math::Symbolic::Custom::Transformation is an extension to the Math::Symbolic module. You're assumed to be remotely familiar with that module throughout the documentation. This package implements transformations of Math::Symbolic trees using Math::Symbolic trees. I'll try to explain what this means in the following paragraphs. Until now, in order to be able to inspect a Math::Symbolic tree, one had to use the low-level Math::Symbolic interface like comparing the top node's term type with a constant (such as T_OPERATOR) and then its operator type with more constants. This has changed with the release of Math::Symbolic::Custom::Pattern. To modify the tree, you had to use equally low-level or even encapsulation-breaking methods. This is meant to be changed by this distribution.

A collection of functions to create spatial weights matrix objects from polygon contiguities, from point patterns by distance and tesselations, for summarising these objects, and for permitting their use in spatial data analysis, including regional aggregation by minimum spanning tree; a collection of tests for spatial autocorrelation, including global Moran's I, APLE, Geary's C, Hubert/Mantel general cross product statistic, Empirical Bayes estimates and Assuno/Reis Index, Getis/Ord G and multicoloured join count statistics, local Moran's I and Getis/Ord G, saddlepoint approximations and exact tests for global and local Moran's I; and functions for estimating spatial simultaneous autoregressive (SAR) lag and error models, impact measures for lag models, weighted and unweighted SAR and CAR spatial regression models, semi-parametric and Moran eigenvector spatial filtering, GM SAR error models, and generalized spatial two stage least squares models.

> There doesn't appear to be any decent way to compare the last modified > times of files from the shell... Before everybody starts inventing their own names for this, it should be noted that V8 already has a program for this, newer(1). It takes two filenames as arguments, and exits with status 0 if and only if either (a) the first exists and the second does not, or (b) both exist and the first's modification time is at least as recent as the second's. Other- wise it exits with non-zero status. (The preceding two sentences are essentially the whole of the manual page for it.) Relatively few people have V8, but in the absence of any other precedent for what this facility should like look, it seems reasonable to follow V8's lead: newer file1 file2 exit with 0 status if file1 exists and file2 does not, or if file1's last modified time is at least as recent as file2's.