foobar2000

foobar2000: "Foobar2000 is an advanced audio player for the Windows platform. Some of the basic features include ReplayGain support, low memory footprint and native support for several popular audio formats."

Hidden Camera: Effective employee monitoring solution

Oleansoft: Products: Hidden Camera: Effective employee monitoring solution: "Hidden Camera is an easy-to-use and extremely effective employee monitoring solution that increases productivity several folds by eliminating any PC activity not directly related to work."

Net Monitor for Employees

Net Monitor for Employees: "Net Monitor for Employees Professional allows you to see screens of computers connected to the network. This way you can observe what your employees are doing! Additionally, you have the ability to take control of a remote computer by controlling the mouse and keyboard. You can also send a message to remote computer and/or lock the remote computer."

nLite

Home of nuhi - Projects - nLite: "Have you ever wanted to remove some Windows components like Media Player, Internet Explorer, Outlook Express, MSN Explorer, Messenger...

How about not even to install them with Windows ?

nLite is a GUI for permanent Windows component removal by your choice. After removal there is an option to make bootable image ready for burning on cd or testing in virtual machines. With nLite you will be able to have Windows installation which on install doesn't include, or even contain on cd, unwanted components."

IBM Discloses Cell Based Blade Server Board Prototype

IBM Discloses Cell Based Blade Server Board Prototype -- Tech-On!: "The prototype, called the Cell Processor Based Blade Server, measured approximately 23 x 43 cm. Each board featured two Cell processors, two 512 Mb XDR DRAM chips and two South Bridge LSIs. The Cell processors were demonstrated running at 2.4-2.8 GHz. 'We are driving the Cell processors at higher rates in the laboratory,' said the engineer. 'If operated at 3 GHz, Cell's theoretical performance reaches about 200 GFLOPS, which works out to about 400 GFLOPS per board,' he added. IBM plans to release a rack product capable of storing seven of these boards."

eDonkey Introduces Catalogs - An Effort to Decentralize Hash Links

Slyck News - eDonkey Introduces Catalogs - An Effort to Decentralize Hash Links: "Catalogs are simply web pages, whose main function is to provide eDonke2000 hash links. They function almost identically to ShareReactor or any other hash site. The major difference however, is the indexing function is integrated into the eDonkey client and is distributed to anyone who wishes to host a catalog (providing the individual has the bandwidth and processing resources.) Since they are web pages, catalogs are not limited to just eDonkey2000 links - one can publish anything he or she wishes."

Open Grid Portals

Open Grid Portals :: start: This is a wiki dedicated to Portals, Portlets and the Grid.

TestDisk

TestDisk - testdisk: "TestDisk, http://www.cgsecurity.org, is OpenSource software and is licensed under the GNU Public License, http://www.gnu.org/licenses/gpl.html.

TestDisk was primarily designed to help recover lost partitions and/or make non-booting disks bootable again when these symptoms are caused by faulty software, certain types of viruses or human error (such as accidentally erasing your Partition Table)."

Bram Cohen Releases BitTorrent Search Engine

Slyck News - Bram Cohen Releases BitTorrent Search Engine: "It has been a very busy month for the BitTorrent community. First Azureus developed their DHT (Distributed Hash Table) client. Second, the MPAA (Motion Picture Association of America) CEO and President Dan Glickman accused the entire BitTorrent protocol of facilitating the distribution of Star Wars, Episode III. Then, Bram Cohen releases his own DHT client, followed by an announcement he will release a BitTorrent search engine. Surely, this was the end of the saga right?

It seems not. Today, the MPAA, FBI and U.S. Customs announced the siezure and criminal prosecution of EliteTorrents.org. While today's news appeared grim for BitTorrent fans, there appears to be a silver lining.

The much anticipated BitTorrent search engine is now functioning on BitTorrent.com. Although earlier reports indicated it would not be ready for two weeks, it appears to be fully operational.

Unlike traditional search features associated with BitTorrent trackers, the search engine crawls the web for torrent files. Whether a torrent file is indexed by a tracker or not is irrelevant. The search engine is designed to efficiently crawl the web and find torrent files regardless of their location.

It appears the search engine is working reasonably well, considering the amount of traffic is must be receiving at the moment. The search engine is no doubt still in testing phases, so search queries may perform slowly."

Kademlia

Kademlia - Wikipedia, the free encyclopedia: "Kademlia is a P2P overlay protocol designed for decentralized peer to peer computer networks. It specifies the structure of the network, regulates communication between nodes and how the exchange of information has to take place. Kademlia nodes communicate among themselves using the transport protocol UDP (see OSI model). Kademlia nodes store data by implementing a Distributed Hash Table (DHT). Over an existing LAN/WAN (like the Internet) a new, virtual network, is created in which each network node is identified by a number ('Node ID'). This number serves not only as its identification, but the Kademlia algorithm uses it for further purposes.

A node that would like to join the net must first go through a bootstrap process. In this phase, the node needs to know the IP address of another node (obtained from the user, or from a stored list) that is already participating in the Kademlia network. If the bootstrapping node has not yet participated in the network, it computes a random ID number that is not already assigned to any other node. It uses this ID until leaving the network.

The Kademlia algorithm is based on the calculation of the 'distance' between two nodes. This distance is computed as the exclusive or of the two node IDs, taking the result as an integer number.

This 'distance' does not have anything to do with geographical conditions, but designates the distance within the ID range. Thus it can and does happen that, for example, a node from Germany and one from Australia are 'neighbours'.

Information within Kademlia is stored in so called 'values', every value being attached to a 'key'.

When searching for some key, the algorithm explores the network in several steps, each step approaching closer to the searched-for key, until the contacted node returns the value, or no more closer nodes are found. The number of nodes contacted during the search is only marginally dependent on the size of the network: If the number of participants in the net doubles in number, then a user's node must query only one more node per search, not twice as many.

Further advantages are found particularly in the decentralized structure, which clearly increases the resistance against a denial of service attack. Even if a whole set of nodes are flooded, this will have limited effect on network availability, which will recover itself by knitting the network around these 'holes'."