虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

Centers

  • Initialize U=[uij] matrix, U(0) At k-step: calculate the Centers vectors C(k)=[cj] with U(k) &nb

    Initialize U=[uij] matrix, U(0) At k-step: calculate the Centers vectors C(k)=[cj] with U(k)                                 Update U(k) , U(k+1)                                                     If || U(k+1) - U(k)||<     then STOP otherwise return to step 2.

    标签: Initialize calculate Centers vectors

    上传时间: 2013-12-29

    上传用户:CSUSheep

  • Internet+Data+Centers

    With the proliferation of cloud computing and Internet online services, more and more data and computation are migrated to geographical distributed Internet data Centers (IDCs), which can provide reliability, management, and cost benefits. However, IDC operators encounter several major problems in IDC operations, such as huge energy consumption and energy cost, and high carbon emission. To deal with the above problems, IDC operators have to efficiently manage the way of energy consumption and energy supply. Considering the potential of smart grid, we focus on the energy management of IDCs in smart grid from several perspectives, i.e., power outage, carbon emission, heterogeneous service delay guarantees, and operation risk.

    标签: Internet Centers Data

    上传时间: 2020-06-07

    上传用户:shancjb

  • This directory contains code implementing the K-means algorithm. Source codemay be found in KMEANS.C

    This directory contains code implementing the K-means algorithm. Source codemay be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANSprogram accepts input consisting of vectors and calculates the givennumber of cluster Centers using the K-means algorithm. Output isdirected to the screen.

    标签: implementing directory algorithm contains

    上传时间: 2014-01-27

    上传用户:maizezhen

  • This program demonstrates some function approximation capabilities of a Radial Basis Function Networ

    This program demonstrates some function approximation capabilities of a Radial Basis Function Network. The user supplies a set of training points which represent some "sample" points for some arbitrary curve. Next, the user specifies the number of equally spaced gaussian Centers and the variance for the network. Using the training samples, the weights multiplying each of the gaussian basis functions arecalculated using the pseudo-inverse (yielding the minimum least-squares solution). The resulting network is then used to approximate the function between the given "sample" points.

    标签: approximation demonstrates capabilities Function

    上传时间: 2014-01-01

    上传用户:zjf3110

  • The EM algorithm is short for Expectation-Maximization algorithm. It is based on an iterative optimi

    The EM algorithm is short for Expectation-Maximization algorithm. It is based on an iterative optimization of the Centers and widths of the kernels. The aim is to optimize the likelihood that the given data points are generated by a mixture of Gaussians. The numbers next to the Gaussians give the relative importance (amplitude) of each component.

    标签: algorithm Expectation-Maximization iterative optimi

    上传时间: 2015-06-17

    上传用户:独孤求源

  • This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS

    This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster Centers using the K-means algorithm. Output is directed to the screen.

    标签: code implementing directory algorithm

    上传时间: 2014-01-15

    上传用户:woshini123456

  • k-meansy算法源代码。This directory contains code implementing the K-means algorithm. Source code may be f

    k-meansy算法源代码。This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster Centers using the K-means algorithm. Output is directed to the screen.

    标签: code implementing directory algorithm

    上传时间: 2016-04-07

    上传用户:shawvi

  • 到目前为止

    到目前为止,大部分人都已非常熟悉 Java 2平台,以及 Sun如何把 Java技术分成三个版本 (标准版、袖珍版以及企业版),Sun 在1999年6月时推出了 Java 2袖珍版 (J2ME)来满足消费电子和嵌入设备的需要。J2ME是为了那些使用有限的能源、有限的网络连接 (常常是无线连接)以及有限图形用户界面能力的设备开发的。它最初的目标是 16位或 32位处理器,16 MHz时钟频率, 512K或更少内存的设备。乍一看之下, J2ME就像一个没有绑定明显主题的松散的应用程序接口和技术规范。我们想通过说它不是什么东西的方法来描述它,它不是一组用于台式机 Java应用程序规范,如果你再观察仔细一些,你会发现所有的 J2ME组件都围绕一个中心,这些中心被称为configuration(配置 ,Sun的市场营销资料也称它们 design Centers,设计中心),它们中间的每一个都是用于消费电子和嵌入设备的特别的类。

    标签:

    上传时间: 2014-06-17

    上传用户:小码农lz

  • This function resamples the images at the new grid points defined by the new pixel sizes. It assumes

    This function resamples the images at the new grid points defined by the new pixel sizes. It assumes that intensities are defined at the pixel Centers

    标签: the resamples new function

    上传时间: 2014-01-09

    上传用户:WMC_geophy

  • High+Voltage+Protection

    This book is intended to help electric power and telephone company personnel and individuals interested in properly protecting critical tele­ communications circuits and equipment located in high voltage (HV) environments and to improve service reliability while maintaining safe working conditions. Critical telecommunications circuits are often located in HV environments such as electric utility power plants, substations, cell sites on power towers, and standalone telecommuni­ cations facilities such as 911 call Centers and mountaintop telecom­ munications sites. 

    标签: Protection Voltage High

    上传时间: 2020-05-27

    上传用户:shancjb