Example program with AVR assembler.
Purpose: Education->Assembler->Simple Watch
ATMega8 and 1 relay. Relay will be on after 7day:00hour:00minute:00 second after power on.
Coded by Basri KUL (I Coded it my microprocessor classes)
CRFsuite is a very fast implmentation of the Conditional Random Fields (CRF) algorithm. It handles tens of thousands sentences in merely one second.
In comparison to CRF++, CRFSuite yields substantially better efficiency performance
In c++ risks is a reference to a variable which exists i.e. one 2nd name for the same variable.
This program is broken up into functions.露the function hand constitutes the entrance point of the program, firstly there is the function message which us affiche hello , and the second function produced 露procedure affich_calcul, one declared the prototype and one it definite after one made the call has this function.
Generate Possion Dis.
step1:Generate a random number between [0,1]
step2:Let u=F(x)=1-[(1/e)x]
step3:Slove x=1/F(u)
step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn
step5:If the first packet was generated at time [0], than the
second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2],
and so on ….
Random-number generation
1.static method random from class Math
-Returns doubles in the range 0.0 <= x < 1.0
2.class Random from package java.util
-Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values
-Is seeded with the current time of day to generate different sequences of numbers each time the program executes
Novell.Press.Linux.Kernel.Development
linux內核開發的經典書籍之一
The Linux kernel is one of the most interesting yet least understood open-source projects. It is also a basis for developing new kernel code. That is why Sams is excited to bring you the latest Linux kernel development information from a Novell insider in the second edition of Linux Kernel Development. This authoritative, practical guide will help you better understand the Linux kernel through updated coverage of all the major subsystems, new features associated with Linux 2.6 kernel and insider information on not-yet-released developments. You ll be able to take an in-depth look at Linux kernel from both a theoretical and an applied perspective as you cover a wide range of topics, including algorithms, system call interface, paging strategies and kernel synchronization. Get the top information right from the source in Linux Kernel Development
This is program with source code to convert ascii text files to the maxicode barcode standard.
The input file consists of two columns. The first column represents a code and the second column is a string enclosed in quotes. The
codes for the first column are as follows: PM, SM, CC, MO, SC, and PC.
C in A Nutshell
Learning a language--any language--involves a process wherein you learn to rely less and less on instruction and more increasingly on the aspects of the language you ve mastered. Whether you re learning French, Java, or C, at some point you ll set aside the tutorial and attempt to converse on your own. It s not necessary to know every subtle facet of French in order to speak it well, especially if there s a good dictionary available. Likewise, C programmers don t need to memorize every detail of C in order to write good programs. What they need instead is a reliable, comprehensive reference that they can keep nearby. C in a Nutshell is that reference.
If you d like to know where visitors to your site live, add this to your feedback forms. They just choose a region, and the second menu changes appropriately, allowing them to choose their country. (If they choose USA, it allows them to select their state) Neat!
The code performs a number (ITERS) of iterations of the
Bailey s 6-step FFT algorithm (following the ideas in the
CMU Task parallel suite).
1.- Generates an input signal vector (dgen) with size
n=n1xn2 stored in row major order
In this code the size of the input signal
is NN=NxN (n=NN, n1=n2=N)
2.- Transpose (tpose) A to have it stored in column
major order
3.- Perform independent FFTs on the rows (cffts)
4.- Scale each element of the resulting array by a
factor of w[n]**(p*q)
5.- Transpose (tpose) to prepair it for the next step
6.- Perform independent FFTs on the rows (cffts)
7.- Transpose the resulting matrix
The code requires nested Parallelism.
