tongue in
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 42
Open Source in Tab 1.5
Open Source in Tab is an extension which opens the pages source file in a new tab. more>>
Open Source in Tab is an extension which opens the pages source file in a new tab.
Opens the pages source file in a new tab. Has a preference to either open source in a new tab or existing tab.
<<lessOpens the pages source file in a new tab. Has a preference to either open source in a new tab or existing tab.
Download (0.008MB)
Added: 2007-04-19 License: MPL (Mozilla Public License) Price:
550 downloads
Python in Scheme 0.1
Python in Scheme is a scheme library that allows you to run Python code within Scheme. more>>
Python in Scheme is a scheme library that allows you to run Python code within Scheme.
Python in Scheme project uses the Python/C API to embed a Python interpreter.
<<lessPython in Scheme project uses the Python/C API to embed a Python interpreter.
Download (0.002MB)
Added: 2007-01-18 License: GPL (GNU General Public License) Price:
1013 downloads
Exceptions in C 0.1.5
Exceptions in C implements powerful and customizable exceptions for the C programming language. more>>
Exceptions in C implements fully-functional nested exceptions with these constructs:
try
except
on
throw
Also, it allows to define various datatypes for exception object (default is int, can be anything from char * to struct foo *).
Compiling and running
Precodey straight forward.
admp@sols:~/excc/example$ gcc exception.c -c
admp@sols:~/excc/example$ gcc exception.o example.c -o example
admp@sols:~/excc/example$ ./example
Usage: ./example A B
admp@sols:~/excc/example$ ./example 100 2
100/2=50
Program is going to end its short life.
admp@sols:~/excc/example$ ./example 100 0
Caught up division by zero (100/0).
Program is going to end its short life.
Attributions:
Felix Ogg for inspiring me to write finally, also detailed feedbacks and ideas for documentation (diagrams too!). Though I havent completed that - for almost a year now; I am not sure I ever will.
<<lesstry
except
on
throw
Also, it allows to define various datatypes for exception object (default is int, can be anything from char * to struct foo *).
Compiling and running
Precodey straight forward.
admp@sols:~/excc/example$ gcc exception.c -c
admp@sols:~/excc/example$ gcc exception.o example.c -o example
admp@sols:~/excc/example$ ./example
Usage: ./example A B
admp@sols:~/excc/example$ ./example 100 2
100/2=50
Program is going to end its short life.
admp@sols:~/excc/example$ ./example 100 0
Caught up division by zero (100/0).
Program is going to end its short life.
Attributions:
Felix Ogg for inspiring me to write finally, also detailed feedbacks and ideas for documentation (diagrams too!). Though I havent completed that - for almost a year now; I am not sure I ever will.
Download (0.015MB)
Added: 2006-03-16 License: GPL (GNU General Public License) Price:
1318 downloads
PNG Plug-In 1.1.6
PNG plug-in provides Portable Network Graphics (PNG) file load & save modules for The GIMP. more>>
PNG plug-in provides Portable Network Graphics (PNG) file load & save modules for The GIMP. The plug-in supports all color modes and supports saving of interlaced images and setting the level of compression.
Using the PNG Plug-In:
Figure 1 shows the PNG save options window.
The Interlace toggle button selects interlaced output.
The Compression Level slider controls how much compression is applied to the image (0 = none, 9 = maximum).
<<lessUsing the PNG Plug-In:
Figure 1 shows the PNG save options window.
The Interlace toggle button selects interlaced output.
The Compression Level slider controls how much compression is applied to the image (0 = none, 9 = maximum).
Download (0.007MB)
Added: 2006-08-16 License: GPL (GNU General Public License) Price:
1170 downloads
Skolelinux 3.0
Skolelinux is made as free (as in speech) software, and is an overall computer solution based on schools resources and needs. more>>
Skolelinux is made as free (as in speech) software, and also Skolelinux is an overall computer solution based on schools resources and needs.
- Skolelinux is a network architecture tailored for use in schools.
- Skolelinux is developed and supported by a large and growing international community.
- Skolelinux is designed to be easy and cheap to maintain.
- Skolelinux gives the students their own usernames, home directories and services.
- Skolelinux includes OpenOffice.org
Skolelinux, Debian and all auxiliary software components we use are free software ? free as in freedom. The term "free software" implies the following rights:
- Freedom to use the software regardless of purpose and adapt it to ones needs.
- Freedom to study how the software works.
- Freedom to redistribute the software so ones neighbour can benefit from it.
- Freedom to modify and enhance the software and publish those modifications so everyone benefits from them.
These rights form the foundation of both Debian, Skolelinux and all the software we use. They enable us to use the various software components, put them together in our specialized network design and package and redistribute the software as "Skolelinux".
With proprietary software, such as Microsoft Windows, all adaptions and modifications have to be redone everywhere. With Skolelinux, modifications and enhancements done by a school in Norway may benefit schools in Eritrea ? and vice versa. Windows is the most commonly used operative system used in schools today, but as Windows is proprietary software, it is not possible to tailor Windows for school usage and call it "SkoleWindows".
Skolelinux (aka debian-edu) is a Custom Debian Distribution. This means that Skolelinux is a version of the Debian GNU/Linux operating system that is customized for schools. Debian is a state-of-the-art, user-friendly operating system. The goal of our customization of Debian is to make it easy to install and maintain for schools. ? with all applications available in the students mother tongue.
Despite how easy Skolelinux is to install, asking only a handful of (non-technical) questions, it is an advanced network solution, with many pre-configured services. With ordinary, closed, proprietary software, these services have to be configured manually for every single school ? and that needs careful planning and expertise!
Amongst several pre-configured services are the following:
- Central user catalogue: One username and one password for several machines and services.
- Central storage: Regardless of which machine you use in a Skolelinux network, you have access to your files and meet an interface with your settings ? an interface you are familiar with.
- Thin client solution: The applications are run on a thin client server, which is a powerful machine. The image from those applications is drawn on a "thin client", which usually is an old and cheap machine. This enables you to use old hardware. Moreover, it eases administration, as you have one server to maintain.
- Printers may be shared and made available in the network.
- A proxy server caches files downloaded from the Internet, resulting in a faster surfing experience.
Enhancements:
- This is a community release with comprehensive support from regional and national projects in Germany, Spain, France, Greece and Norway. The Skolelinux project is now a part of Debian under the name Debian-Edu. Several other projects have made additional functionality to Skolelinux tailored for national needs. Skolelinux now supports more than 50 countries. Whats new in Skolelinux 3.0: based on Debian 4.0 "etch" and therefore compatible to LSB 3.1, using kernel 2.6.18 and KDE 3.5.5...
<<less- Skolelinux is a network architecture tailored for use in schools.
- Skolelinux is developed and supported by a large and growing international community.
- Skolelinux is designed to be easy and cheap to maintain.
- Skolelinux gives the students their own usernames, home directories and services.
- Skolelinux includes OpenOffice.org
Skolelinux, Debian and all auxiliary software components we use are free software ? free as in freedom. The term "free software" implies the following rights:
- Freedom to use the software regardless of purpose and adapt it to ones needs.
- Freedom to study how the software works.
- Freedom to redistribute the software so ones neighbour can benefit from it.
- Freedom to modify and enhance the software and publish those modifications so everyone benefits from them.
These rights form the foundation of both Debian, Skolelinux and all the software we use. They enable us to use the various software components, put them together in our specialized network design and package and redistribute the software as "Skolelinux".
With proprietary software, such as Microsoft Windows, all adaptions and modifications have to be redone everywhere. With Skolelinux, modifications and enhancements done by a school in Norway may benefit schools in Eritrea ? and vice versa. Windows is the most commonly used operative system used in schools today, but as Windows is proprietary software, it is not possible to tailor Windows for school usage and call it "SkoleWindows".
Skolelinux (aka debian-edu) is a Custom Debian Distribution. This means that Skolelinux is a version of the Debian GNU/Linux operating system that is customized for schools. Debian is a state-of-the-art, user-friendly operating system. The goal of our customization of Debian is to make it easy to install and maintain for schools. ? with all applications available in the students mother tongue.
Despite how easy Skolelinux is to install, asking only a handful of (non-technical) questions, it is an advanced network solution, with many pre-configured services. With ordinary, closed, proprietary software, these services have to be configured manually for every single school ? and that needs careful planning and expertise!
Amongst several pre-configured services are the following:
- Central user catalogue: One username and one password for several machines and services.
- Central storage: Regardless of which machine you use in a Skolelinux network, you have access to your files and meet an interface with your settings ? an interface you are familiar with.
- Thin client solution: The applications are run on a thin client server, which is a powerful machine. The image from those applications is drawn on a "thin client", which usually is an old and cheap machine. This enables you to use old hardware. Moreover, it eases administration, as you have one server to maintain.
- Printers may be shared and made available in the network.
- A proxy server caches files downloaded from the Internet, resulting in a faster surfing experience.
Enhancements:
- This is a community release with comprehensive support from regional and national projects in Germany, Spain, France, Greece and Norway. The Skolelinux project is now a part of Debian under the name Debian-Edu. Several other projects have made additional functionality to Skolelinux tailored for national needs. Skolelinux now supports more than 50 countries. Whats new in Skolelinux 3.0: based on Debian 4.0 "etch" and therefore compatible to LSB 3.1, using kernel 2.6.18 and KDE 3.5.5...
Download (4475MB)
Added: 2007-07-27 License: GPL (GNU General Public License) Price:
822 downloads
Downloads in Tab 0.0.5
Downloads in Tab is an extension which opens Downloads manager in tab from Tools menu. more>>
Downloads in Tab is an extension which opens "Downloads" manager in tab from Tools menu.
Opens "Downloads" manager in tab from Tools menu or automaticlly when a download starts, when in options you uncheck "Show the Downloads window when downloading a file"
To use tab, in Firefox Options dialog uncheck "Show the Downloads window when downloading a file"
To use window, in Firefox Options dialog check "Show the Downloads window when downloading a file"
To use neither, disable or remove this extension and in Firefox Options dialog uncheck "Show the Downloads window when downloading a file" which will restore original functioning.
<<lessOpens "Downloads" manager in tab from Tools menu or automaticlly when a download starts, when in options you uncheck "Show the Downloads window when downloading a file"
To use tab, in Firefox Options dialog uncheck "Show the Downloads window when downloading a file"
To use window, in Firefox Options dialog check "Show the Downloads window when downloading a file"
To use neither, disable or remove this extension and in Firefox Options dialog uncheck "Show the Downloads window when downloading a file" which will restore original functioning.
Download (0.003MB)
Added: 2007-07-25 License: MPL (Mozilla Public License) Price:
836 downloads
Set photo in Kopete 0.1
Set photo in Kopete is a really simple service menu that just sets the current photo as your photo in Kopete. more>>
Set photo in Kopete is a really simple service menu that just sets the current photo as your photo in Kopete, nothing more, nothing less.
It doesnt handle directories containing space yet, if someone have a workaround so that KURL dont escapes all characters that would be nice=)
Just put this file in ~/.kde/share/apps/konqueror/servicemenus or use http://www.kde-look.org/content/show.php?content=11435 to install it.
<<lessIt doesnt handle directories containing space yet, if someone have a workaround so that KURL dont escapes all characters that would be nice=)
Just put this file in ~/.kde/share/apps/konqueror/servicemenus or use http://www.kde-look.org/content/show.php?content=11435 to install it.
Download (MB)
Added: 2007-02-05 License: GPL (GNU General Public License) Price:
993 downloads
meteo in 2o.pl 1.3
The library of programme. more>> The library of programme meteo - meteo.2o.pl Programme measures temperature and it sends it to server where data be stored.<<less
Download (275KB)
Added: 2009-04-10 License: Freeware Price: Free
201 downloads
run in xterm 0.9.1
run in xterm is an servcie menu which adds run in xterm & run in xterm as root to action menu on binary files, scripts etc. more>>
run in xterm is an servcie menu which adds "run in xterm" & "run in xterm as root" to action menu on binary files, scripts etc.
It has 2 languages: english and polish.
Installation:
copy/save this file in
~/.kde/share/apps/konqueror/servicemenus
<<lessIt has 2 languages: english and polish.
Installation:
copy/save this file in
~/.kde/share/apps/konqueror/servicemenus
Download (MB)
Added: 2006-06-12 License: GPL (GNU General Public License) Price:
1230 downloads
Open Directory in VLC 1.0
Open Directory in VLC is just a modified version of the Open in Kaffeine service menu. more>>
Open Directory in VLC is just a modified version of the Open in Kaffeine service menu.
I use it to open DVD/VIDEO_TS folders. VLC plays them with menus in tact.
<<lessI use it to open DVD/VIDEO_TS folders. VLC plays them with menus in tact.
Download (MB)
Added: 2007-06-06 License: GPL (GNU General Public License) Price:
891 downloads
A Sudoku Solver in C 1.11
A Sudoku Solver in C is a console-based Linux program, written in C language, that solves Su Doku puzzles using deductive logic. more>>
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.
Enhancements:
- Code optimization has resulted in a 30% increase in speed.
<<lessPuzzles 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.
Enhancements:
- Code optimization has resulted in a 30% increase in speed.
Download (0.025MB)
Added: 2006-03-27 License: GPL (GNU General Public License) Price:
1332 downloads
Filler in Java 1.02
Filler in Java project is a graphical game where you occupy coloured hexes by changing colours. more>>
Filler in Java project is a graphical game where you occupy coloured hexes by changing colours.
Its strengths are better computer players, internationalisability, and cross-platform deployability.
Installing
In the top directory (same directory as this file), run make. That will build a jar file for you. You then need to be super-user (root), and run make install. If you cant be super-user, just do java -jar filler.jar instead.
The executable program is called filler, and will be installed in /usr/local/bin. Since release 1.01, filler will use your shell variable LANG to set the language that it runs in.
Enhancements:
- Added inc to other directory. This is the code header you include to say that the code is released under GPL.
- Removed resources_de.properties, resources_fr.properties, as I wrote them and they were pretty bad.
- Added sortByRandom() to PlayerWrappers.
- Added build.xml to other. This is for use with ant.
- Cleaned up some access privileges on some fields, cleaned up some bad identifiers.
- Added Kris Verbeecks RemotePlayer.
<<lessIts strengths are better computer players, internationalisability, and cross-platform deployability.
Installing
In the top directory (same directory as this file), run make. That will build a jar file for you. You then need to be super-user (root), and run make install. If you cant be super-user, just do java -jar filler.jar instead.
The executable program is called filler, and will be installed in /usr/local/bin. Since release 1.01, filler will use your shell variable LANG to set the language that it runs in.
Enhancements:
- Added inc to other directory. This is the code header you include to say that the code is released under GPL.
- Removed resources_de.properties, resources_fr.properties, as I wrote them and they were pretty bad.
- Added sortByRandom() to PlayerWrappers.
- Added build.xml to other. This is for use with ant.
- Cleaned up some access privileges on some fields, cleaned up some bad identifiers.
- Added Kris Verbeecks RemotePlayer.
Download (0.37MB)
Added: 2006-12-27 License: GPL (GNU General Public License) Price:
1034 downloads
Roster-in-a-Box 1.0
Roster-in-a-Box project is a course management system designed to facilitate the use of autograded homework assignments. more>>
Roster-in-a-Box project is a course management system designed to facilitate the use of autograded homework assignments, while also allowing for text-based questions to be submitted online and graded online by the instructor. I developed and currently use the system for my introductory statistics and microeconomics courses at Long Island University, and I have had it in production since 2005. While you will be able to break the program if you try hard enough, it is stable and very much ready for use.
I wrote the program because I wanted something simpler than Moodle (and also because my school was not supporting Moodle at the time that I started the project). I love Moodle, and Moodle may be right for you, but it wasnt right for me, because I didnt want the course management system to take over my course web site. Basically, Roster-in-a-Box handles the homework and grading functions with a couple of web pages and leaves you on your own to design the rest of your course web site. That may or may not be what you want.
It should be quite simple to take my statistics modules (and the forthcoming microeconomics modules that I just havent gotten around to packaging) and get your own introductory statistics course up in no time. It is also quite simple to set up a course that consists of only text-based, manually-graded questions. On the other hand, if you want to write auto-graded assignments for some other purpose, you will have to know how to code them yourself. The structure of the modules should be somewhat self-explanatory to experienced programmers, but is probably daunting to those who do not know how to code. The entire program is written in PHP, and uses MySQL as a back-end database.
Version restrictions:
- There are things you could do while editing the assignment list that would leave it in an inconsistent state. For example, if you leave a page open, then open up a different page and make edits in that page, and then go back to the first page and save your changes, you may screw things up. I will get around to fixing this problem at some point, but in the mean time try not to do things like that.
- The program uses the PHP session variable, which by default times out after 24 minutes (supposedly due to security concerns). You should bug the web site administrator to lengthen the PHP system setting session.gc_maxlifetime to be as long as possible.
- By default, the system resets to the Spring semester on January 1st, the Summmer semester on May 15th, and the Fall semester on September 1st. I should probably make these dates editable somewhere in site_settings.php, but instead youll have to dig through administer.php and homework.php if you want to change them.
Enhancements:
- This has been used in a production environment for two years now, but the code has never been released.
<<lessI wrote the program because I wanted something simpler than Moodle (and also because my school was not supporting Moodle at the time that I started the project). I love Moodle, and Moodle may be right for you, but it wasnt right for me, because I didnt want the course management system to take over my course web site. Basically, Roster-in-a-Box handles the homework and grading functions with a couple of web pages and leaves you on your own to design the rest of your course web site. That may or may not be what you want.
It should be quite simple to take my statistics modules (and the forthcoming microeconomics modules that I just havent gotten around to packaging) and get your own introductory statistics course up in no time. It is also quite simple to set up a course that consists of only text-based, manually-graded questions. On the other hand, if you want to write auto-graded assignments for some other purpose, you will have to know how to code them yourself. The structure of the modules should be somewhat self-explanatory to experienced programmers, but is probably daunting to those who do not know how to code. The entire program is written in PHP, and uses MySQL as a back-end database.
Version restrictions:
- There are things you could do while editing the assignment list that would leave it in an inconsistent state. For example, if you leave a page open, then open up a different page and make edits in that page, and then go back to the first page and save your changes, you may screw things up. I will get around to fixing this problem at some point, but in the mean time try not to do things like that.
- The program uses the PHP session variable, which by default times out after 24 minutes (supposedly due to security concerns). You should bug the web site administrator to lengthen the PHP system setting session.gc_maxlifetime to be as long as possible.
- By default, the system resets to the Spring semester on January 1st, the Summmer semester on May 15th, and the Fall semester on September 1st. I should probably make these dates editable somewhere in site_settings.php, but instead youll have to dig through administer.php and homework.php if you want to change them.
Enhancements:
- This has been used in a production environment for two years now, but the code has never been released.
Download (0.13MB)
Added: 2007-06-20 License: GPL (GNU General Public License) Price:
857 downloads
Claros In Touch 2.0
Claros In Touch is a webmail, address book, calendar, and notebook application. more>>
Claros In Touch is a webmail, address book, calendar, and notebook application. Claros In Touch aims to fulfill the need for a stable, full featured messaging application.
Main features:
- Bayesian Spam protection (no need to do setting on mail server, it is bundled with the webmail)
- Message Filtering (custom filters can be applied to the incoming mail)
- Its is developed using Apache Struts, Apache Commons, Claros Commons, JSP and Servlet technology.
- Folder support on the POP3 protocol. (It simulates the IMAP folders by database)
- No need to do database setup (indeed it supports any JDBC compliant database engine), it comes bundled with a ready to run database engine. (Look: http://www.hsqldb.org)
- It is compatible with any standarts compliant POP3 and SMTP server. (No IMAP)
- Operating system independent. Written with regular JSP and servlets.
- Can send HTML e-mail (DHTML based HTML editor included)
- Fully MIME compatible (can read any HTML e-mail)
- An address book aplication
- An advanced notebook application
- A calendar application, with daily, weekly, monthly views and reminder facilities etc...
Enhancements:
- The UI was improved.
- A preference window was added.
- More languages were added.
- Internet Explorer compatibility problems were fixed.
- POP3 mode was re-engineered. List titles were fixed.
- Attachment handling and the drag-drop system were improved.
- Message headers are now shown correctly.
- Message arrived (sound) notification was added.
- A paging system was introduced.
- Inline HTML messages are now shown correctly.
- A HTML sanitizer was added to prevent hacking.
- An address book was added.
- A chat module was added.
- Performance was improved.
- Less system resources are used.
<<lessMain features:
- Bayesian Spam protection (no need to do setting on mail server, it is bundled with the webmail)
- Message Filtering (custom filters can be applied to the incoming mail)
- Its is developed using Apache Struts, Apache Commons, Claros Commons, JSP and Servlet technology.
- Folder support on the POP3 protocol. (It simulates the IMAP folders by database)
- No need to do database setup (indeed it supports any JDBC compliant database engine), it comes bundled with a ready to run database engine. (Look: http://www.hsqldb.org)
- It is compatible with any standarts compliant POP3 and SMTP server. (No IMAP)
- Operating system independent. Written with regular JSP and servlets.
- Can send HTML e-mail (DHTML based HTML editor included)
- Fully MIME compatible (can read any HTML e-mail)
- An address book aplication
- An advanced notebook application
- A calendar application, with daily, weekly, monthly views and reminder facilities etc...
Enhancements:
- The UI was improved.
- A preference window was added.
- More languages were added.
- Internet Explorer compatibility problems were fixed.
- POP3 mode was re-engineered. List titles were fixed.
- Attachment handling and the drag-drop system were improved.
- Message headers are now shown correctly.
- Message arrived (sound) notification was added.
- A paging system was introduced.
- Inline HTML messages are now shown correctly.
- A HTML sanitizer was added to prevent hacking.
- An address book was added.
- A chat module was added.
- Performance was improved.
- Less system resources are used.
Download (9.1MB)
Added: 2007-06-08 License: MPL (Mozilla Public License) Price:
924 downloads
Sharpen Plug-In 1.4.2
Sharpen plug-in provides a sharpening filter to enhance the edges in a blurry image. more>>
Sharpen plug-in provides a sharpening filter to enhance the edges in a blurry image.
Using the Sharpen Plug-In
Figure 1 shows the sharpen plug-in window. The scrollbars allow you to pan within the image (in this case to the back of the duck in the foreground). The preview window shows the filter output using the current settings.
The Sharpness control selects the amount of sharpening to apply, from 1 to 99 percent. Higher values make the edges in the image increasing distinct.
<<lessUsing the Sharpen Plug-In
Figure 1 shows the sharpen plug-in window. The scrollbars allow you to pan within the image (in this case to the back of the duck in the foreground). The preview window shows the filter output using the current settings.
The Sharpness control selects the amount of sharpening to apply, from 1 to 99 percent. Higher values make the edges in the image increasing distinct.
Download (0.009MB)
Added: 2006-08-16 License: GPL (GNU General Public License) Price:
1169 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 tongue in 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