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

28th AAAI Conference on Artificial Intelligence, AAAI 2014

作者： Zhang, Jiajia Wang, Xuan Yao, Lin Li, Jingpeng Shen, Xuedong Intelligence Computing Research Center Harbin Institute of Technology Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application China Intelligence Computing Research Center Harbin Institute of Technology Public Service Platform of Mobile Internet Application Security Industry China School of Electronics Engineering and Computer Science Peking University China C302 HIT Campus Shenzhen University Town NanShan District XiLi Shenzhen518055 China IER Building Soutn Area Shenzhen High-Tech Industrial Park Shenzhen518055 China

ISBN: (纸本)9781577356653

Opponent modeling is an essential approach for building competitive computer agents in imperfect information games. This paper presents a novel approach to develop opp onent modeling techniques. The approach applies neural networks which are separately trained on different datasct to build K- model clustering opponent models. KullbackL eibler (KL) divergence is used to exploit a safety mode on opponent modeling. Given a parameter d that controls the max divergence between a model's centre point and the units belong to it, the approach is proved to provide a lower bound of expected payoff which is above the minimax payo ff for correctly clustered players. Even for the players that are incorrectly clustered, the lower bound can also be unlimi ted approximated with sufficient history data, In our experi ments, agent with the novel model shows an improved class ification efficiency of opponent modeling comparing with relative researches. And also, the new agent performs better when playing against poker agent HITSZ-CS-13 which participate Annual computer Poker Competition of 2013. © Copyright 2014. Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： computer games

来源：评论

学校读者我要写书评

暂无评论

Practical distributed signatures in the standard model

引用

2014 Conference on Cryptographer's Track at the RSA, CT-RSA 2014

作者： Wang, Yujue Wong, Duncan S. Wu, Qianhong Chow, Sherman S. M. Qin, Bo Liu, Jianwei Key Laboratory of Aerospace Information Security and Trusted Computing School of Computer Wuhan University China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong School of Electronics and Information Engineering Beihang University China Department of Information Engineering Chinese University of Hong Kong Hong Kong Hong Kong School of Information Renmin University of China Beijing China

ISBN: (纸本)9783319048512

A distributed signature scheme allows participants in a qualified set to jointly generate a signature which cannot be forged even when all the unqualified participants collude together. In this paper, we propose an efficient scheme for any monotone access structure and show its unforgeability and robustness under the computational Diffie-Hellman (CDH) assumption in the standard model. For 112-bit security, its secret key shares and signature fragments are as short as 255 bits and 510 bits, which are shorter than existing schemes assuming random oracle. We then propose two extensions. The first one allows new participants to dynamically join the system without any help from the dealer. The second one supports a type of multipartite access structures, where the participant set is divided into multiple disjoint groups, and each group is bounded so that a distributed signature cannot be generated unless a pre-defined number of participants from multiple groups work together. © 2014 Springer International Publishing.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Parallelization Using Task Parallel Library with Task-Based Programming Model

Parallelization Using Task Parallel Library with Task-Based ...

引用

2014 IEEE 5th International Conference on Software engineering and Service Science

作者： Xinhong Hei Jinlong Zhang Bin Wang Haiyan Jin Nasser Giacaman Department of Electrical and Computer Engineering The University of Auckland Auckland New Zealand School of Computer Science and Engineering Xi’an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology

In order to reduce the complexity of traditional multithreaded parallel programming,this paper explores a new task-based parallel programming using the *** Task Parallel Library（TPL）.Firstly,this paper proposes a custom data partitioning optimization method to achieve an efficient data parallelism,and applies it to the matrix *** result of the application supports the custom data partitioning optimization *** we develop a task parallel application:Image Blender,and this application explains the efficiency and pitfall aspects associated with task ***,the paper analyzes the performance of our *** results show that TPL can dramatically alleviate programmer burden and boost the performance of programs with its taskbased parallel programming mechanism.

关键词： Parallel programming Task-based TPL Data parallelism Task parallelism

来源：评论

学校读者我要写书评

暂无评论

Parallelization using task parallel library with task-based programming model

Parallelization using task parallel library with task-based ...

引用

IEEE International Conference on Software engineering and Service Sciences (ICSESS)

作者： Xinhong Hei Jinlong Zhang Bin Wang Haiyan Jin Nasser Giacaman School of Computer Science and Engineering Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an Shaanxi Province China Department of Electrical and Computer Engineering The University of Auckland Auckland New Zealand

ISBN: (纸本)9781479932801

In order to reduce the complexity of traditional multithreaded parallel programming, this paper explores a new task-based parallel programming using the Microsoft .NET Task Parallel Library (TPL). Firstly, this paper proposes a custom data partitioning optimization method to achieve an efficient data parallelism, and applies it to the matrix multiplication. The result of the application supports the custom data partitioning optimization method. Then we develop a task parallel application: Image Blender, and this application explains the efficiency and pitfall aspects associated with task parallelism. Finally, the paper analyzes the performance of our applications. Experiments results show that TPL can dramatically alleviate programmer burden and boost the performance of programs with its task-based parallel programming mechanism.

关键词： Parallel processing Parallel programming Instruction sets Computational modeling Data models Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Utilizing the dropped packets for data delivery in VANETs

引用

The Journal of China Universities of Posts and Telecommunications 2013年第3期20卷 48-52页

作者： SONG Chao LIU Ming GONG Hai-gang CHEN Gui-hai CAO Jian-nong School of Computer Science and Engineering University of Electronic Science and Technology of China School of Computer Science and Engineering Shanghai Jiao Tong University Internet and Mobile Computing Laboratory Department of Computing Hong Kong Polytechnic University

Timely and cost-efficient multi-hop data delivery among vehicles is essential for vehicular ad-hoc networks （VANETs）, and various routing protocols are envisioned for infrastructure-less vehicle-to-vehicle （V2V） communications. Generally, when a packet （or a duplicate） is delivered out of the routing path, it will be dropped. However, we observe that these packets （or duplicates） may also be delivered much faster than the packets delivered along the original routing path. In this paper, we propose a novel tree based routing scheme （TBRS） for ultilizing the dropped packets in VANETs. In TBRS, the packet is delivered along a routing tree with the destination as its root. And when the packet is delivered out its routing tree, it won＇t be dropt immediately and will be delivered for a while if it can arrive at another branch of the tree. We conduct the extensive simulations to evaluate the performance of TBRS based on the road map of a real city collected from Google Earth. The simulation results show that TBRS can outperform the existing protocols, especially when the network resources are limited.

关键词： routing vanet opportunistic forwarding

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fast and scalable lock methods for video coding on many-core architecture” [J. Vis. Commun. Image R. 25(7) (2014) 1758–1762]

引用

Journal of Visual Communication and Image Representation 2015年 27卷 57-57页

作者： Weizhi Xu Hui Yu Dianjie Lu Fenglong Song Da Wang Xiaochun Ye Songwei Pei Dongrui Fan Hongtao Xie Institute of Microelectronics Tsinghua University Beijing China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Information Science and Engineering Shandong Normal University Jinan China Department of Computer Science and Technology Beijing University of Chemical Technology Beijing China Institute of Information Engineering Chinese Academy of Sciences National Engineering Laboratory for Information Security Technologies Beijing China

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fast and scalable lock methods for video coding on many-core architecture” [J. Vis. Commun. 25 (7) (2014) 1758–1762]

引用

Journal of Visual Communication and Image Representation 2015年 26卷 350-350页

来源：评论

学校读者我要写书评

暂无评论

Towards accountable authority attribute-based encryption

引用

High Technology Letters 2013年第1期19卷 82-87页

作者：王永涛 Chen Kefei Long Yu Department of Computer Science and Engineering Shanghai Jiao Tong University China Information Technology Security Evaluation Center Shanghai Key Laboratory of Scalable Computing and System Shanghai JiaoTong University

An accountable authority attribute-based encryption （A-ABE） scheme is presented in this paper. The notion of accountable authority identity-based encryption （A-IBE） was first introduced by Goyal at Crypto＇07. It is a novel approach to mitigate the （inherent） key escrow problem in identity-based cryptosystems. In this work, the concept of accountable authority to attribute-based encryption （ABE） setting is generalized for the first time, and then a construction is given. The scheme non-trivially integrates an A-IBE scheme proposed by Libert et al. with an ABE scheme. In our construction, a user will be identified by a pair （ id, o~）, where id denotes the user＇ s identity and ω denotes the set of attributes associated to the user. In addition, our construction is shown to be secure under some reasonable assumptions.

关键词： cryptography attribute-based encryption accountable authority key escrow traceability

来源：评论

学校读者我要写书评

暂无评论

Motion Analysis for Human Interaction Detection Using Optical Flow on Lattice Superpixels

引用

Wuhan University Journal of Natural Sciences 2013年第2期18卷 109-116页

作者： ZHENG Peng CAO Yu WANG Song School of Computer Wuhan University The Key Laboratory of Aerospace Information Security and Trust Computing Ministry of Education Department of Computer Science and Engineering University of South Carolina

We develop a new video-based motion analysis algorithn to determine whether two persons have any interaction in their meet- ing. The interaction between two persons can be very general, such as shaking hands, exchanging objects, and so on. To make the motio~ analysis robust to image noise, we segment each video flame into a set of superpixels and then derive a motion feature and a motion pattern for each superpixel by averaging the optical flow within the superpixe Specifically, we use the lattice cut to construct the superpixels, which are spatially and temporally consistent across frames. Based on the motion feature and the motion pattern of the superpixels, we develop an algorithm to divide an input video sequence into three consecutive periods： 1） two persons walking toward each other, 2） two persons meeting each other, and 3） two persons walking away fi＇om each other. The experiment show that the proposed algorithm can accurately dis- tinguish the videos with and without human interactions.

关键词： superpixel optical flow interaction video

来源：评论

学校读者我要写书评

暂无评论

Below the salt the dangers of unfulfilled physical media assumptions

Below the salt the dangers of unfulfilled physical media ass...

引用

17th International security Protocols Workshop

作者： Blaze, Matt McDaniel, Patrick Computer Science Department University of Pennsylvania United States Systems and Internet Infrastructure Security Laboratory Department of Computer Science and Engineering Pennsylvania State University United States

ISBN: (纸本)9783642362125

Introduction: The physical access media communication traverses is increasing in diversity. Users now access data and services from wired computers, wireless laptops, PDAs, cell phones, and any number of embedded devices. All of these devices now share the same network - the internet. Of course the internet itself consists of many media including traditional long haul, ISP, home, and telecommunication networks. Uncertainty introduced by the media diversity has historically led to insecurity simply because the threat models upon which a protocol or security technique may depend, make false or unfulfilled assumptions about the attacker. This has direct consequences on security protocol requirements. © Springer-Verlag Berlin Heidelberg 2013.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：