Free states of matter software for linux

Grey Matter is a CGI-based logging application suitable for a variety of purposes, mainly blogging. The project doesnt require a backend database and features a very flexible template system, as well as a karma and comment system.
Enhancements:
- Continuing code refactoring, with small admin UI enhancements such as paging on very long screens.
- Contains security enhancements and bugfixes as well.

State Threads project is a small library for designing scalable Internet applications.
The State Threads is a small application library which provides a foundation for writing fast and highly scalable Internet applications (such as Web servers, proxy servers, mail transfer agents, etc.) on UNIX-like platforms.
It offers a threading API for structuring a network application as an event-driven state machine.
The State Threads library is a derivative of the Netscape Portable Runtime library (NSPR) and therefore is distributed under the Mozilla Public License (MPL) version 1.1 or the GNU General Public License (GPL) version 2 or later.
Enhancements:
- Added support for kqueue and epoll on platforms that support them.
- Added ability to choose the event notification system at program startup.
- Long-overdue public definitions of ST_UTIME_NO_TIMEOUT (-1ULL) and ST_UTIME_NO_WAIT (0) [bug 1514436].
- Documentation patch for st_utime() [bug 1514484].
- Documentation patch for st_timecache_set() [bug 1514486].
- Documentation patch for st_netfd_serialize_accept() [bug 1514494].
- Added st_writev_resid() [rfe 1538344].
- Added st_readv_resid() [rfe 1538768] and, for symmetry, st_readv().

UML::State is an object oriented module which draws simple state diagrams.

SYNOPSIS

use UML::State;

my $diagram = UML::State->new(
$node_array,
$start_list,
$accept_list,
$edges
);

# You may change these defaults (doing so may even work):
$UML::State::ROW_SPACING = 75; # all numbers are in pixels
$UML::State::LEFT_MARGIN = 20;
$UML::State::WIDTH = 800;
$UML::State::HEIGHT = 800;

print $diagram->draw();

ABSTRACT

Are you tired of pointing and clicking to make simple diagrams? Do your wrists hurt thinking about making the pretty UML your boss likes so well? Consider using UML::State and UML::Sequence to make your life easier.

UML::State together with drawstate.pl allows you to easily generate state diagrams. You enter them in something like a cross between ASCII art and school room algebra. They come out looking like something from a drawing program like Visio. See drawstate.pl in the distribution for details about the input format and the samples directory for some examples of input and output.

You will probably use this class by running drawstate.pl or drawstatexml.pl which are included in the distribution. But you can use this package directly to gain control over the appearance of your pictures.

The two methods you need are new and draw (see below). If you want, you may change the dimensions by setting the package global variables as shown in the SYNOPSIS. Obviously, no error checking is done, so be careful to use reasonable values (positive numbers are good). All numbers are in pixels (sorry by Beziers in SVG seem to require pixels). I have not tried changing the numbers, so I dont have any idea if doing so makes reasonable changes to the output.

GFA Fractal Imager project is a imager which uses a simple visual construction mechanism.
Generalized Finite Automata (GFA) Imager is a simple Java Applet which creates fractal images using an intuitive visual representation of finite automata
Try clicking in the applet area to the right :
You may create links between quadrants and "states" by click-dragging from a quadrant to the state
Self-links between a quadrant and the state it belongs to is allowed (try self-linking all 4 quadrants of a state)
Enhancements:
- This contains the HTML and the applet class files to run stand alone.

Drake CMS is a lightweight, fast, and feature-rich content management system. The project allows you to have a dynamic Web site in place in a matter of minutes and features user hierarchy, support for almost any database (plus an embedded flatfile), multiple languages, compliance to W3C standards, and high customizability.
Enhancements:
- This is a stabilization release which contains many bugfixes and improvements.

FSA::Rules is a Perl module to build simple rules-based state machines in Perl.

Synopsis

my $fsa = FSA::Rules->new(
ping => {
do => sub {
print "ping!n";
my $state = shift;
$state->result(pong);
$state->machine->{count}++;
},
rules => [
game_over => sub { shift->machine->{count} >= 20 },
pong => sub { shift->result eq pong },
],
},

pong => {
do => sub { print "pong!n" },
rules => [ ping => 1, ], # always goes back to ping
},
game_over => { do => sub { print "Game Overn" } }
);

$fsa->start;
$fsa->switch until $fsa->at(game_over);

This class implements a simple state machine pattern, allowing you to quickly build rules-based state machines in Perl. As a simple implementation of a powerful concept, it differs slightly from an ideal DFA model in that it does not enforce a single possible switch from one state to another. Rather, it short circuits the evaluation of the rules for such switches, so that the first rule to return a true value will trigger its switch and no other switch rules will be checked. (But see the strict attribute and parameter to new().) It differs from an NFA model in that it offers no back-tracking. But in truth, you can use it to build a state machine that adheres to either model--hence the more generic FSA moniker.

FSA::Rules uses named states so that its easy to tell what state youre in and what state you want to go to. Each state may optionally define actions that are triggered upon entering the state, after entering the state, and upon exiting the state. They may also define rules for switching to other states, and these rules may specify the execution of switch-specific actions. All actions are defined in terms of anonymous subroutines that should expect an FSA::State object itself to be passed as the sole argument.

FSA::Rules objects and the FSA::State objects that make them up are all implemented as empty hash references. This design allows the action subroutines to use the FSA::State object passed as the sole argument, as well as the FSA::Rules object available via its machine() method, to stash data for other states to access, without the possibility of interfering with the state or the state machine itself.

Concurrent Hierarchical State Machine (CHSM) is a language system for specifying concurrent, hierarchical, finite state machines (an implementation of "statecharts") to model and control reactive systems.
CHSM uses its own statechart specification langauge annotated with either C++ or Java code fragments in the tradition of yacc grammars with C code fragments. The generated code is fully object oriented allowing multiple state machines to exist concurrently. The CHSM run-time library is small, efficient, and thread-safe.
CHSM has been used successfullly in production environments such as CERN, Philips, and Qualcomm. There is an independent review from users at CERN.
Enhancements:
- The "dominance" rule has been extended from parent/child transitions to sibling transitions.
- This allows "if-else" transitions to be done more efficiently.

SpanishTrans provides a a very simple, complete, fast and clean dictionary, which allows you to translate English to Spanish.

This is a very simple, complete, fast and clean dictionary, which allows you to highlight an English word in the page that youre reading and get immediately the Spanish translation.

No matter if the selected word is a plural, conjugated verb, etc., the translator realizes about the right word showing you its meaning.