Huffman codes
1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s?
2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages.
3.This problem can be solved by using an extended binary tree which is used in the 2-way merging problem.
the sourse code is
to encode and decode the Huffman.
This is full set of procedures used to communicate with
any GSM module for SMS sending/receiving (it uses standard AT commands).
Original code is for ATMega162 microcontroller, but code is general to
be easy ported to others platforms.
Code can be compiled with IAR AVR compiler.
JXTA™ is a set of open, generalized peer-to-peer (P2P) protocols that allow any networked device — sensors, cell phones, PDAs, laptops, workstations, servers and supercomputers — to communicate and collaborate mutually as peers
JXTA™ is a set of open, generalized peer-to-peer (P2P) protocols that allow any networked device — sensors, cell phones, PDAs, laptops, workstations, servers and supercomputers — to communicate and collaborate mutually as peers
This contribution provides functions for finding an optimum parameter set using the evolutionary algorithm of Differential Evolution. Simply speaking: If you have some complicated function of which you are unable to compute a derivative, and you want to find the parameter set minimizing the output of the function, using this package is one possible way to go.
