Coverage optimization algorithm based on VF-CS in mobile sensor network

A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.     

镁合金网格壁板压弯成形数值模拟及实验研究

为探索镁合金整体壁板压弯成形的可行性,以及镁合金壁板压弯成形过程中金属的流动规律,对AZ31镁合金网格壁板压弯成形进行了数值模拟和实验研究。建立了有限元数值模拟的几何模型,采用有限元计算软件对AZ31镁合金网格壁板压弯成形过程进行了数值模拟研究,分析了镁合金网格壁板压弯成形中的温度场、应变场、应力场、破坏系数等的分布规律。确定了合适的AZ31镁合金壁板压弯成形工艺参数,并对镁合金网格壁板压弯成形进行了实验研究,获得了合格的镁合金网格壁板弯曲件,并分析了镁合金网格壁板成形件尺寸精度,模拟结果与实验结果相吻合,最大相对误差为16.7%。     

直流配网型混合动力系统在车客渡船上的应用

针对车客渡船动力负荷切换频繁,传统柴油机推进油耗高、排放和噪声大的问题,提出一种基于变速发电机组和超级电容储能装置的直流配网型混合动力系统。目前系统已成功应用于“江苏路渡3011”轮,实船运行数据显示:该混合动力系统不仅能达到较好的节油效果、降低排放,更在操控性、舒适性上优于传统的柴油机推进模式。     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

“电网一张图”时空信息管理系统

文章首先总结了电力企业信息管理系统的现状,提出了多源信息管理系统融合集成的邦联、子集和完全融合3种方式,分析了3种方式的优缺点,以建设企业"互联网搜索"型数字引擎为目标,提出了融合基于本体的图数据库建模,多维关联与路径因果分析,和人机共生互动可视化决策于一体的企业信息管理系统技术发展趋势;在系统分析目前正在快速发展的图数据库技术与传统关系数据库之间的本质区别基础上,总结原创的电力图计算平台技术的特点;在此基础上讨论"电网一张图"在建设能源互联网时空信息管理平台数据关联索引图中的核心作用,提出了支持能源互联网建设的"电网一张图"时空信息管理系统的技术架构与特点,最后总结"电网一张图"时空信息管理系统在提高电网安全运行水平、提升客户服务水平、增强清洁能源消纳水平、改善经营绩效水平、以及为综合能源服务和建设能源生态等提供数据服务方面的广阔应用场景。     

计及时间相关性的微能源网鲁棒规划方法

微能源网以能源的梯级利用为原则,可实现风、光等多种新能源的高比例消纳,满足区域内电、热、冷等多种能源需求。微能源网中存在新能源出力与冷、热、电负荷的多重不确定性。为增强系统规划结果的鲁棒性,常采用不确定集表述新能源出力与多种用能需求的不确定性,实现针对微能源网的鲁棒规划设计,往往使系统规划结果过于保守,降低系统经济性。为克服以上问题,规避实际运行中不可能发生的场景,降低系统规划结果的保守性,文章提出一种考虑时间相关性的微能源网鲁棒规划模型。该模型在计及多重源荷不确定性的基础上,进一步考虑新能源出力与冷、热、电负荷的时间相关性。通过算例对传统不确定集与所提出的改进不确定集进行对比分析,验证了所提模型及方法的优越性和有效性。     

基于大数据挖掘的用电行为分析

得益于智能电网的发展,电力大数据的价值与作用逐渐被挖掘。通过对电力大数据的深入挖掘与研究,可促进电网企业管理水平的进一步提升,为我国智能电网的发展提供助力。而依托于大数据挖掘的用户用电行为分析,可实现当前企业电网调控与需求侧的充分融合,为电力系统的稳定性运行提供保障。基于此,文章针对大数据挖掘的用电行为分析进行深入探析,以期为智能电网发展提供帮助。     

Hybrid self-inertia weight adaptive particle swarm optimisation with local search using C4.5 decision tree classifier for feature selection problems

ABSTRACT

Feature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets.     

Large neighborhood search for the bike request scheduling problem

This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds.     

基于光纤光栅传感的低功耗小型化电网智能感知系统

文章针对监测装置现场取电难的问题,为智能电网盲区和多事态区监测提供解决方案。本研究设计并实现了一种可用于电网智能感知的光纤光栅传感系统,由多参量的光纤光栅传感器和解调仪组成,该解调仪采用可调谐激光器作激发光源,以20×70×90 mm的微型体积,实现2 W的低功耗。系统解调仪最多可容纳4通道光纤光栅传感器,重量小于500 g,分辨率为0.5 pm,精度±2 pm,测量频率可达100 Hz,光信息可通过电力通讯光缆传输,满足多数电网设备监测需求。该传感系统功耗低、体积小,可实现多参量监测,完全满足智能电网现场供电和通讯难、事态多发的监测需求。