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

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Chen, Chen Dong, Chao Wu, Fan Wang, Hai Peng, Laixian Nie, Jingnan Institute of Communications Engineering P.L.A. University of Science and Technology China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781467304375;9781467304368

Unsegmented network coding was incorporated into opportunistic routing to improve inefficient schedule of segmented network coding due to delayed feedback. However, most unsegmented network coding schemes fail to constrain the size of decoding window. Large decoding window not only challenges limited computational ability and decoding memory in practical environments, but also introduces large decoding delay, which is undesirable in delay sensitive applications. In this paper, we prove that the possibility of unacceptably large decoding window is innegligible, and verify the necessity of handling decoding window. To solve the issue, we argue that the number of unknown packets injected into the network must be strictly constrained at the source. Based on the idea, we improve unsegmented network coding scheme for opportunistic routing. Simulation results shows that the solution is robust to losses. In addition, to achieve optimal throughput, the redundancy factor should be selected larger than the reciprocal of end-to-end delivery ratio.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Dynamic bandwidth allocation& guarantee for virtualized networks in cloud

Dynamic bandwidth allocation& guarantee for virtualized netw...

引用

International Conference on Information, Communications and Signal Processing

作者： Xuan Luo Pengfei Zhang Tong Ye Yaohui Jin Jianping Wang Network and Information Center Shanghai Jiaotong University State Key Laboratory of Advanced Optical Communication Systems & Networks Shanghai Jiaotong University Department of Computer Science City University of Hong Kong

ISBN: (纸本)9781479904327

Among all SLAs(Service Level Agreements) about network resources in the cloud, a critical problem would be achieving bandwidth guarantee under all communication environment (e.g., when misbehaved VMs exist) while keeping acceptable bandwidth utility and system scalability. In this paper, we present an architecture of dynamic bandwidth allocation and guarantee on resource fairness, to provide network performance isolation and protocol independent bandwidth guarantees. In this paper, we first discuss the business model of bandwidth guarantee for Infrastructure-as-a-Service (IaaS) cloud, and a bandwidth allocation algorithm based on redefined fairness model is proposed and realized under the novel architecture, and finally experiment shows satisfying results under various communication scenarios.

关键词： Bandwidth Switches Protocols Integrated circuits

来源：评论

学校读者我要写书评

暂无评论

Accountable authority key policy attribute-based encryption

引用

science China(Information sciences) 2012年第7期55卷 1631-1638页

作者： WANG YongTao 1,2 ,CHEN KeFei 1,3 ,LONG Yu 1,4 & LIU ZhaoHui 2 1 department of computer science and Engineering,shanghai Jiao Tong University,shanghai 200240,China 2 China Information Technology Security Evaluation Center,Beijing 100085,China 3 shanghai key laboratory of scalable computing and systems,shanghai Jiao Tong University,shanghai,200240,China 4 State key laboratory of Information Security,Graduate School of Chinese Academy of sciences,100039,China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China China Information Technology Security Evaluation Center Beijing China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China State Key Laboratory of Information Security Graduate School of Chinese Academy of Sciences Beijing China

We present an accountable authority key policy attribute-based encryption (A-KPABE) *** this paper,we extend Goyal's work to key policy attribute-based encryption *** first generalize the notion of accountable authority in key policy attribute-based encryption scenario,and then give a *** addition,our scheme is shown to be secure in the standard model under the modified Bilinear Decisional Diffie-Hellman (mBDDH) assumption.

关键词： accountable authority key policy attribute-based encryption standard model access structure

来源：评论

学校读者我要写书评

暂无评论

key-frame extraction for video captured by smart phones

Key-frame extraction for video captured by smart phones

引用

IEEE International Conference on Robotics and Biomimetics

作者： Shuangshuang Ji Huaping Liu Bin Wang Fuchun Sun School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai China Department of Computer Science and Technology State Key Laboratory of Intelligent Technology and Systems Beijing P.R.China Beijing Baidu Netcom Science Technology Co. Ltd

ISBN: (纸本)9781479927456

In this paper, the key-frame extraction for video clips which are captured by smart phones are investigated. A weighted temporal consistent fuzzy clustering technology is used to cluster the video frames. The image-level feature and the orientation information are combined into the feature vector and the accelerate values are used to determine the weight. Such a method sufficiently exploits the spatio-temporal characterizes of the video clips captured by smart phones. The algorithm is implemented in a Sumsung Nexus S smart phone and we make an extensive experimental validation.

关键词： Smart phones Accelerometers Feature extraction Intelligent sensors Acceleration Vectors

来源：评论

学校读者我要写书评

暂无评论

High availability through output continuity

High availability through output continuity

引用

2012 IEEE International Conference on Cluster computing Workshops, Cluster Workshops 2012

作者： Ye, Wei Dong, Yaozu Ma, Ruhui Liang, Alei Guan, Haibing Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Intel China Software Center Shanghai 200241 China

ISBN: (纸本)9780768548449

Virtual machine (VM) based state machine approaches, i.e. VM replication, provide high availability without source code modifications, unfortunately, existing VM replication approaches suffer from excessive replication overheads. On the other hand, machine state replication is an overly strong (and therefore less efficient) requirement for high availability in the networked client-server system. In this paper, we propose a generic and highly efficient high availability solution through output continuity. Output continuity considers a backup server as a valid replica as long as the responses generated so far are the same between the backup and primary servers, the server state is propagated from the primary server to the backup server if and only if the previous outputs from the backup and primary servers are different. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Sparse probabilistic relational projection 26

Sparse probabilistic relational projection

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Li, Wu-Jun Yeung, Dit-Yan Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9781577355687

Probabilistic relational PCA (PRPCA) can learn a projection matrix to perform dimensionality reduction for relational data. However, the results learned by PRPCA lack interpretability because each principal component is a linear combination of all the original variables. In this paper, we propose a novel model, called sparse probabilistic relational projection (SPRP), to learn a sparse projection matrix for relational dimensionality reduction. The sparsity in SPRP is achieved by imposing on the projection matrix a sparsity-inducing prior such as the Laplace prior or Jeffreys prior. We propose an expectation-maximization (EM) algorithm to learn the parameters of SPRP. Compared with PRPCA, the sparsity in SPRP not only makes the results more interpretable but also makes the projection operation much more efficient without compromising its accuracy. All these are verified by experiments conducted on several real applications. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Workload-aware opportunistic routing in multi-channel, multi-radio wireless mesh networks

Workload-aware opportunistic routing in multi-channel, multi...

引用

2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012

作者： Wu, Fan Vaidya, Nitin Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University China ECE Coordinated Science Lab University of Illinois Urbana-Champaign United States

ISBN: (纸本)9781467319058

Opportunistic routing emerged as a novel technique to cope with the problem of highly unpredictable and lossy wireless channels in urban wireless mesh networks. However, existing opportunistic routing protocols only consider single-radio wireless nodes, and assume that all the nodes work on the same channel, without exploiting possible concurrent transmissions by multi-radio nodes over orthogonal channels provided by IEEE 802.11 protocols. Examples show that simply integrating existing channel assignment schemes and the opportunistic routing technique may not achieve satisfactory system performance. In this paper, we present WACA, which is a Workload-Aware Channel Assignment algorithm for opportunistic routing in multi-channel, multi-radio wireless mesh networks. Evaluation results show that WACA always achieves highest average throughput among the evaluated algorithms, and its median throughput is at least 16.1% higher than the compared ones. © 2012 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

A Generic Construction of Proxy Signatures from Certificateless Signatures

A Generic Construction of Proxy Signatures from Certificatel...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Lei Zhang Qianhong Wu Bo Qin Josep Domingo-Ferrer Peng Zeng Jianwei Liu Ruiying Du Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Tarragona Spain Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University China Department of Maths School of Science Xi'an University of Technology China School of Electronic and Information Engineering Beijing University of Aeronautics and Astronautics China

The primitive of proxy signatures allows the original signer to delegate proxy signers to sign on messages on behalf of the original signer. It has found numerous applications in distributed computing scenarios where delegation of signing rights is common. Certificate less public key cryptography eliminates the complicated certificates in traditional public key cryptosystems without suffering from the key escrow problem in identity-based public key cryptography. In this paper, we reveal the relationship between the two important primitives of proxy signatures and certificate less signatures and present a generic conversion from the latter to the former. Following the generic transformation, we propose an efficient proxy signature scheme with a recent certificate less signature scheme.

关键词： Artificial intelligence Bismuth Games Public key cryptography Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A fully abstract view for local cause semantics

A fully abstract view for local cause semantics

引用

7th International Conference on Advances in Grid and Pervasive computing, GPC 2012

作者： Xue, Jianxin Dong, Xiaoju Department of Computer Science MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9783642307669

Recent technological trends have pushed concurrency and mobile computing to the mainstream. Too many semantics have been proposed to picture the behavior of concurrent systems, and their relationship has been a hot topic in concurrency. We aim in this paper to bridge two important concurrent semantics, the true concurrency semantics and the interleaving semantics, based on the local cause semantics, in the framework of mobile computing. We enrich the polyadic π-calculus with the local cause semantics, and present a fully abstract, finiteness-respecting encoding from the local cause polyadic π-calculus to the polyadic π-calculus. Therefore, the local cause bisimulation is reduced to the observation bisimulation. Moreover, a new decidable approach is proposed for the local cause bisimulation on finite processes. © 2012 Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An ant colony system algorithm for the problem of server consolidation in virtualized data centers

引用

Journal of Computational Information systems 2012年第16期8卷 6631-6640页

作者： Gao, Yongqiang Guan, Haibing Qi, Zhengwei Wang, Bin Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China

The problem of server sprawl is common in today's data centers. Virtualization-based server consolidation is a vital mechanism to solve the server sprawl problem in modern data centers by consolidating multiple virtualized servers onto a few physical servers leading to improved resource utilization. In this paper we propose an ant colony optimization metaheuristic to solve the problem of server consolidation in virtualized data centers. For evaluating the proposed algorithm we apply it to ten classes of instances proposed in the literature, and compare the results to three competing algorithms including a first-fit decreasing (FFD) algorithm, a genetic algorithm, and a max-min ant system algorithm. The results show that the algorithm proposed in this paper is an effective and efficient methodology to solve the problem of server consolidation in virtualized data centers. © 2012 Binary Information Press.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：