论郑玄《周礼注》中的“复”和“有罪先请”

"复"和"有罪先请"是汉代的两项重要制度,《汉书》、《后汉书》中多有记载。郑玄《周礼注》中也有关于这两项制度的记载,并且列举了多种"复"和"有罪先请"的情况。将郑玄注中的材料与其它文献进行对比,可知彼此可以互证和互补,并能丰富和加深人们对汉代"复"和"有罪先请"的认识。这是郑玄《周礼注》对汉代制度研究的一个重要贡献。

汉代司法程序中的先请与上请辨析

学术界的主流观点是将汉代的先请或上请视为特殊犯罪主体的优遇制度,这种研究对象定位的偏差对先请与上请实质的认识产生了较大障碍。先请与上请事实上均为皇帝权断层面的案件适用的司法程序,是实现皇帝参与和控制司法的重要途径,两者在适用的犯罪主体、案件处理的司法阶段、向皇帝请示的内容和司法功能上均有根本性的区别。先请适用于官僚贵族犯罪案件,是劾罪官员向皇帝奏请治罪的程序,使皇帝对特殊身份主体犯罪案件拥有了司法管辖权;而上请适用于各种特殊案件,是司法审理机构就拟定判决向皇帝请示的程序,使皇帝对特殊案件拥有最终裁决权。

论汉代“先请”制

随着"刑不上大夫"原则的复归,汉时贵族官吏减免刑罚的先请制产生并不断完善,由最初的荣宠之举发展为官吏的普遍特权,不满六百石之墨绶长、相也被包括在内。违反先请,不经皇帝裁决擅自处理,要受到惩处。汉时先请,就对象和程序而言,与后世八议关系密切。

如果深爱，请先低头

同学聚会，听说原本不参加的他临时从深圳飞来，她几乎一路跑着赶到酒店。名义上是一群人的相聚。但可以说，她只为一人而来。已经分手六年，分手时，她决绝转身，一起去过的地方，一律绕着走，和他的“界限”划得严格分明。

Peer priority based data scheduling algorithm in P2P streaming system

In order to solve the problem that the existing data scheduling algorithm cannot make full use of neighbors' bandwidth resources when allocating data request among several senders in the multisender based P2P streaming system,a peer priority based scheduling algorithm is proposed.The algorithm calculates neighbors' priority based on peers' historical service evaluation as well as how many wanted data that the neighbor has.The data request allocated to each neighbor is adjusted dynamically according to the priority when scheduling.Peers with high priority are preferred to allocate more data request.Experiment shows the algorithm can make full use of neighbors' bandwidth resources to transmit data to reduce server pressure effectively and improve system scalability.