This will sample all 8 A/D-channels.
The result will be send out via UART1 and can be seen within
any terminal-program (9600 Baud).
With each pressed key the next channel will be converted.
No interrupts are used.
/*
* The internal form of a hash table.
*
* The table is an array indexed by the hash of the key collisions
* are resolved by hanging a linked list of hash entries off each
* element of the array. Although this is a really simple design it
* isn t too bad given that pools have a low allocation overhead.
*/
split from apache for general usage
This standard describes a keyed-hash message authentication code (HMAC), a
mechanism for message authentication using cryptographic hash functions. HMAC can
be used with any iterative Approved cryptographic hash function, in combination with a
shared secret key. The cryptographic strength of HMAC depends on the properties of the
underlying hash function. The HMAC specification in this standard is a generalization of
Internet RFC 2104, HMAC, Keyed-Hashing for Message Authentication, and ANSI
X9.71, Keyed Hash Message Authentication Code.
This file contains a C++Builder 4 project called SimplyChaos-X ver 3.1 (SCX31).
SCX31 is an encryption tool. I designed it as my graduation paper work. SCX31 is a symmetric stream cipher built on chaos function, one time pad cipher and inspiration from Ground Effect (aviation). The key length can be up to 40 characters (320 bits).
Artistic Style is a reindenter and reformatter of C, C++, C# and Java source code.
When indenting source code, we as programmers have a tendency to use both spaces and tab characters to create the wanted indentation. Moreover, some editors by default insert spaces instead of tabs when pressing the tab key, and other editors (Emacs for example) have the ability to "pretty up" lines by automatically setting up the white space before the code on the line, possibly inserting spaces in a code that up to now used only tabs for indentation.
Laser Control is a java program that using a webcam detects when a laser pointer is in a specified hotspot and then does the equivalent of pressing a specified keyboard key. thus controlling Media Portal through it s hot keys. the hotspots can be set by the user as well as the actions taken. Make your wall into a remote controll.
ARP test mode. According to the idea we design the arithmetic for the key part, first the system sends a message to the target machine, and then system wait for the response. Once system receives a message, it starts to analyze the message, according to the message s parameter system judges whether the message satisfies the conditions. Once the message satisfies all the conditions, the system thinks the machine is sniffing, and adds this machine into the list of sniffing machines. On this basis the detection has done well, and at the same time we insert the result into the log database for inquire and analyze later.
A novel met hod t o p artially compensate sigma2delta shap ed noise is p rop osed. By injecting t he comp en2
sation cur rent int o t he p assive loop f ilte r during t he delay time of t he p hase f requency detect or ( PFD) , a maximum
reduction of t he p hase noise by about 16dB can be achieved. Comp a red t o ot he r compensation met hods , t he tech2
nique p rop osed he re is relatively simple and easy t o implement . Key building blocks f or realizing t he noise cancel2
lation , including t he delay va riable PFD and comp ensation cur rent source , a re sp ecially designed. Bot h t he behavior
level and circuit level simulation results a re p resented.
This software package contains the USB framework core developped by ATMEL,
as well as a Mass storage driver. The MSD driver uses the internal flash
of the chip to operate as a disk-on-key.
The following files are included :
- core/
-> Source code for the framework core
-> Makefile for the core
- msd/
-> Source code for the Mass Storage driver
-> Makefile for the MSD driver
- bin/
-> Compiled binaries for every supported chips
- lib/
-> Lib v3 files for every supported chips
- ./
-> Makefile for the framework
-> Startup file
This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.
