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

International Asia-Pacific Web Conference (APWEB)

作者： Xiao Zhang Xiaoyong Du Jinchuan Chen Shan Wang Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores and manages the ever-growing unstructured data by introducing a novel technique called free-table, which is a conceptual view for end-users and a physical entity maintained by transactional storage manager of BUD. Free-table is cell-oriented but not column-oriented as relational table. It can store various types of unstructured data in cell with different versions. Additionally, we study two cases, VMP and PXRDB, to show that our proposal is feasible and tractable.

关键词： data models Conference management knowledge management engineering management data engineering Proposals Maintenance engineering knowledge engineering data mining Relational databases

来源：评论

学校读者我要写书评

暂无评论

CITE: Compact Interactive TransformEr for Multilingual Image Captioning 23

CITE: Compact Interactive TransformEr for Multilingual Image...

引用

6th International Conference on Image and Graphics Processing, ICIGP 2023

作者： Xu, Yueyuan Hu, Zhenzhen Zhou, Yuanen Hao, Shijie Hong, Richang Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei University of Technology China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China

ISBN: (纸本)9781450398572

Current state-of-the-art image captioning models generate captions in a single language, requiring a combination of multiple language specific models to build a multilingual image captioning system. However, as the number of supported languages increases, it leads to the parameters of the multilingual image captioning system grow linearly. To tackle this issue, we propose a single Compact Interactive TransformEr (CITE) model, which can describe an image in multiple languages simultaneously, making the captioning system more compact. Specifically, based on the standard Transformer model, we share the encoder and decoder backbone parameters and replace the self-attention sub-layer in the decoder with the interactive attention sub-layer. In addition, we extend the traditional monolingual reinforcement learning mechanism to a multilingual version to promote better description generation. Due to the wide use of Chinese and English, we evaluate the performance of our CITE model by simultaneously generating English and Chinese captions. We expand the image captions of the whole MSCOCO dataset and release a COCO-EN-CN dataset. Extensive experiments on the COCO-EN-CN dataset show that our single CITE model with more parameter-efficient can maintain the competitive performance or even better than the monolingual captioning models. © 2023 ACM.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

The Second-order h-type Indicators for Identifying Top Units

引用

data and Information Management 2018年第1期2卷 49-56页

作者： Ye, Fred Y. Bornmann, Lutz School of Information Management Nanjing University 210023 Nanjing China Jiangsu Key Laboratory of Data Engineering and Knowledge Service 210023 Nanjing China Administrative Headquarters of the Max Planck Society Division for Science and Innovation Studies Hofgartenstr. 8 D-80539 Munich Germany

The second-order h-type indicators are suggested to identify top units in scientometrics. Basically, the re-ranking of h-type series leads to the second-order h-type indicator. The second-order h-type indicators provide an interesting and natural method to identify top units, yielding fixed h-top. Differentiating from the series of artificially defined highly cited percentile classes, the h-top contributes a natural definite top in the series of highly cited classes. When studying theoretically, the second-order h-index concerns 3% of the h-top whereas the first-order h-index refers to 10% of the h-core. The ratio of the first- and second-order h-index, hT/h, is 30%. When studying empirically, the ratio of the first- and second-order h-index, hT/h, is © 2018 © 2018 Fred Y. Ye, Lutz Bornmann, published by Sciendo

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Security Analysis Model, System Architecture and Relational Model of Enterprise Cloud Services

引用

International Journal of Automation and computing 2016年第6期13卷 574-584页

作者： Dang-Dang Niu Lei Liu Xin Zhang Shuai Lu Zhuang Li College of Computer Science and Technology Jilin University Changchun 130012 China Data Center Consolidation (Beijing) Industrial and Commercial Bank of China Beijing 100096 China College of Mathematics Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Cloud computing is one of the fastest growing and popular computer technologies, and there are more and more enterprise services based on the cloud computing. In order to save costs, more and more enterprises and their employees have hired the enterprise cloud services, and put much important information in the cloud gradually. Cloud service systems have become the main targets of malicious attacks. However, the cloud computing technologies are still not perfect, and the management and maintenance of enterprise cloud services are more complex compared to traditional network services of cloud computing. So, enterprise cloud services are more likely to encounter some security problems, and the influenced scale of these security problems is broad. But there are few researches on the security of enterprise cloud services. In this paper, we analyze the software as a service（Saa S） enterprise cloud services and introduce the research status of security problems in cloud computing environment. Combining with the analysis of the characteristics and application architecture of Saa S enterprise cloud services, we propose the security problems analysis model, the analysis system architecture and the relational model. Our researches can support further research of the automatic generation of solutions and guide the deployment of security policies of Saa S enterprise cloud services.

关键词： cloud deployment perfect maintenance likely users bases encounter relational costs

来源：评论

学校读者我要写书评

暂无评论

Assisted Diagnostic Learning Based on Concept Lattice

Assisted Diagnostic Learning Based on Concept Lattice

引用

2021 International Conference on Signal Processing and Communication Technology, SPCT 2021

作者： Shen, Xiajiong Li, Xingchen Han, Daojun Zhang, Yanfeng Henan Key Laboratory of Big Data Analysis and Processing Henan Univ. HA Kaifeng475004 China School of Computer and Information Engineering Henan Univ. HA Kaifeng475004 China Institute of Data and Knowledge Engineering Henan Univ. HA Kaifeng475004 China

ISBN: (数字)9781510653344

ISBN: (纸本)9781510653337

With the continuous development of education, online education is becoming more and more popular with learners because of its convenience. However, online education has the problem of insufficient interaction with students. Students still need to rely on the students themselves to judge the lack of knowledge in practice tasks, which will greatly affect the learning efficiency. In this paper, we propose a method based on formal concept analysis to analyze the knowledge that may not be mastered, and a method of intensive practice for students. First of all, establishing the formal context of student error test questions, construct the concept lattice to calculate the degree of importance of the knowledge concept that may not be mastered, judge the student's mastery of the knowledge concept, and give feedback. Secondly, construct the concept lattice of the unpractised test set, and calculate the similarity of the concept extension set that meets the threshold, find similar topics and push them, and realize targeted training for students who have not mastered the knowledge concepts. © 2022 SPIE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

MapReduce-Based SimRank Computation and Its Application in Social Recommender System

MapReduce-Based SimRank Computation and Its Application in S...

引用

IEEE International Conference on Services Economics (SE)

作者： Lina Li Cuiping Li Hong Chen Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

Recently there has been a lot of interest in graph-based analysis, with examples including social network analysis, recommendation systems, document classification and clustering, and so on. A graph is an abstraction that naturally captures data objects as well as relationships among those objects. Objects are represented as nodes and relationships are represented as edges in the graph. There are many cases in which similarities among nodes are required to compute. SimRank is one of the simple and intuitive algorithms for this purpose. It is rigidly based on the random walk theorem. Existing methods on SimRank computation suffer from one limitation: the computing cost can be very high in practice. In order to optimize the computation of SimRank, a few techniques have been proposed. However, the performance of these methods are still limited by the processing ability of the single computer. Ideally, we would like to develop new parallel solutions that can offer improved processing power to compute SimRank on large data set. In this paper, we propose parallel algorithms for SimRank computation on Map-Reduce framework, and more specifically its open source implementation, Hadoop. Two different parallel methods are proposed and their performances are evaluated and compared. Furthermore, we employ the proposed methods to do the similarity computation in order to recommend appropriate products to users in social recommender systems.

关键词： Computers Iterative methods Recommender systems Computational modeling Parallel processing Equations Sorting

来源：评论

学校读者我要写书评

暂无评论

High-Quality Noise Detection for knowledge Graph Embedding with Rule-Based Triple Confidence 18th

High-Quality Noise Detection for Knowledge Graph Embedding w...

引用

18th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2021

作者： Hong, Yan Bu, Chenyang Wu, Xindong Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Mininglamp Academy of Sciences Mininglamp Technology Beijing China

ISBN: (纸本)9783030891879

knowledge representation learning is usually used in knowledge reasoning and other related fields. Its goal is to use low-dimensional vectors to represent the entities and relations in a knowledge graph. In the process of automatic knowledge graph construction, the complexity of unstructured text and the incorrect text may make automatic construction tools unable to accurately obtain the semantic information in the text. This leads to high-quality noise with matched entity types but semantic errors. Currently knowledge representation learning methods assume that the knowledge in knowledge graphs is completely correct, and ignore the noise data generated in the process of automatic construction of knowledge graphs, resulting in errors in the vector representation of entities and relations. In order to reduce the negative impact of noise data on the construction of a representation learning model, in this study, a high-quality noise detection method with rule information is proposed. Based on the semantic association between triples in the same rule, we propose the concept of rule-based triple confidence. The calculation strategy of triple confidence is designed inspired by probabilistic soft logic (PSL). The influence of high-quality noise data in the training process of the model can be weakened by this confidence. Experiments show the effectiveness of the proposed method in dealing with high-quality noise. © 2021, Springer Nature Switzerland AG.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Fast & scalable distributed set similarity joins for big data analytics 33

Fast & scalable distributed set similarity joins for big dat...

引用

33rd IEEE International Conference on data engineering, ICDE 2017

作者： Rong, Chuitian Lin, Chunbin Silva, Yasin N. Wang, Jianguo Lu, Wei Du, Xiaoyong Tianjin Polytechnic University China Arizona State University United States University of California San Diego United States Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China

ISBN: (纸本)9781509065431

Set similarity join is an essential operation in big data analytics, e.g., data integration and data cleaning, that finds similar pairs from two collections of sets. To cope with the increasing scale of the data, distributed algorithms are called for to support large-scale set similarity joins. Multiple techniques have been proposed to perform similarity joins using MapReduce in recent years. These techniques, however, usually produce huge amounts of duplicates in order to perform parallel processing successfully as MapReduce is a shared-nothing framework. The large number of duplicates incurs on both large shuffle cost and unnecessary computation cost, which significantly decrease the performance. Moreover, these approaches do not provide a load balancing guarantee, which results in a skewness problem and negatively affects the scalability properties of these techniques. To address these problems, in this paper, we propose a duplicate free framework, called FS-Join, to perform set similarity joins efficiently by utilizing an innovative vertical partitioning technique. FS-Join employs three powerful filtering methods to prune dissimilar string pairs without computing their similarity scores. To further improve the performance and scalability, FS-Join integrates horizontal partitioning. Experimental results on three real datasets show that FS-Join outperforms the state-of-Theart methods by one order of magnitude on average, which demonstrates the good scalability and performance qualities of the proposed technique. © 2017 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Generalized Unique Game Problem

引用

Journal of Computational Information Systems 2012年第16期8卷 6551-6557页

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

In this paper, the author defines Generalized Unique Game Problem (GUGP), where weights of the edges are allowed to be negative. Two special types of GUGP are illuminated, GUGP-NWA, where the weights of all edges are negative, and GUGP-PWT (ρ), where the total weight of all edges are positive and the negative-positive ratio is at most ρ. The author investigates the counterpart of the Unique Game Conjecture on GUGP-PWT (ρ). The author shows that Unique Game Conjecture on GUGP-PWT (1) holds true, and Unique Game Conjecture on GUGP-PWT (1=2) holds true, if the 2-to-1 Conjecture holds true. The author poses an open problem whether Unique Game Conjecture holds true on GUGP-PWT (ρ) with 0 < ρ < 1. © 2012 Binary Information Press.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Throughput-oriented associated transaction assignment in sharding blockchains for IoT social data storage

引用

Digital Communications and Networks 2022年第6期8卷 885-899页

作者： Liping Tao Yang Lu Xu Ding Yuqi Fan Jung Yoon Kim School of Computer Science and Information Engineering Hefei University of TechnologyHefei230009China Engineering Research Center of Safety Critical Industrial Measurement and Control Technology Ministry of EducationHefei University of TechnologyHefei230009China Institute of Industry&Equipment Technology Hefei University of TechnologyHefei230009China Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230009China Graduate School of Game Gachon UniversitySeongnam-Si461-701South Korea

Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.

关键词： IoT social data Blockchain Shar ding Associated transactions Transaction assi gnment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：