A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Crossing the Border: From Keto- to Imine Reduction in Short-Chain Dehydrogenases/Reductases

The family of NAD(P)H-dependent short-chain dehydrogenases/reductases (SDRs) comprises numerous biocatalysts capable of C=O or C=C reduction. The highly homologous noroxomaritidine reductase (NR) from Narcissus sp. aff. pseudonarcissus and Zt_SDR from Zephyranthes treatiae, however, are SDRs with an extended imine substrate scope. Comparison with a similar SDR from Asparagus officinalis (Ao_SDR) exhibiting keto-reducing activity, yet negligible imine-reducing capability, and mining the Short-Chain Dehydrogenase/Reductase Engineering Database indicated that NR and Zt_SDR possess a unique active-site composition among SDRs. Adapting the active site of Ao_SDR accordingly improved its imine-reducing capability. By applying the same strategy, an unrelated SDR from Methylobacterium sp. 77 (M77_SDR) with distinct keto-reducing activity was engineered into a promiscuous enzyme with imine-reducing activity, thereby confirming that the ability to reduce imines can be rationally introduced into members of the “classical” SDR enzyme family. Thus, members of the SDR family could be a promising starting point for protein approaches to generate new imine-reducing enzymes.     

移动边缘计算环境下的动态资源分配策略

在通讯设备爆炸式增长的时代,移动边缘计算作为5G通讯技术的核心技术之一,对其进行合理的资源分配显得尤为重要。移动边缘计算的思想是把云计算中心下沉到基站部署(边缘云),使云计算中心更加靠近用户,以快速解决计算资源分配问题。但是,相对于大型的云计算中心,边缘云的计算资源有限,传统的虚拟机分配方式不足以灵活应对边缘云的计算资源分配问题。为解决此问题,提出一种根据用户综合需求变化的动态计算资源和频谱分配算法(DRFAA),采用"分治"策略,并将资源模拟成"流体"资源进行分配,以寻求较大的吞吐量和较低的传输时延。实验仿真结果显示,动态计算资源和频谱分配算法可以有效地降低用户与边缘云之间的传输时延,也可以提高边缘云的吞吐量。     

A self‐scalable load injection service

Load testing of applications is an important and costly activity for software provider companies. Classical solutions are very difficult to set up statically, and their cost is prohibitive in terms of both human and hardware resources. Virtualized cloud computing platforms provide new opportunities for stressing an application's scalability, by providing a large range of flexible and less expensive (pay‐per‐use model) computation units. On the basis of these advantages, load testing solutions could be provided on demand in the cloud. This paper describes a Benchmark‐as‐a‐Service solution that automatically scales the load injection platform and facilitates its setup according to load profiles. Our approach is based on: (i) virtualization of the benchmarking platform to create self‐scaling injectors; (ii) online calibration to characterize the injector's capacity and impact on the benched application; and (iii) a provisioning solution to appropriately scale the load injection platform ahead of time. We also report experiments on a benchmark illustrating the benefits of this system in terms of cost and resource reductions. Copyright © 2013 John Wiley & Sons, Ltd.     

以用户为中心的可见光通信协作传输中训练资源分配算法

以用户为中心的可见光通信协作传输是近年来出现的新架构,这导致虚拟小区之间出现重叠。为避免导频污染问题,每个虚拟小区中的光接入点(AP)或者虚拟小区中选择相同AP的用户发送的训练序列应该是正交的。针对可见光通信中以用户为中心的协作网络,研究训练资源的正交分配问题,提出了一种新的导频分配算法,联合导频分配和用户选择问题,以期最大限度地增加虚拟小区内可被接入的用户数。分析和仿真结果表明,该导频分配方案可以有效改善导频污染问题,提高训练资源利用率,并且相比已有的导频分配方案,性能有所改进。     

Mining fleet management systems: a review of models and algorithms

The objective of this paper is to review and document the mine fleet management systems’ models and algorithms. The purpose is to understand the algorithms behind the fleet management systems and the proposed academic solutions in this area to identify any gaps in the current literature and to open up opportunities to establish research questions that need to be addressed in an integrated simulation and optimisation operational planning research framework. In this paper, we review industrial fleet management systems and the main academic algorithms behind such systems. The fleet management systems are divided into three subsequently related problems to review: shortest path, production optimisation and real-time dispatching. Finally, the limitations of current algorithms for fleet management systems are documented in terms of mining practice feasibility and optimality of the solution on large-scale problems. The results of this literature review enable us to evaluate the logical links between major components of an integrated simulation and optimisation operational planning framework with current theory of fleet management systems.     

流域泥沙灾害与泥沙资源性的研究

泥沙灾害与泥沙资源性是流域泥沙的重要属性,二者在一定条件下可以相互转化。本文论述了泥沙淤积、泥沙冲刷、岸滩崩塌、山地崩塌与泥石流、粗沙淤积的土地沙化等泥沙灾害,指出泥沙灾害具有时空分布的不均匀性、渐变性或突发性、群发性、转化性及危害严重性等;流域泥沙资源化的主要途径包括填海造陆及造地、引洪淤灌、堤防淤临淤背、建筑材料、湿地形成(河流、湖泊与河口海岸)等,指出流域泥沙资源化及其优化配置既要解决思想观念、基本理论、目标效益等方面的问题,还要考虑与水资源联合配置问题。     

基于宏观经济结构合理化的宁夏水资源合理配置

本文分析了宁夏目前经济结构下水资源利用效率及产出效益，研究在一定经济发展水平下，当资源配置最优时，最优的经济均衡增长途径。区域最优经济结构是由国民经济各部门相互依存的关联关系技术矩阵所决定的，其均衡增长率和均衡增长产出结构分别等于非负矩阵的弗罗比尼斯特征根和相对应的弗罗比尼斯向量。本文根据联合国经济发展统计数据，分析出宁夏未来调整第一产业与第二产业结构的比例，认为应适当减少宁夏高耗水水稻种植面积，逐渐把农业用水量向工业用水量转移。转变经济增长方式，从水资源的高效利用及配置出发走内涵式、节水型的社会发展道路，以解决宁夏水资源严重不足的问题。     

随机库存分配问题的一种求解方法

讨论了在VMI管理思想下对具有随机需求特性的多客户库存分配问题 ,重点论述了有效近似算法的设计过程 ,最后基于一组模拟数据给出了一个算例。     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.