亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

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

主站蜘蛛池模板: 巴楚县| 通州区| 连平县| 保亭| 宁化县| 抚远县| 石门县| 青铜峡市| 孙吴县| 锡林郭勒盟| 边坝县| 班玛县| 炎陵县| 通渭县| 施甸县| 融水| 芦溪县| 科技| 荣成市| 类乌齐县| 清流县| 朝阳县| 玛纳斯县| 皋兰县| 乌兰浩特市| 和林格尔县| 咸阳市| 孝昌县| 大化| 湘潭市| 乌兰浩特市| 肇州县| 疏勒县| 阜阳市| 邓州市| 易门县| 健康| 泗洪县| 临桂县| 洛川县| 大同市|