Existing low-rank adaptation (LoRA) methods face challenges on sparse large language models (LLMs) due to the inability to maintain sparsity. Recent works introduced methods that maintain sparsity by augmenting LoRA t...
详细信息
Movable antennas (MAs) enhance flexibility in beamforming gain and interference suppression by adjusting position within certain areas of the transceivers. In this paper, we propose an MA-assisted integrated sensing a...
详细信息
Movable antennas (MAs) enhance flexibility in beamforming gain and interference suppression by adjusting position within certain areas of the transceivers. In this paper, we propose an MA-assisted integrated sensing a...
详细信息
作者:
王珊杜小勇孟小峰陈红School of Information
Renmin University of China MOE Key Lab of Data Engineering and Knowledge Engineering Beijing 100872 P.R. China
database system is the infrastructure of the modern information system. The R&D in the database system and its technologies is one of the important research topics in the field. The database R&D in China took off la...
详细信息
database system is the infrastructure of the modern information system. The R&D in the database system and its technologies is one of the important research topics in the field. The database R&D in China took off later but it moves along by giant steps. This report presents the achievements Renmin University of China (RUC) has made in the past 25 years and at the same time addresses some of the research projects we, RUC, are currently working on. The National Natural Science Foundation of China supports and initiates most of our research projects and these successfully conducted projects have produced fruitful results.
Dear editor,Frequent itemset mining (FIM) is important in many data mining applications [1], such as web log mining and trend analysis. However, if the data are sensitive (e.g., web browsing history), directly releasi...
详细信息
Dear editor,Frequent itemset mining (FIM) is important in many data mining applications [1], such as web log mining and trend analysis. However, if the data are sensitive (e.g., web browsing history), directly releasing frequent itemsets and their support may breach user privacy. The protection of user privacy while obtaining statistical information is im-
Given that millions of images are uploaded to the social web in a single day, how to effectively retrieve such increasing amounts of unstructured data becomes crucial. While current social platforms find images on the...
详细信息
keyword search is a proven, user-friendly way to query html documents in the World Wide Web. With the trend of integrating IR technologies into DB community, state-of-the-art studies have introduced keyword search int...
详细信息
How to effectively summarize a large-scale image collection is still an important and open problem. In this paper, we propose a novel method to effectively generate a summary of the social image collection using image...
详细信息
We report our experiment results on the INEX 2011 data-Centric Track. We participated in both the ad hoc and faceted search tasks. On the ad hoc search task, we employ language modeling approaches to do structured obj...
详细信息
This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains t...
详细信息
This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalab.lity.
暂无评论