Free arthritis more condition treatment software for linux

Arguvision project is an enterprise class video surveillance system.
Arguvision is based on a distributed Linux or Unix cluster architecture, with up to 1000 cameras per single cluster with aggregation capability and instant access to recorded or live video.
Main features:
- Up to 1000 video channels per cluster - unlimited clusters
- 6 channels at 720x480 at 30 frames/sec per video grabber unit
- NTSC or PAL video input
- M-JPEG compression 1:15
- 1TB of storage for 10 days per camera at full resolution in high motion area
- Export video using AVI format , or single images using JPEG format
- Real-time view from any camera using client software
- Secure authenticated user access (SSL) based on user role
- Instant browse and archive search by date/time or alarm condition
- Alarm event notification by e-mail or pager
- Record on pre-programmed schedule, or on alarming condition
- Alarm events generated on motion, on video loss, or by activation of an external sensor
- NTP synchronization with time standards (like US Governments NIST)
- Data storage on internal/external network devices managed by SQL RDBMS
- RDBMS capacity monitoring
- Purge obsolete video data automatically

CSS::SAC::ConditionFactory Perl module contains the default ConditionFactory.

SYNOPSIS

my $cf = CSS::SAC::ConditionFactory->new;
my $cond1 = $cf->create_foo_condition;
my $cond2 = $cf->create_bar_condition;

This is the default ConditionFactory for CSS::SAC. It creates conditions of all types defined in SAC. You may wish to subclass or replace the default ConditionFactory in order to get your own condition objects.

I plan on adding more flexibility to this factory so that one could tell it the classes to use for various conditions, that would avoid enforcing subclassing/recoding for people that only want to replace a family of factory methods.

I know that some of the method names are quite lengthy, but given the great number of possible conditions it helps to have descriptive names.

METHODS

These define the interface that must be adhered to by ConditionFactories. The Java names (given in parens) work too, though the Perl ones are recommended.

CSS::SAC::ConditionFactory->new or $cf->new
Creates a new condition factory object.
$cf->create_and_condition($first,$second) (createAndCondition)
creates a combinator condition of type and
$cf->create_attribute_condition($lname,$ns,$specified,$value) (createAttributeCondition)
creates an attr condition
$cf->create_begin_hyphen_attribute_condition($lname,$ns,$specified,$value) (createBeginHyphenAttributeCondition)
creates a attr condition of type bh
$cf->create_class_condition($ns,$value) (createClassCondition)
creates a attr condition of type class
$cf->create_content_condition($data) (createContentCondition)
creates a content condition
$cf->create_id_condition($value) (createIdCondition)
creates a attr condition of type id
$cf->create_lang_condition($lang) (createLangCondition)
creates a lang condition
$cf->create_negative_condition($cond) (createNegativeCondition)
creates a negative condition
$cf->create_one_of_attribute_condition($lname,$ns,$specified,$value) (createOneOfAttributeCondition)
creates a attr condition of type id
$cf->create_only_child_condition() (createOnlyChildCondition)
creates a only-child condition
$cf->create_only_type_condition() (createOnlyTypeCondition)
creates a only-type condition
$cf->create_or_condition($first,$second) (createOrCondition)
creates a combinator condition of type or
$cf->create_positional_condition($position,$type_node,$same_type) (createPositionalCondition)
creates a positional condition
$cf->create_pseudo_class_condition($ns,$value) (createPseudoClassCondition)
creates a attr condition of type pseudo class

SirBot Project provides an easy way to build, program, control, and monitor amateur robots. Programming a bot is done writing a Python class. A declaration protocol syntax is used to define what can be done (primitive/complex actions). Using a Python CLI, the robot can be interactively controlled and dynamically programmed.
While the bot is performing several actions, every piece of information is able to produce events, thanks to the event declaration syntax. Events can also be created from other events (cascading events), conditionnaly triggered under specific conditions (pre-condition), and activate user-defined actions (post-conditions) according to a particular event state. The library provides detailed instructions to build electronic boards (PIC-based) and connect them to build a robot.
Easy way to build the bot
The SirBot Project provides every instructions to build a bot. A main board provides the basic features such as communication capabilities and implementation of a defined protocol. Several module can be plugged into this main board to provide extra feature such as, currently, a servo controller, IR distance ranger. Have a look on the SirBot Module Library to see current available modules/features. Also have a look at the SirBot Labs, where you can find examples of robots built with SirBot.
Easy way to program the bot
SirBot is python-based, your robot is just an object Protocol. Thanks to the power of python and its librairies, performing complex actions is (almost) trivial. No C++ here... just a protocol declaration syntax, easy to use.
Easy way to control the bot
Because SirBot is python-based, you can access your bot with a python CLI, such as ipython, and interactively control and program your bot. Soon, a graphical interface will allow to visually control your robot.
Easy way to monitor the bots actions
While the bot performs several actions, every piece of information is able to produce events, thanks to the event declaration syntax. Events can also be created from other events (cascading events), conditionnaly triggered under specific conditions (pre-condition), and activate user-defined actions (post-conditions) according to a particular event state.
Enhancements:
- Either the robot or PC can initiate the communication (Master/Slave vs. Peer-to-Peer mode).
- Recurrent tasks can be defined as background jobs (polling the bot, etc.).
- There is a dedicated Web site, documentation, and many fixes in Jal libraries.

AI::Prolog::Introduction Perl module contains the what and the why of logic programming.

You can skip this if you already know logic programming.

Note that most of this was pulled from my write-up about logic programming in Perl at http://www.perlmonks.org/?node_id=424075.

In Perl, generally you can append one list to another with this:

my @Z = (@X, @Y);

However, thats telling the language what to do. As sentient beings, we can look at that and infer more information. Given @Z and @X, we could infer @Y. Given just @Z, we could infer all combinations of @X and @Y that can be combined to form @Z.

Perl cannot do that. In logic programming, however, by defining what append() looks like, we get all of that other information.

In Prolog, it looks like this:

append([], X, X).
append([W|X],Y,[W|Z]) :- append(X,Y,Z).

(Theres actually often something called a "cut" after the first definition, but well keep this simple.)

What the above code says is "appending an empty list to a non-empty list yields the non-empty list." This is a boundary condition. Logic programs frequently require a careful analysis of boundary conditions to avoid infinite loops (similar to how recursive functions in Perl generally should have a terminating condition defined in them.)

The second line is where the bulk of the work gets done. In Prolog, to identify the head (first element) of a list and its tail (all elements except the first), we use the syntax [head|tail]. Since ":-" is read as "if" in Prolog, what this says if we want to concatenate (a,b,c) and (d,e,f):

Given a list with a head of W and a tail of X:

@list1 = qw/a b c/; (qw/a/ is W, the head, and qw/b c/ is X, the tail)

If its appended to list Y:

@Y = qw/d e f/;

We get a list with a head of W and a tail of Z:

@list2 = qw/a b c d e f/;

Only if X appended to Y forms Z:

X is qw/b c/. Y is qw/d e f/. Z is qw/b c d e f/.

mod_tee serves to "clone" an document as it is served. mod_tee was hacked up as a quick-and-dirty fix when a Site Valet user complained of problems saving a Valet report: mod_tee now serves to enable registered users to request email copies of any report generated.

The current status is "works for us", but it is not of release quality. It is less-than-complete in several respects. Its probably not a good idea to use it operationally unless youre prepared to get your hands dirty fixing any problems, or pay for support.

Configuration

TeeType FILE|PIPE|SMTP [Destination]
Where to send the cloned output:

FILE - save to a destination file. For testing only!
PIPE - pipes output to a destination program with popen.
SMTP - sends cloned output directly to email at a destination mailserver. Implements SMTP handshake with no error checking - so its a dangerous option!

TeeCondition query|cookie|path|header|env|true|false [key] [val]

Defines a condition for mod_tee to be activated for a request. Values true and false are unconditional, while the others define a QUERY_STRING key, a Cookie, a PATH_INFO component, a request header or an environment variable to trigger the tee. Conditional values require a key. If val is defined then key must match it; otherwise any value of key will activate the tee.

TeeHeader key value

Defines an RFC822-style header to be inserted in front of the body of the page.

Cooperative Linux is the first working free and open source method for optimally running Linux on Microsoft Windows natively.

More generally, Cooperative Linux (short-named coLinux) is a port of the Linux kernel that allows it to run cooperatively alongside another operating system on a single machine.

For instance, it allows one to freely run Linux on Windows 2000/XP, without using a commercial PC virtualization software such as VMware, in a way which is much more optimal than using any general purpose PC virtualization software.

In its current condition, it allows us to run the KNOPPIX Japanese Edition on Windows.

Test::Version is a Perl module that has the role to check for VERSION information in modules.

SYNOPSIS

use Test::Version;
plan tests => $num_tests;
version_ok( $file );

FUNCTIONS

version_ok( FILENAME, [EXPECTED, [NAME] ] )
version_ok requires a filename and returns one of the three values:

NO_FILE Could not find the file
NO_VERSION File had no VERSION information
VERSION_OK VERSION information exists

version_ok okays a test without an expected result if it finds VERSION information, or if an expected result is specified and it finds that condition. For instance, if you know there is no VERSION information,

version_ok( $file, NO_VERSION );

When it fails, version_ok will show error information.

The optional third argument NAME is the name of the test which version_ok passes through to Test::Builder. Otherwise, it choose a default test name "VERSION test for FILENAME".

Parse::RandGen::Regexp is a Perl module for regular expression Condition element.

Regexp is a Condition element that matches the given compiled regular expression. For picking random data, the regular expression is parsed into its component Subrules, Literals, CharClasses, etc.... Therefore, the pick functionality for a regular expression is ultimately the same as the pick functionality of a Rule (including the limitations w/r to greediness - see Rule).

Regexp is also useful as a standalone class. It supports captures (named and indexed), which can be referenced in a call to the pick() function to force the captures to match the specified data, while leaving the rest of the data to be generated randomly.

METHODS

new

Creates a new Regexp. The first argument (required) is the regular expression element (e.g. qr/foo(bar|baz)+d{1,10}/). All other arguments are named pairs.

element

Returns the Regexp element (i.e. the compiled regular expression itself).

numCaptures

Returns the number of captures (e.g. $1, $2, ...$n) in the regular expression.

nameCapture

Give names to capture numbers for the regular expression. The arguments to this function are capture# => "name" pairs (e.g. nameCapture(1=>"directory", 2=>"file", 3=>"extension")).

capture

Returns the Rule object that represents the specified capture. The capture can be specified by number or by name (the name is set by the nameCapture() function).

pick

Randomly generate data (text) that matches (or does not) this regular expression.
Takes a "match" boolean argument that specifies whether to match the regular expression or deliberately not match it.

Also takes a "captures" hash argument that has pairs of capture numbers (or names) and their desired value. This allows the generated data to have user-specified constraints while allowing the rest of the regular expression to choose random data. If "match" is false, the user-specified "captures" values are still used (which may cause the data to match even though it was not supposed to).

Example:
$re->pick(match=>1,
captures=>{ 1=>"http", 2=>"www", 3=>"yahoo", 4=>"com" });