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

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Hongzhong Wang Kun Guo Zhanghui Liu Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

This paper presents a self-training word embedding text classification model based on knowledge graph expansion for text classification. Current mixed word embedding methods are overly dependent on the Fasttext pre-training model and here is still a problem of missing words with rich semantic information are not mapped. First, we propose a method for extracting missing nouns based on shape near word filtering. Second, we design a self-training word embedding method based on knowledge graph that mixes with pre-training word embedding to obtain a high-quality mixed word vector with rich semantics and rich semantics. Third, we designed a GRU model based on improved mixed word embedding to improve the quality of text classification. Experiments conducted on multiple text classification datasets demonstrate that our methods can effectively improve the text classification accuracy.

关键词： Text categorization Context modeling Feature extraction Training Task analysis Predictive models

来源：评论

学校读者我要写书评

暂无评论

Financial Big Data Hot and Cold Separation Scheme Based on HBase and Redis

Financial Big Data Hot and Cold Separation Scheme Based on H...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Kunhui Li Kun Guo Hong Guo Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining Information Sharing Ministry of Education Fuzhou China College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

In the era of big data, HBase has been widely used in scenarios of massive unstructured data. For the financial big data, due to the integrity and timing of it, unreasonable data storage and management usually lead to hot spots that decreases the query performance. In practice, the separation of hot and cold financial data will improve data query performance and utilization rate of cluster resources. In this paper, a hot and cold data separation scheme is designed, to store infrequently queried financial data to HBase, and frequently queried one to Redis. The cold data is reasonably planned and managed through pre-partitioning and row key design for HBase. A hot data cache based on Redis is realized to improve the query speed and reduces the pressure of HBase. In addition, due to the lack of Redis's inherent cache elimination strategy, we propose a caching strategy based on the frequencies of updating and querying operations. The experimental results show that the scheme can effectively avoid the hot storage problem, and improve the query performance, and improve the cache hit ratio of Redis. Therefore, the number of cold data access requests can be effectively reduced.

关键词： Big Data Distributed databases Memory Time series analysis Stock markets

来源：评论

学校读者我要写书评

暂无评论

Relative influence maximization in competitive social networks

引用

Science China(Information Sciences) 2017年第10期60卷 252-254页

作者： Dingda YANG Xiangwen LIAO Huawei SHEN Xueqi CHENG Guolong CHEN College of Physics and Information Engineering Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Institute of Computing Technology Chinese Academy of Sciences

In many realistic scenarios,such as political election and viral marketing,two opposite opinions,i.e.,positive opinion and negative opinion,spread simultaneously in the same social networks[1,2].Consequently,to achiev... 详细信息

关键词： net RIM Relative influence maximization in competitive social networks Figure

来源：评论

学校读者我要写书评

暂无评论

Identification and Prediction of key Nucleotide Sites Using Machine Learning in Bioinformatics: A Brief Overview

Identification and Prediction of Key Nucleotide Sites Using ...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Jianhua Cai Leyi Wei Kun Zeng Guobao Xiao Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou P.R. China College of Mathematics and Computer Science Fuzhou University Fuzhou P.R. China College of Intelligence and Computing Tianjin University Tianjin P.R. China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Nowadays, the burgeon of machine learning has promoted its wide application in various fields. In Bioinformatics, machine learning computational method has become an indispensable part. Its efficiency and simplicity break the expensive and inefficient barriers of previous experimental methods. This article briefly reviews the application and development of machine learning in identifying and predicting key nucleotide sites (such as 6mA, 5mC, 4mC, etc.) in DNA or RNA. Among them, supervised learning is one of the main methods to this work. Its wide application has provided great convenience for the development of identification and prediction of key nucleotides in Bioinformatics.

关键词： Bioinformatics Feature extraction Machine learning Predictive models Computational modeling DNA Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Web server security evaluation method based on multi-source data

Web server security evaluation method based on multi-source ...

引用

International Conference on Cloud computing, Big Data and Blockchain (ICCBB)

作者： Kedong Wu Xiaoling Gao Yanhua Liu Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian Fujian Fuzhou Fujian China

ISBN: (纸本)9781728112787

Traditional web security assessments are evaluated using a single data source, and the results of the calculations from different data sources are different. Based on multi-source data, this paper uses Analytic Hierarchy Process to construct an evaluation model, calculates the weight of each level of indicators in the web security evaluation model, analyzes and processes the data, calculates the host security threat assessment values at various levels, and visualizes the evaluation results through ECharts+WebGL technology.

关键词： Security Servers IP networks XML Information processing Data models Safety

来源：评论

学校读者我要写书评

暂无评论

Parallel Multi-Label Propagation Based on Influence Model and Its Application to Overlapping Community Discovery

Parallel Multi-Label Propagation Based on Influence Model an...

引用

作者： Qiu, Qirong Guo, Wenzhong Chen, Yuzhong Guo, Kun Li, Rongrong School of Economics and Management Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China College of Mathematics and Computer Science Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350116 China

Finding communities in networks is one of the challenging issues in complex network research. We have to deal with very large networks that contain billions of vertices, which makes community discovery a computationally intensive work. Moreover, communities usually overlap each other, which greatly increases the difficulty of identifying the boundaries of communities. In this paper, we propose a parallel multi-label propagation algorithm (PMLPA) that enhances traditional multi-label propagation algorithm (MLPA) in two ways. First, the critical steps of MLPA are parallelized based on the MapReduce model to get higher scalability. Second, new label updating strategy is used to automatically determine the most valuable labels of each vertex. Furthermore, we study the improvement of PMLPA through considering the influence of vertices and labels on label updating. In this way, the importance of each label can be described with higher precision. Experiments on artificial and real networks prove that the proposed algorithms can achieve both high discovering accuracy and high scalability. © 2017 World Scientific Publishing Company.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Community Detection Algorithm Based on Parallel Incremental Related Vertices 2

A Dynamic Community Detection Algorithm Based on Parallel In...

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Guohui Li Kun Guo YuZhong Chen Ling Wu Danhong Zhu College of Mathematics and Computer Sciences Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing(Fuzhou University) Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education

ISBN: (纸本)9781509036202

One of the traditional ways for detecting dynamic communities is to find the communities at each interval through the static community detection ***,it usually leads to high computation *** this paper,a novel algorithm based on the Map Reduce model and the label propagation progress with the strategy of incremental related vertices is proposed,which is called PLPIRV(Parallel Label Propagation and Incremental Related Vertices).Based on the communities found at the previous interval,the new algorithm adjusts the communities the incremental related vertices belong *** clustering of the whole network can be avoided by incrementally analyzing the variation of the networks,so that the time cost can be greatly *** on artificial and real datasets show that the proposed algorithm performs well on dynamic community detection.

关键词： dynamic community detection parallel computation incremental algorithm label propagation

来源：评论

学校读者我要写书评

暂无评论

SPESC: A Specification Language for Smart Contracts

SPESC: A Specification Language for Smart Contracts

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Xiao He Bohan Qin Yan Zhu Xing Chen Yi Liu School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China National Computer Network Emergency Response Technical Team Coordination Center of China

ISBN: (纸本)9781538626672

The smart contract is an interdisciplinary concept that concerns business, finance, contract law and information technology. Designing and developing a smart contract may require the close cooperation of many experts coming from different fields. How to support such collaborative development is a challenging problem in blockchain-oriented software engineering. This paper proposes SPESC, a specification language for smart contracts, which can define the specification of a smart contract for the purpose of collaborative design. SPESC can specify a smart contract in a similar form to real-world contracts using a natural-language-like grammar, in which the obligations and rights of parties and the transaction rules of cryptocurrencies are clearly defined. The preliminary study results demonstrated that SPESC can be easily learned and understood by both IT and non-IT users and thus has greater potential to facilitate collaborative smart contract development.

关键词： Contracts Cryptography Contract law Syntactics Collaboration Software

来源：评论

学校读者我要写书评

暂无评论

Online optimization scheduling for scientific workflows with deadline constraint on hybrid clouds

Online optimization scheduling for scientific workflows with...

引用

作者： Lin, Bing Guo, Wenzhong Lin, Xiuyan School of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China

The tremendous parallel computing ability of cloud computing encourages investigators to research its drawbacks and advantages on processing large-scale scientific applications such as workflows. The current cloud market is composed of numerous diverse public clouds and a local private cloud, and workflow scheduling is one of the biggest challenges on hybrid clouds due to the highly fragmented cloud market with respect to service provisions, pricing models, and bandwidths. In this paper, we propose an online-scheduling strategy for continuous submitted scientific workflows on hybrid clouds, which aims to complete the deadline-constrained applications as more as possible at a lower price. Firstly, a hierarchical iterative application partition (HIAP) algorithm is proposed to partition the application into a set of dependent tasks. Moreover, many online-scheduling algorithms cooperated with HIAP are presented to finish the workflows with a low average payment. Our strategy takes into account the basic characteristics on hybrid clouds such as bandwidth constraints, data transfer cost and computational cost. Various well-known workflows are used for evaluating the multiple scheduling algorithms and the results show that the MLF_ID approach can achieve a promising performance. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

A method of off-line signature verification for digital forensics

A method of off-line signature verification for digital fore...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Weiwei Pan Guolong Chen College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

Signature verification is an important part of digital forensics. In order to solve the shortcomings of manual identification in technical accuracy and subjectivity, this paper proposed an off-line signature identification method based on Support Vector Machine (SVM). A powerful feature set is collected by extracting grid features and global features of a signature picture. The method is applied for identifying different writing systems and the highest correct probability of identification arrives at 100%. The results indicated that the method is workable and can be an effectively technical support for digital forensics.

关键词： Feature extraction Support vector machines Training Kernel Digital forensics Forgery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：