The TMS320VC5506/C5507/C5509A USB peripherals can be clocked from either the USB APLL or the USB DPLL. Since the APLL is inherently more noise tolerant and has less long-term jitter than the DPLL, it is recommended that you switch to it for any USB operations.
標(biāo)簽： USB peripherals the clocked
上傳時(shí)間： 2014-01-01
上傳用戶：yuzsu
A heap is a binary tree satisfying the following conditions: This tree is completely balanced. If the height of this binary tree is h, then leaves can be at level h or level h-1. All leaves at level h are as far to the left as possible. The data associated with all descendants of a node are smaller than the datum associated with this node.
標(biāo)簽： tree conditions completely satisfying
上傳時(shí)間： 2014-01-01
上傳用戶：gundan
learning English The following appeared in a memorandum written by the vice president of Nature s Way, a chain of stores selling health food and other health-related products. "Previous experience has shown that our stores are most profitable in areas where residents are highly concerned with leading healthy lives. We should therefore build our next new store in Plainsville, which has many such residents. Plainsville merchants report that sales of running shoes and exercise clothing are at all-time highs. The local health club, which nearly closed five years ago due to lack of business, has more members than ever, and the weight training and aerobics classes are always full. We can even anticipate a new generation of customers: Plainsville s schoolchildren are required to participate in a fitness for life program, which emphasizes the benefits of regular exercise at an early age.
標(biāo)簽： memorandum following president learning
上傳時(shí)間： 2017-03-06
上傳用戶：youth25
The existence of numerous imaging modalities makes it possible to present different data present in different modalities together thus forming multimodal images. Component images forming multimodal images should be aligned, or registered so that all the data, coming from the different modalities, are displayed in proper locations. The term image registration is most commonly used to denote the process of alignment of images , that is of transforming them to the common coordinate system. This is done by optimizing a similarity measure between the two images. A widely used measure is Mutual Information (MI). This method requires estimating joint histogram of the two images. Experiments are presented that demonstrate the approach. The technique is intensity-based rather than feature-based. As a comparative assessment the performance based on normalized mutual information and cross correlation as metric have also been presented.
標(biāo)簽： present modalities existence different
上傳時(shí)間： 2017-04-03
上傳用戶：qunquan
Here are the functions for Hamming code 7.4 and Extended Hamming code 8.4 encoding and decoding. For 7.4 code, one error per 7-bit codeword can be corrected. For 8.4 code, one error per 8-bit codeword can be corrected and not less than 2 errors can be detected.
標(biāo)簽： Hamming code and functions
上傳時(shí)間： 2014-01-05
上傳用戶：Amygdala
S60 SDL is a Simple DirectMedia Layer adaptation for S60. SDL is a cross-platform multimedia library: Applications and libraries built on SDL can easily be ported to other operating systems. But S60 SDL does more than makes porting easy: S60 multimedia applications can be implemented without any knowledge of Symbian C++ native API and a developer can use SDL and standard C, C++ interfaces. The SDL development supports both Nokia OpenC and Symbian stdlib (ESTLIB) C implementations.
標(biāo)簽： cross-platform DirectMedia adaptation multimedia
上傳時(shí)間： 2014-01-24
上傳用戶：wangyi39
OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern. 9:62-66 1979). Thresholds are computed to maximize a separability criterion of the resultant classes in gray levels. OTSU(I) is equivalent to OTSU(I,2). By default, n=2 and the corresponding Iseg is therefore a binary image. The pixel values for Iseg are [0 1] if n=2, [0 0.5 1] if n=3, [0 0.333 0.666 1] if n=4, ... [Iseg,sep] = OTSU(I,n) returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with images having less than n gray level, whereas one (optimal value) is obtained only with n-valued images.
標(biāo)簽： OTSU segmentation Gray-level segmented
上傳時(shí)間： 2017-04-24
上傳用戶：yuzsu
Using mirror driver as filter driver in capture desktop screen operation allow system run faster than using device context memory.
標(biāo)簽： driver operation capture desktop
上傳時(shí)間： 2014-01-18
上傳用戶：李夢晗
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
標(biāo)簽： followingconditions tree completely satisfying
上傳時(shí)間： 2017-05-25
上傳用戶：2467478207
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
標(biāo)簽： Generate Possion between random
上傳時(shí)間： 2017-05-25
上傳用戶：bibirnovis
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
