新一代信息基础设施推动能源发展的路径安排和绩效研究

随着信息技术的迅猛发展,其带来的变革浪潮涌动在各个角落。作为社会的运行动脉,能源的产生运转和利用体系享受新一代信息基础设施的优势,发生着巨大变化。文章研究了新一代信息基础设施对于能源革命的推动传导方式的影响,分析了在这一过程中新一代信息基础设施普及对能源行业及能源使用方式的影响。基于过往信息化数据、已有理论及当下流行的5G运用方式,做回溯性探究,前瞻未来能源革命的蓝图。     

车辆高速避让路径跟踪控制策略

建立车辆动力学模型,研究车辆在高速避让工况下的路径跟踪控制策略。基于自抗扰控制设计车辆横摆角速度以及道路曲率2种不同的路径跟踪控制器;设计基于车辆偏航位移和偏航角度加权的线性二次最优控制器;对3种控制器控制效果进行仿真验证,分析路径跟踪侧向位移误差、侧向加速度、前轮转向角以及偏航角度变化。越野车实车测试结果表明,路径跟踪控制策略正确。     

钛合金铣削加工表面残余应力有限元仿真

为了分析铣削工艺参数对钛合金已加工表面残余应力的影响,根据金属切削有限元分析的相关理论,以钛合金Ti6Al4V为工件材料,建立了铣削加工的有限元模型。采用正交试验设计法对钛合金Ti6Al4V铣削仿真的工艺参数进行优化,并用极差法分析不同的铣削速度、铣削深度、铣削路径对钛合金Ti6Al4V工已加工表面残余应力的影响。研究表明:在钛合金Ti6Al4V铣削过程中,对工件已加工表面残余应力影响因素由小到大依次为:铣削深度<铣削路径<铣削速度,切削深度对已加工表面残余应力影响较小,铣削速度对已加工表面残余应力影响最大;在研究范围内,随着铣削速度的增大,已加工表面残余应力逐渐增加。     

Cooperative path planning with priority target assignment and collision avoidance guidance for rescue unmanned surface vehicles in a complex ocean environment

In this paper, a novel cooperative path planning scheme of unmanned surface vehicles (USVs) for rescuing targets in a complex ocean environment is proposed. The primary objective of the rescue USVs is to bring all targets back safely on the premise of first rescuing priority targets, while optimizing the path length, the navigation time and the angular energy. The main contributions of this paper are as follows: (1) The proposed K-means-division (KMD) algorithm is able to identify a complex ocean environment with collision-free zone and static-obstacles zone; (2) The proposed path planning method with fast-marching-method-based ellipse guidance range (E-FMM) is able to optimize the angular energy while ensuring safety; (3) The proposed cooperative management system (including priority-target-assignment (PTA) with reward-mechanism genetic-optimization (RM-GO) and collision-avoidance (CA) guidance law with Tangent-based surge-varying wave-disturbances-observer (Tangent-SV-WDO)) can accomplish the mission of the rescue USVs. Comparative studies with the state-of-the-art methods demonstrate that the proposed cooperative path planning scheme is superior in terms of priority-target-assignment (PTA) and collision-avoidance (CA) of the actual rescue work.     

个性化学习路径推荐综述

近年来，伴随着现代信息技术的迅猛发展，以人工智能为代表的新兴技术在教育领域得到了广泛应用，引发了学习理念和方式的深刻变革.在这种大背景下，在线学习超越了时空的限制，为学习者“随时随地”学习提供了更多的可能性，从而得到了蓬勃发展.然而，在线学习中师生时间、空间分离的特征，导致教师无法及时掌握学生的学习状态，一定程度上制约了在线学习中教学质量的提升.面对多元化的学习需求及海量学习资源，如何迅速完成学习目标、降低学习成本、合理分配学习资源等问题成为限制个人和时代发展的重大问题.然而，传统的“一刀切”的教育模式已经不能满足人们获取知识的需求了，需要一个更高效、更科学的个性化教育模式，以帮助学习者以最小的学习成本最大限度地完成学习目标.基于以上背景，如何自动高效识别学习者特征，高效地组织和分配学习资源，为每一位学习者规划个性化路径，成为面向个体的精准化教育资源匹配机制研究中亟待解决的问题.系统地综述并分析了当前个性化学习路径推荐的研究现状，并从多学科领域的角度分析了对于同一问题的不同研究思路，同时也归纳总结了当前研究中最为主流的核心推荐算法.最后，强调当前研究存在的主要不足之处.     

Frequency domain analysis of the mirror-modified filtered-x least mean squares algorithm with low ambient noise

The mirror-modified filtered-x least mean squares (MMFxLMS ) algorithm is a variation of the FxLMS algorithm with online secondary path modeling that cannot diverge due to secondary path modeling errors. However, problems may occur when the ambient noise is not limited due to insufficient modeling power. This work shows that under a frequency domain analysis without ambient noise, the MMFxLMS algorithm is always stable, and expressions for the maximum residual noise level at any given time are obtained. It is also shown that, under the same context, convergence to the minimum residual noise is guaranteed. Still, convergence can be much slower for high secondary path modeling errors than that of the LMS or MFxLMS algorithms. Simulations confirm these results.     

A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem

We address the problem of determining all extreme supported solutions of the biobjective shortest path problem. A novel Dijkstra-like method generalizing Dijkstra׳s algorithm to this biobjective case is proposed. The algorithm runs in O(N(m+n log n)) time to solve one-to-one and one-to-all biobjective shortest path problems determining all extreme supported non-dominated points in the outcome space and one supported efficient path associated with each one of them. Here n is the number of nodes, m is the number of arcs and N is the number of extreme supported points in outcome space for the one-to-all biobjective shortest path problem. The memory space required by the algorithm is O(n+m) for the one-to-one problem and O(N+m) for the one-to-all problem. A computational experiment comparing the performance of the proposed methods and state-of-the-art methods is included.     

景德镇陶瓷产业集群升级研究——从路径依赖到路径创造

产业集群在演化过程中面临着路径依赖和锁定效应的风险。从景德镇陶瓷产业集群创新能力衰退的原因分析入手,提出景德镇陶瓷产业集群升级的关键在于摆脱低效率的路径依赖,通过路径创造以实现产业结构的优化,进而促进景德镇陶瓷产业集群发展成为具有创新力和竞争力的区域创新系统。     

新型四带小型胶联改造

针对新型结构产品设备,将设备厂家因设计缺陷造成的问题进行逐一改造,以满足产品生产的需求,也列轮胎生产行业的类似设备改善提供实例,节约新设备投资。     

长输管道沿线高程提取技术研究

在Googel Earth卫星地图上选出长输管道线路,将线路经纬度坐标及高程借助一些工具软件迚行自动提取,并经过一番处理,在Excel中生成散点图,即里高程变化图。