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

Fog computing for vehicular Ad-hoc networks: paradigms, scenarios, and issues

The Journal of China Universities of Posts and Telecommunications 2016年第2期23卷 56-65,96页

作者： Kang Kai Wang Cong Luo Tao School of Software Engineering Beijing University of Posts and Telecommunications Key Laboratory of Trustworthy Distributed Computing and Service Beijing University of Posts Telecommunications School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts Telecommunications

Vehicular Ad-hoc networks（VANETs） are kinds of mobile Ad-hoc networks（MANETs）, which consist of mobile vehicles with on-board units（OBUs） and roadside units（RSUs）. With the rapid development of computation and communication technologies, peripheral or incremental changes in VANETs evolve into a revolution in process. Cloud computing as a solution has been deployed to satisfy vehicles in VANETs which are expected to require resources（such as computing, storage and networking）. Recently, with special requirements of mobility, location awareness, and low latency, there has been growing interest in research into the role of fog computing in VANETs. The merging of fog computing with VANETs opens an area of possibilities for applications and services on the edge of the cloud computing. Fog computing deploys highly virtualized computing and communication facilities at the proximity of mobile vehicles in VANET. Mobile vehicles in VANET can also demand services of low-latency and short-distance local connections via fog computing. This paper presents the current state of the research and future perspectives of fog computing in VANETs. Moreover, we discuss the characteristics of fog computing and services based on fog computing platform provided for VANETs. In this paper, some opportunities for challenges and issues are mentioned, related techniques that need to be considered have been discussed in the context of fog computing in VANETs. Finally, we discuss about research directions of potential future work for fog computing in VANETs. Within this article, readers can have a more thorough understanding of fog computing for VANETs and the trends in this domain.

关键词： VANET fog computing cloud computing application vehicular cloud computing

来源：评论

学校读者我要写书评

暂无评论

Grasping and folding knots

Grasping and folding knots

引用

IEEE International Conference on Robotics and Automation

作者： Weifu Wang Devin Balkcom Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781467380270

String stretched tightly along a sequence of fixed grasp points takes the shape of a polygonal arc. In this work, we investigate how many points are necessary and sufficient to grasp and tie arbitrary knots while maintaining tension, so that the string remains polygonal. This approach allows reasoning that is entirely geometric, which does not rely on potentially inaccurate dynamic models of the string or detailed knowledge of physical characteristics of the string. Algorithms are proposed to determine the contact locations, and generate the motions needed to tie arbitrary knots. This work shows that a number of grasp points that is linear in the number of crossings in a knot diagram is sufficient to immobilize string in a polygonal shape with the topology of an arbitrary knot, or to fold or unfold the knot from a straight configuration.

关键词： Grasping folding knots

来源：评论

学校读者我要写书评

暂无评论

Evolutionary community discovery in dynamic networks based on leader nodes

Evolutionary community discovery in dynamic networks based o...

引用

International Conference on Big Data and Smart computing (BIGCOMP)

作者： Wenhao Gao Wenjian Luo Chenyang Bu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China University of Science and Technology of China Hefei Anhui CN

Evolutionary community discovery is a hot research topic which clusters the dynamic or temporal network. The communities detected in dynamic network should get reasonable partition for the current data while simultaneously not deviate drastically from the previous ones. In this paper, the evolutionary community discovery algorithm based on leader nodes (EvoLeaders) is proposed to cluster the dynamic network. Compared with the static community discovery algorithm based on leader nodes (the Top Leaders algorithm), experimental results over two real-world datasets demonstrate that the EvoLeaders is more suitable for dynamic scenarios.

关键词： Heuristic algorithms Clustering algorithms Current measurement Partitioning algorithms Social network services History Merging

来源：评论

学校读者我要写书评

暂无评论

Learning with only multiple instance positive bags

Learning with only multiple instance positive bags

引用

2016 International Joint Conference on Neural Networks, IJCNN 2016

作者： Wang, Zhigang Zhao, Zengshun Zhang, Changshui Computer and Communication Engineering School Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology China Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education China College of Electronics Communication and Physics Shandong University of Science and Technology China Automation Department Tsinghua University State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology China

ISBN: (纸本)9781509006199

In traditional multiple instance learning (MIL), both positive and negative bags are required to learn a prediction function. However, a high human cost is needed to know the label of each bag - positive or negative. Only positive bags contain our focus (positive instances) while negative bags consist of noise or background (negative instances). So we do not expect to spend too much to label the negative bags. Contrary to our expectation, nearly all existing MIL methods require enough negative bags besides positive ones. In this paper we propose an algorithm called 'Positive Multiple Instance' (PMI), which learns a classifier given only a set of positive bags. So the annotation of negative bags becomes unnecessary in our method. PMI is constructed based on the assumption that the unknown positive instances in positive bags be similar each other and constitute one compact cluster in feature space and the negative instances locate outside this cluster. The experimental results demonstrate that PMI achieves the performances close to or a little worse than those of the traditional MIL algorithms on benchmark and real data sets. However, the number of training bags in PMI is reduced significantly compared with traditional MIL algorithms. © 2016 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DFTCP: A TCP-friendly delay-based high-speed TCP variant

DFTCP: A TCP-friendly delay-based high-speed TCP variant

引用

International Conference on Networking and Network Applications (NaNA)

作者： Xu Zhang Naijie Gu Junjie Su Kaixin Ren Anhui Province Key Laboratory of Computing and Communication Software Hefei China Institute of Advanced Technology University of Science and Technology of China Hefei China

Due to the conservative additive increase and multiplicative decrease strategy, traditional TCP has a severe problem in utilizing bandwidth over high-speed long-distance networks. This paper proposes a delay-based congestion control algorithm, named DFTCP, for these networks. DFTCP calculates a reasonable equilibrium point for a network flow based on the estimation of the maximum size of available buffers along its network path, and adjusts the congestion window size according to the distance between the equilibrium point and the current network state. The experimental results demonstrate that, the new algorithm performs well in terms of bandwidth utilization, intra-protocol fairness and RTT fairness, and exhibits reasonable friendliness to standard TCP.

关键词： Delays Standards Packet loss Throughput Bandwidth Convergence

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient In-Memory Paging for Smartphones

Energy-Efficient In-Memory Paging for Smartphones

引用

作者： Zhong, Kan Liu, Duo Liang, Liang Zhu, Xiao Long, Linbo Wang, Yi Sha, Edwin Hsing-Mean College of Computer Science Chongqing University Chongqing400044 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Ministry of Education Chongqing400044 China College of Communication Engineering Chongqing University Chongqing400044 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

Smartphones are becoming increasingly energy-hungry to support feature-rich applications, posing a lot of pressure on battery lifetime and making energy consumption a non-negligible issue. In particular, dynamic random access memory (DRAM)-based main memory subsystem is a major contributor to the energy consumption of mobile devices. In this paper, we propose direct read (DR). Swap, an energy-efficient in-memory paging design to reduce energy consumption in smartphones. In DR. Swap, we adopt emerging energy-efficient nonvolatile memory (NVM) and use it as the swap area. Utilizing NVMs byte-addressability, we propose DR which guarantees zero memory copy for read-only requests when accessing a page in swap area. To better understand the energy consumption of swapping, we build an energy model to analyze the energy consumption of different paging architectures. We evaluate DR. Swap based on the Google Nexus 5 smartphone, experimental results show that our technique can reduce more than 50% energy consumption compared to DRAM backed swapping. © 2015 IEEE.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

Necessary and sufficient checkpoint selection for temporal verification of high-confidence cloud workflow systems

引用

Science China(Information Sciences) 2015年第5期58卷 33-48页

作者： WANG FuTian LIU Xiao YANG Yun School of Computer Science and Technology Anhui University Shanghai Key Laboratory of Trustworthy Computing East China Normal University School of Software and Electrical Engineering Swinburne University of Technology

On-time completion is an important temporal Qo S(Quality of Service) dimension and one of the fundamental requirements for high-confidence workflow systems. In recent years, a workflow temporal verification framework, which generally consists of temporal constraint setting, temporal checkpoint selection, temporal verification, and temporal violation handling, has been the major approach for the high temporal Qo S assurance of workflow systems. Among them, effective temporal checkpoint selection, which aims to timely detect intermediate temporal violations along workflow execution plays a critical role. Therefore, temporal checkpoint selection has been a major topic and has attracted significant efforts. In this paper, we will present an overview of workflow temporal checkpoint selection for temporal verification. Specifically, we will first introduce the throughput based and response-time based temporal consistency models for business and scientific cloud workflow systems,respectively. Then the corresponding benchmarking checkpoint selection strategies that satisfy the property of"necessity and sufficiency" are presented. We also provide experimental results to demonstrate the effectiveness of our checkpoint selection strategies, and finally points out some possible future issues in this research area.

关键词： workflow system workflow temporal verification temporal checkpoint selection business workflow scientific workflow quality of se

来源：评论

学校读者我要写书评

暂无评论

Clustering time-evolving data using an efficient differential evolution 6th

Clustering time-evolving data using an efficient differentia...

引用

6th International Conference on Swarm Intelligence, ICSI 2015 held in conjunction with the 2nd BRICS Congress on Computational Intelligence, CCI 2015

作者： Chen, Gang Luo, Wenjian Anhui Province key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China HefeiAnhui China

ISBN: (纸本)9783319204659

The previous evolutionary clustering methods for time-evolving data usually adopt the temporal smoothness framework, which controls the balance between temporal noise and true concept drift of clusters. They, however, have two major drawbacks: (1) assuming a fixed number of clusters over time;(2) the penalty term may reduce the accuracy of the clustering. In this paper, a Multimodal Evolutionary Clustering (MEC) based on Differential Evolution (DE) is presented to cope with these problems. With an existing chromosome representation of the ACDE, the MEC automatically determines the cluster number at each time step. Moreover, instead of adopting the temporal smoothness framework, we try to deal with the problem from view of the multimodal optimization. That is, the species-based DE (SDE) for multimodal optimization is adopted in the MEC. Thus the MEC is a hybrid of the ACDE and the SDE, and designed for time-evolving data clustering. Experimental evaluation demonstrates the MEC achieves good results. © Springer International Publishing Switzerland 2015.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

A new private-preserving algorithm based on SMART

引用

Journal of Computers (Taiwan) 2016年第4期27卷 171-185页

作者： Han, Bowen Zhang, Zhenjiang Uden, Lorna School of Electronic and Information Engineering Key Laboratory of Communication and Information Systems Beijing Jiaotong University Beijing100044 China School of Software Engineering Key Laboratory of Communication and Information Systems Beijing Jiaotong University Beijing100044 China School of Computing FACS Staffordshire University The Octagon Beaconside StaffordSt180AD United Kingdom

Privacy is a critical issue in many WSN applications because wireless sensor networks (WSNs) are vulnerable to malicious attacks due to their characteristics. Existing hop by hop and shuffling based privacy preserving protocols does not provide an energy efficient, accurate and secure data aggregation because of the energy consuming decryption at the aggregator node. How to provide effective privacy-preserving algorithm during data aggregation is important. Our main aim is to provide an energy efficient and secure data aggregation scheme, which guarantees the privacy, authenticity and freshness of individual sensed data as well as the confidentiality, accuracy and integrity of aggregated data. This paper improved on the limitations of the SMART (Slice-Mix-AggRegaTe) algorithm, and proposes a new privacy protection algorithm for wireless sensor network (WSN). We have different operations between different nodes, bring in probabilistic segmentation, and also add the data coefficient as well as the positive and negative factors. In addition we also consider making exchange time random in the algorithm. Simulation results demonstrate that the proposed algorithm reduces the communication consumption and the data traffic, improves the precision of data aggregation and the degree of privacy-preserving to a certain extent. © 2016, Computer Society of the Republic of China. All rights reserved.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

Interactive reflection simulation via physical shading model and fast environment mapping

引用

ICIC Express Letters, Part B: Applications 2016年第2期7卷 351-356页

作者： Xu, Jie Fu, Jinhua School of Software Zhengzhou University of Light Industry China School of Computer and Communication Engineering Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute Zhengzhou China

In order to enhance realistic reflection effects on some objects and realize faster rendering to meet interactive requirements, we present a novel method to produce interactive reflection simulation using physical shading model and fast environment mapping. The physical shading model could efficiently express ambient lighting, specular lighting and diffuse lighting. Also the model is based on the microfacet distribution function, which can describe physics-based characteristics. Fast environment mapping is realized by Spherical Harmonics (SH) transformation, and the rendering equation can be rewritten as a simple dot product of SH coefficients, which fits for GPU (Graphics Processing Unit) computation. The results show that we can realize faster rendering and acquire realistic reflection effects such as glossy and mapping scene on the surface. © 2016 ICIC International.

关键词： Lighting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：