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

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

来源：评论

学校读者我要写书评

暂无评论

Quality-Oriented Task Assignment for Heterogeneous Users in Mobile Crowdsensing 26

Quality-Oriented Task Assignment for Heterogeneous Users in ...

引用

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

作者： Chen, Kang 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

Mobile crowdsensing (MCS) is a potential technology for large-scale data collection. This technology requires the platform to recruit users to complete tasks in specific areas. A vital issue in MCS is task assignment, and most existing task assignment efforts consider only a single user type, which is not reasonable in real scenarios. Task assignment becomes more complicated when the platform tries to assign tasks to heterogeneous users with a limited budget in the platform. In this paper, we consider a quality-oriented task assignment for heterogeneous users problem. Professional users have a high sensing quality with a high cost, and normal users have a low sensing quality with a low cost First, we model the sensing capabilities and the costs of different users and formulate the quality-oriented task assignment for heterogeneous users problem. Then, we design the integer linear programming form and prove that the problem is NP-hard. By verifying the submodularity of the objective function, we present a greedy algorithm. Considering the inefficiency of the algorithm, we design two genetic algorithms to improve the total sensing quality. Finally, we evaluate the proposed algorithms under different cost cases based on a real dataset The results show that our proposed algorithm performs well under different cost distribution scenarios. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Handling polysemous triggers and arguments in event extraction:an adaptive semantics learning strategy with reward-penalty mechanism

引用

Frontiers of Information technology & Electronic Engineering 2025年第4期26卷 534-555页

作者： Haili LI Zhiliang TIAN Xiaodong WANG Yunyan ZHOU Shilong PAN Jie ZHOU Qiubo XU Dongsheng LI National Key Laboratory of Parallel and Distributed Computing National University of Defense TechnologyChangsha 410073China College of Computer Science and Technology National University of Defense TechnologyChangsha 410073China Unit 63891 of PLA Luoyang 471003China Unit 63893 of PLA Luoyang 471003China State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System Luoyang 471003China

Event extraction(EE)is a complex natural language processing(NLP)task that aims at identifying and classifying triggers and arguments in raw *** polysemy of triggers and arguments stands out as one of the key challenges affecting the precise extraction of *** approaches commonly consider the semantic distribution of triggers and arguments to be ***,the sample quantities of different semantics in the same trigger or argument vary in real-world scenarios,leading to a biased semantic *** bias introduces two challenges:(1)low-frequency semantics is difficult to identify;(2)high-frequency semantics is often mistakenly *** tackle these challenges,we propose an adaptive learning method with the reward-penalty mechanism for balancing the semantic distribution in polysemous triggers and *** reward-penalty mechanism balances the semantic distribution by enlarging the gap between the target and nontarget semantics by rewarding correct classifications and penalizing incorrect ***,we propose a sentencelevel event situation awareness(SA)mechanism to guide the encoder to accurately learn the knowledge of events mentioned in the sentence,thereby enhancing target event semantics in the distribution of polysemous triggers and ***,for various semantics in different tasks,we propose task-specific semantic decoders to precisely identify the boundaries of the predicted triggers and arguments for the *** experimental results on ACE2005 and its variants,along with the rich Entities,Relations,and Events(ERE),demonstrate the superiority of our approach over single-task and multi-task EE baselines.

关键词： Event extraction Polysemous triggers Polysemous arguments Semantic imbalance Reward-penalty mechanism

来源：评论

学校读者我要写书评

暂无评论

Two-stage Vehicle Pair Dispatch in Multi-hop Ridesharing 26

Two-stage Vehicle Pair Dispatch in Multi-hop Ridesharing

引用

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

作者： Wei, Xiaobo Li, Peng Huang, Weiyi Liu, Zhiyuan 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

Ridesharing benefits the economy and the environment. In multi-hop ridesharing, passengers are permitted to switch vehicles within a single trip, extending the flexibility of conventional ridesharing. Nonetheless, vehicle dispatch is a difficult issue in multi-hop ridesharing. We subdivide the vehicle dispatching problem into the vehicle pairing problem and the request selection problem within a vehicle pair. To address these subproblems, we propose a two-stage framework for vehicle pair dispatching. In the initial stage, we model the vehicle pairing problem as a maximum vehicle-vehicle matching problem in a general graph, which differs from the conventional vehicle-request matching problem in a bipartite graph. The vehicle pairing algorithm is proposed to efficiently solve the vehicle pairing problem. In the second stage, we model the request selection problem as a multidimensional knapsack problem (d-KP) and propose an LP-relaxation request selection algorithm with an approximation ratio 1/5. Experiments conducted on a real-world dataset demonstrate the economic benefit of our proposed two-stage framework. © 2023 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Cooperative Caching Strategy Based on Two-Layer Caching Model for Remote Sensing Satellite Networks

引用

computers, Materials & Continua 2023年第5期75卷 3903-3922页

作者： Rui Xu Xiaoqiang Di Hao Luo Hui Qi Xiongwen He Wenping Lei School of Computer Science and Technology Changchun University of Science and TechnologyChangchun130022China School of Information Engineering Henan Institute of Science and TechnologyXinxiang453003China Jilin Province Key Laboratory of Network and Information Security Changchun University of Science and TechnologyChangchun130022China Information Center Changchun University of Science and TechnologyChangchun130022China Beijing Institute of Spacecraft System Engineering Beijing100094China Beijing Institute of Space Mechanic and Electricity Beijing100094China

In Information Centric Networking(ICN)where content is the object of exchange,in-network caching is a unique functional feature with the ability to handle data storage and distribution in remote sensing satellite *** up cache space at any node enables users to access data nearby,thus relieving the processing pressure on the ***,the existing caching strategies still suffer from the lack of global planning of cache contents and low utilization of cache resources due to the lack of fine-grained division of cache *** address the issues mentioned,a cooperative caching strategy(CSTL)for remote sensing satellite networks based on a two-layer caching model is *** two-layer caching model is constructed by setting up separate cache spaces in the satellite network and the ground *** caching of popular contents in the region at the ground station to reduce the access delay of users.A content classification method based on hierarchical division is proposed in the satellite network,and differential probabilistic caching is employed for different levels of *** cached content is also dynamically adjusted by analyzing the subsequent changes in the popularity of the cached *** the two-layer caching model,ground stations and satellite networks collaboratively cache to achieve global planning of cache contents,rationalize the utilization of cache resources,and reduce the propagation delay of remote sensing *** results show that the CSTL strategy not only has a high cache hit ratio compared with other caching strategies but also effectively reduces user request delay and server load,which satisfies the timeliness requirement of remote sensing data transmission.

关键词： Information centric networking caching strategy two-layer caching model hierarchical division

来源：评论

学校读者我要写书评

暂无评论

Video2Reward: Generating Reward Function from Videos for Legged Robot Behavior Learning 27

Video2Reward: Generating Reward Function from Videos for Leg...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Zeng, Runhao Zhou, Dingjie Liang, Qiwei Liu, Junlin Li, Hui Huang, Changxin Li, Jianqiang Hu, Xiping Sun, Fuchun Artificial Intelligence Research Institute Shenzhen MSU-BIT University China College of Mechatronics and Control Engineering Shenzhen University China College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science and Technology Tsinghua University China

ISBN: (纸本)9781643685489

Learning behavior in legged robots presents a significant challenge due to its inherent instability and complex constraints. Recent research has proposed the use of a large language model (LLM) to generate reward functions in reinforcement learning, thereby replacing the need for manually designed rewards by experts. However, this approach, which relies on textual descriptions to define learning objectives, fails to achieve controllable and precise behavior learning with clear directionality. In this paper, we introduce a new video2reward method, which directly generates reward functions from videos depicting the behaviors to be mimicked and learned. Specifically, we first process videos containing the target behaviors, converting the motion information of individuals in the videos into keypoint trajectories represented as coordinates through a video2text transforming module. These trajectories are then fed into an LLM to generate the reward function, which in turn is used to train the policy. To enhance the quality of the reward function, we develop a video-assisted iterative reward refinement scheme that visually assesses the learned behaviors and provides textual feedback to the LLM. This feedback guides the LLM to continually refine the reward function, ultimately facilitating more efficient behavior learning. Experimental results on tasks involving bipedal and quadrupedal robot motion control demonstrate that our method surpasses the performance of state-of-the-art LLM-based reward generation methods by over 37.6% in terms of human normalized score. More importantly, by switching video inputs, we find our method can rapidly learn diverse motion behaviors such as walking and running. © 2024 The Authors.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Dtm: Density embeded transformer mamba hybird network for point cloud analysis

引用

The Visual computer 2025年 1-16页

作者： Chen, Yaojie Deng, Chengyu School of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China

Advancements in deep learning have significantly propelled point cloud analysis, particularly in point cloud classification. However, traditional methods often struggle with unstructured and sparse 3D point cloud data, posing challenges for effective feature extraction. Transformer-based models, leveraging self-attention, excel in capturing complex spatial information but suffer from quadratic computational complexity. On the other hand, Mamba modules offer linear complexity but primarily focus on global spatial structures, neglecting local interactions. To address these limitations, we introduce DTM, a hybrid model integrating Transformer and Mamba modules, enriched with density information. DTM facilitates the seamless integration of local and global features through a progressive feature learning process, incorporating local norm pooling, self-attention, and state space modeling (SSM). The incorporation of density information enhances the model’s capability to capture spatial structures, enabling more accurate feature extraction by differentiating regions. Extensive experiments demonstrate that DTM outperforms existing Transformer- and Mamba-based models across various benchmarks. Moreover, DTM maintains near-linear complexity, making it suitable for large-scale applications. The source code will be available at https://***/Nero-XD/DTM .

关键词：

来源：评论

学校读者我要写书评

暂无评论

Physically Based Bidirectional Path Tacing Algorithm on the Tianhe-2 Supercomputer 25

Physically Based Bidirectional Path Tacing Algorithm on the ...

引用

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data Science and systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Wu, Yijia Zhang, Congpin Xu, Zhengwei Li, Ligang Chinese Academy of Sciences National Space Science Center Key Laboratory of Electronics and Information Technology for Space System Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences China School of Computer and Information Engineering Henan Normal University Henan Xinxiang China

ISBN: (纸本)9798350330014

Physically based ray tracing is a technique that involves creating a photo-realistic image from a 3D scene description by utilizing the laws of physics to simulate the behavior of light and matter. However, due to the random length of light samples and irregular memory access patterns, it can suffer from low scalability and severe load imbalance. As a result, the development of a framework for multi-node parallelism algorithm in physically based ray tracing is a significant challenge. To tackle these issues, this paper introduces a novel algorithm named distributed parallel physically based bidirectional path tacing algorithm (DP-BDPT). Through analyzing the physical essence of bidirectional path tracing algorithm and the light transport equation, we have devised a framework that carefully divides tasks between inter-compute nodes and intra-compute nodes. To support high scalability, we have developed a physically based architecture. Additionally, we have proposed a hybrid scheduling method to achieve load balancing. To further enhance performance, we have analyzed several key factors that affect rendering performance and implemented adaptive optimization techniques. The experiments conducted on the Tianhe-2 Supercomputer involving typical and challenging 3D scenes, namely the Cornell-box, Veach-bidir, and Teapot-full experiments, have illustrated that DP-BDPT demonstrate near-linear speedups as the number of CPU cores scales from 1200 to 9600, thereby demonstrating their efficiency when operating on a ten-thousand-core system. © 2023 IEEE.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

CMD: A Cache-Assisted GPU Memory Deduplication Architecture

引用

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

作者： Zhao, Wei Feng, Dan Tong, Wei Wei, Xueliang Wu, Bing Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of data storage systems and Technology China

Massive off-chip accesses in GPUs are the main performance bottleneck. We find that many writes are duplicate, and the duplication can be inter-dup and intra-dup. While inter-dup means different memory blocks are identical, and intra-dup means all the 4B elements in a line are the same. In this work, we propose a cache-assisted GPU memory deduplication architecture named CMD to reduce the off-chip accesses via utilizing the data duplication in GPU applications. CMD includes three key design contributions which aim to reduce the three kinds of accesses: (1) A novel GPU memory deduplication architecture that removes the intra-dup and inter-dup lines. We design several techniques to manage duplicate blocks, reducing massive off-chip writes. (2) We propose a cache-assisted read scheme to reduce the reads to duplicate data. When an L2 cache miss wants to read the duplicate block, if the reference block has been fetched to L2 and it is clean, we can copy it to the L2 missed block without accessing off-chip DRAM. As for the reads to intra-dup data, CMD uses the on-chip metadata cache to get the data. (3) When a cache line is evicted, the clean sectors in the line are invalidated while the dirty sectors are written back. However, most read-only victims are re-referenced from DRAM more than twice. Therefore, we add a full-associate FIFO to accommodate the read-only (it is also clean) victims to reduce the re-reference counts. Experiments show that CMD can decrease the off-chip accesses by 31.01%, reduce the energy by 32.78% and improve performance by 42.53%. Besides, CMD can improve the performance of memory-intensive workloads by 57.56%. © 2025 IEEE.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：