Localized Dictionaries for Mozilla Thunderbird
One of the aims of this package is to make life easier for useRs
who deal with survey data sets. It provides an infrastructure for
the management of survey data including value labels, definable
missing values, recoding of variables, production of code books,
and import of (subsets of) SPSS and Stata files. Further, it provides
functionality to produce tables and data frames of arbitrary
descriptive statistics and (almost) publication-ready tables of
regression model estimates. Also some convenience tools for graphics,
programming, and simulation are provided.
[ excerpt from developer's web site ]
Using JNI (Java Native Interface), a bit of C code (thanks ugha!),
a little manual work and a piece of chewinggum: it is possible to
make the public key cryptography quite a bit faster.
ABACUS is a software system written in C++ that provides a framework for the
implementation of branch-and-bound algorithms using linear programming
relaxations. Cutting planes or columns can be generated dynamically
(branch-and-cut, branch-and-price, branch-and-cut-and-price).
ABACUS allows the software developer to concentrate merely on the problem
specific parts, i.e., the separation of cutting planes, column generation, and
primal heuristics. ABACUS supports the Open Solver Interface (Osi) developed
by the COIN-OR (COmputational INfrastructure for Operations Research) project
which means that every solver supported by OSI can be used to solve the
relaxations.
Moreover, ABACUS provides a variety of general algorithmic concepts, e.g., a
list of different enumeration and branching strategies from which the best
alternative for the user's application can be chosen.
Finally, ABACUS provides many basic data structures and useful tools for the
implementation of such algorithms. It is designed both for general mixed
integer optimization problems and for combinatorial optimization problems. It
unifies cutting plane and column generation within one algorithm framework.
Simple reuse of code and the design of abstract data structures and algorithms
are met by object oriented programming modules.
ANN is a library written in C++, which supports data structures
and algorithms for both exact and approximate nearest neighbor
neighbor searching in arbitrarily high dimensions.
The Clipper library primarily performs boolean clipping (intersection,
union, difference and xor) on polygons in 2D space. There are no
restrictions on either the number nor the type of polygon that can be
clipped. They can have holes, be self-intersecting and even have coincident
edges. The library also performs polygon offsetting
ARPACK++ is a collection of classes that offers c++ programmers an interface
to ARPACK. It preserves the full capability, performance, accuracy and low
memory requirements of the FORTRAN package, but takes advantage of the C++
object-oriented programming environment.
Concorde is a computer code for the traveling salesman problem (TSP)
and some related network optimization problems. The code is written
in the ANSI C programming language and it is available for academic
research use; for other uses, contact bico@isye.gatech.edu for
licensing options.
Concorde's TSP solver has been used to obtain the optimal solutions to
106 of the 110 TSPLIB instances; the largest having 15,112 cities.
The Concorde callable library includes over 700 functions permitting
users to create specialized codes for TSP-like problems. All Concorde
functions are thread-safe for programming in shared-memory parallel
environments; the main TSP solver includes code for running over
networks of Unix workstations.
ARPACK software is capable of solving large symmetric, nonsymmetric, and
generalized eigenproblems. The software is designed to compute a few (k)
eigenvalues with user-specified features, such as those of largest real part
or largest magnitude. Storage requirements are on the order of n*k locations,
and no auxiliary storage is required. A set of numerically orthogonal Schur
basis vectors for the desired k-dimensional eigen-space is computed.
Numerically accurate eigenvectors are available on request.
This is a reference implementation of the C interface to the legacy
Fortran Basic Linear Algebra Subprograms (BLAS), as described in
Annex B of the BLAS Technical Forum (BLAST) Standard.