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

Capability description and discovery of Internetware entity

Science China(Information Sciences) 2010年第4期53卷 685-703页

作者： WANG PuWei1*, JIN Zhi2,3* & LIU HongYan4 1Key laboratory of data engineering and knowledge engineering of the Ministry of Education, Renmin University of China, Beijing 100872, China 2Key laboratory of High Confidence Software Technologies of the Ministry of Education, Peking University, Beijing 100871, China 3Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100190, China 4Department of Management Science and engineering, Tsinghua University, Beijing 100084, China 1. Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing 100872 China2. Key Laboratory of High Confidence Software Technologies of the Ministry of Education Peking University Beijing 100871 China3. Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing 100190 China4. Department of Management Science and Engineering Tsinghua University Beijing 100084 China

Internetware can be formed through aggregation of Internetware entities bottom-up to satisfy the user's requirements. In the process, capability description of Internetware entity plays an important role. This paper proposes a capability description of Internetware entity based on environment ontology. The environment ontology includes environment entities and possible interactions with the environment entities in a particular domain. Tree-like hierarchical state machines are also included in the ontology to describe domain life-cycle of the environment entities. On the basis of the ideas, the capability of Internetware entity is embodied by interacting with environment entities and the changes of the environment entities during the interactions. Finally, this paper describes the matchmaking between capability descriptions of Internetware entities to support the discovery of Internetware entity. An example of online education course is given to illustrate the ideas.

关键词： Internetware capability description domain environment ontology tree-like hierarchical state machine

来源：评论

学校读者我要写书评

暂无评论

Randomly Sampling based Fuzzy Rough Reduction

Randomly Sampling based Fuzzy Rough Reduction

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Yu Chen Suyun Zhao Hong Chen Key Laboratory of Data Engineering and Knowledge (Renmin University of China)

ISBN: (纸本)9781479938414

Now most methods of the existing fuzzy rough based attribute reduction can't be applied to large scale data sets because of high time and space consuming. To overcome this problem, we proposed a randomly sampling based method to decrease the computing consumption. First, we propose some pseudo concepts of fuzzy rough sets, such as the pseudo lower approximation and pseudo attribute reduction, which is not exactly, but approximately equal to classical concepts, and then it drastically accelerate computation and significantly reduce space consumption. The numerical experiments show that the random sampling algorithm is significantly efficient both in time and space with little loss of information.

关键词： Randomly sampling Fuzzy rough sets Attribute reduction Pesudo approximation operators

来源：评论

学校读者我要写书评

暂无评论

A new steganography without embedding based on adversarial training 20

A new steganography without embedding based on adversarial t...

引用

2020 ACM Turing Celebration Conference - China, ACM TURC 2020

作者： Jiang, Wenjie Hu, Donghui Yu, Cong Li, Meng Zhao, Zhong-Qiu Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education and College of Computer Science and Information Engineering !!!Hefei University of Technology Hefei China College of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China

ISBN: (纸本)9781450375344

Steganography is an art to hide information in the carriers to prevent from being detected, while steganalysis is the opposite art to detect the presence of the hidden information. With the development of deep learning, several state-of-the-art steganography and steganalysis based on deep learning techniques have been proposed to improve hiding or detection capabilities. Generative Adversarial Networks (GANs) based steganography directly uses the minimax game between the generator and discriminator, to automatically generate steganography algorithms resisting being detected by powerful steganalysis. The steganography without embedding (SWE) based on GANs, where the generated cover images themselves are stego ones carrying secret information has shown its state-of-the-art steganography performance. However, SWE based on GANs has serious weaknesses, such as low information recovery accuracy, low steganography capacity and poor natural showing. To solve these problems, this paper proposes a new SWE based on adversarial training, with carefully designed generator, discriminator and extractor, as well as their loss functions and optimized training mode. The proposed method can achieve a very high information recovery accuracy (100% in some cases), and at the same time improve the steganography capacity and image quality. © 2020 ACM.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

The Research on the Algorithms of Keyword Search in Relational database

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2008年 4977卷 134-143页

作者： Li, Peng Zhu, Qing Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing100872 China

ISBN: (纸本)354089375X

With the development of relational database, people require better database not only in the aspect of database performance, but also in the aspect of the database’s interactive ability. So that the database is much more friendly than just before and it is possible for a common user who do not have any special knowledge on database can access the database, without knowing the schema of database and writing intricate SQL. For the reason that the information retrieval on the web has developed well to some extent, when we develop the technology of keyword search in relational database, we can draw some ideas from information retrieve. But the great differences between the text database on the web and the relational database also bring some new challenges: 1) The answer needed by user is not only one tuple in database, but the tuple sets consisting of the tuple connect from different table using the "primary key-foreign key" relationship. 2)The results of the evaluation criteria is more important, because it is directly related to the effectiveness of Search System. 3)The structure of relational database is much more intricate than text database, and the algorithms of information retrieval are not fit the relational database. So in this paper, we introduce a novel keyword search algorithm and a modified criteria of evaluating answers in order to enhance efficiency of the keyword search and return much more effective information to users, finally, the search algorithm’s performance is tested and evaluated. © Springer-Verlag Berlin Heidelberg 2008

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Ngram2vec: Learning improved word representations from ngram co-occurrence statistics

Ngram2vec: Learning improved word representations from ngram...

引用

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

作者： Zhao, Zhe Liu, Tao Li, Shen Li, Bofang Du, Xiaoyong School of Information Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Institute of Chinese Information Processing Beijing Normal University China UltraPower-BNU Joint Laboratory for Artificial Intelligence Beijing Normal University China

ISBN: (纸本)9781945626838

The existing word representation methods mostly limit their information source to word co-occurrence statistics. In this paper, we introduce ngrams into four representation methods: SGNS, GloVe, PPMI matrix, and its SVD factorization. Comprehensive experiments are conducted on word analogy and similarity tasks. The results show that improved word representations are learned from ngram co-occurrence statistics. We also demonstrate that the trained ngram representations are useful in many aspects such as finding antonyms and collocations. Besides, a novel approach of building co-occurrence matrix is proposed to alleviate the hardware burdens brought by ngrams. © 2017 Association for Computational Linguistics.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

ParaCube: A scalable OLAP model based on distributed aggregate computing with sibling cubes

ParaCube: A scalable OLAP model based on distributed aggrega...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Zhang, Yansong Wang, Shan Huang, Wei Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Department of Computer Harbin Financial College Harbin Helongjiang 150030 China

ISBN: (纸本)9780769540122

The requirements of OLAP applications increase rapidly by dramatically increased data volume, users, query volume and query complexity. The requirement for shortening update period in data warehouse is another crucial factor for a scalable OLAP application. In this paper, we propose a scalable OLAP prototype to support the query processing with increasing data volume by distributing the whole fact tuples to multiple servers to construct a set of sibling cubes which can be merged together to obtain the whole cube. We employ a light weight distribution policy with fully duplicated dimension tables in each sibling server on the observation of very low proportion of space cost for dimension tables. OLAP query with distributed aggregate functions can be transformed into queries to be performed parallel in sibling servers. For non-distributed computing aggregate functions, such as median, the optimized median aggregate computing algorithm is proposed to reduce transmission volume between servers while computing the global median values. We also present a three-level framework in data warehouse to meet the requirement of shorter update period in "operational business intelligence". An asynchronous tunnel model is proposed to reduce update latency by pre-fetching updated tuples to OLAP processing server. Finally, we set up prototype system ParaCube to evaluate performance in SN (shared-nothing) system and multi-core platforms. © 2010 IEEE.

关键词： data warehouses

来源：评论

学校读者我要写书评

暂无评论

TinyQP: A query processing system in wireless sensor networks

TinyQP: A query processing system in wireless sensor network...

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Mo, Shangfeng Chen, Hong Zhang, Xiaoying Li, Cuiping Key Laboratory of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Hunan University of Science and Technology Xiangtan 411201 China

ISBN: (纸本)9783642385612

Wireless Sensor Networks (WSNs) can be viewed as a new type of distributed databases. data management technology is one of the core technologies of WSNs. In this demo we show a Query Processing system based on TinyOS in WSNs, which is called TinyQP. TinyQP provides the in-network processing of several complex queries including real time query, historical query, event detection, aggregate query, top-k query, etc. TinyQP displays the network topology in a graphical way. TinyQP allows the user to remotely execute query commands and browse query result. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Effect factors on secondary structure of protein sequence pattern

Effect factors on secondary structure of protein sequence pa...

引用

International Workshop on Intelligent Systems and Applications

作者： Liu, Tao Li, Minghui Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China

ISBN: (纸本)9781424498574

Discovering the relationship between protein sequence pattern and protein secondary structure is important for accurately predicting secondary structure of protein sequence. A protein secondary structure pattern dictionary is constructed using protein sequence pattern and its corresponding secondary structure in this paper. Based on the constructed dictionary, we propose four effect factors on secondary structure of protein sequence pattern, including 1) the core pattern itself;2) patterns or amino acid residues that neighbor with the core pattern;3) patterns or amino acid residues that are far away from the core pattern;and 4) amino acid sequence segment that match the core pattern. Statistical measures are adopted to analyze these factors. The experimental result shows the reliability of these factors. The recognition of these effect factors presents new directions to predict protein secondary structure based on protein pattern dictionary. © 2011 IEEE.

关键词： Amino acids

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-guided Mutual Consistency Training for Semi-supervised Biomedical Relation Extraction

Uncertainty-guided Mutual Consistency Training for Semi-supe...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Mao, Bing Jia, Chang Huang, Yucheng He, Kai Wu, Jialun Gong, Tieliang Li, Chen Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China

ISBN: (纸本)9781665468190

Biomedical relation extraction seeks to automatically extract biomedical relations from biomedical text, which plays an important role in biomedical studies. However, constructing high-quality biomedical annotation data is not only time-consuming but also requires a high level of knowledge in the biomedical field. To alleviate this problem, Semi-supervised Biomedical Relation Extraction aims to extract relation facts from the limited labeled data and the more readily available unlabeled samples. Existing works can be roughly categorized as self-training methods and self-ensembling methods. The former aims to generate pseudo labels, which may lead to the gradual drift problem. The latter aims to encourage the output of one model to be consistent with the other model, where the acquisition of the model is tedious. To alleviate these issues, we propose a novel Uncertainty-Guided Mutual Consistency Training framework(UG-MCT) for semi-supervised Biomedical relation extraction. Specifically, our framework consists of two models with the same structure, which differ only when updating their weights, and then an intersecting pseudo-label mechanism is designed to convert the prediction discrepancies of the two models into mutual consistency training loss, thus promoting the consistency of model predictions. In addition, we utilize uncertainty as guided information to assist the model in focusing on the confident pseudo labels and mitigate the noise of inaccurate pseudo labeling during training. Thus, our model is very simple and efficient while mitigating the noise introduced by pseudo-labels. UG-MCT is evaluated on multiple datasets in different settings and the experimental results demonstrate that our method is highly effective in semi-supervised biomedical relation extraction compared to the state-of-the-art. © 2022 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A query-oriented summarization system for XML elements

A query-oriented summarization system for XML elements

引用

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

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

ISBN: (纸本)9780769545448

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. © 2011 IEEE.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：