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

International Conference on Automatic Face and Gesture Recognition

作者： Michel F. Valstar Timur Almaev Jeffrey M. Girard Gary McKeown Marc Mehu Lijun Yin Maja Pantic Jeffrey F. Cohn School of Computer Science University of Nottingham UK Department of Psychology University of Pittsburgh Pittsburgh USA School of Psychology Queen's University Belfast Belfast UK Department of Psychology Webster University Private Vienna Vienna AT Department of Computer Science Binghamton University Binghamton USA Department of Computing Imperial College London London UK Electrical Engineering University of Twente The Netherlands Robotics Institute Carnegie Mellon University Pittsburgh USA

Despite efforts towards evaluation standards in facial expression analysis (e.g. FERA 2011), there is a need for up-to-date standardised evaluation procedures, focusing in particular on current challenges in the field. One of the challenges that is actively being addressed is the automatic estimation of expression intensities. To continue to provide a standardisation platform and to help the field progress beyond its current limitations, the FG 2015 Facial Expression Recognition and Analysis challenge (FERA 2015) will challenge participants to estimate FACS Action Unit (AU) intensity as well as AU occurrence on a common benchmark dataset with reliable manual annotations. Evaluation will be done using a clear and well-defined protocol. In this paper we present the second such challenge in automatic recognition of facial expressions, to be held in conjunction with the 11 IEEE conference on Face and Gesture Recognition, May 2015, in Ljubljana, Slovenia. Three sub-challenges are defined: the detection of AU occurrence, the estimation of AU intensity for pre-segmented data, and fully automatic AU intensity estimation. In this work we outline the evaluation protocol, the data used, and the results of a baseline method for the three sub-challenges.

关键词： Gold Reliability Estimation databases Feature extraction Face recognition Training

来源：评论

学校读者我要写书评

暂无评论

Two-Level Stable Matching-Based Selection in MOEA/D

Two-Level Stable Matching-Based Selection in MOEA/D

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Mengyuan Wu Sam Kwong Qingfu Zhang Ke Li Ran Wang Bo Liu Department of Computer Science City University of Hong Kong Hong Kong SAR Department of Computing Glyndwr University Wrexham U.K. Department of Electrical and Computer Engineering Michigan State University East Lansing MI USA Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China City University of Hong Kong Shenzhen Research Institute Shenzhen China

ISBN: (纸本)9781479986989

Stable matching-based selection models the selection process in MOEA/D as a stable marriage problem. By finding a stable matching between the sub problems and solutions, the solutions are assigned to sub problems to balance the convergence and the diversity. In this paper, a two-level stable matching-based selection is proposed to further guarantee the diversity of the population. More specifically, the first level of stable matching only matches a solution to one of its most preferred sub problems and the second level of stable matching is responsible for matching the solutions to the remaining sub problems. Experimental studies demonstrate that the proposed selection scheme is effective and competitive comparing to other state-of-the-art selection schemes for MOEA/D.

关键词： Convergence Sociology Pareto optimization Heuristic algorithms Cities and towns

来源：评论

学校读者我要写书评

暂无评论

Incorporation of Ordinal Optimization into Learning Automata for High Learning Efficiency

Incorporation of Ordinal Optimization into Learning Automata...

引用

IEEE International Conference on Automation science and engineering

作者： JunQi Zhang Cheng Wang Di Zang MengChu Zhou Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

ISBN: (纸本)9781467381840

Learning automata (LA) represent important leaning mechanisms with applications in automated system design, biological system modeling, computer vision, and transportation. They play the critical roles in modeling a process as well as generating the appropriate signal to control it. They update their action probabilities in accordance with the inputs received from the environment and can improve their own performance during operations. The action probability vector in LA takes charge of two functions: 1) The cost of convergence, i.e., the size of sampling budget;2) The allocation of sampling budget among actions to identify the optimal one. These two intertwined functions lead to a problem: The sampling budget mostly goes to the currently estimated optimal action due to its high action probability regardless whether it can help identify the real optimal action or not. This work proposes a new class of LA that separates the allocation of sampling budget from the action probability vector. It uses the action probability vector to determine the size of sampling budget and then uses Optimal computing Budget Allocation (OCBA) to accomplish the allocation of sampling budget in a way that maximizes the probability of identifying the true optimal action. Simulation results verify its significant speedup ranging from 10.93% to 65.94% over the best existing LA algorithms.

关键词： Convergence Optimization Resource management Learning automata Computational modeling Pursuit algorithms Accuracy

来源：评论

学校读者我要写书评

暂无评论

A New Multi-Service Token Bucket-Shaping Scheme Based on 802.11e

A New Multi-Service Token Bucket-Shaping Scheme Based on 802...

引用

International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Yunyi Zhang Shuru Liu Ran Zhang Wei Wei Houbing Song Wei Li Xiumei Fan College of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou China School of Computer Science and Engineering Xi'an University of technology State Key Laboratory for Strength and Vibration of Mechanical Structures of Xi’ an Jiaotong University Xi'an China Department of Electrical and Computer Engineering West Virginia University Institute of Technology West Virginia USA The Centre for Distributed and High Performance Computing School of Information Technologies The University of Sydney Sydney Australia School of Automation and Information Engineering Xi'an University of Technology Xi'an China

With the development of information technology, the demand for video transmission in wireless networks rapidly increases. The traditional traffic shaping algorithms cannot fully (or adequately) meet the demand for high-quality video transmission in wireless networks. Aiming to reduce this problem, this paper proposes a new multi-service flow, token bucket shaping scheme in an IEEE 802.11e environment. In view of the characteristics of video stream transmission in an IEEE 802.11e wireless network, this scheme adopts a multi-service token bucket technology on the basis of the traffic shaping scheme. After creating a simulation model in NS2, the simulation results show that the scheme can effectively improve the quality of service for video streaming in a wireless environment.

关键词： Streaming media IEEE 802.11e Standard Wireless networks Analytical models data models Packet loss

来源：评论

学校读者我要写书评

暂无评论

Sequential and adaptive sampling for matrix completion in network monitoring systems

Sequential and adaptive sampling for matrix completion in ne...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Kun Xie Lele Wang Xin Wang Gaogang Xie Guangxing Zhang Dongliang Xie Jigang Wen College of Computer Science and Electronics Engineering Hunan University Changsha China State Key Lab of Networking & Switching Tech. Beijing Univ. of Posts and Telecomm. China Department of Electrical and Computer Engineering State University of New York at Stony Brook USA Institute of Computing Technology Chinese Academy of Sciences Beijing China DNSLAB China Internet Network Information Center Beijing China

End-to-end network monitoring is essential to ensure transmission quality for Internet applications. However, in large-scale networks, full-mesh measurement of network performance between all transmission pairs is infeasible. As a newly emerging sparsity representation technique, matrix completion allows the recovery of a low-rank matrix using only a small number of random samples. Existing schemes often fix the number of samples assuming the rank of the matrix is known, while the data features thus the matrix rank vary over time. In this paper, we propose to exploit the matrix completion techniques to derive the end-to-end network performance among all node pairs by only measuring a small subset of end-to-end paths. To address the challenge of rank change in the practical system, we propose a sequential and information-based adaptive sampling scheme, along with a novel sampling stopping condition. Our scheme is based only on the data observed without relying on the reconstruction method or the knowledge on the sparsity of unknown data. We have performed extensive simulations based on real-world trace data, and the results demonstrate that our scheme can significantly reduce the measurement cost while ensuring high accuracy in obtaining the whole network performance data.

关键词： Monitoring Sparse matrices Matrix decomposition computers Accuracy Conferences Internet

来源：评论

学校读者我要写书评

暂无评论

Effect of source tampering in the security of quantum cryptography

引用

Physical Review A 2015年第2期92卷 022304-022304页

作者： Shi-Hai Sun Feihu Xu Mu-Sheng Jiang Xiang-Chun Ma Hoi-Kwong Lo Lin-Mei Liang College of Science National University of Defense Technology Changsha 410073 China Center for Quantum Information and Quantum Control Department of Electrical and Computer Engineering and Department of Physics University of Toronto Toronto Ontario M5S 3G4 Canada Research Laboratory of Electronics Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge Massachusetts 02139 USA State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 China

The security of source has become an increasingly important issue in quantum cryptography. Based on the framework of measurement-device-independent quantum key distribution (MDI-QKD), the source becomes the only region exploitable by a potential eavesdropper (Eve). Phase randomization is a cornerstone assumption in most discrete-variable (DV) quantum communication protocols (e.g., QKD, quantum coin tossing, weak-coherent-state blind quantum computing, and so on), and the violation of such an assumption is thus fatal to the security of those protocols. In this paper, we show a simple quantum hacking strategy, with commercial and homemade pulsed lasers, by Eve that allows her to actively tamper with the source and violate such an assumption, without leaving a trace afterwards. Furthermore, our attack may also be valid for continuous-variable (CV) QKD, which is another main class of QKD protocol, since, excepting the phase random assumption, other parameters (e.g., intensity) could also be changed, which directly determine the security of CV-QKD.

关键词： QUANTUM cryptography QUANTUM communication QUANTUM coherence RANDOMIZATION (Statistics) QUANTUM computing

来源：评论

学校读者我要写书评

暂无评论

Experimental quantum key distribution with source flaws

引用

Physical Review A 2015年第3期92卷 032305-032305页

作者： Feihu Xu Kejin Wei Shihan Sajeed Sarah Kaiser Shihai Sun Zhiyuan Tang Li Qian Vadim Makarov Hoi-Kwong Lo Centre for Quantum Information and Quantum Control (CQIQC) Department of Electrical & Computer Engineering and Department of Physics University of Toronto Toronto Ontario M5S 3G4 Canada School of Science and State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications Beijing 100876 China Institute for Quantum Computing (IQC) University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada College of Science National University of Defense Technology Changsha 410073 China

Decoy-state quantum key distribution (QKD) is a standard technique in current quantum cryptographic implementations. Unfortunately, existing experiments have two important drawbacks: the state preparation is assumed to be perfect without errors and the employed security proofs do not fully consider the finite-key effects for general attacks. These two drawbacks mean that existing experiments are not guaranteed to be proven to be secure in practice. Here, we perform an experiment that shows secure QKD with imperfect state preparations over long distances and achieves rigorous finite-key security bounds for decoy-state QKD against coherent attacks in the universally composable framework. We quantify the source flaws experimentally and demonstrate a QKD implementation that is tolerant to channel loss despite the source flaws. Our implementation considers more real-world problems than most previous experiments, and our theory can be applied to general discrete-variable QKD systems. These features constitute a step towards secure QKD with imperfect devices.

关键词： Quantum states Quantum theory Quantum entanglement Quantum cryptography Quantum computing

来源：评论

学校读者我要写书评

暂无评论

Current-aware scheduling for flash storage devices 20

Current-aware scheduling for flash storage devices

引用

20th IEEE International Conference on Embedded and Real-Time computing Systems and Applications, RTCSA 2014

作者： Huang, Tzu-Jung Ho, Chien-Chung Huang, Po-Chun Chang, Yuan-Hao Chang, Che-Wei Kuo, Tei-Wei Department of Computer Science and Information Engineering National Taiwan University Taipei106 Taiwan Department of Computer Science Engineering and Innovation Center for Big Data and Digital Convergence Yuan Ze University Taoyuan320 Taiwan Institute of Information Science Academia Sinica Taipei115 Taiwan Department of Computer Science and Information Engineering School of Electrical and Computer Engineering Chang Gung University Taoyuan320 Taiwan

ISBN: (纸本)9781479939534

As NAND flash memory has become a major choice of storage media in diversified computing environments, the performance issue of flash memory has been extensively addressed in many excellent designs. Among them, an effective strategy is to adopt multiple channels and flash-memory chips to improve the performance on data accesses. However, the degree of data access parallelism cannot be increased by simply increasing the number of channels and chips in the storage device, because it is seriously limited by the maximum current constraint of the bus interface and affected by the access patterns of user data. As a consequence, to maximize the degree of access parallelism, it is of paramount significance to have a proper scheduling strategy to determine the order that read/write requests are served. In this paper, a current-aware scheduling strategy for read/write requests is proposed to maximize the read performance without violating the bus current constraint and without missing (the deadline of) written data. The proposed strategy is then evaluated through a series of experiments, in which the results are quite encouraging. © 2014 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

An efficient age-invariant face recognition

An efficient age-invariant face recognition

引用

International Conference on Software Intelligence Technologies and Applications and International Conference on Frontiers of Internet of Things, 2014

作者： Tandon, Ankit Gupta, Phalguni Department of Computer Science and Engineering Indian Institute of Technology Kanpur Kanpur208016 India Aditya Nigam School of Computing and Electrical Engineering Indian Institute of Technology Mandi Mandi H.P175005 India

ISBN: (纸本)9781849199704

This paper proposes an efficient face recognition system which is invariant to aging. It makes use of the periocular region of an individual. Local Binary Patterns are used to extract these local features from the enhanced periocular region. Chi square distance is used to compute similarity between two facial images. It has been tested on a publicly available, FGNET database and self scanned and created Browns database.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

Security loophole in free-space quantum key distribution due to spatial-mode detector-efficiency mismatch

引用

Physical Review A 2015年第6期91卷 062301-062301页

作者： Shihan Sajeed Poompong Chaiwongkhot Jean-Philippe Bourgoin Thomas Jennewein Norbert Lütkenhaus Vadim Makarov Institute for Quantum Computing University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Quantum Information Science Program Canadian Institute for Advanced Research Toronto Ontario M5G 1Z8 Canada

In free-space quantum key distribution (QKD), the sensitivity of the receiver's detector channels may depend differently on the spatial mode of incoming photons. Consequently, an attacker can control the spatial mode to break security. We experimentally investigate a standard polarization QKD receiver and identify sources of efficiency mismatch in its optical scheme. We model a practical intercept-and-resend attack and show that it would break security in most situations. We show experimentally that adding an appropriately chosen spatial filter at the receiver's entrance may be an effective countermeasure.

关键词： QUANTUM mechanics SENSITIVITY analysis PHOTONS INFORMATION storage & retrieval systems -- Security measures OPTICAL polarization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：