摘要: Welcome to the officialcalendar apocalypse! As humans we often forget things easily, such asanniversaries. One thing I’ve learned form my experience is to never forget that date, because once you do your in deep water. Apart from relationships we have many other important events happening in our lif阅读全文
posted @ 2012-05-08 13:31 狼の禅 阅读(314) 评论(1) 编辑
摘要: Here is a overview of the expected transmission count metric (ETX).The earlier metric most commonly used by existing ad hoc routing protocols is minimum hop-count. It assumes that link quality is a binary concept, either the link exists or not. While often true in wired networks, this is not a reaso阅读全文
posted @ 2012-04-27 10:58 狼の禅 阅读(250) 评论(0) 编辑
摘要: 一、算法、理论计算机科学、密码与安全及相关领域STOC:ACM Symp on Theroy of ComputingFOCS:IEEE Symp on Foundations of Computer ScienceLICS: IEEE Symp on Logic in Computer ScienceCRYPTO:Advances in CryptologyCCS:ACM Conf on Comp and Communications SecurityS&P:IEEE Symposium on Security and PrivacyICALP:Intl Conf. on Autom阅读全文
posted @ 2012-04-06 10:43 狼の禅 阅读(193) 评论(0) 编辑
摘要: 【引理】如果p是一个素数的话,那么对任意一个小于p的正整数a,a, 2a, 3a, ..., (p-1)a除以p的余数正好是一个1到p-1的排列。(例如,5是素数,3, 6, 9, 12除以5的余数分别为3, 1, 4, 2,正好就是1到4这四个数。) 【证明】( 反证法)假如结论不成立的话,那么就是说有两个小于p的正整数m和n使得na和ma除以p的余数相同。不妨假设n>m,则p可以整除a(n-m)。但p是素数,那么a和n-m中至少有一个含有因子p。这显然是不可能的,因为a和n-m都比p小。【Fermat小定理(Fermat's Little Theorem)】如果p是素数,a是阅读全文
posted @ 2012-01-18 18:48 狼の禅 阅读(1044) 评论(1) 编辑

