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

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Fan, Ziyu Zhang, Yuanpeng Li, Yahan Zhong, Zeyu Deng, Lei Central South University School of Computer Science and Engineering Changsha China Xinjiang University School of Software Wulumuqi China

ISBN: (纸本)9798350386226

This study investigates the role of circular RNAs (circRNAs) in drug sensitivity, with a focus on their potential to inform personalized medicine. While current methods for identifying circRNA-drug sensitivity associations are resource-intensive, we propose LSNSCDA, a novel prediction algorithm that integrates Local Smoothing Graph Neural Networks (LS-GNN) and Credible Negative Sampling (CNS) to improve prediction accuracy. Our approach overcomes the challenges of fixed-length propagation in graph neural networks and the unreliability of randomly sampled negative instances. Experimental results show that LSNSCDA outperforms existing models, providing more reliable predictions and valuable insights into cancer treatment. Extensive evaluation confirms the effectiveness of each component of our model, while case studies further demonstrate its practical applicability. The source code and dataset are available at https://***/ZiyuFanCSU/LSNSCDA. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Enhancing Security and Privacy in Distributed Face Recognition Systems through Blockchain and GAN Technologies

引用

computers, Materials & Continua 2024年第5期79卷 2609-2623页

作者： Muhammad Ahmad Nawaz Ul Ghani Kun She Muhammad Arslan Rauf Shumaila Khan Javed Ali Khan Eman Abdullah Aldakheel Doaa Sami Khafaga School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu611731China Department of Computer Science University of Science&TechnologyBannu28100Pakistan Department of Computer Science University of HertfordshireHatfieldAL109ABUK Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityRiyadh11671Saudi Arabia

The use of privacy-enhanced facial recognition has increased in response to growing concerns about data securityand privacy in the digital age. This trend is spurred by rising demand for face recognition technology in a varietyof industries, including access control, law enforcement, surveillance, and internet communication. However,the growing usage of face recognition technology has created serious concerns about data monitoring and userprivacy preferences, especially in context-aware systems. In response to these problems, this study provides a novelframework that integrates sophisticated approaches such as Generative Adversarial Networks (GANs), Blockchain,and distributed computing to solve privacy concerns while maintaining exact face recognition. The framework’spainstaking design and execution strive to strike a compromise between precise face recognition and protectingpersonal data integrity in an increasingly interconnected environment. Using cutting-edge tools like Dlib for faceanalysis,Ray Cluster for distributed computing, and Blockchain for decentralized identity verification, the proposedsystem provides scalable and secure facial analysis while protecting user privacy. The study’s contributions includethe creation of a sustainable and scalable solution for privacy-aware face recognition, the implementation of flexibleprivacy computing approaches based on Blockchain networks, and the demonstration of higher performanceover previous methods. Specifically, the proposed StyleGAN model has an outstanding accuracy rate of 93.84%while processing high-resolution images from the CelebA-HQ dataset, beating other evaluated models such asProgressive GAN 90.27%, CycleGAN 89.80%, and MGAN 80.80%. With improvements in accuracy, speed, andprivacy protection, the framework has great promise for practical use in a variety of fields that need face recognitiontechnology. This study paves the way for future research in privacy-enhanced face recognition systems, emphasizingt

关键词： Facial recognition privacy protection blockchain GAN distributed systems

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Multi-Keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

引用

computers, Materials & Continua 2024年第3期78卷 3177-3194页

作者： Bin Wu Xianyi Chen Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei School of Computer and Big Data Science Jiujiang UniversityJiujiang332005China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Engineering Hubei University of Arts and ScienceXiangyang441053China School of Modern Information Technology Zhejiang Institute of Mechanical and Electrical EngineeringHangzhou310053China Information Center Jiangxi Changjiang Chemical Co.Ltd.Jiujiang332005China School of Mathematics and Computer Science Ningxia Normal UniversityGuyuan756099China

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so *** owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud *** on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure *** issue of privacy data protection has become an important obstacle to data sharing and *** to query outsourcing graph data safely and effectively has become the focus of *** query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same *** work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a *** our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud *** proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental *** research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

关键词： Privacy-preserving adjacency query multi-keyword fuzzy search encrypted graph

来源：评论

学校读者我要写书评

暂无评论

FCA-based θ-iceberg core decomposition in graphs

引用

Journal of Ambient Intelligence and Humanized Computing 2024年第2期15卷 1423-1428页

作者： Hao, Fei Xinchang, Khamphaphone Park, Doo-Soon Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an China School of Computer Science Shaanxi Normal University Xi’an710119 China Department of Computer Science and Engineering Soonchunhyang University Asan31538 Korea Republic of Department of Computer Software Engineering Soonchunhyang University Asan31538 Korea Republic of

Complex networking analysis is a powerful technique for understanding both complex networks and big graphs in ubiquitous computing. Particularly, there are several novel metrics, such as k-clique and k-core are proposed in order to study the relative importance of nodes in complex networks. Among of those metrics, k-core analysis is an effective approach for simplifying graphical structure. However, the relation between k and the scale of networks is not explored in most existing literature. Toward this end, this paper formulate a new research problem, θ-Iceberg Core decomposition in graphs, which is able to incorporate a parameter θ (0 © Springer-Verlag GmbH Germany, part of Springer Nature 2017.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

PathActMarker:an R package for inferring pathway activity of complex diseases

引用

Frontiers of computer science 2025年第3期19卷 123-124页

作者： Xingyi LI Jun HAO Zhelin ZHAO Junming LI Xingyu LIAO Min LI Xuequn SHANG School of Computer Science Northwestern Polytechnical UniversityXi’an 710072China Research&Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen 518063China School of Software Northwestern Polytechnical UniversityXi’an 710072China Hunan Provincial Key Lab on Bioinformatics School of Computer Science and EngineeringCentral South UniversityChangsha 410083China

1 Introduction The process of complex diseases is closely linked to the disruption of key biological pathways,it is crucial to identify the dysfunctional pathways and quantify the degree of dysregulation at the indivi... 详细信息

关键词： pathway activity dysregulation complex diseases biological pathways disruption key biological pathwaysit identify dysfunctional pathways

来源：评论

学校读者我要写书评

暂无评论

Optimizing Monitoring Utility of Unmanned Aerial Vehicles Considering Adverse Effects

引用

IEEE Transactions on Mobile Computing 2025年第07期24卷 5996-6013页

作者： Zhang, Haihan Dai, Haipeng Qiu, Yu Yu, Enze Zhou, Ruiben Wang, Weijun Wang, Jingwu Chen, Guihai Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China South China University of Technology School of Computer Science and Engineering Guangzhou China Beijing China

For Unmanned Aerial Vehicles (UAVs) monitoring tasks, capturing high quality images of target objects is important for subsequent recognition. Concerning the problem, many prior works study placement/trajectory planning for UAVs to maximize the quality of captured images. However, all of them overlook a fact that UAV monitoring may cause a huge risk/annoyance on living objects. In this paper, we investigate the novel problem of oPtimizing unmanned aErial vehicles plAcement by Considering both monitoring utility and adverse Effects (PEACE). We propose an approach to solve PEACE, which is proved to be NP-hard. Overall, our approach achieves a 1-1/e- approximation ratio. First, we approximate the original problem of PEACE as a classical problem of Monotone Submodular function Maximization under a Uniform Matroid constraint (MSMUM) with a controlled gap. Then, for MSMUM, we propose a combination of algorithms achieving a 1-1/e approximation and O(n\log n) time complexity considering the correlation among the UAV monitoring strategies. The proposed algorithms outperform existing algorithms for MSMUM through theoretical analysis and experimental results. Extensive simulations and field experiments demonstrate the effectiveness of our approach, achieving performance gains of 9.0% to 1434.5% compared to existing methods. © 2002-2012 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

CMCF-Net: An End-to-End Context Multiscale Cross-Fusion Network for Robust Copy-Move Forgery Detection

引用

IEEE Transactions on Multimedia 2024年 26卷 6090-6101页

作者： Xiong, Lizhi Xu, Jianhua Yang, Ching-Nung Zhang, Xinpeng Nanjing University of Information Science and Technology School of Computer Science Nanjing210044 China Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology Engineering Research Center of Digital Forensics Ministry of Education Nanjing210044 China Nanjing University of Information Science and Technology Software Engineering Nanjing210044 China National Dong Hwa University Department of Computer Science and Information Engineering Hualien974301 Taiwan Fudan University School of Computer Science Shanghai200433 China

Image copy-move forgery detection (CMFD) has become a challenging problem due to increasingly powerful editing software that makes forged images increasingly realistic. Existing algorithms that directly connect multiple scales of features in the encoder part may not effectively aggregate contextual information, resulting in poor performance. In this paper, an end-to-end context multiscale cross-fusion network (CMCF-Net) is proposed to detect image copy-move forgery. The proposed network consists of a multiscale feature extraction fusion (MSF) module and a multi-information fusion decoding (MFD) module. Multiscale information is efficiently extracted and fused in the MSF module utilizing stacked-scale feature fusion, which improves the network's forgery localization ability on objects of different scales. The MFD module employs contextual information combination and weighted fusion of multiscale information to guide the network in obtaining relevant clues from correlated information at multiple different scales. Experimental results and analysis have demonstrated that the proposed CMCF-Net achieves the best localization results with higher robustness. © 1999-2012 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Intelligent Segment Routing: Toward Load Balancing with Limited Control Overheads

引用

Big Data Mining and Analytics 2023年第1期6卷 55-71页

作者： Shu Yang Ruiyu Chen Laizhong Cui Xiaolei Chang College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518000China Tsinghua Shenzhen International Graduate School Tsinghua UniversityShenzhen 518071China

Segment routing has been a novel architecture for traffic engineering in recent ***,segment routing brings control overheads,i.e.,additional packets headers should be *** overheads can greatly reduce the forwarding efficiency for a large network,when segment headers become too *** achieve the best of two targets,we propose the intelligent routing scheme for traffic engineering(IRTE),which can achieve load balancing with limited control *** achieve optimal performance,we first formulate the problem as a mapping problem that maps different flows to key diversion ***,we prove the problem is nondeterministic polynomial(NP)-hard by reducing it to a k-dense subgraph *** solve this problem,we develop an ant colony optimization algorithm as improved ant colony optimization(IACO),which is widely used in network optimization *** also design the load balancing algorithm with diversion routing(LBA-DR),and analyze its theoretical ***,we evaluate the IRTE in different real-world topologies,and the results show that the IRTE outperforms traditional algorithms,e.g.,the maximum bandwidth is 24.6% lower than that of traditional algorithms when evaluating on BellCanada topology.

关键词： traffic engineering segment routing bandwidth load balancing ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Federated Learning Using Dynamic Update and Adaptive Pruning with Momentum on Shared Server Data

引用

ACM Transactions on Intelligent Systems and Technology 2024年第6期15卷 1-28页

作者： Liu, Ji Jia, Juncheng Zhang, Hong Yun, Yuhui Wang, Leye Zhou, Yang Dai, Huaiyu Dou, Dejing Hithink RoyalFlush Information Network Co. Ltd. Hangzhou China School of Computer Science and Technology Soochow University Suzhou China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China Baidu Research Beijing China Key Lab of High Confidence Software Technologies Ministry of Education and Software Institute Peking University Beijing China Department of Computer Science and Software Engineering Auburn University AuburnAL United States Department of Electrical and Computer Engineering North Carolina State University RaleighNC United States Bedi Cloud and School of Computer Science Fudan University Beijing China

Despite achieving remarkable performance, Federated Learning (FL) encounters two important problems, i.e., low training efficiency and limited computational resources. In this article, we propose a new FL framework, i.e., FedDUMAP, with three original contributions, to leverage the shared insensitive data on the server in addition to the distributed data in edge devices so as to efficiently train a global model. First, we propose a simple dynamic server update algorithm, which takes advantage of the shared insensitive data on the server while dynamically adjusting the update steps on the server in order to speed up the convergence and improve the accuracy. Second, we propose an adaptive optimization method with the dynamic server update algorithm to exploit the global momentum on the server and each local device for superior accuracy. Third, we develop a layer-adaptive model pruning method to carry out specific pruning operations, which is adapted to the diverse features of each layer so as to attain an excellent tradeoff between effectiveness and efficiency. Our proposed FL model, FedDUMAP, combines the three original techniques and has a significantly better performance compared with baseline approaches in terms of efficiency (up to 16.9 times faster), accuracy (up to 20.4% higher), and computational cost (up to 62.6% smaller). © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Collaborative learning-based inter-dependent task dispatching and co-location in an integrated edge computing system

引用

Digital Communications and Networks 2024年第6期10卷 1837-1850页

作者： Uchechukwu Awada Jiankang Zhang Sheng Chen Shuangzhi Li Shouyi Yang School of Software Henan Institute of Science and TechnologyXinxiang 453003China School of Electrical and Information Engineering Zhengzhou UniversityZhengzhou 450001China Department of Computing and Informatics Bournemouth UniversityPoole BH125BBUK School of Electronics and Computer Science University of SouthamptonSouthampton SO171BJUK Faculty of Information Science and Engineering Ocean University of ChinaQingdao 266100China

Recently,several edge deployment types,such as on-premise edge clusters,Unmanned Aerial Vehicles(UAV)-attached edge devices,telecommunication base stations installed with edge clusters,etc.,are being deployed to enable faster response time for latency-sensitive *** fundamental problem is where and how to offload and schedule multi-dependent tasks so as to minimize their collective execution time and to achieve high resource *** approaches randomly dispatch tasks naively to available edge nodes without considering the resource demands of tasks,inter-dependencies of tasks and edge resource *** approaches can result in the longer waiting time for tasks due to insufficient resource availability or dependency support,as well as provider ***,we present Edge Colla,which is based on the integration of edge resources running across multi-edge *** Colla leverages learning techniques to intelligently dispatch multidependent tasks,and a variant bin-packing optimization method to co-locate these tasks firmly on available nodes to optimally utilize *** experiments on real-world datasets from Alibaba on task dependencies show that our approach can achieve optimal performance than the baseline schemes.

关键词： Edge computing Collaborative learning Resource utilization Execution time Edge federation Gang scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：