Inverse Problems for Dynamic Systems: Classification and Solution Methods

The inverse problems for motions of dynamic systems of which are described by system of the ordinary differential equations are examined. The classification of such type of inverse problems is given. It was shown that inverse problems can be divided into two types: synthesis inverse problems and inverse problems of measurement (recognition). Each type of inverse problems requires separate approach to statements and solution methods. The regularization method for obtaining of stable solution of inverse problems was suggested. In some cases, instead of recognition of inverse problems solution, the estimation of solution can be used. Within the framework of this approach, two practical inverse problems of measurement are considered.

Vibrating Particles System Algorithm for Solving Classification Problems

Big data is a term that refers to a set of data that,due to its largeness or complexity,cannot be stored or processed with one of the usual tools or applications for data management,and it has become a prominent word in recent years for the massive development of technology.Almost immediately thereafter,the term“big data mining”emerged,i.e.,mining from big data even as an emerging and interconnected field of research.Classification is an important stage in data mining since it helps people make better decisions in a variety of situations,including scientific endeavors,biomedical research,and industrial applications.The probabilistic neural network(PNN)is a commonly used and successful method for handling classification and pattern recognition issues.In this study,the authors proposed to combine the probabilistic neural network(PPN),which is one of the data mining techniques,with the vibrating particles system(VPS),which is one of the metaheuristic algorithms named“VPS-PNN”,to solve classi-fication problems more effectively.The data set is eleven common benchmark medical datasets from the machine-learning library,the suggested method was tested.The suggested VPS-PNN mechanism outperforms the PNN,biogeography-based optimization,enhanced-water cycle algorithm(E-WCA)and the firefly algorithm(FA)in terms of convergence speed and classification accuracy.

A Preliminary Study on the Problems and Improvement of the Latest Land Use Classification System in China

The establishment of a unified land use classification system is the basis for realizing the unified management of land and sea,urban and rural areas,and aboveground and underground space.In November 2020,the Ministry of Natural Resources of the People's Republic of China issued the Classification Guide for Land and Space Survey,Planning and Use Control of Land and Sea(for Trial Implementation),which aims to establish a national unified land and sea use classification system,lay an important foundation for scientific planning and unified management of natural resources,rational use and protection of natural resources,and speed up the construction of a new pattern of land and space development and protection.However,there are still some obvious shortcomings in the Classification Guide.This paper analyzes some problems existing in this classification standard from three aspects of logicality,rigorousness and comprehensiveness,and puts forward some suggestions for further improvement.This has important practical significance to better guiding the practice of land use and land resources management,and then to achieving the goal of unified management of natural resources.

Incident and Problem Ticket Clustering and Classification Using Deep Learning

A holistic analysis of problem and incident tickets in a real production cloud service environment is presented in this paper.By extracting different bags of words,we use principal component analysis(PCA)to examine the clustering characteristics of these tickets.Then Kmeans and latent Dirichlet allocation(LDA)are applied to show the potential clusters within this Cloud environment.The second part of our study uses a pre-trained bidirectional encoder representation from transformers(BERT)model to classify the tickets,with the goal of predicting the optimal dispatching department for a given ticket.Experimental results show that due to the unique characteristics of ticket description,pre-processing with domain knowledge turns out to be critical in both clustering and classification.Our classification model yields 86%accuracy when predicting the target dispatching department.

Improved Classification Approach via GEPSVM

A modified multisurface ＂proximal support vector machine classifier via generalized eigenvalues （GEPSVM for short）＂ was proposed. By defining a new principle, we designed a new classification approach via GEPSVM, namely, maximum or minimum plane distance GEPSVM （MPDGEPSVM）. Unlike GEPSVM, our approach obtains two planes by solving two simple eigenvalue problems, such that it can avoid occurrence of singular problems. Our approach, compared with GEPSVM, has better classification performalce. Moreover, MPDGEPSVM is over one order of magnitude faster than GEPSVM, and almost two orders of magnitude faster than SVM. Computational results on public datasets from UCI database illustrated the efficiency of MPDGEPSVM.

MCBC-SMOTE:A Majority Clustering Model for Classification of Imbalanced Data

Datasets with the imbalanced class distribution are difficult to handle with the standard classification algorithms.In supervised learning,dealing with the problem of class imbalance is still considered to be a challenging research problem.Various machine learning techniques are designed to operate on balanced datasets;therefore,the state of the art,different undersampling,over-sampling and hybrid strategies have been proposed to deal with the problem of imbalanced datasets,but highly skewed datasets still pose the problem of generalization and noise generation during resampling.To overcome these problems,this paper proposes amajority clusteringmodel for classification of imbalanced datasets known as MCBC-SMOTE(Majority Clustering for balanced Classification-SMOTE).The model provides a method to convert the problem of binary classification into a multi-class problem.In the proposed algorithm,the number of clusters for themajority class is calculated using the elbow method and the minority class is over-sampled as an average of clustered majority classes to generate a symmetrical class distribution.The proposed technique is cost-effective,reduces the problem of noise generation and successfully disables the imbalances present in between and within classes.The results of the evaluations on diverse real datasets proved to provide better classification results as compared to state of the art existing methodologies based on several performance metrics.

Advanced Hierarchical Fuzzy Classification Model Adopting Symbiosis Based DNA-ABC Optimization Algorithm

This paper offers a symbiosis based hybrid modified DNA-ABC optimization algorithm which combines modified DNA concepts and artificial bee colony (ABC) algorithm to aid hierarchical fuzzy classification. According to literature, the ABC algorithm is traditionally applied to constrained and unconstrained problems, but is combined with modified DNA concepts and implemented for fuzzy classification in this present research. Moreover, from the best of our knowledge, previous research on the ABC algorithm has not combined it with DNA computing for hierarchical fuzzy classification to explore the merits of cooperative coevolution. Therefore, this paper is the first to apply the mechanism of symbiosis to create a hybrid modified DNA-ABC algorithm for hierarchical fuzzy classification applications. In this study, the partition number and the shape of the membership function are extracted by the symbiosis based hybrid modified DNA-ABC optimization algorithm, which provides both sufficient global exploration and also adequate local exploitation for hierarchical fuzzy classification. The proposed optimization algorithm is applied on five benchmark University of Irvine (UCI) data sets, and the results prove the efficiency of the algorithm.

Identifying multidisciplinary problems from scientific publications based on a text generation method

Purpose:A text generation based multidisciplinary problem identification method is proposed,which does not rely on a large amount of data annotation.Design/methodology/approach:The proposed method first identifies the research objective types and disciplinary labels of papers using a text classification technique;second,it generates abstractive titles for each paper based on abstract and research objective types using a generative pre-trained language model;third,it extracts problem phrases from generated titles according to regular expression rules;fourth,it creates problem relation networks and identifies the same problems by exploiting a weighted community detection algorithm;finally,it identifies multidisciplinary problems based on the disciplinary labels of papers.Findings:Experiments in the“Carbon Peaking and Carbon Neutrality”field show that the proposed method can effectively identify multidisciplinary research problems.The disciplinary distribution of the identified problems is consistent with our understanding of multidisciplinary collaboration in the field.Research limitations:It is necessary to use the proposed method in other multidisciplinary fields to validate its effectiveness.Practical implications:Multidisciplinary problem identification helps to gather multidisciplinary forces to solve complex real-world problems for the governments,fund valuable multidisciplinary problems for research management authorities,and borrow ideas from other disciplines for researchers.Originality/value:This approach proposes a novel multidisciplinary problem identification method based on text generation,which identifies multidisciplinary problems based on generative abstractive titles of papers without data annotation required by standard sequence labeling techniques.

Enhanced Arithmetic Optimization Algorithm Guided by a Local Search for the Feature Selection Problem

High-dimensional datasets present significant challenges for classification tasks.Dimensionality reduction,a crucial aspect of data preprocessing,has gained substantial attention due to its ability to improve classification per-formance.However,identifying the optimal features within high-dimensional datasets remains a computationally demanding task,necessitating the use of efficient algorithms.This paper introduces the Arithmetic Optimization Algorithm(AOA),a novel approach for finding the optimal feature subset.AOA is specifically modified to address feature selection problems based on a transfer function.Additionally,two enhancements are incorporated into the AOA algorithm to overcome limitations such as limited precision,slow convergence,and susceptibility to local optima.The first enhancement proposes a new method for selecting solutions to be improved during the search process.This method effectively improves the original algorithm’s accuracy and convergence speed.The second enhancement introduces a local search with neighborhood strategies(AOA_NBH)during the AOA exploitation phase.AOA_NBH explores the vast search space,aiding the algorithm in escaping local optima.Our results demonstrate that incorporating neighborhood methods enhances the output and achieves significant improvement over state-of-the-art methods.

Least Squares One-Class Support Tensor Machine

One-class classification problem has become a popular problem in many fields, with a wide range of applications in anomaly detection, fault diagnosis, and face recognition. We investigate the one-class classification problem for second-order tensor data. Traditional vector-based one-class classification methods such as one-class support vector machine (OCSVM) and least squares one-class support vector machine (LSOCSVM) have limitations when tensor is used as input data, so we propose a new tensor one-class classification method, LSOCSTM, which directly uses tensor as input data. On one hand, using tensor as input data not only enables to classify tensor data, but also for vector data, classifying it after high dimensionalizing it into tensor still improves the classification accuracy and overcomes the over-fitting problem. On the other hand, different from one-class support tensor machine (OCSTM), we use squared loss instead of the original loss function so that we solve a series of linear equations instead of quadratic programming problems. Therefore, we use the distance to the hyperplane as a metric for classification, and the proposed method is more accurate and faster compared to existing methods. The experimental results show the high efficiency of the proposed method compared with several state-of-the-art methods.

Deep Domain-Adversarial Anomaly Detection With One-Class Transfer Learning

Despite the big success of transfer learning techniques in anomaly detection,it is still challenging to achieve good transition of detection rules merely based on the preferred data in the anomaly detection with one-class classification,especially for the data with a large distribution difference.To address this challenge,a novel deep one-class transfer learning algorithm with domain-adversarial training is proposed in this paper.First,by integrating a hypersphere adaptation constraint into domainadversarial neural network,a new hypersphere adversarial training mechanism is designed.Second,an alternative optimization method is derived to seek the optimal network parameters while pushing the hyperspheres built in the source domain and target domain to be as identical as possible.Through transferring oneclass detection rule in the adaptive extraction of domain-invariant feature representation,the end-to-end anomaly detection with one-class classification is then enhanced.Furthermore,a theoretical analysis about the model reliability,as well as the strategy of avoiding invalid and negative transfer,is provided.Experiments are conducted on two typical anomaly detection problems,i.e.,image recognition detection and online early fault detection of rolling bearings.The results demonstrate that the proposed algorithm outperforms the state-of-the-art methods in terms of detection accuracy and robustness.

Prediction of miRNA Based on miRNA Biogenesis via One-class SVM

MicroRNAs are a class of small, single-stranded RNAs which are produced by non-protein-coding RNA genes with a length of 21-29 nt. They regulate the expression of protein-encoding genes at the post-transcriptional level and the degradation ofmRNAs by base pairing to mRNAs. Mature miRNAs are processed from 60-90 nt RNA hairpin structures called pre-miRNAs. At present, most of the machine learning computational methods for pre-miRNAs prediction are based on two-class SVM and use structural information of pre-miRNA hairpins. Those methods share a common feature that all of them need a negative dataset in the training dataset and feature selection in both training and testing dataset. In order to avoid selecting false negative examples of miRNA hairpins in the training dataset which may mislead the classifiers, we presented a microRNA prediction algorithm called MirBio based on miRNAs Biogenesis which is trained only on the information of the positive miRNAs class to predict miRNAs. It can predict both pre-miRNAs and miRNAs and get a relatively satisfying result in this study.

Existence of Solutions for a Multi-point Boundary Value Problems with Three Dimension Kernal at Resonance

In this paper,a multi-point boundary value problems for a three order nonlinear deferential equation is considered.With the help of coincidence theorem due to Mawhin,a existence theorem is obtained.

Some Explicit Results for the Distribution Problem of Stochastic Linear Programming

A technique is developed for finding a closed form expression for the cumulative distribution function of the maximum value of the objective function in a stochastic linear programming problem, where either the objective function coefficients or the right hand side coefficients are continuous random vectors with known probability distributions. This is the “wait and see” problem of stochastic linear programming. Explicit results for the distribution problem are extremely difficult to obtain;indeed, previous results are known only if the right hand side coefficients have an exponential distribution [1]. To date, no explicit results have been obtained for stochastic c, and no new results of any form have appeared since the 1970’s. In this paper, we obtain the first results for stochastic c, and new explicit results if b an c are stochastic vectors with an exponential, gamma, uniform, or triangle distribution. A transformation is utilized that greatly reduces computational time.

基于互信息解决多标签文本分类中的长尾问题

针对当前解决多标签文本分类中长尾问题的方法多以破坏原本数据分布为代价,在真实数据上的泛化性能下降,无法有效地缓解样本的长尾分布的问题,提出了基于互信息解决长尾问题的多标签文本分类方法(MLTC-LD)。首先,创建关于标签样本的关系矩阵,计算标签样本间的依赖关系;其次,考虑标签样本间关系程度的强弱构造邻居选择器,将拥有强关系的邻居信息作为主要语义特征并作为先验信息;最后,通过图注意力神经网络将先验信息引入分类器,实现了借助分布头部数据丰富类的知识来提高尾部数据贫乏类性能的目标。在三个不同的数据集上将MLTC-LD与八个基线模型进行了广泛的比较分析。实验结果表明,MLTC-LD与最优的HGLRN相比精确度分别提高了3.5%、0.3%、1.5%,证明了该方法的有效性。

基于改进支持向量机的皮革划痕检测方法

针对传统皮革划痕检测方法存在检测准确率低、检测效率不高的问题,提出一种基于K-means聚类算法改进支持向量机SVM的皮革划痕检测方法。首先,对支持向量机基本原理进行分析;然后采用K-means聚类算法解决支持向量机SVM的二分类问题;最后搭建一个K-means-SVM皮革划痕检测模型,通过此模型实现皮革划痕快速准确检测。试验结果表明,本模型的检测精度为96.74%,相较于传统的YOLOv5模型、CRNN模型和SVM-DS模型分别高出了18.85%、20.17%、13.06%,且本模型进行皮革划痕检测的所用时长仅为11.52 s,均低于另外3种模型。由此说明,本模型的检测精度更高,检测速度更快,满足真皮表面划痕检测的实时性和准确性需求。

运用PCNE分类系统对呼吸道疾病患者进行药学监护的应用研究

目的 运用欧洲医药保健网(PCNE)分类系统对呼吸道疾病患者进行药学监护,探索呼吸科的有效药学监护模式,促进临床合理用药。方法 选取安徽理工大学第一附属医院2022年诊断为慢性阻塞性肺疾病(COPD)和肺部感染的住院患者,分为简单组和干预组;根据PCNE分类系统,对药物相关问题(DRPs)的类型、原因、干预、干预的接受情况及解决状态等方面进行分析。结果 共纳入病例120例,简单组60例,干预组60例。DRPs发生人数方面,简单组15例,干预组45例,两组差异有统计学意义(P <0.05)。DRPs共82个,主要涉及治疗效果(51.22%)和安全性(46.34%),原因为患者药物使用方法不正确、用法用量不适宜和未定期安全监测等。药师干预中,药物层面75个(91.46%),医生层面38个(46.34%),患者层面43个(52.44%);药师干预后,接受率为97.56%,74.39%的DRPs得到解决。结论 应用PCNE分类系统进行药学监护能够增强临床药师发现和处理DRPs的能力,减少临床发生不良事件的风险,促进患者的合理、安全用药;同时还有助于药学监护实施记录的标准化和规范化,可为呼吸科患者的药学服务模式提供参考。

基于五维模型的雷达装备质量问题分类方法研究

雷达装备是现代武器系统的重要组成部分且应用广泛,当前对雷达装备的质量和可靠性要求越来越高。雷达装备具有组成功能复杂、服役环境严苛、多品类、小批量、研制生产交叉等特点,使得质量问题表现形式多样化且存在区别和交叉,给雷达装备质量问题的准确分类带来极大挑战。为此,本文以雷达装备为研究对象,研究了雷达装备质量问题的定义和分类,并提出一种基于五维模型的雷达装备质量问题分类判定方法,为实现质量问题分级分类处理模式转型升级、提高雷达装备质量问题处理成效、增强雷达装备使用可靠性及作战效能提供有益指导。

药物治疗管理结合PCNE分类系统对乙型肝炎肝硬化患者的药学服务效果评价

目的应用药物治疗管理(MTM)结合欧洲医药保健网(PCNE)的模式对乙型肝炎(乙肝)肝硬化患者进行药学服务,从临床疗效、安全性、人文效果以及药物相关问题等方面分析药学服务成效。方法将乙肝肝硬化患者随机分为药学组(50例)和仅接受传统治疗的对照组(48例),临床药师运用MTM结合PCNE分类系统对药学组进行药学服务,分别从经济效果、临床疗效和安全性、人文结果进行比较,并分析药学组药物相关问题(DRPs)。结果药学组日均用药费用及药占比以及临床指标转归优于对照组,前者药品不良反应相较后者在随访3个月时差异有统计学意义,用药依从性和生活质量在干预后和随访期间均差异有统计学意义(P<0.05)。药学组DRPs共计52个,类别主要为治疗效果不佳,原因主要有药物选择不合理和用法用量不合理,干预接受共计46个,共计解决45个。结论MTM结合PCNE分类系统的药学服务模式对乙肝肝硬化患者的治疗和后续随访具有积极作用。

求解约束优化问题的改进蛇优化算法

结合外点罚函数法与改进蛇优化算法求解约束优化问题,得到一种新的求解约束优化问题的算法WDFSO。算法WDFSO首先通过外点罚函数法将约束优化问题转化为一系列界约束优化问题,然后运用基于变异质心的对立学习策略与种群分类策略改进的蛇优化算法对所得界约束优化问题进行求解,进而获得所求约束优化问题的解。为验证算法WDFSO的有效性,选取CEC2006中19个标准约束优化问题进行数值实验,并使用Wilcoxon秩和检验来证明算法的显著性。实验结果表明,与对比算法相比,算法WDFSO求解约束优化问题具有更高的收敛精度和更好的稳定性。最后应用算法WDFSO求解两个工程约束优化问题,结果表明算法WDFSO求解性能更好。