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

Uniform Traffic Patterns using Virtual Cut-Through Flow Control on VMMN

Procedia computer science 2015年 59卷 400-409页

作者： Ala Ahmed Yahya Hag M.M. Hafizur Rahman Rizal Mohd Nor Tengku Mohd Tengku Sembok Yasuyuki Miura Yasushi Inoguchi Department of Computer Science KICT IIUM Kuala Lumpur 50728 Malaysia Cyber Security Center National Defense University Malaysia Kuala Lumpur 57000 Malaysia Shonan Institute of Technology Fujisawa Kanagawa 251-8511 Japan Research Center for Advanced Computing Infrastructure JAIST Nomi-ShiIshikawa 923-1292Japan

The previous study of static network performance of a Vertical Midimew connected Mesh Network (VMMN) was shown to be good. However, its dynamic communication performance has not been evaluated yet, we have proposed a deadlock free dimension order routing algorithm using 4 virtual channels. In this paper, The TOPAZ simulator is used to evaluate the dynamic communication performance of a VMMN with virtual cut-through flow control under uniform traffic pattern. We found that the VMMN dynamic communication performance is better than that of the hierarchical TESH network and its counter rival MMN.

关键词： TOPAZ Simulator Virtual Cut Through VMMN Uniform Traffic Pattern Dynamic Communication Performance.

来源：评论

学校读者我要写书评

暂无评论

Simulating Hamiltonian Dynamics with a Truncated Taylor Series

引用

Physical Review Letters 2015年第9期114卷 090502-090502页

作者： Dominic W. Berry Andrew M. Childs Richard Cleve Robin Kothari Rolando D. Somma Department of Physics and Astronomy Macquarie University Sydney New South Wales 2109 Australia Institute for Quantum Computing University of Waterloo Ontario N2L 3G1 Canada Department of Combinatorics and Optimization University of Waterloo Ontario N2L 3G1 Canada Department of Computer Science Institute for Advanced Computer Studies and Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20910 USA Canadian Institute for Advanced Research Toronto Ontario M5G 1Z8 Canada School of Computer Science University of Waterloo Ontario N2L 3G1 Canada Center for Theoretical Physics Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Theoretical Division Los Alamos National Laboratory Los Alamos New Mexico 87545 USA

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

ILPS: Indoor localization using physical maps and smartphone sensors 15

ILPS: Indoor localization using physical maps and smartphone...

引用

15th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2014

作者： Abadleh, Ahmad Han, Sangyup Hyun, Soon J. Lee, Ben Kim, Myungchul Department of Computer Science Korea Advanced Institute of Science and Technology Daejeon Korea Republic of School of Electrical Engineering and Computer Science Oregon State University CorvallisOR97330 United States

ISBN: (纸本)9781479947867

Indoor positioning and tracking services are garnering more attention. Recently, several state-of-the-art localization techniques have been proposed that use radio maps or the sensors readily available on smartphones. This paper presents a localization system called Indoor Localization using Physical maps and smartphone Sensors (ILPS), which is based on a building blueprint database and smartphone sensors. The blueprint database and access points (APs) provide a number of reference points that can be used to acquire the initial position and adjust the user position each time a reference point is detected. The proposed method is implemented on a smartphone and tested in real indoor environments. The experiments with ILPS demonstrate that using a static blueprint will avoid the costly database updates that are usually required in other approaches due to signal attenuation. Furthermore, ILPS performs better than existing work in term of accuracy and effectiveness for indoor localization. © 2014 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On the robustness of bucket brigade quantum ram 10

On the robustness of bucket brigade quantum ram

引用

10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015

作者： Arunachalam, Srinivasan Gheorghiu, Vlad Jochym-O'Connor, Tomas Mosca, Michele Srinivasan, Priyaa Varshinee Amsterdam Netherlands Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Department of Combinatorics and Optimization University of Waterloo WaterlooONN2L 3G1 Canada Department of Physics and Astronomy University of Waterloo WaterlooONN2L 3G1 Canada Perimeter Institute for Theoretical Physics WaterlooONN2L 6B9 Canada Canadian Institute for Advanced Research TorontoONM5G 1Z8 Canada David R. Cheriton School of Computer Science University of Waterloo WaterlooONN2L 3G1 Canada Institute for Quantum Science and Technology University of Calgary CalgaryABT2N 1N4 Canada

ISBN: (纸本)9783939897965

We study the robustness of the bucket brigade quantum random access memory model introduced by Giovannetti, Lloyd, and Maccone [Phys. Rev. Lett. 100, 160501 (2008)]. Due to a result of Regev and Schiff [ICALP'08 pp. 773], we show that for a class of error models the error rate per gate in the bucket brigade quantum memory has to be of order o(2-n/2) (where N = 2n is the size of the memory) whenever the memory is used as an oracle for the quantum searching problem. We conjecture that this is the case for any realistic error model that will be encountered in practice, and that for algorithms with super-polynomially many oracle queries the error rate must be super-polynomially small, which further motivates the need for quantum error correction. We introduce a circuit model for the quantum bucket brigade architecture and argue that quantum error correction for the circuit causes the quantum bucket brigade architecture to lose its primary advantage of a small number of "active" gates, since all components have to be actively error corrected. © Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O'Connor, Michele Mosca, and Priyaa Varshinee Srinivasan.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Necessary and Sufficient Quantum Information Characterization of Einstein-Podolsky-Rosen Steering

引用

Physical Review Letters 2015年第6期114卷 060404-060404页

作者： Marco Piani John Watrous Institute for Quantum Computing and Department of Physics and Astronomy University of Waterloo 200 University Avenue West Waterloo Ontario N2L 3G1 Canada Department of Physics and SUPA University of Strathclyde Glasgow G4 0NG United Kingdom Institute for Quantum Computing and School of Computer Science University of Waterloo 200 University Avenue West Waterloo Ontario N2L 3G1 Canada Canadian Institute for Advanced Research 180 Dundas Street West Suite 1400 Toronto Ontario M5G 1Z8 Canada

Steering is the entanglement-based quantum effect that embodies the “spooky action at a distance” disliked by Einstein and scrutinized by Einstein, Podolsky, and Rosen. Here we provide a necessary and sufficient characterization of steering, based on a quantum information processing task: the discrimination of branches in a quantum evolution, which we dub subchannel discrimination. We prove that, for any bipartite steerable state, there are instances of the quantum subchannel discrimination problem for which this state allows a correct discrimination with strictly higher probability than in the absence of entanglement, even when measurements are restricted to local measurements aided by one-way communication. On the other hand, unsteerable states are useless in such conditions, even when entangled. We also prove that the above steering advantage can be exactly quantified in terms of the steering robustness, which is a natural measure of the steerability exhibited by the state.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

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 cryptography

来源：评论

学校读者我要写书评

暂无评论

A portfolio optimization approach to selection in multiobjective evolutionary algorithms

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8672卷 672-681页

作者： Yevseyeva, Iryna Guerreiro, Andreia P. Emmerich, Michael T. M. Fonseca, Carlos M. Centre for Cybercrime and Computer Security School of Computing Science Newcastle University Newcastle upon TyneNE1 7RU United Kingdom CISUC Department of Informatics Engineering University of Coimbra Pólo II Pinhal de Marrocos Coimbra3030-290 Portugal Leiden Institute of Advanced Computer Science Leiden University Niels Bohrweg 1 2333 CA Leiden Netherlands

In this work, a new approach to selection in multiobjective evolutionary algorithms (MOEAs) is proposed. It is based on the portfolio selection problem, which is well known in financial management. The idea of optimizing a portfolio of investments according to both expected return and risk is transferred to evolutionary selection, and fitness assignment is reinterpreted as the allocation of capital to the individuals in the population, while taking into account both individual quality and population diversity. The resulting selection procedure, which unifies parental and environmental selection, is instantiated by defining a suitable notion of (random) return for multiobjective optimization. Preliminary experiments on multiobjective multidimensional knapsack problem instances show that such a procedure is able to preserve diversity while promoting convergence towards the Pareto-optimal front. © Springer International Publishing Switzerland 2014.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Characterisation of knowledge incorporation into solution models for the meal planning problem 3

Characterisation of knowledge incorporation into solution mo...

引用

3rd International Symposium on Foundations of Health Information Engineering and Systems, FHIES 2013

作者： Zanamwe, Ngonidzashe Dube, Kudakwashe Thomson, Jasmine S. Mtenzi, Fredrick J. Hapanyengwi, Gilford T. Computer Science Department University of Zimbabwe Zimbabwe School of Engineering and Advanced Technology Massey University New Zealand Institute of Food Nutrition and Human Health Massey University New Zealand School of Computing College of Sciences and Health Dublin Institute of Technology Ireland

ISBN: (纸本)9783642539558

This paper is part of work aimed at investigating an approach to knowledge incorporation into solution models of the Meal Planning Problem (MPP) for use in mobile web-based HIV/AIDS nutrition therapy management within the context of developing countries, particularly, in Sub-Saharan Africa. This paper presents a characterisation of the incorporation of knowledge into the models for the MPP. The characterisation is important for assessing the extent to which MPP models can be adapted for use in different clinical problems with different nutrition guideline knowledge and in different regions of the world with differently customised versions of the guidelines. The characterisation was applied to thirty one works in the literature on MPP models. The main outcome of the application of the characterisation was the finding that the existing MPP models do not provide for the incorporation of nutrition guideline knowledge as first class concepts with identifiable and manageable structures, which makes almost impossible the transfer of knowledge from health experts to patients and from one region of the world to another. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

A Graph-Based 3D IC Partitioning Technique

A Graph-Based 3D IC Partitioning Technique

引用

IEEE computer Society Annual Symposium on VLSI

作者： Sabyasachee Banerjee Subhashis Majumder Bhargab B. Bhattacharya Department of Computer Science and Engineering Heritage Institute of Technology Kolkata Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata

Netlist partitioning is an important part of the physical design of 3D IC chips. Each subcircuit corresponding to a partition is subsequently assigned to a suitable device layer in the design phase. This paper proposes a netlist partitioning technique that intends to minimize the number of inter-layer interconnections while maintaining the area constraints. This, in turn, will minimize the area and cost associated with the Through-Silicon Vias (TSVs) needed in the design. The proposed method starts with an BFS-based initial solution and then improves iteratively using a heuristic. Experimental results demonstrate that by reassigning some modules to other layers, our algorithm could achieve up to 45% reduction in the number of TSVs on several benchmark circuits compared to earlier approaches. The resulting increase in floor area due to movement of modules a cross layers, is almost compensated by the decrease in TSV-area. Thus while satisfying the area-constraints, it allows us to reduce the number of TSVs as well as the IR-drop and delay associated with the vias.

关键词： Partitioning algorithms Three-dimensional displays Through-silicon vias Algorithm design and analysis Benchmark testing Time complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：