Free usa 1.12 software for linux

gqlplus is a drop-in replacement for sqlplus, an Oracle SQL client, for UNIX and UNIX-like platforms.
The difference between gqlplus and sqlplus is command-line editing and history, plus table-name and column-name completion. As you know if you have used sqlplus, it is notoriously difficult to correct typing errors and other mistakes in your SQL statements.
sqlplus does give you ability to use external editor to edit a statement, but only the last statement you typed. gqlplus solves this problem by providing the familiar command-line editing and history as in tcsh or bash shells, and table/column-name completion, while otherwise retaining compatibility with sqlplus.
Thus, no user training is needed - simply use gqlplus instead of sqlplus. In addition, configuration/installation is trivial: gqlplus is a single binary compiled executable (written in C), so all you need to do is download it and put it anywhere in your PATH. After that, youll be ready to use it.
There are a number of other sqlplus front-end programs which include this functionality. They, however, require some user training, and may not be as easy to install (requiring particular version of Perl, and/or particular set of Perl modules, and/or configuration files).
In contrast, the design goal of gqlplus was to remain as close as possible to sqlplus, with the addition of command-line editing and table and column name completion. The command-line editing will be familiar to UNIX users since it works as in command-line shells. Additionally, there are no installation issues since the program is a single binary executable.
Enhancements:
- A SIGSEGV that occurred when using SQLPATH was fixed.
- An ACCEPT command was implemented.
- The DYLD_LIBRARY_PATH environment variable (the Mac OS X version of LD_LIBRARY_PATH) was added along with an NLS_DATE_FORMAT environment variable.
- A -p command-line switch that displays a progress report and elapsed time information was added.
- SIGTERM is now used to kill sqlplus.
- ORACLE_PATH was added to the environment.

sixbs is a library capable of writing and reading beans to and from XML using their public properties. sixbs is especially suited for writing configuration data or sending data over the network.

Contrary to normal Java serialization it is readable (i.e., you can easily edit it with your favourite text editor), and it is independent from class versions.

dbacl is a digramic Bayesian text classifier. Given some text, it calculates the posterior probabilities that the input resembles one of any number of previously learned document collections.
dbacl project can be used to sort incoming email into arbitrary categories such as spam, work, and play, or simply to distinguish an English text from a French text.
It fully supports international character sets, and uses sophisticated statistical models based on the Maximum Entropy Principle.
The dbacl project includes a tutorial or two, and a mathematical design paper (.ps.gz). Alternatively, browse the online manual pages for dbacl, bayesol, mailcross, mailtoe, mailfoot, mailinspect.
I have found two uses for dbacl so far:
- As an automated Bayesian email classification tool, it can recognize spam, and more generally sort incoming email into any number of categories such as work, play, etc.
- As a noise filter, it is useful during the indexing of personal document collections.
Both dbacl and its companion programs are written in C and run on UNIX/POSIX.
Enhancements:
- This is a hodge-podge of fixes and improvements.
- A new hypex command, the TREC 2005 options files, and an essay on chess are now in the tarball.
- Several improvements to the parsing engine were made, including a new -e char option and bugfixes.
- Compilation problems on various architectures were fixed, and libslang2 support was added.

bsnmp is a miniSNMP daemon. For a couple of projects that involved controlling software on a couple of machines from a single controlling machine I decided to use SNMP. After looking at several available SNMP implementations I started to implement my own SNMP stuff, because what was available was not really what I needed (for several reasons). The result of this work is bsnmp.

bsnmp consists of the following pieces:
a library libbsnmp that includes ASN.1 handling, the SNMP protocol version V1 and V2C and a number of helper stuff to simplify writing of SNMP agents and clients.
the gensnmptree tool that generates the C- and H-files from an object hierarchy description (.def file).
the gensnmpdef tool that generates an initial .def file from a MIB. This requires the libsmi library.
bsnmpd - the SNMP daemon.
snmp_mibII - an implementation of the standard MIB-II sub-tree.
snmp_ntp - a partial implementation of the experimental NTP MIB.

The bsnmpd daemon implements just the bare minimum that is needed for such a daemon: the system group, parts of the SNMP group and a private tree that does the following:

handling of loadable modules. This allows loading/unloading parts of the tree at runtime or configuration time.
handling of communities. A table that allows loaded modules to create new communities at run-time (ILMI is a consumer of this). This table can be disabled for obvious reasons.
handling trap destinations for V1.
several configuration parameters like the protocol versions to handle, buffer sizes and so on.
tables that manage the UDP and local unix ports the daemon is listening on.
statistics and debugging
All real functionality is implemented via loadable modules and hence the daemon can be used for remote-control functions that have nothing to do with network management.

Stardust project is a space flight game.

It is portable and expandable, and it simulates the kinematics of space flight.

The goal of Stardust is to create a 3D-Space Fight Game Open Source, portable and expandable simulating, at best, the kinematics of space flight.

My hope is to create a 3D-Space Fight Game:

Action oriented: The player will have the possibility to move around a 3D space, to fire with lasers or torpedos;

Strategy oriented: Allowing the player to give orders to his unit or cooperating with some others players via the net.

Rats! is an easily extensible parser generator for C-like languages; though currently it only generates parsers in Java. Rats! project has been explicitly designed so that grammars are concise and easily modifiable. To this end, Rats!
- organizes grammars into modules,
- builds on parsing expression grammars instead of context-free grammars and vintegrates lexing with parsing, i.e., is scannerless,
- supports the automatic generation of abstract syntax trees,
- and provides a well-defined interface for extending parsers to recognize context-sensitive languages and formats.
Parsers generated by Rats! memoize intermediate results, which ensures linear time performance in the presence of unlimited lookahead and backtracking. As a result, they are essentially functional (even though they are implemented in an imperative language) and also called "packrat parsers."
Main features:
- Rats! relies on a module system to structure grammars and their extensions. In particular, it relies on modules to group related productions into separate units. Next, module modifications concisely express extensions to other modules and can add, change, or remove individual alternatives in productions. Finally, module parameters are used to compose modules and their extensions with each other.
- Rats! grammars build on parsing expression grammars (PEGs). While PEGs share many constructs with the familiar EBNF notation, a key difference is that they utilize ordered choices instead of the unordered choices used by context-free grammars (CFGs) and other parser generators, such as Yacc or ANTLR. As a result, Rats! grammars avoid ambiguities and support localized changes. Additional flexibility is offered through syntactic predicates, which match expressions but do not consume the input, thus providing unlimited lookahead, and through the integration of lexing with parsing, which greatly simplifies the addition of new tokens to a grammar. PEGs have the additional benefit that they are not only closed under composition (unlike the LR or LL grammars used by Yacc and ANTLR), but also intersection and complement (unlike CFGs in general).
- To eliminate the need for explicit semantic actions, Rats! can automatically generate abstract syntax trees. In particular, it supports productions that return no semantic values (such as those recognizing spaces or comments), string values (such as those recognizing literals or identifiers), and generic tree nodes (potentially all other productions).
- Since some computer-readable formats are inherently context-sensitive and cannot be expressed as PEGs (or CFGs), Rats! supports two techniques for managing parser context or state, thus providing a well-defined interface for extending parsers. First, Rats! provides parser actions to recognize expressions that depend on local context, i.e., expressions that depend on immediately preceding expressions within the same production. An example for such local context is an explicit length preceding as many instances of some expression. Second, Rats! supports a global state object to recognize expressions that depend on possibly global context. State modifications are performed within lightweight transactions, which preserve the basically functional nature of Rats!-generated parsers. An example for a global context is the symbol table used for disambiguating variable and typedef names when parsing C.
Enhancements:
- Release highlights are support for formatting-preserving source refactorings through parse trees, support for parsing and pretty printing Java 5, (an improved abstract syntax tree for Java, and improved support for type checking C and Java ASTs.