一种面向空地一体化组网的体系架构

空间网络是空地一体化组网中地面网络延伸的重要组成部分。针对空间网络为移动星座的场景,传统的空地一体化组网模型将空间网络视为独立自治域,利用边界网关协议将空间网络与地面自治域互联起来,最大化同地面网络保持兼容。然而,传统组网模型存在边界网关面临频繁会话中断或大量路由更新等问题。通过重新审视空间网络的角色定位和边界划定问题,提出一种面向空地一体化组网的体系架构Slink。Slink的核心思想是空间网络为地面网络提供互联通道,利用星地网关隔离空地两网间的路由更新。实验仿真表明,Slink体系架构能够有效减小对空间路由器的路由存储空间需求,降低星地网络间的带宽消耗。     

Topology optimization of a coupled thermal-fluid system under a tangential thermal gradient constraint

This paper presents a continuous adjoint approach for topology optimization of a coupled heat transfer and laminar fluid flow system under tangential thermal gradient (TTG) constraints. In this system, the thermal gradient along the boundary of multiple heat sources needs to be controlled. The design goals are to minimize the temperature of the domain, the fluid power dissipation and the TTG along the boundary of the heat sources. The first two goals are combined into a single cost function with weight variables. The TTG is constrained in one of two forms, an integral form where the integral of TTG squares along the boundaries of heat sources is constrained, or a point-wise form where TTG is constrained point-wise. A gradient-based approach is developed to obtain the optimized designs. A salient feature of our approach is the use of the continuous adjoint approach to derive gradients of both the cost function and two forms of TTG constraints. Numerical examples demonstrate that the continuous adjoint approach leads to successful topological optimization of the constrained thermal-fluid system. The use of TTG constraint is effective in lowering the TTG along the heat source boundaries. The resulting designs exhibit clear black/white contrast.     

多种类病毒相互作用下网络信道破坏程度估计

在多种类病毒的相互作用下,网络信道破坏程度呈现较强的非线性特点,不能准确约束病毒在相互作用下的破坏性.传统的网络破坏程度估计的过程中,仅仅以单一病毒破坏程度叠加的方式去计算参数,计算具有较强的主观性,没有准确描述不同病毒的破坏作用,对评估结果误差影响较大.为解决上述问题,提出一种基于粒子滤波算法的多种类病毒相互作用下网络信道破坏程度估计方法,利用欧式距离方法对全部病毒进行分类,获取不同类型病毒的网络信道破坏程度值.通过粒子滤波算法对单一个体约束的优势,将每一个不同类型的病毒看作一个粒子,并进行训练.根据训练结果,利用粒子滤波算法对当前时刻网络信道破坏程度进行估计,完成整体评估.实验结果表明,利用改进算法进行多种类病毒相互作用下网络信道破坏程度估计,能够有效提高估计的准确率.     

Recover Fault Services via Complex Service-to-Node Mappings in Wireless Sensor Networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level.     

Characterizing and optimizing TPC-C workloads on large-scale systems using SSD arrays在大规模系统上优化 TPC-C 评测程序

Transaction processing performance council benchmark C (TPC-C) is the de facto standard for evaluating the performance of high-end computers running on-line transaction processing applications. Differing from other standard benchmarks, the transaction processing performance council only defines specifications for the TPC-C benchmark, but does not provide any standard implementation for end-users. Due to the complexity of the TPC-C workload, it is a challenging task to obtain optimal performance for TPC-C evaluation on a large-scale high-end computer. In this paper, we designed and implemented a large-scale TPC-C evaluation system based on the latest TPC-C specification using solid-state drive (SSD) storage devices. By analyzing the characteristics of the TPC-C workload, we propose a series of system-level optimization methods to improve the TPC-C performance. First, we propose an approach based on SmallFile table space to organize the test data in a round-robin method on all of the disk array partitions; this can make full use of the underlying disk arrays. Second, we propose using a NOOP-based disk scheduling algorithm to reduce the utilization rate of processors and improve the average input/output service time. Third, to improve the system translation lookaside buffer hit rate and reduce the processor overhead, we take advantage of the huge page technique to manage a large amount of memory resources. Lastly, we propose a locality-aware interrupt mapping strategy based on the asymmetry characteristic of non-uniform memory access systems to improve the system performance. Using these optimization methods, we performed the TPC-C test on two large-scale high-end computers using SSD arrays. The experimental results show that our methods can effectively improve the TPC-C performance. For example, the performance of the TPC-C test on an Intel Westmere server reached 1.018 million transactions per minute.     

探讨计算机网络专业学生的实训教学课程设置

计算机网络专业的学生的实训内容通常是与今后的工作相关联的,这种关联的程度越高,说明实训的效果越好,也可以从一个侧面说明教学越成功。所以,实训项目不应该是凭空设想的,也不应该是几年如一日的照搬照抄的,应该是符合市场需求的,与时俱进的。     

Test frame updating in CPM testing of Prolog programs

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

鸟嘌呤和8-羟基脱氧鸟嘌呤核苷在聚甘氨酸修饰电极上的电化学行为及其同时测定

在优化的实验条件下,利用电化学方法制备了甘氨酸修饰电极,对修饰膜的电活性进行了表征.用循环伏安法研究了鸟嘌呤(G)和8一羟基脱氧鸟嘌呤核苷(8-OH-dG)在聚甘氨酸修饰电极上的电化学行为,并建立了对两者进行分别检测和同时检测的分析方法.实验结果表明,聚甘氨酸修饰电极可以增强鸟嘌呤和8-羟基脱氧鸟嘌呤核苷在电极表面的吸附,并且可以加快鸟嘌呤和8-羟基脱氧鸟嘌呤核苷在电极表面的电子传输,使两种电活性物质在聚甘氨酸修饰电极上的电化学信号明显增大,检测灵敏度大大提高,并且该修饰电极具有良好的稳定性和重现性.可用于鸟嘌呤和8-羟基脱氧鸟嘌呤核昔的分别和同时检测.