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

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

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Cross-Modal Fusion Based Refinement for Text-to-Image Synthesis

引用

Chinese Journal of Electronics 2023年第6期32卷 1329-1340页

作者： SUN Haoran WANG Yang LIU Haipeng QIAN Biao Department of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of EducationHefei University of Technology

Text-to-image synthesis refers to generating visual-realistic and semantically consistent images from given textual descriptions. Previous approaches generate an initial low-resolution image and then refine it to be high-resolution. Despite the remarkable progress, these methods are limited in fully utilizing the given texts and could generate text-mismatched images, especially when the text description is complex. We propose a novel finegrained text-image fusion based generative adversarial networks(FF-GAN), which consists of two modules: Finegrained text-image fusion block(FF-Block) and global semantic refinement(GSR). The proposed FF-Block integrates an attention block and several convolution layers to effectively fuse the fine-grained word-context features into the corresponding visual features, in which the text information is fully used to refine the initial image with more details. And the GSR is proposed to improve the global semantic consistency between linguistic and visual features during the refinement process. Extensive experiments on CUB-200 and COCO datasets demonstrate the superiority of FF-GAN over other state-of-the-art approaches in generating images with semantic consistency to the given texts.

关键词： Visualization Fuses Convolution Semantics Linguistics Benchmark testing Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Part-of-speech Tagging Model Employing Word Clustering and Syntactic Parsing

引用

Chinese Journal of Electronics 2014年第1期23卷 109-114页

作者： YUAN Lichi School of Information Technology Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics

Part-Of-Speech tagging is a basic task in the field of natural language processing. This paper builds a POS tagger based on improved Hidden Markov model,by employing word clustering and syntactic parsing ***, In order to overcome the defects of the classical HMM, Markov family model(MFM), a new statistical model was introduced. Secondly, to solve the problem of data sparseness, we propose a bottom-to-up hierarchical word clustering algorithm. Then we combine syntactic parsing with part-of-speech tagging. The Part-ofSpeech tagging experiments show that the improved PartOf-Speech tagging model has higher performance than Hidden Markov models(HMMs) under the same testing conditions, the precision is enhanced from 94.642% to97.235%.

关键词： Part-of-speech tagging Hidden Markov model Markov family model Word clustering

来源：评论

学校读者我要写书评

暂无评论

Co-spatial searcher: Efficient tag-based collaborative spatial search on geo-social network

Co-spatial searcher: Efficient tag-based collaborative spati...

引用

17th International Conference on database Systems for Advanced Applications, DASFAA 2012

作者： Zhang, Jinzeng Meng, Xiaofeng Zhou, Xuan Liu, Dongqi School of Information Renmin University of China Beijing China Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China

ISBN: (纸本)9783642290374

The proliferation of geo-social network, such as Foursquare and Facebook Places, enables users to generate location information and its corresponding descriptive tags. Using geo-social networks, users with similar interests can plan for social activities collaboratively. This paper proposes a novel type of query, called Tag-based top-k Collaborative Spatial (TkCoS) query, for users to make outdoor plans collaboratively. This type of queries aim to retrieve groups of geographic objects that can satisfy a group of users' requirements expressed in tags, while ensuring that the objects be within the minimum spatial distance from the users. To answer TkCoS queries efficiently, we introduce a hybrid index structure called Spatial-Tag R-tree (STR-tree), which is an extension of the R-tree. Based on STR-tree, we propose a query processing algorithm that utilizes both spatial and tag similarity constraints to prune search space and identify desired objects quickly. Moreover, a differential impact factor is adopted to fine-tune the returned results in order to maximize the users' overall satisfaction. Extensive experiments on synthetic and real datatsets validate the efficiency and the scalability of the proposed algorithm. © 2012 Springer-Verlag.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Top-k neighborhood dominating query

Top-k neighborhood dominating query

引用

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

作者： Xie, Xike Lu, Hua Chen, Jinchuan Shang, Shuo Department of Computer Science Aalborg University Denmark Key Labs of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9783642374869

In many real-life applications, spatial objects are associated with multiple non-spatial attributes. For example, a hotel may have price and rating in addition to its geographic location. In traditional spatial databases, spatial objects are often ranked solely based on their distance to a given query location, e.g., in a nearest neighbor search. In another line of research, domination based skyline queries are used to return best objects according to multi-criteria on non-spatial attributes. In this paper, we study how to rank spatial objects with respect to their non-spatial attributes within their spatial neighborhoods. To enable a general ranking, we design a ranking function that inherits the advantages of dominance relationship and integrates them with spatial proximity. Further, we propose an effective index structure, and a branch and bound solution that executes the ranking efficiently via the index. We conduct extensive empirical studies on real and synthetic datasets. The results demonstrate the high efficiency of our proposal compared to straightforward alternatives. © Springer-Verlag 2013.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

S-SimRank: Combining Content and Link Information to Cluster Papers Effectively and Efficiently

S-SimRank: Combining Content and Link Information to Cluster...

引用

4th International Conference on Advanced data Mining and Applications

作者： Cai, Yuanzhe Li, Pei Liu, Hongyan He, Jun Du, Xiaoyong Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783540881919

Both Content analysis and link, analysis have its advantages in measuring relationships among documents. In this paper. we propose a new method to combine these two methods to compute the similarity of research papers so that we can do clustering of these papers more accurately. In order to improve the efficiency of similarity calculation, we develop a strategy to deal with the relationship graph separately, without affecting the accuracy. We also design an approach to assign different weights to different links to the papers, which can enhance the accuracy of similarity calculation. The experimental results conducted oil ACM data Set show that our new algorithm. S-SimRank, outperforms other algorithms.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Assessing the Influence Probability between Objects: A Random Walker Approach

Assessing the Influence Probability between Objects: A Rando...

引用

IEEE Symposium on Computational Intelligence and data Mining

作者： Li, Pei Li, Zhixu He, Jun Du, Xiaoyong Liu, Hongyan Key Labs of Data Engineering and Knowledge Engineering MOE China and School of Information Renmin University of China Beijing China Department of Management Science and Engineering Tsinghua University Beijing China

ISBN: (纸本)9781424427659

Influence between objects needs to be assessed in many applications. Lots of measures have been proposed, but a domain-independent method is still expected. In this paper, we give a probabilistic definition of influence based on the random walker model on graphs. Two approaches, linear systems method and Basic InfRank algorithm, are shown and return equal results, but Basic InfRank is more efficient by iterative computation. Two variants on bipartite graphs and star graphs are discussed. Experiments show InfRank algorithms have good accuracy, fast convergent rate and high performance.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Factors promoting and hindering informatization of nursing institutions for the aged: A toe theoretic perspective 18

Factors promoting and hindering informatization of nursing i...

引用

18th Pacific Asia Conference on Information Systems, PACIS 2014

作者： He, Yingzhao Zuo, Meiyun Chen, Jie Key Laboratory of Data Engineering and Knowledge Engineering School of Business Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing China

This paper uses the theoretic framework of TOE(technology-organization-environment), identifies the factors promoting and hindering informatization of nursing institutions for the aged. This case study of six nursing institutions for the aged finds that different ownership institutions have some different factors promoting and hindering the process of informatization. In general, compared with public nursing institutions for the aged, private nursing institutions have more both promoting and hindering factors in technological and organizational aspect, but less hindering factors in the environmental aspect;and, risk management is an important promoting factor in the application of information systems for these institutions, it is fewer reported in other industries' study. These findings extend the application field of the TOE theory;extend the informatization study in nursing institutions for the aged. In practical,we suggest that different ownership's nursing institutions for the aged should take good advantage of promoting factors considering their own resources, overcome the hindering factors to ensure the successful implementation of the informatization.

关键词： Informatization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：