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

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Xiaoyan Hu Jian Gong School of Computer Science and Engineering Southeast University Jiangsu provincial computer network technology key laboratory

Named Data Networking (NDN) featuring in-network caching capability is a large effort that exemplifies information-centric approach to networking by shifting emphasis from hosts to data so as to meet growing demand on content. This work explores a scheme that enables a NDN domain to make full use of its in-network caches to enhance its performance, availability, and reliability. Currently, each NDN router independently determines what contents to cache and is unaware of content cached in nearby routers and thus their caches are not utilized in an efficient way. This paper proposes to have routers in a NDN domain share cached data and coordinate to make caching decisions (which is dubbed in-network cooperative caching) and formulates it into a constrained optimization problem. The Lagrangian relaxation and primal-dual decomposition method is applied to decompose the optimization problem into object placement subproblems and object locating subproblems, each of which can be solved in a distributed manner at each router, such that the in-network cooperative caching is addressed in a distributed way. Our simulation results, although preliminary, suggest that our scheme can benefit users, Internet Service Providers (ISPs) as well as content servers, and the improvement can be as much as 88% compared to current NDN caching policy.

关键词： In-network caching Named data networking Cooperative caching Lagrangian relaxation

来源：评论

学校读者我要写书评

暂无评论

MOVE: A mobile personalized virtual computing environment

MOVE: A mobile personalized virtual computing environment

引用

作者： Bai, Yuebin Ju, Yanwen Beijing Key Laboratory of Network Technology School of Computer Science and Engineering Beihang University Beijing 100191 China Sci. and Technol. on Information Transmission and Dissemination in Communication Networks Laboratory Shijiazhuang 050081 China

In today's business and daily life, computers and networks are playing an increasingly important role both in the office and at home. It is desirable to individuals that any machines outside the workplace provide a uniform and consistent desktop computing environment. This paper proposes a system called a mobile personalized virtual computing environment (MOVE), which aims to present users with their own uniformly consistent desktop computing environmentincluding customized software, personal data and other utilitieson any computers attached to the network and to make local computing resources in their familiar workplaces accessible to this computer, enabling users working anywhere to be as if they were at their own familiar workplace without the constraints of mobility and geographical location. A virtual-machine-based method for the MOVE is proposed, and a distributed virtual disk is discussed to be the storage system for the MOVE. With the network facility equipped with a network of virtual machines and a virtual private network, private network resources in users' familiar workplaces can be accessible to the virtual computing environment. © 2011 Elsevier B.V. All rights reserved.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Tele-AR system based on real-time camera tracking

Tele-AR system based on real-time camera tracking

引用

2012 International Conference on Virtual Reality and Visualization, ICVRV 2012

作者： Wang, Yanke Zhong, Fan Li, Chao Xiang, Hui Peng, Qunsheng Qin, Xueying School of Computer Science and Technology Shandong University Jinan China Shandong Provincial Key Laboratory of Network Based Intelligent Computing Jinan China State Key Lab. of CAD and CG Zhejiang University Hangzhou China

ISBN: (纸本)9780769548364

We propose a visual tele-AR system, which is a combination of tele-existence and AR techniques. By wearing a video see-through HMD and moving his head, a user in this system is able to tele-operate a remote pan-tilt platform to observe the remote scene. Unlike traditional tele-existence systems which use mechanical or magnetic sensors for tele-operation, we propose a novel tele-operation method based on real-time tracking of master and slave cameras. The master camera is a component of the video see-through HMD mounted in front of user's eyes, while the slave camera is carried by a remote platform. We estimate use's head motion by tracking the master camera in real time, and translate head motions into motion commands to drive the remote pan-tilt platform. Ideally, motion of the remote platform will be exactly the same as user's head. Unfortunately, motion speed of the slave platform is usually limited by their mechanical capability, which may cause pose inconsistence between master and slave cameras, especially when user's head moves fast. We solve this problem by also tracking slave camera in real time, and warping video images according to difference between master and slave camera pose. Since slave camera is tracked, we can integrate virtual objects into remote scene, giving the user an augmented visual sense. To reduce system delay, our implementation is accelerated GPU parallel computation. Experimental results show the efficiency and robustness of our method. © 2012 IEEE.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

A Push/Pull scheduling algorithm in P2P VoD

A Push/Pull scheduling algorithm in P2P VoD

引用

International Conference on computer science and Network technology (ICCSNT)

作者： Yanqin Zhu Jianjun Bian Qijin Ji School of Computer Science and Technology Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

ISBN: (纸本)9781467329637

Video-on-Demand (VoD), which is an important application in peer-to-peer (P2P) networks, attracts a lot of researchers' interest at present. Data scheduling is significant in P2P VoD applications to gain desirable user experience and better satisfaction. In unstructured mesh-based overlay, peers in the overlay learn about the chunks availability from neighbors using Buffer Map. The peer can only know the information of its neighbors and is not aware of other peers. So some peers (busy peer) could get a lot of requests and other peers(free peers) receive fewer requests. The busy peer usually ignores the surplus requests and the peers that send these ignored requests will request the chunk again after the timeout. At the same time, the free peers can't effectively utilize the upload bandwidth. In this paper, we propose a hybrid Push/Pull algorithm in P2P VoD. Simulation results shows that the average utilization of upload bandwidth and average playback quality may be improved efficiently.

关键词： P2P VoD Data scheduling Unstructured mesh-based overlay Push/pusll scheduling algorithm Peers P2RY4 gene peer to peer file sharing Overlay Uploading Time out

来源：评论

学校读者我要写书评

暂无评论

Lowering error floors of irregular LDPC codes by combining construction and decoding

Lowering error floors of irregular LDPC codes by combining c...

引用

作者： Jiao, Xiaopeng Mu, Jianjun Fang, Fan Sun, Rong School of Computer Science and Technology Xidian University Xi'an 710071 China Key Laboratory of Information Coding and Transmission Southwest Jiaotong University Chengdu 610031 China State Key Laboratory of Integrated Service Networks Xidian University Xi'an 710071 China

Irregular low-density parity-check (LDPC) codes generally have good decoding performance in the waterfall region, but they exhibit higher error floors than regular ones. In this letter, we present a hybrid method, which combines code construction and the iterative decoding algorithm, to tackle this problem. Simulation results show that the proposed scheme decreases the error floor significantly for irregular LDPC codes over binary-input additive white Gaussian noise (BIAWGN) channel. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Gaussian noise (electronic)

来源：评论

学校读者我要写书评

暂无评论

Study of medium access control protocol based on adaptive backoff window in wireless sensor network

Study of medium access control protocol based on adaptive ba...

引用

2012 International Symposium on Information Technologies in Medicine and Education, ITME 2012

作者： Qi, Lin Duan, Huichuan Xun, Jiao School of Information Science and Engineering Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Shandong Normal University Jinan China Basic Education Department Shandong Normal University Jinan China

ISBN: (纸本)9781467321068

Wireless sensor networks have been widely used in many areas, and the network channel allocation depends on the Medium Access Control (MAC) protocol, so, it is critical to the performance of wireless sensor networks (WSN). A new MAC protocol (R-MAC protocol) is proposed by combining two thoughts of adaptive backoff window and forecasting data flow according to the node's length of queue based on the sensor MAC(S-MAC). And simulation results indicate that R-MAC is suited to dynamic network traffic conditions and is superior to S-MAC in energy consumption, throughput and delay in star and mesh network. © 2012 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Deadlock prevention method for locomotive transportation dispatching system based on petri nets

Deadlock prevention method for locomotive transportation dis...

引用

International Conference on Automatic Control and Artificial Intelligence, ACAI 2012

作者： Lu, Yang Fang, Huan Wei, Zhen Xu, Wei School of Computer and Information Heifei Univerisity of Technology Hefei 230009 China College of Science Anhui Univerisity of Science and Technology Huainan 232001 China Anhui Provincial Key Laboratory of Mine IoT Mine Safety Supervisory Control Hefei 230088 China

ISBN: (纸本)9781849195379

As for the deadlock prevention problem of locomotive dispatching system, an improved dispatching rule is proposed based on former related work firstly. Then, the method of deadlock prevention based on Petri Nets for transporting dispatching system is studied. An offline deadlock prevention algorithm is presented by tabular method, by which the maximum number N of locomotives that can accommodate in the dispatching system can be calculated. Lastly, through constructing the resource allocation model based on Petri nets, the correctness of deadlock prevention algorithm is proved, and the necessary and sufficient condition for deadlock-free control of the dispatching system is verified. This approach that combining modelling and deadlock-free control is easy to implement and can be embedded into the real-time scheduler for developing large monitoring system software in future.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Study on event correlation analysis in evidence chain structure

Study on event correlation analysis in evidence chain struct...

引用

2012 International Symposium on Information Technologies in Medicine and Education, ITME 2012

作者： Liu, Dong Wei, Yong-Qing School of Information Science and Engineering Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Shandong Normal University Jinan China Basic Education Department Shandong Police College Jinan China

ISBN: (纸本)9781467321068

computer forensics has limitations in representation formalism of the electronic evidence and data missing. A method in construction of electronic evidence chain was proposed on the basis of the study and analysis of event correlation, and it makes use of Bayesian network inference algorithm, which analysis of causal relationship of the events to deal with the missing data. This method to consider the interaction between evidence events and sequence relationship, it realizes formalization of the electronic evidence and reduces data redundancy in evidence analysis, which strengthens the pertinence of data process and evidence analysis, forensics system becomes more perfect. © 2012 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Application research of WebSocket technology on web tree component

Application research of WebSocket technology on web tree com...

引用

2012 International Symposium on Information Technologies in Medicine and Education, ITME 2012

作者： Jiang, Feng-Yan Duan, Hui-Chuan School of Information Science and Engineering Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Shandong Normal University Jinan China Basic Education Department Shandong Normal University Jinan China

ISBN: (纸本)9781467321068

In the development of information systems, Web tree component is an important way to show information, provide a convenient and intuitive information queries, which has become one of the essential features in the information system. At present, Web tree component still has a series of problems in communication efficiency, displaying and updating rate, etc. This paper uses MyEclipse and MySql as development tools to design and implement web tree component based on WebSocket, the component can display and update tree structure dynamicly, Theory analysis and experimental results show that the improved scheme provides a better user experience, comparing with the previous traditional long polling based on AJAX technology, it effectively reduces the amount of data transmission, communication overhead, etc. © 2012 IEEE.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

A new one-bit diFFerence collision attack on HAVAL-128

引用

science China(Information sciences) 2012年第11期55卷 2521-2529页

作者： ZHANG WenYing1,2,3,LI YanYan1 & WU Lei1 1school of Information science and Engineering,Shandong Normal University,Jinan 250014,China 2State key Lab of Information Security,Institute of Information Engineering,Chinese Academy of sciences,Beijing 100093,China 3Shandong provincial key laboratory for Novel Distributed computer Software technology,Jinan 250014,China 1. School of Information Science and Engineering Shandong Normal University Jinan 250014 China2. State Key Lab of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China3. Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 250014 China

In this paper,we give a new fast attack on *** attack includes many present methods of constructing hash ***,we present a neighborhood *** propose a new difference path different from the previous *** conclusion is that,when the output of each step satisfies our condition,the message m can collide with m'= m + Δm,where Δm =(0,0,0,0,231,0,...,0).There is only one bit difference between m and m'.Two pairs of collision examples for HAVAL-128 are *** order to improve the probability of collision,we use four tricks of message *** attack's running time is less than 225.83 2-pass HAVAL computations,which is the best result for one-bit collision of HAVAL so far.

关键词： cryptography hash function HAVAL-128 collision message modification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：