Free wa. software for linux

Minnow is a Web-based PDF discussion engine for discussing and annotating documents in an online, multi-user environment.
Minnow was developed by the Mathematical Biology group at the Northwest Fisheries Science Center in Seattle, WA with support by NOAA/NMFS.
Enhancements:
- This release includes some major updates such as full-text extraction from PDFs, edit-in-place support for editing titles and descriptions of documents after theyve been imported, a progress meter for converting large PDFs to images, and user-level access control, allowing you to specify which users can view a document.

Secure Messaging is a Web-based, alternative mail system for sending and receiving messages.

Use secure messaging to send and receive messages from a alternative web-based mail system. Using the secure messaging system no actual mail is transmitted through any 3rd party servers.

Only an optional message notice is sent to the recepient, the user needs to visit the site in order to read the message.

Normal SMTP mail can hit multiple servers and can possibly be read, stored, or changed anywhere within the process.

Setup secure messaging on an SSL enabled website to enhance the privacy even more.

ICS::Simple is a simple interface to CyberSource ICS2.

SYNOPSIS

Here is some basic code. Hopefully Ill come back through soon to document it properly.

use ICS::Simple;

my $ics = ICS::Simple->new(
ICSPath => /opt/ics,
MerchantId => v0123456789, # CyberSource supplies this number to you
Mode => test,
Currency => USD,
Grammar => UpperCamel, # defaults to raw ICS responses, so you might want to set this
#ErrorsTo => all-errors@some.fun.place.com,
CriticalErrorsTo => only-critical-errors@some.fun.place.com,
);

my $request = {
OrderId => order19857219,
FirstName => Fred,
LastName => Smith,
Email => fred.smith@buyer-of-stuff.com,
CardNumber => 4111111111111111,
CardCVV => 123,
CardExpYear => 2008,
CardExpMonth => 12,
BillingAddress => 123 Main St,
BillingCity => Olympia,
BillingRegion => WA,
BillingPostalCode => 98501,
BillingCountryCode => US,
ShippingAddress1 => 6789 Industrial Pl,
ShippingAddress2 => Floor 83, Room 11415,
ShippingCity => Olympia,
ShippingRegion => WA,
ShippingPostalCode => 98506,
ShippingCountryCode => US,
ShippingFee => 25.05,
HandlingFee => 5.00,
Items => [
{ Description => Mega Lizard Monster RC,
Price => 25.00,
SKU => prod15185 },
{ Description => Super Racer Parts Kit,
Price => 15.30,
SKU => prod23523 },
{ Description => Uber Space Jacket,
Price => 72.24,
SKU => prod18718 },
],
};

my $response = $ics->requestBill($request);

if ($response->{success}) {
print "Woo! Success!n";
$response = $response->{response};
print "Thanks for your payment of $$response->{BillAmount}.n";
}
else {
print "Boo! Failure!n";
print "Error: $response->{error}->{description}n";
}

Hegons project is a HEterogeneous Grooming Optical Network Simulator that supports mixed routing and wavelength assignment algorithms and optional wavelength conversions capability on each node.
The goal of Hegons is the evaluation of different dynamic routing and wavelength assignment (RWA) algorithms in WDM optical networks in terms of several measures such as: call blocking probability, fairness (variance in blocking probability), call setup time, etc.
Main features:
- Supports practically unlimited number of nodes in a network. (2 billion)
- Supports practically unlimited number of wavelengths per link. (2 billion)
- Typically, can simulate more than 18 million calls per minute on a 2Ghz PC.
- Currently Supports 3 types of nodes (OXCs):
1. Non Grooming node
2. Single-Hop Grooming node
3. Multi-Hop Full Grooming node
Each node can optionally be a wavelength converter node.
4 wavelength assignments (WA) algorithms:
1. First Fit (FF)
2. Random (R)
3. Most Used (MU)
4. Least Used (LU)
- Fixed Alternate Routing (FAR) is supported with 4 different ordering algorithms: FF, R, MU, LU
- Shortest Path Routing (SPR) can be supported by using -mp:1 option.
- Call arrivals follow the poisson distribution.
- Can run multiple batches (separate simulation runs) automatically and find the average results of all batches.
- Three different methods to calculate the blocking probability. Can be controlled by modifying the BP_METHOD compiler directive.
- Average number of attempts for each call can be limited using the -at option.
- Maximum and minimum path length can be controlled.
- Maximum number of paths generated for each source to destination pair can be controlled
- Network description can be loaded from a file or can be feeded interactively by the user.
- Results can be saved to CSV (Comma Separated Values) files for easy batch running. CSV files can be then viewed in Excel and charts can be generated instantly.
Enhancements:
- A new "Multi-hop Partial Grooming" node type was added.
- A partial grooming node can now have multiple G-fabrics.
- This is a new concept that has never been discussed in the literature.
- The RWA method chosen will be applied internally in the nodes between W and G fabrics as well as externally.
- -px and -pn options were added for controlling the max/min number of times G-fabric switchings are done per call.
- Other minor fixes and changes were made.