基于定位辅助按需拓扑维护的超宽带自组网路由算法

提出了一种基于定位辅助按需拓扑维护的超宽带自组网路由算法,该算法利用超宽带技术精确定位信息所获得的网络拓扑信息和路由信息进行分组转发,路由维护阶段在定位信息辅助下采用按需方式进行断链路由的修复和拓扑维护,通过基于位置信息的按需路由发现和限制路由查找范围,以及定位信息和网络拓扑信息的及时更新,在降低协议开销的同时保证了算法的有效性。仿真表明,该算法在分组丢失率、平均端到端时延和路由附加开销等方面具有良好性能,其优良的分布式控制特征能适应超宽带自组网的动态环境。     

Benchmark Analysis: Shopping with Proper Confidence

We discuss the issue of using benchmark doses for quantifying (excess) risk associated with exposure to environmental hazards. The paradigm of low-dose risk estimation in dose-response modeling is used as the primary application scenario. Emphasis is placed on making simultaneous inferences on benchmark doses when data are in the form of proportions, although the concepts translate easily to other forms of outcome data.     

关于完善我国仲裁法律体系的若干思考

我国民事诉讼法和合同法是仲裁法的重要渊源 ,完善仲裁法律体系 ,不仅需要对仲裁法本身进行修改和完善 ,而且还应对民事诉讼法和合同法进行修改和完善     

语言的“陌生化”与广告词创作

“陌生化”作为一种语言技巧已成为古今中外的通例。近年来，越来越多的广告创作者使用知法破法”的语言“陌生化”技巧，有意识地采用打破一般语法构词规则的方法，使广告词更富有感染力，更加引人注意。对此，不能简单地用＂文理不通＂来力。以批评。“陌生化”方法的产生有其客观的依据，但对其应用有一定的限定。     

浅议美国证券仲裁制度的特征

美国证券仲裁现已成为解决证券争议的一种重要机制。它与一般商事仲裁相比,具有仲裁事项的限定性、法律基础的强行性、仲裁庭的组成专业性、仲裁运行机制的公益性、仲裁程序变迁的类诉性等特征。     

关于移动自组网自安全证书管理模型

对目前建立移动自组网信任模型的各种主流方案进行了分类和评述,重点阐述了自安全证书管理模型各种方案的优缺点,并指出了今后的研究方向.     

论“和谐”对仲裁制度价值目标的建构

建立和谐社会的价值目标,既解读继承历史,又立足创新社会,和谐的内在要求导向着仲裁制度的完善,和谐的价值目标奠定了仲裁的发展方向,是仲裁制度为之实现的终极目标;仲裁制度的固有属性也暗合了和谐的建构目的,并成为和谐社会目标下处理纷争的重要制度。     

浅谈地市党报楼盘广告话语的人文性

以地市党报自身所具有的较大权威性为研究起点,以其发布的楼盘广告作为研究对象,结合地市党报上所刊登的具体楼盘实例,对楼盘广告话语进行深入剖析。认为当前的地市党报楼盘广告注重以人为本铸造品牌,注重“硬件”人性化和“软件”个性化的转化,其广告话语体现了平民视角和人文关怀,具有鲜明的人文性色彩。     

Minimum power assignment in wireless ad hoc networks with spanner property

Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research efforts have focused on finding the minimum power assignment to guarantee the connectivity or fault-tolerance of the network. In this paper, we study a new problem of finding the power assignment such that the induced communication graph is a spanner for the original communication graph when all nodes have the maximum power. Here, a spanner means that the length of the shortest path in the induced communication graph is at most a constant times of the length of the shortest path in the original communication graph. Polynomial time algorithm is given to minimize the maximum assigned power with spanner property. The algorithm also works for any other property that can be tested in polynomial time and is monotone. We then give a polynomial time approximation method to minimize the total transmission radius of all nodes. Finally, we propose two heuristics and conduct extensive simulations to study their performance when we aim to minimize the total assigned power of all nodes. The author is partially supported by NSF CCR-0311174.     

Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks

Energy conservation in mobile ad hoc networks is of paramount importance because most mobile nodes usually have very limited energy supply. Previous research on this issue focused on the design at the network or MAC or physical layer. In this paper, we study this problem from the new perspective of node mobility, i.e., analyzing the impact of node movement on energy conservation. In particular, armed with the inherent resource heterogeneity in mobile ad hoc networks, we propose a novel resource-aware movement strategy to make better use of some powerful nodes to achieve energy conservation. We also formulate the resource-aware movement as a NP-complete distance-constrained least-cost (DCLC) routing problem and propose an efficient heuristic solution. Extensive simulations have been used to demonstrate the effectiveness of the proposed schemes.