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

arXiv 2018年

作者： Yang, Bo. Li, Zhiyong Liu, Wenbin College of Information and Management Hunan University of Finance and Economics Changsha410205 China College of Computer Science and Electronic Engineering of Hunan University National Supercomputing Center in Changsha Key Laboratory for Embedded and Network Computing of Hunan Province Changsha410082 China

—Task offloading provides a promising way to enhance the capability of the mobile terminal (also called terminal user) that is distributed on network edge and communicates edge clouds with wireless. Generally, there are multiple edge cloud nodes with distinct processing capability in a geographic area, which can offer computing service for various terminal users. Furthermore, the terminal users are competitive and selfish, i.e., each user takes into account only maximizing her own profit, while conducting task offloading strategies. In this paper, we focus on the resource management optimization for edge clouds, and formulate the problem of resource competition among terminal users as a non-cooperative game, in which the terminal user who acts as the player always pursues the minimization of the expected response time for her tasks by optimizing allocation strategies. We present the utility function of the user with queuing theory, and then prove the existence of Nash equilibrium for the formulated game. Using the concept of Nash bargaining solution to calculate the optimal task offloading scheme for the user, we propose a distributed task offloading algorithm with low computation complexity. The results of simulated experiments demonstrate that our method can quickly reach the Nash equilibrium point, and deliver satisfying performance at the expected response time of the user’s tasks. Copyright © 2018, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

A high-performance CNN method for offline handwritten Chinese character recognition and visualization

arXiv

引用

arXiv 2018年

作者： Melnyk, Pavlo You, Zhiqiang Li, Keqin Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Changsha410082 China College of Computer Science and Electronic Engineering Hunan University Changsha410082 China Department of Computer Science State University of New York at New Paltz New PaltzNY12561 United States

Recent researches introduced fast, compact and efficient convolutional neural networks (CNNs) for offline handwritten Chinese character recognition (HCCR). However, many of them did not address the problem of network interpretability. We propose a new architecture of a deep CNN with high recognition performance which is capable of learning deep features for visualization. A special characteristic of our model is the bottleneck layers which enable us to retain its expressiveness while reducing the number of multiply-accumulate operations and the required storage. We introduce a modification of global weighted average pooling (GWAP) - global weighted output average pooling (GWOAP). This paper demonstrates how they allow us to calculate class activation maps (CAMs) in order to indicate the most relevant input character image regions used by our CNN to identify a certain class. Evaluating on the ICDAR-2013 offline HCCR competition dataset, we show that our model enables a relative 0.83% error reduction while having 49% fewer parameters and the same computational cost compared to the current state-of-the-art single-network method trained only on handwritten data. Our solution outperforms even recent residual learning approaches. Copyright © 2018, The Authors. All rights reserved.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A rich ranking model based on the matthew effect optimization 7th

A rich ranking model based on the matthew effect optimizatio...

引用

7th International Conference on Computational Data and Social networks, CSoNet 2018

作者： Li, Jinzhong Liu, Guanjun Department of Computer Science and Technology College of Electronic and Information Engineering Jinggangshan University Ji’an343009 China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu610054 China Department of Computer Science and Technology College of Electronic and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

ISBN: (纸本)9783030046477

Most existing approaches of learning to rank treat the effectiveness of each query equally which results in a relatively lower ratio of queries with high effectiveness (i.e. rich queries) in the produced ranking model. Such ranking models need to be further optimized to increase the number of rich queries. In this paper, queries with different effectiveness are distinguished, and the queries with higher effectiveness are given higher weights. We modify the gradient in the LambdaMART algorithm based on a new perspective of Matthew effect to highlight the optimization of the rich queries and to produce the rich ranking model, and we present a consistency theorem for the modified optimization objective. Based on the effectiveness evaluation criteria for information retrieval, we introduce the Gini coefficient, mean-variance and quantity statistics to measure the performances of the ranking models. Experimental results show that the ranking models produced by the gradient-modified LambdaMART algorithm based on Matthew effect exhibit a stronger Matthew effect compared to the original LambdaMART algorithm. © Springer Nature Switzerland AG 2018.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Schedule length minimization of parallel applications with energy consumption constraints using heuristics on heterogeneous distributed systems

Schedule length minimization of parallel applications with e...

引用

作者： Xie, Guoqi Xiao, Xiongren Li, Renfa Li, Keqin College of Computer Science and Electronic Engineering Hunan University Changsha China Key Laboratory for Embedded and Network Computing of Hunan Province Changsha China Department of Computer Science State University of New York AlbanyNY United States

Energy consumption is one of the primary design constraints in heterogeneous parallel and distributed systems ranging from small embedded devices to large-scale data centers. The problem of minimizing the schedule length of an energy consumption-constrained parallel application has been studied recently in homogeneous systems with a shared memory. To adopt the heterogeneity and distribution of high-performance computing systems, this study solves the problem of minimizing the schedule length of an energy consumption-constrained parallel application in heterogeneous distributed systems based on a dynamic voltage and frequency scaling energy-efficient design technique. The aforementioned problem is divided into 2 subproblems in this study, namely, satisfying energy consumption constraint and minimizing schedule length. The first subproblem is solved by transferring the energy consumption constraint of the application to that of each task, whereas the second subproblem is solved by heuristically scheduling each task with low time complexity. Experiments using both fast Fourier transform and Gaussian elimination parallel applications show that the actual energy consumption values do not always exceed but are close to the given energy consumption constraints. In addition, the minimum schedule lengths are generated using the proposed algorithm. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

IoT data analytics using deep learning

arXiv

引用

arXiv 2017年

作者： Xie, Xiaofeng Wu, Di Liu, Siping Li, Renfa Key Laboratory for Embedded Networking Computing of Hunan Province Hunan University

Deep learning is a popular machine learning approach which has achieved a lot of progress in all traditional machine learning areas. Internet of thing (IoT) and Smart City deployments are generating large amounts of time-series sensor data in need of analysis. Applying deep learning to these domains has been an important topic of research. The Long-Short Term Memory (LSTM) network has been proven to be well suited for dealing with and predicting important events with long intervals and delays in the time series. LTSM networks have the ability to maintain long-term memory. In an LTSM network, a stacked LSTM hidden layer also makes it possible to learn a high level temporal feature without the need of any fine tuning and preprocessing which would be required by other techniques. In this paper, we construct a long-short term memory (LSTM) recurrent neural network structure, use the normal time series training set to build the prediction model. And then we use the predicted error from the prediction model to construct a Gaussian naive Bayes model to detect whether the original sample is abnormal. This method is called LSTM-Gauss-NBayes for short. We use three real-world data sets, each of which involve long-term time-dependence or short-term time-dependence, even very weak time dependence. The experimental results show that LSTM-Gauss-NBayes is an effective and robust model. Copyright © 2017, The Authors. All rights reserved.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

The Impact of Word Segmentation on CCG-based Arabic-English SMT

The Impact of Word Segmentation on CCG-based Arabic-English ...

引用

2017 2nd International Conference on Artificial Intelligence: Techniques and Applications (AITA 2017)

作者： Hamdi Ahmed Rajeh Zhi-yong LI Al-Ghaili Mohammed College of Computer Science and Electronic Engineering Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province

This paper presents a comparative study of two approaches to statistical machine translation(SMT).We present a study on Factored Machine Translation for the Arabic–English pair of *** illustrate pre-processing step for the Arabic source language and the new factors which added to the English target *** experiments that injected English side by part-ofspeech(POS) tags,Combinatory Categorical Grammar(CCG) supertags and segmented Arabic sentences displayed a considerable progress in terms of the BLEU *** experiments gained the premier examine of the Baseline phrase-based models during two approaches,Segmented(#S1) and non-segmented(#S2).In both approaches,CCG models acquired the greatest BLEU *** results show that the segmented approach which consists of CCG produce the highest accuracy at 30.91%(1.84% superior than baseline).As shown,the results presented considerable improvement in translating the segmented Arabic rather than the non-segmented into English language.

关键词： Phrase-based translation model Combinatory Categorial Grammar Part-of-speech Factored translation model Word segmentation

来源：评论

学校读者我要写书评

暂无评论

A long lifetime,low error rate RRAM design with self-repair module

引用

Journal of Semiconductors 2016年第11期37卷 94-98页

作者：尤志强胡飞黄黎明刘鹏邝继顺李实英 Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic EngineeringHunan University

Resistive random access memory （RRAM） is one of the promising candidates for future universal memory. However, it suffers from serious error rate and endurance problems. Therefore, exploring a technical solution is greatly demanded to enhance endurance and reduce error rate. In this paper, we propose a reliable RRAM architecture that includes two reliability modules： error correction code （ECC） and self-repair modules. The ECC module is used to detect errors and decrease error rate. The self-repair module, which is proposed for the first time for RRAM, can get the information of error bits and repair wear-out cells by a repair voltage. Simulation results show that the proposed architecture can achieve lowest error rate and longest lifetime compared to previous reliable designs.

关键词： self-repair ECC RRAM memristor

来源：评论

学校读者我要写书评

暂无评论

EBCRO: Hybrid chemical reaction with employed bee operator

EBCRO: Hybrid chemical reaction with employed bee operator

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Zhiyong Li Tingkun Yuan Bo Yang Shilong Jiang Yanmei Xie College of Computer Science and Electronic Engineering of Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province Changsha China PKU-HKUST Shenzhen-Hongkong Institution Shenzhen China Hunan Vocational College of Modern Logistics Changsha China

His article proposes a new hybrid algorithm EBCRO, which combines the local search operator of chemical reaction optimization algorithm (CRO) with modified employed bee operator (EB) main part of artificial bee colony algorithm (ABC), and the introduction of probability-based selection of molecular method. This algorithm creates new solutions not only by local search operation of CRO but also mechanisms of EB. CRO is a newly, effectively swarm intelligence optimization algorithm. However, owing to random characteristics of CRO and not make use of other solutions information, its search ability and convergence speed are inefficient. EB as a part of ABC has simplicity and efficiency global search ability, but the solution is updated only by other solutions information which leading to lack of local search ability. Therefore, this paper presents EBCRO, which can balance the exploitation and exploration of algorithm of numerical function optimization. In this study, EBCRO is tested on 23 benchmark numerical functions, and the simulation results of EBCRO, CRO, orthogonal chemical reaction optimization (OCRO), hybrid particle swarm and chemical reaction optimization (HP-CRO2), and ABC showed that EBCRO outperforms other algorithms in convergence performance.

关键词： Optimization Chemicals Convergence Particle swarm optimization Linear programming Kinetic energy

来源：评论

学校读者我要写书评

暂无评论

Sequential channel selection for decentralized cognitive radio sensor network based on modified Q-Learning algorithm

Sequential channel selection for decentralized cognitive rad...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Fanzi Zeng Hanshan Liu Jisheng Xu Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Changsha China

Cognitive radio sensor network (CRSN) is a novel wireless sensor network, which can effectively alleviate the scarcity of spectrum resource by equipping the cognitive technology. Usually, CRSN deploys numerous sensor nodes around the monitoring area. But the energy and storage of those nodes are both limited. Compared with the centralized CRSN, we focus more on a decentralized situation without the control center or cluster in this paper, especially on a circumstance with few information exchanges among sensor nodes. In the case of that, our goal is to help each sensor node to find an optimal strategy of channel selection in the decentralized CRSN quickly, and then, we apply a Multi-Agent Best-Response Q-Learning algorithm based on Timesharing-Tracking Framework to sequential channel selection for the first time. The algorithm not only has a low storage cost, but also can overcome the poor convergence of strategy caused by Multi-Agent simultaneous learning. For comparison, the optimal channel assignment in centralized network, the Multi-Agent Independent Q-Learning and the Win-or-Learn-Fast Policy Hill Climbing these three algorithms are taken into account, and experimental data validates that our proposed algorithm is feasible in decentralized network.

关键词： Sensors Throughput Wireless sensor networks Convergence Algorithm design and analysis Cognitive radio Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Fairness-aware resource allocation in OFDM-based cognitive radio networks for energy efficiency

Fairness-aware resource allocation in OFDM-based cognitive r...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Fanzi Zeng Chen Liu Jisheng Xu Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Changsha China

ISBN: (纸本)9781509040940

In this paper, we presented a fairness-aware scheduling scheme in OFDM-based cognitive radio networks. Our objective is to maximize the systems energy efficiency while maintain the fairness among secondary users. In addition, many factors will be considered such as the channel quality, the interferences taken to the primary system and the total transmission power of the cognitive radio system. The resource allocation process consists of two steps. First, we use an improved heuristic algorithm to assign subcarriers to secondary users and then use an iterative algorithm to distribute power to each subcarrier. Simulation results demonstrate that our scheme is able to gain a higher level for energy efficiency and guarantee the minimum transmission requirements of secondary users.

关键词： Resource management Heuristic algorithms Interference OFDM Quality of service Cognitive radio Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：