Search - Update

Search - Update - List

[MPI] frequent DL : 0: 这是个用VHDL写的测频源程序,最大可测10M,你可以任意修改,但请你更新后发一份给我-This is written using VHDL source frequency measurement, the largest measurable 10M, you can modify, but please update me with a
Date : 2026-01-23 Size : 159kb User : 浪子
[MPI] K-meanCluster DL : 0: 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. -How the K-mean Cluster workStep 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 (Nk) 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.
Date : 2026-01-23 Size : 2kb User : yangdi
[MPI] SRT_CAS__rar DL : 0: 用户层cas实现服务器建立索引。用户层上传文件：服务器接受文件、将文件分块并使用哈希存储。用户层下载文件：服务器将数据块还原成文件。用户层修改文件：服务器更新文件。-Cas to achieve user-level server indexed. User-level upload files: the server to accept files, block files and use the hash storage. Users download the file level: the server will restore the file data blocks. User level to modify the file: server update files.
Date : 2026-01-23 Size : 43kb User : 赵九鑫
[MPI] S7-200ANDS7-300 DL : 0: 西门子PLC S7-200与S7-300的通信，2008年更新通信接口为MPI FORTIBUS-Siemens PLC S7-200 and S7-300 communication, communication interface 2008, as MPI FORTIBUS update
Date : 2026-01-23 Size : 815kb User : 伍强
[MPI] Isight-call-UGupdate-in-MDO DL : 0: 在利用isight进行MDO时，用于isight对UG自动更新程序的调用-For isight isight MDO UG automatic update procedure call
Date : 2026-01-23 Size : 1kb User : libin
[MPI] ELPSO DL : 0: 基于样本的粒子群优化算法，（ELPSO），能够保持粒子的收敛性和多样性-This paper proposes an example-based learning PSO (ELPSO) to overcome these shortcomings by keeping a balance between swarm diversity and convergence speed. Inspired by a social phenomenon that multiple good examples can guide a crowd towards making progress, ELPSO uses an example set of multiple global best particles to update the positions of the particles.
Date : 2026-01-23 Size : 3kb User : 张绍泉
[MPI] Disk-Information-Update DL : 0: hi this sorce you can check the Disk Information Update thank you
Date : 2026-01-23 Size : 15kb User : Mixed