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

4th International Conference on Semantics, knowledge, and Grid, SKG 2008

作者： Tian, Xia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resource Management Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769534015

Extracting multi-records from web pages is useful, it allows us to integrate information from multiple sources to provide value-added services. Existing techniques still have some limitations because of their several restrictions and accuracy. This paper proposes a new method to perform multi-records extraction task automatically. Firstly, the HTML tag tree is build based on an embedded browser interface to solve the AJAX problem. Secondly, data regions are found out by data chunk comparison, and simple tree matching method is proposed to compute the chunk similarity. Finally, the main data region is determined and the multi-records are extracted out. Experimental results show that our method dramatically outperforms other existing methods, and it can extract multi-records from pages very accurately. © 2008 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Efficient querying of correlated uncertain data with cached results

Efficient querying of correlated uncertain data with cached ...

引用

18th International Conference on database Systems for Advanced Applications, DASFAA 2013

作者： Chen, Jinchuan Zhang, Min Xie, Xike Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China School of Information Renmin University of China China Department of Computer Science Aalborg University Denmark

ISBN: (纸本)9783642374869

Although there have been many efforts for management of uncertain data, evaluating probabilistic inference queries, a known NP-hard problem, is still a big challenge, especially for querying data with highly correlations. The state-of-art exact algorithms for accelerating the evaluation of inference queries are based on special indices. Besides, with the observation of the existence of many frequent queries, some researchers try to improve efficiency by reusing previously queried results. Indexing depends on the static properties like data distributions, whereas caching is in favor of the dynamic features like query workload. In this paper we propose a new approach for speeding up the evaluation of inference queries by caching frequent results in a junction tree-based hierarchical index. To the best of our knowledge, this is the first effort on utilizing both the static (data) and dynamic (query workload) properties to efficiently evaluate probabilistic inference queries. Moreover, according to our experience, different caching strategies may significantly affect the query performance. Basically a good caching strategy needs to have high cache hit ratio with limited space *** on these considerations, we propose a novel caching approach, called FVEC, and present corresponding algorithms for efficiently querying correlated uncertain data. We further conduct a series of extensive experiments on large uncertain datasets in order to illustrate the effectiveness and efficiency of our proposed approaches. As illustrated by the results, compared with previous solutions, our method could greatly improve the query performance. © Springer-Verlag 2013.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Implementation and performance of VoIP interception based on SIP session border controller

Implementation and performance of VoIP interception based on...

引用

作者： Yang, Menghui Liu, Hua Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Resources Management Renmin University of China Beijing 100872 China

In an effort to provide lawful interception for session initiation protocol (SIP) voice over Internet protocol (VoIP), an interception architecture using session border controller (SBC) is proposed. Moreover, a prototype based on the proposed architecture is implemented. A testbed is set up and tests are carried out in order to analyze the performance and the capability of function entities and interfaces in the proposed architecture. Test results show that SBC interception capability in SIP signaling is superior to that in real-time transport protocol (RTP) media stream. In order to eliminate the possible bottleneck of RTP packets interception in SBC, an analytic model is proposed to investigate the mechanism in which RTP packet's traffics are shared among different SBC media functions. Analysis results show that multiple SBC media functions can share the RTP packets arrival and can significantly decrease RTP packets service time in SBC. Test results also show that delivery function, collect function and their interfaces in the proposed interception architecture have corresponding interception performance and capability with SBC. © 2013 Springer Science+Business Media New York.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Distilling Dynamic Spatial Relation Network for Human Pose Estimation 32

Distilling Dynamic Spatial Relation Network for Human Pose E...

引用

32nd British Machine Vision Conference, BMVC 2021

作者： Wu, Kewei Wang, Tao Xie, Zhao Guo, Dan Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Human pose estimation is a challenging task that requires the comprehension of the pose structure. This work can refer to spatial relation inference in a pose structure model;how to model the dynamic spatial relation against various unreliable joints is critical. To this end, we propose a Distilling Dynamic Spatial Relation network (DDSR), which builds pose-based graph representation by exploiting the feature of spatial relation from the location distribution of joints. We use a dynamic message propagation mechanism to update the spatial relation on edges. Specifically, to filter out the noisy predictions, we select the joints with high confidence;to enhance the spatial relation in a large receptive field, we propagate multi-stage messages among joints. Besides, to reduce the computation cost of the multi-stage message propagation, we design a cross-resolution distillation framework. We use a new spatial distillation loss to verify the spatial relation between the teacher model and the student model. Experimental results on COCO and MPII datasets show that our method is superior to the state-of-the-art methods. The visualization results further verify the interpretability of our spatial relation. © 2021. The copyright of this document resides with its authors.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Electronic Medical Record Sharing System Based on Hyperledger Fabric and InterPlanetary File System 2021

Electronic Medical Record Sharing System Based on Hyperledge...

引用

5th International Conference on Compute and data Analysis, ICCDA 2021

作者： Li, Lei Yue, Zhengxiang Wu, Gongqing Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781450389112

Electronic Medical Records (EMR) and other medical data contain important and sensitive privacy information of patients, which provide important basis and reference for their doctors to diagnose and treat them. With the continuous development of data sharing, big data applications and other technologies, new requirements are proposed for the storage of medical privacy data. At present, medical data have the characteristics of obstructed sharing and exchange, difficult data tracing and data sensitivity, which increases the cost and difficulty of each diagnosis. Moreover, patients lack the right to know and control their own medical data, which is easy to cause data fraud or data leakage. As a decentralized, tamper proof and traceable distributed ledger system, blockchain brings new solutions to these problems. This paper designs a medical data fusion and distributed privacy management system based on the Hyperledger Fabric blockchain development platform and InterPlanetary File System. It can not only solve the problem of mutual distrust in the traditional system, but also realize the safe data storage and the safe sharing of medical record data between medical organizations which is a beneficial attempt to overcome the disadvantages of traditional hospital data separation. At the same time, according to the requirements of different levels and types of medical users or groups for data security and personal privacy protection, the access control technology of users is studied to ensure personal privacy data. © 2021 ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Location selection for utility maximization with capacity constraints 12

Location selection for utility maximization with capacity co...

引用

21st ACM International Conference on Information and knowledge Management, CIKM 2012

作者： Sun, Yu Huang, Jin Chen, Yueguo Zhang, Rui Du, Xiaoyong School of Information Renmin University of China Beijing China University of Melbourne Melbourne VIC Australia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)9781450311564

Given a set of client locations, a set of facility locations where each facility has a service capacity, and the assumptions that: (i) a client seeks service from its nearest facility;(ii) a facility provides service to clients in the order of their proximity, we study the problem of selecting all possible locations such that setting up a new facility with a given capacity at these locations will maximize the number of served clients. This problem has wide applications in practice, such as setting up new distribution centers for online sales business and building additional base stations for mobile subscribers. We formulate the problem as location selection query for utility maximization. After applying three pruning rules to a baseline solution,we obtain an efficient algorithm to answer the query. Extensive experiments confirm the efficiency of our proposed algorithm. © 2012 ACM.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

VAN: Vehicle-assisted shortest-time path navigation

VAN: Vehicle-assisted shortest-time path navigation

引用

2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010

作者： Chen, Wenping Zhu, Sencun Li, Deying School of Information Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing China Department of Computer Science and Engineering Pennsylvania State University University Park PA United States

ISBN: (纸本)9781424474882

Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is getting even worse. In this paper, by leveraging the techniques of Vehicular Ad hoc Networks (VANETs) we present a dynamic navigation protocol called VAN for individual vehicles to find the shortest-time paths toward their given destinations. Specifically, a vehicle initiates a number of queries, which are routed by VANETs along different paths toward its destination. During query forwarding, the real-time road traffic information in each road segment is aggregated from multiple participating vehicles and returned to the source after the query reaches the destination. This information enables the source to calculate the shortest-time path. We also propose two forwarding optimization methods to reduce communication costs and an error handling mechanism to deal with abnormal circumstances. To evaluate its performance, we use the real traffic data of Beijing, including 2,308 road segments at two different times. Our simulation results demonstrate that our protocol, on average, could save around 30% driving time, compared to traveling along the shortest distance paths. ©2010 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

An apparel trade quotation architecture based on BPM and SOA

An apparel trade quotation architecture based on BPM and SOA

引用

13th Pacific Asia Conference on Information Systems: IT Services in a Global Environment, PACIS 2009

作者： Li, Qian Chen, Yu Zhang, Lan Fang Information School Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Management Science and Engineering Renmin University of China Beijing 100872 China

Based on the analysis of problems and difficulties in apparel quotation system, this paper puts forward the combination of BPM and SOA as a new idea for analysis of apparel quotation system, according to their advantages in business goals and requirements analysis, and the corresponding services' definition, extraction, optimization and integration. Through the combination, system flexibility, rapidity and accuracy could be achieved. The establishment of Service Repository according to the business requirements, is a crucial part in the architecture, however there are no definite rules for service extraction. In this paper, the detailed activities and steps, as well as a specific establishment case is illustrated. At last, architecture based on BPM and SOA for the apparel trade quotation is put forward, and its composition and implement are also analyzed.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Article reranking by memory-enhanced key sentence matching for detecting previously fact-checked claims 59

Article reranking by memory-enhanced key sentence matching f...

引用

Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL-IJCNLP 2021

作者： Sheng, Qiang Cao, Juan Zhang, Xueyao Li, Xirong Zhong, Lei Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

ISBN: (纸本)9781954085527

False claims that have been previously fact-checked can still spread on social media. To mitigate their continual spread, detecting previously fact-checked claims is indispensable. Given a claim, existing works retrieve fact-checking articles (FC-articles) for detection and focus on reranking candidate articles in the typical two-stage retrieval framework. However, their performance may be limited as they ignore the following characteristics of FC-articles: (1) claims are often quoted to describe the checked events, providing lexical information besides semantics;and (2) sentence templates to introduce or debunk claims are common across articles, providing pattern information. In this paper, we propose a novel reranker, MTM (Memoryenhanced Transformers for Matching), to rank FC-articles using key sentences selected using event (lexical and semantic) and pattern information. For event information, we propose to finetune the Transformer with regression of ROUGE. For pattern information, we generate pattern vectors as a memory bank to match with the parts containing patterns. By fusing event and pattern information, we select key sentences to represent an article and then predict if the article fact-checks the given claim using the claim, key sentences, and patterns. Experiments on two real-world datasets show that MTM outperforms existing methods. Human evaluation proves that MTM can capture key sentences for explanations. The code and the dataset are at https://***/ICTMCG/MTM. © 2021 Association for Computational Linguistics

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Who knows more? The role of structural hole spanners in accurate information identification on social media

引用

Pacific-Basin Finance Journal 2025年

作者： Man Guo Wen Long Yanqiang Zhong Wei Zhang School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 PR China Research Center on Fictitious Economy & Data Science Chinese Academy of Sciences Beijing 100190 PR China Key Laboratory of Big Data Mining & Knowledge Management Chinese Academy of Sciences Beijing 100190 PR China Department of Information Systems and Management Engineering Southern University of Science and Technology Shenzhen 518055 PR China

Based on structural hole theory, this study explores the differences in the ability of Chinese social media users with different characteristics to provide accurate information. Using over 20 million interactive data from 2.19 million users, we construct a social network and identify structural hole spanners and ordinary users. As key players in a network, structural hole spanners are typically located at the intersections of different groups or information sources. They differ from ordinary users in the way they gather and disseminate information. The empirical results indicate that the accuracy of market judgements by structural hole spanners is at least 12.38 % higher than that of ordinary users. Strategy simulations show that using information from structural hole spanners to make investment decisions can achieve a 116 % cumulative return during the backtesting period, nearly four times that of ordinary users. This information advantage occurs primarily because opinion distance and information uniqueness play significant roles in improving information accuracy. This study not only helps deepen understanding of information dissemination characteristics among heterogeneous users on social media but also provides empirical support for the application of structural hole theory in finance, with important theoretical and practical implications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：