Atheon is a portable Server/Client program designed for easy incorporation into just about any game engine. Atheon是一個可移植的服務器/客戶端程序，設計為可以方便地集成到任何游戲引擎中。 來源: http://sourceforge.net/projects/atheon/
sheerdns is a master DNS server whose zone records are stored on a One-Record-Per-File bases. Because of this, it is the simplest of any DNS to configure, the easiest to update, and the most efficient for networks that experience a lot of updates (for example master servers for dynamic IP address ranges). You never have to restart it; any updates are available immediately without having to notify the sheerdns process. 來源: http://freshmeat.net/projects/sheerdns/?topic_id=149 sheerdns是一個主DNS服務器，它的域記錄保存在一個One-Record-Per-File（每文件一個記錄）的庫中。因此，它是最簡單的DNS配制，最容易更新，對于有大量更新的網絡（如動態IP地址范圍的主服務器）來說它是最高效的。你不必重新啟動它，任何更新不用通知對應DNS進程就可以立即生效。
CHM decompiler is a program that converts the internal files of CHM files back into the HHP, HHC, and HHK, etc. used to compile the documentation. CHM decompiler是一個把CHM 文件的內部文件轉換成 HHP, HHC,和HHK等的程序。它用于編譯文件。
This a wonderful reference on the In s and Out s of using Global JavaScript Variables within Brio Intelligence BQY s. 這是一個關于 Brio Intelligence BQY中使用全局 JavaScript 變量進行輸入輸出的好參考
Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle this problem in different scenarios.
a Java program that reads a file containing instructions written in self-defined file (TPL in this case), and executes those instructions. This program should take the name of the TPL file as a command line parameter, and write its output to the console.
Grammatica is a C# and Java parser generator (compiler compiler). It improves upon simlar tools (like yacc and ANTLR) by creating well-commented and readable source code, by having automatic error recovery and detailed error messages, and by support for testing and debugging grammars without generating source code. It supports LL(k) grammars with an unlimited number of look-ahead tokens.
