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

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

作者： Dexi Liu Shihan Wu Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Songjiang Branch of Shanghai Rural Commercial Bank Shanghai China

In document-center XML dataset, an element may contain so many text that users have to spend enough time to judge the elements returned by XML search engine are valuable or not. Query-orient XML summarization system aim to provide users a brief and readable substitution of the original retrieved elements according to the user's query, which can relieve user's reading burden effectively. In this work, we extract sentences from the results of XML search engine, and combine them as a summary. Experiments on the IEEE-CS datasets used in INEX show that, the query-oriented XML summary generated by our method is reasonable.

关键词： XML Feature extraction Sections Search engines Computational modeling Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Visual group identification method of technical competitors using LinLog graph clustering algorithm

Visual group identification method of technical competitors ...

引用

IEEE International Conference on Computer Science and Automation engineering (CSAE)

作者： Hong-qi Han Xiaomi An Donghua Zhu Xuefeng Wang Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) Ministry of Education School of Information Resource Management Beijing 100872 China School of Management and Economics Beijing Institute of Technology 100872 China

Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value; LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method.

关键词： Clustering algorithms Patents Algorithm design and analysis Visualization Springs Layout Companies

来源：评论

学校读者我要写书评

暂无评论

基于主题语义的非合作结构化Top-N深网数据源选择

基于主题语义的非合作结构化Top-N深网数据源选择

引用

第29届中国数据库学术会议

作者： Deng Song 邓松 Wan Changxuan 万常选 Liu Xiping 刘喜平 Jiang Tengjiao 江腾蛟 Lei Gang 雷刚 School of Information and Technology Jiangxi University of Finance and Economics Nanchang 330013 江西财经大学信息管理学院南昌 330013 Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economic 江西财经大学数据与知识工程江西省高校重点实验室南昌 330013

高效且准确地找出存在于深网中的与用户查询意图最相关的Top-N元组，是深网数据集成中的关键问题。针对数据源内容概括未见成果的现状，本文提出了一种能够有效概括非数字、非离散属性特征的非合作结构化深网数据源摘要构建方法。利用... 详细信息

高效且准确地找出存在于深网中的与用户查询意图最相关的Top-N元组，是深网数据集成中的关键问题。针对数据源内容概括未见成果的现状，本文提出了一种能够有效概括非数字、非离散属性特征的非合作结构化深网数据源摘要构建方法。利用主题词抽样，依据主题语义选择与主题词相关的特征词，通过主题词及特征词构建数据源语义摘要。实验结果表明与传统的基于词频的方法相比较，该方法在召回率及准确度方面均有较大幅度的提升。

关键词：深网数据集成检索系统优化设计信息提取主题语义

来源：评论

学校读者我要写书评

暂无评论

A property of reductions in Fuzzy Variable Precision Rough Set model

A property of reductions in Fuzzy Variable Precision Rough S...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Eric C. C. Tsang Su-Yun Zhao Cai-Li Zhou Faculty of Information Technology Macau University of Science and Technology Taipa Macao China Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China School of Mathematics and Computer Sciences Hebei University China

In this paper, we use strict mathematics reasoning to discover the relation between the threshold and reduction in Fuzzy Variable Precision Rough Sets (FVPRS), i.e., the reductions act as a nested structure with the monotonously increasing threshold. By using the nested structure of reductions, we could design algorithms to quickly find different reductions when a reduction is required. Here `different' means the reductions obtained using different thresholds.

关键词： Rough sets Approximation methods Fuzzy sets Educational institutions Computational modeling Machine learning Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Idea-map: A Spatiotemporal View of Research Ideas

Idea-map: A Spatiotemporal View of Research Ideas

引用

2011 Eighth International Conference on Fuzzy System and knowledge Discovery(第八届模糊系统与知识发现国际会议 FSKD 2011)

作者： HeHu Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) MOE Beijing 100872 P. R. China School of Information Renmin University of China Beijing 100872 P. R. China

in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial and temporal information is extracted and parsed from the query results and is further transformed to SIMILE/EXHIBIT to show a spatiotemporal map for the research ideas. Idea-map shows the feasibility of combing various techniques such as YQL, SIMILE/Exhibit and SPARQL query answering to provide an insightful interface to better understand the interested research ideas.

关键词： Link data Cloud DBLP Spatiotemoral View YQL

来源：评论

学校读者我要写书评

暂无评论

An improved elastic net with heuristic cloning strategy for traveling salesman problem

引用

ICIC Express Letters 2011年第11期5卷 3995-4000页

作者： Yang, Gang Yang, Nan Yi, Junyan Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China No. 59 Zhongguancun Street Haidian District Beijing 100872 China Department of Computer Science and Technology Zhejiang University of Technology No. 18 Chaowang Road Hangzhou 310014 China

Based on analysis of relationships between solution qualities and number of initial dynamic points in elastic net algorithm, we propose an improved elastic network algorithm (IENA) introduced in a heuristic cloning strategy for traveling salesman problem (TSP). The improved elastic net consists of four evolution processes with less dynamic points and gradually reducing cities, and it accelerates the convergent process without compromising the equality of solutions. IENA is conducted on some random TSP instances to verify its performance by comparison with other algorithms. © 2011 ICIC International.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks

Constant approximation for virtual backbone construction wit...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Hongwei Du Qiang Ye Weili Wu Wonjun Lee Deying Li Dingzhu Du Stephen Howard Department of Computer Science and Information Technology University of Prince Edward Island Canada Department of Computer Science University of Texas Dallas USA Department of Computer Science and Engineering Korea University Seoul South Korea Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9781424499199

In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.

关键词： Routing Approximation methods Distributed algorithms Wireless sensor networks Polynomials Computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

FlexTable: Using a Dynamic Relation Model to Store RDF data

FlexTable: Using a Dynamic Relation Model to Store RDF Data

引用

15th International Conference on database Systems for Advanced Applications

作者： Wang, Yan Du, Xiaoyong Lu, Jiaheng Wang, Xiaofang Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Information School Renmin University of China China

ISBN: (纸本)9783642120251

Efficient management of RDF data is an important factor in realizing the Semantic Web vision. The existing approaches store RDF data based on triples instead of a relation model. In this paper, we propose a system called FlexTable, where all triples of an instance are coalesced into one tuple and all tuples are stored in relation schemas. The main technical challenge is how to partition all the triples into several tables, i.e. it is needed to design an effective and dynamic schema structure to store RDF triples. To deal with this challenge, we firstly propose a schema evolution method called LBA, which is based on a lattice structure to automatically evolve schemas while new triples are inserted. Secondly, we propose a novel page layout with an interpreted storage format to reduce the physical adjustment cost during schema evolution. Finally we perform comprehensive experiments on two practical RDF data sets to demonstrate that FlexTable is superior to the state-of-the-art approaches.

关键词： FlexTable RDF data dynamic relational model Lattice

来源：评论

学校读者我要写书评

暂无评论

基于划分的集合相似连接

基于划分的集合相似连接

引用

第29届中国数据库学术会议

作者： Rong Chuitian 荣垂田 Xu Tianren 徐天任 Du Xiaoyong 杜小勇 Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) Ministry o 教育部数据工程与知识工程重点实验室(中国人民大学) 北京 100872 中国人民大学信息学院北京 100872 School of Information Renmin University of China Beijing 100872 Key Laboratory of Education Inform 中国人民大学信息学院北京 100872 民族教育信息化教育部重点实验室(云南师范大学) 昆明 650500

集合相似连接(set similarity join)是指在给定的数据集中，按照基于集合间覆盖关系的相似度计算方法来衡量数据之间的相似度、并找出所有相似度不小于给定阈值的数据对的操作。集合相似连接作为一种新的基本操作在很多领域中有重要应... 详细信息

集合相似连接(set similarity join)是指在给定的数据集中，按照基于集合间覆盖关系的相似度计算方法来衡量数据之间的相似度、并找出所有相似度不小于给定阈值的数据对的操作。集合相似连接作为一种新的基本操作在很多领域中有重要应用。随着社会网络、移动应用以及在线服务的发展，使得数据收集的效率和规模得到了很大的提高，同时给相似连接操作带来新的挑战。根据集合相似的必要条件，提出了相似集合之间的差异度。利用差异度和鸽巢原理，提出了一种新颖的基于数据划分的集合相似连接计算方法，该方法对集合进行自适应的均衡划分，并利用基于划分块的过滤方法来提高过滤的效率。为了进一步提高过滤的效果和相似连接的效率，利用划分块的位置信息提出了增强的过滤方法。针对提出的方法，在不同的环境下进行了实验，实验结果表明，该方法与已有的方法相比可以有效地提高相似连接的效率。

关键词：数据库集合相似连接均衡划分法阈值

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：