- 博客(126)
- 资源 (5)
- 收藏
- 关注
RSS订阅原创 peersim中bittorrent源码分析？
最近在忙着写毕业论文，只剩一个月了实验还没搞定。。。方向是网络编码，需要在peersim模拟器下修改BitTorrent源码实现，然后发现官网上BitTorrent源码有个明显的问题为什么没人提啊，让我纠结那么久。在BT中，发送节点在收到请求节点的请求后会发生所请求的文件块，前提是要发送节点拥有请求节点请求的那个文件块，没有请求节点请求的文件块发个空气啊。源码中总共有6个地方会
2017-03-11 14:01:12
1366
1
转载 GloVe学习之Python中简单的词向量SVD分解
GloVe原理还没搞清楚，先用Python学着跑跑小程序好了。语料：I like deep learning. I like NLP.I enjoy flying.其中words=["I","like","enjoy","deep","learning","NLP","flying","."]上下文相关矩阵：X=np.array([[0,2,1,
2016-10-26 20:23:47
3172
原创 Objective-C App开发基础之pod install无限阻塞在Setting up CocoaPods master repo的情况
$ pod install只会按照Podfile的要求来请求类库，在本地，输入$ pod install ，出现一直阻塞在Setting up CocoaPods master repo的情况。在 ~/.cocoapods目录下，用du sh * 查看repos的大小，一直停留存在56k，然后过一段时间，大小变为0B，同时，pod install指令终止，并出现[!] Unabl
2016-10-20 13:52:56
1558
原创 求职之测试开发技能准备
负载测试负载测试（Load testing），通过测试系统在资源超负荷情况下的表现，以发现设计上的错误或验证系统的负载能力。在这种测试中，将使测试对象承担不同的工作量，以评测和评估测试对象在不同工作量条件下的性能行为，以及持续正常运行的能力。负载测试的目标是确定并确保系统在超出最大预期工作量的情况下仍能正常运行。此外，负载测试还要评估性能特征。例如，响应时间、事务处理速率和其他与时间相关的方面
2016-10-17 21:20:01
13860
原创 求职资料整理
今年春招，找实习欲仙欲死，现在转正拿了正式校招offer，把这小半年整理的资料和大家分享一下。目标岗位：测试开发背景：熟悉C++、数据结构和算法，会用java、python、js，信息安全方向，项目经验弱。。。方法：刷题＋总结1.C++
2016-10-05 17:06:37
699
原创 求职之面试题总结
不保证答案是正确的，大部分是从网上搜罗的各种面试题。以下是2016.3月份实习面试题1.如何判断程序发生了内存溢出存在内存溢出的模块，每次运行时，所占内存都会增加，在一直运行这个程序的时候，会发现内存线呈现锯齿形递增状态。2.把手机内容投屏到电视上，请写出测试案例没考虑到基本情况：电池，发热，流量都没有考虑到，还有投屏的时延，响应速度等。没有从用户的角度考虑要关
2016-10-05 17:05:31
461
原创 求职之操作系统
1.进程通信机制2.3.1 管道 管道是进程间通信中最古老的方式，它包括无名管道和有名管道两种，前者用于父进程和子进程间的通信，后者用于运行于同一台机器上的任意两个进程间的通信。 2.3.2 消息队列 消息队列用于运行于同一台机器上的进程间通信，它和管道很相似，是一个在系统内核中用来保存消息的队列，它在系统内核中是以消息链表的形式出现。
2016-10-05 16:57:30
436
原创 求职之计算机网络
1.计算机网络面试常考OSI，TCP/IP，五层协议的体系结构，以及各层协议OSI分层 （7层）：物理层、数据链路层、网络层、传输层、会话层、表示层、应用层。TCP/IP分层（4层）：网络接口层、 网际层、运输层、 应用层。五层协议 （5层）：物理层、数据链路层、网络层、运输层、 应用层。每一层的协议如下：物理层：RJ45、CLOCK、IEEE802.3
2016-10-05 15:50:19
1443
1
原创 求职之Linux基础
1.Linux下查看系统资源和负载1.查看磁盘df -h2.查看内存free3.查看cpucat /proc/cpuinfo4.查看系统内存cat /proc/meminfo5.查看负载wuptime6.查看系统整体状态top2.grepgrep 单词 filenamegrep 'tes
2016-10-05 15:40:45
492
1
原创 排序算法总结
名字最好O(n)平均O(n)最坏O(n)时间复杂度是否与初始顺序有关是否稳定空间复杂度算法描述选择排序O(n^2)O(n^2)O(n^2)Yes NoO(1)每一趟从待排序的记录中选出关键字最小的记录，顺序放在已排好序的子文件的最后，直到全部记录排序完毕。常用的选
2016-10-05 15:26:41
331
原创 求职之C++小知识点整理
1.顺序容器1.顺序容器：vector,deque,list,forward_list,array,string。其中除list和forward_list外，其它都支持快速随机访问。 dequeint>a={1,2,3,4,5,6}; couta[4]endl;2.通常使用vector
2016-10-05 15:24:53
1053
原创 求职之C++牛客网刷题总结
把平时在印象笔记上记录的内容分享一下。。。1.必须使用初始化列表的情况： 1>常量成员const：常量成员只能初始化不能赋值 2>引用类型：必须在定义时初始化，并且不能重新赋值 3>没有默认构造函数的类类型：因为使用初始化列表可以不必调用默认构造函数来初始化，而是直接调用拷贝构造函数初始化。2.小端模式高地址存放高位，低地址存放低
2016-10-01 16:10:10
2346
原创 一个关于spark streaming+flume的小应用
这是这个学期的分布式课程是小作业，虽然期末展示的时候被老师说这个小应用与分布式没多大关系，不管怎样我也是花时间做的，所以拿出来分享一下。
2016-10-01 15:58:26
873
原创 C++编程练习
字符的左右移动题目字符串是任意的＊和字母的组合，设计算法，把＊都移到最左边，字母都移到最右边且保持相对顺序不变。实现逆序处理字符串。双指针，一个指针alpha最初指向最右边的字符，另一个last指针最初指向最右边的＊。当alpha指向字母时，就和last指向的字符互换，并且这两个指针同时向左移一位。当alpha指向＊时，只有alpha向左移动一位。当alpha<0时，结束。代码void
2016-01-08 21:42:11
955
原创 回文字符串切割问题
问题描述对任意一个字符串进行切割，使得切割后的每一个字符串都是回文字符串。列出切割后的所有结果。方法一：深度优先搜索以string s的下标调用dfs函数，index表示当前要开始切割的下标，i表示目前要切割的终点位置，其中index<=i//判断是否是回文bool isPalindrome(string &s){ for(int i=0;i<s.length()/2;i++)
2016-01-08 19:46:04
1102
原创 最长回文子串
方法一:分治回文有两种类型：奇数长度的回文和偶数长度的回文字符串表示为s,s的最长回文子串用ans表示。奇数长度回文：以i为对称中心，对称半径为j(j>=0)(i-j) ... i ... (i+j) 总长度是2j-1在i-j和i+j在合理范围内时，如果有s[i-j]==s[i+j],而且ans的长度小于2j-1,则令ans=s.substr(i-j,2j-1),然后j++,继续比较s[i
2016-01-08 19:44:41
425
转载 UnicodeEncodeError: 'gbk' codec can't encode character '\xa0' in position ... 问题解决办法之一
使用Python写文件的时候，或者将网络数据流写入到本地文件的时候，大部分情况下会遇到：UnicodeEncodeError: 'gbk' codec can't encode character '\xa0' in position ... 这个问题。 网络上有很多类似的文件讲述如何解决这个问题，但是无非就是encode，decode相关的，这是导致该问题出现的真正原因吗？不是的。 很多时候，我
2016-01-04 11:02:37
11294
1
原创 Project Euler：Problem 93 Arithmetic expressions
By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, *, /) and brackets/parentheses, it is possible to form different positiv
2015-07-26 17:25:46
1291
1
原创 Project Euler：Problem 92 Square digit chains
A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.For example,44 → 32 → 13 → 10 → 1 → 185 → 89 → 145 → 42
2015-07-26 14:12:17
751
原创 Project Euler：Problem 91 Right triangles with integer coordinates
The points P (x1, y1) and Q (x2, y2) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.There are exactly fourteen triangles containing a right angle that
2015-07-25 22:40:31
1069
原创 Project Euler：Problem 90 Cube digit pairs
Each of the six faces on a cube has a different digit (0 to 9) written on it; the same is done to a second cube. By placing the two cubes side-by-side in different positions we can form a variety of
2015-07-24 21:27:52
873
原创 Project Euler：Problem 89 Roman numerals
For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is alw
2015-07-24 16:44:36
812
原创 Project Euler：Problem 88 Product-sum numbers
A natural number, N, that can be written as the sum and product of a given set of at least two natural numbers, {a1, a2, ... , ak} is called a product-sum number: N = a1 + a2 + ... + ak = a1 × a2 ×
2015-07-23 22:35:52
1374
1
原创 Project Euler：Problem 87 Prime power triples
The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way:28
2015-07-23 20:59:37
760
原创 Project Euler：Problem 86 Cuboid route
A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest "straight line" distance fr
2015-07-22 17:04:37
878
原创 Project Euler：Problem 85 Counting rectangles
By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:Although there exists no rectangular grid that contains exactly two million rectangles,
2015-07-22 15:02:29
708
原创 Project Euler：Problem 84 Monopoly odds
In the game, Monopoly, the standard board is set up in the following way:GOA1CC1A2T1R1B1CH1B2B3JAILH2 C1T2 U1H1 C2CH3 C3R4
2015-07-22 13:40:00
1048
原创 Project Euler：Problem 83 Path sum: four ways
In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to 2297.⎛⎝⎜⎜⎜⎜⎜⎜1312016305378
2015-07-21 21:51:52
1002
原创 Project Euler：Problem 82 Path sum: three ways
The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red an
2015-07-21 16:07:11
1204
原创 Project Euler：Problem 81 Path sum: two ways
In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427.⎛⎝⎜⎜⎜⎜⎜⎜1312016305
2015-07-20 20:39:38
749
原创 Project Euler：Problem 80 Square root digital expansion
It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all.T
2015-07-20 14:35:00
504
原创 Project Euler：Problem 79 Passcode derivation
A common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may ask for the 2nd, 3rd, and 5th chara
2015-07-20 13:58:11
1029
3
原创 Project Euler：Problem 78 Coin partitions
Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.
2015-07-19 14:31:15
1019
原创 Project Euler：Problem 77 Prime summations
It is possible to write ten as the sum of primes in exactly five different ways:7 + 35 + 55 + 3 + 23 + 3 + 2 + 22 + 2 + 2 + 2 + 2What is the first value which can be written as the sum o
2015-07-18 17:26:31
855
原创 Project Euler：Problem 76 Counting summations
It is possible to write five as a sum in exactly six different ways:4 + 13 + 23 + 1 + 12 + 2 + 12 + 1 + 1 + 11 + 1 + 1 + 1 + 1How many different ways can one hundred be written as a su
2015-07-18 16:46:12
904
原创 Project Euler：Problem 75 Singular integer right triangles
It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples.12 cm: (3,4,5)24 cm: (6
2015-07-18 15:53:08
990
原创 Project Euler：Problem 74 Digit factorial chains
The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:1! + 4! + 5! = 1 + 24 + 120 = 145Perhaps less well known is 169, in that it produces the
2015-07-17 19:21:49
791
原创 Project Euler：Problem 73 Counting fractions in a range
Consider the fraction, n/d, where n and d are positive integers. If nd and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of reduced proper fractions for d ≤ 8 in ascending or
2015-07-17 16:45:40
593
原创 Project Euler：Problem 72 Counting fractions
Consider the fraction, n/d, where n and d are positive integers. If nd and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of reduced proper fractions for d ≤ 8 in ascending or
2015-07-17 14:01:38
964
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人