Northeastern University (China)

About: Northeastern University (China) is a education organization based out in Shenyang, China. It is known for research contribution in the topics: Microstructure & Control theory. The organization has 36087 authors who have published 36125 publications receiving 426807 citations. The organization is also known as: Dōngběi Dàxué & Northeastern University (东北大学).

A fully automatic deep learning system for COVID-19 diagnostic and prognostic analysis.

Abstract: Confounding variation, such as batch effects, are a pervasive issue in single-cell RNA sequencing experiments. While methods exist for aligning cells across batches, it is yet unclear how to correct for other types of confounding variation which may be observed at the subject level, such as age and sex, and at the cell level, such as library size and other measures of cell quality. On the specific problem of batch alignment, many questions still persist despite recent advances: Existing methods can effectively align batches in low-dimensional representations of cells, yet their effectiveness in aligning the original gene expression matrices is unclear. Nor is it clear how batch correction can be performed alongside data denoising, the former treating technical biases due to experimental stratification while the latter treating technical variation due inherently to the random sampling that occurs during library construction and sequencing. Here, we propose SAVERCAT, a method for dimension reduction and denoising of single-cell gene expression data that can flexibly adjust for arbitrary observed covariates. We benchmark SAVERCAT against existing single-cell batch correction methods and show that while it matches the best of the field in low-dimensional cell alignment, it significantly improves upon existing methods on the task of batch correction in the high-dimensional expression matrix. We also demonstrate the ability of SAVERCAT to effectively integrate batch correction and denoising through a data down-sampling experiment. Finally, we apply SAVERCAT to a single cell study of Alzheimer’s disease where batch is confounded with the contrast of interest, and demonstrate how adjusting for covariates other than batch allows for more interpretable analysis.

An artificial bee colony approach for clustering

Abstract: Clustering is a popular data analysis and data mining technique. In this paper, an artificial bee colony clustering algorithm is presented to optimally partition N objects into K clusters. The Deb's rules are used to direct the search direction of each candidate. This algorithm has been tested on several well-known real datasets and compared with other popular heuristics algorithm in clustering, such as GA, SA, TS, ACO and the recently proposed K-NM-PSO algorithm. The computational simulations reveal very encouraging results in terms of the quality of solution and the processing time required.

Data-Driven Evolutionary Optimization: An Overview and Case Studies

Abstract: Most evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward. In solving many real-world optimization problems, however, such objective functions may not exist. Instead, computationally expensive numerical simulations or costly physical experiments must be performed for fitness evaluations. In more extreme cases, only historical data are available for performing optimization and no new data can be generated during optimization. Solving evolutionary optimization problems driven by data collected in simulations, physical experiments, production processes, or daily life are termed data-driven evolutionary optimization. In this paper, we provide a taxonomy of different data driven evolutionary optimization problems, discuss main challenges in data-driven evolutionary optimization with respect to the nature and amount of data, and the availability of new data during optimization. Real-world application examples are given to illustrate different model management strategies for different categories of data-driven optimization problems.

Robust Global Exponential Synchronization of Uncertain Chaotic Delayed Neural Networks via Dual-Stage Impulsive Control

Abstract: This paper is concerned with the robust exponential synchronization problem of a class of chaotic delayed neural networks with different parametric uncertainties. A novel impulsive control scheme (so-called dual-stage impulsive control) is proposed. Based on the theory of impulsive functional differential equations, a global exponential synchronization error bound together with some new sufficient conditions expressed in the form of linear matrix inequalities (LMIs) is derived in order to guarantee that the synchronization error dynamics can converge to a predetermined level. Furthermore, to estimate the stable region, a novel optimization control algorithm is established, which can deal with the minimum problem with two nonlinear terms coexisting in LMIs effectively. The idea and approach developed in this paper can provide a more practical framework for the synchronization of multiperturbation delayed chaotic systems. Simulation results finally demonstrate the effectiveness of the proposed method.