Preparation of a function, even to the importation of n, the function call seeking +1/n 1/2+1/4+ .... When n is odd input, the function call 1/1+1/3+ ... +1/n (using function pointer)
標簽： function Preparation importation the
上傳時間： 2014-01-21
上傳用戶：semi1981
A small tool to change the default source control provider client, so you can use SourceSafe, SourceOffsite, Workspaces etc, on the same machine
標簽： SourceSafe provider default control
上傳時間： 2015-10-17
上傳用戶：ggwz258
Driver to create flat random graphs and two forms of hierarchical graphs (N-level and transit-stub)
標簽： graphs hierarchical transit-stu and
上傳時間： 2013-12-20
上傳用戶：ggwz258
Welcome to UnderC version 1.2.9w This package consists of the executable (UCW), a default script file, this file, and the library files. It is important that the header files end up in a include subdirectory of the directory where UCW is found. If you unzip this file using its path information ( use folder names ) this will automatically happen. You can optionally specify the UnderC directory with the environment variable UC_HOME note that this points to the directory containing ucw.exe. If you do this, then you can copy the executable anywhere and it will still be able to find the header files.
標簽： executable consists Welcome package
上傳時間： 2015-12-18
上傳用戶：baiom
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標簽： represented integers group items
上傳時間： 2016-01-17
上傳用戶：jeffery
n this demo, we show how to use Rao-Blackwellised particle filtering to exploit the conditional independence structure of a simple DBN. The derivation and details are presented in A Simple Tutorial on Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks. This detailed discussion of the ABC network should complement the UAI2000 paper by Arnaud Doucet, Nando de Freitas, Kevin Murphy and Stuart Russell. After downloading the file, type "tar -xf demorbpfdbn.tar" to uncompress it. This creates the directory webalgorithm containing the required m files. Go to this directory, load matlab5 and type "dbnrbpf" for the demo.
標簽： Rao-Blackwellised conditional filtering particle
上傳時間： 2013-12-17
上傳用戶：zhaiyanzhong
D169 Demo - DMA0 Repeated Burst to-from RAM, Software Trigger Description A 32 byte block from 220h-240h is transfered to 240h-260h using DMA0 in a burst block using software DMAREQ trigger. After each transfer, source, destination and DMA size are reset to inital software setting because DMA transfer mode 5 is used. P1.0 is toggled durring DMA transfer only for demonstration purposes. ** RAM location 0x220 - 0x260 used - always make sure no compiler conflict ** ACLK= n/a, MCLK= SMCLK= default DCO ~ 800k
標簽： Description Repeated Software to-from
上傳時間： 2014-01-09
上傳用戶：thinode
MSP-FET430P140 Demo - USART0, SPI Interface to HC165/164 Shift Registers Description: Demonstrate USART0 in two-way SPI mode. Data are read from an HC165, and same data written back to the HC164. ACLK = n/a MCLK = SMCLK = default DCO = UCLK0 = DCO/2 * USART0 control bits are in different SFR s from other MSP430 s *
標簽： Description Demonstrate Interface Registers
上傳時間： 2013-12-28
上傳用戶：懶龍1988
Its functions are: n order within (excluding n) At the same time, 3 and 7 can be integral to all natural and a few of the square root of s, and function as a value to return, the final result s output to file out.dat China.
標簽： functions excluding integral within
上傳時間： 2016-11-12
上傳用戶：王者A
These instances, whenmapped to an N-dimensional space, represent a core set that can be used to construct an approximation to theminimumenclosing ball. Solving the SVMlearning problem on these core sets can produce a good approximation solution in very fast speed. For example, the core-vector machine [81] thus produced can learn an SVM for millions of data in seconds.
標簽： N-dimensional whenmapped instances represent
上傳時間： 2016-11-23
上傳用戶：lixinxiang
