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

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Shu, Tianye Nan, Yang Shang, Ke Ishibuchi, Hisao Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Department of Computer Science and Engineering Shenzhen518055 China Southern University of Science and Technology Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

ISBN: (纸本)9798350308365

For evolutionary multi-objective optimization algorithms (EMOAs), an external archive can be utilized for saving good solutions found throughout the evolutionary process. Recent studies showed that a solution set selected from an external archive is usually superior to the final population. That is, the incorporation of an external archive improves the performance of EMOAs. However, the computation time for maintaining an external archive is long, especially when the archive size is large. To solve this issue, a simple archiving strategy is to save all solutions generated in the last several generations. In this paper, we examine this archiving strategy for three representative EMOAs on artificial test problems (Minus-DTLZ and WFG) and real-world problems (RE). Our results show that archiving the last several generations clearly improves the performance of EMOAs without severely increasing the computation time. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Confident Information Coverage Reliability Evaluation for Sensor Networks of Openly Deployed ICP systems

IEEE Transactions on Industrial Cyber-Physical Systems

引用

IEEE Transactions on Industrial Cyber-Physical systems 2024年 2卷 565-574页

作者： Chen, Suning Yi, Yuanyuan Yi, Lingzhi Liu, Shenghao Deng, Xianjun Xia, Yunzhi Fan, Xiaoxuan Yang, Laurence T. Park, Jong Hyuk Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security The School of Cyber Science and Engineering Wuhan430074 China Huazhong University of Science and Technology School of Journalism and Information Communication Wuhan430074 China Zhongnan University of Economics and Law School of Information and Safety Engineering Wuhan430073 China Seoul National University of Technology Department of Computer Science and Engineering Seoul01811 Korea Republic of

Industrial Cyber-Physical (ICP) systems are integration of computation and physical processes to help achieve operational excellence. As sensors and actuators compose the openly deployed ICP systems and are often susceptible to interference, it puts forward higher requirements on reliability. Reliable coverage ensures sensors acquiring information and therefore coverage reliability of sensor network is studied from various perspectives. However, most existing reliability evaluation methods ignore the belief degree of coverage which influences the reliability to an extent. To evaluate the coverage reliability from the perspective of belief degree, we firstly define Confident Information Coverage Belief Reliability (CICBR) based on the Confident Information Coverage (CIC) model and D-S evidence theory, which comprehensively considers the coverage rate, interference from the environment, and belief degree of the result. Next, to evaluate the belief degree more reasonably, an Evidence-discount-based basic probability assignment generating method is proposed based on D-S theory to describe the interference in the belief degree. Moreover, a belief evaluation algorithm is proposed to calculate the belief degree of the coverage. Finally, an evidence-Discount-based Confident Information Coverage Belief Reliability Evaluation (D-CICBRE) algorithm is proposed to evaluate CICBR. The simulation result indicates that the proposed method can obtain higher and more reasonable reliability. Therefore, the proposed D-CICBRE algorithm can be used to evaluate the reliability of ICP systems more accurately and reasonably. © 2023 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

A label-guided contrastive capsule network for few-shot text classification

引用

Neural Computing and Applications 2025年 1-26页

作者： Xu, Yang Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China

Few-shot text classification involves transferring knowledge from a limited dataset to perform classification tasks in unseen domains. Existing metric-based meta-learning models, such as prototypical networks, have shown to be effective. However, these models fail to separate embeddings of similar classes, resulting in performance stagnation. Meanwhile, traditional text classification recently has succeeded with the support of extensive prior knowledge from large language models. However, in few-shot scenarios, it is challenging to generate discriminative sentence embeddings using pre-trained models, often leading to overfitting issues. Furthermore, random support set sampling adversely affects prototype quality, resulting in inaccurate category representations. In this paper, we propose the label-guided contrastive capsule network (LGCCN) to address these issues. LGCCN introduces label information as external knowledge for each category, comprising a label-guided contrastive clustering module (LGCCM) and a label-guided prototype enhancement module (LGPEM). LGCCM employs label information to guide a contrastive clustering process, using labels as anchors to enhance the process, yielding discriminative sentence embeddings from the pre-trained model. LGPEM iteratively generates a robust prototype with label guidance, significantly reducing the impact of random support set sampling. The proposed LGCCN was thoroughly evaluated on seven benchmark datasets from diverse application domains. Experimental results demonstrate that LGCCN outperforms the state-of-the-art (SOTA) method by 9.7% in 1-shot tasks and 1.1% in 5-shot tasks on news datasets. Additionally, on intent recognition datasets, LGCCN surpasses the SOTA with a 3.3% improvement in 1-shot tasks and a 1.4% improvement in 5-shot tasks, highlighting its superior performance in few-shot text classification. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

MDPFL:A Multiple Differential Privacy Protection Method based on Federated Learning

MDPFL:A Multiple Differential Privacy Protection Method base...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xinyu Liu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

With the continuous development of artificial intelligence technology, machine learning in distributed network systems, such as IoVflntemet of Vehicles), will inevitably lead to privacy leakage. At present, there are lots of problems in federated learning, differential privacy and other machine learning privacy protection schemes, such as high loss of availability and the need of a fully trusted third-party server. In order to solve these problems, we propose MDPFL(Multiple Differential Privacy based on Federated Learning) algorithm. The algorithm combines with the differential privacy model in each stage of federated learning to solve the problem of curious third-party data collectors obtaining users’ original data in the process of machine learning. Meanwhile, the algorithm does not adopt a decentralized machine learning scheme directly, but uses a double noise adding mode with the existence of the third-party data collectors. We use Laplacian mechanism in the central server and GRR mechanism in local clients to ensure the goal of stability of the effect of the machine ¡earning model. The algorithm is compared with FedAvg, CDP, LDP algorithm in accuracy and loss rate which based on EMNIST data sets. In different global sensitivities, the model training effect is consistent with FedAvg algorithm while comparing with LDP algorithm, the speed of model convergence is improved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Regular Ricci-Inverse Cosmology with Multiple Anticurvature Scalars

arXiv

引用

arXiv 2025年

作者： Mou, Yicen School of Physics Hubei University Hubei Wuhan430062 China Key Laboratory of Intelligent Sensing System and Security Hubei University Ministry of Education China

We investigate the modified gravity in which the Lagrangian of gravity is a function of the trace of the n-th matrix power of Ricci tensor in a Friedmann–Lemaître–Robertson–Walker(FLRW) spacetime. When n is negative, the inverse of Ricci tensor, also called the anticurvature tensor, will be introduced. We design a new class of Ricci-inverse theory containing two anticurvature scalars and resulting to be free from the singularity problem. Copyright © 2025, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Recognition of Disaster Images Based on Self-Supervised Learning 7

Recognition of Disaster Images Based on Self-Supervised Lear...

引用

7th International Conference on Cloud Computing and Big data Analytics, ICCCBDA 2022

作者： Wang, Linyong Wu, Ruiqi Li, Cen Zou, Zhiqiang Nanjing University of Posts and Telecommunications NanJing China College of Computer Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing NanJing China

ISBN: (纸本)9781665487115

Existing supervised deep learning model requires large amounts of labeled training data to learn new tasks. This is a limitation for many practical applications in disaster areas as well as in many other fields such as medical domain, where numerous labour and time are required to label datasets. According to our literature survey, there is few self-supervised learning model with high accuracy for image recognition about natural disasters. This paper proposed a self-supervised learning model for disaster image recognition based on MoCo model, called MoCo-Q, including image preprocessing, model training and transfer learning after fine-Tuning. After being trained by learning a couple of features of disaster images without artificial labels, the trained neural network is applied to downstream tasks, which achieves the recognition of a large number of disaster images at a high accuracy without the manual intervention and labeling. With the implement of the MoCo-Q, images of natural disasters can be quickly recognized without manual labeling. The work can provide scientific decision-making support for the government and it is of great significance for natural disaster assessment and disaster relief. Finally, experiments on real-world natural disaster datasets, CrisisMMD and ASONAM17, are performed, and we compared with the state-of-The-Art supervised method (ResNet50) that uses same datasets. The result presents that the accuracy of the MoCo-Q (91.56%) is 5.71% higher than that of the supervised learning model (85.85%). © 2022 IEEE.

关键词： Training Image recognition Neural networks Transfer learning Supervised learning Training data Manuals

来源：评论

学校读者我要写书评

暂无评论

Economical Electricity Supplement for Mobile Collectors in Large-Scale Multitask WSNs

Economical Electricity Supplement for Mobile Collectors in L...

引用

IEEE International Conference on Big data and Cloud Computing (BdCloud)

作者： Xin Zhai Lijie Xu Jialei Zhang Kun Wang Jia Xu Bei Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

For large-scale multitask wireless sensor networks (LSM-WSNs), the traditional data collection mode could suffer low energy-efficiency on data transmission, since the large-scale multitask scenarios could result in much higher packet collision probability, especially for harsh environments. Mobile data collection is an efficient data acquisition way to prolong network lifetime for LSM-WSNs. However, the mobile collectors could suffer electricity shortage problem, since the limited battery capacity of any mobile collector could not afford the energy consumption of its long-distance movement and massive data collection in large-scale multitask scenarios. Deploying wireless chargers to supplement the energy of mobile collectors is a feasible solution to electricity shortage problem, but will incur extra charger deployment cost. In this paper, we focus on the problem that how to optimize such charger deployment cost, which is NP-hard. By transforming it into minimum-cost submodular cover problem, we devise an efficient approximation algorithm with a provable approximation ratio. The extensive simulation results reveal that our solution always outperforms the other solutions under whatever configurations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SSR-TA: Sequence to Sequence based expert recurrent recommendation for ticket automation

arXiv

引用

arXiv 2023年

作者： Cao, Chenhan Fang, Xiaoyu Luo, Bingqing Xia, Bin Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

The ticket automation provides crucial support for the normal operation of IT software systems. An essential task of ticket automation is to assign experts to solve upcoming tickets. However, facing thousands of tickets, inappropriate assignments will make tickets transfer frequently among experts, which causes time delays and wasted resources. Effectively and efficiently finding an appropriate expert in fewer steps is vital to ticket automation. In this paper, we proposed a sequence to sequence based translation model combined with a recurrent recommendation network to recommend appropriate experts for tickets. The sequence to sequence model transforms the ticket description into the corresponding resolution for capturing the potential and useful features of representing tickets. The recurrent recommendation network recommends the appropriate expert based on the assumption that the previous expert in the recommendation sequence cannot solve the expert. To evaluate the performance, we conducted experiments to compare several baselines with SSR-TA on two real-world datasets, and the experimental results show that our proposed model outperforms the baselines. The comparative experiment results also show that SSR-TA has a better performance of expert recommendations for user-generated tickets. Copyright © 2023, The Authors. All rights reserved.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

An Answer Summarization Scheme Based on Multilayer Attention Model

An Answer Summarization Scheme Based on Multilayer Attention...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xiaolong Xu Yihao Dong Jian Song Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

At present, deep learning technologies have been widely used in the field of natural language process, such as text summarization. In CQA, the answer summary could help users get a complete answer quickly. There are still some problems with the current answer summary scheme, such as semantic inconsistency, repetition of words, etc. In order to solve this, we propose a novel scheme Answer Summarization based on Multi-layer Attention Scheme (ASMAM). Based on the traditional Seq2Seq, we introduce self-attention and multi-head attention scheme respectively during sentence and text encoding, which could improve text representation ability of the model. In order to solve "long distance dependence" of RNN and too many parameters of LSTM, we all use GRU as the neuron at the encoder and decoder sides. Experiments over the Yahoo! Answers dataset demonstrate that the coherence and fluency of the generated summary are all superior to the benchmark model in ROUGE evaluation system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：