主路由器:ISP给的,是modem跟路由器一体机。 从路由器:DD-WRT v24-sp2 网络:ADSL 3M/512K,下载保证1.5M,实际大部分时候都能到2.5M以上 应用:VoIP电话;HTPC网络电视如CNTV,PPstream;日常上网浏览,偶尔下载,很少BT 按Repeater Bridge模式要求设置好 http://www.dd-wrt.com/wiki/index.php/Repeater_Bridge 1、不知道该如何理解这句话 ”Also take note of the fact that all repeaters, including this Repeater Bridge mode, will sacrifice half of the bandwidth available from the primary router for clients wirelessly connected to the repeater.“ 我通过从路由器上测试速度,为3M/0.5M,看起来并未像这段话说的要被砍一半下去。 之所以由此担心,源于QoS里面uplink/
h*i
6 楼
any idea?
k*e
7 楼
fidelity my smartcash debit card 在国内什么银行的ATM机上取钱是免手续费的呢??? 另外请问一下,每天最多能取多少.谢谢:)
Constructing Young's Tableau does not offer too much benefit on sorting... for n^2 numbers, the lower bound for comparison-based sorting is 2 n^2 log n (or N log N if N == n^2) given each row/col is sorted, sorting will take in O(N^1.5) N * sqrt(N); N for total numbers, sqrt(N)=n for complexity to extract min from remaining matrix. N*sqrt(N) > N log N ... so i guess it is better just sort it directly.
【在 k*k 的大作中提到】 : Constructing Young's Tableau does not offer too much benefit on sorting... : for n^2 numbers, the lower bound for comparison-based sorting is : 2 n^2 log n (or N log N if N == n^2) : given each row/col is sorted, sorting will take in O(N^1.5) N * sqrt(N); : N for total numbers, sqrt(N)=n for complexity to extract min from remaining matrix. : N*sqrt(N) > N log N ... : so i guess it is better just sort it directly.
【在 k*k 的大作中提到】 : Constructing Young's Tableau does not offer too much benefit on sorting... : for n^2 numbers, the lower bound for comparison-based sorting is : 2 n^2 log n (or N log N if N == n^2) : given each row/col is sorted, sorting will take in O(N^1.5) N * sqrt(N); : N for total numbers, sqrt(N)=n for complexity to extract min from remaining matrix. : N*sqrt(N) > N log N ... : so i guess it is better just sort it directly.
yes... but with additional space for min-heap considering the complexity of constructing such a table in addition to the n ^2 log n sorting complexity... young's table is really not a good way to tackle sorting problem....