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

2012 From Antikythera to the Square Kilometre Array: Lessons from the Ancients, Antikythera and SKA 2012

作者： Roumeliotis, Manos Computer Architecture Department of Technology Management University of Macedonia Thessaloniki Greece

computer simulation is a modeling and verification tool that is used primarily for mathematical, dynamic, arithmetic models. It is particularly suitable for the study of complex multivariable systems, the verification of a design before the machine is actually built, and the analysis of probabilistic systems. In the case of the Antikythera Mechanism we are faced with a completely deterministic system with a single input. However, the operation of this fascinating mechanism is not known in its entirety, derived only by the parts of the mechanism that have been found and studied. Since it is considered by many to be the first portable computer ever built, it is very appropriate to use a modern date computer simulation for validating the functional description of the machine, as well as estimating the possible operation of missing parts. From identifying errors in Derek de Solla Price's drawings, to understanding the implementation of the Hipparchos lunar orbit observations, to calculating the exact tolerances required for the construction of a physical model, the simulation of the mechanism has been proven invaluable. In addition, computer simulation is readily available to any researcher or scholar, and can even be used for educational purposes, whenever a physical model is unavailable. Even if a physical model is available and accessible, it can only be used for demonstration purposes. On the contrary, a simulation model can be easily calibrated to exact dates by computationally "turning" the gears to the required time. Then, it can be used for calculating astronomical phenomena in accordance to the mechanism's original design, without the need for cumbersome adjustments. Finally, as new data about the Antikythera Mechanism become available, the simulation model can be easily reconfigured to take into account the new findings, while a physical model is much more difficult to modify. © 2018 Copyright owned by the author(s) under the terms of the Creative Commons Attr

关键词： Orbits

来源：评论

学校读者我要写书评

暂无评论

Combined Measurement of the Higgs Boson Mass in pp Collisions at s=7 and 8 TeV with the ATLAS and CMS Experiments

引用

Physical Review Letters 2015年第19期114卷 191803-191803页

作者： G. Aad B. Abbott J. Abdallah O. Abdinov R. Aben M. Abolins O. S. AbouZeid H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams J. Adelman S. Adomeit T. Adye A. A. Affolder T. Agatonovic-Jovin J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson G. Akimoto A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob G. Alimonti L. Alio J. Alison S. P. Alkire B. M. M. Allbrooke P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. Altheimer B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio K. Amako Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso N. Amram G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi M. Antonelli A. Antonov J. Antos F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque A. T. H. Arce F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster O. Arnaez V. Arnal H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Asai N. Asbah A. Ashkenazi B. Åsman L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay B. Auerbach K. Augsten M. Aurousseau G. Avolio B. Axen M. K. Ayoub G. Azuelos M. A. Baak A. E. Baas C. Bacci H. Bachacou K. Bachas M. Backes M. Backhaus E. Badescu P. Bagiacchi P. Bagnaia Y. Bai T. Bain J. T. Baines O. K. Baker P. Balek T. Balestri F. Balli E. Banas Sw. Banerjee A. A. E. Bannoura H. S. Bansil L. Barak S. P. Baranov E. L. Barberio D. Barberis M. Barbero T. Barillari M. Barisonzi T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska A. Baroncelli G. Barone A. J. Barr F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Bassalat A. Basye R. L. Bates S. J. Batista J. R. Batley M. Battaglia M. Bauce F. Bauer H. S. Bawa J. B. Beach CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institute of Physics Academia Sinica Taipei Taiwan Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Department of Physics and Astronomy Michigan State University East Lansing Michigan USA Department of Physics University of Toronto Toronto Ontario Canada 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 CERN Geneva Switzerland Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton New York USA Department of Physics Northern Illinois University DeKalb Illinois USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Oliver Lodge Laboratory University of Liverpool Liverpool United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Laboratorio de Instrumentacao e Fisica Experimental de Particulas-LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada (Spain) Portugal Department of Physics Boston University Boston Massachusetts USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Roma Italy Dipartimento di Fisica Università di Roma Tor Vergata Roma Italy Fysiska institutionen Lunds universitet Lund Sweden International Center for Elementary Particle Physics and Depart

A measurement of the Higgs boson mass is presented based on the combined data samples of the ATLAS and CMS experiments at the CERN LHC in the H→γγ and H→ZZ→4ℓ decay channels. The results are obtained from a simultaneous fit to the reconstructed invariant mass peaks in the two channels and for the two experiments. The measured masses from the individual channels and the two experiments are found to be consistent among themselves. The combined measured mass of the Higgs boson is mH=125.09±0.21 (stat)±0.11 (syst) GeV.

关键词： HIGGS bosons RESEARCH COLLISIONS (Nuclear physics) ATLAS (computer program language) REST mass (Relativity) BOSONS

来源：评论

学校读者我要写书评

暂无评论

Way sharing set associative cache architecture

Way sharing set associative cache architecture

引用

25th International Conference on VLSI Design, VLSID 2012 and the 11th International Conference on Embedded Systems

作者： Janraj, C.J. Kalyan, T. Venkata Warrier, Tripti Mutyam, Madhu Computer Architecture and Systems Laboratory Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 India

ISBN: (纸本)9780769546384

In order to minimize the conflict miss rate, cache memories can be organized in set-associative manner. The downside of increasing the associativity is increase in the per access energy consumption. In conventional n-way set-associative caches, irrespective of the set-wise demand, each set has n cache ways at its disposal, but cache sets may exhibit nonuniform demand for these cache ways. Exploiting this property, we propose a novel cache architecture, called way sharing cache, wherein by allowing sharing of cache ways among a pair of cache sets, we obtain dynamic energy savings as high as 41% in DL1 cache with negligible performance penalty. © 2012 IEEE.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

A comparative evaluation of parallel programming models for shared-memory architectures

A comparative evaluation of parallel programming models for ...

引用

2012 10th IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2012

作者： Sanchez, Luis Miguel Fernandez, Javier Sotomayor, Rafael Garcia, J. Daniel Computer Architecture and Technology Area Computer Science Department Universidad Carlos III De Madrid Madrid Colmenarejo 28270 Spain

ISBN: (纸本)9780769547015

Nowadays, most computers that are commercially available off-the-shelf (COTS) include hardware features that increase the performance of parallel general-purpose threads (hyper threading, multicore, ccNUMA architectures) or SIMD kernels (CPU vector instructions, GPUs). The purpose of this paper is to perform a compared evaluation of several parallel programming models where each one is fitted to exploit some of these features but also each one requires a different level of programming skills. Four parallel programming models (OpenMP, Intel TBB, Intel ArBB, and CUDA) have been selected. The idea is to cover a wide spectrum of programming models and most of the parallel hardware features included in modern computers. On one hand, OpenMP and TBB platforms, that exploit parallel threads running on multicore systems. On the other hand, ArBB, that combines muticore parallel threads and multicore SIMD features with a simpler programming model, and CUDA that exploits SIMD features of the GPU hardware. Our results obtained with the benchmarks used on this paper suggest that OpenMP and TBB have a lower performance compared to ArBB and CUDA. But also that ArBB performance tends to be comparable with CUDA performance in most cases (although it is normally lower). Thus, there are evidences that a careful designed top range multicore and multisocket architecture, can be comparable in terms of performance with top range GPU cards for many applications, with the advantage of a simpler programming model. © 2012 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Improving communication in PGAS environments: Static and dynamic coalescing in UPC 13

Improving communication in PGAS environments: Static and dyn...

引用

27th ACM International Conference on Supercomputing, ICS 2013

作者： Alvanos, Michail Farreras, Montse Tiotto, Ettore Amaral, José Nelson Martorell, Xavier Programming Models Barcelona Supercomputer Center Barcelona Spain Department of Computer Architecture Universitat Politecnica de Catalunya Cr. Jordi Girona 1-3 08034 Barcelona Spain Static Compilation Technology IBM Toronto Laboratory Toronto ON Canada Dep. of Computing Science University of Alberta Edmonton AB Canada Barcelona Supercomputing Center Cr. Jordi Girona 29 08034 Barcelona Spain IBM Canada CAS Research Markham ON Canada

ISBN: (纸本)9781450321303

The goal of Partitioned Global Address Space (PGAS) languages is to improve programmer productivity in large scale parallel machines. However, PGAS programs may have many fine-grained shared accesses that lead to performance degradation. Manual code transformations or compiler optimizations are required to improve the performance of programs with fine-grained accesses. The downside of manual code transformations is the increased program complexity that hinders programmer productivity. On the other hand, most compiler optimizations of fine-grain accesses require knowledge of physical data mapping and the use of parallel loop constructs. This paper presents an optimization for the Unified Parallel C language that combines compile time (static) and runtime (dynamic) coalescing of shared data, without the knowledge of physical data mapping. Larger messages increase the network efficiency and static coalescing decreases the overhead of library calls. The performance evaluation uses two microbenchmarks and three benchmarks to obtain scaling and absolute performance numbers on up to 32768 cores of a Power 775 machine. Our results show that the compiler transformation results in speedups from 1.15X up to 21X compared with the baseline versions and that they achieve up to 63% the performance of the MPI versions. © 2013 ACM.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Thoughts on the application of digital substation

Thoughts on the application of digital substation

引用

2012 8th International Conference on Computing and Networking technology (INC, ICCIS and ICMIC), ICCNT 2012

作者： Yue, Jie Zhao, Mingzhan Wang, Qinglin Computer Science and Technology Department Hebei Institute of Architecture Civil Engineering Zhangjiakou China

ISBN: (纸本)9788994364179

Digitized substation is the substation automation technology of the popular development direction, compared with the traditional transformer substation equipment, equipments and information system has had a great changes. In the faster and faster pace of digital process, the actual application also comes across the problem such as design and construction. These problems prompted us to experience the superior performance of digital more comprehensive understanding of the nature of the digital, to better serve the safety in production, promote modernization substation management development. © 2012 AICIT.

关键词： Wind power

来源：评论

学校读者我要写书评

暂无评论

On Computational Aspects of a Regular n-Simplex Bisection

On Computational Aspects of a Regular n-Simplex Bisection

引用

International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Guillermo Aparicio Leocadio G. Casado Eligius M.T. Hendrix Inmaculada García Boglárka G. Tóth Research Group TIC146: High Performance Computing - Algorithms University of Almería (ceiA3) Spain Informatics Department University of Almería (ceiA3) Spain Department of Computer Architecture University of Málaga Spain Department of Differential Equations Budapest University of Technology and Economics Hungary

Branch-and-Bound (B&B) algorithms to solve Global Optimization (GO) may use n-simplicial partition sets. The n-simplex represents an n-dimensional body with n+1 vertices in (n+1)-dimensional space. The aim of this article is to investigate the properties of the binary tree generated by iterative bisection of the longest edge (LE) of the regular n-simplex as search space. This way of splitting an n-simplex reduces the appearance of bad shaped simplices which facilitates the convergence of the algorithm. It also helps to have a more uniform sampling of the search space since the function is evaluated at vertices of simplices. A motivation for this research is the estimation of the pending computational work load during the B&B GO algorithm. Such estimation may be helpful to steer parallel versions of the algorithms. In this paper we will show that the way the longest edge is selected affects on the number of sub-problems, the number of similar shapes of those sub-problems and their roundness factor. The computational cost to obtain those metrics increases with the dimension n. Here we show the results for n leq 3, where for n=3, we have a 3-dimensional body in a 4-dimensional space. Due to the exponential growth of the binary tree, high performance computing is useful in order to reach a high precision or when n eq 3. We make use of parallel computing under MATLAB software.

关键词： Binary trees Shape Silicon Indexes Educational institutions Electronic mail Optimization

来源：评论

学校读者我要写书评

暂无评论

Supporting cloud deployment in the *** community network

引用

International Global Information Infrastructure Symposium (GIIS)

作者： Javi Jiménez Roger Baig Pau Escrich Amin M. Khan Felix Freitag Leandro Navarro Ermanno Pietrosemoli Marco Zennaro Amir H. Payberah Vladimir Vlassov Fundació Privada per la Xarxa Lliure Oberta i Neural ***. Mas l'Esperana Gurb Catalonia Department of Computer Architecture Universitat Politècnica de Catalunya Barcelona Spain The Abdus Salam International Centre for Theoretical Physics (ICTP) Trieste Italy The Swedish Institute of Computer Science (SICS) Stockholm Sweden KTH Royal Institute of Technology Stockholm Sweden

Community networking is an emerging model of a shared communication infrastructure in which communities of citizens build and own open networks. Community networks offer successfully IP-based networking to the user. Cloud computing infrastructures however, while common in today's Internet, hardy exist in community networks. We explain our approach to bring clouds into the *** community network. For this we have started integrating part of our cloud prototype into the *** community network management tools. A proof-of-concept cloud infrastructure is currently under deployment in the *** community network. Our long term vision is that the users of community networks will not need to consume cloud applications from the Internet, but find them within the community network.

关键词： Communities Cloud computing Virtual machining Prototypes Operating systems

来源：评论

学校读者我要写书评

暂无评论

An intelligent electronic device prototype for electric vehicle environments

An intelligent electronic device prototype for electric vehi...

引用

2012 IEEE 2nd International Conference on Consumer Electronics - Berlin, ICCE 2012

作者： Real-Calvo, R.J. Luna Rodriguez, J.J. Osuna Carmona, V. Bellido Outeirino, F.J. Santiago Chiquero, I. Computer Architecture Electronics and Electronics Technology Department University of Cordoba UCO Cordoba 14071 Spain

ISBN: (纸本)9781467315470

In the future scenario of transport and human mobility, the optimization of electric vehicles and their infrastructures (transport and energy supply) will be a key. This is the reason why it will have to provide adequate intelligent systems, both in electric vehicles and in infrastructures that provide service. Moreover, the development nowadays of Intelligent Electronic Devices (IED) and communications Machine To Machine (M2M) have enabled commercial solutions with relatively inexpensive cost. This paper discusses the design of M2M-based IED to develop a prototype with a flexible architecture, incorporating GPRS as wireless WAN solution and GPS technology to equip the system with geo-location functions, in order to cover future applications between electric vehicles and the different infrastructures to provide service. © 2012 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Design of an intelligent electronic device to control a private microgrid

Design of an intelligent electronic device to control a priv...

引用

2012 IEEE 2nd International Conference on Consumer Electronics - Berlin, ICCE 2012

作者： Real-Calvo, R.J. Moreno-Muñoz, A. Pallares-Lopez, V. Gonzalez-Redondo, M.J. Moreno-Garcia, I.M. Computer Architecture Electronics and Electronics Technology Department University of Cordoba UCO Cordoba 14071 Spain

ISBN: (纸本)9781467315470

The context of energy diversification of the electricity market has triggered that many users have decided to invest in their own micro-grid to meet their needs. Moreover, at present the concept of Smart Grid is driving that all entities involved in the electricity market tend to form an open network where everyone can interact with each other, including those who use renewable energy. This document explains how must be an Intelligent Electronic Device (IED) that allows the user to control their micro-grid, describing what must be the functionality and architecture of this system. Finally, we present an IED prototype based on combining a processor and a FPGA to control a micro-grid. © 2012 IEEE.

关键词： Power markets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：