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

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent systems

作者： Xiaoqiang Wu Qingling Zhu Qiuzhen Lin Weineng Chen Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science and Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9798400704864

Evolutionary reinforcement learning algorithms (ERLs), which combine evolutionary algorithms (EAs) with reinforcement learning (RL), have demonstrated significant success in enhancing RL performance. However, most ERLs rely heavily on Gaussian mutation operators to generate new individuals. When the standard deviation is too large or small, this approach will result in the production of poor or highly similar offspring. Such outcomes can be detrimental to the learning process of the RL agent, as too many poor or similar experiences are generated by these individuals. In order to alleviate these issues, this paper proposes an Adaptive Evolutionary Reinforcement Learning (AERL) method that adaptively adjusts both the standard deviation and the evaluation process. By tracking the performance of new individuals, AERL maintains the mutation strength within a suitable range without the need for additional gradient computations. Moreover, the proposed AERL approach early terminates unnecessary evaluations and discards experiences arising from poor individuals, thereby resulting in enhanced learning efficiency. Empirical assessments conducted on a variety of continuous control problems demonstrate the effectiveness of the AERL method.

关键词： evolutionary algorithm evolutionary reinforcement learning reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

MalScan: Android Malware Detection Based on Social-Network Centrality Analysis

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Wu, Yueming Suo, Wenqi Feng, Siyue Zou, Deqing Yang, Wei Liu, Yang 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 Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Jinyinhu Laboratory Wuhan430074 China University of Texas at Dallas United States Nanyang Technological University Singapore 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

Malware scanning of an app market is expected to be scalable and effective. However, existing approaches use syntax-based features that can be evaded by transformation attacks or semantic-based features which are usually extracted by expensive program analysis. Therefore, to address the scalability challenges of traditional heavyweight static analysis, we propose a graph-based lightweight approach MalScan for Android malware detection. MalScan considers the function call graph as a complex social network and employs centrality analysis on sensitive application program interfaces (APIs) to express the semantic characteristics of the graph. On this basis, machine learning algorithms and ensemble learning algorithms are applied to classify the extracted features. We evaluate MalScan on datasets of 104,892 benign apps and 108,640 malwares, and the results of experiments indicate that MalScan outperforms six state-of-the-art detectors and can quickly detect Android malware with an f-value as high as 99%. In addition, there are also significant improvements in the robustness of Android app evolution and robustness to obfuscation. Finally, we conduct an exhaustive statistical study of over one million applications in the Google-Play app market and successfully identify 498 zero-day malware, which further validates the feasibility of MalScan on market-wide malware scanning. © 2004-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Preserving Location Privacy of IoT Devices in Heterogeneous Edge computing Architecture Through Deniability-Based Authentication

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Ali, Ikram Li, Jianqiang Chen, Jie Chen, Yong Ullah, Shamsher Wakeel, Abdul Shenzhen University National Engineering Laboratory of Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China National University of Sciences and Technology Military College of Signals Department of Electrical Engineering Islamabad Pakistan

Edge computing moves cloud services closer to consumer Internet of Things (IoT) devices, reducing latency and bandwidth usage. This setup enables faster responses but also introduces new security challenges, particularly concerning location privacy when sender and receiver use different security techniques. The authentication process in such architectures can expose the location of IoT devices. To address this issue, researchers have proposed various privacy-preserving schemes. However, these are computationally heavy for IoT devices. To tackle this issue, we propose two novel heterogeneous deniable authentication schemes: HDA-IoT-I and HDA-IoT-II. These schemes use public-key infrastructure and identity-based cryptography to protect the location privacy of IoT devices in heterogeneous edge computing environments. Our schemes enable the designated edge device to verify the source of a message without being able to prove its origin to a third party, thus preserving privacy. Additionally, they incorporate a batch verification method, which speeds up the verification of multiple deniable authenticators. The proposed schemes are formally proven secure in the random oracle model based on the hardness assumption of elliptic curve inverse computational Diffie-Hellman problem. The performance evaluation demonstrate that our schemes significantly enhance computational and communication efficiency, making them suitable for IoT devices. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Transcriptomic analysis of Andrias davidianus meat and experimental validation for exploring its bioactive components as functional foods

引用

Food Science and Human Wellness 2024年第1期13卷 166-172页

作者： Changge Guan Zhenglin Tan Shucheng Li Yi Wang Naoyuki Yamamoto Chong Zhang Songjun Wang Junjie Chen Xinhui Xing Key Laboratory for Industrial Biocatalysis Ministry of Education of ChinaDepartment of Chemical EngineeringTsinghua UniversityBeijing 100084China School of Life Science and Technology Tokyo Institute of TechnologyYokohama 226-0026Japan Sensing System Research Center National Institute of Advanced Industrial Science and TechnologyTsukuba 305-8565Japan Center for Synthetic and Systems Biology Tsinghua UniversityBeijing 100084China Henan Giant Salamander Protection and Development Association Luoyang 471000China Intelligent Computing Research Center Harbin Institute of TechnologyShenzhen 518071China Institute of Biopharmaceutical and Health Engineering Tsinghua Shenzhen International Graduate SchoolShenzhen 518055China Institute of Biomedical Health Technology and Engineering Shenzhen Bay LaboratoryShenzhen 518067China

Andrias davidianus(Chinese giant salamander,CGS)is the largest and oldest extant amphibian species in the world and is a source of prospective functional food in ***,the progress of functional peptides mining was slow due to lack of reference genome and protein sequence *** this study,we illustrated full-length transcriptome sequencing to interpret the proteome of CGS meat and obtain 10703 coding DNA *** functional annotation and amino acid composition analysis,we have discovered various genes related to signal transduction,and 16 genes related to *** have also found vast variety of functional peptides through protein coding sequence(CDS)analysis by comparing the data obtained with the functional peptide ***-Pro-Ile predicted by the CDS analysis was released from the CGS meat through enzymatic hydrolysis,suggesting that our approach is *** study suggested that transcriptomic analysis can be used as a reference to guide polypeptide mining in CGS meat,thereby providing a powerful mining strategy for the bioresources with unknown genomic and proteomic sequences.

关键词： Chinese giant salamander Transcriptomic analysis Bioactive components Functional peptides mining

来源：评论

学校读者我要写书评

暂无评论

Dual Encoders for Diffusion-based Image Inpainting

Dual Encoders for Diffusion-based Image Inpainting

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Dezhi Zheng Kaijun Deng Jinbao Wang Linlin Shen Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Current diffusion-based inpainting models struggle to preserve unmasked regions or generate highly coherent content. Additionally, it is hard for them to generate meaningful content for 3D inpainting. To tackle these challenges, we design a plug-and-play branch that runs through the entire generation process to enhance existing models. Specifically, we utilize dual encoders - a Convolutional Neural Network (CNN) encoder and the pre-trained Variational AutoEncoder (VAE) encoder, to encode masked images. The latent code and the feature map from the dual encoders are fed to diffusion models simultaneously. In addition, we apply Zero-padded initialization to solve the problem of mode collapse caused by this branch. Experiments on BrushBench and EditBench demonstrate that models with our plug-and-play branch can improve the coherence of inpainting, and our model achieves new state-of-the-art results.

关键词： Visualization Three-dimensional displays Codes Autoencoders Coherence Signal processing Diffusion models Decoding Convolutional neural networks Speech processing

来源：评论

学校读者我要写书评

暂无评论

PointFaceFormer: Local and Global Attention Based Transformer for 3D Point Cloud Face Recognition

PointFaceFormer: Local and Global Attention Based Transforme...

引用

International Conference on Automatic Face and Gesture Recognition

作者： Ziqi Gao Qiufu Li Gui Wang Linlin Shen Computer Vision Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science University of Nottingham Ningbo China

ISBN: (数字)9798350394948

ISBN: (纸本)9798350394955

Existing 3D point cloud-based facial recognition struggles to fully leverage both global and local information inherent in the 3D point cloud data. In this paper, we introduce the PointFaceFormer, the first Transformer model designed for 3D point cloud face recognition. It incorporates an attention mechanism based on dot product and cosine functions to construct a similarity Transformer architecture, which effectively extracts both local and global features from the point cloud data. Experimental results demonstrate that PointFaceFormer achieves a recognition accuracy of 89.08% and a verification accuracy of 76.93% on the large-scale facial point cloud dataset Lock3DFace, which is a new state-of-the-art in 3D face recognition. Furthermore, PointFaceFormer exhibits excellent generalization performance on cross-quality datasets. Additionally, we validate the effectiveness of the attention mechanism through ablation experiments, which justify the effectiveness of the proposed modules.

关键词： Point cloud compression Solid modeling Three-dimensional displays Attention mechanisms Accuracy Face recognition Transformers

来源：评论

学校读者我要写书评

暂无评论

Many Objectives Autonomous Robot Path Planning with Improved MOEA/D

Many Objectives Autonomous Robot Path Planning with Improved...

引用

Congress on Evolutionary Computation

作者： Jin Zhou David Chieng Boon Giin Lee Junkai Ji Jianqiang Li Department of Electrical and Electronic Engineering Next-Generation Internet of Everything Laboratory University of Nottingham Ningbo China Ningbo China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Path planning is the core of autonomous robot navigation, which helps the robot to find a collision-free path to the destination based on the environment information. Most current path planning methods only consider the path length, but the optimal path may deviate from the shortest when considering other environmental factors such as uneven terrain or regions with varying traversal costs. Similarly, in scenarios prioritizing energy efficiency, a sole focus on path length may lead to suboptimal solutions. In this paper, an improved Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) with adaptive weight vector, external archive, and constrained update strategy namely the MOEA/D-EAWA is proposed. This algorithm not only considers the path length but also four additional objectives such as smoothness, traveling time, terrain (elevation), and speed limit (expected delay). In addition, MOEA/D-EAWA is better suited for such many-objective path planning problem which has an irregular, discrete, and sparse Pareto front. The simulation results from 90 map instances demonstrate that the proposed method outperforms the existing approaches.

关键词： Costs Navigation Simulation Evolutionary computation Path planning Vectors Environmental factors

来源：评论

学校读者我要写书评

暂无评论

FedRec++: Lossless Federated Recommendation with Explicit Feedback 35

FedRec++: Lossless Federated Recommendation with Explicit Fe...

引用

35th AAAI Conference on Artificial Intelligence, AAAI 2021

作者： Liang, Feng Pan, Weike Ming, Zhong National Engineering Laboratory for Big Data System Computing Technology College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

ISBN: (纸本)9781713835974

With the marriage of federated machine learning and recommender systems for privacy-aware preference modeling and personalization, there comes a new research branch called federated recommender systems aiming to build a recommendation model in a distributed way, i.e., each user is represented as a distributed client where his/her original rating data are not shared with the server or the other clients. Notice that, besides the sensitive information of a specific rating score assigned to a certain item by a user, the information of a user’s rated set of items shall also be well protected. Some very recent works propose to randomly sample some unrated items for each user and then assign some virtual ratings, so that the server can not identify the scores and the set of rated items easily during the server-client interactions. However, the virtual ratings assigned to the randomly sampled items will inevitably introduce some noise to the model training process, which will then cause loss in recommendation performance. In this paper, we propose a novel lossless federated recommendation method (FedRec++) by allocating some denoising clients (i.e., users) to eliminate the noise in a privacy-aware manner. We further analyse our FedRec++ in terms of security and losslessness, and discuss its generality in the context of existing works. Extensive empirical studies clearly show the effectiveness of our FedRec++ in providing accurate and privacy-aware recommendation without much additional communication cost. Copyright © 2021, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Robust and digital hyper-polarization protocol of nuclear spins via magic sequential sequence

arXiv

引用

arXiv 2025年

作者： Li, Haiyang Liao, Hao Wang, Ping Faculty of Arts and Sciences Beijing Normal University Zhuhai519087 China National Engineering Laboratory on Big Data System Computing Technology Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

Hyper-polarization of nuclear spins is crucial for advancing nuclear magnetic resonance (NMR) and quantum information technologies, as nuclear spins typically exhibit extremely low polarization at room temperature due to their small gyro-magnetic ratios. A promising approach to achieving high nuclear spin polarization is transferring the polarization of electron to nuclear spin. The nitrogen-vacancy (NV) center in diamond has emerged as a highly effective medium for this purpose, and various hyper-polarization protocols have been developed. Among these, the pulsed polarization (PulsePol) method has been extensively studied due to its robustness against static energy shifts of the electron spin. In this study, we introduce a sequential polarization protocol and identify a series of magic and digital sequences for hyper-polarizing nuclear spins. Notably, we demonstrate that some of these magic sequences exhibit significantly greater robustness compared to the PulsePol protocol in the presence of finite half π pulse duration of the protocol. This enhanced robustness positions our protocol as a more suitable candidate for hyper-polarizing nuclear spins species with large gyromagnetic ratios and also ensures better compatibility with high-efficiency readout techniques at high magnetic fields. Additionally, the generality of our protocol allows for its direct application to other solid-state quantum systems beyond the NV center. © 2025, CC BY.

关键词： Chemical shift

来源：评论

学校读者我要写书评

暂无评论

Efficient Heuristic Algorithm for Precedence-Constrained Multi-Robot Task Assignment

Efficient Heuristic Algorithm for Precedence-Constrained Mul...

引用

第43届中国控制会议

作者： Xiaoshan Bai Baode Li Fuqiang Liu Li Qiu Guangzhong Cao College of Mechanical and Control Engineering Shenzhen University Guangdong Key Laboratory of Electromagnetic Control and Intelligent Robots Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University College of Mechanical and Vehicle Engineering Chongqing University

ISBN: (数字)9789887581581

ISBN: (纸本)9798350366907

Due to the widespread application of multi-robot systems, the efficient task assignment for a team of robots has become particularly critical for performing complex tasks. This paper studies the task assignment problem for multiple robots to visit a group of target locations with precedence constraints, which determine the order/sequence in which certain target locations need to be visited before others. A marginal-cost-based heuristic algorithm is developed to minimize the time for the robots to visit the last target location. The algorithm first uses a timestamp strategy to update the anticipated visiting time of each assigned target and the corresponding earliest time that each successor target can be visited under the precedence constraints. Then, it utilizes the topological sorting technique and the marginal-cost-based mechanism to insert the feasible target that induces the minimum marginal cost into the robots' current routes. Numerical simulations demonstrate the effectiveness of the proposed algorithm compared with the popular greedy algorithm and the existing simple iterative auction algorithm.

关键词： Multi-robot task assignment Precedence constraints Heuristic algorithm Marginal cost

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：