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

Study on the Characteristics of Cross-Domain knowledge Diffusion from Science to Policy: Evidence from Overton data

Proceedings of the Association for Information Science and Technology 2023年第1期60卷 368-378页

作者： Ren, Chao Yang, Menghui School of Information Resource Management Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China

The cross-domain knowledge diffusion from science to policy is a prevalent phenomenon that demands academic attention. To investigate the characteristics of cross-domain knowledge diffusion from science to policy, this study suggests using the citation of policies to scientific articles as a basis for quantifying the diffusion strength, breadth, and speed. The study reveals that the strength and breadth of cross-domain knowledge diffusion from scientific papers to policies conform to a power-law distribution, while the speed follows a logarithmic normal distribution. Moreover, the papers with the highest diffusion strength, breadth, and fastest diffusion speed are predominantly from world-renowned universities, scholars, and top journals. The papers with the highest diffusion strength and breadth are mostly from social sciences, especially economics, those with the fastest diffusion speed are mainly from medical and life sciences, followed by social sciences. The findings indicate that cross-domain knowledge diffusion from science to policy follows the Matthew effect, whereby individuals or institutions with high academic achievements are more likely to achieve successful cross-domain knowledge diffusion. Furthermore, papers in the field of economics tend to have the higher cross-domain knowledge diffusion strength and breadth, while those in medical and life sciences have the faster cross-domain knowledge diffusion speed. 86 Annual Meeting of the Association for Information Science & Technology | Oct. 27 – 31, 2023 | London, United Kingdom. Author(s) retain copyright, but ASIS&T receives an exclusive publication license.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

Approximation for a scheduling problem with application in wireless networks

引用

Science China Mathematics 2010年第6期53卷 1643-1655页

作者： ZHU QingHua & LI DeYing Key laboratory of data engineering and knowledge engineering,MOE,School of Information,Renmin University of China,Beijing 100872,China 1. Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing 100872 China

A network of many sensors and a base station that are deployed over a region is *** sensor has a transmission range,an interference range and a carrier sensing range,which are r,αr and βr,*** this paper,we study the minimum latency conflict-aware many-to-one data aggregation scheduling problem:Given locations of sensors along with a base station,a subset of all sensors,and parameters r,α and β,to find a schedule in which the data of each sensor in the subset can be transmitted to the base station with no conflicts,such that the latency is *** designe an algorithm based on maximal independent sets,which has a latency bound of(a+19b)R + Δb-a + 5 time slots,where a and b are two constant integers relying on α and β,Δ is the maximum degree of network topology,and R is the trivial lower bound of *** Δ contributes to an additive factor instead of a multiplicative one,thus our algorithm is nearly a constant(a+19b)-ratio.

关键词： approximation algorithm conflict-aware many-to-one data aggregation latency wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Multi-Cluster Feature Selection Based on Isometric Mapping

引用

IEEE/CAA Journal of Automatica Sinica 2022年第3期9卷 570-572页

作者： Yadi Wang Zefeng Zhang Yinghao Lin Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng 475004 Institute of Data and Knowledge Engineering School of Computer and Information EngineeringHenan UniversityKaifeng 475004China

Dear editor,This letter presents an unsupervised feature selection method based on machine *** selection is an important component of artificial intelligence,machine learning,which can effectively solve the curse of d... 详细信息

关键词： problem letter dimensionality

来源：评论

学校读者我要写书评

暂无评论

Hadamard Encoding Based Frequent Itemset Mining under Local Differential Privacy

引用

Journal of Computer Science & Technology 2023年第6期38卷 1403-1422页

作者：赵丹赵素云陈红刘睿瑄李翠平张晓莹 Institute of Scientific and Technical Information of China Beijing 100038China Key Laboratory of Data Engineering and Knowledge Engineering(Ministry of Education) School of InformationRenmin University of ChinaBeijing 100872China

Local differential privacy(LDP)approaches to collecting sensitive information for frequent itemset mining(FIM)can reliably guarantee *** current approaches to FIM under LDP add"padding and sampling"steps to obtain frequent itemsets and their frequencies because each user transaction represents a set of *** current state-of-the-art approach,namely set-value itemset mining(SVSM),must balance variance and bias to achieve accurate ***,an unbiased FIM approach with lower variance is highly *** narrow this gap,we propose an Item-Level LDP frequency oracle approach,named the Integrated-with-Hadamard-Transform-Based Frequency Oracle(IHFO).For the first time,Hadamard encoding is introduced to a set of values to encode all items into a fixed vector,and perturbation can be subsequently applied to the *** FIM approach,called optimized united itemset mining(O-UISM),is pro-posed to combine the padding-and-sampling-based frequency oracle(PSFO)and the IHFO into a framework for acquiring accurate frequent itemsets with their ***,we theoretically and experimentally demonstrate that O-UISM significantly outperforms the extant approaches in finding frequent itemsets and estimating their frequencies under the same privacy guarantee.

关键词： local differential privacy frequent itemset mining frequency oracle

来源：评论

学校读者我要写书评

暂无评论

Enhancing Storage Efficiency and Performance: A Survey of data Partitioning Techniques

引用

Journal of Computer Science & Technology 2024年第2期39卷 346-368页

作者：刘鹏举李翠平陈红 Distinguished Member CCF 1.School of InformationRenmin University of ChinaBeijing 100872China Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Beijing 100872China

data partitioning techniques are pivotal for optimal data placement across storage devices,thereby enhancing resource utilization and overall system ***,the design of effective partition schemes faces multiple challenges,including considerations of the cluster environment,storage device characteristics,optimization objectives,and the balance between partition quality and computational ***,dynamic environments necessitate robust partition detection *** paper presents a comprehensive survey structured around partition deployment environments,outlining the distinguishing features and applicability of various partitioning strategies while delving into how these challenges are *** discuss partitioning features pertaining to database schema,table data,workload,and runtime *** then delve into the partition generation process,segmenting it into initialization and optimization stages.A comparative analysis of partition generation and update algorithms is provided,emphasizing their suitability for different scenarios and optimization ***,we illustrate the applications of partitioning in prevalent database products and suggest potential future research directions and *** survey aims to foster the implementation,deployment,and updating of high-quality partitions for specific system scenarios.

关键词： data partitioning survey partitioning feature partition generation partition update

来源：评论

学校读者我要写书评

暂无评论

Structural Join and Staircase Join Algorithms of Sibling Relationship

引用

Journal of Computer Science & Technology 2007年第2期22卷 171-181页

作者：万常选刘喜平 School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

The processing of XML queries can result in evaluation of various structural relationships. Efficient algorithms for evaluating ancestor-descendant and parent-child relationships have been proposed. Whereas the problems of evaluating preceding-sibling-following-sibling and preceding-following relationships are still open. In this paper, we studied the structural join and staircase join for sibling relationship. First, the idea of how to filter out and minimize unnecessary reads of elements using parent＇s structural information is introduced, which can be used to accelerate structural joins of parent-child and preceding-sibling-following-sibling relationships. Second, two efficient structural join algorithms of sibling relationship are proposed. These algorithms lead to optimal join performance： nodes that do not participate in the join can be judged beforehand and then skipped using B^＋-tree index. Besides, each element list joined is scanned sequentially once at most. Furthermore, output of join results is sorted in document order. We also discussed the staircase join algorithm for sibling axes. Studies show that, staircase join for sibling axes is close to the structural join for sibling axes and shares the same characteristic of high efficiency. Our experimental results not only demonstrate the effectiveness of our optimizing techniques for sibling axes, but also validate the efficiency of our algorithms. As far as we know, this is the first work addressing this problem specially.

关键词： XML query processing sibling relationship structural join staircase join

来源：评论

学校读者我要写书评

暂无评论

Operating system mechanisms for TPM-based lifetime measurement of process integrity

Operating system mechanisms for TPM-based lifetime measureme...

引用

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09

作者： Xiao, Li Wenchang, Shi Zhaohui, Liang Bin, Liang Zhiyong, Shan Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University) Ministry of Education

ISBN: (纸本)9781424451135

Implementing runtime integrity measurement in an acceptable way is a big challenge. We tackle this challenge by developing a framework called Patos. This paper discusses the design and implementation concepts of our operating system mechanisms for runtime process integrity measurement, which is an important part of the Patos framework and is named Patos-RIP. Patos-RIP is developed into the mainstream Linux operating system and utilizes TPM as hardware support for tamper-resistance. From the beginning a process is created to the moment the process dies, Patos-RIP conducts integrity measurement at appropriate points of time when the process runs, so as to ensure that the integrity of a process is not compromised during its whole lifetime. This way, Patos-RIP can improve trustworthiness of processes by effectively detecting runtime tampering attacks on processes' integrity. ©2009 IEEE.

关键词： Computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Processing the v-KNN queries in wireless sensor networks

Processing the v-KNN queries in wireless sensor networks

引用

36th International Conference on Parallel Processing in Xi'an, ICPP

作者： Lai, Yongxuan Chen, Hong Li, Cuiping School of Information Renmin University Laboratory of Data Engineering and Knowledge Engineering MOE

ISBN: (纸本)076952933X

Recently there have been growing interests in the applications of wireless sensor networks. Given a query point, which is a value, find a set of K nodes whose values are nearest to this point. We call this query the value-based KNN (v-KNN) query. v-KNN is a challenging query in wireless sensor networks because the network is highly distributed and global knowledge of the values are needed before the result set could be constructed. In this paper, we propose a new algorithm called KVC (v-KNN queries based on value clustering ) to process the v-KNN queries in wireless sensor networks in an energy efficient way. KVC takes advantage of the rich resources in the base station to do some optimizations to filter the irrelevant nodes and push down the v-KNN query into the network. The aim of KVC is to reduce the total communication cost as much as possible while processing the v-KNN queries correctly and efficiently. Simulation results on both realistic and synthetical data sets show that KVC outperforms the central processing in both average and hotspot energy consumption in wireless sensor networks. © 2007 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Improved head-driven statistical models for natural language parsing

引用

Journal of Central South University 2013年第10期20卷 2747-2752页

作者：袁里驰 School of Information Technology Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics

Head-driven statistical models for natural language parsing are the most representative lexicalized syntactic parsing models, but they only utilize semantic dependency between words, and do not incorporate other semantic information such as semantic collocation and semantic category. Some improvements on this distinctive parser are presented. Firstly, "valency" is an essential semantic feature of words. Once the valency of word is determined, the collocation of the word is clear, and the sentence structure can be directly derived. Thus, a syntactic parsing model combining valence structure with semantic dependency is purposed on the base of head-driven statistical syntactic parsing models. Secondly, semantic role labeling(SRL) is very necessary for deep natural language processing. An integrated parsing approach is proposed to integrate semantic parsing into the syntactic parsing process. Experiments are conducted for the refined statistical parser. The results show that 87.12% precision and 85.04% recall are obtained, and F measure is improved by 5.68% compared with the head-driven parsing model introduced by Collins.

关键词： valence structure semantic dependency head-driven statistical syntactic parsing semantic role labeling

来源：评论

学校读者我要写书评

暂无评论

2DCMA： An Effective Maintenance Algorithm of Materialized Views in Peer data Management Systems

引用

Journal of Computer Science & Technology 2006年第4期21卷 503-512页

作者：覃飙王珊杜小勇 School of Information Renmin University of China Beijing 100872 P.R. China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing 100872 P.R. China

Update management is very important for data integration systems. So update management in peer data management systems （PDMSs） is a hot research area. This paper researches on view maintenance in PDMSs. First, the definition of view is extended and the peer view, local view and global view are proposed according to the requirements of applications. There are two main factors to influence materialized views in PDMSs. One is that schema mappings between peers are changed, and the other is that peers update their data. Based on the requirements, this paper proposes an algorithm called 2DCMA, which includes two sub-algorithms： data and definition consistency maintenance algorithm% to effectively maintain views. For data consistency maintenance, Mork＇s rules are extended for governing the use of updategrams and boosters. The new rule system can be used to optimize the execution plan. And are extended for the data consistency maintenance algorithm is based on the new rule system. Furthermore, an ECA rule is adopted for definition consistency maintenance. Finally, extensive simulation experiments are conducted in SPDMS. The simulation results show that the 2DCMA algorithm has better performance than that of Mork＇s when maintaining data consistency. And the 2DCMA algorithm has better performance than that of centralized view maintenance algorithm when maintaining definition consistency.

关键词： view maintenance peer data management system schema mapping ECA rule

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：