Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants.
This educational software simulates an Ad-hoc network with AODV algorithm, it uses a high level view and only works in Routing layer. it has a user-friendly graphical user interface and has been written in java language.
distDES is a Java RMI-based application which manages load balancing on heterogeneous clusters. Development will extend the theoretical initial implementation to include clustered Rainbow Table generation and encryption algorithm collision detection.
It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.
Giving you complete control to help you manage your applications and better protect your endpoints.
The Zero Trust security solution that offers a unified approach to protecting users, devices, and networks against the exploitation of zero day vulnerabilities.
A Java based Proxy which dynamically converts HTML from existing web applications to provide XML data and XML-RPC services without having to modify the web applications. One format implements an algorithm called the RMA discussed in a graduate thesis.