检索结果-内蒙古大学图书馆

50th International Conference on Current Trends in Theory and Practice of computer science, SOFSEM 2025

作者： Goedgebeur, Jan Renders, Jarne Department of Computer Science KU Leuven Kulak Kortrijk8500 Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium

ISBN: (纸本)9783031826696

We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a 2-factor consisting of two chordless cycles, and non-hamiltonian cycle permutation graphs, from which the permutation snarks can easily be computed. This allows us to generate all cycle permutation graphs up to order 34 and all permutation snarks up to order 46, improving upon previous computational results by Brinkmann et al. Moreover, we give several improved lower bounds for interesting permutation snarks, such as for a smallest permutation snark of order 6mod8 or a smallest permutation snark of girth at least 6. These computational results also allow us to complete a characterisation of the orders for which non-hamiltonian cycle permutation graphs exist, answering an open question by Klee from 1972, and yield many more counterexamples to a conjecture by Zhang. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

An efficient feature selection and classification system for microarray cancer data using genetic algorithm and deep belief networks

引用

Multimedia Tools and Applications 2025年第8期84卷 4393-4434页

作者： Lawrence, Morolake Oladayo Jimoh, Rasheed Gbenga Yahya, Waheed Babatunde Department of Computer Science Faculty of Computing & Applied Sciences Baze University Abuja Nigeria Department of Computer Science Faculty of Communication & Information Sciences University of Ilorin Kwara State Ilorin Nigeria Department of Statistics Faculty of Physical Sciences University of Ilorin Kwara State Ilorin Nigeria

Cancer is one of the most devastating health conditions in the world. In the diagnosis and treatment of the various forms of cancer illness, studies have shown that early detection of the cancer by clinical methods usually takes a considerable lengthy time. This informs searching for an alternative non-clinical diagnosis of cancer cases using microarray technology. Therefore, this study develops an efficient feature selection and classification method for high-dimensional microarray cancer data by combining Genetic Algorithms (GA) and Deep Belief Networks (DBN). The study employed a GA for selecting the most informative gene biomarker and DBN for the classification of biological samples. In a Monte Carlo experiment, the simulated and real-life microarray datasets were partitioned into 95% training and 5% test samples at 100 to 1000 epochs. The classifier was constructed using the training datasets while its efficiency was assessed on the test sample using the Misclassification Error Rate, Sensitivity, Specificity, and Receiver Operating Characteristic Analysis. The GA and DBN were implemented using Caret and Deepnet (R statistical packages). The proposed GADBN method was implemented using simulated and real-life datasets, which yielded out-of-bag average classification accuracy of 98.8% and 93.1% respectively. The proposed GADBN outperformed the other existing classifiers;and the GADBN method was more efficient with a smaller Misclassification Error Rate (MER) for Leukaemia 1 (0.18), Prostate 1 (0.35) and Prostate 3 (0.09) datasets than some of the existing methods under various performance indices considered. The proposed model is a powerful and effective instrument for identifying useful features in microarray cancer data and classifying the cancer types accordingly. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Availability assessment of repairable linear consecutive k-out-of-n: F systems incorporating uncertainty and multiple failure modes

引用

Life Cycle Reliability and Safety Engineering 2025年 1-10页

作者： Khati, Amisha Singh, S.B. Department of Mathematics Statistics and Computer Science G. B. Pant University of Agriculture and Technology Pantnagar India Department of Applied Science and Humanities RIT Roorkee India

This study evaluates the interval-valued availability of a linear consecutive k-out-of-n: F system while considering uncertainty, where the probability that the system will perform as intended is not known with precision. The proposed system is susceptible to µ number of different failure modes and undergoes periodic inspections. Each failure mode has a randomly assigned failure time, and upon failure due to the mth failure mode, an immediate corrective repair is carried out, taking an arbitrary length of time ψm (m = 1, 2,…, µ). By integrating these factors, this research establishes theorems describing point and steady-state availability bounds. Subsequently, it conducts a sensitivity assessment to evaluate how variations in the inspection period affect the system’s availability. The findings are demonstrated with an instance of an oil pipeline system. This study offers valuable insights into the reliability and availability modelling of complex systems under uncertainty, with applications across diverse engineering domains. © The Author(s), under exclusive licence to Society for Reliability and Safety (SRESA) 2025.

关键词： Interval valued point availability Interval valued steady state availability Linear consecutive k-out-of n: F system Multiple failure modes Sensitivity analysis Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Enhancing Missing Data Imputation for Migrants Data: A Neutrosophic Set-Based Machine Learning Approach

引用

Neutrosophic Sets and Systems 2025年 81卷 479-502页

作者： Abdo, Doaa A. Salama, A.A. Abdelmegaly, Alaa A. Mahmoud, Hanan Khadari Mahdi Applied statistics and insurance department faculty of commerce Mansoura university Mansoura Egypt Dept. of Math and Computer Sci. Faculty of Science Port Said Univ. Egypt Higher Institute of Advanced Management Sciences and Computers Al-Buhayrah Egypt Depatrment of applied statistics at the Nile Higher Institute of commercial sciences and Computer Technology in Mansoura Egypt

This study tackles the problem of missing data in migrant datasets by introducing a new framework that combines machine learning techniques with neutrosophic sets. These sets, which can represent uncertainty and ambiguity, are well-suited for managing the complex nature of missing information in sensitive fields like migration research. We test the effectiveness of KNN, SVM, decision tree, random forest, and Ada Boost algorithms on a migrant dataset, comparing their results using different imputation methods (mean/mode, model-based imputer (simple tree), and random values). Our research showed that our proposed approach, which used neutrosophic sets, improved imputation accuracy and strengthened model reliability. Our results underscored the potential of neutrosophic set-based machine learning for addressing missing data issues across various fields. © 2025, University of New Mexico. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Improved Bounds on the Size of Permutation codes under Kendall τ-metric

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4156-4166页

作者： Parvaresh, Farzad Sobhani, Reza Abdollahi, Alireza Bagherian, Javad Jafari, Fatemeh Khatami, Maryam University of Isfahan Faculty of Engineering Department of Electrical Engineering Isfahan Iran School of Mathematics Tehran19395-5746 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Applied Mathematics and Computer Science Isfahan81746-73441 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Pure Mathematics Isfahan81746-73441 Iran

In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation method has been proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P(n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, ..., n} with the minimum distance at least (Formula presented) under the Kendall τ-metric. By presenting an algorithm and two theorems, we improve the known lower and upper bounds for P(n, d). In particular, we show that P(n, d) = 4 for all n ≥ 6 and (Formula presented). Additionally, we prove that for any prime number n and integer (Formula presented). This result greatly improves the upper bound of P(n, 3) for all primes n ≥ 37. © 1963-2012 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Multi-Level Feature Distillation of Joint Teachers Trained on Distinct Image Datasets

Multi-Level Feature Distillation of Joint Teachers Trained o...

引用

2025 IEEE/CVF Winter Conference on Applications of computer Vision, WACV 2025

作者： Iordache, Adrian Alexe, Bogdan Ionescu, Radu Tudor University of Bucharest Department of Computer Science Bucharest Romania 'Gheorghe Mihoc - Caius Iacob' Institute of Mathematical Statistics and Applied Mathematics The Romanian Academy Bucharest Romania

ISBN: (纸本)9798331510831

We propose a novel teacher-student framework to distill knowledge from multiple teachers trained on distinct datasets. Each teacher is first trained from scratch on its own dataset. Then, the teachers are combined into a joint architecture, which fuses the features of all teachers at multiple representation levels. The joint teacher architecture is fine-tuned on samples from all datasets, thus gathering useful generic information from all data samples. Finally, we employ a multi-level feature distillation procedure to transfer the knowledge to a student model for each of the considered datasets. We conduct image classification experiments on seven benchmarks, and action recognition experiments on three benchmarks. To illustrate the power of our feature distillation procedure, the student architectures are chosen to be identical to those of the individual teachers. To demonstrate the flexibility of our approach, we combine teachers with distinct architectures. We show that our novel Multi-Level Feature Distillation (MLFD) can significantly surpass equivalent architectures that are either trained on individual datasets, or jointly trained on all datasets at once. Furthermore, we confirm that each step of the proposed training procedure is well motivated by a comprehensive ablation study. We publicly release our code at https://***/AdrianIordache/MLFD. © 2025 IEEE.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Sampling List Packings 16

Sampling List Packings

引用

16th Innovations in Theoretical computer science Conference, ITCS 2025

作者： Camrud, Evan Davies, Ewan Karduna, Alex Lee, Holden Department of Mathematics and Statistics Middlebury College VT United States Department of Computer Science Colorado State University Fort CollinsCO United States Department of Applied Mathematics and Statistics Johns Hopkins University BaltimoreMD United States

ISBN: (纸本)9783959773614

We initiate the study of approximately counting the number of list packings of a graph. The analogous problem for usual vertex coloring and list coloring has attracted substantial attention. For list packing the setup is similar, but we seek a full decomposition of the lists of colors into pairwise-disjoint proper list colorings. The existence of a list packing implies the existence of a list coloring, but the converse is false. Recent works on list packing have focused on existence or extremal results of on the number of list packings, but here we turn to the algorithmic aspects of counting and sampling. In graphs of maximum degree ∆ and when the number of colors is at least Ω(∆2), we give a fully polynomial-time randomized approximation scheme (FPRAS) based on rapid mixing of a natural Markov chain (the Glauber dynamics) which we analyze with the path coupling technique. Some motivation for our work is the investigation of an atypical spin system, one where the number of spins for each vertex is much larger than the graph degree. © Evan Camrud, Ewan Davies, Alex Karduna, and Holden Lee.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Epileptic seizure detection in EEG signals via an enhanced hybrid CNN with an integrated attention mechanism

引用

Mathematical Biosciences and Engineering 2025年第1期22卷 73-105页

作者： Mekruksavanich, Sakorn Phaphan, Wikanda Jitpattanakul, Anuchit Department of Computer Engineering School of Information and Communication Technology University of Phayao Phayao56000 Thailand Department of Applied Statistics Faculty of Applied Science King Mongkut’s University of Technology North Bangkok Bangkok10800 Thailand Department of Mathematics Faculty of Applied Science King Mongkut’s University of Technology North Bangkok Bangkok10800 Thailand Intelligent and Nonlinear Dynamic Innovations Research Center Science and Technology Research Institute King Mongkut’s University of Technology North Bangkok Bangkok10800 Thailand

Epileptic seizures, a prevalent neurological condition, necessitate precise and prompt identification for optimal care. Nevertheless, the intricate characteristics of electroencephalography (EEG) signals, noise, and the want for real-time analysis require enhancement in the creation of dependable detection approaches. Despite advances in machine learning and deep learning, capturing the intricate spatial and temporal patterns in EEG data remains challenging. This study introduced a novel deep learning framework combining a convolutional neural network (CNN), bidirectional gated recurrent unit (BiGRU), and convolutional block attention module (CBAM). The CNN extracts spatial features, the BiGRU captures long-term temporal dependencies, and the CBAM emphasizes critical spatial and temporal regions, creating a hybrid architecture optimized for EEG pattern recognition. Evaluation of a public EEG dataset revealed superior performance compared to existing methods. The model achieved 99.00% accuracy in binary classification, 96.20% in three-class tasks, 92.00% in four-class scenarios, and 89.00% in five-class classification. High sensitivity (89.00–99.00%) and specificity (89.63–99.00%) across all tasks highlighted the model’s robust ability to identify diverse EEG patterns. This approach supports healthcare professionals in diagnosing epileptic seizures accurately and promptly, improving patient outcomes and quality of life. © 2025 American Institute of Mathematical sciences. All rights reserved.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Bandwidth Selection in Kernel Density Estimation via Unsupervised Learning 8th

Data-Driven Bandwidth Selection in Kernel Density Estimatio...

引用

8th International Symposium on Modelling and Implementation of Complex Systems, MISC 2024

作者： Guidoum, Arsalane Chouaib Henider, Amel Department of Mathematics and Computer Science Faculty of Sciences and Technology University of Tamanghasset Tamanghasset11000 Algeria Department of Finance and Actuarial National Higher School of Statistics and Applied Economics Kolea42003 Algeria

ISBN: (纸本)9783031821110

The selection of optimal bandwidth bw in Kernel Density Estimation (KDE) is crucial for accurate density estimation. Traditional methods, such as unbiased and biased cross-validation and their variants, often suffer from performance and computational limitations. This study presents a novel, data-driven approach to bandwidth selection using unsupervised machine learning techniques. Synthetic samples are generated from the original data, a comprehensive set of statistical parameters is calculated, and bandwidth is estimated using a rule-of-thumb [2]. Feature importance is assessed through random forests (RF) to identify the most influential factors in bandwidth selection. Various unsupervised learning models are then applied to predict the optimal bandwidth for the original sample bwos. The results demonstrate that this machine learning-based approach achieves superior accuracy and computational efficiency compared to traditional cross-validation methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Global Piecewise Analysis of HIV Model with Bi-Infectious Categories under Ordinary Derivative and Non-Singular Operator with Neural Network Approach

引用

computer Modeling in Engineering & sciences 2025年第1期142卷 609-633页

作者： Ghaliah Alhamzi Badr Saad TAlkahtani Ravi Shanker Dubey Mati ur Rahman Department of Mathematics and Statistics College of ScienceImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh13318Saudi Arabia Department of Mathematics College of ScienceKing Saud UniversityRiyadh11989Saudi Arabia Department of Mathematics Amity School of Applied SciencesAmity University RajasthanJaipur302002India School of Mathematical Sciences Jiangsu UniversityZhenjiang212013China Department of Computer Science and Mathematics Lebanese American UniversityBeirut13-5053Lebanon

This study directs the discussion of HIV disease with a novel kind of complex dynamical generalized and piecewise operator in the sense of classical and Atangana Baleanu(AB)derivatives having arbitrary *** HIV infection model has a susceptible class,a recovered class,along with a case of infection divided into three sub-different levels or categories and the recovered *** total time interval is converted into two,which are further investigated for ordinary and fractional order operators of the AB derivative,*** proposed model is tested separately for unique solutions and existence on bi *** numerical solution of the proposed model is treated by the piece-wise numerical iterative scheme of Newtons *** proposed method is established for piece-wise derivatives under natural order and non-singular Mittag-Leffler *** cross-over or bending characteristics in the dynamical system of HIV are easily examined by the aspect of this research having a memory effect for controlling the said *** study uses the neural network(NN)technique to obtain a better set of weights with low residual errors,and the epochs number is considered *** obtained figures represent the approximate solution and absolute error which are tested with NN to train the data accurately.

关键词： HIV infection model qualitative scheme approximate solution piecewise global operator neural network

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：