Bluezan implementation of the Bluetooth™ wireless standards specifications for Linux. The code is licensed under the GNU General Public License (GPL) and is now included in the Linux 2.4 and Linux 2.6 kernel series
Bluezan implementation of the Bluetooth™ wireless standards specifications for Linux. The code is licensed under the GNU General Public License (GPL) and is now included in the Linux 2.4 and Linux 2.6 kernel series
Bluezan implementation of the Bluetooth™ wireless standards specifications for Linux. The code is licensed under the GNU General Public License (GPL) and is now included in the Linux 2.4 and Linux 2.6 kernel series
- MP3 streaming support for Shoutcast/Icecast added.
- Ogg Vorbis support added.
- Playlist implementation and M3U support added.
- JavaLayer 0.1.1 included to improve MP3 support.
- WinAmp Skins 2.0 support improved.
- Seek bar added (for WAV files only).
he AVRcam source files were built using the WinAVR distribution
(version 3.3.1 of GCC). I haven t tested other versions of GCC,
but they should compile without too much difficulty. The makefile
used to build the source is included
Its a text-fading linking ticker type applet that will fade text of any color over any color background. It features rollover color feedback, and will pause when rolled over so the user doesn t have to "chase" links. It uses very little processor power and source is included! Now supports frames!
KVM (for Kernel-based Virtual Machine) is a full virtualization solution for Linux on x86 hardware. It consists of a loadable kernel module (kvm.ko) and a userspace component.
Using KVM, one can run multiple virtual machines running unmodified Linux or Windows images. Each virtual machine has priv ...
This serial client in JAVA allows sending, reading and writing of SMS via a serial COM port. The tool uses the PDU SMS format. IRDA drivers are included. The functionality can be implemented into applications for remote alerting or SMS authentification.
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, s ...
