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

Large Model Collaborative Optimization Enhanced by Mobile Consumer Electronics Constructed Federated ML

IEEE Transactions on Consumer Electronics 2024年

作者： Bu, Chao Li, Jianlong Wang, Jinsong Tianjin University of Technology Key Laboratory of Computer Vision and System of Ministry of Education School of Computer Science and Engineering Tianjin300384 China Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology School of Computer Science and Engineering Tianjin300384 China

With the rapid development of internet of everything, current Mobile Consumer Electronics (MCEs) can support complex computing due to their specialized data-handling capacity. Thus, federated Machine Learning (ML) and edge computing are integrated to leverage such capacity of MCEs to enhance large model training. This paper studies motivations of all participants that take part in large model collaborative optimization from a global perspective, and proposes the positive promotion pattern that collaborates MCEs, Edge Computing Servers (ECSs), and the centralized computing center to support large model collaborative optimization by introducing the idea of computing economic. We firstly propose the novel three-layered framework for large model collaboratively optimizing based on MCEs constructed federated ML. Secondly, we introduce the economic factor into the large model optimization by devising algorithms to assess consumptions of all participants and dynamically adjust incentive benefits according to the qualities of trained models. Finally, we design the scheme to encourage more MCEs to train local models by adaptively adjusting the ECS pricing strategy with the ECS future economic benefit trend considered. Experimental results validate that our proposed approach is able to optimize the global accuracy and improve the economic benefit more efficiently than the state of the art. © 1975-2011 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

NR-Isomap: An Incremental Approach with Gaussian Process Kernels for Denoising 6

NR-Isomap: An Incremental Approach with Gaussian Process Ker...

引用

6th International Conference on Big Data and Artificial Intelligence, BDAI 2023

作者： Yousaf, Mahwish Khan, Muhammad Saaadat Shakoor Ullah, Shamsher Wang, Shou Jing, Li University of Science and Technology of China School of Computer Science and Technology Hefei China Chinese Academy of Sciences Institute of Solid-State Physics Key Laboratory of Materials Physics Hefei China Unit of System and Technology University of Management and Technology Department Knowledge Sialkot Pakistan

ISBN: (纸本)9798350303667

The Isomap is a popular nonlinear dimensionality reduction method often used for low-dimensional embedding space. When the big data is noisy, Isomap often fails because of the graph structure' Short-Circuit Edges (SCE) problem. In this paper, an incremental Noise-Reduction Isomap (NR-Isomap) approach is to address the SCE problem in a graph structure. The GP kernels are combined with the manifold learning approach and provide significant results. NR-Isomap is based on the Hessian Locally Linear Embedding (HLLE) algorithm with Gaussian Process (GP) kernels. The HLLE algorithm provides the optimal solution to the SCE problem caused by an overly noisy dataset. NR-Isomap provides an answer to the Isomap SCE problem in noisy big data problems that cannot be handled using existing methods. Therefore, the GP kernel significantly improves and measures the performance of the NRI-somap accuracy. Our NR-Isomap method outperforms experiments on SK-Learn datasets and shows efficient results compared to Isomap. Our NR Isomap is much more efficient and faster compared to Isomap. The efficiency and accuracy of the NR-Isomap method are demonstrated theoretically and compared with other manifold learning methods. © 2023 IEEE.

关键词： Noise abatement

来源：评论

学校读者我要写书评

暂无评论

Pricing Policy for a Dynamic Spectrum Allocation Scheme with Batch Requests and Impatient Packets in Cognitive Radio Networks

引用

Journal of systems Science and systems Engineering 2022年第2期31卷 133-149页

作者： Haixing Wu Shunfu Jin Wuyi Yue School of Information Science and Engineering Yanshan UniversityQinhuangdao 066004China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan UniversityQinhuangdao 066004China Department of Intelligence and Informatics Konan UniversityKobe 658-8501Japan

In cognitive radio networks(CRNs),multiple secondary users may send out requests simultaneously and one secondary user may send out multiple requests at one time,i.e.,request arrivals usually show an aggregate ***,a secondary user packet waiting in the buffer may leave the system due to impatience before it is transmitted,and this impatient behavior inevitably has an impact on the system *** to investigate the influence of the aggregate behavior of requests and the likelihood of impatience on a dynamic spectrum allocation scheme in CRNs,in this paper a batch arrival queueing model with possible reneging and potential transmission interruption is *** constructing a Markov chain and presenting a transition rate matrix,the steady-state distribution of the queueing model along with a dynamic spectrum allocation scheme is derived to analyze the stochastic behavior of the ***,some important performance measures such as the loss rate,the balk rate and the average delay of secondary user packets are ***,system experiments are carried out to show the change trends of the performance measures with respect to batch arrival rates of secondary user packets for different impatience parameters,different batch sizes of secondary user packets,and different arrival rates of primary user ***,a pricing policy for secondary users is presented and the dynamic spectrum allocation scheme is socially optimized.

关键词： Cognitive radio networks dynamic spectrum scheme batch arrival impatient packets Markov chain social optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic detection technology of encryption algorithm based on Pin 9

Dynamic detection technology of encryption algorithm based o...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Qu, Junpeng Du, Gaolei Sun, Yunge Fu, Yong Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Quan Cheng Laboratory Jinan250103 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798350391367

Aiming at the problem that malicious software uses encryption algorithm to hide its own malicious code and avoid detection, a dynamic detection technology based on Pin encryption algorithm is proposed. Use Pin to get the instruction flow of executable file running, then identify the function call in the instruction flow to get the function call framework, find the loop body in the calling function, and then carry out the encryption algorithm instruction detection and encryption algorithm constant detection on the loop body. If the detection passes, it can be considered that a component of the encryption algorithm is found. Then the complete encryption algorithm is found according to the generated function call framework. Experiments show that this method can effectively identify the encryption algorithms hidden in executable files. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Structure design and analysis of a rigid-soft robotic hand with large load capacity 3

Structure design and analysis of a rigid-soft robotic hand w...

引用

3rd International Conference on Electrical, Electronics, and Information Engineering, EEIE 2024

作者： Wu, Peichen Lan, Fuming Hong, Wen Chen, Xiaoping Shuai, Wei Cui, Guowei Gao, Yang Institute of Intelligent Manufacturing Guangdong Academy of Sciences Guangdong Key Laboratory of Modern Control Technology Guangzhou510070 China Shanghai Institute of Aerospace System Engineering Shanghai201100 China Intelligent Manufacturing Institute of HFUT HeFei230041 China School of Computer Science and Technology University of Science and Technology of China Hefei230026 China

ISBN: (纸本)9781510688179

In recent years, soft grippers have gained significant attention due to their adaptability and safety. However, when performing horizontal object grasping, their limited structural stiffness prevents them from withstanding the torque generated by friction between the gripper and the object, leading to a loss of contact and limiting their horizontal load capacity. To address this limitation while preserving the adaptability of soft grippers, this paper proposes a gripper structure called the rigid-soft robotic hand, which incorporates lateral rigid connecting rods outside the soft joints. The paper analyzes the bending capacity of the rigid-soft joint using kinematic methods and investigates the influence of link design parameters on maximum bending angle. Subsequently, a finite element analysis is conducted to study the finger structure with the added connecting rods, aiming to optimize the link design parameters. Experimental results demonstrate the grasping capabilities of the rigid-soft gripper in both vertical and horizontal orientations. The findings show that the rigid-soft gripper significantly improves the load-carrying capacity during horizontal object grasping while maintaining the adaptability of the soft gripper. © The Authors.

关键词： Robotic arms

来源：评论

学校读者我要写书评

暂无评论

An Encryption Algorithm Cycle Identification Method Based on Bit Execution 9

An Encryption Algorithm Cycle Identification Method Based on...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Sun, Yunge Du, Gaolei Qu, Junpeng Fu, Yong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan250014 China Quan Cheng Laboratory Jinan250103 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798350391367

Ransomware uses symmetric encryption algorithms to lock user files to extort money. This paper proposes a cryptographic algorithm loop identification method based on bit-precise execution, aiming to solve the problem of identifying unknown loops. The structure of the loop body of encryption algorithms is fixed and usually includes nonlinear operations and linear operations. This article converts the loop body in the unknown software into a set of Boolean formulas, and converts the malware into a register data flow through the symbolic executor, thereby converting it into a set of Boolean formulas for execution. Execute known encryption algorithms with bit accuracy and establish a Boolean formula input-output relationship library for cryptographic components. The two sets of Boolean formulas are passed through a designed input matrix to achieve the Boolean formula mapping and input variable mapping of the confirmation algorithm, which can effectively judge the encryption algorithms in some malware. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

AISLE: Self-supervised Representation Learning for the Investigation of Advanced Persistent Threat 7

AISLE: Self-supervised Representation Learning for the Inves...

引用

7th IEEE International Conference on Data Science in Cyberspace, DSC 2022

作者： Jia, Zian Wang, Xiaosu Xiong, Yun Zhang, Yao Zhao, JinJing Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China National Key Laboratory of Science and Technology on Information System Security China

ISBN: (数字)9781665474801

ISBN: (纸本)9781665474801

Advanced Persistent Threats (APT) are difficult to detect and defend due to their high variability and concealment. Current APT detection and investigation approaches suffer from two major problems. First, most recent models heavily rely on heuristic rules derived from a large amount of expensive prior knowledge, which in turn prevents the models from generalizing to new types of APT attacks. Second, the development of existing fully supervised models is limited by the scarcity of APT attack data. In this paper, we first construct the provenance graph by introducing logical entities to reduce the dependency on prior knowledge. Then we propose a novel self-supervised representation-learning based model, AISLE, for the investigation of the APT attack, which consists of a graph structure encoder (GSE) and an entity interaction pattern encoder (IPE). The GSE employs a graph attention auto-encoder to effectively compress the structural information of the graph;and the IPE employs a LSTM auto-encoder to extract the interaction patterns of entities from their interaction history. The two entity embeddings calculated respectively by the two auto-encoders are concatenated to form the final representation of the entity, which is evaluated by the attack investigation module to identify attack entities. Our model is evaluated on ten real-world APT attacks in a realistic virtual environment. The results show that our model can achieve superior generalization ability and consistently outperform the latest state-of-the-art APT attack investigation approaches. © 2022 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Detecting and Corrupting Convolution-based Unlearnable Examples 39

Detecting and Corrupting Convolution-based Unlearnable Examp...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Li, Minghui Wang, Xianlong Yu, Zhifei Hu, Shengshan Zhou, Ziqi Zhang, Longling Zhang, Leo Yu School of Software Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

ISBN: (纸本)157735897X

Convolution-based unlearnable examples (UEs) employ class-wise multiplicative convolutional noise to training samples, severely compromising model performance. This fire-new type of UEs have successfully countered all defense mechanisms against UEs. The failure of such defenses can be attributed to the absence of norm constraints on convolutional noise, leading to severe blurring of image features. To address this, we first design an Edge Pixel-based Detector (EPD) to identify convolution-based UEs. Upon detection of them, we propose the first defense scheme against convolution-based UEs, COrrupting these samples via random matrix multiplication by employing bilinear INterpolation (COIN) such that disrupting the distribution of class-wise multiplicative noise. To evaluate the generalization of our proposed COIN, we newly design two convolution-based UEs called VUDA and HUDA to expand the scope of convolution-based UEs. Extensive experiments demonstrate the effectiveness of detection scheme EPD and that our defense COIN outperforms 11 state-of-the-art (SOTA) defenses, achieving a significant improvement on the CIFAR and ImageNet datasets. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On Privacy-Preserving Task Assignment for Heterogeneous Users in Mobile Crowdsensing 26

On Privacy-Preserving Task Assignment for Heterogeneous User...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Ji Li, Peng Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Task assignment is a key challenge in mobile crowd-sensing because of the varying capabilities of crowd users. Location-based task assignment schemes require users to upload their location to an untrusted platform, which raises many privacy concerns. However, stronger privacy preservation may lead to lower system utility. It is challenging to maximize system utility under privacy preservation for users. In this paper, we propose a privacy-preserving task assignment for heterogeneous users (PTAH) problem in mobile crowdsensing. Specifically, we divide users into two groups: private users with location privacy requirements and public users without location privacy requirements. We first design a privacy-preserving mechanism to obfuscate the actual location of private users. Then we construct a relationship graph based on the locations between users and tasks. We prove that the PTAH problem is an NP-hard problem, so to maximize the system utility, we propose an approximation algorithm based on the greedy algorithm. Then we propose a multi-thread cooperative simulated annealing algorithm to search for a better approximate solution. Finally, we conducted simulations based on the widely-used real-world Roma dataset. The results show that our proposed algorithm consistently outperforms other baseline algorithms. © 2023 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

An automated construction method for symmetric encryption round function models based on dynamic analysis 9

An automated construction method for symmetric encryption ro...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Du, Gaolei Sun, Yunge Qu, Junpeng Fu, Yong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan250014 China Quan Cheng Laboratory Jinan250103 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798350391367

With the deepening of informatization, the incidence of cybercrimes utilizing malicious software for attacks is on the rise. This paper addresses the detection issue of symmetric encryption in malicious software from the perspective of cryptography, proposing an automated method for constructing a symmetric encryption round function model based on dynamic analysis. This method tracks data flow at the granularity of registers to characterize Directed Acyclic Graph (DAG) construction of round function models. Initially, dynamic execution traces of binary files are captured using Intel Pin, identifying loops within them. Data flow tracking at the register level within loops is performed, creating DAG, and analyzing whether the loops exhibit characteristics of symmetric cipher round functions, thus constructing the round function model. This approach enables the detection of symmetric encryption within binary files and the construction of round function models, offering a novel solution for fine-grained symmetric cipher recognition and laying a foundation for detecting malicious software containing symmetric encryption. © 2024 IEEE.

关键词： Data flow graphs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：