Please read this document before attempting to compile and run the libraries and applications! The projects
must be compiled in a particular order. Standard support questions are about compiler and/or linker errors
that are generated when users try to compile the projects in the wrong order. Other information of interest
is available here, so read the entire document fi rst.
Wild Magic Version 2.1 is what ships with the fi rst printing of the Game Physics book. Some of the
applications that are referenced in the book did not make it onto the CD–ROM for the book. Version 2.2
contains those applications, plus more
本人大二學習匯編語言程序設計時的全部源代碼，均已經編譯通過生成可執行文件，每個目錄是一個程序。希望對學習匯編語言的同志有所幫助。-my sophomore year learning assembly language programming at all the source code, have already generated by compiler executable files, each directory is a process. Want to learn assembly language comrades help.
This function calculates Akaike s final prediction error
％ estimate of the average generalization error for network
％ models generated by NNARX, NNOE, NNARMAX1+2, or their recursive
％ counterparts.
％
％ [FPE,deff,varest,H] = nnfpe(method,NetDef,W1,W2,U,Y,NN,trparms,skip,Chat)
％ produces the final prediction error estimate (fpe), the effective number
％ of weights in the network if it has been trained with weight decay,
％ an estimate of the noise variance, and the Gauss-Newton Hessian.
％
observable distribution grid are investigated. A distribution
grid is observable if the state of the grid can be fully determined.
For the simulations, the modified 34-bus IEEE test feeder is used.
The measurements needed for the state estimation are generated
by the ladder iterative technique. Two methods for the state
estimation are analyzed: Weighted Least Squares and Extended
Kalman Filter. Both estimators try to find the most probable
state based on the available measurements. The result is that
the Kalman filter mostly needs less iterations and calculation
time. The disadvantage of the Kalman filter is that it needs some
foreknowlegde about the state.
This project demonstrates the use of secure hash functions technique
to implement a file encryption / decryption system.
This implemented application can encrypt / decrypt multiple files
on the fly using a password. The password supplied by the user
is used as the source message from which the hash code (key) is
generated using the SHA algorithm. Then this key is used to
enctypted the data in the file(s). This key is stored in the
encrypted file along with the encrypted data.
This project demonstrates the use of secure hash functions technique
to implement a file encryption / decryption system.
This implemented application can encrypt / decrypt multiple files
on the fly using a password. The password supplied by the user
is used as the source message from which the hash code (key) is
generated using the SHA algorithm. Then this key is used to
enctypted the data in the file(s). This key is stored in the
encrypted file along with the encrypted data.
Video-DVM is a very cheap DVM that shows how an output as complex as a videocomposite signal can be generated entirely in software: two I/O pins and three resistors are all the hardware required. Connected to any TV set it displays voltages, included max and min peaks, using both giant digits and an analog bar-display . A serial data output for computer data logging is provided, too.
This file is distributed in the hope that it will be useful, but WITHOUT
WARRANTY OF ANY KIND.
Author(s): Ole Saether
DESCRIPTION:
This example should be used together with ex2a-tx433.asm. One nRF9E5
evaluation board (receiver) should be programmed with the hex-file generated
from assembling this file and the other evaluation board (transmitter)
programmed with the hex-file generated from assembling ex2a-tx433.asm.
All switches on the DIP-swith S206 on the receiver must be set to the "on"
position and all switches on the DIP-swith S205 on the transmitter must be
set to the "on" position.
When one of the switched SW1-SW4 on the transmitter is pressed the
corresponding LED on the receiver is turned on.
The functionality is the same as in ex2c-rx.c.
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
