0.125 as a percentage
Sponsored Links
Sponsored Links
0.125 as a percentage
No.
Title
Catelory
Price
License
Expand All
1
System -> System-Administration
GPL GNU General Public License
Open as user is a servicemenu allows you to open a file as a different user.
Installation:
To install, put the file in ~/.kde/share/apps/konqueror/servicemenus and restart Konqueror.
Installation:
To install, put the file in ~/.kde/share/apps/konqueror/servicemenus and restart Konqueror.
2
Internet -> HTTP
GPL GNU General Public License
Pan is a newsreader which attempts to be pleasing to both new and experienced users. In addition to the standard newsreader features, Pan also supports yEnc, offline newsreading, article filtering, multiple connections, and more features for power users and alt.binaries fans.
Pan is also the only Unix newsreader to get a perfect score on the Good Net-Keeping Seal of Approval evaluations.
Pan runs on Linux, BSD, Mac OS X, Windows, and most flavors of Unix.
Pan is also the only Unix newsreader to get a perfect score on the Good Net-Keeping Seal of Approval evaluations.
Pan runs on Linux, BSD, Mac OS X, Windows, and most flavors of Unix.
3
System -> Linux-Distributions
GPL GNU General Public License
StartCom Linux operating systems, are initially based on the RedHat Enterprise AS-3 source code with reliability, security and efficiency in mind, modified to fit the various tasks each flavor of StartCom Linux is assigned to.
In order to choose the right StartCom Linux version for your needs, check out our Products and Distributions page for more information.
View the Screenshots to get an idea how StartCom Linux looks.
StartCom Ltd., a small software house located in the south of Israel. The city of Eilat, at the Red Sea, is famous as a tourist resort, but now also, because its the home of StartCom Linux.
StartCom used to develop applications and websites for local and international customers and operates MediaHostï¿1⁄2 since 1999. StartCom is also a specialist for Linux related implementations. The decision to produce StartCom Linux was made in May 2004.
Whats New in This Release:
· Ahead of a busy spring season and in anticipation of new StartCom Enterprise Linux AS-5 and StartCom MultiMedia Edition ML-6 comes an updated release of the Advanced Server 4 series. The fifth release of this enterprise class operating system is the natural combined continuation of the previously released AS-4 distribution, which includes security updates and minor adjustments. Notable are an updated kernel, security updates for PHP, Firefox and Thunderbird, but also some additions and improvements for smart cards and hardware tokens.
In order to choose the right StartCom Linux version for your needs, check out our Products and Distributions page for more information.
View the Screenshots to get an idea how StartCom Linux looks.
StartCom Ltd., a small software house located in the south of Israel. The city of Eilat, at the Red Sea, is famous as a tourist resort, but now also, because its the home of StartCom Linux.
StartCom used to develop applications and websites for local and international customers and operates MediaHostï¿1⁄2 since 1999. StartCom is also a specialist for Linux related implementations. The decision to produce StartCom Linux was made in May 2004.
Whats New in This Release:
· Ahead of a busy spring season and in anticipation of new StartCom Enterprise Linux AS-5 and StartCom MultiMedia Edition ML-6 comes an updated release of the Advanced Server 4 series. The fifth release of this enterprise class operating system is the natural combined continuation of the previously released AS-4 distribution, which includes security updates and minor adjustments. Notable are an updated kernel, security updates for PHP, Firefox and Thunderbird, but also some additions and improvements for smart cards and hardware tokens.
4
System -> Linux-Distributions
GPL GNU General Public License
Old Laptop As Firewall is a single, 1440kb floppy Linux with 16-bit PCMCIA support and PPP for using a Pentium I/II laptop to firewall a dial-up connection.
The floppy is msdos-formatted and uses Syslinux to boot into a 4MB ramdisk with a Minix version 2 filesystem. The system was compiled with uClibc 0.9.28.
Here are some key features of "Old Laptop As Firewall":
· 2.4.34 non-modular kernel, compressed with lzma
· uClibc 0.9.28
· busybox 1.4.1
· pcmcia-cs 3.2.8
· pppd 2.4.4b1
· iptables 1.3.7
· dnsmasq 2.35
· 100 kb free on the floppy to add more programs!
Limitations:
· OLAF has not been tested with more than one computer behind
· the firewall (I only have two boxes to work with.)
· The supplied chat script probably wont work for many people.
· There currently isnt any support for local timezones.
· The Windows and Mac support is lacking; I dont have
· either OS to work with.
Whats New in This Release:
· The file permissions in /etc/* were changed from 0600 to 0644 on all plain text files except gshadow, shadow, and ppp/pap-secrets.
· The file permissions on /bin/busybox were changed from 0700 to 0755.
· The original permissions were too strict for dnsmasq, which runs as user nobody and couldnt access /etc/hosts.
The floppy is msdos-formatted and uses Syslinux to boot into a 4MB ramdisk with a Minix version 2 filesystem. The system was compiled with uClibc 0.9.28.
Here are some key features of "Old Laptop As Firewall":
· 2.4.34 non-modular kernel, compressed with lzma
· uClibc 0.9.28
· busybox 1.4.1
· pcmcia-cs 3.2.8
· pppd 2.4.4b1
· iptables 1.3.7
· dnsmasq 2.35
· 100 kb free on the floppy to add more programs!
Limitations:
· OLAF has not been tested with more than one computer behind
· the firewall (I only have two boxes to work with.)
· The supplied chat script probably wont work for many people.
· There currently isnt any support for local timezones.
· The Windows and Mac support is lacking; I dont have
· either OS to work with.
Whats New in This Release:
· The file permissions in /etc/* were changed from 0600 to 0644 on all plain text files except gshadow, shadow, and ppp/pap-secrets.
· The file permissions on /bin/busybox were changed from 0700 to 0755.
· The original permissions were too strict for dnsmasq, which runs as user nobody and couldnt access /etc/hosts.
5
System -> Linux-Distributions
GPL GNU General Public License
Linux is a UNIX like Operating System, famous for its reliability and security features, that runs on all kinds of computers. Linux was started by Linus Torwalds in 1991. The Linux Kernel and most applications it offers, are mostyl GPL licensed, called Open Source.
StartCom Enterprise Linux operating systems, are based on the RedHat Enterprise and Fedora source code each modified with reliability, security and efficiency in mind, to fit the tasks assigned to each flavor of StartCom Linux.
View the Screenshots to get an idea how StartCom Linux looks.
Whats New in This Release:
· The newest StartCom Enterprise Linux AS-5.0.0 joins a series of successful and reliable operating systems build and distributed over the last three years by StartCom Ltd. This latest release provides full support for virtualization - the running of multiple instances of operating systems on one physical hardware unit. Depending on the installation preferences, AS-5.0.0 can function as server platform as well as advanced client workstation.
· StartCom Linux is using the latest in open source technology and with its known stability, reliability and security allows for mission-critical server deployments. The Global File System (GFS) provided in AS-5.0.0 allows the building and maintaining of high availability computer clusters, mainly used for data centers.
· The natural support of the XEN hypervisor, makes the running of multiple virtualized server instances possible. The benefits of server virtualization are consolidation, increased utilization, an ability to rapidly provision and start a virtual machine, and increased ability to dynamically respond to hardware failures by moving a virtual machine to different hardware.
· The enhanced usability of the desktop applications makes AS-5.0.0 also an excellent choice for client and development workstations. Many well known products such as Firefox, OpenOffice and Eclipse IDE are provided already during installation as possible options.
· StartCom Enterprise Linux AS-5.0.0 codenamed "Kishuf" is available for Intel i386 and AMD x86_64 architectures. DVD ISO images can be downloaded for free or ordered for a nominal fee. Alternative installation options via network or harddrive are also available.
StartCom Enterprise Linux operating systems, are based on the RedHat Enterprise and Fedora source code each modified with reliability, security and efficiency in mind, to fit the tasks assigned to each flavor of StartCom Linux.
View the Screenshots to get an idea how StartCom Linux looks.
Whats New in This Release:
· The newest StartCom Enterprise Linux AS-5.0.0 joins a series of successful and reliable operating systems build and distributed over the last three years by StartCom Ltd. This latest release provides full support for virtualization - the running of multiple instances of operating systems on one physical hardware unit. Depending on the installation preferences, AS-5.0.0 can function as server platform as well as advanced client workstation.
· StartCom Linux is using the latest in open source technology and with its known stability, reliability and security allows for mission-critical server deployments. The Global File System (GFS) provided in AS-5.0.0 allows the building and maintaining of high availability computer clusters, mainly used for data centers.
· The natural support of the XEN hypervisor, makes the running of multiple virtualized server instances possible. The benefits of server virtualization are consolidation, increased utilization, an ability to rapidly provision and start a virtual machine, and increased ability to dynamically respond to hardware failures by moving a virtual machine to different hardware.
· The enhanced usability of the desktop applications makes AS-5.0.0 also an excellent choice for client and development workstations. Many well known products such as Firefox, OpenOffice and Eclipse IDE are provided already during installation as possible options.
· StartCom Enterprise Linux AS-5.0.0 codenamed "Kishuf" is available for Intel i386 and AMD x86_64 architectures. DVD ISO images can be downloaded for free or ordered for a nominal fee. Alternative installation options via network or harddrive are also available.
6
Internet -> Firefox-Extensions
MPL Mozilla Public License
Copy as HTML Link is a Firefox extension that creates an HTML link to the current page using the selected text and copies it (into the clipboard) for pasting into other applications.
7
Multimedia -> Audio
GPL GNU General Public License
MP3 as CD verifier 2 performs lookups on CDDB servers in an attempt to determine whether one or multiple directories of downloaded/ripped MP3 files has correct track lengths.
Please remember that mp3ascd uses the alphabetically sorted list of .mp3 files per directory Hence it is possible that if your filenames are somehow mismatched (case?), they may be sorted incorrectly. If youre getting a mismatch that you think is wrong, run mp3ascd with default options to make sure that the enumerated list of files it finds is sorted correctly.
To install, firstly make sure the script is executable.
I copy mine into a directory in my PATH, such as /usr/bin/. It should work on a multitude of platforms, but if it does not work on yours, please let me know.
Whats New in This Release:
· Improved readability
· Summary reports (recursive), including non-matching directories
· ID3 tag presence info shown in full display mode
Please remember that mp3ascd uses the alphabetically sorted list of .mp3 files per directory Hence it is possible that if your filenames are somehow mismatched (case?), they may be sorted incorrectly. If youre getting a mismatch that you think is wrong, run mp3ascd with default options to make sure that the enumerated list of files it finds is sorted correctly.
To install, firstly make sure the script is executable.
I copy mine into a directory in my PATH, such as /usr/bin/. It should work on a multitude of platforms, but if it does not work on yours, please let me know.
Whats New in This Release:
· Improved readability
· Summary reports (recursive), including non-matching directories
· ID3 tag presence info shown in full display mode
8
Programming -> Libraries
GPL GNU General Public License
E/AS Automation Solutions is open source software system for help automate your solutions even for personal and/or corporate ones.
E/AS written on CLIP language (CA-Clipper dialect, compiler can be obtained from ITK.ru) and uses CODB (CLIP Object Database) as data storage.
Here are some key features of "E AS Automation Solutions":
· client-server technology (both data and interface forms)
· component infrastructure with interaction between components by messages
· interface forms on XML
· MDI
E/AS contains in typical distribution:
· client software written on clip-ui library
· server software with wrapper for run as daemon
· maintenance tools: CODB console and component manager
· base (form, auth) and example (contact) components
Whats New in This Release:
· completely rewrite code for implement E/AS architecture
· component infrastructure
· own server program instead COBRA
· maintenance tools: CODB console and component manager
· base and example components
· autoupdate views
E/AS written on CLIP language (CA-Clipper dialect, compiler can be obtained from ITK.ru) and uses CODB (CLIP Object Database) as data storage.
Here are some key features of "E AS Automation Solutions":
· client-server technology (both data and interface forms)
· component infrastructure with interaction between components by messages
· interface forms on XML
· MDI
E/AS contains in typical distribution:
· client software written on clip-ui library
· server software with wrapper for run as daemon
· maintenance tools: CODB console and component manager
· base (form, auth) and example (contact) components
Whats New in This Release:
· completely rewrite code for implement E/AS architecture
· component infrastructure
· own server program instead COBRA
· maintenance tools: CODB console and component manager
· base and example components
· autoupdate views
9
Games -> RTS
GPL GNU General Public License
A Jacks Game is a real-time game that runs in a Web browser using the AJAX (Asynchronous JavaScript and XML) technology.
Multiple users can login in A Jacks Game to explore a common map and earn a common currency as their score.
A Jacks Game is free software released under GNU/GPL Open Source License.
Multiple users can login in A Jacks Game to explore a common map and earn a common currency as their score.
A Jacks Game is free software released under GNU/GPL Open Source License.
10
Miscellaneous -> Information-Management
GPL GNU General Public License
Bug-A-Boo provides a software bug tracking system.
Bug-A-Boo is a bug reporting and tracking system that runs on any Web server that supports CGI. It helps you to keep an eye on bugs reported to you by users of your software products.
It can handle any number of projects, users, and bug classifications, and is really flexible in their setup. It features fast fulltext search, query storage, themes, and bug watches.
It uses the tdbengine as a database backend.
Here are some key features of "Bug A Boo":
· can handle an almost unlimited number of projects, versions, components, users, user groups, bugs, bug criteries, bug watches, bug browsing filters etc. The tdbengine which it is based on uses complex algorithms and indexing structures that make it that fast even with a huge amount of data.
· can inform you via email everytime a bug is reported that maches a component of any project you selected. It will email you when someone changes a bug you reported, you modified last or you are responsible for.
· allows users to keep an eye on interesting bugs and issues they are not directly involved with. Changes are then reported via email immediately
· allows users to define filters for browsing the bugs. A filter then can be re-used every time it is needed.
· is capable of handling multiple languages, either preset by the system administrator or by each user individually. The phrases are stored in a simple text file and thus can be translated to any language easily.
· is fully themeable which means it can get a total different look either choseable by the users or preset by the administator. The layout selection includes replacement of the templates and graphics while a theme is meant to change the colors.
· has a fulltext indexed search routine which is incredible fast
· provides full overview with its integrated statistics showing all figures of interest.
· will be continously improved and extended
Whats New in This Release:
· new administration option "Note" implemented: the admin has the possibility to write a note for all users, that appears on the overview page
· internal messaging now allows group wise recipient selection, too.
· slightly optimized bug report edit form layout
· fixed several minor bugs
Bug-A-Boo is a bug reporting and tracking system that runs on any Web server that supports CGI. It helps you to keep an eye on bugs reported to you by users of your software products.
It can handle any number of projects, users, and bug classifications, and is really flexible in their setup. It features fast fulltext search, query storage, themes, and bug watches.
It uses the tdbengine as a database backend.
Here are some key features of "Bug A Boo":
· can handle an almost unlimited number of projects, versions, components, users, user groups, bugs, bug criteries, bug watches, bug browsing filters etc. The tdbengine which it is based on uses complex algorithms and indexing structures that make it that fast even with a huge amount of data.
· can inform you via email everytime a bug is reported that maches a component of any project you selected. It will email you when someone changes a bug you reported, you modified last or you are responsible for.
· allows users to keep an eye on interesting bugs and issues they are not directly involved with. Changes are then reported via email immediately
· allows users to define filters for browsing the bugs. A filter then can be re-used every time it is needed.
· is capable of handling multiple languages, either preset by the system administrator or by each user individually. The phrases are stored in a simple text file and thus can be translated to any language easily.
· is fully themeable which means it can get a total different look either choseable by the users or preset by the administator. The layout selection includes replacement of the templates and graphics while a theme is meant to change the colors.
· has a fulltext indexed search routine which is incredible fast
· provides full overview with its integrated statistics showing all figures of interest.
· will be continously improved and extended
Whats New in This Release:
· new administration option "Note" implemented: the admin has the possibility to write a note for all users, that appears on the overview page
· internal messaging now allows group wise recipient selection, too.
· slightly optimized bug report edit form layout
· fixed several minor bugs
11
Internet -> HTTP
GPL GNU General Public License
Wiki on a Stick is a personal wiki that lives in a single self-modifying HTML file that contains the software, interface, and database.
Its useful for taking notes, for use as a calendar, and for documenting software, etc. Wiki on a Stick currently only works in Firefox
Its useful for taking notes, for use as a calendar, and for documenting software, etc. Wiki on a Stick currently only works in Firefox
12
Programming -> Libraries
Perl Artistic License
Data::Faker::DateTime is a Data::Faker plugin.
DATA PROVIDERS
unixtime
Return a unix time (seconds since the epoch) for a random time between the epoch and now.
date
Return a random date as a string, using a random date format (see date_format).
time
Return a random time as a string, using a random time format (see time_format).
rfc822
Return an RFC 822 formatted random date. This method may not work on systems using a non-GNU strftime implementation (kindly let me know if that is the case.)
ampm
Returns am or pm randomly (in the current locale) using one of the formats specified in ampm_format.
time_format
Return a random time format.
date_format
Return a random date format.
ampm_format
Return a random am/pm format.
datetime_format
Return a random date and time format.
month
Return a random month name, unabbreviated, in the current locale.
month_abbr
Return a random month name, abbreviated, in the current locale.
weekday
Return a random weekday name, unabbreviated, in the current locale.
weekday_abbr
Return a random weekday name, abbreviated, in the current locale.
sqldate
Return a random date in the ISO8601 format commonly used by SQL servers (YYYY-MM-DD).
datetime_locale
Return a datetime string in the preferred date representation for the current locale, for a random date.
date_locale
Return a date string in the preferred date representation for the current locale, for a random date.
time_locale
Return a time string in the preferred date representation for the current locale, for a random date.
century
Return a random century number.
dayofmonth
Return a random day of the month.
DATA PROVIDERS
unixtime
Return a unix time (seconds since the epoch) for a random time between the epoch and now.
date
Return a random date as a string, using a random date format (see date_format).
time
Return a random time as a string, using a random time format (see time_format).
rfc822
Return an RFC 822 formatted random date. This method may not work on systems using a non-GNU strftime implementation (kindly let me know if that is the case.)
ampm
Returns am or pm randomly (in the current locale) using one of the formats specified in ampm_format.
time_format
Return a random time format.
date_format
Return a random date format.
ampm_format
Return a random am/pm format.
datetime_format
Return a random date and time format.
month
Return a random month name, unabbreviated, in the current locale.
month_abbr
Return a random month name, abbreviated, in the current locale.
weekday
Return a random weekday name, unabbreviated, in the current locale.
weekday_abbr
Return a random weekday name, abbreviated, in the current locale.
sqldate
Return a random date in the ISO8601 format commonly used by SQL servers (YYYY-MM-DD).
datetime_locale
Return a datetime string in the preferred date representation for the current locale, for a random date.
date_locale
Return a date string in the preferred date representation for the current locale, for a random date.
time_locale
Return a time string in the preferred date representation for the current locale, for a random date.
century
Return a random century number.
dayofmonth
Return a random day of the month.
13
Desktop-Environment -> Tools
GPL GNU General Public License
Thunderbird send as attachment(s) service menu permits you to send selected file(s) as attachment(s) with thunderbird.
Untar it and create a link in ~/.kde/share/apps/konqueror/servicemenu to the file email.desktop.
Untar it and create a link in ~/.kde/share/apps/konqueror/servicemenu to the file email.desktop.
14
Games -> Puzzle
GPL GNU General Public License
A Sudoku Solver in C is a console-based Linux program, written in C language, that solves Su Doku puzzles using deductive logic. It will only resort to trial-and-error and backtracking approaches upon exhausting its deductive moves.
Puzzles must be of the standard 9x9 variety using the (ASCII) characters 1 through 9 for the puzzle symbols. Puzzles should be submitted as 81 character strings which, when read left-to-right will fill a 9x9 Sudoku grid from left-to-right and top-to-bottom. In the puzzle specification, the characters 1 - 9 represent the puzzle givens or clues. Any other non-blank character represents an unsolved cell.
The puzzle solving algorithm is home grown. I did not borrow any of the usual techniques from the literature, e.g. Donald Knuths "Dancing Links." Instead I rolled my own from scratch as a personal challenge. As such, its performance can only be blamed on yours truly. Still, I feel it is quite fast. On a 333 MHz Pentium II Linux box it solves typical medium force puzzles in approximately 800 microseconds or about 1,200 puzzles per second, give or take. On an Athlon XP 3000 it solves about 6,600 puzzles per sec. (Solving time is dependent upon degree of difficulty, so YMMV.)
Description of Algorithm:
The puzzle algorithm initially assumes every unsolved cell can assume every possible value. It then uses the placement of the givens to refine the choices available to each cell. I call this the markup phase.
After markup completes, the algorithm then looks for singleton cells with values that, due to constraints imposed by the row, column, or 3x3 region, may only assume one possible value. Once these cells are assigned values, the algorithm returns to the markup phase to apply these changes to the remaining candidate solutions. The markup/singleton phases alternate until either no more changes occur, or the puzzle is solved. I call the markup/singleton elimination loop the Simple Solver because in a large percentage of cases it solves the puzzle.
If the simple solver portion of the algorithm doesnt produce a solution, then more advanced deductive rules are applied.
Ive implemented two additional rules as part of the deductive puzzle solver. The first is subset elimination wherein a row/column/region is scanned for X number of cells with X number of matching candidate solutions. If such subsets (or tuples) are found in the row, column, or region, then the candidates values from the subset may be eliminated from all other unsolved cells within the row, column, or region, respectively.
The next deductive rule examines each region looking for candidate values that exclusively align themselves along a single row or column, i.e. a vector. If such candidate values are found, then they may be eliminated from the cells outside of the region that are part of the aligned row or column.
Note that each of the advanced deductive rules calls all preceeding rules, in order, if that advanced rule has effected a change in puzzle markup.
Finally, if no solution is found after iteratively applying all deductive rules, then we begin trial-and-error using recursion for backtracking. A working copy is created from our puzzle, and using this copy the first cell with the smallest number of candidate solutions is chosen. One of the solutions values is assigned to that cell, and the solver algorithm is called using this working copy as its starting point. Eventually, either a solution, or an impasse is reached.
If we reach an impasse, the recursion unwinds and the next trial solution is attempted. If a solution is found (at any point) the values for the solution are added to a list. Again, so long as we are examining all possibilities, the recursion unwinds so that the next trial may be attempted. It is in this manner that we enumerate puzzles with multiple solutions.
Note that it is certainly possible to add to the list of applied deductive rules. The techniques known as "X-Wing" and "Swordfish" come to mind. On the other hand, adding these additional rules will, in all likelihood, slow the solver down by adding to the computational burden while producing very few results. Ive seen the law of diminishing returns even in some of the existing rules, e.g. in subset elimination I only look at two and three valued subsets because taking it any further than that degraded performance.
Whats New in This Release:
· Code optimization has resulted in a 30% increase in speed.
Puzzles must be of the standard 9x9 variety using the (ASCII) characters 1 through 9 for the puzzle symbols. Puzzles should be submitted as 81 character strings which, when read left-to-right will fill a 9x9 Sudoku grid from left-to-right and top-to-bottom. In the puzzle specification, the characters 1 - 9 represent the puzzle givens or clues. Any other non-blank character represents an unsolved cell.
The puzzle solving algorithm is home grown. I did not borrow any of the usual techniques from the literature, e.g. Donald Knuths "Dancing Links." Instead I rolled my own from scratch as a personal challenge. As such, its performance can only be blamed on yours truly. Still, I feel it is quite fast. On a 333 MHz Pentium II Linux box it solves typical medium force puzzles in approximately 800 microseconds or about 1,200 puzzles per second, give or take. On an Athlon XP 3000 it solves about 6,600 puzzles per sec. (Solving time is dependent upon degree of difficulty, so YMMV.)
Description of Algorithm:
The puzzle algorithm initially assumes every unsolved cell can assume every possible value. It then uses the placement of the givens to refine the choices available to each cell. I call this the markup phase.
After markup completes, the algorithm then looks for singleton cells with values that, due to constraints imposed by the row, column, or 3x3 region, may only assume one possible value. Once these cells are assigned values, the algorithm returns to the markup phase to apply these changes to the remaining candidate solutions. The markup/singleton phases alternate until either no more changes occur, or the puzzle is solved. I call the markup/singleton elimination loop the Simple Solver because in a large percentage of cases it solves the puzzle.
If the simple solver portion of the algorithm doesnt produce a solution, then more advanced deductive rules are applied.
Ive implemented two additional rules as part of the deductive puzzle solver. The first is subset elimination wherein a row/column/region is scanned for X number of cells with X number of matching candidate solutions. If such subsets (or tuples) are found in the row, column, or region, then the candidates values from the subset may be eliminated from all other unsolved cells within the row, column, or region, respectively.
The next deductive rule examines each region looking for candidate values that exclusively align themselves along a single row or column, i.e. a vector. If such candidate values are found, then they may be eliminated from the cells outside of the region that are part of the aligned row or column.
Note that each of the advanced deductive rules calls all preceeding rules, in order, if that advanced rule has effected a change in puzzle markup.
Finally, if no solution is found after iteratively applying all deductive rules, then we begin trial-and-error using recursion for backtracking. A working copy is created from our puzzle, and using this copy the first cell with the smallest number of candidate solutions is chosen. One of the solutions values is assigned to that cell, and the solver algorithm is called using this working copy as its starting point. Eventually, either a solution, or an impasse is reached.
If we reach an impasse, the recursion unwinds and the next trial solution is attempted. If a solution is found (at any point) the values for the solution are added to a list. Again, so long as we are examining all possibilities, the recursion unwinds so that the next trial may be attempted. It is in this manner that we enumerate puzzles with multiple solutions.
Note that it is certainly possible to add to the list of applied deductive rules. The techniques known as "X-Wing" and "Swordfish" come to mind. On the other hand, adding these additional rules will, in all likelihood, slow the solver down by adding to the computational burden while producing very few results. Ive seen the law of diminishing returns even in some of the existing rules, e.g. in subset elimination I only look at two and three valued subsets because taking it any further than that degraded performance.
Whats New in This Release:
· Code optimization has resulted in a 30% increase in speed.
15
Programming -> Libraries
LGPL GNU Lesser General Public License
FiForms started as a collection of PHP classes for creating web-based data entry screens for a MySQL database.
FiForms library has since grown into a collection of projects addressing many aspects of web-database development needs. The FiForms framework currently includes the FiForms data-entry classes and the FiReports XML report generation scripts.
These libraries are combined scripts which utilize the new XML capabilities of PHP version 5 to create a framework for developing web applications completely in XML languages.
The FiForms framework also includes a collection of XML Schemas for building these forms, reports, and scripts in XML.
FiForms creates a loose, modular hierarchy of PHP classes which binds HTML input boxes to fields in a MySQL database. FiForms does the work of querying the database, navigating through records, and outputting the data in HTML.
All the developer has to do is declare the objects and set a few parameters. Thus, you can create a working web database by writing less than two dozen lines of PHP script.
FiReports is a set of scripts designed to generate printable XML/HTML reports from a simple PHP or XML definition. The included stylesheets allow the user to generate custom reports in XML, submit them to the server, and receive the results from the server in XML formatted to whatever stylesheet the user requests.
FiForms library has since grown into a collection of projects addressing many aspects of web-database development needs. The FiForms framework currently includes the FiForms data-entry classes and the FiReports XML report generation scripts.
These libraries are combined scripts which utilize the new XML capabilities of PHP version 5 to create a framework for developing web applications completely in XML languages.
The FiForms framework also includes a collection of XML Schemas for building these forms, reports, and scripts in XML.
FiForms creates a loose, modular hierarchy of PHP classes which binds HTML input boxes to fields in a MySQL database. FiForms does the work of querying the database, navigating through records, and outputting the data in HTML.
All the developer has to do is declare the objects and set a few parameters. Thus, you can create a working web database by writing less than two dozen lines of PHP script.
FiReports is a set of scripts designed to generate printable XML/HTML reports from a simple PHP or XML definition. The included stylesheets allow the user to generate custom reports in XML, submit them to the server, and receive the results from the server in XML formatted to whatever stylesheet the user requests.
16
Science-and-Engineering -> Mathematics
Public Domain
A practical lambda-calculator is a normal-order evaluator for the untyped lambda-calculus, extended with convenient commands and shortcuts to make programming in it more productive.
Shortcuts are distinguished constants that represent terms. Commands define new shortcuts, activate tracing of all reductions, compare terms modulo alpha-conversion, print all defined shortcuts and evaluation flags, etc.
Terms to evaluate and commands are entered at a read-eval-print-loop (REPL) "prompt" or "included" from a file by a special command. A Haskell branch is an embedding of the lambda calculator (as a domain-specific language) into Haskell. The calculator can be used interactively within Hugs or GHCi.
The present calculator implements what seems to be an efficient and elegant algorithm of normal order reductions. The algorithm is "more functional" than the traditionally used approach.
The algorithm seems identical to that employed by yacc sans one critical difference. The calculator also takes a more "functional" approach to the hygiene of beta-substitutions, which is achieved by coloring of identifiers where absolutely necessary. This approach is "more functional" because it avoids a global counter or the threading of the paint bucket through the whole the process. The integration of the calculator with Haskell lets us store terms in variables and easily and intuitively combine them.
The traditional recipe for normal-order reductions includes an unpleasant phrase "cook until done". The phrase makes it necessary to keep track of reduction attempts, and implies an ugly iterative algorithm. Were proposing what seems to be an efficient and elegant technique that can be implemented through intuitive re-writing rules.
Our calculator, like yacc, possesses a stack and works by doing a sequence of shift and reduce steps. The only significant difference from yacc is that the lambda-calculator "reparses" the result after the successful reduce step. The source and the target languages of our "parser" (lambda-calculator) are the same; therefore, the parser can indeed apply itself.
The parsing stack can be made implicit. In that case, the algorithm can be used for normalization of typed lambda-terms in Twelf.
The following examples show that lambda-calculus becomes a domain-specific language embedded into Haskell:
> c0 = f ^ x ^ x -- Church numeral 0
> succ = c ^ f ^ x ^ f # (c # f # x) -- Successor
> c1 = eval $ succ # c0 -- pre-evaluate other numerals
> c2 = eval $ succ # c1
> c3 = eval $ succ # c2
> c4 = eval $ succ # c3
It is indeed convenient to store terms in Haskell variables and pre-evaluate (i.e., normalize) them. They are indeed terms. We can always ask the interpreter to show the term. For example, show c4 yields (f. (x. f (f (f (f x))))).
let mul = a ^ b ^ f ^ a # (b # f) -- multiplication
eval $ mul # c1 ---> (b. b), the identity function
eval $ mul # c0 ---> (b. (f. (x. x))), which is "const 0"
These are algebraic results: multiplying any number by zero always gives zero. We can see now how lambda-calculus can be useful for theorem proving, even over universally-quantified formulas.
The calculator implements Dr. Fairbairns suggestion to limit the depth of printed terms. This makes it possible to evaluate and print some divergent terms (so-called tail-divergent terms):
Lambda_calc> let y_comb = f^((p^p#p) # (c ^ f#(c#c))) in eval $ y_comb#c
c (c (c (c (c (c (c (c (c (c (...))))))))))
It is amazing how well lambda-calculus and Haskell play together.
Shortcuts are distinguished constants that represent terms. Commands define new shortcuts, activate tracing of all reductions, compare terms modulo alpha-conversion, print all defined shortcuts and evaluation flags, etc.
Terms to evaluate and commands are entered at a read-eval-print-loop (REPL) "prompt" or "included" from a file by a special command. A Haskell branch is an embedding of the lambda calculator (as a domain-specific language) into Haskell. The calculator can be used interactively within Hugs or GHCi.
The present calculator implements what seems to be an efficient and elegant algorithm of normal order reductions. The algorithm is "more functional" than the traditionally used approach.
The algorithm seems identical to that employed by yacc sans one critical difference. The calculator also takes a more "functional" approach to the hygiene of beta-substitutions, which is achieved by coloring of identifiers where absolutely necessary. This approach is "more functional" because it avoids a global counter or the threading of the paint bucket through the whole the process. The integration of the calculator with Haskell lets us store terms in variables and easily and intuitively combine them.
The traditional recipe for normal-order reductions includes an unpleasant phrase "cook until done". The phrase makes it necessary to keep track of reduction attempts, and implies an ugly iterative algorithm. Were proposing what seems to be an efficient and elegant technique that can be implemented through intuitive re-writing rules.
Our calculator, like yacc, possesses a stack and works by doing a sequence of shift and reduce steps. The only significant difference from yacc is that the lambda-calculator "reparses" the result after the successful reduce step. The source and the target languages of our "parser" (lambda-calculator) are the same; therefore, the parser can indeed apply itself.
The parsing stack can be made implicit. In that case, the algorithm can be used for normalization of typed lambda-terms in Twelf.
The following examples show that lambda-calculus becomes a domain-specific language embedded into Haskell:
> c0 = f ^ x ^ x -- Church numeral 0
> succ = c ^ f ^ x ^ f # (c # f # x) -- Successor
> c1 = eval $ succ # c0 -- pre-evaluate other numerals
> c2 = eval $ succ # c1
> c3 = eval $ succ # c2
> c4 = eval $ succ # c3
It is indeed convenient to store terms in Haskell variables and pre-evaluate (i.e., normalize) them. They are indeed terms. We can always ask the interpreter to show the term. For example, show c4 yields (f. (x. f (f (f (f x))))).
let mul = a ^ b ^ f ^ a # (b # f) -- multiplication
eval $ mul # c1 ---> (b. b), the identity function
eval $ mul # c0 ---> (b. (f. (x. x))), which is "const 0"
These are algebraic results: multiplying any number by zero always gives zero. We can see now how lambda-calculus can be useful for theorem proving, even over universally-quantified formulas.
The calculator implements Dr. Fairbairns suggestion to limit the depth of printed terms. This makes it possible to evaluate and print some divergent terms (so-called tail-divergent terms):
Lambda_calc> let y_comb = f^((p^p#p) # (c ^ f#(c#c))) in eval $ y_comb#c
c (c (c (c (c (c (c (c (c (c (...))))))))))
It is amazing how well lambda-calculus and Haskell play together.
17
Multimedia -> Audio
GPL GNU General Public License
Autocomp is an accompaniment generator written in Perl and Csound.
It takes as input a text file containing chord changes, plus time signature and bpm information, and outputs a Csound .sco file containing a simple arrangement of those changes.
A sample Csound .orc file containing a bass instrument, a selection of keyboard instruments, and a small sample-based drumkit is provided.
It takes as input a text file containing chord changes, plus time signature and bpm information, and outputs a Csound .sco file containing a simple arrangement of those changes.
A sample Csound .orc file containing a bass instrument, a selection of keyboard instruments, and a small sample-based drumkit is provided.
18
Programming -> Libraries
MITX Consortium License
Twisted Names project is both a domain name server as well as a client resolver library.
Twisted Names comes with an "out of the box" nameserver which can read most BIND-syntax zone files as well as a simple Python-based configuration format.
Twisted Names can act as an authoritative server, perform zone transfers from a master to act as a secondary, act as a caching nameserver, or any combination of these.
Twisted Names client resolver library provides functions to query for all commonly used record types as well as a replacement for the blocking gethostbyname() function provided by the Python stdlib socket module.
Twisted Names is available under the MIT Free Software licence.
Whats New in This Release:
· Errors in the markup used in API documentation have been fixed.
· A bug where the DNS client would sometimes drop a response has been fixed.
· A bug which prevented non-IN lookups from generating malformed queries has been fixed.
Twisted Names comes with an "out of the box" nameserver which can read most BIND-syntax zone files as well as a simple Python-based configuration format.
Twisted Names can act as an authoritative server, perform zone transfers from a master to act as a secondary, act as a caching nameserver, or any combination of these.
Twisted Names client resolver library provides functions to query for all commonly used record types as well as a replacement for the blocking gethostbyname() function provided by the Python stdlib socket module.
Twisted Names is available under the MIT Free Software licence.
Whats New in This Release:
· Errors in the markup used in API documentation have been fixed.
· A bug where the DNS client would sometimes drop a response has been fixed.
· A bug which prevented non-IN lookups from generating malformed queries has been fixed.
19
Internet -> HTTP
GPL GNU General Public License
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.
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.
20
Internet -> HTTP
GPL GNU General Public License
Sidebar in a Can is a simple and powerful tool for webmasters to take a large amount of static content (intimidating to new users) and turn it into a quite manageable amount of dynamic content. The result showcases your sites material.
Sidebar in a Can is built on Snippets technology.
Sidebar in a Can is designed to be run as a straightforward web application, with much administrative activity performed on-web. Rather than trying to explain how to use it, I simply encourage you to explore.
Security
The present release of Sidebar in a Can has not been closely scrutinized for security, and should be treated as such by security-conscious administrators. If you examine the code and discover a vulnerability that could compromise the server, please contact the author at jshayward@pobox.com. The script is intended to have light security and not to compromise a server, but it is not intended to store credit card numbers or other sensitive information.
The default installation sets < the private sidebar data directory > and contents to mode 777. Administrators are encouraged to set directory and contents to mode 700, owned by the effective user ID that Snippets will be running under.
Sidebar in a Can is built on Snippets technology.
Sidebar in a Can is designed to be run as a straightforward web application, with much administrative activity performed on-web. Rather than trying to explain how to use it, I simply encourage you to explore.
Security
The present release of Sidebar in a Can has not been closely scrutinized for security, and should be treated as such by security-conscious administrators. If you examine the code and discover a vulnerability that could compromise the server, please contact the author at jshayward@pobox.com. The script is intended to have light security and not to compromise a server, but it is not intended to store credit card numbers or other sensitive information.
The default installation sets < the private sidebar data directory > and contents to mode 777. Administrators are encouraged to set directory and contents to mode 700, owned by the effective user ID that Snippets will be running under.
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above 0.125 as a percentage 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
My Software
You have not saved any software. Click "Save" next to each software to save it to your software basket
Related Information
Sponsored Links
TOP POPULAR DOWNLOAD