Dynamic stability of a class of fractional-order nonlinear systems via fixed point theory

In this paper, the problem of the uniform stability for a class of fuzzy fractional-order genetic regulatory networks with random discrete delays, distributed delays, and parameter uncertainties is studied. Although there is a portion of literature on using fixed point theorems to study the stability of fractional neural networks, most of them required the fractional order to be in $\left(\frac{1}{2},1\right)$. However, the case of the fractional-order belonging to $(0,\frac{1}{2})$ has not been discussed. To solve it, this work proposes a novel idea of using fixed point theory to study the stability of fuzzy (0,1) order neural networks, the problem of the uniqueness of the solution of the considered genetic regulatory networks is resolved, and a novel sufficient condition to guarantee the uniform stability of above genetic regulatory networks is also derived. Eventually, an example is given to demonstrate that the obtained result is effective.     

Gear shifting multi-objective optimization to improve vehicle performance,fuel consumption,and engine emissions

In the present work, the Adaptive-Weight Genetic Algorithm was employed in order to determine the gear shifting strategies that allow an automobile to work in the best compromise among fuel consumption, engine emissions, and vehicle performance. For the assessment of each of the three objective functions, a simulation model based on engine data and on the well-established equations of the longitudinal dynamics was developed. The driving cycle chosen for the calculations was the FTP-75, which takes into account both cold and hot starts, meaning that the transient operation during the warm-up of the catalyst is also considered.     

大花无柱兰遗传多样性的SRAP标记分析

大花无柱兰是一种珍稀兰科植物，具有一定的观赏和药用价值，但数量十分稀少，该物种亟待保护。本研究采用SRAP分子标记技术，对10个居群的115份DNA样品进行PCR扩增，并开展遗传多样性分析。从81对引物中筛选出9个条带清晰、多态性好、重复性高的引物组合，共扩增得到305条谱带。在物种水平上，多态性比率（PPB）为100%，Nei’s基因多样性指数（H）为0.209 8，Shannon’s指数（I）为0.340 2；在居群水平上，PPB为24.59%～52.13%，H为0.079 6～0.165 5，I为0.120 9～0.252 3。居群水平上，基因分化度（Gst）为0.520 9，基因流（Nm）为0.459 9，遗传距离为0.091 9～0.198 4。UPGMA聚类结果表明，10个居群可分为3大类，地理距离相近的居群优先聚集。大花无柱兰的遗传多样性较为丰富，居群间存在一定的遗传分化和基因交流，可采用就地保护和人工栽培等方式加以保护。     

Inference of gene regulatory networks with multi-objective cellular genetic algorithm

Reverse engineering of biochemical networks remains an important open challenge in computational systems biology. The goal of model inference is to, based on time-series gene expression data, obtain the sparse topological structure and parameters that quantitatively understand and reproduce the dynamics of biological systems. In this paper, we propose a multi-objective approach for the inference of S-System structures for Gene Regulatory Networks (GRNs) based on Pareto dominance and Pareto optimality theoretical concepts instead of the conventional single-objective evaluation of Mean Squared Error (MSE). Our motivation is that, using a multi-objective formulation for the GRN, it is possible to optimize the sparse topology of a given GRN as well as the kinetic order and rate constant parameters in a decoupled S-System, yet avoiding the use of additional penalty weights. A flexible and robust Multi-Objective Cellular Evolutionary Algorithm is adapted to perform the tasks of parameter learning and network topology inference for the proposed approach. The resulting software, called MONET, is evaluated on real-based academic and synthetic time-series of gene expression taken from the DREAM3 challenge and the IRMA in vivo datasets. The ability to reproduce biological behavior and robustness to noise is assessed and compared. The results obtained are competitive and indicate that the proposed approach offers advantages over previously used methods. In addition, MONET is able to provide experts with a set of trade-off solutions involving GRNs with different typologies and MSEs.     

An exact algorithm for solving the bilevel facility interdiction and fortification problem

We present an exact approach for solving the $r$-interdiction median problem with fortification. Our approach consists of solving a greedy heuristic and a set cover problem iteratively that guarantees to find an optimal solution upon termination. The greedy heuristic obtains a feasible solution to the problem, and the set cover problem is solved to verify optimality of the solution and to provide a direction for improvement if not optimal. We demonstrate the performance of the algorithm in a computational study.     

Binary neutron stars gravitational wave detection based on wavelet packet analysis and convolutional neural networks

This work investigates the detection of binary neutron stars gravitational wave based on convolutional neural network(CNN).To promote the detection performance and efficiency,we proposed a scheme based on wavelet packet(WP)decomposition and CNN.The WP decomposition is a time-frequency method and can enhance the discriminant features between gravitational wave signal and noise before detection.The CNN conducts the gravitational wave detection by learning a function mapping relation from the data under being processed to the space of detection results.This function-mapping-relation style detection scheme can detection efficiency significantly.In this work,instrument effects are con-sidered,and the noise are computed from a power spectral density(PSD)equivalent to the Advanced LIGO design sensitivity.The quantitative evaluations and comparisons with the state-of-art method matched filtering show the excellent performances for BNS gravitational wave detection.On efficiency,the current experiments show that this WP-CNN-based scheme is more than 960 times faster than the matched filtering.