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

arXiv 2024年

作者： Wu, Zhiyuan Sun, Sheng Wang, Yuwei Liu, Min Xu, Ke Pan, Quyang Gao, Bo Wen, Tian The State Key Lab of Processers Institute of Computing Technology Chinese Academy of Sciences Beijing China The University of Chinese Academy of Sciences Beijing China The Zhongguancun Laboratory Beijing China The Department of Computer Science and Technology Tsinghua University Beijing China The School of Computer Science and Technology The Engineering Research Center of Network Management Technology for High-Speed Railway of Ministry of Education Beijing Jiaotong University Beijing China

The rise of End-Edge-Cloud Collaboration (EECC) offers a promising paradigm for Artificial Intelligence (AI) model training across end devices, edge servers, and cloud data centers, providing enhanced reliability and reduced latency. Hierarchical Federated Learning (HFL) can benefit from this paradigm by enabling multi-tier model aggregation across distributed computing nodes. However, the potential of HFL is significantly constrained by the inherent heterogeneity and dynamic characteristics of EECC environments. Specifically, the uniform model structure bounded by the least powerful end device across all computing nodes imposes a performance bottleneck. Meanwhile, coupled heterogeneity in data distributions and resource capabilities across tiers disrupts hierarchical knowledge transfer, leading to biased updates and degraded performance. Furthermore, the mobility and fluctuating connectivity of computing nodes in EECC environments introduce complexities in dynamic node migration, further compromising the robustness of the training process. To address multiple challenges within a unified framework, we propose End-Edge-Cloud Federated Learning with Self-Rectified Knowledge Agglomeration (FedEEC), which is a novel EECC-empowered FL framework that allows the trained models from end, edge, to cloud to grow larger in size and stronger in generalization ability. FedEEC introduces two key innovations: (1) Bridge Sample Based Online Distillation Protocol (BSBODP), which enables knowledge transfer between neighboring nodes through generated bridge samples, and (2) Self-Knowledge Rectification (SKR), which refines the transferred knowledge to prevent suboptimal cloud model optimization. The proposed framework effectively handles both cross-tier resource heterogeneity and effective knowledge transfer between neighboring nodes, while satisfying the migration-resilient requirements of EECC. Extensive experiments on three datasets demonstrate that FedEEC achieves significantly hi

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Real-time 3D-aware Portrait Video Relighting

arXiv

引用

arXiv 2024年

作者： Cai, Ziqi Jiang, Kaiwen Chen, Shu-Yu Lai, Yu-Kun Fu, Hongbo Shi, Boxin Gao, Lin Beijing Key Laboratory of Mobile Computing and Pervasive Device Institute of Computing Technology Chinese Academy of Sciences China Beijing Jiaotong University China University of California San Diego United States Cardiff University United Kingdom City University of Hong Kong Hong Kong The Hong Kong University of Science and Technology Hong Kong University of Chinese Academy of Sciences China National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University China National Engineering Research Center of Visual Technology School of Computer Science Peking University China

Synthesizing realistic videos of talking faces under custom lighting conditions and viewing angles benefits various downstream applications like video conferencing. However, most existing relighting methods are either time-consuming or unable to adjust the viewpoints. In this paper, we present the first real-time 3D-aware method for relighting in-the-wild videos of talking faces based on Neural Radiance Fields (NeRF). Given an input portrait video, our method can synthesize talking faces under both novel views and novel lighting conditions with a photo-realistic and disentangled 3D representation. Specifically, we infer an albedo tri-plane, as well as a shading tri-plane based on a desired lighting condition for each video frame with fast dual-encoders. We also leverage a temporal consistency network to ensure smooth transitions and reduce flickering artifacts. Our method runs at 32.98 fps on consumer-level hardware and achieves state-of-the-art results in terms of reconstruction quality, lighting error, lighting instability, temporal consistency and inference speed. We demonstrate the effectiveness and interactivity of our method on various portrait videos with diverse lighting and viewing conditions. Copyright © 2024, The Authors. All rights reserved.

关键词： Video conferencing

来源：评论

学校读者我要写书评

暂无评论

Identifying Dna-Binding Proteins Using Local Features Dpc-Pssm and Ab-Pssm with Primary Sequences Based on 2dcnn

SSRN

引用

SSRN 2024年

作者： Sikander, Rahu Rahu, Ali Ghulam Rahu, Mujeeb -Ur-Rehman Center for Computing Research Department of Computer Science and Software Engineering Jinnah University for Women Karachi Pakistan Information Technology Centre Sindh Agriculture University Sindh Tandojam Pakistan School of Information and Communication Engineering Guilin University of Electronic Technology Guilin China

DBPs, also known as DNA-binding proteins, play a crucial role in the evolutionary and genetic mechanisms of humans. Understanding the features of DNA-binding peptides might develop our comprehension of protein roles inside cellular genetic processes. Investigation on predicting the function of DNA-binding proteins can advance the study of drug proteins and facilitate the development of computer-assisted medications. Deep learning methods have become the major approach for protein prediction in recent years. While current approaches can yield impressive expect performance, further research is necessary to enhance this performance. This work proposed the prediction of DNA-binding proteins using two-dimensional Convolutional Neural Network (CNN) named 2DCNN-DBP. The prominent characteristics are obtained through innovative techniques, specifically position specific scoring matrix-dipeptide composition dipeptide composition (PSSM-DPC), Second, we employed Average Block novel approach to representing proteins using position-specific scoring matrices (AB-PSSM) in images. The DPC-PSSM feature extraction approach achieved a prediction accuracy of 0.9309% for the validation set, which is notably superior to the AB-PSSM. Based on the analysis, DPC-PSSM shown superior performance compared to the other two feature selection approaches in classification using 2DCNN. Specifically, AB-PSSM attained a higher accuracy level of 73.50% using independent test datasets and a training dataset accuracy score of 87.52%. The results demonstrate the superior performance of our innovative predictor compared to previous studies. Utilizing PSSM-DPC could lead to the development of more effective therapeutic approaches for the treatment of life-threatening diseases. © 2024, The Authors. All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Access Control with Privacy-Preserving Data Retrieval for Cloud-Assisted IoV

引用

IEEE Transactions on Vehicular technology 2025年

作者： Li, Wenchao Xia, Chunhe Yang, Simiao Wang, Kangming Huang, Guotao Huang, Luqi Guo, Fuchun Susilo, Willy Wang, Tianbo Beihang University School of Cyber Science and Technology Beijing100191 China University of Wollongong School of Computing and Information Technology Institute of Cybersecurity and Cryptology WollongongNSW2522 Australia Beihang University Beijing Key Laboratory of Network Technology Beijing100191 China Guangxi Normal University Guangxi Collab. Innovation Center of Multi-source Information Integration and Intelligent Processing Guilin541004 China Beihang University Sino-French Engineer School Beijing100191 China Beihang University Computer Science and Engineering School Beijing100191 China

In addition to the autonomous driving technology of single vehicles, the inter-group control algorithm serving the data sharing of multi-vehicle cooperative driving has also attracted widespread attention. To ensure secure communication, many encryption schemes have been proposed to protect the interaction data between vehicles. Nevertheless, traditional public key encryption schemes hinder the sharing of encrypted data. Based on the premise of ensuring the confidentiality of encrypted information, in order to facilitate efficient data sharing, conduct data searches across extensive cloud-based datasets, and authorize access under specified conditions, we introduce Fine-Grained Access Control with Privacy-Preserving Data Retrieval (FGAC-PPDR) for the Internet of Vehicles. This scheme offers a secure, flexible, and privacy-centric approach to data sharing for groups of vehicles in the IoV. Our proposed scheme enables encrypted data to be retrieved at the group level by the cloud server, and prevents vehicles outside the group from performing equality tests on the ciphertext. Furthermore, the data owner can create an authorization token with defined conditions to specify how the data is shared. During the process of data search and sharing, intensive computing tasks are undertaken by cloud servers with abundant computational resources. We also demonstrate that our scheme is secure against chosen ciphertext attacks (CCA). Finally, we provide security and performance analyses that verify the feasibility and effectiveness of our proposal. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Design of a Secure Machine Learning-Based Malware Detection and Analysis Scheme

Design of a Secure Machine Learning-Based Malware Detection ...

引用

Communications, computing, Cybersecurity, and Informatics (CCCI), International Conference on

作者： Pankaj Kumar Mohammad S. Obaidat Piyush Pandey Mohammad Wazid Ashok Kumar Das Devesh Pratap Singh Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun India King Abdullah II School of Information Technology The University of Jordan Amman Jordan School of Computing SRM University Jordan University of Science and Technology Beijing Beijing China School of Computing SRM University Kattankulathur TN India Center for Security Theory Algorithmic Research International Institute of Information Technology Hyderabad India

Today's world is rapidly growing towards the advanced concept of technology. technology nowadays is at its peak of development and has great advantages in all fields of work, whether it is in industrial automation, farming, weather forecasting, or disease detection and control. Despite its great advantages, it does have its negative side because a major population is using technology and general-purpose computing devices (i.e., desktops, laptops, smartphones, tablets, etc.). Therefore, most of their personal data is available online. The data is constantly in danger of getting stolen by malicious actors (i.e., hackers), who can find a way to get their hands on this data and then use it for their personal gain (i.e., money-making). The best-known technique to get this information is by using malware exploitation on the machine of the target. Malware is an executable or a binary that is malicious in nature. It may have various devastating effects, and in order to detect and make the system defensive, we need to propose a scheme to detect the malware in the system, analyze the particular file, and then mitigate it. In this paper, we propose a secure machine learning-based malware detection and analysis scheme (in short, SML-MDA). The conducted security analysis and formal security verification of the proposed SMLMDA prove its security against various types of potential attacks. The proposed SML-MDA is then compared with the other similar competing schemes, and its performance has been found to be better in terms of various performance metrics like accuracy and F1-score.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based Private Set Intersection Protocol with Attribute-based Access Control

Blockchain-based Private Set Intersection Protocol with Attr...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Song Wei Limin Ma Zeyu He Wei Zhang Computer School Beijing Information Science and Technology University Beijing China Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Beijing China Beijing Laboratory of National Economic Security Early-Warning Engineering Beijing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

With the rise of cloud computing, many users outsource their data to be stored in cloud servers, enjoying the convenience while facing many security issues. In the field of secure multiparty computing, traditional privacy set intersection protocol data users use cloud servers for their data outsourcing to operate for calculating the intersection, the data is susceptible to tampering by the cloud servers, and the data users do not formulate fine-grained access control policies. To solve the above problems, this paper combines blockchain with privacy set intersection for the first time, and proposes a blockchain-based privacy set intersection protocol with attribute access control. This scheme utilizes blockchain instead of a cloud server as a trusted third party, data users utilize smart contracts to compute intersection via OPRF, and attribute encryption is used to provide access control for privacy set intersection protocol. Thus, it solves the risk of data vulnerability to tampering. This paper analyzes the security of the scheme and conducts simulation experiments.

关键词： Access control Cloud computing Data privacy Privacy Protocols Smart contracts Blockchains

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant quantum memory using low-depth random circuit codes

引用

Physical Review Research 2025年第1期7卷 013040-013040页

作者： Jon Nelson Gregory Bentsen Steven T. Flammia Michael J. Gullans Joint Center for Quantum Information and Computer Science NIST/University of Maryland College Park Maryland 20742 USA Martin A. Fisher School of Physics Brandeis University Waltham Massachusetts 02465 USA AWS Center for Quantum Computing Pasadena California 91125 USA IQIM California Institute of Technology Pasadena California 91125 USA

Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless. In this work, we design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes even when all gates and measurements are subject to noise. This is sufficient for fault-tolerant quantum memory since these encoded states can then be used as ancillas for Steane error correction. We show through numerical simulations that our protocol can correct erasure errors up to an error rate of 2%. In addition, we also extend results in the code capacity setting by developing a maximum likelihood marginal decoder for depolarizing noise similar to work by Darmawan et al. [Phys. Rev. Res. 6, 023055 (2024)]. As in their work, we formulate the decoding problem as a tensor network contraction and show how to contract the network efficiently by exploiting the low-depth structure. Replacing the tensor network with a so-called “tropical” tensor network, we also show how to perform minimum weight decoding. With these decoders, we are able to numerically estimate the depolarizing error threshold of finite-rate random circuit codes and show that this threshold closely matches the hashing bound even when the decoding is suboptimal.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction

arXiv

引用

arXiv 2022年

作者： Wang, Zixiao Guo, Yuluo Zhao, Jin Zhang, Yu Yu, Hui Liao, Xiaofei Wang, Biao Yu, Ting 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 Huazhong University of Science and Technology Wuhan China Zhejiang Lab Hangzhou China

In this paper, we propose a Graph Inception Diffusion Networks(GIDN) model. This model generalizes graph diffusion in different feature spaces, and uses the inception module to avoid the large amount of computations caused by complex network structures. We evaluate GIDN model on Open Graph Benchmark(OGB) datasets, reached an 11% higher performance than AGDN on ogbl-collab dataset. Copyright © 2022, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

EdgeDis: Enabling Fast, Economical, and Reliable Data Dissemination for Mobile Edge computing

arXiv

引用

arXiv 2023年

作者： Li, Bo He, Qiang Chen, Feifei Lyu, Lingjuan Bouguettaya, Athman Yang, Yun The College of Arts Business Law Education and Information Technology Victoria University MelbourneVIC3122 Australia The 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 Huazhong University of Science and Technology Wuhan430074 China The Department of Computing Technologies Swinburne University of Technology MelbourneVIC3122 Australia The School of Information Technology Deakin University Geelong Australia SONY AI Inc. Tokyo108-0075 Japan The School of Computer Science University of Sydney CamperdownNSW2006 Australia

Mobile edge computing (MEC) enables web data caching in close geographic proximity to end users. Popular data can be cached on edge servers located less than hundreds of meters away from end users. This ensures bounded latency guarantees for various latency-sensitive web applications. However, transmitting a large volume of data out of the cloud onto many geographically-distributed web servers individually can be expensive. In addition, web content dissemination may be interrupted by various intentional and accidental events in the volatile MEC environment, which undermines dissemination efficiency and subsequently incurs extra transmission costs. To tackle the above challenges, we present a novel scheme named EdgeDis that coordinates data dissemination by distributed consensus among those servers. We analyze EdgeDis’s validity theoretically and evaluate its performance experimentally. Results demonstrate that compared with baseline and state-of-the-art schemes, EdgeDis: 1) is 5.97x - 7.52x faster;2) reduces dissemination costs by 48.21% to 91.87%;and 3) reduces performance loss caused by dissemination failures by up to 97.30% in time and 96.35% in costs. © 2023, CC BY-NC-SA.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

CDIMC-net: Cognitive Deep Incomplete Multi-view Clustering Network

arXiv

引用

arXiv 2024年

作者： Wen, Jie Zhang, Zheng Xu, Yong Zhang, Bob Fei, Lunke Xie, Guo-Sen Bio-Computing Research Center Harbin Institute of Technology Shenzhen Shenzhen China Shenzhen Key Laboratory of Visual Object Detection and Recognition Shenzhen China Pengcheng Laboratory Shenzhen China Department of Computer and Information Science University of Macau Taipa China School of Computer Science and Technology Guangdong University of Technology Guangzhou China Inception Institute of Artificial Intelligence Abu Dhabi United Arab Emirates

In recent years, incomplete multi-view clustering, which studies the challenging multi-view clustering problem on missing views, has received growing research interests. Although a series of methods have been proposed to address this issue, the following problems still exist: 1) Almost all of the existing methods are based on shallow models, which is difficult to obtain discriminative common representations. 2) These methods are generally sensitive to noise or outliers since the negative samples are treated equally as the important samples. In this paper, we propose a novel incomplete multi-view clustering network, called Cognitive Deep Incomplete Multi-view Clustering Network (CDIMC-net), to address these issues. Specifically, it captures the high-level features and local structure of each view by incorporating the view-specific deep encoders and graph embedding strategy into a framework. Moreover, based on the human cognition, i.e., learning from easy to hard, it introduces a self-paced strategy to select the most confident samples for model training, which can reduce the negative influence of outliers. Experimental results on several incomplete datasets show that CDIMC-net outperforms the state-of-the-art incomplete multi-view clustering methods. © 2024, CC BY.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：