Amatix Office is a complete communication platform for small and medium-sized businesses. It provides email, calendar, contacts, conventional telephony like ISDN, new generation VoIP telephony like SIP, instant messaging, presence, and other features needed to power a business. Amatix Office is very easy to install and use and does not require any special IT skills. It is a live software appliance which boots a computer directly from a CD or USB flash drive without any software installation.
HLBRW is an acronym for Hogwash Light BR Watch. It is a tool to help make rules for HLBR. In other words, HLBRW was made to be used by HLBR users needing make new rules. It requires some expertise with HLBR, the TCP/IP protocol suite, and regular expressions. HLBRW is a script started by iwatch (a system events watch program) when the HLBR event log is modified. The concept is very single: if the HLBR log was modified, then a known attack was blocked. But the attacker might take other subsequent actions unknown by HLBR. When HLBRW starts, it will coordinate a tcpdump session to record the traffic generated by the attacker's IP address for the next few minutes. If the recorded traffic isn't relevant (without a push in TCP or another relevant protocol), the created file will be deleted. Based on the recorded traffic, the network security manager can make new rules. HLBRW is part of the HLBR project, an intrusion prevention system (IPS) used in firewall systems.
Isoline Retrieval uses supervised statistical classification to retrieve isolines from cross-track scanning or similar satellites. It contains software to generate training data using collocation or radiative transfer simulations, as well as routines to interpolate the final fields using a variation of multi-linear interpolation or kernel estimation. The currently-supported satellites are the Advance Microwave Sounding Unit (AMSU) series and, to a lesser extent, the Global Ozone Measurement Experiment (GOME). An ambitious researcher, however, could easily adapt the codes to a similar satellite.
highest is a program that efficiently finds the n highest (or lowest) numbers in a list of numbers on stdin. The traditional way of computing this using GNU sort should have a running time of O(n log n), where n is the number of numbers to check. Highest should have a running time of O(n log m), where m is the number of numbers you want to keep. A graph comparing the performance of highest to that of GNU sort is provided.