Modular design of icosahedral metal clusters

The concept of crystalline module, that is, an unambiguously isolated, repeated quasi-molecular element, is introduced. This concept is more general than the concept of crystal lattice. The generalized modular approach allows extension of the methods and principles of crystallography to quasi-crystals, clusters, amorphous solids, and periodic biological structures. Principles of construction of aperiodic, nonequilibrium regular modular structures are formulated. Limitations on the size of icosahedral clusters are due to the presence of spherical shells with non-Euclidean tetrahedral tiling in their structure. A parametric relationship between the structures of icosahedral fullerenes and metal clusters of the Chini series was found.     

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.     

激光通道传输热特性对远场光束质量的影响

 通过仿真计算分析了激光在光束控制系统通道内传输所产生的热效应及其对远场光束质量的影响。激光传播由近轴波方程描述，用快速傅里叶变换技术求解；激光热效应引起的流场密度变化采用完全Navier-Stokes方程计算。计算给出了不同波长、不同吸收系数条件下的远场光斑情况。计算结果表明，在典型的工作条件和状态下，较高能量激光在光束控制系统通道内产生的热效应影响不容忽视，它会明显降低远场目标处的能量集中度，增大光斑的发散。     

水体透射光谱结合主成分分析(PCA )改进化学需氧量(COD)含量估算研究

化学需氧量（Chemical Oxygen Demand,COD）是水体有机污染的一项重要指标,化学需氧量越高,表示水污染程度越严重。 为了解决传统的COD测量方法耗时较长,不利于快速、实时地获取水体中COD的信息等问题。本文提出了基于透射光谱测量结合主成分分析(Principal Component Analysis, PCA)改进水体COD含量估算模型。具体的,采集100组COD水体光谱信息,分别使用3种不同的高光谱数据预处理方法对光谱数据进行预处理,分析不同预处理方法对模型精度的影响,并基于不同的预处理方法分别建立高斯过程回归模型(Gaussian Process Regression, GPR)和BP神经网络模型,分析不同预处理方法对模型精度的影响;并对各模型结合PCA数据降维方法进行模型的改进,通过比较模型的精度选择最优模型进行水体COD含量的检测。结果显示,相比于原始光谱数据建立的GPR模型和BP神经网络模型,数据预处理后的模型精度明显提升;且结合PCA对预处理后的数据进一步降维处理后,模型精度得到了进一步的提升。其中,基于标准正态变量变换特征结合PCA改进BP神经网络模型基于PCA改进的BP神经网络模型R^2高达0.9940,均方根误差RMSE为0.022540。证明了基于PCA改进的BP神经网络数据降维方法对预处理后的光谱数据进行降维处理,有利于去除光谱中的冗余信息,提取特征信息,可以实现高光谱检测方法可以实现COD含量估算模型的优化,从而为传统COD测量方法存在的问题提出了一种新的解决思路。     

An Algorithm Framework for Drug-Induced Liver Injury Prediction Based on Genetic Algorithm and Ensemble Learning

In the process of drug discovery, drug-induced liver injury (DILI) is still an active research field and is one of the most common and important issues in toxicity evaluation research. It directly leads to the high wear attrition of the drug. At present, there are a variety of computer algorithms based on molecular representations to predict DILI. It is found that a single molecular representation method is insufficient to complete the task of toxicity prediction, and multiple molecular fingerprint fusion methods have been used as model input. In order to solve the problem of high dimensional and unbalanced DILI prediction data, this paper integrates existing datasets and designs a new algorithm framework, Rotation-Ensemble-GA (R-E-GA). The main idea is to find a feature subset with better predictive performance after rotating the fusion vector of high-dimensional molecular representation in the feature space. Then, an Adaboost-type ensemble learning method is integrated into R-E-GA to improve the prediction accuracy. The experimental results show that the performance of R-E-GA is better than other state-of-art algorithms including ensemble learning-based and graph neural network-based methods. Through five-fold cross-validation, the R-E-GA obtains an ACC of 0.77, an F1 score of 0.769, and an AUC of 0.842.     

遗传算法优化变分模态分解提取舰船辐射噪声特征线谱方法

特征线谱提取是舰船目标识别的一个重要研究环节,常采用传统的DEMON谱分析方法,处理过程中,一般对舰船噪声时域信号未予抑噪,低信噪比情况下,传统DEMON谱分析性能差。对此,提出一种采用遗传算法优化变分模态分解方法,用于分解舰船噪声原时域信号,获得抑制噪声后的舰船噪声重构信号,进而有效提取了舰船目标噪声幅度调制特征线谱。该方法首先采用遗传算法优化变分模态分解的两个关键输入参数(分解所取模态个数和惩罚因子),对变分模态分解得到的各阶固有模态分量加以判别,去除噪声主导分量,保留信号主导分量,使重构舰船噪声信号显著抑制了干扰噪声,然后对降噪后的重构信号进行频谱分析,获得目标噪声调制特征线谱。理论分析、仿真和实验数据处理结果表明,相比传统DEMON谱分析法,基于遗传算法优化变分模态分解的舰船噪声特征线谱提取方法具有更好的噪声抑制能力,所获取的舰船噪声幅度调制特征线谱信噪比明显高于传统DEMON方法,具有一定优势,前景良好。     

The Classification of Rice Blast Resistant Seed Based on Ranman Spectroscopy and SVM

Rice blast is a serious threat to rice yield. Breeding disease-resistant varieties is one of the most economical and effective ways to prevent damage from rice blast. The traditional identification of resistant rice seeds has some shortcoming, such as long possession time, high cost and complex operation. The purpose of this study was to develop an optimal prediction model for determining resistant rice seeds using Ranman spectroscopy. First, the support vector machine (SVM), BP neural network (BP) and probabilistic neural network (PNN) models were initially established on the original spectral data. Second, due to the recognition accuracy of the Raw-SVM model, the running time was fast. The support vector machine model was selected for optimization, and four improved support vector machine models (ABC-SVM (artificial bee colony algorithm, ABC), IABC-SVM (improving the artificial bee colony algorithm, IABC), GSA-SVM (gravity search algorithm, GSA) and GWO-SVM (gray wolf algorithm, GWO)) were used to identify resistant rice seeds. The difference in modeling accuracy and running time between the improved support vector machine model established in feature wavelengths and full wavelengths (200–3202 cm⁻¹) was compared. Finally, five spectral preproccessing algorithms, Savitzky–Golay 1-Der (SGD), Savitzky–Golay Smoothing (SGS), baseline (Base), multivariate scatter correction (MSC) and standard normal variable (SNV), were used to preprocess the original spectra. The random forest algorithm (RF) was used to extract the characteristic wavelengths. After different spectral preproccessing algorithms and the RF feature extraction, the improved support vector machine models were established. The results show that the recognition accuracy of the optimal IABC-SVM model based on the original data was 71%. Among the five spectral preproccessing algorithms, the SNV algorithm’s accuracy was the best. The accuracy of the test set in the IABC-SVM model was 100%, and the running time was 13 s. After SNV algorithms and the RF feature extraction, the classification accuracy of the IABC-SVM model did not decrease, and the running time was shortened to 9 s. This demonstrates the feasibility and effectiveness of IABC in SVM parameter optimization, with higher prediction accuracy and better stability. Therefore, the improved support vector machine model based on Ranman spectroscopy can be applied to the fast and non-destructive identification of resistant rice seeds.     

免疫算法在双闭环直流调速系统中的应用

文中对双闭环直流调速系统控制器的选择进行了分析,并借鉴免疫算法强大的寻优能力,提出了基于免疫算法的调速系统控制器参数整定方法.为了分析比较,实际应用中采用了三种控制器参数整定方法,比较结果说明,免疫算法在调速系统控制器参数整定中的应用是更加有效的.通过在单晶炉拉晶过程的应用,证明该方法可行性和正确性.     

EGFAFS: A Novel Feature Selection Algorithm Based on Explosion Gravitation Field Algorithm

Feature selection (FS) is a vital step in data mining and machine learning, especially for analyzing the data in high-dimensional feature space. Gene expression data usually consist of a few samples characterized by high-dimensional feature space. As a result, they are not suitable to be processed by simple methods, such as the filter-based method. In this study, we propose a novel feature selection algorithm based on the Explosion Gravitation Field Algorithm, called EGFAFS. To reduce the dimensions of the feature space to acceptable dimensions, we constructed a recommended feature pool by a series of Random Forests based on the Gini index. Furthermore, by paying more attention to the features in the recommended feature pool, we can find the best subset more efficiently. To verify the performance of EGFAFS for FS, we tested EGFAFS on eight gene expression datasets compared with four heuristic-based FS methods (GA, PSO, SA, and DE) and four other FS methods (Boruta, HSICLasso, DNN-FS, and EGSG). The results show that EGFAFS has better performance for FS on gene expression data in terms of evaluation metrics, having more than the other eight FS algorithms. The genes selected by EGFAGS play an essential role in the differential co-expression network and some biological functions further demonstrate the success of EGFAFS for solving FS problems on gene expression data.     

强激光远场焦斑重构算法研究

通过CCD图像采集单元结合传统的列阵相机测量高功率固体激光器的远场焦斑分布,采用图像处理技术的边缘算子提取焦斑的几何中心,提出通过几何中心对心的焦斑嵌套重构算法,解决了光斑饱和时的对心难题,实现了快捷准确测量激光焦斑,为激光器的实时控制提供参考数据。