随机时变路网下的城市应急服务车辆路径分析

针对城市应急服务车辆（110、119、120等）的最优路径选择问题及路网的随机性与时变性,利用鲁棒优化理论,考虑路网在最坏情况下的行程时间,建立了随机时变条件下的应急车辆路径选择模型,并对 Dijkstra算法进行改进,将算法的路阻矩阵进行实时更新,以在时变条件下实现对路径选择模型的求解。经算例分析表明,该模型能有效解决随机时变路网环境下的应急车辆最优路径问题,与基于概率分布的期望行程时间最短的方法相比,该模型拥有更高的鲁棒性和易操作性。     

基于IOS平台的小型仓储管理系统设计

随着数字化、信息化技术在物流领域应用的飞速发展,各种各样的仓储管理系统日益受到关注。本文介绍的基于IOS平台的小型仓储管理系统是利用IOS设备对货物信息进行采集,通过SQLite数据库技术、ZXing库等软硬件方式构建的业务系统,可以较好地适应中小规模用户数据交互的需求。同时,系统具备造价低廉、操作便捷等优点。     

一种线性时间复杂度的高效路由保护方法

如何高效快速地应对网络中的故障是设计路由协议的基本要求和主要任务。由于动态路由协议在应对网络中的故障时,在协议动态收敛的过程中将会有大量的报文被丢弃。因此,目前路由器厂商普遍采用路由保护方法来克服网络故障,在众多的路由保护方法中,DC（downstream criterion）规则是一种被普遍认可的方法。然而,已有的实现 DC规则算法的时间复杂度普遍较高,并且复杂度随着网络节点平均度的增加而迅速增加。为了应对上述问题,提出一种线性时间复杂度的高效路由保护方案ERPLR（an efficient routing protection method with linear time complexity）,该方法首先提出了备份下一跳计算规则,然后在已有最短路径树的基础上,根据备份下一跳计算规则为所有的源目的节点对计算备份下一跳。在计算备份下一跳的过程中,每个节点和其邻居最多被访问一次,因此ERPLR的时间复杂度为O（V+E）。实验结果表明,与已有的实现DC规则相比较,ERPLR在故障保护率和路径拉伸度两个度量指标结果相似的情况下,在真实网络拓扑和模拟拓扑中,ERPLR分别降低了大约74.93%和78.91%的计算开销,该方法可以极大地降低DC规则的计算开销。     

无先验地图条件下电力管廊无人机自主巡检方法研究

针对无先验地图条件下电力管廊无人机自主巡检能力不足的问题,本文提出了一种不依赖先验地图的无人机巡检方法。首先,无人机搭载激光雷达,通过SLAM（Simultaneous Localization and Mapping）算法进行实时场景构图,并基于RRT（Rapidly-exploring Random Tree）算法对构建的全局栅格地图进行边界搜索;其次,针对传统RRT算法难以判断环境地图完整性、保障巡检全面性的问题,提出了一种基于数字图像处理的边界检测方法。通过Canny算子对实时构建的地图进行边缘检测,并对地图进行完整性评估。最后,为验证本文提出方法的有效性,在江苏无锡处某220kV电力管廊的仿真模型中进行验证,分别采用RRT算法和本文改进算法进行自主巡检测试,结果表明本文提出的算法相比RRT算法可提升21.8%的巡检覆盖率。     

基于差异路径权重的二部图网络推荐算法

针对二部图网络结构推荐算法中资源分配不合理的现象,同时为了丰富推荐结果多样性和促进冷门物品的推荐,提出了一种利用差异路径权重改变资源传递的二部图网络结构算法。利用用户相似性构造路径权重改变第一阶段资源传递规则,使资源较多地流向与目标用户相似的用户节点。通过物品属性相似的构造路径权重,使第二阶段资源更多地流向与目标用户已购物品具有相似属性的物品。实验结果表明,本算法相对于其他流行网络结构算法提高了推荐的综合性能,并且更好地解决推荐中的相关问题。     

干酪素型啤酒标签胶的研究进展

从制备原理及分散体系、交联剂、改性助剂等方面综述了干酪素型啤酒标签胶的研究进展,并对该领域研究进行了展望。     

Counting maximal independent sets in directed path graphs

The problem of counting maximal independent sets is #P-complete for chordal graphs but solvable in polynomial time for its subclass of interval graphs. This work improves upon both of these results by showing that the problem remains #P-complete when restricted to directed path graphs but that a further restriction to rooted directed path graphs admits a polynomial time solution.     

Finite horizon optimal control of non-linear discrete-time switched systems using adaptive dynamic programming with ε-error bound

In this paper, we aim to solve the finite-horizon optimal control problem for a class of non-linear discrete-time switched systems using adaptive dynamic programming(ADP) algorithm. A new ε-optimal control scheme based on the iterative ADP algorithm is presented which makes the value function converge iteratively to the greatest lower bound of all value function indices within an error according to ε within finite time. Two neural networks are used as parametric structures to implement the iterative ADP algorithm with ε-error bound, which aim at approximating the value function and the control policy, respectively. And then, the optimal control policy is obtained. Finally, a simulation example is included to illustrate the applicability of the proposed method.     

Construction, properties and specific fluorescent labeling of a bovine prothrombin mutant engineered with a free C-terminal cysteine

To define the role of phosphatidylserine-induced conformationalchanges in prothrombin activation during blood coagulation,a recombinant bovine prothrombin was constructed, characterizedand shown to have a globally native-like conformation. We introduceda cysteine to replace the penultimate residue (Gly581) of apreviously constructed active site mutant, and expressed thedouble mutant in Chinese hamster ovary cells at the level of0.6 µg/ml of cell culture medium. Specific labeling withfluorescein maleimide was accomplished by limited reductionwith dithiothreitol to free the engineered cysteine while maintainingthe native-like functional properties of the molecule. The averagestoichiometry of labeling was 0.84 probe/protein. The locationof the probe at the C-terminus was confirmed by proteolysisby native thrombin, by Taipan venom, and by carboxypeptidaseY. Both the double mutant and labeled prothrombin could be activatedby snake venoms and the prothrombinase but, as expected, thedouble mutant meizothrombin did not autolyze as does nativemeizothrombin. Thus, for the first time, a native-like but specificallylabeled prothrombin has been constructed. This molecule willbe an essential tool for elucidating the structural role ofmembranes during prothrombin activation. In addition, the methodsdescribed might be usefully applied to labeling of an odd, engineeredcysteine in other disulfide bond-containing proteins.     

Betweenness estimation in OLSR-based multi-hop networks for distributed filtering

In traditional networks special efforts are put to secure the perimeter with firewalls: particular routers that analyze and filter the traffic to separate zones with different levels of trust. In wireless multi-hop networks the perimeter is a concept extremely hard to identify, thus, it is much more effective to enforce control on the nodes that will route more traffic. But traffic filtering and traffic analysis are costly activities for the limited resources of mesh nodes, so a trade-off must be reached limiting the number of nodes that enforce them. This work shows how, using the OLSR protocol, the centrality of groups of nodes with reference to traffic can be estimated with high accuracy independently of the network topology or size. We also show how this approach greatly limits the impact of an attack to the network using a number of firewalls that is only a fraction of the available nodes.