基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Parameter Uncertainty and Policy Intensity: Some Extensions and Suggestions for Further Work

The effects of parameter uncertainty on optimal policy have been a matter of interest for academics, and even for some policymakers, for a long time. Two lines of literature have developed analytical results on this matter. The first line uses static models and the second dynamic models. In this dynamic line most of the results are confined to models with a single state and a single control variable. In this paper we want to encourage the analysis of more general dynamic cases. To do so, the results in the dynamic line are extended from one-state and one-control finite horizon models to models with a pair of control variables. We then discuss some of the hurdles which must be surmounted for the results to be made more general and suggests some lines for further research. JEL classification: C61; E61     

一种自动布线方法：多级线探索法

本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念，通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法，但有较传统线探索法更强的探索能力，不需要结合李氏算法而能单独完成布线任务，是一种较理想的算法，通过实验获得了较为满意的效果。     

一种支持QoS的拓扑自适应动态组播路由算法

YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开，同时为接收方提供多个可选择的组播接入路径，以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长，可扩展性不好等问题。本文在分析这些算法的基础上，提出改进的支持QoS的动态组播路由算法，即拓扑自适应动态组播路由（Topology Adaptive Dynamic Multicast Routing，TADMR）算法。该算法避免了以往算法中大部分盲目的路径搜索，并使结点加入时延不再受限于固定的等待时钟，而与网络拓扑相自适应。性能分析和仿真结果表明，该算法具有较低的控制信令开销和结点加入时延，适用于各种网络规模和群组规模，具有良好的可扩展性。     

1978年前我国高校工农阶层子女入学优惠政策研究

从高校招生的演变历史看，中国在1978年以前对工农阶层子女实行高校入学优惠政策主要源于国家对这一阶层的特殊偏好而实行平均主义分配政策所致。国家通过报考资格政策、优先录取政策和免试推荐入学政策人为地大幅度提高了工农阶层子女在高校大学生中所占的比例。从公平视角看，这项政策不仅违背了公平原则，而且降低了人才选拔的质量。     

Optimal algorithms for adjacent side routing

We consider the switchbox routing problem of two-terminal nets in the case when all thek nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.This research was supported in part by NSA Contract No. MDA-904-85H-0015, NSF Grant No. DCR-86-00378, and by NSF Engineering Research Centers Program NSFD CDR 88003012.     

国内3G网络共享问题之研究

随着国内3G时代的来临，3G网络共享问题越来越受到人们的关注。本文结合国内移动通信的现状，着重分析了3G网络共享的模式及经济效益，论述了3G网络共享的相应策略。     

会计政策选择的效率性分析

会计政策选择类型在理论上大体可分为机会主义型和效率(或有效契约)型。会计政策选择具有效率性,但也为经理人员的机会主义行为打开了大门。在我国,由于企业缺乏一系列有效的激励约束机制,会计政策选择的机会主义仍然严重。为此,必须建立适合我国企业有效的激励约束机制。