紧急输送策略的线性规划模型

以美国南弗洛里达州递避飓风袭击为例建立了紧急输送情况下的线性规划模型。其中具体建立了以SCEPD(美国南弗洛里达州紧急情况预防部门)提出的公路反向，地区分块撤离，使用小路等三个最受人们关注的策略的模型。模型的灵敏度分析能很好地解释建立更多的临时避难所、限制车辆等策略对撤离的影响。在相近的环境下，中模型解得的结果很接近官方预测的结果，并且本的模型能对更广泛的情况进行分析．可给SCEPD提供一定参考。     

Study on a Distributed Wavelength Routing Algorithm in WDM Optical Transport Networks

A new design scheme for a distributed algorithm for routing and wavelength assignment (RWA) is developed in this paper, and the communication rules between the nodes to exchange signaling packets are discussed. The Adaptive-Alternate-Routing-Least-Load (AARLL) algorithm is implemented in the distributed scheme for the first time. Under dynamic traffic circumstances, the influence of the race condition, which does not exist in centralized scheme, on the network performance is analyzed and the analyzed results show that the race condition has a major impact on network performance only under light traffic load, while under medium and heavy traffic load the impact is very small. To analyze the performance loss caused by adopting the distributed algorithm for RWA, the capacity loss factor (CLF) is introduced and the calculated results show that CLF does not exceed 6% under medium traffic load.     

An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation

The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy traffic conditions. In this paper, we propose a new approximation technique, which combines the light and heavy traffic characteristics. This interpolation approximation is based on the theory of multipoint Padé approximation which is applied at two points: light and heavy traffic. We show how this can be applied for estimating the waiting time moments of the ^GI/G/1 queue. The light traffic derivatives of any order can be evaluated using the MacLaurin series analysis procedure. The heavy traffic limits of the ^GI/G/1 queue are well known in the literature. Our technique generalizes the previously developed interpolation approximations and can be used to approximate any order of the waiting time moments. Through numerical examples, we show that the moments of the steady state waiting time can be estimated with extremely high accuracy under all ranges of traffic intensities using low orders of the approximant. We also present a framework for the development of simple analytical approximation formulas. This revised version was published online in June 2006 with corrections to the Cover Date.     

Pricing and distributed QoS control for elastic network traffic

We study a processor-sharing model in which users choose between a high- and a low-priority service, based on their utility functions and prices charged by the service provider. The latter aims at revenue maximization. The model is motivated by file transmissions in data networks with distributed congestion control.     

Highly hydrophobically modified polyelectrolytes: Field variables to control emulsion type

Highly hydrophobically modified (with n-dodecylamide chain) linear poly(acrylic acid)s (HHMPAAH) and poly(sodium acrylate)s (HHMPAANa) with various degrees of grafting (τ) were synthesized and used as emulsifiers of the n-dodecane/water system. The type of emulsion, oil in water (O/W) or water in oil (W/O), was investigated as a function of the polymer chemical structure (τ, salt or acid form of the copolymer) and aqueous phase electrolyte concentration (NaNO₃). Increasing τ and/or salt concentration was found to favor the formation of inverse emulsions. Direct liquid–liquid dispersions are more likely to form with poly(sodium acrylate)s than with poly(acrylic acid)s. Hence, field variables such as τ, pH and ionic strength are relevant parameters to control emulsion type. Moreover, a balanced polyelectrolyte neither soluble in oil nor in water was synthesized for the first time. With this original emulsifier, the dispersion type was found to change from O/W to W/O with polymer salting out. The work provides convenient model system for fundamental studies of polymer conformation at liquid–liquid interfaces. Received: 31 March 1998 Accepted: 30 April 1998     

复杂交通环境下多层交叉融合多目标检测

针对目前复杂交通环境下还存在多目标检测精度和速度不高等问题,以特征金字塔网络(Feature Pyramid Network, FPN)为基础,提出了一种多层融合多目标检测与识别算法,以提高目标检测精度和网络泛化能力。首先,采用ResNet101的五层架构将空间分辨率上采样2倍构建自上而下的特征图,按照元素相加的方式将上采样图和自下而上的特征图合并,并构建一个融合高层语义信息与低层几何信息的特征层;然后,根据BBox回归存在训练样本不平衡问题,选择Efficient IOU Loss损失函数并结合Focal Loss提出一种改进Focal EIOU Loss;最后,充分考虑复杂交通环境下的实际情况,进行人工标注混合数据集进行训练。该模型在KITTI测试集上的平均检测精度和速度比FPN分别提升了2.4%和5 frame/s,在Cityscale测试集上平均检测精度和速度比FPN提升了1.9%和4 frame/s。     

时间敏感网络流量调度算法研究综述

时间敏感网络（Time-sensitive Networking,TSN）是一种新型确定性网络,具有低时延、低抖动等特点,能够满足现代网络传输控制的要求。流量调度是TSN标准中关键技术之一,用于确保流量传输的服务质量。首先对时间敏感网络的发展背景、重要机制、应用场景进行阐述,着重研究5种时间敏感网络流量调度机制,包括基于时间的整形机制、基于信用值的整形机制、循环队列转发机制、帧抢占机制以及异步流量整形机制;然后,分析了流量调度算法的研究现状,归纳和总结了时间触发（Time-triggered,TT）流和事件触发（Event-triggered,ET）流的调度算法,分析了目前流量调度算法存在的问题;最后,指出了TSN流量调度算法的发展方向和趋势。     

Energy and load balancing routing protocol for IoT

Due to the limitation of node energy resources, the management of energy consumption is one of the most important problems of the internet of things (IoT). Therefore, many studies have tried to optimize and manage energy consumption by focusing on different techniques. Although each of these studies has improved and optimized energy consumption, there are many important problems, including maintaining traffic balance and energy consumption of network nodes. Therefore, a new method is necessary to maintain the load and energy balancing of network nodes. Therefore, this paper introduces energy and load balancing routing protocol for IoT (ELBRP) based on the development of the RPL routing protocol and the efficiency of data distribution technique. The ELBRP performance has three steps. In the first step, along with the process of sending DODAG information object (DIO) messages, the status of network nodes is evaluated. In the second step, the DODAG communication graph is formed according to the ELBRP. In the third step, data transmission is done according to the distribution technique with the goal of balancing traffic and energy. The simulation results using cooja simulator showed the superiority of ELBRP in improving energy consumption and successful delivery ratio, reducing delay and increasing the network lifetime compared to the similar methods.     

基于AI的全场景智能基站节电系统设计与实现

摘 要：在集约化网络的建设背景下,如何实现自动化、智能化、保体验的基站能耗管理,成为当前运营商的运营管理痛点。创新地提出一种全智能检测、全场景建模、全流程自助的3G/4G/5G智能基站节电方案,通过动态时间规整算法区分覆盖场景,利用SARIMA模型预测时间框构建自适应模型,实时监控指标保证用户感知,自动下发节电策略,短信告警及时拉起。在用户无感知的情况下,实现小区粒度级最大限度节约基站能耗。该方法已在某省网络试点推行,试点区域单站平均节电效率可达9.24%每日,具备实际生产指导意义。     

基于拓扑链路识别的光网络流量数据合成算法

基于深度学习的光网络流量诊断与预测等场景中,由于保密等原因,光链路的流量数据采集和存储工作受限。针对数据量少而无法支撑深度学习的问题,文章提出了一种基于拓扑链路识别的光网络流量数据合成算法,其核心思想是在生成对抗网络框架下,联合基于光网络拓扑的条件生成模型和基于光网络流量的数据合成模型,以自监督的方式合成指定光链路的流量数据。仿真结果表明,所提算法合成的光网络流量数据在自相关系数指标上与真实数据接近且使得基于全连接神经网络的流量预测模型准确率达到95%以上。