Ports 搜索

Bozohttpd is a small and secure http version 1.1 server. it's main feature is the lack of features, reducing the code size and improving verifiability. It supports CGI/1.1, HTTP/1.1, HTTP/1.0, HTTP/0.9, ~user translations, virtual hosting support, as well as multiple IP-based servers on a single machine. It is capable of services pages via the IPv6 protocol. It has no configuration file by design. Recently added features are htpasswd, SSL, and dynamic redirection, that can be easily disabled.

This is a collection of high quality and free to use TrueType fonts created by Monotype and Microsoft Typography. It consists of the following families: Times New Roman, Courier New, Georgia, Trebuchet MS, Comic Sans MS Arial, Arial Black, Verdana, Andale Mono, Impact They contain all 652 glyphs defined in WGL4 and are available in the following encodings: ISO 8859-1, 2, 3, 4, 5, 6, 7, 8, 9, 10 and 15 KOI8-R and -RU Tahoma can also be installed as an option, but a Windows License is required.

This is the source distribution of XForms, a graphical user interface toolkit for X Window Systems. It should work under X11 R4, R5 & R6. XForms features a rich set of objects, such as buttons, scrollbars, and menus etc. integrated into an easy and efficient object/event callback execution model that allows fast and easy construction of X-applications. In addition, the library is extensible and new objects can easily be created and added to the library.

cvsd is a wrapper program for cvs in pserver mode. It will run 'cvs pserver' under a special uid/gid in a chroot jail. cvsd is run as a daemon and is controlled through a configuration file. It is relatively easy to configure and tools are provided for easily setting up a rootjail. This server can be useful if you want to run a public cvs pserver. You should however be aware of the security limitations of running a cvs pserver. If you want any kind of authentication you should really consider using secure shell as a secure authentication mechanism and transport. Passwords used in cvs pserver are transmitted in plaintext and this wrapper won't change that. This server adds a layer of security to cvs. cvs is a very powerful tool and is capable of running scripts and other things. By running cvs in a rootjail it is possible to limit the amount of "damage" cvs can do if it is exploited. It is generally a good idea to run cvsd without any write permissions to any directory on the system.

gFTP is a free multithreaded FTP and SFTP client for Unix-like systems. It has the following features: Distributed under the terms of the GNU Public License Written in C, has a text interface and a GTK+ 2.x interface Supports the FTP, FTPS (control connection only), HTTP, HTTPS, SSH, and FSP Multithreaded to allow for simultaneous downloads File transfer queues to allow for downloading multiple files Bookmarks menu to allow you to quickly connect to remote sites Supports downloading entire directories and subdirectories Extensive connection manager with FTP and HTTP proxy server support Supports resuming interrupted file transfers Supports caching of remote directory listings Supports connecting to a FTP server via command line parameters Supports associating icons with particular file extensions in the list boxes Sorting capabilities in the file list boxes Can restrict files in the list boxes to a particular file specification Supports viewing and editing of local and remote files Allows for passive and non-passive file transfers Supports FXP file transfers (file transfer between 2 remote servers via FTP) Eliminates buffer overruns from malicious FTP sites

OpenLieroX is based and compatible to the famous LieroX. LieroX is a 2D shooter game. It is an unofficial sequel to Liero, and is the most popular of all the Liero clones. It features online play, fully customizable weapons, levels and characters. Liero Xtreme was created in C++ by Jason 'JasonB' Boettcher, an Australian programmer. The game is based on a deathmatch setting, where multiple players face off in a closed level. Each player is equipped with five weapons selected out of all the weapons allowed, and with a ninja rope that allows the player to move in any direction. Players begin with a set amount of lives, and whilst the game records the number of kills, the last man standing is usually considered the winner. LieroX also allows team deathmatches, which has made it common for players to form clans. Because of the huge community, there are dozens of levels and mods available. You also have no problem to find somebody on Internet to play with. Or if you want to play offline, you also can play with bots.

The Apache Java Enterprise Mail Server (a.k.a. Apache James) is a 100% pure Java SMTP and POP3 Mail server and NNTP News server. We have designed James to be a complete and portable enterprise mail engine solution based on currently available open protocols. James is also a mail application platform. We have developed a Java API to let you write Java code to process emails that we call the mailet API. A mailet can generate an automatic reply, update a database, prevent spam, build a message archive, or whatever you can imagine. A matcher determines whether your mailet should process an email in the server. The James project hosts the Mailet API, and James provides an implementation of this mail appli -cation platform API. James is based upon the Apache Avalon application framework, formerly a product of the Apache Avalon project.

The T2 module is a base for the refactoring of the now quite stable Tangram Object-Relational mapper. In a nutshell, it lets you store objects - which have to be described to a similar level that you would describe a database to store them - into any SQL store. Currently, this is tested on PostgreSQL, MySQL, Oracle and Sybase a lot, though in general database-specific extensions to SQL, such as triggers, stored procedures, etc are avoided. So, if DBI installs and tests successfully with your database, there is a good chance that T2 will work with it too. The only current requirement is that objects that have tables associated with them are implemented via hashes. You also have to be able to describe all of the fields for those root objects. Individual fields of stored objects may be arbitrarily complex. If you are familiar with DBI, it is somewhat similar to bless'ing the structures returned by $dbh->fetchrow_hashref, except that references and collections to other objects in the store are loaded `on demand' (aka Lazy-loading).

dnsjava is an implementation of DNS in Java. It supports all defined record types (including the DNSSEC types), and unknown types. It can be used for queries, zone transfers, and dynamic updates. It includes a cache which can be used by clients, and a minimal implementation of a server. It supports TSIG authenticated messages, partial DNSSEC verification, and EDNS0. dnsjava provides functionality above and beyond that of the InetAddress class. Since it is written in pure Java, dnsjava is fully threadable, and in many cases is faster than using InetAddress. dnsjava provides both high and low level access to DNS. The high level functions perform queries for records of a given name, type, and class, and return an array of records. There is also a clone of InetAddress, which is even simpler. A cache is used to reduce the number of DNS queries sent. The low level functions allow direct manipulation of DNS messages and records, as well as allowing additional resolver properties to be set.

KKTDirect implements an ordering method and accompanying factorization for the direct solution of saddle-point matrices (also known as KKT or equilibrium matrices). A simple constraint on ordering together with an assumption on the rank of parts of the matrix are sufficient to guarantee the existence of the LDL^T factorization, stability concerns aside. In fact, D may be taken to be a diagonal matrix with +/-1 along the diagonal, and be fully determined prior to factorization, giving rise to a "signed Cholesky" factorization. A modified minimum-degree-like algorithm which incorporates this constraint is used, along with a simple algorithm to modify an existing fill-reducing ordering to respect the constraint. While a stability analysis is lacking, numerical experiments indicate that this is generally sufficient to avoid the need for numerical pivoting during factorization, with clear possible benefits for performance. Note this is only alpha-quality proof-of-concept code: for example, out-of-memory errors are not handled gracefully, and the provided Minimum Degree routine is not yet competitive with other packages.