课程设计之磁盘调度算法：N-Step—Scan
上传时间： 2016-08-16
上传用户：515414293
磁盘调度设计，磁盘调度算法的实现，包括 先来先服务调度算法 最短寻道优先调度算法 扫描算法 循环扫描算法 N—Step—SCAN算法
上传时间： 2015-01-11
上传用户：lhw888
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
标签： the decision clusters Cluster
上传时间： 2013-12-21
上传用户：gxmm
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
标签： contains Output convex planar
上传时间： 2017-02-19
上传用户：wyc199288
The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
标签： iterations performs Bailey number
上传时间： 2014-01-05
上传用户：libenshu01
N系列射频同轴连接器
上传时间： 2013-06-29
上传用户：eeworm
AX2002/A consists of step-down switching regulator with PWM control. Thesedevise include a refer
标签： Regulators Switching Feedback Voltage
上传时间： 2013-05-31
上传用户：hfmm633
The MP1582 is a high frequency step-down switching regulator with integrated internalhigh-sid
标签： Converter Step-Down 15822A 15822
上传时间： 2013-06-13
上传用户：skfreeman
用于FPGA的N+0.5分频代码，可以用来进行非整数分频！
上传时间： 2013-08-06
上传用户：weixiao99
多路18b20测温显示系统,可同时测量n个第三18b20
上传时间： 2013-08-21
上传用户：zhangchu0807
