示例1：实现点击+号显示下面的行，展开了以后变成“—”号，点击“—”号 ，内容隐藏。DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"Untitled Pagefunction collapse_Click(sender) {var tr = sender;while(tr.nodeName != "TR")tr = tr.parentNode;var display;if(sender.value == "+") {display = document.uniqueID ? "block" : "table-row";sender.value = "-" ;}else {display = "none";sender.value = "+" ;}while(true) {tr = tr.nextSibling;if(tr == null)break;if(tr.nodeType == 1)tr.style.display = display;}}idname1aaasexb ...继续阅读 (19)

<< My review of Day 1.I am summarizing all of the days together since each talk was short, and I was too exhausted to write a post after each day. Due to the broken-up schedule of the KDD sessions, I group everything together instead of switching back and forth among a dozen different topics. By far the most enjoyable and interesting aspects of the conference were the breakout sessions.KeynotesKDD 2011 featured several keynote speeches that were spread out among three days and throughout the day. This year’s conference had a few big names.Steven Boyd, Convex Optimization: From Embedded R ...继续阅读 (82)

I have been waiting for the KDD conference to come to California, and I was ecstatic to see it held in San Diego this year.AdMelddid an awesome job displaying KDD ads on the sites that I visit, sometimes multiple times per page. That’s good targeting!Mining and Learning on Graphs Workshop 2011I had originally planned to attend the 2-day workshopMining and Learning with Graphs (MLG2011)but I forgot that it started on Saturday and I arrived on Sunday. I attended part of MLG2011 but it was difficult to pay attention considering it was my first time waking up at 7am in a long time. The first ...继续阅读 (71)

I woke up early and cheery Wednesday morning to attend the2011 Hadoop Summitin Santa Clara, after a long drive from Los Angeles and theBig Data Campthat lasted until 10pm the night before. Having been toHadoop Summit 2010, I was interested to see how much of the content in the conference had changed.This year, there were approximately 1,600 participants and the summit was moved a few feet away to the Convention Center rather than the Hyatt. Still, space and seating was pretty cramped. That just goes to show how much the Hadoop field has grown in just one year.KeynotesWe first heard a series of ...继续阅读 (88)

It has been a while since I have been to Silicon Valley, butHadoop Summitgave me the opportunity to go. To make the most of the long trip, I also decided to check outBigDataCampheld the night before from 5:30 to 10pm. Although the weather was as predicted, I was not prepared for the deluge of pouring rain in the end of June. The weather is one of the things that is preventing me from moving up to Silicon Valley.The food/drinks/networking event must have been amazing because it was very difficult to get everyone to come to the main room to start the event! We started with a series of lightning ...继续阅读 (52)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2688/**//*题意：给定一串长度为N的序列(N <= 3000000)，然后是M(M<=10000)个操作，每个操作有两种形式：1. Q 询问当前序列的顺序数2. R S E (abs(E-S) <= 1000)将下标S到E的数列向左循环旋转一次题解：树状数组思路：经典问题，首先将N个数的顺序数用树状数组求出来，这个操作是nlogn的，然后对于每次R操作，统计在[S+1，E]区间中比v[S]大的数和小的数的个数，将之前的顺序数 - 比它大的数 + 比它小的数，更新这个值。然后顺序赋值即可。Q操作只需要直接输出当前顺序数的值即可。*/#includeusingnamespacestd;#definemaxn 10001intans[3000001];intn, m;#definell __int64ll c[maxn];intlowbit(intx){returnx&(-x);}voidadd(intpos){while(pos0){s+=c[pos];pos-=lowbit(pos);}returns;}intmain(){inti;while(scanf("%d",&n;)!=EOF){for(i=1; i<=10000; i++)c[i]=0;ll val=0;for(i=0; ...继续阅读 (34)

题目链接：http://poj.org/problem?id=2828/**//*题意：给定N(1 <= N <= 200000)个整数对(A,B)，表示在A右边的位置插入一个B，经过N次操作后问最后的B序列的排列情况。题解：树状数组 或者 线段树思路：这题的数据量比较大，一开始可以模拟一下过程，但是直接暴力肯定是超时的，因为每次插入过程，这个位置的后面的元素必然是要顺序往后移动的。所以总的复杂度高达O(n^2)。但是这个问题可以转化，我们这样考虑，对于任意两个整数对(A1,B1)和(A2,B2)保证(A1,B1)在(A2,B2)之前出现，如果A1小于A2，后面的整数对是不影响前面整数对的位置关系的，否则B1的位置必然要受到B2的影响而向后移动一位。于是A1和A2之间就存在一个逆序关系，我们可以联想到树状数组求逆序数时候的做法，从后往前，对于最后一个数，它的位置就是An，因为之后没有插入数了，它已经稳定下来了，然后将这个位置插入到树状数组的相应位置去，每次扫描到当前数的时候二分枚举当前数前面有多少“空位”，空位的统计可以采用树状数组的成段求和，找到后将这个数插入，N次操作后答案就保存下来了。*/#includeusingnamespacestd;#definemaxn 200010intn;intc[maxn];structpoint{intA, B;}pt ...继续阅读 (49)

-- =============================================-- Author:    <maco_wang>-- Create date: <2011-03-22>-- Description: <SQL位移运算函数>-- =============================================go--创建函数createfunctiondisplacement(@nasbigint,@masvarchar(3))returnsintasbegin   declare@macovarchar(50);set@maco=''   declare@iint   declare@xint   declare@sint   while(@n<>0)   begin     set@maco=@maco+convert(char(1),@n%2)     set@n=@n/2 ...继续阅读 (12)

一般习惯使用for循环，在一年前写cgi的时候，还为这郁闷过一阵：for i incat ip时，会自动的把文件中每行内容按照空格分割传递，最后采用先把空格改成+号的方式解决。今天看CU，发现也有人提出这个问题，而解决办法很简单——用while循环即可。另，while循环有两个用法，cat awhile read和while;do;done下面是示例：[root@localhost ~]# cat info a b c d [root@localhost ~]# for i incat info;do echo $i;done a b c d [root@localhost ~]# i=123;while read i;do echo $i;done[root@localhost ~]# i=12;cat info |while read i;do echo $i;done;echo $i a b c d 12 [root@localhost ~]#另，看到一个网站，专门介绍单行shell命令的，对SA来说，比较有用，url如下：http://www.commandlinefu.com/commands/browse ...继续阅读 (21)

一般习惯使用for循环，在一年前写cgi的时候，还为这郁闷过一阵：for i incat ip时，会自动的把文件中每行内容按照空格分割传递，最后采用先把空格改成+号的方式解决。今天看CU，发现也有人提出这个问题，而解决办法很简单——用while循环即可。另，while循环有两个用法，cat awhile read和while;do;done<a，pipe方式的变量，仅在循环内有效，又是一个区别~~下面是示例：[root@localhost ~]# cat infoa b c d[root@localhost ~]# for i incat info;do echo $i;doneabcd[root@localhost ~]# i=123;while read i;do echo $i;done<info;echo $ia b c d[root@localhost ~]# i=12;cat info |while read i;do echo $i;done;echo $ia b c d12[root@localhost ~]#另，看到一个网站，专门介绍单行shell命令的，对SA来说，比较有用，url如下：http://www.commandlinefu.com/commands/browse ...继续阅读 (29)

这篇文章详细剖析了为什么在多核时代进行多线程编程时需要慎用volatile关键字。主要内容有：1. C/C++中的volatile关键字2. Visual Studio对C/C++中volatile关键字的扩展3. Java/.NET中的volatile关键字4. Memory Model（内存模型）5. Volatile使用建议1. C/C++中的volatile关键字1.1 传统用途C/C++作为系统级语言，它们与硬件的联系是很紧密的。volatile的意思是“易变的”，这个关键字最早就是为了针对那些“异常”的内存操作而准备的。它的效果是让编译器不要对这个变量的读写操作做任何优化，每次读的时候都直接去该变量的内存地址中去读，每次写的时候都直接写到该变量的内存地址中去，即不做任何缓存优化。它经常用在需要处理中断的嵌入式系统中，其典型的应用有下面几种：a. 避免用通用寄存器对内存读写的优化。编译器常做的一种优化就是：把常用变量的频繁读写弄到通用寄存器中，最后不用的时候再存回内存中。但是如果某个内存地址中的值是由片外决定的（例如另一个线程或是另一个设备可能更改它），那就需要volatile关键字了。（感谢Kenny老师指正）b. 硬件寄存器可能被其他设备改变的情况。例如一个嵌入式板子上的某个寄存器直接与一个测试仪器连在一起，这样在这个寄存器的值随时可能被那个测试仪器更改。在这种情况下 ...继续阅读 (39)

大整数的加法。与以前高精度算法不同的是这次要一下子读入一个算式。然后简便的是，这次不用再交换顺序了，直接加。但是结果的判断稍微麻烦一点，要把开头的0都去掉才行。一下是我的代码。哎，刚开始把自己弄得挺混乱的，后来愤怒了，就把所有代码全删掉重新写了一遍。然后一次AC#include#include#includeusing namespace std;char a[12],b[12],c[12];char temp[25];bool add(char *first,char *second){int len1=strlen(first);int len2=strlen(second);first[len1]='0';int i,j;for(i=0;i{second[i]-='0';}for(j=0;j<=len1;j++){first[j]-='0';}for(i=0;i{first[i]+=second[i];}for(i=0;i{if(first[i]>=10){first[i+1]+=first[i]/10;first[i]%=10;}}for(i=0;i<=len1;i++)first[i]+='0';while(first[len1]=='0')len1--;int len3=strlen(c);len3--;while(c[len3]=='0')len3--;if(len1 ...继续阅读 (14)

之前的purge脚本usage是./purge.pl “url1” “url2”。如果url变成成百上千个那么多的时候，这样就不行了。也需要在脚本中处理成文件句柄。修改如下：```perl#!/usr/bin/perl -wuse IO::Socket;unless (@ARGV == 2) { die “usage: $0 ip.list url.list” }open(HOST,”<$ARGV[0]”)||die “cannot open the ip list”;open(URL,”<$ARGV[1]”)||die “cannot open the url list”;$EOL = “15121512”;while (defined($ip=)){ seek URL, 0, 0; while (defined($uri=)){ $remote = IO::Socket::INET->new( Proto => "tcp", PeerAddr  => ...继续阅读 (26)

之前的purge脚本usage是./purge.pl “url1” “url2”。如果url变成成百上千个那么多的时候，这样就不行了。也需要在脚本中处理成文件句柄。修改如下：#!/usr/bin/perl -wuseIO::Socket;unless(@ARGV==2){die"usage: $0 ip.list url.list"}open(HOST,"<$ARGV[0]")||die"cannot open the ip list";open(URL,"<$ARGV[1]")||die"cannot open the url list";$EOL="15121512";while(defined($ip=)){seekURL,0,0;while(defined($uri=)){$remote=IO::Socket::INET->new(Proto=>"tcp",PeerAddr=>$ip,PeerPort=>"80",);unless($remote){die"cannot connect to http daemon on $ip"}$remote->autoflush(1);print$remote"PURGE $uri HTTP/1.0".$EOL;while(<$remote>){print}close$remote;}} ...继续阅读 (31)

在写sh脚本的时候，常常需要运行时输入一些数据。之前已经知道用基本的$*，执行的情况，大概就是$0 $1 $2 $3……那么，那些系统命令里的参数又是怎么做出来的呢？我们自己的脚本如何搞出来$0-$1的效果呢？这就是getopts的作用了。举例如下：bash #!/bin/bash echo "OPTIND starts at $OPTIND" while getopts ":pq:" optname do case "$optname" in "p") echo "Option $optname is specified" ;; "q") echo "Option $optname has value $OPTARG" ;; "?") echo "Unknown option $OPTARG" ;; ":") echo "No argument value for option $OPTARG" ;; *) # Should not occur echo "Unknown error while processing options" ;; esac ...继续阅读 (15)

在写sh脚本的时候，常常需要运行时输入一些数据。之前已经知道用基本的$*，执行的情况，大概就是$0 $1 $2 $3…… 那么，那些系统命令里的参数又是怎么做出来的呢？我们自己的脚本如何搞出来$0-$1的效果呢？这就是getopts的作用了。举例如下：#!/bin/bashecho"OPTIND starts at $OPTIND"whilegetopts":pq:"optnamedocase"$optname"in"p")echo"Option $optname is specified";;"q")echo"Option $optname has value $OPTARG";;"?")echo"Unknown option $OPTARG";;":")echo"No argument value for option $OPTARG";;*)# Should not occurecho"Unknown error while processing options";;esacecho"OPTIND is now $OPTIND"done在使用getopts命令的时候，shell会自动产生两个变量OPTIND和OPTARG。OPTIND初始值为1，其含义是下一个待处理的参数的索引。只要存在，getopts命令返回true，所以一般getopts命令使用while循环；OPTAR ...继续阅读 (16)

/*data:2007 -1 - 7 by:snowhillchar *s="abcdefhighcbcccfghiabcdefghikl";char *T="cbcbc"; next[]的值应为:    -1,0,0,1,2如果char *T="cbccc";next[]的值应为: -1,0,0,1,1next[]的求法相当于T自身的一个模式匹配在KMP_Find()中 如果J的值大于T的长度则查找成功*/#include"iostream.h"intlength(char*s){inti=0;while(s[i]!=NULL)i++;returni;}voidget_next(char*T,int*next){inti=0, j=-1;next[0]=-1;while(i<<"i="<<<"j="<<<<<"\t";cout<<<"k="<<=length(T))  cout<<"查找完毕!未找到"<<<"查找成功!";}/*原始查找算法*/voidfind(char*s,char*T){inti=0,j=0,k=length(s);if(j<<"find is sucess!"<<<"error!" ...继续阅读 (35)

#include"iostream.h"voidmain(){intn=1,sum=0;cout<<"int inquire"<<<"bytes"<<=4294967295) {sum+=n; n++;}cout<<"n=" ...继续阅读 (28)

#include"iostream.h"voidquick_sort(intlist[],intleft,intright){inti=left,j=right,temp=list[i];while(itemp)) j--;list[i]=list[j];while((i<=temp)) i++;list[j]=list[i];}list[i]=temp;if(left ...继续阅读 (38)