Free variant software for linux

Parse::Binary::FixedFormat::Variants is a Perl module to convert between variant records and hashes.

Parse::Binary::FixedFormat supports variant record formats. To describe a variant structure, pass a hash reference containing the following elements to new. The object returned to handle variant records will be a Parse::Binary::FixedFormat::Variants.

Chooser

When converting a buffer to a hash, this subroutine is invoked after applying the first format to the buffer. The generated hash reference is passed to this routine. Any field names specified in the first format are available to be used in making a decision on which format to use to decipher the buffer. This routine should return the index of the proper format specification.

When converting a hash to a buffer, this subroutine is invoked first to choose a packing format. Since the same function is used for both conversions, this function should restrict itself to field names that exist in format 0 and those fields should exist in the same place in all formats.

Formats

This is a reference to a list of formats. Each format contains a list of field specifications.

For example:
my $cvt = new Parse::Binary::FixedFormat {
Chooser => sub { my $rec=shift;
$rec->{RecordType} eq 0 ? 1 : 2
},
Formats => [ [ RecordType:A1 ],
[ RecordType:A1, FieldA:A6, FieldB:A4:4 ],
[ RecordType:A1, FieldC:A4, FieldD:A18 ] ]
};
my $rec0 = $cvt->unformat("0FieldAB[0]B[1]B[2]B[3]");
my $rec1 = $cvt->unformat("1FldC");

In the above example, the Chooser function looks at the contents of the RecordType field. If it contains a 0, format 1 is used. Otherwise, format 2 is used.

Parse::Binary::FixedFormat::Variants can be used is if it were a Parse::Binary::FixedFormat. The format and unformat methods will determine which variant to use automatically. The blank method requires an argument that specifies the variant number.

MaraDNS is a package that implements the Domain Name Service (DNS), an essential internet service.
MaraDNS is intended for environments where a DNS server must be secure and where the server must use the absolute minimum number of resources possible.
MaraDNS was created in response to issues people had with the DNS servers available in early 2001; and has the following design goals:
- Security-aware programming. A DNS server needs to be secure. I have a number of security features in the code, including:
1. The code uses a special string library which is resistant to buffer overflows.
2. The code, if started as root, mandates running as an unprivledged user in a chroot() jail.
- Open-Source. The 1.0 release of the DNS server is public-domain code; the next release will be released under a very liberal BSD-style license.
- Simplicity. This DNS server has the minimum number of features needed to correctly act as an authoritative and/or recursive name server.
Enhancements:
- The AES variant that MaraDNS uses has been hardened against some cache timing attacks that cryptographers have recently published.

xquarto project is a two-player board game based on logic.

Xquarto is a board game designed for the X windows environment. The game is a two-player game, although for the moment,it is only possible to play against the computer. The board is composed of 4x4 squares and 16 pieces. Each piece has four
properties: black or brown, horizontal or vertical, solid or hollow, round or square. This makes up 16 possible combinations and there is exactly one piece for each possibility.

Initially, the board is empty and it is successively filled with pieces. The game is over when a row, a column or a diagonal has four pieces carrying a common property in it, e.g. four black (brown) pieces, four square (round) pieces, four filled
(hollow) pieces, four horizontal (vertical) pieces. In the original quarto rules, the player who is the first to complete a row, column or diagonal as described above wins. This is the implicit mode under which xquarto runs. A variant of the game (tic rules) consists rather of avoiding alignments, i.e. the player who is forced to complete
an alignment loses.

The game is a two-player game. Player 1 chooses one of the 16 pieces. Player 2 then places this piece on one of the 16 squares of the board and chooses a piece out of the remaining 15 pieces which he gives to player 1, who places this piece on one of the remaining 15 squares on the board, etc...

Xquarto supports three different player combinations: human vs computer, computer vs human and human vs human (possibly through the local network in the latter case). The default combination is human vs computer, i.e. the human player starts the game against the computer. This can be changed by clicking on the "Actions" menu (see below for more details).

The rules are really very simple - believe me!

ferite is a lighweight, portable, threadsafe scripting engine with a language that is very easy to pick up and use.

ferite is a scripting engine and language written in c for complete portability.

ferite is a clean language with influences from various places: objects from Java/C++, functions from C/php, closures from scheme, block calling from ruby, namespaces from C++, as well as its own a sane loose typing mechanism, variant type and set of nice APIs.

Its origins are from one of those "it seems like a good idea", the good idea was provoked by finding perl a real pain in the arse to embed (from what I gather its easier nowadays). It started in the summer of 2000 (with various tries and fails within the pre-ceding two years). It reached version 1.0 in the second quarter of 2005.

Approximator Line is an application which allows to synthesize approximation function of one argument. Both coordinates of known points or mathematical expression can be used as input data.
The application uses evolutionary algorithm which allows to find more optimal results. The enhanced evolutionary algorithm allows to avoid long-time hitting to local maximum.
In few hours the application can evaluate milliards of combinations with using of reasonable number of input data points and on contemporary computer. Approximator Line uses multithreading that can help to utilize maximum computation power.
Approximator Lines primary goal is to search of function, which value, most come nearer to the initial data. The preference is given the smallest functions. The weight of this preference is established in options of synthesis.
Search of function is made by the next way:
The random mathematical variant is under construction. Its fitness to the data is calculated. Further the variant is copied and changes. Fitness of the changed variant is calculated. If it is more, the new variant becomes base. It is simplified.
Key parameter of the found function is fitness of its set goal. Fitness is expressed in percentage. Its value depends on a way of the assignment of fitness of a point (it is established in parameters of synthesis). The program uses two basic such as fitness:
General fitness
Calculates on the general points.
Additional fitness
Calculates on general and additional points. It is used for more exact definition of fitness. It also is used for avoidance of a finding of such functions which correspond to the basic points, but in an interval between them strongly differ.
Additional fitness is used for a finding of the most corresponding functions at smaller amount of computing expenses as it calculates only if the basic fitness more than at the previous variant. Besides each of the mentioned above fitness can be normal or effective.
Normal fitness
Fitness in view of amount of elements of expression.
Effective fitness
Fitness without taking into account amount of elements of expression.
In the list of results normal additional conformity and effective additional conformity is accordingly displayed.
By search of the most suitable variant, or in other words synthesis cancelation constant subexprassions is made also.
Synthesis is based on use of random numbers. Functions making expression, operators variables and numbers get out randomly. The application is optimized on speed. So synthesized function in memory represents a tree of mathematical objects. Values of function are calculates by the most effective way. The mutation also is made above a tree of objects.
Usage:
- Determine the form of the input data (coordinates or expression).
- Choose points of your graph. Synthesis will be estimated on them.
- Enter coordinates of points (use autonumbering for simplification of input) or expression.
- Determine a range of value of function, amount of the basic points, amount of additional points.
- Open parameters of synthesis and adjust if it is necessary.
- Save the project.
- Press Start of synthesis.
- Pass to results and see on them.
- Leave the application working on long time.
- Periodically check results. When the application will find, in your opinion, suitable function, press Stop and save results.

FAangband is a first age Tolkien-based variant of Angband.
A roguelike game set in the wilderness and dungeons of Middle Earth in the first age. Fight your way through plains, mountains, forests, swamps, deserts and dungeons to face Morgoth, Lord of Darkness. Not a short game.
Here are the big changes:
- Races have been significantly changed. Half-Orcs, Half-Trolls, Half-elves and Shadow Fairies have gone; there are new varieties of Elves, Dwarves and Men. Dwarves as a whole tend to have better Intelligence than Wisdom; the reverse is true for (most) Elves and Hobbits. Different races also have significantly different starting conditions.
- There is wilderness. Wilderness is like and unlike dungeon. On the similar side, it is randomly generated in rectangular pieces; the "level" still only goes up or down by one in going from one piece to the next; there is a structured way of advancing through the wilderness. On the other hand, it looks different (no rooms); there are sometimes choices as to how to advance (north or west, maybe, rather than just down); and tactics become quite different. There are five basic types of wilderness - open plains, dense forests, rocky mountains, harsh deserts and pathless swamps. It also has day and night, which affects light-hating monsters and the players need for light.
- There are multiple towns, small and large, spread throughout the wilderness. Each race starts in its natural town. This means that the starting towns for some races are in the middle of quite dangerous wilderness. In order to reduce extreme effects of this (instant death, or instant growth of 15 levels), some races have improved starting equipment, and several races start with some experience already (advancing them in character level up to a maximum of level 5). High elves are no longer the easy option, at least at first. You can move your house to a different town, but only once you have walked there.
- There are multiple dungeons (five, to be precise). At the bottom of each is a guardian, who can only appear there or in special circumstances (which you may be able to guess...) be summoned. The first specialist ability (and second as well for warriors) is still learned at the beginning, but the two others each become available on killing a dungeon guardian. It is possible to ignore the other dungeons and head straight for Angband, but theres a heavy price to pay.
- Word of Recall works differently. Read away from your home town, it still takes you back there. Read in your home town, you are given a list of up to four points to recall to. When you recall back to town, you get the choice of which of your recall points you wish to update.
- Anything from later than the First Age has been removed. No more Rings of Power, Grishnakh, Anduril, Saruman, Witch-King, etc. There are some new uniques, artifacts and ego-items (and some just renamed). There are also new item sets, and some reworked artifacts.
- There is no savefile compatibility with Oangband or Angband. Savefiles had to change at least to accommodate changes to data structures (particularly the player data), and the big changes to races meant that any translation would be rather artificial. Anyone with an Oangband savefile should keep playing it in Oangband; anyone with an Oangband compatible Angband savefile (version 2.9.1 or older) should be congratulated and, well, upgrade.
Enhancements:
- large reduction in wilderness monsters
- better handling of savefile paths
- increase in wilderness vaults
- some extra dungeon vaults
- several bugfixes

Accelerated KNOPPIX is a fast-booting variant of the popular KNOPPIX live CD.

The mechanism of acceleration in the live CD

A cloop profiler is developed in order to grasp the access situation of CD.

Although various files are referred to in Live CD in the case of a system startup, since each position of media is dotted with the file, a lot of seeking will generate it at the time of reading. If the seek time of this CD is lost, it will be said that data can be transmitted at a stretch from CD. Then, the seek time of a pickup is reduced by rearranging the file read at the time of starting on a block level.

Live CD performs automatic recognition of the peripheral equipment of PC at the boot sequence.

Although the cache of the file required for starting of a desktop are predicted and carried out in the meantime, if there are few memories which can be used for cache, starting will become slow conversely. By this development, memory capacity is examining making it an effect show up at least because the predicted data carries out the cache of the compression image of cloop as it is.

ServingXML is a markup language for expressing XML pipelines, and an extensible Java framework for defining the elements of the language.
ServingXML currently comes with a console app, and also documents an API for imbedding the software in a standard Java or J2EE application.
ServingXML supports reading content as XML files, flat files, SQL queries or dynamically generated SAX events, transforming it with XSLT stylesheets and custom SAX filters, and writing it as XML, HTML, PDF or mail attachments.
This software is especially suited for converting flat file or database records to XML, with its support for namespaces, variant record types, multi-valued fields, segments and repeating groups, hierarchical grouping of records, and record-by-record validation with XML Schema.
ServingXML works as an "inversion of control" container for assembling components from a variety of projects - Apache FOP, Sun MSV and others - and making them work together to process records and XML.
Main features:
- Convert flat files to XML and vice versa.
- Convert database records to XML and vice versa.
- Convert flat files from one layout to another.
- Transform and validate XML with SAX filters, XSLT stylesheets, and schema validation.
Enhancements:
- This release fixes a number of minor bugs and also provides better error messages with more context.