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

Quality aware privacy protection for location-based services

12th International Conference on database Systems for Advanced Applications, DASFAA 2007

作者： Zhen, Xiao Xiaofeng, Meng Jianliang, Xu School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MOE Department of Computer Science Hong Kong Baptist University

ISBN: (纸本)9783540717027

Protection of users' privacy has been a central issue for location-based services (LBSs). In this paper, we classify two kinds of privacy protection requirements in LBS: location anonymity and identifier anonymity. While the location cloaking technique under the k-anonymity model can provide a good protection of users' privacy, it reduces the resolution of location information and, hence, may degrade the quality of service (QoS). To strike a balance between the location privacy and QoS, we present a quality-aware anonymity model for protecting location privacy while meeting user specified QoS requirements. In the model, a mobile user can specify the minimum anonymity level requirement upon location privacy as well as the maximum cloaking latency and the maximum cloaking region size requirements upon QoS. In accordance with the model, we develop an efficient directed-graph based cloaking algorithm to achieve both high-quality location anonymity and identifier anonymity. The performance objective is to maximize the cloaking success rate under the privacy and QoS constraints. Furthermore, we introduce an option of using dummy locations to achieve a 100% cloaking success rate at the cost of communication overhead. Experimental results show the effectiveness of our cloaking algorithm under various privacy and QoS requirements. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Tracking (position)

来源：评论

学校读者我要写书评

暂无评论

MacroTrend: A Write-Efficient Cache Algorithm for NVM-Based Read Cache

引用

Journal of Computer Science & Technology 2022年第1期37卷 207-230页

作者： Ning Bao Yun-Peng Chai Xiao Qin Chuan-Wen Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of EducationBeijing 100872China School of Information Renmin University of ChinaBeijing 100872China Samuel Ginn College of Engineering Auburn UniversityAlabama 36830U.S.A.

The future storage systems are expected to contain a wide variety of storage media and layers due to the rapid development of NVM(non-volatile memory)*** NVM-based read caches,many kinds of NVM devices cannot stand frequent data updates due to limited write endurance or high energy consumption of ***,traditional cache algorithms have to update cached blocks frequently because it is difficult for them to predict long-term popularity according to such limited information about data blocks,such as only a single value or a queue that reflects frequency or *** this paper,we propose a new MacroTrend(macroscopic trend)prediction method to discover long-term hot blocks through blocks'macro trends illustrated by their access count *** then a new cache replacement algorithm is designed based on the MacroTrend prediction to greatly reduce the write amount while improving the hit *** conduct extensive experiments driven by a series of real-world traces and find that compared with LRU,MacroTrend can reduce the write amounts of NVM cache devices significantly with similar hit ratios,leading to longer NVM lifetime or less energy consumption.

关键词： non-volatile memory(NVM) solid state disk(SSD) cache endurance

来源：评论

学校读者我要写书评

暂无评论

ASAWA: An automatic partition key selection strategy

ASAWA: An automatic partition key selection strategy

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Wang, Xiaoyan Chen, Jinchuan Du, Xiaoyong School of Information Renmin University of China China School of Information and Electrical Engineering Ludong University China Key Laboratory of Data Engineering and Knowledge Engineering MOE China

ISBN: (纸本)9783642374005

With the rapid increase of data volume, more and more applications have to be implemented in a distributed environment. In order to obtain high performance, we need to carefully divide the whole dataset into multiple partitions and put them into distributed data nodes. During this process, the selection of partition key would greatly affect the overall performance. Nevertheless, there are few works addressing this topic. Most previous projects on data partitioning either utilize a simple strategy, or rely on a commercial database system, to choose partition keys. In this work, we present an automatic partition key selection strategy called ASAWA. It chooses partition keys according to the analysis on both dataset and workload schemas. In this way, intimate tuples, i.e. co-appearing in queries frequently, would be probably put into the same partition. Hence the cross-node joins could be greatly reduced and the system performance could be improved. We conduct a series of experiments over the TPC-H datasets to illustrate the effectiveness of the ASAWA strategy. © 2013 Springer-Verlag.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

ViGT: proposal-free video grounding with a learnable token in the transformer

引用

Science China(Information Sciences) 2023年第10期66卷 196-212页

作者： Kun LI Dan GUO Meng WANG School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Institute of Artificial Intelligence Hefei Comprehensive National Science Center

The video grounding(VG) task aims to locate the queried action or event in an untrimmed video based on rich linguistic descriptions. Existing proposal-free methods are trapped in the complex interaction between video and query, overemphasizing cross-modal feature fusion and feature correlation for VG. In this paper, we propose a novel boundary regression paradigm that performs regression token learning in a transformer. Particularly, we present a simple but effective proposal-free framework, namely video grounding transformer(ViGT), which predicts the temporal boundary using a learnable regression token rather than multi-modal or cross-modal features. In ViGT, the benefits of a learnable token are manifested as follows.(1) The token is unrelated to the video or the query and avoids data bias toward the original video and query.(2) The token simultaneously performs global context aggregation from video and query ***, we employed a sharing feature encoder to project both video and query into a joint feature space before performing cross-modal co-attention(i.e., video-to-query attention and query-to-video attention) to highlight discriminative features in each modality. Furthermore, we concatenated a learnable regression token [REG] with the video and query features as the input of a vision-language transformer. Finally, we utilized the token [REG] to predict the target moment and visual features to constrain the foreground and background probabilities at each timestamp. The proposed ViGT performed well on three public datasets:ANet-Captions, TACoS, and YouCookⅡ. Extensive ablation studies and qualitative analysis further validated the interpretability of ViGT.

关键词： video grounding temporal sentence grounding boundary regression token learning proposal-free

来源：评论

学校读者我要写书评

暂无评论

Listening to the user's voice: A temporal analysis of autism-related questions on Quora

引用

Proceedings of the Association for Information Science and Technology 2019年第1期56卷 513-516页

作者： Zhao, Yuehua Min, Chao Han, Xu Deng, Sanhong Wang, Hao Li, Jiang Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China Nanjing University Nanjing China

Social question and answer (Q&A) platforms offer a new way for identifying information needs of people with certain diseases. Taking Quora as an example, we examine which health topics are of interest to autistic people and how these topics evolve over time. Experimental results reveal increasingly heavy and diverse attention to the condition, from diagnosis and treatment of autism itself to extended issues like social challenges, parenting, and education issues. We find that users tend to post clinical concerns about autism on Quora although traditionally such social Q&A platforms encourage more social and awareness-level questions. New concerns have appeared recently about autism's relations to other diseases like attention deficit hyperactivity disorder (ADHD) and obsessive–compulsive disorder (OCD). This study is beneficial for tracking and responding to autistic patients' and caregivers' information needs. Author(s) retain copyright, but ASIS&T receives an exclusive publication license

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

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 scalability.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Method for the Efficient Similarity Calculation

An Adaptive Method for the Efficient Similarity Calculation

引用

14th International Conference on database Systems for Advanced Applications

作者： Cai, Yuanzhe Liu, Hongyan He, Jun Du, Xiaoyong Jia, Xu Key Labs of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783642008863

SimRank is a well-known algorithm for similarity calculation based on object-to-object relationship. However, it suffers from high computation cost. Inthis paper, we find that the convergence behavior of different object pairs is different when we use SimRank to compute the similarity of objects. Many similarity scores converge fast, while others need more time before convergence. Based on this observation, we propose an adaptive method called Adaptive-SimRank to speed up similarity calculation. Using this method, we don't need to recalculate those converged pairs' similarity. The experiments conducted on web datasets and synthetic dataset show that our new method can reduce the running time by nearly 35%.

关键词： Similarity Calculation Linkage Mining

来源：评论

学校读者我要写书评

暂无评论

Towards video management over relational database

Towards video management over relational database

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Li, Hui Zhang, Xiao Wang, Shan Du, Xiaoyong School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering China

ISBN: (纸本)9780769540122

Video has become popular in our daily life for both professional and consumer applications. Both low level video processing and high level semantic video analysis are critically computational tasks in application domains. Most of current video computing tools are developed for specific analytic tasks, they are lack higher level interoperability with database and treat database merely as a relational data storage engine rather than an analytic platform, which causes inefficient data access and massive amount of data movement. In this paper, we study how to support video data management over relational database, and present our initial solutions of video data storage mechanism, video data access method and efficient video analytics. We also illustrate our ongoing prototype system HybVideo that developed in a novel architecture. It integrates above solutions to tackle the major challenges of providing a platform for both storage and analysis of video data. © 2010 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm to building a fuzzy rough classifier 13

A fast algorithm to building a fuzzy rough classifier

引用

13th International Conference on Machine Learning and Cybernetics, ICMLC 2014

作者： Tsang, Eric C. C. Zhao, Suyun The Macau University of Science and Technology Taipa Macau China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing100872 China

ISBN: (纸本)9783662456514

In this paper, by strict mathematic reasoning, we discover the relation between the similarity relation and lower approximation. Based on this relation, we design a fast algorithm to build a rule based fuzzy rough classifier. Finally, the numerical experiments demonstrate the efficiency and the affectivity of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Semi-automatic online tagging with K-Medoid clustering

Semi-automatic online tagging with K-Medoid clustering

引用

作者： Hu, He Du, Xiaoyong School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge Engineering MoE No. 59 Zhongguancun St. Beijing100872 China

Online tagging is crucial for the acquisition and organization of web knowledge. We present TYG (Tag-as-You-Go) in this paper, a web browser extension for online tagging of personal knowledge on standard web pages. We investigate an approach to combine a K-Medoid-style clustering algorithm with the user input to achieve semi-automatic web page annotation. The annotation process supports user-defined tagging schema and comprises an automatic mechanism that is built upon clustering techniques, which can automatically group similar HTML DOM nodes into clusters corresponding to the user specification. TYG is a prototype system illustrating the proposed approach. Experiments with TYG show that our approach can achieve both efficiency and effectiveness in real world annotation scenarios. © 2014 World Scientific Publishing Company.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：