Ports Search

Lurker is not just another mailing list archiver. It is capable of handling gigabytes of mail without slowing down. Lurker has been designed to scale to support sites with thousands of concurrent users and hundreds of new messages a second. If you run a high-volume mailing list archive, you should seriously consider lurker for this alone. To facilitate finding interesting data, lurker supports: * full keyword search by body, subject, author, ... * a graphical representation of message relationships * charts of the current activity about a topic * searching lists or queries around an estimated time * signature verification to confirm the author * messages markup to find related information As one would expect, lurker also supports file attachments, multiple languages, message threading, gpg key photo ids, a transactional database, automatic timezone detection, render caching, xml customization with xslt and css, multiple front-ends (3-tier deployment), and many other buzz words.

xmail is an X-based interface to the Berkeley mail program. This version of xmail depends heavily upon the installation of the application default resources file for the proper declaration of features and enhancements documented in the man pages. If the defaults file or the resource declarations are not installed or in some manner made accessable to the X11 resource database manager, xmail will operate in only a minimal fashion. This version of xmail includes support for decompressing and displaying the content of an X-Face mail header, if such a header exists in the message being read. This feature is a compile time option, and requires the existence of the compface library routines, which are NOT supplied with the xmail sources. X-Face headers are compressed bitmap images, typically of the face of the person owning such a header. The compressed header contains only printable characters, which allows it to be included in a mail message.

The xmailbox program displays, by default, an image of a mailbox. When there is no mail, the image shown is that of a mailbox with its flag down. When new mail arrives, the image changes to that of a mailbox with the flag up, its door open and a letter visible inside. It can also optionally play a sound through the sound-card. The NCD audio server, the rplay sound package, FreeBSD Sun-compatible audio drivers, and an external sound player program are supported. By default, pressing any mouse button in the image forces xmailbox to remember the current size of the mail file as being the ``empty'' size and to change its image accordingly. In addition, the user can optionally invoke his/her favorite mail retrieving program.

GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. There is no limit to the precision except the ones implied by the available memory in the machine GMP runs on. GMP has a rich set of functions, and the functions have a regular interface. GMP is designed to be as fast as possible, both for small operands and for huge operands. The speed is achieved by using fullwords as the basic arithmetic type, by using fast algorithms, with carefully optimized assembly code for the most common inner loops for a lot of CPUs, and by a general emphasis on speed (instead of simplicity or elegance). GMP is believed to be faster than any other similar library. The advantage for GMP increases with the operand sizes for certain operations, since GMP in many cases has asymptotically faster algorithms.

KBruch is a small program to practice calculating with fractions and percentages. Different exercises are provided for this purpose and you can use the learning mode to practice with fractions. The program checks the user's input and gives feedback. FEATURES - Arithmetic excercise: in this exercise you have to solve a given fraction task. You have to enter the numerator and the denominator. This is the main exercise. - Comparison excercise: in this exercise you have to compare the size of two given fractions, using the symbols >, < or =. - Conversion excercise: in this exercise you have to convert a given number into a fraction. - Factorization excercise: in this exercise you have to factorize a given number into its prime factors. - Percentage excercise: in this exercise you have to calculate percentages.

[ excerpt from developer's web site ] MIRACL is a Big Number Library which implements all of the primitives necessary to design Big Number Cryptography into your real-world application. It is primarily a tool for cryptographic system implementors. RSA public key cryptography, Diffie-Hellman Key exchange, DSA digital signature, they are all just a few procedure calls away. Support is also included for even more esoteric Elliptic Curves and Lucas function based schemes. The latest version offers full support for Elliptic Curve Cryptography over GF(p) and GF(2m). Less well-known techniques can also be implemented as MIRACL allows you to work directly and efficiently with the big numbers that are the building blocks of number-theoretic cryptography. Although implemented as a C library, a well-thought out C++ wrapper is provided, which greatly simplifies program development. Most example programs (25+ of them) are provided in both C and C++ versions.

NLopt is a free/open-source library for nonlinear optimization, providing a common interface for a number of different free optimization outines available online as well as original implementations of various other algorithms. Its features include: - Callable from C, C++, Fortran, Matlab or GNU Octave, Python, GNU Guile, Julia, GNU R, Lua, and OCaml. - A common interface for many different algorithms -- try a different algorithm just by changing one parameter. - Support for large-scale optimization (some algorithms scalable to millions of parameters and thousands of constraints). - Both global and local optimization algorithms. - Algorithms using function values only (derivative-free) and also algorithms exploiting user-supplied gradients. - Algorithms for unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints.

This module is an extension to the Math::Symbolic module. A basic familiarity with that module is required. Math::Symbolic offers some builtin simplification routines. These, however, are not capable of complex simplifications. This extension offers facilities to override the default simplification routines through means of subclassing this module. A subclass of this module is required to define a simplify object method that implements a simplification of Math::Symbolic trees. There are two class methods to inherit: register and unregister. Calling the register method on your subclass registers your class as providing the simplify method that is invoked whenever simplify() is called on a Math::Symbolic::Operator object. Calling unregister on your subclass restores whichever simplification routines where in place before.

REDUCE is an interactive system for general algebraic computations of interest to mathematicians, scientists and engineers. It has been produced by a collaborative effort involving many contributors. Its capabilities include: * expansion and ordering of polynomials and rational functions; * substitutions and pattern matching in a wide variety of forms; * automatic and user controlled simplification of expressions; * calculations with symbolic matrices; * arbitrary precision integer and real arithmetic; * facilities for defining new functions and extending program syntax; * analytic differentiation and integration; * factorization of polynomials; * facilities for the solution of a variety of algebraic equations; * facilities for the output of expressions in a variety of formats; * facilities for generating optimized numerical programs from symbolic input; * calculations with a wide variety of special functions; * Dirac matrix calculations of interest to high energy physicists. It is often used as an algebraic calculator for problems that are possible to do by hand. However, REDUCE is designed to support calculations that are not feasible by hand.

Clasp is an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of answer set programming (ASP) with state-of-the-art techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-driven nogood learning, a technique that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp does not rely on legacy software, such as a SAT solver or any other existing ASP solver. Rather, clasp has been genuinely developed for answer set solving based on conflict-driven nogood learning. clasp can be applied as an ASP solver (on SMODELS format, as output by Gringo), as a SAT solver (on a simplified version of DIMACS/CNF format), or as a PB solver (on OPB format).