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

24th International Conference on Pattern Recognition, ICPR 2018

作者： Cheng, Xi Li, Xiang Yang, Jian Tai, Ying Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

ISBN: (纸本)9781538637890;9781538637883

Single image super resolution is a very important computer vision task, with a wide range of applications. In recent years, the depth of the super-resolution model has been constantly increasing, but with a small increase in performance, it has brought a huge amount of computation and memory consumption. In this work, in order to make the super resolution models more effective, we proposed a novel single image super resolution method via recursive squeeze and excitation networks (SESR). By introducing the squeeze and excitation module, our SESR can model the interdependencies and relationships between channels and that makes our model more efficiency. In addition, the recursive structure and progressive reconstruction method in our model minimized the layers and parameters and enabled SESR to simultaneously train multi-scale super resolution in a single model. After evaluating on four benchmark test sets, our model is proved to be above the state-of-the-art methods in terms of speed and accuracy. © 2018 IEEE.

关键词： recursive networks squeeze and excitation super resolution

来源：评论

学校读者我要写书评

暂无评论

A Resource Matching Algorithm for Dynamic Multi-Homing Service Environment 2

A Resource Matching Algorithm for Dynamic Multi-Homing Servi...

引用

2nd IEEE Advanced information Management, Communicates, Electronic and Automation Control Conference, IMCEC 2018

作者： Zhang, Hui Liu, Shu Nanjing University of Posts and Telecommunications Jiangsu Key Lab of Wireless Communications Nanjing China National Engineering Research Center of Communications and Networking Nanjing University of Posts and Telecommunications Nanjing210003 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou215006 China

ISBN: (纸本)9781538618035

T43 paper investigates the matching problem between radio resources and multi-homing services in a dynamic heterogeneous wireless environment. A mobile terminal (MT) with multi-homing service simultaneously transmits data to multiple radio access networks using multiple air interfaces. We develop an energy efficient resource matching algorithm for statistically guaranteeing the transmission rate of each MT with the minimum power consumption. Firstly, aided with the resource matching conception and the dynamic characteristics of wireless channels, we propose a matching probability metric to construct resource matching model for maximizing energy efficiency of all MTs subject to statistical guarantee requirements, and simplify the dynamic channels characteristic based on matching theory. Secondly, we propose a two-level distributed matching algorithm (TLDMA), with inner minimum power consumption and outer maximum matching probability, which realizes joint optimal allocation of bandwidth, transmission power and rate. Simulation results show that TLDMA outperforms conventional algorithms in terms of wireless resources management. © 2018 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Node Scheduling Algorithm Based on Grid for Wireless Sensor Networks

Node Scheduling Algorithm Based on Grid for Wireless Sensor ...

引用

International Conference on Communication technology (ICCT)

作者： Kun Zhang Jing Chen Chong Shen Yu Chen Keliu Long Bhatti Uzair Aslam Education Center of MTA Hainan Tropical Ocean University Sanya Hainan China College of Computer Science and Technology Hainan Tropical Ocean University Sanya Hainan China State Key Laboratory of Marine Resources Utilization in South China Sea Hainan University Haikou Hainan China College of Computer Science and Information Technology Nanjing Normal University Nanjing Jiangsu China

How to reduce the energy consumption of the network and extend the life cycle of the wireless sensor network is one of the hotspots in the research of wireless sensor network. In the premise of ensuring the coverage of network, the node scheduling algorithm that let redundant nodes turn into the sleep state is a very effective energy-saving measure. In this paper, a node scheduling mechanism based on grid is proposed. The mechanism calculates the weight of each node in each grid, and then determine whether the node is a redundant coverage node. The result of Matlab simulation shows that the mechanism can effectively prolong the survival time of network.

关键词： Wireless sensor networks Energy consumption Redundancy Scheduling algorithms Mathematical model Data models Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

MIMO Scheduling Effectiveness Analysis for Bursty Data Service from View of QoE

引用

Chinese Journal of Electronics 2017年第5期26卷 1079-1085页

作者： CHEN Lei JIANG Dingde BAO Rong XIONG Jiping LIU Fuqiang BEI Lulu Jiangsu Province Key Laboratory of Intelligent Industry Control Technology Xuzhou University of Technology School of Computer Science and Engineering Northeastern University College of Mathematics Physics and Information EngineeringZhejiang Normal University College of Electronics and Information Engineering Tongji University

In the user selection phrase of the conventional Multiple-input-multiple-output(MIMO) scheduling schemes,the frequent user exchange deteriorates the Quality of user experience(Qo E) of the bursty data *** the channel vector orthogonalization computation results in a high time *** address these problems,we propose an inertial scheduling policy to reduce the number of noneffective user exchange,and substitute self-organization policy for channel vector orthogonalization computation to reduce computational *** relationship between the scheduling effectiveness and the inertia of objective function is observed in the *** simulation results show that the inertial scheduling policy effectively reduce the number of potential noneffective scheduling which is inversely proportional to the Mean opinion score(MOS)that quantifies the Qo *** proposed scheduling scheme provides significant improvement in Qo E performance in the *** the proposed scheduling scheme does not consider the channel vector orthogonalization in the user selection phrase,its throughput approaches the level of the throughput-oriented scheme because of its selforganization scheduling policy.

关键词： Bursty data service Multiple-inputmultiple-output(MIMO) Quality of user experience(QoE) Time perception

来源：评论

学校读者我要写书评

暂无评论

Analysis of the fluid approximation of stochastic process algebra models

Analysis of the fluid approximation of stochastic process al...

引用

Chinese Intelligent Systems Conference, CISC 2017

作者： Ding, Jie Chen, Xiao Zhu, Xinshan School of Information Engineering Yangzhou University Yangzhou225127 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China School of Computer Science and Communication Engineering Jiangsu University Zhenjiang212013 China School of Electrical and Information Engineering Tianjin University Tianjin300072 China

ISBN: (纸本)9789811064951

With the advent of the Internet of Things (IoT) as a major force of change in industry, Cyber Physical Systems (CPS) is right for building the concept smart Environment. In CPS, the internal computational and physical elements generally interact, reflect and influence each other in order to obtain and analyze human behaviors and their social activities, finally to help them facilitate experiences. Nevertheless, the system complexity and scale become challenges of discrete state modelling formalisms especially in the capability issue. For the stochastic process algebra, performance evaluation process algebra (PEPA), a fluid approximation approach dealing with this problem has been developed, which approximates the continuous time Markov chain underlying a model using ordinary differential equations (ODEs). This paper establishes some basic properties for the ODE based approximation, e.g., uniqueness, existence and boundedness of ODE solutions. Our research in particular presents a convergence of the solutions for nonsynchronised models. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

information-centric networking routing challenges and Bio/ACO-inspired solution: A review 9th

Information-centric networking routing challenges and Bio/AC...

引用

9th International Conference on Swarm Intelligence, ICSI 2018

作者： Zhang, Qingyi Wang, Xingwei Huang, Min Lv, Jianhui School of Computer Science and Engineering Northeastern University Shenyang China College of Software Northeastern University Shenyang China State Key Laboratory of Synthetical Automation for Process Industries School of Information Science and Engineering Northeastern University Shenyang China Central Research Institute Network Technology Laboratory Huawei Technologies Co. Ltd Shenzhen China

ISBN: (纸本)9783319938141

information-Centric Networking (ICN) aims to distribute and retrieve the content by name. In this paper, we review and approve the feasible Ant Colony Optimization (ACO)-inspired ICN routing solutions, i.e., applying ACO to solve ICN routing problem. At first, some significant challenges with respect to ICN routing are analyzed, such as explosive increasing of Forwarding information Base (FIB), retrieval of closest content copy, uniform distribution of content and mobility support. Then, the solutions inspired by biology feature and behavior is reviewed. In addition, a general design thought of ACO-inspired solution is presented. Finally, the feasibility of ACO-inspired ICN routing solution is evaluated. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Recent Advances on Neural Headline Generation

引用

Journal of computer Science & technology 2017年第4期32卷 768-784页

作者： Ayana Shi-Qi Shen Yan-Kai Lin Cun-Chao Tu Yu Zhao Zhi-Yuan Liu Mao-Song Sun Department of Computer Science and Technology Tsinghua University Beijing 100084 China State Key Laboratory of Intelligent Technology and Systems Tsinqhua University Beijinq 100084 China Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing 100083 China Department of Computer Information Management Inner Mongolia University of Finance and Economics Hohhot 010000 China Jiangsu Collaborative Innovation Center for Language Ability Jiangsu Normal University Xuzhou 221009 China

Recently, neural models have been proposed for headline generation by learning to map documents to headlines with recurrent neural network. In this work, we give a detailed introduction and comparison of existing work and recent improvements in neural headline generation, with particular attention on how encoders, decoders and neural model training strategies alter the overall performance of the headline generation system. Furthermore, we perform quantitative analysis of most existing neural headline generation systems and summarize several key factors that impact the performance of headline generation systems. Meanwhile, we carry on detailed error analysis to typical neural headline generation systems in order to gain more comprehension. Our results and conclusions are hoped to benefit future research studies.

关键词： neural network headline generation data analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Non-Decomposable Evaluation Metrics for NeuralMachine Translation

引用

Journal of computer Science & technology 2017年第4期32卷 796-804页

作者： Shi-Qi Shen Yang Liu Mao-Song Sun Department of Computer Science and Technology Tsinghua University Beijing 100084 China State Key Laboratory of Intelligent Technology and Systems Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing 100084 China Jiangsu Collaborative Innovation Center for Language Ability Jiangsu Normal University Xuzhou 221009 China

While optimizing model parameters with respect to evaluation metrics has recently proven to benefit end to-end neural machine translation (NMT), the evaluation metrics used in the training are restricted to be defined at the sentence level to facilitate online learning algorithms. This is undesirable because the final evaluation metrics used in the testing phase are usually non-decomposable (i.e., they are defined at the corpus level and cannot be expressed as the sum of sentence-level metrics). To minimize the discrepancy between the training and the testing, we propose to extend the minimum risk training (MRT) algorithm to take non-decomposable corpus-level evaluation metrics into consideration while still keeping the advantages of online training. This can be done by calculating corpus-level evaluation metrics on a subset of training data at each step in online training. Experiments on Chinese-English and English-French translation show that our approach improves the correlation between training and testing and significantly outperforms the MRT algorithm using decomposable evaluation metrics.

关键词： neural machine translation training criterion non-decomposable evaluation metric

来源：评论

学校读者我要写书评

暂无评论

Correction:Adaptive optical quantitative phase imaging based on annular illumination Fourier ptychographic microscopy

引用

PhotoniX 2022年第1期3卷 73-73页

作者： Yefeng Shu Jiasong Sun Jiaming Lyu Yao Fan Ning Zhou Ran Ye Guoan Zheng Qian Chen Chao Zuo Smart Computational Imaging Laboratory(SCILab) School of Electronic and Optical EngineeringNanjing University of Science and Technolog210094 NanjingJiangsu ProvincePeople’s Republic of China Smart Computational Imaging Research Institute(SCIRI)of Nanjing University of Science and Technology 210019 NanjingJiangsu ProvincePeople’s Republic of China Jiangsu Key Laboratory of Spectral Imaging Intelligent Sense 210094 NanjingJiangsu ProvincePeople’s Republic of China Terahertz Technology Innovation Research Institute University of Shanghai for Science and Technology200093 ShanghaiPeople’s Republic of China School of Computer and Electronic Information Nanjing Normal University210023 NanjingJiangsu ProvincePeople’s Republic of China Department of Biomedical Engineering University of ConnecticutStorrsConnecticut 06269USA.

In the original publication of this article[1],the video in the additional file 2 was uploaded mistakenly due to a typesetting error,and needs to be updated with the correct *** original article[1]was updated.

关键词： illumination annular phase

来源：评论

学校读者我要写书评

暂无评论

Multisource multisink optimal evacuation routing with dynamic network changes: A geometric algebra approach

Multisource multisink optimal evacuation routing with dynami...

引用

作者： Yu, Zhaoyuan Li, Dongshuang Zhu, Shuai Luo, Wen Hu, Yong Yuan, Lingwang Key Laboratory of Virtual Geographic Environment MOE Nanjing Normal University Nanjing210023 China Nanjing210023 China Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application Nanjing China Department of Computer Science and Technology Nanjing Normal University Nanjing210023 China

In this paper, we introduced geometric algebra to develop a new multisource multisink optimal evacuation route planning method. A dynamically updatable data structure and a matrix-based greedy searching algorithm were developed to support the dynamic evacuation route searching for multiple evacuees. Unlike most existing methods, which iteratively search the optimal path for each evacuee, our method can search all the possible evacuation routes synchronously. The dynamic updating of the network topography, weights, and constraints during the route searching is direct and flexible, thus can support the evacuation in dynamic cases. The method is demonstrated and tested by an evacuation case in the city of Changzhou, China. The simulation experiments suggest that the method can well support the dynamic route searching in large scales with dynamic weight changes. Copyright © 2017 John Wiley & Sons, Ltd.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：