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

BDLR:lncRNA identification using ensemble learning

BIOCELL 2022年第4期46卷 951-960页

作者： LEJUN GONG SHEHAI ZHOU JINGMEI CHEN YONGMIN LI LI ZHANG ZHIHONG GAO Jiangsu Key Lab of Big Data Security&Intelligent Processing School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing210046China Smart Health Big Data Analysis and Location Services Engineering Laboratory of Jiangsu Province Nanjing210046China Zhejiang Engineering Research Center of Intelligent Medicine Wenzhou325035China College of Computer Science and Technology Nanjing Forestry UniversityNanjing210037China

Long non-coding RNAs(lncRNAs)play an important role in many life activities such as epigenetic material regulation,cell cycle regulation,dosage compensation and cell differentiation regulation,and are associated with many human *** are many limitations in identifying and annotating lncRNAs using traditional biological experimental *** the development of high-throughput sequencing technology,it is of great practical significance to identify the lncRNAs from massive RNA sequence data using machine learning *** on the Bagging method and Decision Tree algorithm in ensemble learning,this paper proposes a method of lncRNAs gene sequence identification called *** identification results of this classification method are compared with the identification results of several models including Byes,Support Vector Machine,Logical Regression,Decision Tree and Random *** experimental results show that the lncRNAs identification method named BDLR proposed in this paper has an accuracy of 86.61%in the human test set and 90.34%in the mouse for lncRNAs,which is more than the identification results of the other ***,the proposed method offers a reference for researchers to identify lncRNAs using the ensemble learning.

关键词： lncRNAs High-throughput sequencing Ensemble learning Bagging Decision Tree

来源：评论

学校读者我要写书评

暂无评论

DDoS Detection and Defense Based on FLAD and SDN 20

DDoS Detection and Defense Based on FLAD and SDN

引用

20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Dong, Jie Fang, Wenyu Zheng, Wanling Liu, Jinkun Liu, Yanhua College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China

ISBN: (纸本)9798350356328

In order to achieve more efficient and accurate DDoS detection while ensuring data privacy, this paper proposes a DDoS detection method based on FLAD. Firstly, this paper uses the FLAD algorithm to train a global DDoS detection model without leaving local traffic data, protecting the privacy and security of traffic data between different hosts, and improving aggregation efficiency by dynamically adjusting the aggregation weights to adapt to different sub-dataset increments. Secondly, a DDoS traffic detection method based on the integration of LSTM and CNN is proposed, which extracts and analyzes the temporal correlation of traffic data by calculating the statistical characteristics of traffic data within a time period, to achieve real-time detection of traffic feature data. Again, combined with the concept of SDN, real-time defense against DDoS based on ODL-API is implemented, and precise matching of DDoS detection results with network entity information is achieved, realizing the technology of real-time and precise issuance of multiple flow rules, effectively blocking DDoS malicious attack traffic, protecting important entities in the topology, and maintaining stable traffic in the topology. This paper focuses on solving the detection problem of DDoS traffic data increments and uneven data distribution through the FLAD algorithm. Experimental results show that the proposed method improves the accuracy of DDoS attack detection by more than 4% and the F1 Score by more than 7% compared to the FedAvg aggregation algorithm. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

CITE: Compact Interactive TransformEr for Multilingual Image Captioning 23

CITE: Compact Interactive TransformEr for Multilingual Image...

引用

6th International Conference on Image and Graphics Processing, ICIGP 2023

作者： Xu, Yueyuan Hu, Zhenzhen Zhou, Yuanen Hao, Shijie Hong, Richang Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei University of Technology China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China

ISBN: (纸本)9781450398572

Current state-of-the-art image captioning models generate captions in a single language, requiring a combination of multiple language specific models to build a multilingual image captioning system. However, as the number of supported languages increases, it leads to the parameters of the multilingual image captioning system grow linearly. To tackle this issue, we propose a single Compact Interactive TransformEr (CITE) model, which can describe an image in multiple languages simultaneously, making the captioning system more compact. Specifically, based on the standard Transformer model, we share the encoder and decoder backbone parameters and replace the self-attention sub-layer in the decoder with the interactive attention sub-layer. In addition, we extend the traditional monolingual reinforcement learning mechanism to a multilingual version to promote better description generation. Due to the wide use of Chinese and English, we evaluate the performance of our CITE model by simultaneously generating English and Chinese captions. We expand the image captions of the whole MSCOCO dataset and release a COCO-EN-CN dataset. Extensive experiments on the COCO-EN-CN dataset show that our single CITE model with more parameter-efficient can maintain the competitive performance or even better than the monolingual captioning models. © 2023 ACM.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Bayesian Optimization of Double-SAC Robotic Arm Path Planning Using Recent Prioritized Experience Replay 5

Bayesian Optimization of Double-SAC Robotic Arm Path Plannin...

引用

5th World Robot Conference Symposium on Advanced Robotics and Automation, WRC SARA 2023

作者： Yuan, Shuai Wen, Ke Zhang, Feng Xiong, Jianqiang Shenyang Jianzhu University Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Branch of National Special Computer Engineering Technology Research Center School of Computer Science and Engineering Shengyang110168 China Shenyang Jianzhu University School of Electrical and Control Engineering Shengyang110168 China

ISBN: (纸本)9798350307320

As for the path planning of robotic arms, Deep Reinforcement Learning (DRL) algorithms have recently been developed. However, the high-dimensional action space and state space will result in reward sparsity and low training efficiency of robotic arm path planning. We propose a Bayesian optimization of Double-SAC algorithm using recent priority experience replay to solve these issues. We first propose the sampling method of recent prioritized experience replay (RPER), which combines recent sampling and prioritized experience replay (PER). The interval of experience pool is divided according to the recent sampling method, and sampling is performed according to the sample priority of the interval. Then we adopt a Bayesian optimization method that reduces the variance of the random strategy and improve the quality of the sampled actions. The larger variance is more beneficial for exploring the environment. Smaller variance is advantageous for exploiting good experiences to obtain higher returns. Our approach finds a good balance between exploration and exploitation. We train two Soft Actor Critic (SAC) agents to obtain two independent probability distributions, and a Bayesian optimizer is adopted to combine the two distributions to design a hybrid strategy. The hybrid strategy can output better actions according to the uncertainty estimation of the distribution, and further enhance training efficiency and stability. Finally, simulation tests are performed on the ROS-Gazebo platform, and the simulation results illustrate that the algorithm proposed in this paper converges faster and has a shorter training time than the original algorithm in terms of path planning performance. © 2023 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Channel Capacity and Power Allocation of MIMO Visible Light Communication System

引用

China Communications 2023年第2期20卷 122-138页

作者： Shuai Ma Ruixin Yang Guanjie Zhang Hang Li Wen Cao Linqiong Jia Yanyu Zhang Shiyin Li Peng Cheng Laboratory Shenzhen 518055China School of Information and Control Engineering China University of Mining and TechnologyXuzhou 221116China Shenzhen Research Institute of Big Data Shenzhen 518172China School of Electronics and Control Engineering Chang’an UniversityXi’an 710064China School of Electronic and Optical Engineering Nanjing University of Science and TechnologyNanjing 210094China National Digital Switching System Engineering&Technological Research Center Zhengzhou 450000China

In this paper,the channel capacity of the multiple-input multiple-output(MIMO)visible light communication(VLC)system is investigated under the peak,average optical and electrical power *** the channel capacity of MIMO VLC is shown to be a mixed integer programming *** address this open problem,we propose an inexact gradient projection method to find the channel capacity-achieving discrete input distribution and the channel capacity of MIMO *** we derive both upper and lower bounds of the capacity of MIMO VLC with the closed-form ***,by considering practical discrete constellation inputs,we develop the optimal power allocation scheme to maximize transmission rate of MIMO VLC *** results show that more discrete points are needed to achieve the channel capacity as SNR *** the upper and lower bounds of channel capacity are tight at low SNR *** addition,comparing the equal power allocation,the proposed power allocation scheme can significantly increase the rate for the low-order modulation inputs.

关键词： visible light communication MIMO discrete constellation inputs power allocation

来源：评论

学校读者我要写书评

暂无评论

PGP: Prior-Guided Pretraining for Small-sample Esophageal Cancer Segmentation

PGP: Prior-Guided Pretraining for Small-sample Esophageal Ca...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Shi, Qinglei Duan, Wenhan Chen, Wanyi Yang, Haotian Lu, Haochen Wu, Kecan Zhu, Junxi Yuan, Juefei Ke, Qiyan Zhang, Andu Wan, Xiang Wang, Changmiao Ruan, Li Wang, Renzhi Chinese University of Hong Kong Shandong University School of Software Jinan China Sino-French School of Engineering Beihang University Beijing China School of Data Science Chinese University of Hong Kong Shenzhen China School of Computer Science Beihang University Beijing China School of Medicine Zhengzhou University Zhengzhou China School of Medicine Chinese University of Hong Kong Shenzhen Shenzhen China Hebei Medical University Fourth Afliated Hospital University Hebei China Shenzhen Research Institute of Big Data Chinese University of Hong Kong Shenzhen China Medical Big Data Lab Shenzhen Research Institute of Big Data Shenzhen China School of Computer Science and Engineering Beihang University Beijing China School of Medicine Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9798350386226

Transformer-based models have demonstrated substantial potential in medical image segmentation tasks due to their exceptional ability to capture long-range dependencies. To further enhance segmentation performance, various effective methods have been proposed, including pretraining methods (weakly supervised or self-supervised pretraining schemes), contrastive learning schemes, and knowledge distillation methods. However, segmenting esophageal cancer (EC) from CT images remains a significant challenge, partly due to the complex anatomy of EC, such as variable shapes, extensive extents, and often blurred boundaries with adjacent anatomical structures. In this study, we propose a prior-guided pretraining (PGP) regimen based on bounding boxes, which enhances the model's ability to discern textural differences between EC and the surrounding tissues. Using Swin UNITR as the backbone, our proposed pretraining scheme demonstrates superior performance in EC segmentation compared to other schemes. To further improve the segmentation accuracy of EC, we also addressed the class imbalance and long-tail problems inherent in EC segmentation, thereby further enhancing segmentation performance. © 2024 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling Attack on Multiplexer PUFs via Kronecker Matrix Multiplication

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Wang, Hongfei Wan, Caixue Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China

The Physical Unclonable Function (PUF) is valued for its lightweight nature and unique functionality, making it a common choice for securing hardware products requiring authentication and key generation mechanisms. In response to the susceptibility of individual PUFs to modeling attacks, advanced PUF variants have been developed to improve security measures. One notable type in this regard is the multiplexer-based composition of arbiter PUFs, known as MPUF, which aims to meet high reliability and security standards simultaneously. Current research on attacking MPUF encounters challenges such as substantial demands for training CRPs and low success rates. In this work, we propose a novel numerical modeling attack strategy for MPUFs. Using Kronecker products from mathematical perspective, this method precisely describe the MPUF model without using complex network architectures, boosting attack accuracy and overall efficiency. Experiment comparison with state-of-the-art works demonstrates that our method achieves better performance in terms of attack accuracy, robustness, and efficiency. Our method is able to successfully attack a (512, 8)-MPUF in 32.71 minutes with 97.14% accuracy, outperforming all existing attack methods on MPUFs. More, we validate our method through experiments with hardware implementations on FPGAs. The advantages of our method also include the adaptability to be employed to attack other MPUF variations like cMPUF and rMPUF, and the capability to be integrated with an existing attack method for launching efficient attack on MPUFs leveraging reliability information. © 2025 IEEE.

关键词： modeling attack multiplexer-based PUF Physical unclonable function

来源：评论

学校读者我要写书评

暂无评论

Credibility Assessment Based Byzantine-Resilient Decentralized Learning

引用

IEEE Transactions on Dependable and Secure Computing 2022年 1-12页

作者： Hou, Jian Wang, Fangyuan Wei, Chunling Huang, Hongyun Hu, Yong Gui, Ning School of Information Science & Technology Zhejiang Sci-Tech University China Beijing Institute of Control Engineering China Center of Multi-Media Big Data of Library Zhejiang Sci-Tech University China School of Computer Science and Engineering Central South University China

Decentralized deep learning has made significant success since it avoids the single point of failure in centralized solutions. However, the system might deviate from the correct model due to Byzantine attacks. Existing Byzantine-resilient defense models are mainly of a one-step evaluation fashion, making them vulnerable to rigorous topology and sophisticated cyber-attacks due to lack of historical evaluations. This paper proposes a credibility assessment based parameter aggregation rule (CA-PAR) that evaluates each neighboring node by its long-term performance. For each node and its neighbors, two concepts, immediate reward and history information based credibility are firstly proposed to describe the immediate reliability at current iteration and the comprehensive assessment of the reliability respectively. Thereafter, all the received parameters are aggregated in linear combination, in which the adjacent weight is determined by credibility value. Finally, the influences of suspicious nodes can gradually be reduced and eliminated. Experimental results in MNIST and CIFAR-10 datasets indicate the algorithm’s tolerance for five state-of-the-art attack methods against an arbitrary number of faulty nodes. Compared with the previous defense models, the proposed algorithm in this paper outperforms in topology constraints, training accuracy and computation cost. IEEE

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

A topic detection method based on KM-LSH Fusion algorithm and improved BTM model

引用

Soft Computing 2024年第19期28卷 11421-11438页

作者： Liu, Wenjun Guo, Huan Gan, Jiaxin Wang, Hai Wang, Hailan Zhang, Chao Peng, Qingcheng Sun, Yuyan Yu, Bao Hou, Mengshu Li, Bo Li, Xiaolei School of Computer and Software Engineering XiHua University Chengdu610039 China Chengdu611731 China Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College Luzhou646000 China School of Big Data and Artificial Intelligence Chengdu Technological University Chengdu611730 China Sichuan Provincial Engineering Research Center of Hydroelectric Energy Power Equipment Technology Chengdu610039 China

Topic detection is an information processing technology designed to help people deal with the growing problem of data information on the Internet. In the research literature, topic detection methods are used for topic classification through word embedding, supervised-based and unsupervised-based approaches. However, most methods for topic detection only address the problem of clustering and do not focus on the problem of topic detection accuracy reduction due to the cohesiveness of topics. Also, the sequence of biterm during topic detection can cause substantial deviations in the detected topic content. To solve the above problems, this paper proposes a topic detection method based on KM-LSH fusion algorithm and improved BTM model. KM-LSH fusion algorithm is a fusion algorithm that combines K-means clustering and LSH refinement clustering. The proposed method can solve the problem of cohesiveness of topic detection, and the improved BTM model can solve the influence of the sequence of biterm on topic detection. First, the text vector is constructed by processing the collected set of microblog texts using text preprocessing methods. Secondly, the KM-LSH fusion algorithm is used to calculate text similarity and perform topic clustering and refinement. Finally, the improved BTM model is used to model the texts, which is combined with the word position and the improved TF-IDF weight calculation algorithm to adjust the microblogging texts in clustering. The experiment results indicate that the proposed KM-LSH-IBTM method improves the evaluation indexes compared with the other three topic detection methods. In conclusion, the proposed KM-LSH-IBTM method promotes the processing capability of topic detection in terms of cohesiveness and the sequence of biterm. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

λGrapher: A Resource-Efficient Serverless System for GNN Serving through Graph Sharing 24

λGrapher: A Resource-Efficient Serverless System for GNN Se...

引用

33rd ACM Web Conference, WWW 2024

作者： Hu, Haichuan Liu, Fangming Pei, Qiangyu Yuan, Yongjie Xu, Zichen Wang, Lin National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab in the School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan China Peng Cheng Laboratory Huazhong University of Science and Technology China School of Mathematics and Computer Science Nanchang University China Paderborn University Paderborn Germany

ISBN: (纸本)9798400701719

Graph Neural Networks (GNNs) have been increasingly adopted for graph analysis in web applications such as social networks. Yet, efficient GNN serving remains a critical challenge due to high workload fluctuations and intricate GNN operations. Serverless computing, thanks to its flexibility and agility, offers on-demand serving of GNN inference requests. Alas, the request-centric serverless model is still too coarse-grained to avoid resource waste. Observing the significant data locality in computation graphs of requests, we propose λGrapher, a serverless system for GNN serving that achieves resource efficiency through graph sharing and fine-grained resource allocation. "Grapher features the following designs: (1) adaptive timeout for request buffering to balance resource efficiency and inference latency, (2) graph-centric scheduling to minimize computation and memory redundancy, and (3) resource-centric function management with fine-grained resource allocation catered to the resource sensitivities of GNN operations and function orchestration optimized to hide communication latency. We implement a prototype of λGrapher based on the representative open-source serverless platform Knative and evaluate it with real-world traces from various web applications. Our results show that λGrapher can achieve an average savings of 61.5% in memory resource and 47.2% in computing resource compared with the state of the arts while ensuring GNN inference latency. © 2024 ACM.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：