用电子衍射说明不确定关系电子经过缝时的位置不确定Δx=b一级最小衍射角

Disioint-set data structure (Union-Find) Problem: maintain a dynamic collection of pairwise-disjoint sets S=(S Each set S; has one element distinguished as the representative element, rep[sil lust support 3 operations

Fixed -universe successor problem Goal: maintain a dynamic subset s of size n of the universe 0=10, 1,.,u-1 of size u subject to these operations INSERT(X∈U\\S): Add x to s DELETE(X E S): Remove x from S

a weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket An adversary can pick all keys from tkeU: h(k)=i for some slot i IDEA Choose the hash function at random independently of the keys

Ch. 3 Estimation 1 The Nature of statistical Inference It is argued that it is important to develop a mathematical model purporting to provide a generalized description of the data generating process. A prob bility model in the form of the parametric family of the density functions p=f(:0),0E e and its various ramifications formulated in last chapter

改造积分定义的目的一是为了扩展可积范围,二是为了使得操作更方便。对 (R)积分而言,积分与极限交换顺序需要验证一个较为苛刻的条件:“fn(x)在E 上一致收敛于f(x)”,将“一致收敛”削弱为“处处收敛”甚至“几乎处处收 敛”是一种思路,在此介绍另一种削弱“一致收敛”条件的方法 从集合论的角度讲:“fn(x)在E上一致收敛于f(x)”是指0>0,No >0,当n>N时,E[|fn(x)-f(x)|≥0]=中,之所以我们认为“一致收敛” 条件苛刻,就在于它要求E[|fn(x)-f(x)≥0]从某项以后永远为空集

参数估计的内容: 1、点估计(Point Estination):估计未知参数的值 2、区间估计(Interval Estimation):估计未知参数的估计值的精确性和可靠性 0=θ+△ 本章介绍统计学中的参数估计的一些基本概念和方法

推导Ely=M(x);积分法的求解过程;边界条件的建立;光滑连续条件的确定;叠加 法