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

Commit processing of mobile distributed real-time transactions based on mobile agents

Journal of Information and Computational Science 2009年第3期6卷 1627-1634页

作者： Di, Guoqiang Liu, Yaoyao Liao, Guoqiong School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

In mobile computing environment, the features of limited resources, frequent disconnection and long transactions make the success rate of mobile distributed real-time transactions low. Through analyzing the factors impacting the execution of mobile distributed real-time transactions, this paper suggests a mobile distributed real-time transaction model based on mobile agents firstly. Then, a nested advance commit protocol (NACP) is presented, which allows the transactions executing in fixed server to release locks early. The results of performance testing show that NACP can not only effectively increase the successful rate of mobile distributed real-time transactions, but also support disconnection well. 1548-7741/ Copyright © 2009 Binary Information Press.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

A temporal object-oriented RFID data model for object tracking and monitoring in supply chain

引用

Journal of Information and Computational Science 2009年第3期6卷 1505-1513页

作者： Deng, Kun Liao, Guoqiong School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

With the significant advantages of RFID technologies, RFID is being gradually adopted and deployed in a wide area of applications, such as supply chain and logistics. Since RFID data has the characteristics including time-dependent, dynamically changing, large volumes, and carrying implicit semantics, relational data model is not suitable to express and handle RFID data for object tracking and monitoring applications in supply chain and logistics application. This paper first proposes a temporal object-oriented RFID data model based on EPCIS specification, and then the model implementation based on TOODM is introduced in details. In the end, some query examples using TOSQL to track and monitor objects are given. The results shows that our model can express the semantics of RFID data directly and can deal with temporal queries effectively. 1548-7741/ Copyright © 2009 Binary Information Press.

关键词： Radio frequency identification (RFID)

来源：评论

学校读者我要写书评

暂无评论

Clustering Technology Application in e-Commerce Recommendation System

Clustering Technology Application in e-Commerce Recommendati...

引用

International Conference on Management of e-Commerce and e-Government, ICMECG

作者： Jing Hui Wu Qiang Liu Si Wen Luo Jiangxi key Lab. of Data & Knowledge Eng. Jiangxi Univ. of Finance & Econ. Nanchang

This article analyses two kinds of information filtering technologies used in the e-commerce recommendation system: content-based filtering and collaborative filtering. On the foundation of collaborative filtering, we research the influential role of cluster technology to improve the recommendation system quality, to reduce the computation complexity, and to enhance the system real-time response speed.

关键词： Filtering Collaboration Information filtering Real time systems data mining Business Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A hybrid model for explaining older adult' continuance intention toward SNSs

引用

International Journal of Smart Home 2015年第1期9卷 93-102页

作者： Liu, Wei Jiangxi Key Laboratory of Data and Knowledge Engineering Institute of Information Resources Management School of Information Technology Jiangxi University of Finance and Economics Nanchang China

Due to the rapid growth of social net services (SNSs), research into SNSs continuance usage has recently emerged as an important issue in information systems adaption. This study develops an integrated model based on the expectation-confirmation model (ECM), the technology acceptance model (TAM), and the theory of planned behavior (TPB), and apply them into the context of older adults' continuance intention toward SNSs. The hypothesized model is validated empirically using a sample collected from 250 older adults who had prior experience with SNSs and was tested against the proposed research model using structure equation modeling. Analysis results demonstrate that satisfaction has the most significant effect on older adults' continuance intention, followed by perceived usefulness, attitude, subject norm and perceived behavioral control. The results of these findings for SNSs practitioners are discussed at the end of this work. © 2015 SERSC.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering

MatchPrompt: Prompt-based Open Relation Extraction with Sema...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Liang, Xi Zhong, Yujie Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Lenovo Research Beijing China

Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of labeled and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few predefined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlabeled clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE. © 2022 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Parallel SimRank computation on large graphs with iterative aggregation

Parallel SimRank computation on large graphs with iterative ...

引用

16th ACM SIGKDD International Conference on knowledge Discovery and data Mining, KDD-2010

作者： He, Guoming Feng, Haijun Li, Cuiping Chen, Hong Key Lab. of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science Renmin University of China China No. 59 Zhongguancun Street Haidian District Beijing China

ISBN: (纸本)9781450300551

Recently there has been a lot of interest in graph-based analysis. One of the most important aspects of graph-based analysis is to measure similarity between nodes in a graph. SimRank is a simple and influential measure of this kind, based on a solid graph theoretical model. However, existing methods on SimRank computation suffer from two limitations: 1) the computing cost can be very high in practice;and 2) they can only be applied on static graphs. In this paper, we exploit the inherent parallelism and high memory bandwidth of graphics processing units (GPU) to accelerate the computation of SimRank on large graphs. Furthermore, based on the observation that SimRank is essentially a first-order Markov Chain, we propose to utilize the iterative aggregation techniques for uncoupling Markov chains to compute SimRank scores in parallel for large graphs. The iterative aggregation method can be applied on dynamic graphs. Moreover, it can handle not only the link-updating problem but also the node-updating problem. Extensive experiments on synthetic and real data sets verify that the proposed methods are efficient and effective. © 2010 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Model for Explaining Older Adults' Continuance Intention Toward SNSs

A Hybrid Model for Explaining Older Adults' Continuance Inte...

引用

International Conference on Management of e-Commerce and e-Government, ICMECG

作者： Wei Liu Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance & Economics Nanchang P. R. China

关键词： Electronic countermeasures Adaptation models Reliability Mathematical model Attitude control Loading Load modeling

来源：评论

学校读者我要写书评

暂无评论

Trajectory simplification: An experimental study and quality analysis 44th

Trajectory simplification: An experimental study and quality...

引用

44th International Conference on Very Large data Bases, VLDB 2018

作者： Zhang, Dongxiang Ding, Mengting Yang, Dingy Liu, Yi Fan, Ju Shen, Heng Tao Center for Future Media School of Computer Science and Engineering UESTC China School of Electronics and Information Shanghai Dian Ji University China The Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The ubiquitousness of GPS sensors in smart-phones, vehicles and wearable devices has enabled the collection of massive volumes of trajectory data from tracing moving objects. Consequently, an unprecedented scale of timestamped GPS data has been generated and posed an urgent demand for an effective storage mechanism for trajectory databases. The mainstream compression technique is called trajectory simplification, that finds a subsequence to approximate the original trajectory and attempts to minimize the information loss under a distance measure. Even though various simplification algorithms have been proposed in the past decades, there still lacks a thorough comparison to cover all the state-of-the-art algorithms and evaluate their quality using datasets in diversified motion patterns. Hence, it still remains a challenge for GPS data collectors to determine a proper algorithm in a concrete application. In addition, almost the entire line of previous methods uses error-based metrics to evaluate the compression quality, while ignoring their usability in supporting spatio-temporal queries on top of the reduced database. To bridge these gaps, we conduct so far the most comprehensive evaluation on trajectory simplification techniques. We compare the performance of 25 algorithms in total using five real datasets in different motion patterns. According to the experimental findings, we present useful guidance for the selection or development of effective trajectory simplification algorithms. © VLDB Endowment 21508097/18/05

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

引用

Journal of Convergence Information Technology 2012年第16期7卷 87-96页

作者： Minjuan, Zhong School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 China

With the increasing of XML data over the Internet, managing and analyzing huge amount of XML documents has played an important role for information management. Clustering as an intelligent technique has been utilized as an excellent way of grouping the documents by their content or structure. However, the key problem is how to measure similarity between XML documents. In this paper, we propose an extended vector space model and on this basis put forward an effective semantic similarity measurement method combining content and structure semantics, in which a variety of XML document features impacting similarity measurement, such as term element frequency, term inverse element frequency, semantic weight of tag and level information of the term, are analyzed. In addition, information gain, for clustering quality evaluation are introduced motivated by the fact that collection has no classification information in advance. Experiment results show that proposed similarity method (EVSM_SS) outperforms the content and structure integration measurement based on structure path (VSM_SP) as well as traditional document clustering measurement (CO) in information gain and produce better clustering quality.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Pseudo-relevance feedback driven for XML query expansion

引用

Journal of Convergence Information Technology 2010年第9期5卷 146-156页

作者： Minjuan, Zhong Changxuan, Wan School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 China

Pseudo-relevance feedback has been perceived as an effective solution for automatic query expansion. However, a recent study has shown that traditional pseudo-relevance feedback may bring into topic drift and hence be harmful to the retrieval performance. It is often crucial to identify those good feedback documents from which useful expansion terms can be added to the query. Compared with traditional query expansion, XML query expansion needs not only content expansion but also considering structural expansion. This paper presents a solution for both identifying related documents and selecting good expansion information with new content and path constrains. Combined with XML semantic feature, a naïve document similarity measurement is proposed in this paper. Based on this, k-median clustering algorithm is firstly implemented and some related documents are found. Secondly, query expansion is only performed by two steps in the set of related documents, which key phrase extraction algorithm is carried out to expand original query in the first step and the second step is structural expansion based on the expanded key phrases. Finally a full-edged content-structure query expression which can represent user's intention is formalized. Experimental results on IEEE CS collection show that the proposed method can reduce the topic drift effectively and obtain the better retrieval quality.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：