price comparisons
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 315
Bio::SAGE::Comparison 1.00
Bio::SAGE::Comparison module compares data from serial analysis of gene expression (SAGE) libraries. more>>
Bio::SAGE::Comparison module compares data from serial analysis of gene expression (SAGE) libraries.
SYNOPSIS
use Bio::SAGE::Comparison;
$sage = Bio::SAGE::Comparison->new();
This module provides several tools for comparing data generated from serial analysis of gene expression (SAGE) libraries.
BACKGROUND
Serial analysis of gene expression (SAGE) is a molecular technique for generating a near-global snapshot of a cell population’s transcriptome. Briefly, the technique extracts short sequences at defined positions of transcribed mRNA. These short sequences are then paired to form ditags. The ditags are concatamerized to form long sequences that are then cloned. The cloned DNA is then sequenced. Bioinformatic techniques are then employed to determine the original short tag sequences, and to derive their progenitor mRNA. The number of times a particular tag is observed can be used to quantitate the amount of a particular transcript. The original technique was described by Velculescu et al. (1995) and utilized an ~14bp sequence tag. A modified protocol was introduced by Saha et al. (2002) that produced ~21bp tags.
PURPOSE
This module facilitates the comparison of SAGE libraries. Specifically:
1. Calculations for determining the statistical
significance of expression differences.
2. Dynamically convert longer-tag libraries to
a shorter type for comparison (e.g. comparing
a LongSAGE vs. a regular SAGE library).
Both regular SAGE (14mer tag) and LongSAGE (21mer tag) are supported by this module.
Statistical significance in library comparisons is calculated using the method described by Audic and Claverie (1997). Code was generated by directly porting the authors original C source.
<<lessSYNOPSIS
use Bio::SAGE::Comparison;
$sage = Bio::SAGE::Comparison->new();
This module provides several tools for comparing data generated from serial analysis of gene expression (SAGE) libraries.
BACKGROUND
Serial analysis of gene expression (SAGE) is a molecular technique for generating a near-global snapshot of a cell population’s transcriptome. Briefly, the technique extracts short sequences at defined positions of transcribed mRNA. These short sequences are then paired to form ditags. The ditags are concatamerized to form long sequences that are then cloned. The cloned DNA is then sequenced. Bioinformatic techniques are then employed to determine the original short tag sequences, and to derive their progenitor mRNA. The number of times a particular tag is observed can be used to quantitate the amount of a particular transcript. The original technique was described by Velculescu et al. (1995) and utilized an ~14bp sequence tag. A modified protocol was introduced by Saha et al. (2002) that produced ~21bp tags.
PURPOSE
This module facilitates the comparison of SAGE libraries. Specifically:
1. Calculations for determining the statistical
significance of expression differences.
2. Dynamically convert longer-tag libraries to
a shorter type for comparison (e.g. comparing
a LongSAGE vs. a regular SAGE library).
Both regular SAGE (14mer tag) and LongSAGE (21mer tag) are supported by this module.
Statistical significance in library comparisons is calculated using the method described by Audic and Claverie (1997). Code was generated by directly porting the authors original C source.
Download (0.008MB)
Added: 2007-07-14 License: Perl Artistic License Price:
832 downloads
Kernel Configuration Comparison 0.2
Kernel Configuration Comparison (kccmp) provides a GUI for comparing two Linux kernel .config files. more>>
Kernel Configuration Comparison (kccmp) provides a GUI for comparing two Linux kernel ".config" files.
It shows configuration variables with different values in a tabular format. It also shows configuration variables found in only one of the input configuration files.
Building:
kccmp by default requires Qt 3.x. However, by changing one line in kccmp.pro you can build against Qt 4.x. Note that the Qt 4.x build requilres libboost_regex as well.
The standard build is as easy as:
example:
% qmake
% make
Usage
% kccmp /path/to/first/.config path/to/second/.config
example:
% kccmp /usr/src/linux/.config /usr/src/linux/.config.old
Enhancements:
- This release was ported to Qt 3.x.
- The requirement for libboost_regex was removed.
- Building with either Qt 4.x or Qt 3.x is now supported.
<<lessIt shows configuration variables with different values in a tabular format. It also shows configuration variables found in only one of the input configuration files.
Building:
kccmp by default requires Qt 3.x. However, by changing one line in kccmp.pro you can build against Qt 4.x. Note that the Qt 4.x build requilres libboost_regex as well.
The standard build is as easy as:
example:
% qmake
% make
Usage
% kccmp /path/to/first/.config path/to/second/.config
example:
% kccmp /usr/src/linux/.config /usr/src/linux/.config.old
Enhancements:
- This release was ported to Qt 3.x.
- The requirement for libboost_regex was removed.
- Building with either Qt 4.x or Qt 3.x is now supported.
Download (0.012MB)
Added: 2005-10-03 License: GPL (GNU General Public License) Price:
1482 downloads
Schema-compare 0.2
Schema-compare is a script that will compares two database schema and show the differences side-by-side. more>>
Schema-compare is a script that will compares two database schema and show the differences side-by-side.
Schema-compare can also generate SQL statements that will alter the old database to match the schema of the new database.
The comparisons are correct, but the SQL statements at the bottom are not quite right, they are close to what is necessary, but probably not exactly right.
To install simply ungzip/untar the file wherever you want to put it in your web folder and then edit the include/config.inc.php file with the information needed to connect to the two databases you want to compare. Both databases need to be on the same database server and use the same username and password to connect to them.
Enhancements:
- This is the first release of schema-compare. It compares the database schema just fine, but the sql alter statements it creates could use some work.
<<lessSchema-compare can also generate SQL statements that will alter the old database to match the schema of the new database.
The comparisons are correct, but the SQL statements at the bottom are not quite right, they are close to what is necessary, but probably not exactly right.
To install simply ungzip/untar the file wherever you want to put it in your web folder and then edit the include/config.inc.php file with the information needed to connect to the two databases you want to compare. Both databases need to be on the same database server and use the same username and password to connect to them.
Enhancements:
- This is the first release of schema-compare. It compares the database schema just fine, but the sql alter statements it creates could use some work.
Download (0.41MB)
Added: 2006-03-07 License: BSD License Price:
1329 downloads
PRICE 0.8.1
PRICE can open several image file formats and apply high-quality filters and other enhancements. more>>
PRICE can open several image file formats and apply high-quality filters and other enhancements. PRICE was written to support the authors research in image processing.
PRICE was born to support my research in image processing. So I have decided to work on a usable application that can open several file formats and apply high quality filters and other enhancements to the image.
<<lessPRICE was born to support my research in image processing. So I have decided to work on a usable application that can open several file formats and apply high quality filters and other enhancements to the image.
Download (0.15MB)
Added: 2006-11-05 License: GPL (GNU General Public License) Price:
1089 downloads
Debt Payment Comparison Calculator 1.18
Debt Payment Comparison Calculator is a free, flexible tool for your Web site that does more than just calculate monthly payment more>>
Debt Payment Comparison Calculator project is a free, flexible tool for your Web site that does more than just calculate monthly payments.
In addition to what typical Web calculators do, which is grab the principle, interest rate, and the years to pay it off to generate your monthly payment, this calculator can tell you how long it would take you to pay off a debt if you increased or decreased the payment amount.
Each time the user uses the calculator, it saves the information so that the user can compare different payment scenarios. At any time, the user can clear the data and start over. They can also color-group different scenarios for easy visual reference.
Main features:
- Stores calculations in a session variable, so users can compare different payment scenarios, side by side without the use of a database.
- Ability to color-code the scenarios by clicking on them, making it easy to visually sort the results
- Works fine without Javascript enabled
- Simple code to work with, easy to adjust to specific needs
- Styles and scripts are already in external files, making the web page search engine ready out of the box!
<<lessIn addition to what typical Web calculators do, which is grab the principle, interest rate, and the years to pay it off to generate your monthly payment, this calculator can tell you how long it would take you to pay off a debt if you increased or decreased the payment amount.
Each time the user uses the calculator, it saves the information so that the user can compare different payment scenarios. At any time, the user can clear the data and start over. They can also color-group different scenarios for easy visual reference.
Main features:
- Stores calculations in a session variable, so users can compare different payment scenarios, side by side without the use of a database.
- Ability to color-code the scenarios by clicking on them, making it easy to visually sort the results
- Works fine without Javascript enabled
- Simple code to work with, easy to adjust to specific needs
- Styles and scripts are already in external files, making the web page search engine ready out of the box!
Download (0.025MB)
Added: 2005-12-15 License: Freeware Price:
1410 downloads
Webforce Cart 1.6
Webforce Cart (wfCart) is a free PHP shopping cart class you can use a component of a PHP based online store. more>>
Webforce Cart (wfCart) is a free PHP shopping cart class you can use a component of a PHP based online store. Its designed as a component for PHP developers who would rather write their own store rather than a complete solution.
Instructions and examples for the free PHP Shopping Cart
To use the cart in an existing script:
Rename wfcart.php.txt to wfcart.php and upload to your server.
Then include the file:
include("wfcart.php");
Start the session, and assign the cart to it. NOTE: You must include the file wfcart.php before you start the session, its just the way PHP works.
session_start();
$cart =& $_SESSION[cart];
if(!is_object($cart)) $cart = new wfCart();
Then you can use the functions like $cart->get_contents();, these functions are documented below.
Adding an Item - $cart->add_item( code , quantity , price , info )
If you have a widget with code AB313 and a price of $40.11, you can add it to the cart with :
$cart->add_item(AB313,1,40.11,Widget AB313 Standard);
If the item AB313 is alreay in the cart, then the quantity of it will be increased by the quantity supplied to the function, in this case 1. The itemid must be unique, and can be letters and/or numbers.
Deleting an Item - $cart->del_item( itemid );
E.g. to delete the item ID 123
$cart->del_item(123);
Changing the quantity of an item -
$cart->edit_item( itemid, new_quantity );
For example :
$cart->edit_item(HA2,3);
If you set the quanitity to zero, the item is deleted.
Getting the number of items in a cart
echo $cart->itemcount;
Getting the total value of the cart.
echo $cart->total;
Emptying the cart
$cart->empty_cart();
Getting the cart contents
$items = $cart->get_contents();
$items is an array, so the following code displays the items.
foreach($items as $item) {
echo "Code/ID :".$item[id]."
";
echo "Quantity:".$item[qty]."
";
echo "Price :".$item[price]."
";
echo "Info :".$item[info]."
";
echo "Subtotal".$item[subtotal]."
";
}
Note, subtotal is quantity X price for that item, not a running total..
Extending Webforce Cart
There are 2 functions you can create that will enable more flexability.
One is wf_get_price( itemid, qty ). If you need to do pricing based on Quantity ( e.g. bulk discounts ) then you can create a function called wf_get_price to do what you need itto do. If you do not pass a price to add_item, then the wf_ get_price function will be called. If you use this functionality, AND your price is quantity dependant, then you must uncomment the line in the edit_item function.
The other is wf_get_info, again, if you do not pass info to add_item then get_info will be called. TIP: you do not have to pass a string to add_item(), you could use an array of infomation instead. e.g. add_item( AS2112,5,19.95,array(size=>large,color=>red)); then when you use get_contents, you echo $item[info][color] etc.
Enhancements:
- The empty cart function was fixed.
<<lessInstructions and examples for the free PHP Shopping Cart
To use the cart in an existing script:
Rename wfcart.php.txt to wfcart.php and upload to your server.
Then include the file:
include("wfcart.php");
Start the session, and assign the cart to it. NOTE: You must include the file wfcart.php before you start the session, its just the way PHP works.
session_start();
$cart =& $_SESSION[cart];
if(!is_object($cart)) $cart = new wfCart();
Then you can use the functions like $cart->get_contents();, these functions are documented below.
Adding an Item - $cart->add_item( code , quantity , price , info )
If you have a widget with code AB313 and a price of $40.11, you can add it to the cart with :
$cart->add_item(AB313,1,40.11,Widget AB313 Standard);
If the item AB313 is alreay in the cart, then the quantity of it will be increased by the quantity supplied to the function, in this case 1. The itemid must be unique, and can be letters and/or numbers.
Deleting an Item - $cart->del_item( itemid );
E.g. to delete the item ID 123
$cart->del_item(123);
Changing the quantity of an item -
$cart->edit_item( itemid, new_quantity );
For example :
$cart->edit_item(HA2,3);
If you set the quanitity to zero, the item is deleted.
Getting the number of items in a cart
echo $cart->itemcount;
Getting the total value of the cart.
echo $cart->total;
Emptying the cart
$cart->empty_cart();
Getting the cart contents
$items = $cart->get_contents();
$items is an array, so the following code displays the items.
foreach($items as $item) {
echo "Code/ID :".$item[id]."
";
echo "Quantity:".$item[qty]."
";
echo "Price :".$item[price]."
";
echo "Info :".$item[info]."
";
echo "Subtotal".$item[subtotal]."
";
}
Note, subtotal is quantity X price for that item, not a running total..
Extending Webforce Cart
There are 2 functions you can create that will enable more flexability.
One is wf_get_price( itemid, qty ). If you need to do pricing based on Quantity ( e.g. bulk discounts ) then you can create a function called wf_get_price to do what you need itto do. If you do not pass a price to add_item, then the wf_ get_price function will be called. If you use this functionality, AND your price is quantity dependant, then you must uncomment the line in the edit_item function.
The other is wf_get_info, again, if you do not pass info to add_item then get_info will be called. TIP: you do not have to pass a string to add_item(), you could use an array of infomation instead. e.g. add_item( AS2112,5,19.95,array(size=>large,color=>red)); then when you use get_contents, you echo $item[info][color] etc.
Enhancements:
- The empty cart function was fixed.
Download (0.003MB)
Added: 2007-04-06 License: LGPL (GNU Lesser General Public License) Price:
933 downloads
Array::Compare 1.14
Array::Compare is a Perl extension for comparing arrays. more>>
SYNOPSIS
use Array::Compare;
my $comp1 = Array::Compare->new;
$comp->Sep(|);
$comp->Skip({3 => 1, 4 => 1});
$comp->WhiteSpace(0);
$comp->Case(1);
my $comp2 = Array::Compare->new(Sep => |,
WhiteSpace => 0,
Case => 1,
Skip => {3 => 1, 4 => 1});
my @arr1 = 0 .. 10;
my @arr2 = 0 .. 10;
$comp1->compare(@arr1, @arr2);
$comp2->compare(@arr1, @arr2);
If you have two arrays and you want to know if they are the same or different, then Array::Compare will be useful to you.
All comparisons are carried out via a comparator object. In the simplest usage, you can create and use a comparator object like this:
my @arr1 = 0 .. 10;
my @arr2 = 0 .. 10;
my $comp = Array::Compare->new;
if ($comp->compare(@arr1, @arr2)) {
print "Arrays are the samen";
} else {
print "Arrays are differentn";
}
Notice that you pass references to the two arrays to the comparison method.
Internally the comparator compares the two arrays by using join to turn both arrays into strings and comparing the strings using eq. In the joined strings, the elements of the original arrays are separated with the ^G character. This can cause problems if your array data contains ^G characters as it is possible that two different arrays can be converted to the same string.
To avoid this, it is possible to override the default separator character, either by passing and alternative to the new function
my $comp = Array::Compare->new(Sep => |);
or by changing the seperator for an existing comparator object
$comp->Sep(|);
In general you should choose a separator character that wont appear in your data.
You can also control whether or not whitespace within the elements of the arrays should be considered significant when making the comparison. The default is that all whitespace is significant. The alternative is for all consecutive white space characters to be converted to a single space for the pruposes of the comparison. Again, this can be turned on when creating a comparator object:
my $comp = Array::Compare->new(WhiteSpace => 0);
or by altering an existing object:
$comp->WhiteSpace(0);
You can also control whether or not the case of the data is significant in the comparison. The default is that the case of data is taken into account. This can be changed in the standard ways when creating a new comparator object:
my $comp = Array::Compare->new(Case => 0);
or by altering an existing object:
$comp->Case(0);
In addition to the simple comparison described above (which returns true if the arrays are the same and false if theyre different) there is also a full comparison which returns a list containing the indexes of elements which differ between the two arrays. If the arrays are the same it returns an empty list. In scalar context the full comparison returns the length of this list (i.e. the number of elements that differ). You can access the full comparision in two ways. Firstly, there is a DefFull attribute. If this is true then a full comparison if carried out whenever the compare method is called.
my $comp = Array::Compare->new(DefFull => 1);
$comp->compare(@arr1, @arr2); # Full comparison
$comp->DefFull(0);
$comp->compare(@arr1, @arr2); # Simple comparison
$comp->DefFull(1);
$comp->compare(@arr1, @arr2); # Full comparison again
Secondly, you can access the full comparison method directly
$comp->full_compare(@arr1, @arr2);
For symmetry, there is also a direct method to use to call the simple comparison.
$comp->simple_compare(@arr1, @arr2);
The final complication is the ability to skip elements in the comparison. If you know that two arrays will always differ in a particular element but want to compare the arrays ignoring this element, you can do it with Array::Compare without taking array slices. To do this, a comparator object has an optional attribute called Skip which is a reference to a hash. The keys in this hash are the indexes of the array elements and the values should be any true value for elements that should be skipped.
For example, if you want to compare two arrays, ignoring the values in elements two and four, you can do something like this:
my %skip = (2 => 1, 4 => 1);
my @a = (0, 1, 2, 3, 4, 5);
my @b = (0, 1, X, 3, X, 5);
my $comp = Array::Compare->new(Skip => %skip);
$comp->compare(@a, @b);
This should return true, as we are explicitly ignoring the columns which differ.
Of course, having created a comparator object with no skip hash, it is possible to add one later:
$comp->Skip({1 => 1, 2 => 1});
or:
my %skip = (1 => 1, 2 => 2);
$comp->Skip(%skip);
To reset the comparator so that no longer skips elements, set the skip hash to an empty hash.
$comp->Skip({});
You can also check to see if one array is a permutation of another, i.e. they contain the same elements but in a different order.
if ($comp->perm(@a, @b) {
print "Arrays are permsn";
else {
print "Nope. Arrays are completely differentn";
}
In this case the values of WhiteSpace and Case are still used, but Skip is ignored for, hopefully, obvious reasons.
Download (0.008MB)
Added: 2007-08-15 License: Perl Artistic License Price:
800 downloads
Web Auction 0.2
Web Auction is a simple auction designed for organizations or individuals who want to hold an auction. more>>
Web Auction is a simple auction designed for organizations or individuals who want to hold an auction.
The project is unlike Ebay in the sense that only administrators can add products. Products can have pictures, price, minimum bids, bid increments, and more.
Enhancements:
- This release adds reverse auction mode so that the auction can be run in such a way that the lowest bidder wins.
<<lessThe project is unlike Ebay in the sense that only administrators can add products. Products can have pictures, price, minimum bids, bid increments, and more.
Enhancements:
- This release adds reverse auction mode so that the auction can be run in such a way that the lowest bidder wins.
Download (0.32MB)
Added: 2007-06-21 License: GPL (GNU General Public License) Price:
862 downloads
Charon 0.5
Charon aims to make it easy to start reselling Internet access via WiFi access point. more>>
Charon aims to make it easy to start reselling Internet access via WiFi access point.
Charon installs onto a Linksys WiFi access point (or similar Linux device) and manages automatic price and access negotiation with local wireless customers, charging them via the mikolaj.cx settlement/micropayment system.
It will ultimately provide secure and fraud-resistant access by utilizing cash-based settlement, reputation tracking, and PKI-based non-repudiable contracts, to protect both the end-user and the access provider.
Enhancements:
- Cash prepayment support: prospective users can now pay with either cash or a credit card, at the option of the provider.
- Funds are transferred direct into their mikolaj.cx account and can be used at any Charon hotspot.
- Real-time balance query and account transaction history for the provider are now available from the administrative Web pages.
- PayPals Akamaized IP addresses are now detected and added to the firewall at every upstream reconnect, which should make Charons credit card payments usable out of the box anywhere in the world.
<<lessCharon installs onto a Linksys WiFi access point (or similar Linux device) and manages automatic price and access negotiation with local wireless customers, charging them via the mikolaj.cx settlement/micropayment system.
It will ultimately provide secure and fraud-resistant access by utilizing cash-based settlement, reputation tracking, and PKI-based non-repudiable contracts, to protect both the end-user and the access provider.
Enhancements:
- Cash prepayment support: prospective users can now pay with either cash or a credit card, at the option of the provider.
- Funds are transferred direct into their mikolaj.cx account and can be used at any Charon hotspot.
- Real-time balance query and account transaction history for the provider are now available from the administrative Web pages.
- PayPals Akamaized IP addresses are now detected and added to the firewall at every upstream reconnect, which should make Charons credit card payments usable out of the box anywhere in the world.
Download (0.31MB)
Added: 2006-12-27 License: GPL (GNU General Public License) Price:
1034 downloads
DMAring 0.9
DMAring project is a novel generic network interface card driver architecture. more>>
DMAring project is a novel generic network interface card driver architecture which works in hybrid interrupt-polling mode to deliver superior real-time performance on Linux, Redhat Linux or Linux-RTAI-LXRT (a real-time co-kernel for Linux with user level extension).
Existing Linux drivers are inefficient, they saturate the CPU at a much lower packet rates than the maximum wire line packet rate that is possible. But with this driver, vanilla network cards can be used for high speed packet capturing. This driver improves the packet capturing speed by 7 to 10 times, and the real-time packet delivery response by 500 to 5000 times over existing drivers and alternate approaches (HIP, NAPI, pfring, check the references in the papers for performance comparisons [1, 2, 3]), depending on whether Redhat Linux or RTAI is used. Thus this obviates the need for expensive high capacity hardware, specialized network data acquisition cards and systems (for example from Endace).
This project contain basic source codes, which other developers can use/adapt for their applications, and three published conference papers [1, 2, 3] describes the architecture and establishes its benefits. One of the papers (at SANE 2006) also documents the detailed architecture and provides guidelines to modify any Linux network interface driver (Donald Becker style drivers).
Earlier I had received lot of mail request from networking, network security/monitoring domain people, to get these codes or modified specific network drivers. I am looking forward that some developer will take up this project, churn out driver modifications for the most common net work cards and share with others. I will continue to add other drivers, and libpcap library modifications when I get more time.
Anybody willing to know the issues involved in real-time Linux or looking for real-time networking solutions can take a look at my Masters thesis. I found RTAI with LXRT to be a very tractable, good performance, cheap (free!) real-time Linux option. My thesis contains some useful performance related discussions on this.
<<lessExisting Linux drivers are inefficient, they saturate the CPU at a much lower packet rates than the maximum wire line packet rate that is possible. But with this driver, vanilla network cards can be used for high speed packet capturing. This driver improves the packet capturing speed by 7 to 10 times, and the real-time packet delivery response by 500 to 5000 times over existing drivers and alternate approaches (HIP, NAPI, pfring, check the references in the papers for performance comparisons [1, 2, 3]), depending on whether Redhat Linux or RTAI is used. Thus this obviates the need for expensive high capacity hardware, specialized network data acquisition cards and systems (for example from Endace).
This project contain basic source codes, which other developers can use/adapt for their applications, and three published conference papers [1, 2, 3] describes the architecture and establishes its benefits. One of the papers (at SANE 2006) also documents the detailed architecture and provides guidelines to modify any Linux network interface driver (Donald Becker style drivers).
Earlier I had received lot of mail request from networking, network security/monitoring domain people, to get these codes or modified specific network drivers. I am looking forward that some developer will take up this project, churn out driver modifications for the most common net work cards and share with others. I will continue to add other drivers, and libpcap library modifications when I get more time.
Anybody willing to know the issues involved in real-time Linux or looking for real-time networking solutions can take a look at my Masters thesis. I found RTAI with LXRT to be a very tractable, good performance, cheap (free!) real-time Linux option. My thesis contains some useful performance related discussions on this.
Download (3.2MB)
Added: 2007-01-05 License: Perl Artistic License Price:
1023 downloads
MaCollec Collections Manager 0.1.2
MaCollec is a Web-based Collections Manager written in PHP/Javascript. more>>
MaCollec is a Web-based Collections Manager written in PHP/Javascript. MaCollec Collections Manager is based on the AJAX technology to produce a nice-looking and pleasant interface. It doesnt require a database.
Items informations (including covers pictures) are retrieved from online libraries.
MaCollec works correctly only with a modern browser (like Mozilla Firefox, Opera, ...) which supports all major Web standards currently in use, including CSS 2.1, HTML 4.01, ECMAScript, DOM 2 ...
Main features:
- Easy install
- No database
- Fetches items (Books, Films, Albums) informations from online libraries.
- Multi-users (each user has his own folder)
- 2 different views to display folders (list and icons)
- Unlimited number of folders/subfolders
- Allows items properties to be updated
- Allows saving additional properties: loaning (date, person), purchase (date, price), notes and rating
- Wikipedia links
<<lessItems informations (including covers pictures) are retrieved from online libraries.
MaCollec works correctly only with a modern browser (like Mozilla Firefox, Opera, ...) which supports all major Web standards currently in use, including CSS 2.1, HTML 4.01, ECMAScript, DOM 2 ...
Main features:
- Easy install
- No database
- Fetches items (Books, Films, Albums) informations from online libraries.
- Multi-users (each user has his own folder)
- 2 different views to display folders (list and icons)
- Unlimited number of folders/subfolders
- Allows items properties to be updated
- Allows saving additional properties: loaning (date, person), purchase (date, price), notes and rating
- Wikipedia links
Download (0.084MB)
Added: 2006-08-14 License: GPL (GNU General Public License) Price:
1166 downloads
Benchmark::Forking 0.99
Benchmark::Forking is a Perl module to run benchmarks in separate processes. more>>
Benchmark::Forking is a Perl module to run benchmarks in separate processes.
SYNOPSIS
use Benchmark::Forking qw( timethis timethese cmpthese );
timethis ($count, "code");
timethese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
cmpthese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
Benchmark::Forking->enabled(0); # Stop using forking feature
...
Benchmark::Forking->enabled(1); # Begin using forking again
The Benchmark::Forking module changes the behavior of the standard Benchmark module, running each piece of code to be timed in a separate forked process. Because each child exits after running its timing loop, the computations it performs cant propogate back to affect subsequent test cases.
This can make benchmark comparisons more accurate, because the separate test cases are mostly isolated from side-effects caused by the others. Benchmark scripts typically dont depend on those side-effects, so in most cases you can simply use or require this module at the top of your existing code without having to change anything else. (A few key exceptions are noted in "BUGS".)
<<lessSYNOPSIS
use Benchmark::Forking qw( timethis timethese cmpthese );
timethis ($count, "code");
timethese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
cmpthese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
Benchmark::Forking->enabled(0); # Stop using forking feature
...
Benchmark::Forking->enabled(1); # Begin using forking again
The Benchmark::Forking module changes the behavior of the standard Benchmark module, running each piece of code to be timed in a separate forked process. Because each child exits after running its timing loop, the computations it performs cant propogate back to affect subsequent test cases.
This can make benchmark comparisons more accurate, because the separate test cases are mostly isolated from side-effects caused by the others. Benchmark scripts typically dont depend on those side-effects, so in most cases you can simply use or require this module at the top of your existing code without having to change anything else. (A few key exceptions are noted in "BUGS".)
Download (0.006MB)
Added: 2007-04-30 License: Perl Artistic License Price:
907 downloads
XML-CompareML 0.2.0
XML::CompareML is a Perl module for managing multi-system and multi-item comparisons. more>>
The primary use of this module by its author was to manage the Better SCM comparison of version control systems.
The Perl versions can generate either HTML or DocBook/XML. (the latter can be converted into many other formats). Also available is an XSLT stylesheet for transforming the XML markup into HTML.
<<lessThe Perl versions can generate either HTML or DocBook/XML. (the latter can be converted into many other formats). Also available is an XSLT stylesheet for transforming the XML markup into HTML.
Download (0.017MB)
Added: 2007-03-20 License: Perl Artistic License Price:
948 downloads
Kitco Spot Gold Price Watcher 1.0
Kitco Spot Gold Price Watcher is an extension which fetches the Bid and Ask price of Spot Gold from Kitcos website. more>>
Kitco Spot Gold Price Watcher is an extension which fetches the Bid and Ask price of Spot Gold from Kitcos website.
This extension retrieve the Bid and Ask price of Spot Gold from Kitcos website.
<<lessThis extension retrieve the Bid and Ask price of Spot Gold from Kitcos website.
Download (0.004MB)
Added: 2007-04-04 License: MPL (Mozilla Public License) Price:
635 downloads
CLSimilarImages 0.4.1
CLSimilarImages is a command-line utility for finding visually similar images which may not be identical. more>>
CLSimilarImages is a command-line utility for finding visually similar images which may not be identical. It reads filenames from standard input, and outputs customisable results to standard output.
It can write similarity data to files for rapid future comparisons, with timestamps for quick updates. The project can compare one collection of images with itself, or two collections with each other. It works well in scripts or with pipes.
<<lessIt can write similarity data to files for rapid future comparisons, with timestamps for quick updates. The project can compare one collection of images with itself, or two collections with each other. It works well in scripts or with pipes.
Download (0.13MB)
Added: 2007-03-24 License: GPL (GNU General Public License) Price:
945 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above price comparisons search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed