突发疫情对染料行业影响及对策

一场新型冠状病毒肺炎疫情的爆发给染料行业的发展带来了影响,既有负面消极,也有积极影响。疫情将促进染料行业绿色发展,推动染料行业走向信息化、智能化时代,走向高质量发展,指出只要坚持绿色、创新和智能化,就能战胜疫情,推动中国染料行业稳健发展。     

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

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

一次性使用医用手套标准解读

一次性医用手套是能够防止人们交叉感染的常用防护用品。随着新冠肺炎疫情在全球范围的迅速蔓延,疫情防控一线以及广大普通民众对一次性医用手套的需求与日俱增,其标准也受到广泛关注。本文对中国国家标准涉及一次性使用医用手套的4项产品标准进行了解读,并分析它们与国外同种产品标准间的对应关系以及重点指标的差异。     

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.     

Modelling and predicting the effect of social distancing and travel restrictions on COVID-19 spreading

To date, the only effective means to respond to the spreading of the COVID-19 pandemic are non-pharmaceutical interventions (NPIs), which entail policies to reduce social activity and mobility restrictions. Quantifying their effect is difficult, but it is key to reducing their social and economic consequences. Here, we introduce a meta-population model based on temporal networks, calibrated on the COVID-19 outbreak data in Italy and applied to evaluate the outcomes of these two types of NPIs. Our approach combines the advantages of granular spatial modelling of meta-population models with the ability to realistically describe social contacts via activity-driven networks. We focus on disentangling the impact of these two different types of NPIs: those aiming at reducing individuals’ social activity, for instance through lockdowns, and those that enforce mobility restrictions. We provide a valuable framework to assess the effectiveness of different NPIs, varying with respect to their timing and severity. Results suggest that the effects of mobility restrictions largely depend on the possibility of implementing timely NPIs in the early phases of the outbreak, whereas activity reduction policies should be prioritized afterwards.     

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

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

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

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

自动交换光网络中的信令与路由

自动交换光网络的概念一经提出即受到业界的广泛关注，运营商尤其对其寄予了厚望。本文首先概要地介绍了ASON的优点，然后重点论述了ASON的信令与路由功能，包括对它们的要求以及标准化工作。     

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.