Free webobjects 5.2 software for linux

OpenGTS (Open GPS Tracking System) was spawned from the need for a simple web-based platform that can provide GPS tracking for entry-level commercial enterprises, and demonstration environments, however OpenGTS is highly configurable and scalable to larger enterprises as well.
OpenGTS not only supports the data collection and storage of GPS Tracking and Telemetry data from remove devices, but also includes full-featured web-based authentication and GPS mapping support.
Main features:
- Web-based authentication: Users can log-in and view their own Account and Device information.
- Customizable web-page decorations: The top, bottom, and sides of each web-page can easily be customized to fit a specific motif.
- Customizable menu options: Customized menu options can be made available for specific requirements.
- Customizable mapping service: OpenGTS comes installed with a working Google Maps interface, however, other mapping service provides can easily be integrated with minimal effort.
- GPS tracking device independent: While some coding will be necessary, OpenGTS can be integrated to work with any available remote GPS tracking device.
Enhancements:
- This release includes support for addition GPS tracking devices and full Sendmail support including user authentication and SSL.
- Account users can now be administered from the Web interface UI, including specification of user access control lists.

BSP is the most popular node builder for Doom.
BSP is currently maintained by Colin Phipps. Please see the BSP entries in my blog for news about BSP, and the latest releases. But in practice, BSP is an old and mature tool; I just update it every now and then to fix any problems compiling it for new systems.
What are Nodes?
Before you can play a level that you have created, you must use a node builder to create the data that Doom will use to render the level. Doom uses a rendering algorithm based on a binary space partition, otherwise known as a BSP tree. This is stored in a data lump called NODES in the WAD file. This data structure must be precalculated and stored in the WAD file befor the level can be played; the tool that does this is called a node builder.
BSP is one of several node builders that can do this. There are others: idbsp is the original node builder that id Software used on the original Doom levels, for instance. BSP was the best known and most widely used node builder throughout the height of the Doom editing craze in the mid 1990s.
Main features:
- Fast Doom node builder.
- Supports a number of special effects.
- Supports multi-level WADs. Preserves non-level data in WADs.
- Includes an optional alternative algorithm for choosing the nodes which reduces the chance of visplane overflows.
- Optional support for compressing the blockmap.
- Compiles on DOS, Win32, Linux, UNIX.
- Supports big endian & 64-bit systems.
Usage:
bsp [ -noreject ] [-factor nn ] [ -q ] [ -picknode { traditional | visplane } ] [ -blockmap { old | comp } ] inwad [ [ -o ] outwad ]
Where:
-noreject
Causes any existing REJECT lump in the WAD file not to be replaced.
-factor nn
Used for tuning the node builder. The number supplied is the weighting applied when a choice of nodeline requires other lines to be split. Increasing this value from the default of 17 will reduce the number of extra line splits, but this will generally cause a less balanced node tree. The default is usually fine.
-q
Causes BSP to run quietly, only printing output if there are errors or warnings.
-picknode
Determines the nodeline selection algorithm. The "traditional" option is best for most Doom levels. For levels which are intended for the original doom2.exe and suffer from some marginal visplane overflows, the "visplane" algorithm is designed to minimise these and may help in some cases. See the included visplane.txt for more information.
-blockmap
Selects the blockmap generation algorithm. The default "old" algorithm generates a simple and correct blockmap. The newer "comp" version produces a compressed blockmap, by reusing identical blocks which should be equivalent in actual use. The "comp" version is therefore better but it relatively untested so is not yet enabled by default.
inwad is the input WAD file. This may contain any number of levels and other lumps. The nodes and associated data resources will be built for every level in this WAD. Any other data present in the WAD will be copied to the output WAD unchanged.
outwad is the output WAD file. If the output file already exists, BSP will write its output to a temporary file while it is working, and will only overwrite the output file once it is finished. In particular, it is safe for outwad to be the same as inwad, although this is not recommended unless you keep other backups.
Either inwad or outwad can be pipes or special files. On most UNIX systems, you can have BSP read from STDIN and write to STDOUT by using it as follows: bsp -q /dev/stdin /dev/stdout
Enhancements:
- This release fixes problems on 64-bit systems and compile-time problems on big-endian systems.

JSEclipse project is a Javascript plug-in for the Eclipse environment. Designed to help web developers edit JavaScript files with ease, it has built in support for:
- Code completion for JavaScript function and classes.
- Code completion for JavaDoc.
- Function and class names are displayed in the Outline panel for the currently open file.
- Open declaration
- Error reporting
- Warning reporting
- Code wrap
Enhancements:
- All prototype.js and script.aculo.us class extending idioms are now recognized.
- Full YAHOO framework support was added.
- Major performance improvement were made for content outline (smoother reparsing).
- A debugger keyword generates a line breakpoint marker in the editor, instead of an error.
- Ctrl+/ no longer toggles a comment, but instead will comment or uncomment all the lines.
- Pressing ENTER inside a single line comment preserves the comment.
- The state of content outline buttons is now persistent.

FET is an open source timetabling application for schools, high-schools and some universities.
Main features:
- FET is free software (open source). You can freely use, copy, modify and re-distribute it, as GNU/GPL permits (but please consider a donation)
- Localized to English, French, Catalan, Romanian, Malay, Polish, Turkish, Dutch, German, Hungarian and Macedonian (maybe incompletely)
- Fully automatic generation algorithm, allowing also semi-automatic or manual allocation
- Platform independent implementation, allowing running on GNU/Linux, Windows and any system that Qt supports
- Powerful flexible modular xml format for the input file, allowing editing with an xml editor or by hand (besides FET)
- Possibility to view the currently generated timetable without stopping the ongoing simulation
- The resulted timetables are exported into xml and html formats
- Very flexible students (pupils) structure, in years, groups and subgroups. FET allows overlapping years and groups and non-overlapping subgroups
- Possibility to consider a weight (percentage) for each constraint
- Maximum total number of hours (periods) per day: 30
- Maximum number of working days per week: 14
- Maximum total number of teachers: 700
- Maximum total number of subgroups (sets) of students: 5000
- Maximum total number of subjects: 1000
- Virtually unlimited number of subject tags
- Maximum number of activities: 2000 (you can compile or ask the author a version with more activities allowed)
- Maximum number of rooms: 300
- Maximum number of buildings: 100
- Maximum number of equipments: 300
- Adjustable duration for each activity (each activity can have duration of 1 hour, 2 hours, 3 hours or more)
- Possibility of adding multiple teachers and students sets for each activity. That is, each activity can have specified at most 400 students subgroups (sets) and 100 teachers
- Maximum number of time constraints: 3000
- Maximum number of space constraints: 3000
A large and flexible palette of time constraints:
- Constraint activities preferred times (you can specify a set of activities by teacher, subject, subject tag or students and a set of preferred or allowed periods).
- Constraint activities same starting hour
- Constraint activities same starting time
- Constraint activities not overlapping
- Constraint activity preferred time (to specify for an activity a preferred day, hour or both)
- Constraint activity preferred times
- Constraint basic compulsory time
- Constraint break
- Constraint min n days between activities (to allow balancing the activities in a week)
- Constraint students early (to make the students begin as early as possible the activities)
- Constraint students set early (to make the students set begin as early as possible the activities)
- Constraint students no gaps
- Constraint students set no gaps
- Constraint students (set) max hours daily
- Constraint teacher(s) max hours daily
- Constraint students set not available
- Constraint teacher max days per week
- Constraint teacher not available
- Constraint teachers max gaps per week
A large and flexible palette of space constraints:
- Constraint activity preferred room
- Constraint activity preferred rooms
- Constraint basic compulsory space
- Constraint room not available
- Constraint subject preferred room
- Constraint subject preferred rooms

Bioperl project is a collection of perl modules that facilitate the development of perl scripts for bioinformatics applications. As such, it does not include ready to use programs in the sense that many commercial packages and free web-based interfaces do (e.g. Entrez, SRS).
On the other hand, bioperl does provide reusable perl modules that facilitate writing perl scripts for sequence manipulation, accessing of databases using a range of data formats and execution and parsing of the results of various molecular biology programs including Blast, clustalw, TCoffee, genscan, ESTscan and HMMER. Consequently, bioperl enables developing scripts that can analyze large quantities of sequence data in ways that are typically difficult or impossible with web based systems.
In order to take advantage of bioperl, the user needs a basic understanding of the perl programming language including an understanding of how to use perl references, modules, objects and methods. If these concepts are unfamiliar the user is referred to any of the various introductory or intermediate books on perl.
Weve liked S. Holzmers Perl Core Language, Coriolis Technology Press, for example. This tutorial is not intended to teach the fundamentals of perl to those with little or no experience in the perl language. On the other hand, advanced knowledge of perl - such as how to write a object-oriented perl module - is not required for successfully using bioperl.
Bioperl is open source software that is still under active development. The advantages of open source software are well known. They include the ability to freely examine and modify source code and exemption from software licensing fees.
However, since open source software is typically developed by a large number of volunteer programmers, the resulting code is often not as clearly organized and its user interface not as standardized as in a mature commercial product.
In addition, in any project under active development, documentation may not keep up with the development of new features. Consequently the learning curve for actively developed, open source source software is sometimes steep.
Enhancements:
- Many bugfixes and enhancements were made, including support for parsing the latest NCBI BLAST text format changes, PAML 3.15 support, a Taxonomy (Bio::Species) overhaul, a Bio::Map overhaul, a Bio::SearchIO speedup, the introduction of a Build.PL installation system, and fixes for some memory leaks in Bio::Tree.
- This version requires Perl 5.6.1 or later.

JaxMe project is an open source implementation of JAXB, the specification for Java/XML binding.
A Java/XML binding compiler takes as input a schema description (in most cases an XML schema but it may be a DTD, a RelaxNG schema, a Java class inspected via reflection or a database schema). The output is a set of Java classes:
- A Java bean class compatible with the schema description. (If the schema was obtained via Java reflection, then the original Java bean class.)
- An unmarshaller that converts a conforming XML document into the equivalent Java bean.
- Vice versa, a marshaller that converts the Java bean back into the original XML document.
In the case of JaxMe, the generated classes may also
- Store the Java bean into a database. Preferrably an XML database like eXist, Xindice, or Tamino, but it may also be a relational database like MySQL. (If the schema is sufficiently simple. :-)
- Query the database for bean instances.
- Implement an EJB entity or session bean with the same abilities.
Enhancements:
- This is a bugfix release, dedicated in particular to large scale and composed schemas.

phpRemoteShell project is a PHP application that allow you to execute shell commands and PHP code over HTTP on a remote host.
Installation:
Just put the "prs.php" script on a web server, open a web browser and just call it.
Enhancements:
- All short PHP tags were converted to allow phpRemoteShell to work with "short_open_tag=Off".
- The file browser should now work with PHPs safe mode.
- Better menu management and better safe mode handling were provided.
- HTML output is handled for both Shell commands and the PHP code section.
- A temporary fix was provided for the UTF-8 decoding function, which will hopefully prevent the Web server from segfaulting.