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

Measurement of dijet azimuthal decorrelations in pp collisions at s=8 TeV with the ATLAS detector and determination of the strong coupling

引用

Physical Review D 2018年第9期98卷 092004-092004页

作者： M. Aaboud G. Aad B. Abbott O. Abdinov B. Abeloos S. H. Abidi O. S. AbouZeid N. L. Abraham H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya S. Adachi L. Adamczyk J. Adelman M. Adersberger T. Adye A. A. Affolder Y. Afik T. Agatonovic-Jovin C. Agheorghiesei J. A. Aguilar-Saavedra F. Ahmadov G. Aielli S. Akatsuka H. Akerstedt T. P. A. Åkesson E. Akilli A. V. Akimov G. L. Alberghi J. Albert P. Albicocco M. J. Alconada Verzini S. Alderweireldt M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob B. Ali G. Alimonti J. Alison S. P. Alkire B. M. M. Allbrooke B. W. Allen P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. A. Alshehri M. I. Alstaty B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos S. Amoroso G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi A. Angerami A. V. Anisenkov N. Anjos A. Annovi C. Antel M. Antonelli A. Antonov D. J. A. Antrim F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque V. Araujo Ferraz A. T. H. Arce R. E. Ardell F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster L. J. Armitage O. Arnaez H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Artz S. Asai N. Asbah A. Ashkenazi L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay K. Augsten G. Avolio B. Axen M. K. Ayoub G. Azuelos A. E. Baas M. J. Baca H. Bachacou K. Bachas M. Backes P. Bagnaia M. Bahmani H. Bahrasemani J. T. Baines M. Bajic O. K. Baker P. J. Bakker E. M. Baldin P. Balek F. Balli W. K. Balunas E. Banas A. Bandyopadhyay S. Banerjee A. A. E. Bannoura L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M-S. Barisits J. Barkeloo T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska-Blenessy A. Baroncelli G. Barone A. J. Barr L. Barranco Navarro F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Basalaev A. Bassalat R. Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Université Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Ontario Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz California USA 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 Oregon USA Department of Physics Stockholm University Sweden Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy International Center for Elementary Particle Physics and Department of Physics 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 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 Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Departamento de Física Teorica y del Cosmos Universidad de Granada Granada (Spain) Spain Laboratório de Instrumentação e Física Experimental de Partículas - LIP Portugal Joint Institute for Nuclear Research Dubna Russia INFN Sezione di Roma Tor Vergata Italy Dipartimento di Fisica Università di Roma Tor Vergata Roma Italy Faculty of Science Kyoto University Kyot

A measurement of the rapidity and transverse momentum dependence of dijet azimuthal decorrelations is presented, using the quantity RΔϕ. The quantity RΔϕ specifies the fraction of the inclusive dijet events in which the azimuthal opening angle of the two jets with the highest transverse momenta is less than a given value of the parameter Δϕmax. The quantity RΔϕ is measured in proton-proton collisions at s=8 TeV as a function of the dijet rapidity interval, the event total scalar transverse momentum, and Δϕmax. The measurement uses an event sample corresponding to an integrated luminosity of 20.2 fb−1 collected with the ATLAS detector at the CERN Large Hadron Collider. Predictions of a perturbative QCD calculation at next-to-leading order in the strong coupling with corrections for nonperturbative effects are compared to the data. The theoretical predictions describe the data in the whole kinematic region. The data are used to determine the strong coupling αS and to study its running for momentum transfers from 260 GeV to above 1.6 TeV. Analysis that combines data at all momentum transfers results in αS(mZ)=0.1127−0.0027+0.0063.

关键词： Perturbative QCD Quantum chromodynamics Quark & gluon jets

来源：评论

学校读者我要写书评

暂无评论

Static-Dynamic Control Flow Integrity

Static-Dynamic Control Flow Integrity

引用

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

作者： Xiaolong Liu Qiang Wei Ziwei Ye State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479978724

CCFIR (Compact Control Flow Integrity and Randomization) has low performance overhead as an exploit mitigation, but it is hard to mitigate exploits by hijacking virtual function pointer, which are emerging in recent years. Because of the polymorphism of virtual functions, CCFIR can't determine a unique spring board stub. We propose a new practical protection method named SDCFI (Static-Dynamic Control Flow Integrity), whose goal is to protect virtual function pointers from hijacking. Taking advantage of static analysis result of IDA and PIN dynamic instrumentation, SDCFI improves the accuracy of the disassembly and identifies indirect call target addresses at runtime. We observe that there are always double 0x90 bytes for alignment in the gap between two functions, which can be substituted by a two-byte checkmark. Using the checkmark, SDCFI can validate a target more simply and faster than traditional CFI. Based on these approaches, SDCFI can prevent control-flow hijacking attacks including ROP, because the gadgets of stack pivot can't pass the validation. We evaluate our prototype implementation for Internet Explorer8 browser on Windows XP, which faces serious security threats since April 8, 2014. SDCFI protects most indirect call instructions in ***, and has low runtime overhead of 1.48% on average. Experiments on real-world exploits for IE8 browser also show that SDCFI can effectively mitigate exploits by hijacking virtual function pointer.

关键词： Runtime Browsers Registers Instruments Security Internet Accuracy

来源：评论

学校读者我要写书评

暂无评论

Method of multi-feature fusion based on SVM and D-S evidence theory in Trojan detection

引用

Computer Modelling and New Technologies 2014年第6期18卷 304-310页

作者： Liu, Shengli Gao, Xiang Xu, Pan Liu, Long State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

According to the low accuracy and low stability of the single feature-based method for Trojan detection, a multi-feature fusion method based on SVM and DS evidence theory is proposed. First, three types of flow features such as session, upload data of session/download data of session, distribution of data packet size are extracted from the data stream. Then the SVM classification results of each single feature are used as evidences to construct the basic probability assigned (BPA). Finally, we use DS combination rule of evidence to achieve the decision fusion and give the final detection results by fusion results. The experimental results showed that the accuracy of multi-feature fusion method was 97.48% which has good performance on accuracy and stability compared with the single feature method in Trojan detection.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Detecting Information Leakage Based on Subtracting Matrix

Detecting Information Leakage Based on Subtracting Matrix

引用

International Symposium on Computational Intelligence and Design, ISCID

作者： Zongda Han Binglong Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479970063

This paper proposes an approach of detecting information leakage based on subtracting matrix to determine files when and where were leaked from file system. Due to the low efficiency of detecting leak operation and the rapid growth of the size of storage device make it difficult to locate the place where the leakage occurred. We build a time matrix model by file system access timestamps in a suspicious information system. Then three kinds of two-value (0-1) matrices are generated based on the similarity of access timestamps in the time matrix. The behavior of information leakage can be finally determined by comparing the degree of the similarity in these matrices. The experimental results show the method can detect information leakage more quickly and accurately.

关键词： File systems Measurement Probability distribution Forensics Time complexity Drives Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Leveraging Markov chain and optimal mutation strategy for smart fuzzing

Leveraging Markov chain and optimal mutation strategy for sm...

引用

ICINS 2014 - 2014 International Conference on Information and Network Security

作者： Yongji Ouyang Zehui Wu Qing Mu Qingxian Wang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781510804289

Fuzz testing is an important way of vulnerability discovery, however, the existing fuzzers based on symbolic execution and others have inherent shortcomings like needing more computing resource, in-depth analysis and so on. To solve above problems, this paper presents a smart fuzzing method based on Markov chain. Firstly, this method optimizes the testing input sample to get the minimal sample set. Secondly, this method records program execution information by using instrument, and makes a Markov model about state. Finally, this method uses Markov chain to detect the change of execution path, and leads tester to choose better samples to mutate. Meanwhile, we analyse mutation strategies in depth for better triggering exception. Experimental data shows that the presented method can help fuzzer to generate effective test samples. We discovers 51 vulnerabilities in software like WPS, along with the code coverage increases of nearly 49% comparing with zzuf and the average exception discovery rate increase nearly 9 times comparing with MiniFuzz.

关键词： Markov chain Mutation strategies Smart fuzzing Vulnerability discovery Markov chain PILLING execution path WPS

来源：评论

学校读者我要写书评

暂无评论

Cryptographic Algorithms Analysis Technology Research Based on Functions Signature Recognition

Cryptographic Algorithms Analysis Technology Research Based ...

引用

International Conference on Computational Intelligence and Security

作者： Rui Chang Liehui Jiang Hui Shu Hongqi He MEAC State Key Laboratory of Mathematic Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479974351

At present, the research on software reverse engineering pays more attention to cryptographic algorithms recognition and analysis. Malwares are becoming increasingly stealthy, more and more malwares are using cryptographic algorithms to protect themselves from being analyzed. There are no mature theory and tools to analyze cryptographic algorithms from the executable files effectively and exactly. In order to solve the problem efficiently, this paper discusses functions signature recognition technology, creating the cryptographic algorithms library including more than 3000 signature characteristics, and explores a way to recognize cryptographic algorithms based on functions signature recognition. Finally, the experiment results indicate the method is effective and feasible.

关键词： Libraries Algorithm design and analysis Feature extraction Software algorithms Character recognition Ciphers

来源：评论

学校读者我要写书评

暂无评论

Migration of CUDA Program Based on a Divide-and-Conquer Method

Migration of CUDA Program Based on a Divide-and-Conquer Meth...

引用

IEEE International Conference on Computational Science and engineering, CSE

作者： Nan Li Jianmin Pang Zheng Shan State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan China

ISBN: (纸本)9781479979820

Porting CUDA program to other heterogeneous and many-core platform especially native processor is very meaningful for extending the range of the CUDA application, taking advantage of many-core on target platform and supporting national industries. Traditional binary translation technique is not competent to this task. On the point of software reverse engineering, it is feasible to design a new migration framework to port CUDA program in which the host-end codes and device-end codes are translated separately based on a method of Divide-and-Conquer. In the course of migration, the solutions of several key problems are described emphatically such as the extraction of device-end codes, the mapping of computing model and storage model, synchronization barrier and instruction translation. The experimental result validates the system's accuracy.

关键词： Graphics processing units Synchronization Instruction sets Computational modeling Kernel Computer architecture Programming

来源：评论

学校读者我要写书评

暂无评论

Parallelized Race Detection Based on GPU Architecture

Parallelized Race Detection Based on GPU Architecture

引用

10th Annual Conference of advanced Computer Architecture, ACA 2014

作者： Dai, Zhuofang Zhang, Zheng Wang, Haojun Li, Yi Zhang, Weihua Software School Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China Parallel Processing Institute Fudan University Shanghai 201203 China State Key Laboratory of Mathematic Engineering and Advanced Computing Zhengzhou 450001 China

ISBN: (纸本)9783662444900

In order to harness abundant hardware resources, parallel programming has become a necessity in multicore era. However, parallel programs are prone to concurrency bugs, especially data races. Even worse, current software tools always suffer from both large runtime overheads and poor scalability, while most of hardware supports for race detection are not available in parallel programming. Therefore, it has been a challenge that how to introduce a practical and fast race detection tools. Nowadays, GPUs with massive parallel computation resources have become one of the most popular hardware platforms. Hence, the prevalence of GPU architectures has opened an opportunity of accelerating data race detection. In this paper, we first have a deeply analysis on data race detection algorithms like happens-before and observe that these algorithms have very good computation and data parallelism. Based on the observation, we propose Grace, a software approach that leverages massive parallelism computation units of GPU architectures to accelerate data race detection. Grace deploys detection, the most computation intensive workload, on GPU to fully utilize the computation resource in GPU. Moreover, Grace leverages coarse-grained pipeline parallelism and data parallelism through exploiting the computation resource in multi-core CPUs to further improve performance. Experimental results show that Grace is fast and scalable. It achieves over 80x speedup compared to the sequential version even under a 128-thread configuration. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Cross-platform parallel programming in PARRAY: A case study

Cross-platform parallel programming in PARRAY: A case study

引用

11th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2014

作者： Cui, Xiang Li, Xiaowen Chen, Yifeng HCST Key Lab. School of EECS Peking University Beijing China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China Air Defense Forces Academy Zhengzhou China College of Computer and Information Engineering Henan University Kaifeng China

ISBN: (纸本)9783662449165

PARRAY (or Parallelizing ARRAYs) is an extension of C language that supports system-level succinct programming for heterogeneous parallel systems. Parray extends mainstream C programming with novel array types. This leads to shorter, more portable and maintainable parallel codes, while the programmer still has control over performance-related features necessary for deep manual optimization. This paper uses the case study on stepwise program refinement of matrix transposition to illustrate the basic techniques of PARRAY programming. © 2014 IFIP International Federation for Information Processing.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

An Improved Demand-Driven Pointer Alias Analysis Algorithm

An Improved Demand-Driven Pointer Alias Analysis Algorithm

引用

2014 International Conference on Computer,Network Security and Communication engineering(CNSCE 2014)

作者： Peng LIU Rong-cai ZHAO Wei GAO Xiang-jie MENG State Key Laboratory of Mathematical Engineering and Advanced Computing Personnel Department of Henan Meteorological Bureau

Pointer alias analysis is a key technology in dataflow analysis, the analysis results are the basis of compilation optimization and program transformation. Based on the analysis of demand-driven pointer analysis algorithms, the imprecision of demand driven alias analysis algorithm of one level flow is studied. Combined with two demand driven analysis algorithms, an improved pointer alias analysis algorithm is proposed. Finally the algorithm is evaluated on SPEC2006 benchmark, the experiment results show that the algorithm has high precision and fine scalability than the other two.

关键词： Pointer alias analysis Demand driven Context-free language Scalability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：