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

作者： Wen, Yaole Hu, Fuyuan Ren, Jinchang Shang, Xinru Li, Linyan Xi, Xuefeng School of Electronic & Information Engineering Suzhou University of Science and Technology SuzhouJiangsu215009 China Centre for Signal and Image Processing University of Strathclyde Glasgow United Kingdom Suzhou Institute of Trade & Commerce SuzhouJiangsu215009 China Virtual Reality Key Laboratory of Intelligent Interaction and Application Technology of Suzhou Suzhou University of Science and Technology SuzhouJiangsu215009 China Suzhou Key Laboratory for Big Data and Information Service Suzhou University of Science and Technology SuzhouJiangsu215009 China

Instance segmentation requires both pixel-level classification accuracy and high-level semantic features at the target instance level, which is very challenging, and the cascade structure can effectively improve both of these problems. To make full use of the relationship between detection and segmentation, this paper proposes a joint multi-tasking cascade structure, which is not simply to cascade the two tasks of detection and segmentation, but to unitedly put them into multi-stage processing, and especially to integrate the information at different stages of the mask branch. The entire structure can effectively utilize the superior characteristics of each stage in the matter of detection and segmentation, thus improving the quality of mask prediction. The feature fusion process is introduced in the full convolution networks (FCN) branch, and the high-level and low-level features are effectively fused to enhance the contextual information of the picture semantic features. The experiments demonstrate the better results on the COCO dataset. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Software Defect Prediction via Deep Belief Network

引用

Chinese Journal of Electronics 2019年第5期28卷 925-932页

作者： WEI Hua SHAN Chun HU Changzhen ZHANG Yu YU Xiao School of Computer Science and Technology Beijing Institute of Technology China Information Technology Security Evaluation Center Beijing Key Laboratory of Software Security Engineering Technology Beijing Institute of Technology School of Electrical and Information Engineering and Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture State Key Laboratory in China for Geomechanics and Deep Underground Engineering (Beijing) China University of Mining and Technology School of Computer Science and Technology Shandong University of Technology

Defect distribution prediction is a meaningful topic because software defects are the fundamental cause of many attacks and data loss. Building accurate prediction models can help developers find bugs and prioritize their testing efforts. Previous researches focus on exploring different machine learning algorithms based on the features that encode the characteristics of *** problem of data redundancy exists in software defect data set, which has great influence on prediction *** propose a defect distribution prediction model(Deep belief network prediction model, DBNPM), a system for detecting whether a program module contains defects. The key insight of DBNPM is Deep belief network(DBN)technology, which is an effective deep learning technique in image processing and natural language processing,whose features are similar to defects in source *** results show that DBNPM can efficiently extract and process the data characteristics of source program and the performance is better than Support vector machine(SVM), Locally linear embedding SVM(LLE-SVM), and Neighborhood preserving embedding SVM(NPE-SVM).

关键词： Defect prediction Software security Deep belief network(DBN)

来源：评论

学校读者我要写书评

暂无评论

Server load prediction algorithm based on CM-MC for cloud systems

引用

Journal of Systems Engineering and Electronics 2018年第5期29卷 1069-1078页

作者： XU Xiaolong ZHANG Qitong MOU Yiqi LU Xinyuan Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications State Key Laboratory of Information Security Chinese Academy of Sciences Shanghai Stock Exchange Technology Co. LtdShanghai Stock Exchange Institute of Big Data Research at Yancheng Nanjing University of Posts and Telecommunications

Accurate prediction of server load is important to cloud systems for improving the resource utilization, reducing the energy consumption and guaranteeing the quality of service(QoS).This paper analyzes the features of cloud server load and the advantages and disadvantages of typical server load prediction algorithms, integrates the cloud model(CM) and the Markov chain(MC) together to realize a new CM-MC algorithm, and then proposes a new server load prediction algorithm based on CM-MC for cloud systems. The algorithm utilizes the historical data sample training method of the cloud model, and utilizes the Markov prediction theory to obtain the membership degree vector, based on which the weighted sum of the predicted values is used for the cloud model. The experiments show that the proposed prediction algorithm has higher prediction accuracy than other typical server load prediction algorithms, especially if the data has significant volatility. The proposed server load prediction algorithm based on CM-MC is suitable for cloud systems, and can help to reduce the energy consumption of cloud data centers.

关键词： cloud computing load prediction cloud model Markov chain energy saving

来源：评论

学校读者我要写书评

暂无评论

CBLNER: A Multi-models Biomedical Named Entity Recognition System Based on Machine Learning 1

引用

15th International Conference on intelligent Computing, ICIC 2019

作者： Lejun, Gong Xiaolin, Liu Xuemin, Yang Lipeng, Zhang Yao, Jia Ronggen, Yang Jiangsu Key Lab of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Faculty Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing211169 China

ISBN: (数字)9783030269692

ISBN: (纸本)9783030269685

Biomedical named entities is fundamental recognition task in biomedical text mining. This paper developed a system for identifying biomedical entities with four models including CRF, LSTM, Bi-LSTM and BiLSTM-CRF. The system achieved the following performance in test data Genia V3.02: CRF with an F score of 75.91%, LSTM with an F score of 71.69%, BiLSTM with a F score of 74.37%, BiLSTM-CRF with a F score of 76.81%. Experimental results show the performance of BiLSTM-CRF model is better than other three models. Compared with CRF model, Bi-LSTM-CRF model has better recognition effect for biological entities in long text and entities that modified by modifiers. Therefore, CBLNER system lays a foundation for further relationship and event extraction, and could also provide reference for entity recognition research in other fields. © 2019, Springer Nature Switzerland AG.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Improving the Efficiency of Blockchain Applications with Smart Contract based Cyber-insurance

Improving the Efficiency of Blockchain Applications with Sma...

引用

IEEE International Conference on Communications (ICC)

作者： Jia Xu Yongqi Wu Xiapu Luo Dejun Yang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Department of Computing The Hong Kong Polytechnic University Hongkong China Department of Computer Science Colorado School of Mines Golden USA

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

Blockchain based applications benefit from decentralization, data privacy, and anonymity. However, they may suffer from inefficiency due to underlying blockchain. In this paper, we aim to address this limitation while still enjoying the privacy and anonymity. Taking the blockchain based crowdsourcing system as an example, we propose a new smart contract based cyber-insurance framework, which can greatly shorten the delay, and enable the workers to obtain the economic compensation for increased security risk caused by a conflict between the need to provide service quickly and delay in payment. We model the process of determining insurance premium and number of confirmations as a Stackelberg Game and prove the existence of Stackelberg Equilibria, at which the utility of the requester is maximized, and none of the workers can improve its utility by unilaterally deviating from its current strategy. The experimental results show that our framework can definitely improve the time efficiency of crowdsourcing. Particularly, it takes on average only 33% of the time required by the naive blockchain based crowdsouring solution for time-sensitive cases.

关键词： Contracts Crowdsourcing Task analysis Insurance Bitcoin

来源：评论

学校读者我要写书评

暂无评论

A Social-Aware Mode Selection Algorithm for D2D Communications

A Social-Aware Mode Selection Algorithm for D2D Communicatio...

引用

International Conference on Communications, Signal processing, and Systems, CSPS 2018

作者： Lu, Wei-feng Lin, Wei-jun Chen, Si-guang Yang, Li-jun School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China College of IoT Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China

ISBN: (纸本)9789811362637

Aiming at mode selection in D2D communication, a mode selection strategy based on social-aware was proposed. In addition to physical connection status, users’ social relationships also served as an observation element. Through relationship between users, the closeness of user relationship can be judged, and then through users’ reference, the similarity between users can be obtained. In this way, by combining physical connection with social relationships, users’ aggregate utility was acquired. According to the physical connection quality and the social relationship strength, taking maximizing users’ aggregate utility as the goal, a random algorithm was designed to match users. Simulation results show that mode selection based on social perception can effectively improve users’ aggregate utility. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

Temporal data fusion at the edge

Temporal data fusion at the edge

引用

2019 IEEE International Conferences on Ubiquitous Computing and Communications and data Science and Computational Intelligence and Smart Computing, Networking and Services, IUCC/DSCI/SmartCNS 2019

作者： Yang, Linfu Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728152097

As an enabler technique, data fusion has gained great attention in the context of Internet of things (IoT). In traditional settings, data fusion is done at the cloud server. So the data to be fused should be transferred from the sensor nodes to the cloud server before data fusion. Such an application mode of data fusion inherits disturbing concerns from the cloud computing framework, e.g., privacy-leaking, large latency between data capture and computation, excessive ingress bandwidth consumption. We take into account how to do temporal data fusion at the edge to bypass the above issues. We present a Gaussian process based temporal data fusion (GPTDF) method targeted for the problem of sequential online prediction at the edge. The GPTDF method fits the edge computing framework and thus inherits desirable properties from edge computing, such as privacy-preserving, low latency between data capture and computation, and tiny bandwidth consumption. Through a real-data experiment using archived traffic datasets from the Caltrans Performance Measurement System (PeMS), we demonstrate that the application of GPTDF can provide more timely and accurate real-time predictions at the network edge. © 2019 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Multi-Granularity Power Prediction for data Center Operations via Long Short-Term Memory Network

Multi-Granularity Power Prediction for Data Center Operation...

引用

IEEE International Conference on big data and Cloud Computing (BdCloud)

作者： Ziyu Shen Xusheng Zhang Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

The increasing numbers of the applications and requirement of cloud computing have made huge power consumption in data centers, which brings the problems of the high cost and resource waste. This problem attracts significant attention from academia and industry. A critical approach to solve this problem is constructing an intelligent energy management system for data centers. Furthermore, an efficient assessment and prediction module of power consumption in data centers is an essential part of the management system. It facilitates cloud service providers to perform workflow scheduling at the minimal cost and energy efficiency management with the requirement of QoS. Since the assessment and prediction of power consumption correlate, this paper presents a multi-granularity approach for power consumption prediction in data centers, which combines multi-task learning with the LSTM network. We first transfer a multi-granularity power prediction problem into a multi-task regression problem to assess and predict the power consumption of data center system maintenance and scheduling operations. Due to the time requirement for workflow and container scheduling, the prediction interval is 30 seconds. Then we propose an efficient long short-term memory network for the multigranularity prediction. The experimental results show our model outperforms other prediction models on the real datasets.

关键词： Power demand data centers Task analysis Predictive models data models Time series analysis Servers

来源：评论

学校读者我要写书评

暂无评论

CROA: A content-based recommendation optimization algorithm for personalized knowledge services 21

CROA: A content-based recommendation optimization algorithm ...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Sun, Xiao Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Information explosion is a typical feature of the big data. Learners can easily find a wide variety of knowledge information online. However, the expansion of information also makes it difficult for learners to retrieve the information they want and fall into the problem of knowledge overload. In order to solve this problem effectively, we propose a content-based recommendation optimization algorithm for personalized knowledge services (CROA). First, the feature vector model is established, where each item information is represented by specific words and key information is highlighted by weighting. Second, a dynamic user vector model is then established to capture the latest preference information of the user. Finally, the feature vector model is combined with the multi-user comparison results thereby obtaining a list of recommendations. Experimental results indicate that CROA outstands in knowledge recommendation mechanism and can also alleviate knowledge overload. © 2019 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

An optimal profit route planning scheme based on ACO-OPP 21

An optimal profit route planning scheme based on ACO-OPP

引用

作者： Qiu, Yuhua Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Taxi plays an important role of urban public transportation system. However, without appropriate route planning scheme, taxi drivers can only choose to wait or seek passengers in the absence of orders, leading to wasting a lot of time and fuel. In this paper, an optimal profit route planning scheme for taxi drivers with Ant Colony Optimization Algorithm based on Optimal Profit Points (ACO-OPP) is proposed. First, the taxi trajectory data are preprocessed and the pick-up and drop-off points are extracted to obtain high-quality data;second, the data spatiotemporal distribution is analyzed to plan a more appropriate and rational route;the clustering algorithm is used to obtain the optimal profit points to increase the occupancy rate of taxis;then, ACO-OPP is utilized to plan the profit routes for each taxi. A series of experiments are implemented based on the real taxi trajectory dataset to test and compare the performance of the simulated annealing algorithm, the genetic algorithm, the ant colony algorithm and ACO-OPP on the optimal route length and the profitability with the unit time profit function. The experimental results show that ACO-OPP has the shortest optimal route length and the best profit per unit time. © 2019 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：