检索结果-南通市图书馆

Large-Scale Multi-Objective Optimization Algorithm Based on Weighted Overlapping Grouping of Decision Variables

Computer Modeling in Engineering & Sciences 2024年第7期140卷 363-383页

作者： Liang Chen Jingbo Zhang Linjie Wu Xingjuan Cai Yubin Xu shanxi key laboratory of big data analysis and parallel computing Taiyuan University of Science and TechnologyTaiyuan030024China School of State key laboratory of Novel Software Technology Nanjing UniversityNanjing210008China

The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision ***,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this ***,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision *** the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping ***,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision *** decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into ***,the decision variable with the strongest interaction is added to each *** minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different *** was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our *** with the other algorithms,our method is still at an advantage.

关键词： Decision variable grouping large-scale multi-objective optimization algorithms weighted overlapping grouping direction-guided evolution

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Recommendation System Based on Perceptron and Graph Convolution Network

引用

Computers, Materials & Continua 2024年第6期79卷 3939-3954页

作者： Zuozheng Lian Yongchao Yin Haizhen Wang College of Computer and Control Engineering Qiqihar UniversityQiqihar161006China Heilongjiang key laboratory of big data Network Security Detection and analysis Qiqihar UniversityQiqihar161006China

The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution *** current simple linear combination of these algorithms may not be sufficient to extract the complex structure of user interaction *** paper presents a new approach to address such issues,utilizing the graph convolution network to extract association *** proposed approach mainly includes three modules:Embedding layer,forward propagation layer,and score prediction *** embedding layer models users and items according to their interaction information and generates initial feature vectors as input for the forward propagation *** forward propagation layer designs two parallel graph convolution networks with self-connections,which extract higher-order association relevance from users and items separately by multi-layer graph ***,the forward propagation layer integrates the attention factor to assign different weights among the hop neighbors of the graph convolution network fusion,capturing more comprehensive association relevance between users and items as input for the score prediction *** score prediction layer introduces MLP(multi-layer perceptron)to conduct non-linear feature interaction between users and items,***,the prediction score of users to items is *** recall rate and normalized discounted cumulative gain were used as evaluation *** proposed approach effectively integrates higher-order information in user entries,and experimental analysis demonstrates its superiority over the existing algorithms.

关键词： Recommendation system graph convolution network attention mechanism multi-layer perceptron

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Adaptive and augmented active anomaly detection on dynamic network traffic streams

引用

Frontiers of Information Technology & Electronic Engineering 2024年第3期25卷 446-460页

作者： Bin LI Yijie WANG Li CHENG National key laboratory of parallel and Distributed computing College of ComputerNational University of Defense TechnologyChangsha 410073China College of System Engineering National University of Defense TechnologyChangsha 410073China

Active anomaly detection queries labels of sampled instances and uses them to incrementally update the detection model,and has been widely adopted in detecting network ***,existing methods cannot achieve desirable performance on dynamic network traffic streams because(1)their query strategies cannot sample informative instances to make the detection model adapt to the evolving stream and(2)their model updating relies on limited query instances only and fails to leverage the enormous unlabeled instances on *** address these issues,we propose an active tree based model,adaptive and augmented active prior-knowledge forest(A3PF),for anomaly detection on network trafic streams.A prior-knowledge forest is constructed using prior knowledge of network attacks to find feature subspaces that better distinguish network anomalies from normal *** one hand,to make the model adapt to the evolving stream,a novel adaptive query strategy is designed to sample informative instances from two aspects:the changes in dynamic data distribution and the uncertainty of *** the other hand,based on the similarity of instances in the neighborhood,we devise an augmented update method to generate pseudo labels for the unlabeled neighbors of query instances,which enables usage of the enormous unlabeled instances during model *** experiments on two benchmarks,CIC-IDS2017 and UNSW-NB15,demonstrate that A3PF achieves significant improvements over previous active methods in terms of the area under the receiver operating characteristic curve(AUC-ROC)(20.9%and 21.5%)and the area under the precision-recall curve(AUC-PR)(44.6%and 64.1%).

关键词： Active anomaly detection Network traffic streams Pseudo labels Prior knowledge of network attacks

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Applying Hybrid Clustering in Pulsar Candidate Sifting with Multi-modality for FAST Survey

引用

Research in Astronomy and Astrophysics 2024年第3期24卷 283-296页

作者： Zi-Yi You Yun-Rong Pan Zhi Ma Li Zhang Shuo Xiao Dan-Dan Zhang Shi-Jun Dang Ru-Shuang Zhao Pei Wang Ai-Jun Dong Jia-Tao Jiang Ji-Bing Leng Wei-An Li Si-Yao Li School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550025China Guizhou Provincial key laboratory of Radio Astronomy and data Processing Guizhou Normal UniversityGuiyang 550025China College of big data and Information Engineering Guizhou UniversityGuiyang 550025China CAS key laboratory of FAST National Astronomical ObservatoriesChinese Academy of SciencesBeijing 100101China key laboratory of Information and computing Guizhou Province Guizhou Normal UniversityGuiyang 550001China School of big data and Computer Science Guizhou Normal UniversityGuiyang 550025China Guizhou Software Engineering Research Center Guiyang 550000China

Pulsar search is always the basis of pulsar navigation,gravitational wave detection and other research ***,the volume of pulsar candidates collected by the Five-hundred-meter Aperture Spherical radio Telescope(FAST)shows an explosive growth rate that has brought challenges for its pulsar candidate filtering ***,the multi-view heterogeneous data and class imbalance between true pulsars and non-pulsar candidates have negative effects on traditional single-modal supervised classification *** this study,a multi-modal and semi-supervised learning based on a pulsar candidate sifting algorithm is presented,which adopts a hybrid ensemble clustering scheme of density-based and partition-based methods combined with a feature-level fusion strategy for input data and a data partition strategy for *** on both High Time Resolution Universe SurveyⅡ(HTRU2)and actual FAST observation data demonstrate that the proposed algorithm could excellently identify pulsars:On HTRU2,the precision and recall rates of its parallel mode reach0.981 and 0.988 *** FAST data,those of its parallel mode reach 0.891 and 0.961,meanwhile,the running time also significantly decreases with the increment of parallel nodes within ***,we can conclude that our algorithm could be a feasible idea for large scale pulsar candidate sifting for FAST drift scan observation.

关键词： methods data analysis-surveys-methods numerical

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

L_(1)-Smooth SVM with Distributed Adaptive Proximal Stochastic Gradient Descent with Momentum for Fast Brain Tumor Detection

引用

Computers, Materials & Continua 2024年第5期79卷 1975-1994页

作者： Chuandong Qin Yu Cao Liqun Meng School of Mathematics and Information Science North Minzu UniversityYinchuan750021China Ningxia key laboratory of Intelligent Information and big data Processing Yinchuan750021China

Brain tumors come in various types,each with distinct characteristics and treatment approaches,making manual detection a time-consuming and potentially ambiguous *** tumor detection is a valuable tool for gaining a deeper understanding of tumors and improving treatment *** learning models have become key players in automating brain tumor *** descent methods are the mainstream algorithms for solving machine learning *** this paper,we propose a novel distributed proximal stochastic gradient descent approach to solve the L_(1)-Smooth Support Vector Machine(SVM)classifier for brain tumor ***,the smooth hinge loss is introduced to be used as the loss function of *** avoids the issue of nondifferentiability at the zero point encountered by the traditional hinge loss function during gradient descent ***,the L_(1) regularization method is employed to sparsify features and enhance the robustness of the ***,adaptive proximal stochastic gradient descent(PGD)with momentum,and distributed adaptive PGDwithmomentum(DPGD)are proposed and applied to the L_(1)-Smooth *** computing is crucial in large-scale data analysis,with its value manifested in extending algorithms to distributed clusters,thus enabling more efficient processing ofmassive amounts of *** DPGD algorithm leverages Spark,enabling full utilization of the computer’s multi-core *** to its sparsity induced by L_(1) regularization on parameters,it exhibits significantly accelerated convergence *** the perspective of loss reduction,DPGD converges faster than *** experimental results show that adaptive PGD withmomentumand its variants have achieved cutting-edge accuracy and efficiency in brain tumor ***-trained models,both the PGD andDPGD outperform other models,boasting an accuracy of 95.21%.

关键词： Support vector machine proximal stochastic gradient descent brain tumor detection distributed computing

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A TRUST-REGION METHOD FOR SOLVING TRUNCATED COMPLEX SINGULAR VALUE DECOMPOSITION

引用

Journal of Computational Mathematics 2024年第4期42卷 999-1031页

作者： Jiaofen Li Lingchang Kong Xuefeng Duan Xuelin Zhou Qilun Luo School of Mathematics and computing Science Guangri Colleges and Universities Key Laboratory of Data Analysis and ComputationGuangri Key Laboratory of Automatic Detecting Technology and InstrumentsGuilin University of Electronic TechnologyCenter for Applied Mathematics of Guangci(GUET)Guilin 541004China School of Mathematical Sciences South China Normal UniversityGuangzhou 510000China School of Mathematics and computing Science Guilin University of Electronic TechnologyGuilin 541004China School of Mathematics and computing Science Guangri Colleges and Universities Key Laboratory of Data Analysis and ComputationGuilin University of Electronic TechnologyCenter for Applied Mathematics of Guangri(GUET)Guilin 541004China School of Mathematics and Statistics Yunan UniversityKunming 650000China

The truncated singular value decomposition has been widely used in many areas of science including engineering,and statistics,*** this paper,the original truncated complex singular value decomposition problem is formulated as a Riemannian optimiza-tion problem on a product of two complex Stiefel manifolds,a practical algorithm based on the generic Riemannian trust-region method of Absil et *** presented to solve the underlying problem,which enjoys the global convergence and local superlinear conver-gence *** experiments are provided to illustrate the efficiency of the proposed *** with some classical Riemannian gradient-type methods,the existing Riemannian version of limited-memory BFGS algorithms in the MATLAB toolbox Manopt and the Riemannian manifold optimization library ROPTLIB,and some latest infeasible methods for solving manifold optimization problems,are also provided to show the merits of the proposed approach.

关键词： Truncated singular value decomposition Riemannian optimization Trust-region method

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Multi-Perspective data Fusion Framework Based on Hierarchical BERT: Provide Visual Predictions of Business Processes

引用

Computers, Materials & Continua 2024年第1期78卷 1227-1252页

作者： Yongwang Yuan Xiangwei Liu Ke Lu School of Mathematics and big data Anhui University of Science and TechnologyHuainan232001China School of Economics and Management Anhui University of Science and TechnologyHuainan232001China The key laboratory of Embedded System and Service computing Ministry of Education Tongji UniversityShanghai201804China

Predictive Business Process Monitoring(PBPM)is a significant research area in Business Process Management(BPM)aimed at accurately forecasting future behavioral *** present,deep learning methods are widely cited in PBPM research,but no method has been effective in fusing data information into the control flow for multi-perspective process ***,this paper proposes a process prediction method based on the hierarchical BERT and multi-perspective data ***,the first layer BERT network learns the correlations between different category attribute ***,the attribute data is integrated into a weighted event-level feature vector and input into the second layer BERT network to learn the impact and priority relationship of each event on future predicted ***,the multi-head attention mechanism within the framework is visualized for analysis,helping to understand the decision-making logic of the framework and providing visual ***,experimental results show that the predictive accuracy of the framework surpasses the current state-of-the-art research methods and significantly enhances the predictive performance of BPM.

关键词： Business process prediction monitoring deep learning attention mechanism BERT multi-perspective

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Variable projection algorithms with sparse constraint for separable nonlinear models

引用

Control Theory and Technology 2024年第1期22卷 135-146页

作者： Hui-Lang Xu Guang-Yong Chen Si-Qing Cheng Min Gan Jing Chen College of Computer and data Science Fuzhou UniversityFuzhou350116FujianChina Fujian key laboratory of Network computing and Intelligent Information Processing Fuzhou UniversityFuzhou350116FujianChina key laboratory of Intelligent Metro of Universities in Fujian Fuzhou UniversityFuzhou350116FujianChina Engineering Research Center of big data Intelligence Ministry of EducationFuzhou UniversityFuzhou350116FujianChina School of Science Jiangnan UniversityWuxi214122JiangsuChina

Separable nonlinear models are widely used in various fields such as time series analysis, system modeling, and machine learning, due to their flexible structures and ability to capture nonlinear behavior of data. However, identifying the parameters of these models is challenging, especially when sparse models with better interpretability are desired by practitioners. Previous theoretical and practical studies have shown that variable projection (VP) is an efficient method for identifying separable nonlinear models, but these are based on \(L_2\) penalty of model parameters, which cannot be directly extended to deal with sparse constraint. Based on the exploration of the structural characteristics of separable models, this paper proposes gradient-based and trust-region-based variable projection algorithms, which mainly solve two key problems: how to eliminate linear parameters under sparse constraint;and how to deal with the coupling relationship between linear and nonlinear parameters in the model. Finally, numerical experiments on synthetic data and real time series data are conducted to verify the effectiveness of the proposed algorithms.

关键词： Variable projection(VP) Non-smooth constraint Separable nonlinear models

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Minimal Context-Switching data Race Detection with dataflow Tracking

引用

Journal of Computer Science & Technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for big data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services computing Technology and System laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid computing laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Privacy Preserving Algorithm for Spectrum Sensing in Cognitive Vehicle Networks

引用

Chinese Journal of Electronics 2024年第1期33卷 30-42页

作者： Hongning LI Tonghui HU Jiexiong CHEN Xiuqiang WU Qingqi PEI Guangzhou Institute of Technology Xidian University Guangzhou CEPREI Shaanxi key laboratory of Blockchain and Secure computing

The scarcity of spectrum resources fails to meet the increasing throughput demands of vehicular networks. There is an urgent need to maximize the utilization of spectrum bands in mobile networks. To ascertain the availability of spectrum bands, users should engage in wireless channel sensing and collaboration. However, spectrum sensing data always involves users’ privacy, such as their location. This paper first introduces sensing trajectory inference attack in cognitive vehicular networks and then proposes a data confusion-based privacy-preserving algorithm and a cryptonym array-based privacy-preserving aggregation scheme for spectrum sensing in cognitive vehicular networks. Unlike existing methods, the proposed schemes transmit confused data during the aggregation process. This deliberate obfuscation makes it almost impossible to infer users’ location from the transmitted data. The analysis demonstrates the resilience of the proposed schemes against sensing trajectory inference attack.

关键词： Privacy data privacy Wireless sensor networks Authentication data aggregation Throughput Inference algorithms

来源：

同方期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：