Relay sensor placement in wireless sensor networks

This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum number of relay sensors such that the induced topology by all sensors is globally connected. This problem is motivated by practically considering the tradeoff among performance, lifetime, and cost when designing sensor networks. In our study, this problem is modelled by a NP-hard network optimization problem named Steiner Minimum Tree with Minimum number of Steiner Points and bounded edge length (SMT-MSP). In this paper, we propose two approximate algorithms, and conduct detailed performance analysis. The first algorithm has a performance ratio of 3 and the second has a performance ratio of 2.5. Xiuzhen Cheng is an Assistant Professor in the Department of Computer Science at the George Washington University. She received her MS and PhD degrees in Computer Science from the University of Minnesota - Twin Cities in 2000 and 2002, respectively. Her current research interests include Wireless and Mobile Computing, Sensor Networks, Wireless Security, Statistical Pattern Recognition, Approximation Algorithm Design and Analysis, and Computational Medicine. She is an editor for the International Journal on Ad Hoc and Ubiquitous Computing and the International Journal of Sensor Networks. Dr. Cheng is a member of IEEE and ACM. She received the National Science Foundation CAREER Award in 2004. Ding-Zhu Du received his M.S. degree in 1982 from Institute of Applied Mathematics, Chinese Academy of Sciences, and his Ph.D. degree in 1985 from the University of California at Santa Barbara. He worked at Mathematical Sciences Research Institutea, Berkeley in 1985-86, at MIT in 1986-87, and at Princeton University in 1990-91. He was an associate-professor/professor at Department of Computer Science and Engineering, University of Minnesota in 1991-2005, a professor at City University of Hong Kong in 1998-1999, a research professor at Institute of Applied Mathematics, Chinese Academy of Sciences in 1987-2002, and a Program Director at National Science Foundation of USA in 2002-2005. Currently, he is a professor at Department of Computer Science, University of Texas at Dallas and the Dean of Science at Xi’an Jiaotong University. His research interests include design and analysis of algorithms for combinatorial optimization problems in communication networks and bioinformatics. He has published more than 140 journal papers and 10 written books. He is the editor-in-chief of Journal of Combinatorial Optimization and book series on Network Theory and Applications. He is also in editorial boards of more than 15 journals. Lusheng Wang received his PhD degree from McMaster University in 1995. He is an associate professor at City University of Hong Kong. His research interests include networks, algorithms and Bioinformatics. He is a member of IEEE and IEEE Computer Society. Baogang Xu received his PhD degree from Shandong University in 1997. He is a professor at Nanjing Normal University. His research interests include graph theory and algorithms on graphs.     

基于ZBrush的真人头部模型的设计与实现

Zbrush是一款数字雕刻和绘画软件,能够让制作者无约束自由创作,其拥有强大的建模功能,能够创建出非常精细的模型以及生成合理的纹理贴图、置换贴图、法线贴图与其他三维软件相结合,Zbrush已广泛应用于电影特效、游戏、广告等行业中。本文介绍了基于Zbrush的真人头部模型的设计与实现从"高模的制作"—>"模型的拓扑"—>"UV编辑"—>"绘制贴图"基本流程以及制作中的要领,带初学者进入神奇的三维雕刻世界。     

Reconfigurable topology synthesis for application-specific NoC on partially dynamically reconfigurable systems

In this paper, a four-stage method for synthesizing reconfigurable ASNoC topology is proposed for partially dynamically reconfigurable systems, where the topology is reconfigured dynamically at run-time along with the application's execution. Firstly, a simulated annealing based topology-aware integrated optimization framework is proposed to generate the proper schedule and floorplan of task modules. Secondly, based on the schedule and floorplan of task modules, an Integer Linear Programming (ILP)-based method and a heuristic method, are proposed to partition the communication requirements of the application into $T$ time intervals. Thirdly, we explore the proper positions of switches in the floorplan for global communications. Finally, considering the reconfiguration costs between adjacent time intervals, the routing path allocation problem is solved for time intervals in an iterative procedure to generate fine-grained dynamically reconfigurable ASNoC topologies. Experimental results show that, compared to the random partition of communication requirements, the proposed heuristic method and ILP-based method can achieve 5.4% and 10.0% power consumption improvement, respectively. And, the reconfigurable ASNoC can achieve 31.6% power consumption improvement when compared with static ASNoC.     

超导磁场储能型微网的涡流损耗预测控制研究

微网是现代智能电网的精华,具有经济性、环保性与切换灵活性,但存在涡流损耗状况。系统结合超导磁场储能技术实时预测并控制涡流损耗,首先给出预测控制模型,并通过漏磁场和电网导体损耗测算绕组线圈的涡流损耗;研究预测控制拓扑模型,实验波形,电机震荡状态和微网涡流谐波关联。实验结果表明该技术能提升微网供电稳定性,实时预测和控制涡流损耗。内外环调控能在开关频段、边带和倍频周围产生较大的谐波量,减小涡流损耗,保证运转效率与能量。     

基于位置信息的无线小区自组织网络拓扑控制研究

针对无线小区自组织网络节点连接性不高的问题,在网络节点所处的平面上引入空间约束机制,通过加入位置信息和增大平面以降低网络节点间干扰的方法来减小网络总干扰。分析了网络源节点的广播成功率,计算了网络节点的空间位置下界,并分别就单数据流和多数据流的情况下网络的有效性加以讨论。实验仿真表明,这种新型的网络拓扑控制方法可以有效提高无线自组织网络的相关性能。     

基于微博媒体的社区发现技术研究

微博社交网络是由节点构成的,每个节点代表一个微博用户。节点与节点间存在着关系,因此连接紧密的节点形成了社区。如何从微博社交网络中挖掘出社区,已成为Web2．0的团体挖掘研究热点。详细介绍了传统的网络团体挖掘算法,并提出了一种新的社区发现的算法,称为基于用户兴趣的社区发现算法。该算法不论在计算效率还是社区发现效果上比传统算法都具有明显的提升,取得了不错的实验效果。     

高压变频器在扬州水厂的应用

本文简述了6kV变频器的主电路拓朴结构及控制方式，介绍了变频器比较选择和PowerFlex7000变频器用于扬州四水厂的工程实例。     

三相电压源型逆变器故障容错综述

在诸如航空航天、机车牵引、核工业、石油化工等领域,电力电子装置已成为控制过程中的关键设备。一旦电力电子装置出现故降,整个系统便丧失了正常工作的能力,尤其在航空、军事等重要场合,将会造成灾难性的事故。本文主要介绍了三相两电平电压源型逆变器功率开关器件故降容错拓扑结构,着重探讨了三相四开关逆变器控制方案,为故障容错方面的研究工作提供一个初步的指南。     

基于FW-PSO算法优化无线传感网络拓扑结构的方法

无线传感网络(WSN)具有无标度网络的特征,通常工作在无人值守的开放性环境中,极易遭受到各种蓄意攻击。攻击使得网络发生故障,甚至会导致整个网络瘫痪。该文基于复杂网络领域的无标度网络,构建具有无标度特性的无线传感网络模型。利用烟花算法及粒子群算法(PSO)寻优过程中的搜索能力、种群多样性等优点,提出了一种FW-PSO算法,该算法在全局搜索能力和收敛速度上具有较好的性能。针对具有无标度特性的网络模型,用FW-PSO算法对网络拓扑进行优化,在不同的攻击策略下分别从动态抗毁性和静态抗毁性分析优化前后网络的性能。仿真实验表明,与其他同类算法相比,经过该文所提算法优化后的无线传感网络的动态和静态抗毁性能都有明显提升。

     

一类新型 PWM 可逆整流器

针对传统的桥式ＰＷＭ可逆整流器直流侧工作电压要求较高的限制,提出一种新型ＰＷＭ可逆整流器拓扑,运用状态空间平均法进行了建模和稳态理论分析,并给出该变流器的参数选择方法。ＭＡＴＬＡＢ数值仿真与样机实验结果证实了该拓扑、模型及理论的正确性。