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

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

人工智能在智慧海洋建设中的应用

围绕人工智能与智慧海洋建设这条主线，论述人工智能、智慧海洋的概念，列举当前较为成熟的人工智能与海洋科技在海洋观测方面融合的切入点，初步展现一种海洋技术与装备智能化的发展路径，提出加快人工智能技术向智慧海洋建设赋能的几点建议。     

Context-free grammars to detect straight segments and a novel polygonal approximation method

A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed.     

基于改进D?Lite遗传算法路径规划研究

针对遗传算法在移动机器人路径规划中易产生早熟现象和收敛速度慢的问题,提出了改进的D~* Lite遗传算法。该算法将D~* Lite算法和遗传算法相结合,通过引入碰撞系数和可视检测技术以提高路径安全性,寻找最短路径。在遗传算法设计中加入动态调整交叉与变异概率,以解决算法在路径规划中因陷入局部最优值而不能到达目标点的问题。最后,通过实验仿真可知:与蚁群算法和免疫遗传算法相比,改进的D~* Lite遗传算法执行效率高,可以快速规划出全局最优路径。     

Strategic planning optimization for natural gas to liquid transportation fuel (GTL) systems

A strategic planning optimization model is proposed for a network of natural gas to liquids (GTL) systems, and it is solved using a rolling horizon strategy. The model formulation determines the strategic and tactical decisions of the GTL supply chain over a long time horizon. The decisions to build new GTL refineries may be made over the span of 30 years and their operations cover the span of 60 years. Multiple capacities of GTL refineries (i.e., 1, 5, 10, 50, and 200 thousand barrels per day) that produce gasoline, diesel, and kerosene commensurate to the United States demand ratio may exist in the network. The parameter inputs include the locations, availabilities, and prices of natural gas in the United States discretized by county, the delivery locations of fuel products, and the transportation costs of every input and output of the refinery, defined for each time period. Formulated as a large-scale mixed-integer linear optimization (MILP) model, the problem is solved using a rolling horizon strategy for tractability. Case studies on the state of Pennsylvania are presented for different planning schemes and their impact on the economic performance of the GTL network is discussed.     

无线传感器网络中移动sink节点的路径规划

在无线传感器网络中,大量感知数据汇集到sink节点的采集方法会导致sink节点附近的节点能量耗尽,造成能量空洞。针对该问题,利用移动的sink节点进行数据收集是一种解决方法,其中移动sink的路径规划成为一个重要的问题。提出了一个移动sink路径规划算法,将无线传感器中随机分布的节点划分为不同的子区域,寻找sink节点移动的最佳转向点,最终得到最优的移动路径,以实现无线传感器网络生命周期最大化。仿真实验表明,与现有方案相比,该算法能显著延长网络的生命周期。     

Generation expansion planning in electricity markets: A novel framework based on dynamic stochastic MPEC

This paper presents a novel framework for generation expansion planning (GEP) of restructured power systems under uncertainty in a multi-period horizon, which includes generation investment from a price maker perspective. The investment problem is modeled as a bi-level optimization problem. The first level problem includes decisions related to investment in order to maximize total profit in the planning horizon. The second level problem consists of maximizing social welfare where the power market is cleared. Rival uncertainties on offering and investment are modeled using sets of scenarios. The bi-level optimization problem is then converted to a dynamic stochastic MPEC and represented as a mixed integer linear program (MILP) after linearization. The proposed framework is examined on a typical six-bus power network, MAZANDARAN regional electric company (MREC) transmission network as an area of IRAN interconnected power system and IEEE RTS 24-bus network. Simulation results confirm that the proposed framework can be a useful tool for analyzing the behavior of investments in electricity markets.     

Local toolpath smoothing for five-axis machine tools

When five axis CNC machine tools follow series linear toolpath segments, the drives experience velocity, acceleration and jerk discontinuities at the block transition points. The discontinuities result in fluctuations on machine tool motions which lead to poor surface quality. This paper proposes to insert quintic and septic micro-splines for the tool tip and tool-orientation, respectively, at the adjacent linear toolpath segments. Optimal control points are calculated for position and orientation splines to achieve C³ continuity at the junctions while respecting user-defined tolerance limits. The geometrically smoothed corners are traveled at a smoothly varying feed with cubic acceleration trajectory profile. The proposed method is experimentally demonstrated to show improvements in motion smoothness and tracking accuracy in five-axis machining of free-form surfaces found in dies, molds and aerospace parts.     

基于哈希链的软件定义网络路径安全

针对软件定义网络中，控制器无法保证下发的网络策略能够在转发设备上得到正确执行的安全问题，提出一种新的转发路径监控安全方案。首先以控制器的全局视图能力为基础，设计了基于OpenFlow协议的路径凭据交互处理机制；然后采用哈希链和消息验证码作为生成和处理转发路径凭据信息的关键技术；最后在此基础上，对Ryu控制器和Open vSwitch开源交换机进行深度优化，添加相应处理流程，建立轻量级的路径安全机制。测试结果表明，该机制能够有效保证数据转发路径安全，吞吐量消耗比SDN数据层可信转发方案（SDNsec）降低20%以上，更适用于路径复杂的网络环境，但时延和CPU使用率的浮动超过15%，有待进一步优化。     

A stiffness parameter and truncation error criterion for adaptive path following in structural mechanics

We explore a truncation error criterion to steer adaptive step length refinement and coarsening in incremental-iterative path following procedures, applied to problems in large-deformation structural mechanics. Elaborating on ideas proposed by Bergan and collaborators in the 1970s, we first describe an easily computable scalar stiffness parameter whose sign and rate of change provide reliable information on the local behavior and complexity of the equilibrium path. We then derive a simple scaling law that adaptively adjusts the length of the next step based on the rate of change of the stiffness parameter at previous points on the path. We show that this scaling is equivalent to keeping a local truncation error constant in each step. We demonstrate with numerical examples that our adaptive method follows a path with a significantly reduced number of points compared to an analysis with uniform step length of the same fidelity level. A comparison with Abaqus illustrates that the truncation error criterion effectively concentrates points around the smallest-scale features of the path, which is generally not possible with automatic incrementation solely based on local convergence properties.