带碰撞避免机制的多址接入协议能量效率研究

研究了在自组织网络环境下CSMA/CA协议的能量消耗性能,并与传统的CSMA协议能耗性能进行比较.阐述了自组织网络中的隐藏终端和暴露终端问题,并分析CSMA/CA协议相对传统CSMA协议对该问题进行的改进.仿真结果表明,相对非坚持CSMA协议,CSMA/CA协议能够获得的能量效率更高,并且对网络负载的敏感性更低,在网络负载较高时也具有较高的能量效率.     

Coordinate descent with arbitrary sampling I: algorithms and complexity†

We study the problem of minimizing the sum of a smooth convex function and a convex block-separable regularizer and propose a new randomized coordinate descent method, which we call ALPHA. Our method at every iteration updates a random subset of coordinates, following an arbitrary distribution. No coordinate descent methods capable to handle an arbitrary sampling have been studied in the literature before for this problem. ALPHA is a very flexible algorithm: in special cases, it reduces to deterministic and randomized methods such as gradient descent, coordinate descent, parallel coordinate descent and distributed coordinate descent—both in nonaccelerated and accelerated variants. The variants with arbitrary (or importance) sampling are new. We provide a complexity analysis of ALPHA, from which we deduce as a direct corollary complexity bounds for its many variants, all matching or improving best known bounds.     

Remarks on minimal solutions of a system of fuzzy relation equations over complete infinitely distributive lattices

In Section 3.6 of Fuzzy relation equations and their applications to knowledge engineering. Kluwer Academic Publishers, Boston (1989), Di Nola et al. presented a procedure to find a minimal solution from a fixed solution of a system of fuzzy relation equations over complete infinitely distributive lattices, and put the question: is the minimal solution found by the procedure unique or not? In this paper, we give a negative answer to the question and make some further remarks. We not only give a necessary and sufficient condition for the uniqueness of such minimal solutions, but also characterize the existence of the least solution and a unique solution of a system of fuzzy relation equations over complete infinitely distributive lattices.     

地方本科院校计算机类专业人才培养模式的探索与实践

地方本科院校计算机类专业承担着为我国培养计算机应用型人才的重任,探索新时期下计算机应用型人才的培养模式,其根本出路就是坚持"以就业为导向、以服务为宗旨,走产学研结合之路"。在培养目标上,目前应分为以下4个方向:计算机硬件维护与应用、计算机网络安全技术、计算机程序开发技术、计算机信息管理。在理论教学上采取"基本素质模块"+"专业基础模块"+"专业主干模块"+"专业创新模块";在实践教学上采取"基本技能"+"专业技能"+"开发设计技能"+"岗位综合应用技能"。     

低压增安型异步电动机热过载保护的改进

低压增安型三相异步电动机是适用于工厂2区内具有爆炸危险场所的防爆电机,其防爆技术原理是在保证电机正常运行的条件下,不产生电弧、火花,或在可能点燃爆炸性混合物的高温的基础上,进一步采取电磁和机械方面的措施,以提高安全性,避免在正常和认可的过载条件下出现问题。随着增安型异步电动机被广泛采用、数字技术的不断发展和新一代低压电动机智能综合保护器的逐步普及,增安型电动机的热过载保护（TE时间保护）已日趋完善。     

A <Emphasis Type="Italic">K</Emphasis> self-adaptive SDN controller placement for wide area networks

As a novel architecture, software-defined networking (SDN) is viewed as the key technology of future networking. The core idea of SDN is to decouple the control plane and the data plane, enabling centralized, flexible, and programmable network control. Although local area networks like data center networks have benefited from SDN, it is still a problem to deploy SDN in wide area networks (WANs) or large-scale networks. Existing works show that multiple controllers are required in WANs with each covering one small SDN domain. However, the problems of SDN domain partition and controller placement should be further addressed. Therefore, we propose the spectral clustering based partition and placement algorithms, by which we can partition a large network into several small SDN domains efficiently and effectively. In our algorithms, the matrix perturbation theory and eigengap are used to discover the stability of SDN domains and decide the optimal number of SDN domains automatically. To evaluate our algorithms, we develop a new experimental framework with the Internet2 topology and other available WAN topologies. The results show the effectiveness of our algorithm for the SDN domain partition and controller placement problems.