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

2nd International Conference on Cloud computing and Big Data, CloudCom-Asia 2015

作者： Gu, Chunxiang Zheng, Yonghui Kang, Fei Xin, Dan State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China

ISBN: (纸本)9783319284293

As cloud computing becomes popular, more and more sensitive information are being centralized into the cloud. Hence, we need some mechanism to support operations on encrypted data in many applications in cloud. Public key encryption with keyword search (PEKS) is a mechanism for searching on encrypted data. It enables user Alice to send a secret value TW to a cloud server that will enable the server to selectively retrieve encrypted messages containing the keyword, but learn nothing else. In this paper, we propose a PEKS scheme using lattices. Lattice-based cryptosystems are becoming an increasingly popular in the research community. Our scheme can be proven secure in the standard model with the hardness of the standard Learning With Errors problem. © Springer International Publishing Switzerland 2015.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Scalable QoS multicast provisioning in wide-sense circuit tree

Scalable QoS multicast provisioning in wide-sense circuit tr...

引用

International Conference on Control engineering and Information System, ICCEIS 2014

作者： Huang, K.X. Chen, Y. Li, C.L. Zhang, X.B. State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan China

ISBN: (纸本)9781138026858

It is still a hot topic that how to provide dynamic reconfigurable QoS multicast service in the network. The MPLS network combined with the DiffServ can provide end-to-end QoS guarantee for differentiated services, and aggregated multicast can reduce the cost of maintaining multicast state. In this paper, based on the technology of the Wide-sense circuit Tree technique, we propose an architecture to provide the dynamic QoS multicast service, in the reconfigurable network environment. With the idea of aggregated multicast to reduce multicast state, and using the Wide-sense circuit technology to guarantee the quality of the transport service. © 2015 Taylor & Francis Group, London.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

GPU- based rendering via improved diffusion equation and geometric feature sampling

引用

ICIC Express Letters, Part B: Applications 2016年第3期7卷 599-605页

作者： Xu, Jie Song, Wenjun Fu, Jinhua School of Computer and Communication Engineering Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute Zhengzhou China

In order to acquire a fast rendering of translucent materials via GPU (Graphic Processing Unit) rendering pipeline, we propose an effective method for realistic rendering based on improved diffusion equation and geometric feature sampling. Considering diffusion equation can simulate the complex subsurface scattering inside translucent materials, we improve and derive the diffusion equation as a discrete form to fit GPU evaluation easily. Using geometric features such as curvature and area, we improve classic Turk’s point repulsion algorithm by the geometric feature sampling to spread out the sample points reasonably. The results show that our method could acquire a more realistic appearance by geometric feature sampling, better shading effect and relatively fast speed of rendering. © 2016.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Optimization of integrity measurement algorithm based on multi-thread pipeline paralleling 5

Optimization of integrity measurement algorithm based on mul...

引用

5th International Conference on Computer engineering and Networks, CENet 2015

作者： Wang, Yinhao Shan, Zheng Fan, Chao Xue, Fei State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan450002 China

With the continuous development of trusted computing, the integrity measurement has gradually been practical;but the popularization and application of the existing measurement tools are still restricted by their own measurement algorithm's performance. Considering the insufficient of existing measurement tools' performance, we propose an optimization method of integrity measurement algorithm based on multi-thread and pipeline paralleling. We analyze shortage of the existing measurement tools and provide an optimized method based on multi-thread technology and pipeline paralleling technology. Experiments show that this method can significantly improve the performance of SHA-1 and is also applicable to a variety of hash algorithms. © Copyright owned by the author(s) under the terms of the Creative Commons.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Constraints on dark photon dark matter using data from LIGO’s and Virgo’s third observing run

引用

Physical Review D 2022年第6期105卷 063030-063030页

作者： R. Abbott T. D. Abbott F. Acernese K. Ackley C. Adams N. Adhikari R. X. Adhikari V. B. Adya C. Affeldt D. Agarwal M. Agathos K. Agatsuma N. Aggarwal O. D. Aguiar L. Aiello A. Ain P. Ajith T. Akutsu S. Albanesi A. Allocca P. A. Altin A. Amato C. Anand S. Anand A. Ananyeva S. B. Anderson W. G. Anderson M. Ando T. Andrade N. Andres T. Andrić S. V. Angelova S. Ansoldi J. M. Antelis S. Antier S. Appert Koji Arai Koya Arai Y. Arai S. Araki A. Araya M. C. Araya J. S. Areeda M. Arène N. Aritomi N. Arnaud S. M. Aronson K. G. Arun H. Asada Y. Asali G. Ashton Y. Aso M. Assiduo S. M. Aston P. Astone F. Aubin C. Austin S. Babak F. Badaracco M. K. M. Bader C. Badger S. Bae Y. Bae A. M. Baer S. Bagnasco Y. Bai L. Baiotti J. Baird R. Bajpai M. Ball G. Ballardin S. W. Ballmer A. Balsamo G. Baltus S. Banagiri D. Bankar J. C. Barayoga C. Barbieri B. C. Barish D. Barker P. Barneo F. Barone B. Barr L. Barsotti M. Barsuglia D. Barta J. Bartlett M. A. Barton I. Bartos R. Bassiri A. Basti M. Bawaj J. C. Bayley A. C. Baylor M. Bazzan B. Bécsy V. M. Bedakihale M. Bejger I. Belahcene V. Benedetto D. Beniwal T. F. Bennett J. D. Bentley M. BenYaala F. Bergamin B. K. Berger S. Bernuzzi D. Bersanetti A. Bertolini J. Betzwieser D. Beveridge R. Bhandare U. Bhardwaj D. Bhattacharjee S. Bhaumik I. A. Bilenko G. Billingsley S. Bini R. Birney O. Birnholtz S. Biscans M. Bischi S. Biscoveanu A. Bisht B. Biswas M. Bitossi M.-A. Bizouard J. K. Blackburn C. D. Blair D. G. Blair R. M. Blair F. Bobba N. Bode M. Boer G. Bogaert M. Boldrini L. D. Bonavena F. Bondu E. Bonilla R. Bonnand P. Booker B. A. Boom R. Bork V. Boschi N. Bose S. Bose V. Bossilkov V. Boudart Y. Bouffanais A. Bozzi C. Bradaschia P. R. Brady A. Bramley A. Branch M. Branchesi J. E. Brau M. Breschi T. Briant J. H. Briggs A. Brillet M. Brinkmann P. Brockill A. F. Brooks J. Brooks D. D. Brown S. Brunett G. Bruno R. Bruntz J. Bryant T. Bulik H. J. Bulten A. Buonanno R. Buscicchio D. Buskulic C. Buy R. L. Byer L. Cadonati G. Cagnoli C. Cahillane J. Calderón Bustillo J. D. Callaghan T. A. Callis LIGO Laboratory California Institute of Technology Pasadena California 91125 USA Louisiana State University Baton Rouge Louisiana 70803 USA Dipartimento di Farmacia Università di Salerno I-84084 Fisciano Salerno Italy INFN Sezione di Napoli Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy OzGrav School of Physics and Astronomy Monash University Clayton 3800 Victoria Australia LIGO Livingston Observatory Livingston Louisiana 70754 USA University of Wisconsin-Milwaukee Milwaukee Wisconsin 53201 USA OzGrav Australian National University Canberra Australian Capital Territory 0200 Australia Max Planck Institute for Gravitational Physics (Albert Einstein Institute) D-30167 Hannover Germany Leibniz Universität Hannover D-30167 Hannover Germany Inter-University Centre for Astronomy and Astrophysics Pune 411007 India University of Cambridge Cambridge CB2 1TN United Kingdom Theoretisch-Physikalisches Institut Friedrich-Schiller-Universität Jena D-07743 Jena Germany University of Birmingham Birmingham B15 2TT United Kingdom Center for Interdisciplinary Exploration and Research in Astrophysics (CIERA) Northwestern University Evanston Illinois 60208 USA Instituto Nacional de Pesquisas Espaciais 12227-010 São José dos Campos São Paulo Brazil Gravity Exploration Institute Cardiff University Cardiff CF24 3AA United Kingdom INFN Sezione di Pisa I-56127 Pisa Italy International Centre for Theoretical Sciences Tata Institute of Fundamental Research Bengaluru 560089 India Gravitational Wave Science Project National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan INFN Sezione di Torino I-10125 Torino Italy Università di Napoli “Federico II” Complesso Universitario di Monte S. Angelo I-80126 Napoli Italy Université de Lyon Université Claude Bernard Lyon 1 CNRS Institut Lumière Matière F-69622 Villeurbanne Franc

We present a search for dark photon dark matter that could couple to gravitational-wave interferometers using data from advanced LIGO and Virgo’s third observing run. To perform this analysis, we use two methods, one based on cross-correlation of the strain channels in the two nearly aligned LIGO detectors, and one that looks for excess power in the strain channels of the LIGO and Virgo detectors. The excess power method optimizes the Fourier transform coherence time as a function of frequency, to account for the expected signal width due to Doppler modulations. We do not find any evidence of dark photon dark matter with a mass between mA∼10−14–10−11 eV/c2, which corresponds to frequencies between 10–2000 Hz, and therefore provide upper limits on the square of the minimum coupling of dark photons to baryons, i.e., U(1)B dark matter. For the cross-correlation method, the best median constraint on the squared coupling is ∼1.31×10−47 at mA∼4.2×10−13 eV/c2; for the other analysis, the best constraint is ∼2.4×10−47 at mA∼5.7×10−13 eV/c2. These limits improve upon those obtained in direct dark matter detection experiments by a factor of ∼100 for mA∼[2–4]×10−13 eV/c2, and are, in absolute terms, the most stringent constraint so far in a large mass range mA∼2×10−13–8×10−12 eV/c2.

关键词： Dark matter Gravitational wave detectors

来源：评论

学校读者我要写书评

暂无评论

A improved sequential pattern mining algorithm based on PrefixSpan

A improved sequential pattern mining algorithm based on Pref...

引用

Proceedings of the Biannual World Automation Congress

作者： Xue Fei Shan Zheng Li-jing Yan Chao Fan State Key Laboratory of Mathematical Engineering and Advanced Computing China Line Adv. Comput. Zhengzhou Sci. & Technol. Inst. Zhengzhou China

In order to solve the problem of large space and time overhead in the PrefixSpan algorithm, a new sequential pattern mining algorithm based on PrefixSpan is proposed, which is PrefixSpan-x algorithm. The algorithm reduces unnecessary storage space and removes the non-frequent items, and combines AC automaton to optimize frequent sub-sequence mining, so as to improve the performance. Experiments prove that the performance of PrefixSpan-x algorithm is better than Prefixspan algorithm in time and space.

关键词： Databases Algorithm design and analysis Data mining Automata Classification algorithms Fans Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Code Level Context Sensitivity Exploration Algorithm

Code Level Context Sensitivity Exploration Algorithm

引用

2015 4th International Conference on Computer, Mechatronics, Control and Electronic engineering (ICCMCEE 2015)

作者： Yan Lijing Shan Zheng Xu Xiaoyan Xue Fei The State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University

ISBN: (纸本)9781510813465

The context sensitivity is an important property in program analysis which can improve the analysis accuracy of the function call context of the source codes and helps to improve the abilities of the compiler optimization and verification procedures. The automata model based on the function call of the program source code is an effective method of modeling the behaviors of the current software, but this method does not consider the context sensitivity of the software function calls. To solve this problem, on the base of high-performance open source compiler Open64, we achieve a source code level context sensitivity exploration algorithm to analyze the relationships between the points of the function calls. Using the iterator, by the circulating way, the algorithm traverses the calling relationships between functions and obtains the context sensitive information analysis results. With this method, it can guide the source code modeling of using the single context sensitivity or the mixed context sensitivity models. In the benchmark sets SPEC2006 and NPB3.3.1, we verify the correctness of the algorithm, and the results show that the proposed algorithm can detect the context sensitivity of the source code level, and the hybrid context sensitivity modeling approach which we used, comparing with other modeling methods, has had a higher accuracy.

关键词： Behavior model Function call graph Context sensitivity Source code level Inter-procedure analysis

来源：评论

学校读者我要写书评

暂无评论

A discontinuous galerkin method by patch reconstruction for biharmonic problem

arXiv

引用

arXiv 2017年

作者： Li, Ruo Ming, Pingbing Sun, Zhiyuan Yang, Fanyi Yang, Zhijian CAPT LMAM and School of Mathematical Sciences Peking University Beijing100871 China State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences No.55 Zhong-Guan-Cun East Road Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences No. 19A Yu-Quan Road Beijing100049 China School of Mathematical Sciences Peking University Beijing100871 China School of Mathematics and Statistics Wuhan University Wuhan430072 China

We propose a new discontinuous Galerkin method based on the least-squares patch reconstruction for the biharmonic problem. We prove the optimal error estimate of the proposed method. The two-dimensional and three-dimensional numerical examples are presented to confirm the accuracy and efficiency of the method with several boundary conditions and several types of polygon meshes and polyhedral meshes.49N45, 65N21 Copyright © 2017, The Authors. All rights reserved.

关键词： Galerkin methods

来源：评论

学校读者我要写书评

暂无评论

Comment on "Inherent security of phase coding quantum key distribution systems against detector blinding attacks" [Laser Phys. Lett. 15, 095203 (2018)]

arXiv

引用

arXiv 2018年

作者： Fedorov, Aleksey Gerhardt, Ilja Huang, Anqi Jogenfors, Jonathan Kurochkin, Yury Lamas-Linares, Antía Larsson, Jan-Åke Leuchs, Gerd Lydersen, Lars Makarov, Vadim Skaar, Johannes Russian Quantum Center Skolkovo Moscow143025 Russia QRate Skolkovo Moscow143025 Russia QApp Skolkovo Moscow143025 Russia Institute of Physics University of Stuttgart Institute for Quantum Science and Technology Pfaffenwaldring 57 StuttgartD-70569 Germany Max Planck Institute for Solid State Research Heisenbergstraße 1 StuttgartD-70569 Germany Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China Department of Electrical Engineering Linköping University LinköpingSE-58183 Sweden Texas Advanced Computing Center University of Texas at Austin AustinTX United States Max Planck Institute for the Science of Light University of Erlangen-Nürnberg ErlangenD-91058 Germany Kringsjåvegen 3E TrondheimNO-7032 Norway National University of Science and Technology MISIS Moscow119049 Russia Department of Technology Systems University of Oslo Box 70 KjellerNO-2027 Norway

来源：评论

学校读者我要写书评

暂无评论

Reducing DRAM refreshing in an error correction manner

引用

Science China Chemistry 2015年第12期58卷 186-199页

作者： ZHU DanFeng WANG Rui WEI YanJiang QIAN DePei School of Computer Science and Engineering Beihang University State Key Laboratory of Mathematical Engineering and Advanced Computing

Dynamic random access memory(DRAM) is facing the challenge of technology scaling. The decreasing feature size makes it harder to make DRAM cells which can keep the current data-holding time. When DRAM cells cannot hold data for a long time, DRAM chips need a more frequent refreshing operation. Therefore, in the near future, time and energy cost on DRAM refreshing will be no longer trivial. In this paper, we propose DRAM Error Correction Pointer(ECP), an error-correction-manner framework, to reduce DRAM refreshes without data loss. We exploit the non-uniform feature of DRAM cells with respect to the data retention time. Compared with the conventional refreshing mechanisms, which refresh DRAM chips by the retention time of the leakiest cells, we refresh the chips much fewer times, and treat the not-in-time refreshed cells as fault elements. We use the structure of ECP as a fault tolerant element. By recording the data which are supposed to be written into the leaky cells in our DRAM-ECP structures, DRAM-ECP can significantly decrease refreshing frequency. When these data are to be read out, DRAM-ECP retrieves the data stored in ECPs and covers them to the corresponding position in the data row. Our experiments show that DRAM-ECP can reduce over 70%refreshing operations than the current refreshing mechanism and also get significant energy saving.

关键词： DRAM refreshing error correction DRAM-ECP counting bloom filter retention time

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：