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

arXiv 2017年

作者： Liao, Hao Mariani, Manuel Sebastian Medo, Matúš Zhang, Yi-Cheng Zhou, Ming-Yang Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Physics University of Fribourg Fribourg1700 Switzerland Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610054 China Department of Radiation Oncology Inselspital Bern University Hospital University of Bern Bern3010 Switzerland

Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world problems because it affects how we access online information and products, how success and talent are evaluated in human activities, and how scarce resources are allocated by companies and policymakers, among others. This calls for a deep understanding of how existing ranking algorithms perform, and which are their possible biases that may impair their effectiveness. Well-established ranking algorithms (such as the popular Google's PageRank) are static in nature and, as a consequence, they exhibit important shortcomings when applied to real networks that rapidly evolve in time. The recent advances in the understanding and modeling of evolving networks have enabled the development of a wide and diverse range of ranking algorithms that take the temporal dimension into account. The aim of this review is to survey the existing ranking algorithms, both static and time-aware, and their applications to evolving networks. We emphasize both the impact of network evolution on well-established static algorithms and the benefits from including the temporal dimension for tasks such as prediction of real network traffic, prediction of future links, and identification of highly-significant nodes. Copyright © 2017, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Iteratively linearized reweighted alternating direction method of multipliers for a class of nonconvex problems

arXiv

引用

arXiv 2017年

作者： Sun, Tao Jiang, Hao Cheng, Lizhi Zhu, Wei Department of Mathematics National University of Defense Technology Changsha Hunan410073 China College of Computer National University of Defense Technology Changsha Hunan410073 China The State Key Laboratory for High Performance Computation National University of Defense Technology Changsha Hunan410073 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Xiangtan Hunan411105 China

In this paper, we consider solving a class of nonconvex and nonsmooth problems frequently appearing in signal processing and machine learning research. The traditional alternating direction method of multipliers encounters troubles in both mathematics and computations in solving the nonconvex and nonsmooth subproblem. In view of this, we propose a reweighted alternating direction method of multipliers. In this algorithm, all subproblems are convex and easy to solve. We also provide several guarantees for the convergence and prove that the algorithm globally converges to a critical point of an auxiliary function with the help of the Kurdyka-Lojasiewicz property. Several numerical results are presented to demonstrate the efficiency of the proposed algorithm. Copyright © 2017, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Exploring low internal reorganization energies for silicene nanoclusters

arXiv

引用

arXiv 2017年

作者： Pablo-Pedro, Ricardo Lopez-Rios, Hector Mendoza-Cortes, Jose-L Kong, Jing Fomine, Serguei van Voorhis, Troy Dresselhaus, Mildred S. Department of Chemistry Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States Instituto de Investigaciones en Materiales Universidad Nacional Autónoma de México Apartado Postal 70-360 CU Coyoacán Ciudad de México04510 Mexico Department of Chemical & Biomedical Engineering Florida A&M University Florida State University Joint College of Engineering Tallahassee FL32310 United States Scientific Computing Department Materials Science and Engineering Program High Performance Material Institute Condensed Matter Theory National High Magnetic Field Laboratory Florida State University TallahasseeFL32310 United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States Department of Physics Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States

high-performance materials rely on small reorganization energies to facilitate both charge separation and charge transport. Here, we performed DFT calculations to predict small reorganization energies of rectangular silicene nanoclusters with hydrogen-passivated edges denoted by H-SiNC. We observe that across all geometries, H-SiNCs feature large electron affinities and highly stabilized anionic states, indicating their potential as n-type materials. Our findings suggest that fine-tuning the size of H-SiNCs along the "zigzag" and "armchair" directions may permit the design of novel n-type electronic materials and spinctronics devices that incorporate both high electron affinities and very low internal reorganization energies. Copyright © 2017, The Authors. All rights reserved.

关键词： Silicene

来源：评论

学校读者我要写书评

暂无评论

Exploring Low Internal Reorganization Energies for Silicene Nanoclusters

arXiv

引用

arXiv 2017年

关键词： Silicene

来源：评论

学校读者我要写书评

暂无评论

Recent advances in electromagnetic compatibility of 3D-ICS - Part II

引用

IEEE Electromagnetic Compatibility Magazine 2016年第1期5卷 65-74页

作者： Sicard, Etienne Jianfei, Wu Shen, Rongjun Li, Er-Ping Liu, En-Xiao Kim, Joungho Cho, Jonghyun Swaminathan, Madhavan INSA GEI 135 Avenue de Rangueil Toulouse31077 France School of Electronic Science and Engineering NUDT Changsha Hunan410073 China Institute of High Performance Computing ASTAR 1 Fusionopolis Way Singapore138632 Singapore Daejeon Korea Republic of John Pippin Department in Electromagnetics School of Electrical and Computer Engineering Interconnect and Packaging Center Georgia Institute of Technology AtlantaGA30332-0250 United States

This second part addresses a selection of topics related to Electromagnetic interference (EMI) issues in three-dimensional integrated components. Details about Through Silicon Via (TSV) technology, modelling and parasitic effects are introduced in the first part, then key concepts such as signal integrity (SI), power integrity (PI), and Electromagnetic Interference are introduced. © 2012 IEEE.

关键词： Signal interference

来源：评论

学校读者我要写书评

暂无评论

First cryogenic test operation of underground km-scale gravitational-wave observatory KAGRA

arXiv

引用

arXiv 2019年

作者： Akutsu, T. Ando, M. Arai, K. Arai, Y. Araki, S. Araya, A. Aritomi, N. Asada, H. Aso, Y. Atsuta, S. Awai, K. Bae, S. Baiotti, L. Barton, M.A. Cannon, K. Capocasa, E. Chen, C.-S. Chiu, T.-W. Cho, K. Chu, Y.-K. Craig, K. Creus, W. Doi, K. Eda, K. Enomoto, Y. Flaminio, R. Fujii, Y. Fujimoto, M.-K. Fukunaga, M. Fukushima, M. Furuhata, T. Hagiwara, A. Haino, S. Hasegawa, K. Hashino, K. Hayama, K. Hirobayashi, S. Hirose, E. Hsieh, B.H. Huang, C.-Z. Ikenoue, B. Inoue, Y. Ioka, K. Itoh, Y. Izumi, K. Kaji, T. Kajita, T. Kakizaki, M. Kamiizumi, M. Kanbara, S. Kanda, N. Kanemura, S. Kaneyama, M. Kang, G. Kasuya, J. Kataoka, Y. Kawai, N. Kawamura, S. Kawasaki, T. Kim, C. Kim, J. Kim, J.C. Kim, W.S. Kim, Y.-M. Kimura, N. Kinugawa, T. Kirii, S. Kitaoka, Y. Kitazawa, H. Kojima, Y. Kokeyama, K. Komori, K. Kong, A.K.H. Kotake, K. Kozu, R. Kumar, R. Kuo, H.-S. Kuroyanagi, S. Lee, H.K. Lee, H.M. Lee, H.W. Leonardi, M. Lin, C.-Y. Lin, F.-L. Liu, G.C. Liu, Y. Majorana, E. Mano, S. Marchio, M. Matsui, T. Matsushima, F. Michimura, Y. Mio, N. Miyakawa, O. Miyamoto, A. Miyamoto, T. Miyo, K. Miyoki, S. Morii, W. Morisaki, S. Moriwaki, Y. Morozumi, T. Murakami, I. Musha, M. Nagano, K. Nagano, S. Nakamura, K. Nakamura, T. Nakano, H. Nakano, M. Nakao, K. Namai, Y. Narikawa, T. Naticchioni, L. Nguyen Quynh, L. Ni, W.-T. Nishizawa, A. Obuchi, Y. Ochi, T. Oh, J.J. Oh, S.H. Ohashi, M. Ohishi, N. Ohkawa, M. Okutomi, K. Ono, K. Oohara, K. Ooi, C.P. Pan, S.-S. Park, J. Peña Arellano, F.E. Pinto, I. Sago, N. Saijo, M. Saito, Y. Saitou, S. Sakai, K. Sakai, Y. Sakai, Y. Sasai, M. Sasaki, M. Sasaki, Y. Sato, N. Sato, S. Sato, T. Sekiguchi, Y. Seto, N. Shibata, M. Shimoda, T. Shinkai, H. Shishido, T. Shoda, A. Somiya, K. Son, E.J. Suemasa, A. Suzuki, T. Suzuki, T. Tagoshi, H. Tahara, H. Takahashi, H. Takahashi, R. Takamori, A. Takeda, H. Tanaka, H. Tanaka, K. Mitaka City Tokyo181-8588 Japan Mitaka City Tokyo181-8588 Japan Department of Physics University of Tokyo Bunkyo-ku Tokyo113-0033 Japan University of Tokyo Bunkyo-ku Tokyo113-0033 Japan KAGRA Observatory University of Tokyo Kashiwa CityChiba277-8582 Japan Tsukuba CityIbaraki305-0801 Japan Earthquake Research Institute University of Tokyo Bunkyo-ku Tokyo113-0032 Japan Department of Mathematics and Physics Hirosaki University Hirosaki City Aomori036-8561 Japan Kamioka-cho Hida City Gifu506-1205 Japan Mitaka City Tokyo181-8588 Japan Graduate School of Science and Technology Tokyo Institute of Technology Meguro-ku Tokyo152-8551 Japan KAGRA Observatory University of Tokyo Kamioka-cho Hida City Gifu506-1205 Japan Yuseong-gu Daejeon34141 Korea Republic of Graduate School of Science Osaka University Toyonaka CityOsaka560-0043 Japan Department of Physics National Taiwan Normal University sec. 4 Taipei116 Taiwan Department of Physics Sogang University Mapo-Gu Seoul121-742 Korea Republic of Institute of Physics Academia Sinica Nankang Taipei11529 Taiwan Department of Physics University of Toyama Toyama CityToyama930-8555 Japan Université Savoie Mont Blanc CNRS/IN2P3 AnnecyF-74941 France Department of Astronomy University of Tokyo Bunkyo-ku Tokyo113-0033 Japan Tsukuba CityIbaraki305-0801 Japan Department of Applied Physics Fukuoka University Jonan Fukuoka CityFukuoka814-0180 Japan Faculty of Engineering University of Toyama Toyama CityToyama930-8555 Japan University of Tokyo Kashiwa CityChiba277-8582 Japan Department of Physics National Central University Zhongli District Taoyuan City32001 Taiwan Center for High Energy and High Field Physics Zhongli District Taoyuan City32001 Taiwan Kyoto University Sakyou-ku Kyoto City Kyoto606-8502 Japan Graduate School of Science Osaka City University Sumiyoshi-ku Osaka CityOsaka558-8585 Japan JAXA Institute of Space and Astronautical Sc

KAGRA is a second-generation interferometric gravitational-wave detector with 3-km arms constructed at Kamioka, Gifu in Japan. It is now in its final installation phase, which we call bKAGRA (baseline KAGRA), with scientific observations expected to begin in late 2019. One of the advantages of KAGRA is its underground location of at least 200 m below the ground surface, which brings small seismic motion at low frequencies and high stability of the detector. Another advantage is that it cools down the sapphire test mass mirrors to cryogenic temperatures to reduce thermal noise. In April–May 2018, we have operated a 3-km Michelson interferometer with a cryogenic test mass for 10 days, which was the first time that km-scale interferometer was operated at cryogenic temperatures. In this article, we report the results of this "bKAGRA Phase 1" operation. We have demonstrated the feasibility of 3-km interferometer alignment and control with cryogenic mirrors. Copyright © 2019, The Authors. All rights reserved.

关键词： Mirrors

来源：评论

学校读者我要写书评

暂无评论

Unequal Failure Protection Coding Technology for Cloud Storage Systems

Unequal Failure Protection Coding Technology for Cloud Stora...

引用

IEEE International Conference on Cluster computing

作者： Yupeng Hu Yonghe Liu Wenjia Li Nong Xiao Zheng Qin Shu Yin College of Computer Science and Electronic Engineering Hunan University China Department of Computer Science and Engineering UT-Arlington USA Department of Computer Science New York Institute of Technology USA State Key Laboratory of High Performance Computing National University of Defense Technology China

ISBN: (纸本)9781509036547

In recent years, erasure codes have become the de facto standard for data protection of large scale distributed cloud storage systems at the cost of an affordable storage overhead. While traditional erasure coding schemes, such as Reed-Solomon codes, suffer from high reconstruction cost and I/Os. The recent past has seen a plethora of efforts to optimize the tradeoff between the reconstruction cost, I/Os and storage overhead. Quietly different from all prior studies, in this paper, our erasure coding technology makes the first attempt to take advantage of the unequal failure rates across the disks/nodes to optimize the reconstruction performance and system reliability. Specifically, our proposed technology, the Unequal Failure Protection based Local Reconstruction Code (UFP-LRC) divides the data blocks into several unequal-sized groups with local parities, assigning the data blocks stored on more failure-prone disks/nodes into the smaller-sized group, so as to provide unequal failure protection for each group. In this way, by exploiting the nonuniform local parity degrees, the proposed UFP-LRC enables the data blocks that are stored on more failure-prone disks/nodes to tolerate a greater number of failures while suffer from less repair cost than others, leading to a substantial improvement of overall repair performance and reliability for cloud storage system. We perform numerical analysis and build a prototype storage system to verify our approach. The analytical results show that the UFPLRC technique gradually outperforms LRC along the increase of failure rate ratio. Also, extensive experiments show that, when compared to LRC, UFP-LRC is able to achieve a 10% to 13% improvement in throughput, and a 8% to 12% reduction in decoding latency, while retaining a comparable overall reliability.

关键词： Cloud computing Encoding Maintenance engineering computer science Facebook Redundancy

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for supersymmetry in final states with two same-sign or three leptons and jets using 36 fb−1 of = 13 TeV pp collision data with the ATLAS detector

引用

Journal of high Energy Physics 2019年第8期2019卷 1-19页

作者： Aaboud, M. Aad, G. Abbott, B. Abdinov, O. Abeloos, B. Abidi, S. H. AbouZeid, O. S. Abraham, N. L. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B. S. Adachi, S. Adamczyk, L. Adelman, J. Adersberger, M. Adye, T. Affolder, A. A. Afik, Y. Agatonovic-Jovin, T. Agheorghiesei, C. Aguilar-Saavedra, J. A. Ahlen, S. P. Ahmadov, F. Aielli, G. Akatsuka, S. Akerstedt, H. Åkesson, T. P. A. Akilli, E. Akimov, A. V. Alberghi, G. L. Albert, J. Albicocco, P. Alconada Verzini, M. J. Alderweireldt, S. C. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexander, G. Alexopoulos, T. Alhroob, M. Ali, B. Aliev, M. Alimonti, G. Alison, J. Alkire, S. P. Allbrooke, B. M. M. Allen, B. W. Allport, P. P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Alshehri, A. A. Alstaty, M. I. Alvarez Gonzalez, B. Álvarez Piqueras, D. Alviggi, M. G. Amadio, B. T. Amaral Coutinho, Y. Amelung, C. Amidei, D. Amor Dos Santos, S. P. Amoroso, S. Amundsen, G. Anastopoulos, C. Ancu, L. S. Andari, N. Andeen, T. Anders, C. F. Anders, J. K. Anderson, K. J. Andreazza, A. Andrei, V. Angelidakis, S. Angelozzi, I. Angerami, A. Anisenkov, A. V. Anjos, N. Annovi, A. Antel, C. Antonelli, M. Antonov, A. Antrim, D. J. Anulli, F. Aoki, M. Aperio Bella, L. Arabidze, G. Arai, Y. Araque, J. P. Araujo Ferraz, V. Arce, A. T. H. Ardell, R. E. Arduh, F. A. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A. J. Armitage, L. J. Arnaez, O. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Artz, S. Asai, S. Asbah, N. Ashkenazi, A. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N. B. Augsten, K. Avolio, G. Axen, B. Ayoub, M. K. Azuelos, G. Baas, A. E. Baca, M. J. Bachacou, H. Bachas, K. Backes, M. Bagnaia, P. Bahmani, M. Bahrasemani, H. Baines, J. T. Bajic, M. Baker, O. K. Baldin, E. M. Balek, P. Balli, F. Balunas, W. K. Banas, E. Bandyopadhyay, A. Banerjee, Sw. Bannoura, A. A. E. Barak, L. Barberio, E. L. Barberis, D. Barbero, M. Barillari, T. Barisits, M-S Barkeloo, J. T. Barklow, T. Barlow, N. Barnes, S. L. Barnett, B. M. Barnett, R. M. Barnovska-Blenessy, Z Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman U.S.A. Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz U.S.A. Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene U.S.A. Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Udine Italy ICTP Trieste Italy Department of Physics King’s College London London United Kingdom International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb U.S.A. Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas – LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos Universidad de Granada Granada Portugal Department of Physics Boston University Boston U.S.A. Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Roma Italy Dip

One correction is made to the figure 4e of the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantum key distribution with distinguishable decoy states

arXiv

引用

arXiv 2017年

作者： Huang, Anqi Sun, Shi-Hai Liu, Zhihong Makarov, Vadim Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada College of Science National University of Defense Technology Changsha410073 China College of Mechatronic Engineering and Automation National University of Defense Technology Changsha410073 China Russian Quantum Center MISIS University Moscow Department of Physics and Astronomy University of Waterloo WaterlooONN2L 3G1 Canada

The decoy state protocol has been considered to be one of the most important methods to protect the security of quantum key distribution (QKD) with a weak coherent source. Here we test two experimental approaches to generating the decoy states with different intensities: modulation of the pump current of a semiconductor laser diode, and external modulation by an optical intensity modulator. The former approach shows a side-channel in the time domain that allows an attacker to distinguish s signal state from a decoy state, breaking a basic assumption in the protocol. We model a photon-number-splitting attack based on our experimental data, and show that it compromises the system's security. Then, based on the work of K. Tamaki et al. [New J. Phys. 18, 065008 (2016)], we obtain two analytical formulas to estimate the yield and error rate of single-photon pulses when the signal and decoy states are distinguishable. The distinguishability reduces the secure key rate below that of a perfect decoy-state protocol. To mitigate this reduction, we propose to calibrate the transmittance of the receiver (Bob's) unit. We apply our method to three QKD systems and estimate their secure key rates. Copyright © 2017, The Authors. All rights reserved.

关键词： Modulation

来源：评论

学校读者我要写书评

暂无评论

Parallel Erasure Coding: Exploring Task Parallelism in Erasure Coding for Enhanced Bandwidth and Energy Efficiency

Parallel Erasure Coding: Exploring Task Parallelism in Erasu...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Hsing-bung Chen Song Fu High Performance Computing-Design Group Los Alamos National Laboratory Los Alamos New Mexico USA Department of Computer Science and Engineering University of North Texas Denton Texas USA

ISBN: (纸本)9781509033164

Very large data sets within the range of megabytes to terabytes generated daily from checkpoint-and- restart processes are seen in today's scientific simulations. Reliability and durability are two important factors to build an archive storage system. Erasure code based object storage systems are becoming popular choices for archive storage systems due to cost-effective storage space saving schemes and higher fault-resilience capabilities. Both erasure code encoding and decoding procedures involve heavy array, matrix, and table-lookup compute intensive operations. Current solutions of the erasure coding process are based on single process approach which is not capable of processing very large data sets efficient and effectively. In this paper, we address the bottleneck problem of single process erasure encoding by leveraging task parallelism offered by multi-core computers. We add parallel processing capability to the erasure coding process. More specifically, we develop a parallel erasure coding software, called parEC. It explores the MPI run time parallel I/O environment and integrates data placement process for distributing encoded data blocks to destination storage devices. We evaluate the performance of parEC in terms of both encoding throughput and energy efficiency. We also compare the performance of two task scheduling algorithms for parEC. Our experimental results show parEC can significantly reduce the encoding time (i.e., by 74.06%-96.86%) and energy consumption (i.e., by 73.57%-96.86%), and Demand-based Workload Assignment (DBWA) algorithm can a high system utilization (i.e., 95.23%).

关键词： Encoding Multicore processing Parallel processing Servers Testing Software systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：