检索结果-南通市图书馆

Multi-instance partial-label learning: towards exploiting dual inexact supervision

Science China(information Sciences) 2024年第3期67卷 48-61页

作者： Wei TANG Weijia ZHANG Min-Ling ZHANG school of computer Science and engineering Southeast University Key Laboratory of computer Network and information Integration (Southeast University) Ministry of Education school of information and Physical Sciences The University of Newcastle

Weakly supervised machine learning algorithms are able to learn from ambiguous samples or labels, e.g., multi-instance learning or partial-label learning. However, in some real-world tasks, each training sample is associated with not only multiple instances but also a candidate label set that contains one groundtruth label and some false positive labels. Specifically, at least one instance pertains to the ground-truth label while no instance belongs to the false positive labels. In this paper, we formalize such problems as multi-instance partial-label learning(MIPL). Existing multi-instance learning algorithms and partial-label learning algorithms are suboptimal for solving MIPL problems since the former fails to disambiguate a candidate label set, and the latter cannot handle a multi-instance bag. To address these issues, a tailored algorithm named MIPLGP, i.e., multi-instance partial-label learning with Gaussian processes, is proposed.MIPLGP first assigns each instance with a candidate label set in an augmented label space, then transforms the candidate label set into a logarithmic space to yield the disambiguated and continuous labels via an exclusive disambiguation strategy, and last induces a model based on the Gaussian processes. Experimental results on various datasets validate that MIPLGP is superior to well-established multi-instance learning and partial-label learning algorithms for solving MIPL problems.

关键词： machine learning multi-instance partial-label learning multi-instance learning partial-label learning Gaussian processes

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

CToMP: a cycle-task-oriented memory protection scheme for unmanned systems

引用

Science China(information Sciences) 2024年第6期67卷 399-417页

作者： Chengyan MA Ning XI Di LU Yebo FENG Jianfeng MA school of Cyber engineering Xidian University school of computer Science and Technology Xidian University Department of computer and information Science University of Oregon

Memory corruption attacks(MCAs) refer to malicious behaviors of system intruders that modify the contents of a memory location to disrupt the normal operation of computing systems, causing leakage of sensitive data or perturbations to ongoing processes. Unlike general-purpose systems, unmanned systems cannot deploy complete security protection schemes, due to their limitations in size, cost and performance.MCAs in unmanned systems are particularly difficult to defend against. Furthermore, MCAs have diverse and unpredictable attack interfaces in unmanned systems, severely impacting digital and physical sectors. In this paper, we first generalize, model and taxonomize MCAs found in unmanned systems currently, laying the foundation for designing a portable and general defense approach. According to different attack mechanisms,we found that MCAs are mainly categorized into two types — return2libc and return2shellcode. To tackle return2libc attacks, we model the erratic operation of unmanned systems with cycles and then propose a cycle-task-oriented memory protection(CToMP) approach to protect control flows from tampering. To defend against return2shellcode attacks, we introduce a secure process stack with a randomized memory address by leveraging the memory pool to prevent Shellcode from being executed. Moreover, we discuss the mechanism by which CTo MP resists the return-oriented programming(ROP) attack, a novel variant of return2libc attacks. Finally, we implement CTo MP on CUAV V5+ with Ardupilot and Crazyflie. The evaluation and security analysis results demonstrate that the proposed approach CTo MP is resilient to various MCAs in unmanned systems with low footprints and system overhead.

关键词： unmanned system memory corruption attack memory protection system security randomized memory address

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Mobile Crowdsourcing Task Allocation Based on Dynamic Self-Attention GANs

引用

computers, Materials & Continua 2024年第4期79卷 607-622页

作者： Kai Wei Song Yu Qingxian Pan school of computer and Control engineering Yantai UniversityYantai264005China school of computer and information Science Southwest UniversityChongqing400715China

Crowdsourcing technology is widely recognized for its effectiveness in task scheduling and resource allocation.While traditional methods for task allocation can help reduce costs and improve efficiency,they may encounter challenges when dealing with abnormal data flow nodes,leading to decreased allocation accuracy and efficiency.To address these issues,this study proposes a novel two-part invalid detection task allocation framework.In the first step,an anomaly detection model is developed using a dynamic self-attentive GAN to identify anomalous data.Compared to the baseline method,the model achieves an approximately 4%increase in the F1 value on the public dataset.In the second step of the framework,task allocation modeling is performed using a twopart graph matching method.This phase introduces a P-queue KM algorithm that implements a more efficient optimization strategy.The allocation efficiency is improved by approximately 23.83%compared to the baseline method.Empirical results confirm the effectiveness of the proposed framework in detecting abnormal data nodes,enhancing allocation precision,and achieving efficient allocation.

关键词： Mobile crowdsourcing task allocation anomaly detection GAN attention mechanisms

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Nonparametric Statistical Feature Scaling Based Quadratic Regressive Convolution Deep Neural Network for Software Fault Prediction

引用

computers, Materials & Continua 2024年第3期78卷 3469-3487页

作者： Sureka Sivavelu Venkatesh Palanisamy school of computer Science engineering and information Systems Vellore Institute of TechnologyVellore632014India

The development of defect prediction plays a significant role in improving software quality. Such predictions are used to identify defective modules before the testing and to minimize the time and cost. The software with defects negatively impacts operational costs and finally affects customer satisfaction. Numerous approaches exist to predict software defects. However, the timely and accurate software bugs are the major challenging issues. To improve the timely and accurate software defect prediction, a novel technique called Nonparametric Statistical feature scaled QuAdratic regressive convolution Deep nEural Network (SQADEN) is introduced. The proposed SQADEN technique mainly includes two major processes namely metric or feature selection and classification. First, the SQADEN uses the nonparametric statistical Torgerson–Gower scaling technique for identifying the relevant software metrics by measuring the similarity using the dice coefficient. The feature selection process is used to minimize the time complexity of software fault prediction. With the selected metrics, software fault perdition with the help of the Quadratic Censored regressive convolution deep neural network-based classification. The deep learning classifier analyzes the training and testing samples using the contingency correlation coefficient. The softstep activation function is used to provide the final fault prediction results. To minimize the error, the Nelder–Mead method is applied to solve non-linear least-squares problems. Finally, accurate classification results with a minimum error are obtained at the output layer. Experimental evaluation is carried out with different quantitative metrics such as accuracy, precision, recall, F-measure, and time complexity. The analyzed results demonstrate the superior performance of our proposed SQADEN technique with maximum accuracy, sensitivity and specificity by 3%, 3%, 2% and 3% and minimum time and space by 13% and 15% when compared with the two state-of-the-art methods.

关键词： Software defect prediction feature selection nonparametric statistical Torgerson-Gower scaling technique quadratic censored regressive convolution deep neural network softstep activation function nelder-mead method

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

2P3FL:A Novel Approach for Privacy Preserving in Financial Sectors Using Flower Federated Learning

引用

computer Modeling in engineering & Sciences 2024年第8期140卷 2035-2051页

作者： Sandeep Dasari Rajesh Kaluri school of computer Science engineering and information Systems Vellore Institute of TechnologyVellore632014India

The increasing data pool in finance sectors forces machine learning(ML)to step into new complications.Banking data has significant financial implications and is confidential.Combining users data from several organizations for various banking services may result in various intrusions and privacy leakages.As a result,this study employs federated learning(FL)using a flower paradigm to preserve each organization’s privacy while collaborating to build a robust shared global model.However,diverse data distributions in the collaborative training process might result in inadequate model learning and a lack of privacy.To address this issue,the present paper proposes the imple-mentation of Federated Averaging(FedAvg)and Federated Proximal(FedProx)methods in the flower framework,which take advantage of the data locality while training and guaranteeing global convergence.Resultantly improves the privacy of the local models.This analysis used the credit card and Canadian Institute for Cybersecurity Intrusion Detection Evaluation(CICIDS)datasets.Precision,recall,and accuracy as performance indicators to show the efficacy of the proposed strategy using FedAvg and FedProx.The experimental findings suggest that the proposed approach helps to safely use banking data from diverse sources to enhance customer banking services by obtaining accuracy of 99.55%and 83.72%for FedAvg and 99.57%,and 84.63%for FedProx.

关键词： Federated learning FedAvg FedProx flower framework privacy preservation financial sectors

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Enhancing Data Forwarding Efficiency in SIoT with Multidimensional Social Relations

引用

computers, Materials & Continua 2024年第1期78卷 1095-1113页

作者： Fang Xu Songhao Jiang Yi Ma Manzoor Ahmed Zenggang Xiong Yuanlin Lyu school of computer and information Science Hubei Engineering UniversityXiaogan432000China school of computer Science and information engineering Hubei UniversityWuhan430062China Artificial Intelligence Industrial Technology Research Institute Hubei Engineering UniversityXiaogan432000China

Effective data communication is a crucial aspect of the Social Internet of Things(SIoT)and continues to be a significant research focus.This paper proposes a data forwarding algorithm based on Multidimensional Social Relations(MSRR)in SIoT to solve this problem.The proposed algorithm separates message forwarding into intra-and cross-community forwarding by analyzing interest traits and social connections among nodes.Three new metrics are defined:the intensity of node social relationships,node activity,and community connectivity.Within the community,messages are sent by determining which node is most similar to the sender by weighing the strength of social connections and node activity.When a node performs cross-community forwarding,the message is forwarded to the most reasonable relay community by measuring the node activity and the connection between communities.The proposed algorithm was compared to three existing routing algorithms in simulation experiments.Results indicate that the proposed algorithmsubstantially improves message delivery efficiency while lessening network overhead and enhancing connectivity and coordination in the SIoT context.

关键词： SIoT data forwarding social attributes social relations community

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A Cover-Independent Deep Image Hiding Method Based on Domain Attention Mechanism

引用

computers, Materials & Continua 2024年第3期78卷 3001-3019页

作者： Nannan Wu Xianyi Chen James Msughter Adeke Junjie Zhao school of computer and Software Nanjing University of Information Science and TechnologyNanjing210044China school of Electronics and information engineering Nanjing University of Information Science and TechnologyNanjing210044China

Recently,deep image-hiding techniques have attracted considerable attention in covert communication and high-capacity information hiding.However,these approaches have some limitations.For example,a cover image lacks self-adaptability,information leakage,or weak concealment.To address these issues,this study proposes a universal and adaptable image-hiding method.First,a domain attention mechanism is designed by combining the Atrous convolution,which makes better use of the relationship between the secret image domain and the cover image domain.Second,to improve perceived human similarity,perceptual loss is incorporated into the training process.The experimental results are promising,with the proposed method achieving an average pixel discrepancy(APD)of 1.83 and a peak signal-to-noise ratio(PSNR)value of 40.72 dB between the cover and stego images,indicative of its high-quality output.Furthermore,the structural similarity index measure(SSIM)reaches 0.985 while the learned perceptual image patch similarity(LPIPS)remarkably registers at 0.0001.Moreover,self-testing and cross-experiments demonstrate the model’s adaptability and generalization in unknown hidden spaces,making it suitable for diverse computer vision tasks.

关键词： Deep image hiding attention mechanism privacy protection data security visual quality

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Gradient sparsification for efficient wireless federated learning with differential privacy

引用

Science China(information Sciences) 2024年第4期67卷 272-288页

作者： Kang WEI Jun LI Chuan MA Ming DING Feng SHU Haitao ZHAO Wen CHEN Hongbo ZHU school of Electronic and Optical engineering Nanjing University of Science and Technology Zhejiang Lab Key Laboratory of computer Network and information Integration(Southeast University) Ministry of Education Data61 Commonwealth Scientific and Industrial Research Organisation school of information and Communication engineering Hainan University school of Communications and information engineering Nanjing University of Posts and Telecommunications school of Electronic information and Electrical engineering Shanghai Jiao Tong University

Federated learning(FL) enables distributed clients to collaboratively train a machine learning model without sharing raw data with each other. However, it suffers from the leakage of private information from uploading models. In addition, as the model size grows, the training latency increases due to the limited transmission bandwidth and model performance degradation while using differential privacy(DP)protection. In this paper, we propose a gradient sparsification empowered FL framework with DP over wireless channels, to improve training efficiency without sacrificing convergence performance. Specifically, we first design a random sparsification algorithm to retain a fraction of the gradient elements in each client’s local model, thereby mitigating the performance degradation induced by DP and reducing the number of transmission parameters over wireless channels. Then, we analyze the convergence bound of the proposed algorithm, by modeling a non-convex FL problem. Next, we formulate a time-sequential stochastic optimization problem for minimizing the developed convergence bound, under the constraints of transmit power, the average transmitting delay, as well as the client’s DP requirement. Utilizing the Lyapunov drift-plus-penalty framework, we develop an analytical solution to the optimization problem. Extensive experiments have been implemented on three real-life datasets to demonstrate the effectiveness of our proposed algorithm. We show that our proposed algorithms can fully exploit the interworking between communication and computation to outperform the baselines, i.e., random scheduling, round robin, and delay-minimization algorithms.

关键词： federated learning differential privacy gradient sparsification Lyapunov drift convergence analysis

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

An Effective Power Optimization Approach Based on Whale Optimization Algorithm with Two-Populations and Mutation Strategies

引用

Chinese Journal of Electronics 2024年第2期33卷 423-435页

作者： Juncai HE Zhenxue HE Jia LIU Yan ZHANG Fan ZHANG Fangfang LIANG Tao WANG Limin XIAO Xiang WANG Hebei Agricultural University Beijing information Science and Technology University school of computer Science and engineering Beihang University school of Electronic and information engineering Beihang University

Power is an issue that must be considered in the design of logic circuits. Power optimization is a combinatorial optimization problem, since it is necessary to search for a logical expression that consumes the least amount of power from a large number of Reed-Muller(RM) logical expressions. The existing approach for optimizing the power of multi-output mixed polarity RM(MPRM) logic circuits suffer from poor optimization results. To solve this problem, a whale optimization algorithm with two-populations strategy and mutation strategy(TMWOA) is proposed in this paper. The two-populations strategy speeds up the convergence of the algorithm by exchanging information about the two-populations. The mutation strategy enhances the ability of the algorithm to jump out of the local optimal solutions by using the information of the current optimal solution. Based on the TMWOA, we propose a multi-output MPRM logic circuits power optimization approach(TMMPOA). Experiments based on the benchmark circuits of the Microelectronics Center of North Carolina(MCNC) validate the effectiveness and superiority of the proposed TMMPOA.

关键词： Multi-output mixed polarity Reed-Muller Power optimization Combinatorial optimization problem Whale optimization algorithm Two-populations strategy Mutation strategy

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Research on Credit Regulation Mechanism of E-commerce Platform Based on Evolutionary Game Theory

引用

Journal of Systems Science and Systems engineering 2024年第3期33卷 330-359页

作者： Zeguo Qiu Yuchen Yin Yao Yuan Yunhao Chen school of computer and information engineering Harbin University of CommerceHarbin150028China school of Management Harbin University of CommerceHarbin150028China

In the growing e-commerce industry,the problem of malicious business operations has become increasingly prominent,exposing many problems such as weak supervision of e-commerce platforms and no way for consumers to complain.In order to solve the problems of counterfeit and shoddy products on e-commerce platforms and promote the sustainable development of the e-commerce industry in China,this paper constructs a three-party evolutionary game model of e-commerce platforms,merchants,and consumers,investigates the influence of each influencing factor on each party’s strategy choice,and provides targeted suggestions to e-commerce platforms based on relevant factors.Finally,the impact of several important parameters on the equilibrium solution is discussed through sensitivity analysis.The results show that:1)the smaller the cost difference between active and negative regulation,the more the e-commerce platform tends to active regulation strategy,but increasing fines for dishonest merchants and consumer complaints have little impact on the e-commerce platform;2)increasing consumer compensation,creating an honest business environment,and reducing the cost of honest business all help companies tend to operate in good faith;3)the only factor that affects the tendency of consumer complaint strategies is the cost of complaints.The loss suffered by silence and the compensation given to consumers have little effect on consumers’tendency to complain strategy.The results can provide theoretical guidance for participants to make useful strategic decisions in the e-commerce market.

关键词： Evolutionary game e-commerce data simulation

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：