A high-throughput chaotic advection microreactor for preparation of uniform and aggregated barium sulfate nanoparticles

A high-throughput (105.5 g/h) passive four-stage asymmetric oscillating feedback microreactor using chaotic mixing mechanism was developed to prepare aggregated Barium sulfate (BaSO₄) particles of high primary nanoparticle size uniformity. Three-dimensional unsteady simulations showed that chaotic mixing could be induced by three unique secondary flows (i.e., vortex, recirculation, and oscillation), and the fluid oscillation mechanism was examined in detail. Simulations and Villermaux–Dushman experiments indicate that almost complete mixing down to molecular level can be achieved and the prepared BaSO₄ nanoparticles were with narrow primary particle size distribution (PSD) having geometric standard deviation, σ_g, less than 1.43 when the total volumetric flow rate Q_total was larger than 10 ml/min. By selecting Q_total and reactant concentrations, average primary particle size can be controlled from 23 to 109 nm as determined by microscopy. An average size of 26 nm with narrow primary PSD (σ_g = 1.22) could be achieved at Q_total of 160 ml/min.     

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.     

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

风速时间序列混沌判定方法比较研究

混沌识别是对非线性时间序列进行混沌预测的前提。针对时间序列风速确定性与随机性相结合的复杂非线性特征,研究了不同的混沌识别方法,并对风速时间序列进行混沌特征识别。应用随机噪声、周期运动及经典混沌系统的时间序列对所选方法进行可靠性验证。对美国国家风能研究中心M2测风塔实测时间序列风速数据进行非线性混沌特征识别。结果表明:风速时间序列具有明显的混沌特征;各风速时间序列表现出不同程度的混沌特征;各混沌识别方法对风速时间序列混沌特征的表达形式不同,互为补充,相互验证。     

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.     

An intelligent EGWO-SCA-CS algorithm for PSS parameter tuning under system uncertainties

This paper proposes a novel hybrid technique called enhanced grey wolf optimization-sine cosine algorithm-cuckoo search (EGWO-SCA-CS) algorithm to improve the electrical power system stability. The proposed method comprises of a popular grey wolf optimization (GWO) in an enhanced and hybrid form. It embraces the well-balanced exploration and exploitation using the cuckoo search (CS) algorithm and enhanced search capability through the sine cosine algorithm (SCA) to elude the stuck to the local optima. The proposed technique is validated with the 23 benchmark functions and compared with state-of-the-art methods. The benchmark functions consist of unimodal, multimodal function from which the best suitability of the proposed technique can be identified. The robustness analysis also presented with the proposed method through boxplot, and a detailed statistical analysis is performed for a set of 30 individual runs. From the inferences gathered from the benchmark functions, the proposed technique is applied to the stability problem of a power system, which is heavily stressed with the nonlinear variation of the load and thereby operating conditions. The dynamics of power system components have been considered for the mathematical model of a multimachine system, and multiobjective function has been framed in tuning the optimal controller parameters. The effectiveness of the proposed algorithm has been assessed by considering two case studies, namely, (i) the optimal controller parameter tuning, and (ii) the coordination of oscillation damping devices in the power system stability enhancement. In the first case study, the power system stabilizer (PSS) is considered as a controller, and a self-clearing three-phase fault is considered as the system uncertainty. In contrast, static synchronous compensator (STATCOM) and PSS are considered as controllers to be coordinated, and perturbation in the system states as uncertainty in the second case study.     

Simultaneous identification of structural stiffness and mass parameters based on Bare-bones Gaussian Tree Seeds Algorithm using time-domain data

This paper mainly illustrates the Tree Seeds Algorithm (TSA) to tackle structural damage identification problem. The damage model is simulated by the alterations of both stiffness and mass parameters. The objective function is introduced by minimizing the differences between the measured and calculated acceleration data. To enhance the performance of the standard TSA, two modifications including the bare-bones Gaussian updated mechanism and the withering process are introduced. The modified algorithm is named after the BGTSA. In the numerical simulation part, the BGTSA is firstly used to make comparisons with several state-of-the-art algorithms on the CEC05. Secondly, the BGTSA is utilized to deal with the structural damage identification problem by optimizing the acceleration-based nonlinear objective function. Numerical experiments involving a simply supported beam and a truss are carried out to verify the effectiveness of the proposed algorithm. The final results show that with low amount of acceleration data, the BGTSA can acquire better identification results compared with other evolutionary algorithms. Therefore the proposed algorithm could be viewed as a potential tool to solve the structural damage identification problem.     

基于k-shell的复杂网络最短路径近似算法

复杂网络最短路径经典算法的处理效率较低，不适用于大规模复杂网络，而现有近似算法通用性有限，且计算准确率不理想，不能满足规模日益扩大的复杂网络中的最短路径计算需求。针对于此，提出基于[k]-shell的复杂网络最短路径近似算法。算法利用节点的[k]-shell值进行网络划分并引导搜索路径，利用超点聚合处理[k]-shell子网来降低路径搜索中节点和连边的规模，通过在路径搜索过程使用双向搜索树方法提高算法的计算效率和准确率。实验结果表明，算法通用性较好，在现实与仿真大规模复杂网络中均具有较高的计算效率和准确率。