This demo nstrates the use of the reversible jump MCMC algorithm for neural networks. It uses a hierarchical full Bayesian model for neural networks. This model treats the model dimension (number of neurons), model parameters, regularisation parameters and noise parameters as random variables that need to be estimated. The derivations and proof of geometric convergence are presented, in detail, in: Christophe Andrieu, Nando de Freitas and Arnaud Doucet. Robust Full Bayesian Learning for Neural Networks. Technical report CUED/F-INFENG/TR 343, Cambridge University department of Engineering, May 1999. After downloading the file, type "tar -xf rjMCMC.tar" to uncompress it. This creates the directory rjMCMC containing the required m files. Go to this directory, load matlab5 and type "rjdemo1". In the header of the demo file, one can select to monitor the simulation progress (with par.doPlot=1) and modify the simulation parameters.
The algorithms are coded in a way that makes it trivial to apply them to other problems. Several generic routines for resampling are provided. The derivation and details are presented in: Rudolph van der Merwe, Arnaud Doucet, Nando de Freitas and Eric Wan. The Unscented Particle Filter. Technical report CUED/F-INFENG/TR 380, Cambridge University department of Engineering, May 2000. After downloading the file, type "tar -xf upf_demos.tar" to uncompress it. This creates the directory webalgorithm containing the required m files. Go to this directory, load matlab5 and type "demo_MC" for the demo.
The Little Green BATS is the first and so far only Dutch team in the 3D simulation league. We are a group of graduate students from the department of AI at the University of Groningen, The Netherlands. Our team name is derived from the fact that the first 3D agents in the league were balls and from the very philosophical observation that Balls Are Truly Spheres (BATS). This abbreviation reminded us of our favorite song Little Green Bag by The George Baker Selection and so the whole team name was born.
We entered the competition for the first time at the 10th edition of RoboCup at Bremen, Germany. unfortunately our hard work didn t pay off that time: already in the second round we got eliminated. However, after this we had a good base to build upon and the good time we had at the event and the nice community inspired us to continue and work hard for another year. This turned out to be defiantly worth it, because in 2007 in Atlanta we managed to become vice world champions!
FPGA Architecture: Survey and Challenges
Ian Kuon1, Russell Tessier2
and Jonathan Rose1
1 The Edward S. Rogers Sr. department of Electrical and Computer
Engineering, University of Toronto, Toronto, ON, Canada,
{ikuon, jayar}@eecg.utoronto.ca
2 department of Electrical and Computer Engineering, University of
Massachusetts, Amherst, MA, USA, tessier@ecs.umass.edu
Data Structures and Algorithms
with Object-Oriented Design Patterns in Java
Bruno R. Preiss
B.A.Sc., M.A.Sc., Ph.D., P.Eng.
Associate Professor
department of Electrical and Computer Engineering
University of Waterloo, Waterloo, Canada
object recognition using fast adaptive hough transform 快速自適應霍夫變換
作者：D.D. Haule. A.S. Malowany
Computer Vision and Robotics Laboratory
department of Electrical Engineering
McGill University。IEEE 1989的文章，對指導霍夫變換檢測目標的識別有一定的參考意義
A paper that I presented on Supervisory Control and Data Acquisition (SCADA) won the second prize at the symposium conducted by the Electrical and Electronics Engineering department of the SRM University. Other topics on which I presented papers were Performance enhancement of wireless sensor networks using directional antennas, Smart card application and wireless communication. Also my research idea titled “Wavelet Based Image Compression Using SPIHT Algorithm “secured third prize in a technical festival.
DEMO_COND demonstrates the role of the condition
number of a matrix (with respect to inversion)
in the role of linear system solving.
Matthias Heinkenschloss
department of Computational and Applied Mathematics
Rice University
Feb 22, 2001
