Free native american symbols software for linux

Math::Algebra::Symbols is a Symbolic Algebra in Pure Perl.

SYNOPSIS

Example symbols.pl
#!perl -w -I..

use Math::Algebra::Symbols hyper=>1;
use Test::Simple tests=>5;

($n, $x, $y) = symbols(qw(n x y));

$a += ($x**8 - 1)/($x-1);
$b += sin($x)**2 + cos($x)**2;
$c += (sin($n*$x) + cos($n*$x))->d->d->d->d / (sin($n*$x)+cos($n*$x));
$d = tanh($x+$y) == (tanh($x)+tanh($y))/(1+tanh($x)*tanh($y));
($e,$f) = @{($x**2 eq 5*$x-6) > $x};

print "$an$bn$cn$dn$e,$fn";

ok("$a" eq $x+$x**2+$x**3+$x**4+$x**5+$x**6+$x**7+1);
ok("$b" eq 1);
ok("$c" eq $n**4);
ok("$d" eq 1);
ok("$e,$f" eq 2,3);

JavaNativeCompiler (JNC) is a Java to native compiler. The project allows AOT (ahead of time) compilation of your Java applications. With JNC, you can create real standalone native binaries (.exe on Windows) which will no longer depend on a JRE.
This is especially useful when applications have to be deployed to end-users. All vexatious problems of deploying Java applications can be solved by compiling them to native. They will be:
- Easy to deploy
No JRE dependency. Most end-users dont know what they have installed.
No more problems on how to create an executable file out of a JAR or class file.
- Hard to decompile
Java can easily be decompiled. Native compilation will protect your source code.
- Run fast from the start
No more overhead for loading a JRE.
Enhancements:
- This release fixes a couple of problems with AWT/Swing and XML.
- It also once again contains a version for Linux.
- The compiler binary downloads are smaller.

Symbol is a Perl module created to manipulate Perl symbols and their names.

SYNOPSIS

use Symbol;

$sym = gensym;
open($sym, "filename");
$_ = ;
# etc.

ungensym $sym; # no effect

# replace *FOO{IO} handle but not $FOO, %FOO, etc.
*FOO = geniosym;

print qualify("x"), "n"; # "Test::x"
print qualify("x", "FOO"), "n" # "FOO::x"
print qualify("BAR::x"), "n"; # "BAR::x"
print qualify("BAR::x", "FOO"), "n"; # "BAR::x"
print qualify("STDOUT", "FOO"), "n"; # "main::STDOUT" (global)
print qualify(*x), "n"; # returns *x
print qualify(*x, "FOO"), "n"; # returns *x

use strict refs;
print { qualify_to_ref $fh } "foo!n";
$ref = qualify_to_ref $name, $pkg;

use Symbol qw(delete_package);
delete_package(Foo::Bar);
print "deletedn" unless exists $Foo::{Bar::};

Symbol::gensym creates an anonymous glob and returns a reference to it. Such a glob reference can be used as a file or directory handle.

For backward compatibility with older implementations that didnt support anonymous globs, Symbol::ungensym is also provided. But it doesnt do anything.

Symbol::geniosym creates an anonymous IO handle. This can be assigned into an existing glob without affecting the non-IO portions of the glob.

Symbol::qualify turns unqualified symbol names into qualified variable names (e.g. "myvar" -> "MyPackage::myvar"). If it is given a second parameter, qualify uses it as the default package; otherwise, it uses the package of its caller. Regardless, global variable names (e.g. "STDOUT", "ENV", "SIG") are always qualified with "main::".

Qualification applies only to symbol names (strings). References are left unchanged under the assumption that they are glob references, which are qualified by their nature.

Symbol::qualify_to_ref is just like Symbol::qualify except that it returns a glob ref rather than a symbol name, so you can use the result even if use strict refs is in effect.

Symbol::delete_package wipes out a whole package namespace. Note this routine is not exported by default--you may want to import it explicitly.

Steel Bank Common Lisp is a development environment for Common Lisp, with excellent support for the ANSI standard: garbage collection, lexical closures, powerful macros, strong dynamic typing, incremental compilation, and the famous Common Lisp Object System (multimethods and all).

Steel Bank Common Lisp also includes many extensions, such as native threads, socket support, a statistical profiler, programmable streams, and more. These are all available through an integrated, interactive native compiler which feels like an interpreter.

SBCL is unique in being a multiplatform native compiler which bootstraps itself completely from source, using a C compiler and any other ANSI Common Lisp implementation.

Whats New in This Release:

* enhancement: experimental macro SB-EXT:COMPARE-AND-SWAP provides
atomic compare-and-swap operations on threaded platforms.
* enhancement: experimental function SB-EXT:RESTRICT-COMPILER-POLICY
allows assining a global minimum value to optimization qualities
(overriding proclamations and declarations).
* enhancement: closed over variables can be stack-allocated on x86
and x86-64.
* performance bug fix: GETHASH and (SETF GETHASH) are once again
non-consing.
* optimization: slot definition lookup is now O(1). This speeds up
eg. SLOT-VALUE and (SETF SLOT-VALUE) with variable slot names.
* optimization: STRING-TO-OCTETS is now up to 60% faster for UTF-8.
* optimization: ASSOC and MEMBER can now be open-coded for all
combinations of keyword arguments when second argument is constant
and SPEED >= SPACE. In other cases a specialized version is
selected.
* bug fix: using obsoleted structure instances with TYPEP and
generic functions now signals a sensible error.
* bug fix: threads waiting on GET-FOREGROUND can be interrupted.
(reported by Kristoffer Kvello)
* bug fix: backtrace construction is now more careful when making
lisp-objects from pointers on the stack, to avoid creating bogus
objects that can be seen by the GC.
* bug fix: defaulting of values in contexts expecting more than 7
variables now works on x86-64. (reported by Christopher Laux)
* bug fix: modifications to packages (INTERN, EXPORT, etc) are now
thread safe.
* bug fix: (SETF SYMBOL-PLIST) no longer allows assigning a non-list
as the property-list of a symbol.
* bug fix: DEFMETHOD forms with CALL-NEXT-METHOD in the method body,
in EVAL-WHEN forms with both :COMPILE-TOPLEVEL and :LOAD-TOPLEVEL
situations requested, are once again file-compileable. (reported
by Sascha Wilde)

Lingua::Phonology::Symbols is a Perl module for associating symbols with segment prototypes.

SYNOPSIS

use Lingua::Phonology;
$phono = new Lingua::Phonology;

# Load the default features
$phono->features->loadfile;

# Load the default symbols
$symbols = $phono->symbols;
$symbols->loadfile;

# Make a test segment
$segment = $phono->segment;
$segment->labial(1);
$segment->voice(1);

# Find the symbol matching the segment
print $symbols->spell($segment); # Should print b

When using Lingua::Phonology, you usually manipulate Segment objects that have various feature values that specify the phonetic qualities of the segment. However, it is difficult to print those feature values, and a list of feature values can be difficult to interpret anyway. This is where Symbols comes in--it provides a way to take a Segment object and get a phonetic symbol representing the properties of that segment.

In Symbols, you may use add_symbol() to define text symbols that correlate to "prototypes", which are special Segment objects that represent the ideal segment for each symbol. After you have defined your symbols and prototypes, you may use spell() to find which prototype is the most similar to a segment in question, and get the symbol for that prototype.

As of v0.2, Symbols also includes diacritics. A diacritic is a special symbol that begins or ends with a *, and which is used to modify other symbols. If the best symbol match for a segment you are trying to spell is an imperfect match, Symbols will then attempt to use diacritics to indicate exactly how the segment is pronounced. For compatibility reasons, however, this feature is off by default. It can be turned on with set_diacritics.

You will probably want to read the add_symbol, spell, and loadfile sections, because these describe the most widely-used functions and the algorithm used to score potential matches. If youre not getting the results you expect, you probably need to examine the way your prototype definitions are interacting with that algorithm.

Symbolica is a remake of the C-64 game of the same name. The project is targeted to the Linux-based handhelds gp2x and N800, with a Linux/386 binary also provided. It should compile under any operating system supported by SDL, SDL_image, and SDL_ttf.

The symbols on the screen represent a numeric value in the order they are displayed on the right. As you move over a symbol, it decrements to the next lower symbol or disappears. Your job is to clear the screen and move to the E symbol.

Your job is to clear the screen and move to the E symbol.

Ofcourse all is in favour to save the world from some evil space mutants that have captured your girlfriend to take over the world... or something like that.

It tries to select best screen resolution for your system, to change default, see symbolica -h

Keys:

GP2X: SELECT quits - rest should be obvious
Linux: ESC quits - 1/2 adjusts volume - rest should be obvious

A decompiler takes as input an executable file, and attempts to create a high level, compilable, possibly even maintainable source file that does the same thing.
It is therefore the opposite of a compiler, which takes a source file and makes an executable. However, a general decompiler does not attempt to reverse every action of the decompiler, rather it transforms the input program repeatedly until the result is high level source code. It therefore wont recreate the original source file; probably nothing like it.
It does not matter if the executable file has symbols or not, or was compiled from any particular language. (However, declarative languages like ML are not considered.)
The intent is to create a retargetable decompiler (i.e. one that can decompile different types of machine code files with modest effort, e.g. X86-windows, sparc-solaris, etc). It was also intended to be highly modular, so that different parts of the decompiler can be replaced with experimental modules. It was intended to eventually become interactive, a la IDA Pro, because some things (not just variable names and comments, though these are obviously very important) require expert intervention. Whether the interactivity belongs in the decompiler or in a separate tool remains unclear.
By transforming the semantics of individual instructions, and using powerful techniques such as Static Single Assignment dataflow analysis, Boomerang should be (largely) independent of the exact behaviour of the compiler that happened to be used. Optimisation should not affect the results. Hence, the goal is a general decompiler.
Version restrictions:
- In case you want to try Boomerang as it is as a decompiler (as opposed to experimenting with it, or improving it), be aware of its severe limitations. As of early 2004, Boomerang will only decompile X86 (Linux/X86 or Windows PE), SPARC (Solaris, or presumably Linux/SPARC), or Power PC (Linux/PPC or Mac OS/X) programs. In particular, note that it will not decompile DOS or NE (Windows 3.1) programs. Adding another processor is a large (several month) undertaking.
- It will only generate C, not C++. It will decompile C++ programs of course, (and any sorts of programs, including assembler). You may be able to hand edit some C++ programs into usable C++ source code. For MSVC compiled programs, at present you have to spoonfeed the decompiler and tell it that there is one register parameter (thiscall calling convention). The switches to handle this are complex; see using the -sf switch.

American Political Science: Campaign Simulator project is a statistically based political campaign simulation game.
The Campaign Simulator is an attempt to statistically model and predict the outcome of an American presidential election.
Several users assume the roles of competitive candidates and inflict the repercussions of certain decisions on a GSS-based dataset.
The application is written in Java and supports all operating systems with a Java 1.5 VM.
Main features:
- Time is not the only limiting variable. In fact, time may not be the proper limit as most operations may be performed in tandem; an economic system that allows fund raising elements should be implemented.
- The current choices all utilize the same dataset algorithm to effect the populace in similar ways- this set of scripts should be broadened and deepened as they are too high level.
- The Python Architecture needs polishing- the internal IDE is not complete, and the ability to assign scripts to run at differing points in the lifetime of the application has yet to be created.
- The installer should place links on the desktops of Mac and Unix/Linux Systems.
- Some of the small features planned, such as a GUI for dialog creation, have been cut for the deadline and should be added.