登录
首页 » Python » P03-Tk_Clock.py

P03-Tk_Clock.py

于 2016-02-09 发布 文件大小:2KB
0 200
下载积分: 1 下载次数: 1

代码说明:

  just compile the program in python and see the clock

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • xLink
    实现环氧树脂交联,设定交联度,并统计不同交联度的结构,密度,能量等(Achieve the epoxy resin crosslinking, set the crosslinking degree, and count the structure, density and energy of different crosslinking degree)
    2021-04-23 14:28:47下载
    积分:1
  • 222small
    并行图像细化算法和C代码实现,希望对大家有用(parallel image thinning algorithm and C code to achieve the hope that it may be useful to)
    2007-06-18 17:53:45下载
    积分:1
  • 程序设导论
    适合于新手学习并行化MPI程序以及并行思想学习(This is a parallel program learning material for beginners.)
    2021-01-05 13:28:54下载
    积分:1
  • 空心高斯光束传输模拟
    说明:  数值模拟空心高斯光束在自由空间中的传输特性(NUMERICAL SIMULATION OF PROPAGATION CHARACTERISTICS OF HOLLOW GAUSSIAN BEAMS IN FREE SPACE)
    2019-05-11 11:56:56下载
    积分:1
  • pc
    说明:  天津大学并行计算大作业代码及实验报告。 包括: 1.利用Pthread并行实现求Pi和Jacobi迭代 2.利用MPI并行实现Jacobi迭代 3.hadoop下的Mapreduce实现Wordcount算法(Tianjin University of parallel computing job code and lab reports. Include: (1) the use of parallel implementation Pthread seeking Pi and Jacobi iteration 2 use MPI parallel implementation of Jacobi iteration 3.hadoop under Mapreduce achieve Wordcount algorithm.)
    2014-05-31 23:46:24下载
    积分:1
  • spark apriori法实现代码
    应用背景  Apriori算法是一种最有影响的挖掘布尔关联规则频繁项集的算法。其核心是基于两阶段频集思想的递推算法。该关联规则在分类上属于单维、单层、布尔关联规则。在这里,所有支持度大于最小支持度的项集称为频繁项集,简称频集。  关键技术频繁项集挖掘采用spark实现的并行化挖掘算法。并行的apriori算法采用scala编写,并行的apriori采用java编写。里面会有较多函数使编程的内容。 
    2022-02-02 20:25:06下载
    积分:1
  • Chaos
    描述混沌现象的判断及其使用MATLAB对该过程的仿真的程序源码(Description of chaotic phenomena and the use of MATLAB to determine the course of the simulation procedure source)
    2008-06-09 14:33:04下载
    积分:1
  • www
    一本将基于近邻传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助(Abstract: A semi-supervised clustering method based on affinity propagation (AP) algorithm is proposed in this paper. AP takes as input measures of similarity between pairs of data points. AP is an efficient and fast clustering algorithm for large dataset compared with the existing clustering algorithms, such as K-center clustering. But for the datasets with complex cluster structures, it cannot produce good clustering results. It can improve the clustering performance of AP by using the priori known labeled data or pairwise constraints to adjust the similarity matrix. Experimental results show that such method indeed reaches its goal for complex datasets, and this method outperforms the comparative methods when there are a large number of pairwise constraints. )
    2011-07-09 11:40:46下载
    积分:1
  • MPI973mod
    消息传递并行编程环境MPI_北京应用物理与计算数学研究所_莫则尧(message passing parallel programming environments MPI Beijing applied physics and computational mathematics Institute _ were Mo Yao)
    2007-01-07 16:19:21下载
    积分:1
  • circle_surface_mpi
    calculate the circle surface using parallel mpi
    2012-12-31 00:41:14下载
    积分:1
  • 696516资源总数
  • 106641会员总数
  • 4今日下载