Search

Dynamic economic dispatch (DED) is a multi constraint and nonlinear complex problem, which is embodied in the dynamic decision-making coupled with each other in time and space. It is generally transformed into a high-dimensional multi constraint optimization problem. In this paper, a multi Strategy firefly algorithm (MSRFA) is proposed to solve the DED problem. MSRFA puts forward three strategies through the idea of opposite learning strategy and rough data reasoning to optimize the initialization and iteration process of the algorithm, improve the convergence speed of the algorithm in medium and high dimensions, and improve the escape ability when the algorithm falls into local optimization; The performance of MSRFA is tested in the simulation experiment of DED problem. The experimental results show that MSRFA can search the optimal power generation cost and minimum load error in the experiment, which reflects MSRFA superior stability and ability to jump out of local optimization. Therefore, MSRFA is an efficient way to solve the DED problem.

The biologically inspired metaheuristic algorithm obtains the optimal solution by simulating the living habits or behavior characteristics of creatures in nature. It has been widely used in many fields. A new bio-inspired algorithm, Aphids Optimization Algorithm (AOA), is proposed in this paper. This algorithm simulates the foraging process of aphids with wings, including the generation of winged aphids, flight mood, and attack mood. Concurrently, the corresponding optimization models are presented according to the above phases. At the phase of the flight mood, according to the comprehensive influence of energy and the airflow, the individuals adaptively choose the flight mode to migrate; at the phase of attack mood, individuals use their sense of smell and vision to locate food sources for movement. Experiments on benchmark test functions and two classical engineering design problems, indicate that the desired AOA is more efficient than other metaheuristic algorithms.

This article investigates the attitude stabilization problem of a rigid spacecraft with actuator saturation and failures. Two neural network-based control schemes are proposed using anti-saturation adaptive strategies. To satisfy the input constraint, we design two controllers in a saturation function structure. Taking into account the modeling uncertainties, external disturbances, and adverse effects from actuator faults and failures, the first anti-saturation adaptive controller is implemented based on radial basis function neural networks (RBFNNs) with a fixed-time terminal sliding mode (FTTSM) containing a tunable parameter. Then, we upgrade the proposed controller to a fully adaptive-gain anti-saturation version, in order to strengthen the robustness and adaptivity with respect to actuator faults and failures, unknown mass properties, and external disturbances. In the two schemes, all of the designed adaptive parameters are scalars, thus they only require light computational load and can avoid the redesign process of the controller during spacecraft operation. Finally, the feasibility of the proposed methods is illustrated via two numerical examples.

When TextRank algorithm based on graph model constructs graph associative edges, the co-occurrence window rules only consider the relationships between local terms. Using the information in the document itself is limited. In order to solve the above problems, an improved TextRank keyword extraction algorithm based on rough data reasoning combined with word vector clustering, RDD-WRank, was proposed. Firstly, the algorithm uses rough data reasoning to mine the association between candidate keywords, expands the search scope, and makes the results more comprehensive. Then, based on Wikipedia online open knowledge base, word embedding technology is used to integrate Word2Vec into the improved algorithm, and the word vector of TextRank lexical graph nodes is clustered to adjust the voting importance of nodes in the cluster. Compared with the traditional TextRank algorithm and the Word2Vec algorithm combined with TextRank, the experimental results show that the improved algorithm has significantly improved the extraction accuracy, which proves that the idea of using rough data reasoning can effectively improve the performance of the algorithm to extract keywords.

In this article, we investigate the fixed-time behavioral control problem for a team of second-order nonlinear agents, aiming to achieve a desired formation with collision/obstacle avoidance. In the proposed approach, the two behaviors(tasks) for each agent are prioritized and integrated via the framework of the null-space-based behavioral projection, leading to a desired merged velocity that guarantees the fixed-time convergence of task errors. To track this desired velocity, we design a fixed-time sliding-mode controller for each agent with state-independent adaptive gains, which provides a fixed-time convergence of the tracking error. The control scheme is implemented in a distributed manner, where each agent only acquires information from its neighbors in the network. Moreover, we adopt an online learning algorithm to improve the robustness of the closed system with respect to uncertainties/disturbances. Finally, simulation results are provided to show the effectiveness of the proposed approach.

Background Epigenetic alterations are involved in most cancers, but its application in cancer diagnosis is still limited. More practical and intuitive methods to detect the aberrant expressions from clinical samples using highly sensitive biomarkers are needed. In this study, we developed a novel approach in identifying, visualizing, and quantifying the biallelic and multiallelic expressions of an imprinted gene panel associated with cancer status. We evaluated the normal and aberrant expressions measured using the imprinted gene panel to formulate diagnostic models which could accurately distinguish the imprinting differences of normal and benign cases from cancerous tissues for each of the ten cancer types. Results The Quantitative Chromogenic Imprinted Gene In Situ Hybridization (QCIGISH) method developed from a 1013-case study which provides a visual and quantitative analysis of non-coding RNA allelic expressions identified the guanine nucleotide-binding protein, alpha-stimulating complex locus (GNAS), growth factor receptor-bound protein (GRB10), and small nuclear ribonucleoprotein polypeptide N (SNRPN) out of five tested imprinted genes as efficient epigenetic biomarkers for the early-stage detection of ten cancer types. A binary algorithm developed for cancer diagnosis showed that elevated biallelic expression (BAE), multiallelic expression (MAE), and total expression (TE) measurements for the imprinted gene panel were associated with cell carcinogenesis, with the formulated diagnostic models achieving consistently high sensitivities (91–98%) and specificities (86–98%) across the different cancer types. Conclusions The QCIGISH method provides an innovative way to visually assess and quantitatively analyze individual cells for cancer potential extending from hyperplasia and dysplasia until carcinoma in situ and invasion, which effectively supplements standard clinical cytologic and histopathologic diagnosis for early cancer detection. In addition, the diagnostic models developed from the BAE, MAE, and TE measurements of the imprinted gene panel GNAS, GRB10, and SNRPN could provide important predictive information which are useful in early-stage cancer detection and personalized cancer management.

In this paper, a hierarchical multi-task structural learning algorithm is developed to support large-scale plant species identification, where a visual tree is constructed for organizing large numbers of plant species in a coarse-to-fine fashion and determining the inter-related learning tasks automatically. For a given parent node on the visual tree, it contains a set of sibling coarse-grained categories of plant species or sibling fine-grained plant species, and a multi-task structural learning algorithm is developed to train their inter-related classifiers jointly for enhancing their discrimination power. The inter-level relationship constraint, e.g., a plant image must first be assigned to a parent node (high-level non-leaf node) correctly if it can further be assigned to the most relevant child node (low-level non-leaf node or leaf node) on the visual tree, is formally defined and leveraged to learn more discriminative tree classifiers over the visual tree. Our experimental results have demonstrated the effectiveness of our hierarchical multi-task structural learning algorithm on training more discriminative tree classifiers for large-scale plant species identification.