descending order
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 1774
Quick Order 1.1
Quick Order provides an ordering system using Java Wireless HTTP Form. more>>
Quick Order provides an ordering system using Java Wireless HTTP Form.
It uses J2ME libraries to submit forms to an HTTP server running PHP and MySQL. It can run on any embedded device that supports Java Wireless, including mobile phones and Palm systems.
It is ideal for making orders in restaurants, point of sale (POS), etc. It supports English and Chinese Big 5 encoding.
Enhancements:
- PASP is used for the server-side language font.
- An HTTP POST method was added to the server.
- A vector is used to allow flexibility of ordered items.
<<lessIt uses J2ME libraries to submit forms to an HTTP server running PHP and MySQL. It can run on any embedded device that supports Java Wireless, including mobile phones and Palm systems.
It is ideal for making orders in restaurants, point of sale (POS), etc. It supports English and Chinese Big 5 encoding.
Enhancements:
- PASP is used for the server-side language font.
- An HTTP POST method was added to the server.
- A vector is used to allow flexibility of ordered items.
Download (0.021MB)
Added: 2007-02-16 License: GPL (GNU General Public License) Price:
987 downloads
CoffeeAdmin 0.6
CoffeeAdmin is a Java-based work order manager to create, organize, and report work orders through a Web interface. more>>
CoffeeAdmin is a Java-based work order manager to create, organize, and report work orders through a Web interface. The project is built in Java using Hibernate, the Spring framework, Jasper, and displaytag.
Enhancements:
- I18n (with translations for English and Spanish) was added.
- Template driven on jasper reports were added. Reports by groups were added.
- A shell script was added for initial configuration.
- A Spring 2 API was added.
- scalability is now unlimited on work orders register table.
- File downloading was improved.
- Several bugs were fixed.
<<lessEnhancements:
- I18n (with translations for English and Spanish) was added.
- Template driven on jasper reports were added. Reports by groups were added.
- A shell script was added for initial configuration.
- A Spring 2 API was added.
- scalability is now unlimited on work orders register table.
- File downloading was improved.
- Several bugs were fixed.
Download (19.4MB)
Added: 2007-02-16 License: LGPL (GNU Lesser General Public License) Price:
980 downloads
Test::XML::Order 0.04
Test::XML::Order is a Perl module to compare the order of XML tags in perl tests. more>>
Test::XML::Order is a Perl module to compare the order of XML tags in perl tests.
SYNOPSIS
use Test::XML::Order tests => 3;
is_xml_in_order( , ); # PASS
is_xml_in_order( , ); # FAIL
isnt_xml_in_order( , ); # PASS
This module contains generic XML testing tools. See below for a list of other modules with functions relating to specific XML modules.
FUNCTIONS
is_xml_in_order ( GOT, EXPECTED [, TESTNAME ] )
This function compares GOT and EXPECTED, both of which are strings of XML. The comparison works only on the order of the tags, attributes are ignored.
Returns true or false, depending upon test success.
isnt_xml_in_order( GOT, MUST_NOT_BE [, TESTNAME ] )
This function is similar to is_xml_in_order(), except that it will fail if GOT and MUST_NOT_BE have elements in the same order.
NOTES
Please note the following about Test::XML::Order.
The package does not check that the input is well formed XML. You should use Test::XML or a similar package if you want to make sure the XML is well formed.
Only the order of tags are checked, so
is_xml_in_order(< a a="b"/ >x< b >< /b >, < a/ >< b a="c" >asdf< /b >);
passes as the inputs have the same order: < a/ >< b/ >.
The tree structure is tested so the the test below passes.
isnt_xml_in_order(< a >< b/ >< /a >, < a/ >< b/ >);
<<lessSYNOPSIS
use Test::XML::Order tests => 3;
is_xml_in_order( , ); # PASS
is_xml_in_order( , ); # FAIL
isnt_xml_in_order( , ); # PASS
This module contains generic XML testing tools. See below for a list of other modules with functions relating to specific XML modules.
FUNCTIONS
is_xml_in_order ( GOT, EXPECTED [, TESTNAME ] )
This function compares GOT and EXPECTED, both of which are strings of XML. The comparison works only on the order of the tags, attributes are ignored.
Returns true or false, depending upon test success.
isnt_xml_in_order( GOT, MUST_NOT_BE [, TESTNAME ] )
This function is similar to is_xml_in_order(), except that it will fail if GOT and MUST_NOT_BE have elements in the same order.
NOTES
Please note the following about Test::XML::Order.
The package does not check that the input is well formed XML. You should use Test::XML or a similar package if you want to make sure the XML is well formed.
Only the order of tags are checked, so
is_xml_in_order(< a a="b"/ >x< b >< /b >, < a/ >< b a="c" >asdf< /b >);
passes as the inputs have the same order: < a/ >< b/ >.
The tree structure is tested so the the test below passes.
isnt_xml_in_order(< a >< b/ >< /a >, < a/ >< b/ >);
Download (0.005MB)
Added: 2007-05-07 License: Perl Artistic License Price:
901 downloads
PloneFolderOrder 1.01
PloneFolderOrder is a project that allows you to keep an order on any content inside your Plone Folders. more>>
As Plone does not offer this functionality yet, PloneFolderOrder is a solution that works in todays Plone sites. Once integrated into Plone, it will become obsolete for newer versions of Plone, but there are enough Plone sites that need this functionality today to justify this temporary solution.
The difference to other solutions that store order information inside content objects themselves, PloneFolderOder stores order information in Plone Folders (Therefore the name PloneFolderOrder). Storing content order in a Plone Folder is preferable, because when the ordering changes, you only have to change a single object, the Plone Folder itself. The only drawback is that content objects have to query their container to know their place in the order.
The order screen of Plone Folders contains the list of the folders content, and the user can order the content.
The standard Plone views, and most importantly the navigation tree, are respecting the order set by users.
It is a full-fledged Plone product, installable and uninstallable using the QuickInstaller Tool.
Enhancements:
- Bug Correction : restarting zope will not delete the method getParentFromFolder
<<lessThe difference to other solutions that store order information inside content objects themselves, PloneFolderOder stores order information in Plone Folders (Therefore the name PloneFolderOrder). Storing content order in a Plone Folder is preferable, because when the ordering changes, you only have to change a single object, the Plone Folder itself. The only drawback is that content objects have to query their container to know their place in the order.
The order screen of Plone Folders contains the list of the folders content, and the user can order the content.
The standard Plone views, and most importantly the navigation tree, are respecting the order set by users.
It is a full-fledged Plone product, installable and uninstallable using the QuickInstaller Tool.
Enhancements:
- Bug Correction : restarting zope will not delete the method getParentFromFolder
Download (0.052MB)
Added: 2007-02-12 License: GPL (GNU General Public License) Price:
984 downloads
Build Order Analyzer 2.0
Build Order Anlyzer for the Axis & Allies RTS is a tool for analyzing builds in the Axis & Allies RTS game. more>>
Build Order Anlyzer for the Axis & Allies RTS is a tool for analyzing builds in the Axis & Allies RTS game. Many sites go to great lengths to explain Build Orders, but the Build Order Analyzer is the first tool to actually allow players the ability to define a Build Order and then compare it to other Build Orders over time.
Key Facts to know about the Build Order Analyzer:
Only tool of its kind
Can support multiple types of RTS based games (not just Axis & Allies RTS!)
Built on Java technology & open source software
The Build Order Anlyzer 2.0 for Axis & Allies RTS is a tool for analyzing builds in the Axis & Allies RTS game. Wikipedia has a great defnition for a Build Order. To summarize, a Build Order in an RTS game defines the order in which a player builds their buildings, units, and upgrades. Understanding the timing and affect of various build trees is critical in making the appropriate tactical decisions during the game.
The BOA allows a player to build and analyze multiple Build Orders without playing a game. Lose to a player due to their build? Then plug it into the BOA and figure out a build to counter it! Gamers no longer have to play game, after game, after game to figure out a decent counter to another players Build Order, they can use the BOA to figure it out. The BOA can literally save serious gamers hundreds of hours of game play!
<<lessKey Facts to know about the Build Order Analyzer:
Only tool of its kind
Can support multiple types of RTS based games (not just Axis & Allies RTS!)
Built on Java technology & open source software
The Build Order Anlyzer 2.0 for Axis & Allies RTS is a tool for analyzing builds in the Axis & Allies RTS game. Wikipedia has a great defnition for a Build Order. To summarize, a Build Order in an RTS game defines the order in which a player builds their buildings, units, and upgrades. Understanding the timing and affect of various build trees is critical in making the appropriate tactical decisions during the game.
The BOA allows a player to build and analyze multiple Build Orders without playing a game. Lose to a player due to their build? Then plug it into the BOA and figure out a build to counter it! Gamers no longer have to play game, after game, after game to figure out a decent counter to another players Build Order, they can use the BOA to figure it out. The BOA can literally save serious gamers hundreds of hours of game play!
Download (0.002MB)
Added: 2006-07-24 License: Freeware Price:
1188 downloads
cfgstoragemaker 1.1
cfgstoragemaker is an MRTG configuration file generator for storage monitoring via SNMP. more>>
cfgstoragemaker remotely generates an MRTG config file in order to graph all storage devices (disk, memory, and swap) of one or more specific host(s) via SNMP.
<<less Download (MB)
Added: 2005-04-07 License: GPL (GNU General Public License) Price:
1661 downloads
Speech and Debate Timekeeper 2.2
Speech and Debate Timekeeper is an open source, multi-platform timer for speech and debate competitions. It has speech order and time limits preset fo... more>> <<less
Download (1458KB)
Added: 2009-04-20 License: Freeware Price: Free
225 downloads
SlackInsUp 0.2
SlackInsUp is a complete Qt-based Gui. more>>
SlackIns is a complete Qt-based Gui with the design goals to provide a complete Pkgtool interface for Users in order to install, remove and upgrade tgz packages for SlackWare Linux OS.
<<less Download (0.13MB)
Added: 2005-05-26 License: GPL (GNU General Public License) Price:
1613 downloads
Adcd 0.9
Adcd is a cd player for Linux with a ncurses (text mode) interface. more>>
Adcd project is a cd player for Linux with a ncurses (text mode) interface.
Adcd can play all the tracks from a disc in order (linear mode), or in the order specified by the user (playlist mode), and includes all the functions expected in a stand-alone cd player, including random play and loop mode.
The functions adcd can perform are:
Open/Close
Play/Pause/Stop
Goto track
Goto Prev/next track
Seek forward/backward
Loop and Loop1 modes
Playlist edition
Random playlist
Set/Show volume
Show elapsed/remaining time of track/disc
Enhancements:
- The license has been updated to GPL version 3 or later.
<<lessAdcd can play all the tracks from a disc in order (linear mode), or in the order specified by the user (playlist mode), and includes all the functions expected in a stand-alone cd player, including random play and loop mode.
The functions adcd can perform are:
Open/Close
Play/Pause/Stop
Goto track
Goto Prev/next track
Seek forward/backward
Loop and Loop1 modes
Playlist edition
Random playlist
Set/Show volume
Show elapsed/remaining time of track/disc
Enhancements:
- The license has been updated to GPL version 3 or later.
Download (0.021MB)
Added: 2007-07-01 License: GPL (GNU General Public License) Price:
848 downloads
15 pieces puzzle
15 pieces puzzle is a game where you have to arrange pieces in order from 1-15 counting from top left corner to bottom corner. more>>
15 pieces (also known as 16 pieces) puzzle game where you have to arrange pieces in order from 1-15 counting from top left corner to bottom right corner.
15 pieces puzzle is a SuperKaramba theme.
<<less15 pieces puzzle is a SuperKaramba theme.
Download (0.034MB)
Added: 2006-06-27 License: GPL (GNU General Public License) Price:
709 downloads
Bio::SAGE::DataProcessing 1.20
Bio::SAGE::DataProcessing module processes raw serial analysis of gene expression (SAGE) data. more>>
Bio::SAGE::DataProcessing module processes raw serial analysis of gene expression (SAGE) data.
SYNOPSIS
use Bio::SAGE::DataProcessing;
$sage = Bio::SAGE::DataProcessing->new();
# open sequence and quality files
open( READS, "library.fasta" );
open( QUAL, "library.qual.fasta" );
# collect ditags and statistics from reads
$sage->process_library( *READS, *QUAL );
# close files
close( READS );
close( QUAL );
# output tags in descending order of expression
my %tags = %{$sage->get_tagcounts()};
open( TAGS, ">library.tags" );
map { print TAGS join( "t", $_, $tags{$_} ) . "n" } sort { $tags{$b} $tags{$a} } keys %tags;
close( TAGS );
# tag AAACCGGGTT matches two different genes
# so 15th base pair may help resolve this
$sage->print_extra_base_calculation( $sage->get_extract_base_calculation( "AAACCGGGTT" ) );
This module provides several tools for processing and analyzing serial analysis of gene expression (SAGE) libraries.
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 processing of SAGE data. Specifically:
1. extracting ditags from raw sequence reads.
2. extracting tags from ditags, with the option to
exclude tags if the Phred scores (described by
Ewing and Green, 1998a and Ewing et al., 1998b)
do not meet a minimum cutoff value.
3. calculating descriptive values
4. statistical analysis to determine, where possible,
additional nucleotides to extend the length of the
SAGE tag (thus facilitating more accurate tag to
gene mapping).
Both regular SAGE (14mer tag) and LongSAGE (21mer tag) are supported by this module. Future protocols should be configurable with this module.
<<lessSYNOPSIS
use Bio::SAGE::DataProcessing;
$sage = Bio::SAGE::DataProcessing->new();
# open sequence and quality files
open( READS, "library.fasta" );
open( QUAL, "library.qual.fasta" );
# collect ditags and statistics from reads
$sage->process_library( *READS, *QUAL );
# close files
close( READS );
close( QUAL );
# output tags in descending order of expression
my %tags = %{$sage->get_tagcounts()};
open( TAGS, ">library.tags" );
map { print TAGS join( "t", $_, $tags{$_} ) . "n" } sort { $tags{$b} $tags{$a} } keys %tags;
close( TAGS );
# tag AAACCGGGTT matches two different genes
# so 15th base pair may help resolve this
$sage->print_extra_base_calculation( $sage->get_extract_base_calculation( "AAACCGGGTT" ) );
This module provides several tools for processing and analyzing serial analysis of gene expression (SAGE) libraries.
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 processing of SAGE data. Specifically:
1. extracting ditags from raw sequence reads.
2. extracting tags from ditags, with the option to
exclude tags if the Phred scores (described by
Ewing and Green, 1998a and Ewing et al., 1998b)
do not meet a minimum cutoff value.
3. calculating descriptive values
4. statistical analysis to determine, where possible,
additional nucleotides to extend the length of the
SAGE tag (thus facilitating more accurate tag to
gene mapping).
Both regular SAGE (14mer tag) and LongSAGE (21mer tag) are supported by this module. Future protocols should be configurable with this module.
Download (0.019MB)
Added: 2007-07-14 License: Perl Artistic License Price:
834 downloads
feedoocha 0.1 Beta
feedoocha is a RSS feed creator. more>>
feedoocha is a RSS feed creator.
In order to maintain my RSS Feed, Ive developed a new mono application named "feedoocha"; its just a RSS Feed generator written in C#, running in mono with the ability to import/export the XML Feed file from a remote FTP server. So far, Im using it to add new topic to my feed.
<<lessIn order to maintain my RSS Feed, Ive developed a new mono application named "feedoocha"; its just a RSS Feed generator written in C#, running in mono with the ability to import/export the XML Feed file from a remote FTP server. So far, Im using it to add new topic to my feed.
Download (0.028MB)
Added: 2006-08-22 License: GPL (GNU General Public License) Price:
1160 downloads
Shell::Parser 0.04
Shell::Parser is a simple shell script parser. more>>
Shell::Parser is a simple shell script parser.
SYNOPSIS
use Shell::Parser;
my $parser = new Shell::Parser syntax => bash, handlers => {
};
$parser->parse(...);
$parser->eof;
This module implements a rudimentary shell script parser in Perl. It was primarily written as a backend for Syntax::Highlight::Shell, in order to simplify the creation of the later.
<<lessSYNOPSIS
use Shell::Parser;
my $parser = new Shell::Parser syntax => bash, handlers => {
};
$parser->parse(...);
$parser->eof;
This module implements a rudimentary shell script parser in Perl. It was primarily written as a backend for Syntax::Highlight::Shell, in order to simplify the creation of the later.
Download (0.017MB)
Added: 2007-04-06 License: Perl Artistic License Price:
934 downloads
Anagram Solver 0.1
Anagram Solver is a simple anagram solver program. more>>
Anagram Solver is a simple anagram solver program.
You can use it against any spelling dictionary that is formatted:
- one word per line
- in alphabetical order
If its not in alphabetical order, you could send it through pipe.
The basic algorithm tries all possible combinations of a word, in such a way that the combinations are generated in alphabetical order.
It also knows the next real word in the list, so it can tell whether or not it is futile to pursue a certain node. These optimizations make it possible for it to solve a 8+ letter word in a few seconds
To use it, simply point it to your aspell dictionary file, usually located in /usr/share/dict/linux.words
<<lessYou can use it against any spelling dictionary that is formatted:
- one word per line
- in alphabetical order
If its not in alphabetical order, you could send it through pipe.
The basic algorithm tries all possible combinations of a word, in such a way that the combinations are generated in alphabetical order.
It also knows the next real word in the list, so it can tell whether or not it is futile to pursue a certain node. These optimizations make it possible for it to solve a 8+ letter word in a few seconds
To use it, simply point it to your aspell dictionary file, usually located in /usr/share/dict/linux.words
Download (0.47MB)
Added: 2006-04-06 License: GPL (GNU General Public License) Price:
1306 downloads

ReNameIt For Linux 1.0.20
ReNameIt is a powerful desktop tool more>> ReNameIt is a powerful desktop tool which will help you rename & index any number of files quickly and safely. If you need to index your pictures, MP3s, movies or if you simply need to keep your files in perfect order then ReNameIt is the tool you need.<<less
Download (134KB)
Added: 2009-04-14 License: Freeware Price: Free
193 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 descending order 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