THIS DESIGN IS PROVIDED TO YOU "AS IS". XILINX MAKES AND YOU RECEIVE NO WARRANTIES OR CONDITIONS, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE, AND XILINX SPECIFICALLY DISCLAIMS ANY IMPLIED WARRANTIES OF MERCHANTABILITY, NON-INFRINGEMENT, OR FITNESS FOR A PARTICULAR PURPOSE. This design has not been verified on hardware (as opposed to simulations), and it should be used only as an example design, not as a fully functional core. XILINX does not warrant the performance, functionality, or operation of this Design will meet your requirements, or that the operation of the Design will be uninterrupted or error free, or that defects in the Design will be corrected. Furthermore, XILINX does not warrant or make any representations regarding use or the results of the use of the Design in terms of correctness, accuracy, reliability or otherwise.
標簽： CONDITIONS WARRANTIES YOU PROVIDED
上傳時間： 2016-03-21
上傳用戶：1427796291
upsd_flash.c These functions are provided to help you develop your initial code. They are optimized for speed rather that size. As a result, you will see very few nested function calls. If speed is not critical, you can use function calls for common tasks (like dat polling after writing a byte to Flash) The penalty is the extra processor time to make the nested calls.
標簽： upsd_flash functions are provided
上傳時間： 2013-12-23
上傳用戶：Andy123456
When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the screen precision is finite. Hence, you use a lot of resource for nothing! This article presents a fast 2D-line approximation algorithm based on the Douglas-Peucker algorithm (see [1]), well-known in the cartography community. It computes a hull, scaled by a tolerance factor, around the curve by choosing a minimum of key points. This algorithm has several advantages: 這是一個基于Douglas-Peucker算法的二維估值算法。
標簽： mathematical engineering simulations problems
上傳時間： 2013-12-20
上傳用戶：changeboy
This string-include defines all string functions as inline functions. Use gcc. It also assumes ds=es=data space, this should be normal. Most of the string-functions are rather heavily hand-optimized, see especially strtok,strstr,str[c]spn. They should work, but are not very easy to understand. Everything is done entirely within the register set, making the functions fast and clean.
標簽： functions string-include defines assumes
上傳時間： 2014-01-09
上傳用戶：tedo811
In this demo, I use the EM algorithm with a Rauch-Tung-Striebel smoother and an M step, which I ve recently derived, to train a two-layer perceptron, so as to classify medical data (kindly provided by Steve Roberts and Will Penny from EE, Imperial College). The data and simulations are described in: Nando de Freitas, Mahesan Niranjan and Andrew Gee Nonlinear State Space Estimation with Neural Networks and the EM algorithm After downloading the file, type "tar -xf EMdemo.tar" to uncompress it. This creates the directory EMdemo containing the required m files. Go to this directory, load matlab5 and type "EMtremor". The figures will then show you the simulation results, including ROC curves, likelihood plots, decision boundaries with error bars, etc. WARNING: Do make sure that you monitor the log-likelihood and check that it is increasing. Due to numerical errors, it might show glitches for some data sets.
標簽： Rauch-Tung-Striebel algorithm smoother which
上傳時間： 2016-04-15
上傳用戶：zhenyushaw
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.
標簽： reversible algorithm the nstrates
上傳時間： 2014-01-08
上傳用戶：cuibaigao
zlib is designed to be a free, general-purpose, legally unencumbered -- that is, not covered by any patents -- lossless data-compression library for use on virtually any computer hardware and operating system. The zlib data format is itself portable across
標簽： general-purpose unencumbered designed covered
上傳時間： 2014-01-13
上傳用戶：hfmm633
SMT365 has 1MBytes of internal memory to store program and fast access buffers (0x00000 -> 0xFFFFF). To display data captured, use Test.m (MATLAB application)
標簽： internal 1MBytes 0x00000 buffers
上傳時間： 2016-04-24
上傳用戶：924484786
Recent work by Petricoin and Liotta and co-workers (Petricoin et al. Use of proteomic patterns in serum to identify ovarian cancer. Lancet. 2002 Feb 16 359(9306):572-7. PMID: 11867112) has generated a lot of excitement and controversy. This example shows some ways that MATLAB can be used to read, visualize, pre-process (base-line correction, resample) and classify the data. The data can be downloaded from http://home.ccr.cancer.gov/ncifdaproteomics/ppatterns.asp
標簽： Petricoin co-workers and proteomic
上傳時間： 2016-04-28
上傳用戶：hewenzhi
a screen handling program to provide a flashing message. You will have to design a screen layout for where messages are placed on the screen. You will also have to consider when to delay the program in order to give the user time to read the messages. That is, the program will use the curses library, signals and the sleep function.
標簽： screen handling flashing program
上傳時間： 2016-05-04
上傳用戶：chongcongying
