没有合适的资源？快使用搜索试试~ 我知道了~

首页Think Complexity，2nd Edition

Think Complexity，2nd Edition

人工智能

需积分: 10 63 浏览量更新于2023-05-23 评论 1 收藏 6.29MB PDF 举报

身份认证购VIP最低享 7 折!

领优惠券(最高得80元）

试读

228页

复杂性科学使用计算来探索物理和社会科学。在Think Complexity中，您将使用图形，细胞自动机和基于代理的模型来研究物理学，生物学和经济学中的主题。无论您是中级Python程序员还是计算建模专业的学生，您都可以通过一系列实例，练习，案例研究和易于理解的解释深入研究复杂系统的示例。

资源详情

资源评论

资源推荐

Think Complexity

Version 2.6.2

www.iebukes.com

Think Complexity

Version 2.6.2

Allen B. Downey

Green Tea Press

Needham, Massachusetts

www.iebukes.com

2016 Allen B. Downey.

Green Tea Press

9 Washburn Ave

Needham MA 02492

Permission is granted to copy, distribute, transmit and adapt this work under a

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

License: https://thinkcomplex.com/license.

If you are interested in distributing a commercial version of this work, please

contact the author.

The L

X source for this book is available from

https://github.com/AllenDowney/ThinkComplexity2

www.iebukes.com

剩余227页未读，继续阅读

代码解读，zaiwei_complexity=zaiwei.complexity_fuzhinci; sum_zaiwei_complexity=sum(zaiwei_complexity,2); sum_zaiwei_geshu=sum(zaiwei,2); mean_zaiwei_complexity=sum_zaiwei_complexity./sum_zaiwei_geshu;product_num=ones(1,col); mean_zaiwei_complexity_fuzhinci=kron(mean_zaiwei_complexity,product_num); mean_zaiwei_complexity_fuzhinci_tiaoxunjinru=mean_zaiwei_complexity_fuzhinci.jinru_tihuan;

这段代码的功能是计算一个名为“zaiwei”的矩阵与名为“complexity_fuzhinci”的矩阵的乘积，并将结果存储在名为“zaiwei_complexity”的矩阵中。然后，它计算“zaiwei_complexity”矩阵每行的总和，并将结果存储在名为“sum_zaiwei_complexity”的向量中。接下来，它计算“zaiwei”矩阵每行的总和，并将结果存储在名为“sum_zaiw

Problem Solving in Data Structures & Algorithms Using Java, 2nd Edition

Problem Solving in Data Structures & Algorithms Using Java, 2nd Edition By 作者: Hemant Jain Pub Date: 2018 ISBN: n/a Pages: 649 Language: English Format: EPUB/AZW3 Size: 10 Mb ASIN: B07HRNP1WW Book

代码解读，xlswrite('A_science_city_complexity.xlsx',city_complexity,'Sheet1','F2'); [num,txt,AAA]=xlsread('rca_2000.xlsx','Sheet1','A1:E306'); xlswrite('A_science_city_complexity.xlsx',AAA,'Sheet1','A1'); [num1,txt1]=xlsread('biaotou_city.xlsx','Sheet1','F1:T1'); xlswrite('A_science_city_complexity.xlsx',txt1,'Sheet1','F1');

这段代码是用 MATLAB 编写的，主要功能是将数据写入 Excel 文件中。具体来说，第一行代码将名为 city_complexity 的变量写入名为 A_science_city_complexity.xlsx 的 Excel 文件的 Sheet1 中的 F2 单元格中。第二行代码从名为 rca_2000.xlsx 的 Excel 文件的 Sheet1 中读取数据，并将其存储在 num、txt

A Low Complexity Algorithm for Generating Turbo.pdf

请翻译成英文：因交换函数时间复杂度为常数，该程序的时间复杂度取决于循环和递归函数，它们的时间复杂度分别记为O(n)和T(n-1)，那么整体时间复杂度为：T(n) = nT(n-1)

The time complexity of the program depends on the loop and recursion functions, which are respectively recorded as O(n) and T(n-1). Therefore, the overall time complexity is: T(n) = nT(n-1) Translati

1. Complexity [20 marks] (A)Prove that is both and . [4 marks] (B)Consider the following functions of . Put them in order from smallest to largest asymptotic growth rate. [8 marks] (C)Let be the processing time of an algorithm for the input of size . Which is the asymptotic time complexity of this algorithm, or ? Please show your working to justify your answer. [8 marks]

A：证明既是又是。[4 分] B：考虑的以下函数。将它们按从最小到最大的渐近增长率排序。[8 分] C：让是算法对输入大小的处理时间。该算法的渐近时间复杂度是还是？请出示您的计算步骤以证明您的答案。[8 分]

Spring Python 1.1

# Author: Greg Lee Turnquist # Paperback: 264 pages # Publisher: Packt Publishing; 1st New edition edition (May 21, 2010) # Language: English # ISBN-10: 1849510660 # ISBN-13: 978-1849510660 Amazon 的介

Write a program to realize various basic operations of the sequence List. For a given character array a[]={'1','2','3','1','1','0','4','2','3','1', '0','4','2'}, create a sequence List L, delete elements that have values between '2' and '3'. The time complexity is required to be O(n), and the space complexity is O(1).

答：可以使用双指针算法来解决该问题。首先，建立一个顺序列表L，将a[]中的元素按顺序插入到L中；然后，定义两个指针i和j，分别指向L的头部和尾部；然后，从头向尾遍历L，当遇到值在2和3之间的元素时，将其删除，并将j指针前移一位；最后，将i指针的元素和j指针的元素交换，然后将i指针后移一位，重复上述操作，直到i指针指向最后一个元素，即可完成删除操作。这样，每次只需要交换一次元素，因此算法的时间复杂

We also assessed the computational efficiency of our subsampling method. The computations were carried out using R (R Core Team, 2021) on a desktop computer with 64GB memory. We restricted the calculations to access one CPU core and recorded the average CPU time from ten repetitions. Table 5 reports the results for Case I, where the subsample size is r = 1000. The computational speed of the OSP estimator is much faster than that of the full data estimator. Particularly, the computational burden of the full data method gets heavier as the increase of full data sample size. The computation time of the full data estimator increases in a polynomial order of n which agrees with the theoretical time complexity of O(n2). This full data time complexity is different from linear models (Wang et al., 2019) or logistic regression models (Wang et al., 2018), for which the time complexity is linear in sample size, i.e., O(n). In other words, subsampling is more desirable in Cox’s regression because it reduce the computational cost more significantly. The UNIF estimator is faster to compute than the OSP estimator, because it does not need the step of calculating the sampling probabilities, but it has a lower estimation efficiency as we have seen in previous

我们还评估了我们的子采样方法的计算效率。计算是使用 R（R Core Team, 2021）在一台配有64GB内存的台式电脑上进行的。我们限制计算只能访问一个 CPU 核心，并记录了十次重复的平均 CPU 时间。表5报告了情况 I 的结果，其中子样本大小为 r=1000。 OSP 估计量的计算速度比全数据估计量快得多。特别是，随着全数据样本大小的增加，全数据方法的计算负担也随之增加。全数据估计量的

TsiuHinghiok

粉丝: 5
资源: 64

上传资源快速赚钱

我的内容管理收起

我的资源快来上传第一个资源

我的收益

登录查看自己的收益

我的积分登录查看自己的积分

我的C币登录后查看C币余额

我的收藏

我的下载

下载帮助

会员权益专享

Think Complexity，2nd Edition

评论0

会员权益专享

最新资源

Think Complexity，2nd Edition

评论0

Problem Solving in Data Structures & Algorithms Using Java, 2nd Edition

A Low Complexity Algorithm for Generating Turbo.pdf

computational complexity

cyclomatic complexity

cost_complexity_pruning_path

cognitive complexity of method

Domain Modeling Made Functional Tackle Software Complexity with 无水印原版pdf

Combinatorial optimization algorithms and Complexity（组合最优化算法和复杂性） EN part2.pdf

rademacher complexity

Algorithm And Complexity 《算法和复杂度》（英文版）

请翻译成英文：因交换函数时间复杂度为常数，该程序的时间复杂度取决于循环和递归函数，它们的时间复杂度分别记为O(n)和T(n-1)，那么整体时间复杂度为：T(n) = nT(n-1)

Spring Python 1.1

会员权益专享

最新资源