电信运营商云网规划数字化研究和实现

基于电信运营商数字化转型，系统性地提出了数据驱动的云网发展规划体系，以及六大关键数字化能力构建，设计和实现了一种云网规划数字化平台，该平台可用于实现目标网络精细规划、边缘计算精准预测等场景，并探讨了数字孪生在规划领域的应用前景，对运营商推进云网融合战略、推进高质量发展具有指导和参考意义。     

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.     

以 提高实践能力为目标的数据结构课程教学改革探索

This paper analyzes the problems existing in the teaching of data structure course, and puts forward the reform from the as- pects of strengthening basic programming, visualized explanation of abstract theory, combination of C++, Java programming, ratio- nal use of online platform, and stratification of exercises, aiming at improving students' practical ability, learning interest and self- confidence.     

共网数字集群系统应用问题的研究

现今国内的数字集群网络发展存在局限性、差异性，还远没有达到“网”状分布的程度，因此，共网数字集群发展空间巨大、前景广阔。通过列举共网数字集群系统在龙嘉国际机场和长春雷锋车队的成功应用案例，探讨了我国共网数字集群系统应用的可行性和必要性。     

GOS+MU:一种查询对象选择新方法

在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。     

Optimal resilient power grid operation during the course of a progressing wildfire

We study a two-stage stochastic and nonlinear optimization model for operating a power grid exposed to a natural disaster. Although this approach can be generalized to any natural hazard of continuous (and not instantaneous) nature, our focus is on wildfires. We assume that an approaching wildfire impacts the power grid by reducing the transmission capacity of its overhead lines. At the time when proactive decisions have to be taken, the severity of the wildfire is not known. This introduces uncertainty. In this paper, we extend previous work by more realistically capturing this uncertainty and by strengthening the mathematical programming formulation through standard reformulation techniques. With these reformulation techniques, the resulting two-stage, convex mixed-integer quadratically constrained programming formulation can be efficiently solved using commercial quadratic programming solvers as demonstrated on a case study on a modified version of the IEEE 123-bus test system with 100 scenarios. We also quantify the uncertainties through a second case study using the following three standard metrics of two-stage stochastic optimization: the expected value of perfect information, the expected result of using the expected value solution and the value of the stochastic solution.     

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

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

Data sharing mechanism of various mineral resources based on blockchain

Basins with various mineral resources coexisting and enriching often occupy an important strategic position. The exploration of various mineral resources is repetitive at present due to unshared data and imperfect management mechanism. This situation greatly increases the cost of energy exploitation in the country. Traditional data-sharing mode has several disadvantages, such as high cost, difficulty in confirming the right of data, and lack of incentive mechanism, which make achieving real data sharing difficult. In this paper, we propose a data-sharing mechanism based on blockchain and provide implementation suggestions and technical key points. Compared with traditional data-sharing methods, the proposed data-sharing mechanism can realize data sharing, ensure data quality, and protect intellectual property. Moreover, key points in the construction are stated in the case study section to verify the feasibility of the data-sharing system based on blockchain proposed in this paper.     

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的用户发送的训练序列应该是正交的。针对可见光通信中以用户为中心的协作网络,研究训练资源的正交分配问题,提出了一种新的导频分配算法,联合导频分配和用户选择问题,以期最大限度地增加虚拟小区内可被接入的用户数。分析和仿真结果表明,该导频分配方案可以有效改善导频污染问题,提高训练资源利用率,并且相比已有的导频分配方案,性能有所改进。