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

arXiv 2020年

作者： Sirunyan, A.M. Tumasyan, A. Adam, W. Bergauer, T. Dragicevic, M. Erö, J. Escalante Del Valle, A. Frühwirth, R. Jeitler, M. Krammer, N. Lechner, L. Liko, D. Madlener, T. Mikulec, I. Pitters, F.M. Rad, N. Schieck, J. Schöfbeck, R. Spanring, M. Templ, S. Waltenberger, W. Wulz, C.-E. Zarucki, M. Chekhovsky, V. Litomin, A. Makarenko, V. Suarez Gonzalez, J. Darwish, M.R. de Wolf, E.A. Di Croce, D. Janssen, X. Kello, T. Lelek, A. Pieters, M. Rejeb Sfar, H. van Haevermaet, H. van Mechelen, P. van Putte, S. van Remortel, N. Blekman, F. Bols, E.S. Chhibra, S.S. D’Hondt, J. de Clercq, J. Lontkovskyi, D. Lowette, S. Marchesini, I. Moortgat, S. Morton, A. Python, Q. Tavernier, S. van Doninck, W. van Mulders, P. Beghin, D. Bilin, B. Clerbaux, B. de Lentdecker, G. Dorney, B. Favart, L. Grebenyuk, A. Kalsi, A.K. Makarenko, I. Moureaux, L. Pétré, L. Popov, A. Postiau, N. Starling, E. Thomas, L. Vander Velde, C. Vanlaer, P. Vannerom, D. Wezenbeek, L. Cornelis, T. Dobur, D. Gruchala, M. Khvastunov, I. Niedziela, M. Roskas, C. Skovpen, K. Tytgat, M. Verbeke, W. Vermassen, B. Vit, M. Bruno, G. Bury, F. Caputo, C. David, P. Delaere, C. Delcourt, M. Donertas, I.S. Giammanco, A. Lemaitre, V. Mondal, K. Prisciandaro, J. Taliercio, A. Teklishyn, M. Vischia, P. Wertz, S. Wuyckens, S. Alves, G.A. Hensel, C. Moraes, A. Aldá Júnior, W.L. Belchior Batista Das Chagas, E. Brandao Malbouisson, H. Carvalho, W. Chinellato, J. Coelho, E. da Costa, E.M. da Silveira, G.G. de Jesus Damiao, D. Fonseca De Souza, S. Martins, J. Matos Figueiredo, D. Medina Jaime, M. Mora Herrera, C. Mundim, L. Nogima, H. Rebello Teles, P. Sanchez Rosas, L.J. Santoro, A. Silva Do Amaral, S.M. Sznajder, A. Thiel, M. Torres Da Silva De Araujo, F. Vilela Pereira, A. Bernardes, C.A. Calligaris, L. Fernandez Perez Tomei, T.R. Gregores, E.M. Lemos, D.S. Mercadante, P.G. Novaes, S.F. Padula, Sandra S. Aleksandrov, A. Antchev, G. Atanasov, I. Hadjiiska, R. Iaydjiev, P. Misheva, M. Rodozov, M. Shopova, M. Sultanov, G. Bonchev, M. Dimitrov, A. Ivanov, T. Litov, L. Pavlov, B. Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Wien Austria Institute for Nuclear Problems Minsk Belarus Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium Ghent University Ghent Belgium Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual Paulista São Paulo Brazil Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Sun Yat-Sen University Guangzhou China Institute of Modern Physics and Key Laboratory of Nuclear Physics and Ion-beam Application MOE Fudan University Shanghai China Zhejiang University Hangzhou China Universidad de Los Andes Bogota Colombia Universidad de Antioquia Medellin Colombia University of Split Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture Split Croatia University of Split Faculty of Science Split Croatia Institute Rudjer Boskovic Zagreb Croatia University of Cyprus Nicosia Cyprus Charles University Prague Czech Republic Escuela Politecnica Nacional Quito Ecuador Universidad San Francisco de Quito Quito Ecuador Academy of Scientific Research and Technology of the Arab Republic of Egypt Egyptian Network of High Energy Physics Cairo Egypt Center for High Energy Physics CHEP-FU Fayoum University El-Fayoum Egypt National Institute of Chemical Physics and Biophysics Tallinn Estonia Department of Physics University of Helsinki Helsinki Finland Helsinki Institute of Physics Helsinki Finland La

Decays of the 125 GeV Higgs boson into a Z boson and a ρ0(770) or φ(1020) meson are searched for using proton-proton collision data collected by the CMS experiment at the LHC at √s = 13 TeV. The analysed data set corresponds to an integrated luminosity of 137 fb−1. Events are selected in which the Z boson decays into a pair of electrons or a pair of muons, and the ρ and φ mesons decay into pairs of pions and kaons, respectively. No significant excess above the background model is observed. As different polarization states are possible for the decay products of the Z boson and ρ or φ mesons, affecting the signal acceptance, scenarios in which the decays are longitudinally or transversely polarized are considered. Upper limits at the 95% confidence level on the Higgs boson branching fractions into Zρ and Zφ are determined to be 1.04–1.31% and 0.31–0.40%, respectively, where the ranges reflect the considered polarization scenarios;these values are 740–940 and 730–950 times larger than the respective standard model expectations. These results constitute the first experimental limits on the two decay channels. Copyright © 2020, The Authors. All rights reserved.

关键词： Bosons

来源：评论

学校读者我要写书评

暂无评论

A software trustworthiness measure based on the decompositions of trustworthy attributes and its validation

A software trustworthiness measure based on the decompositio...

引用

International Conference on Industrial engineering, Management Science and Applications, ICIMSA 2015

作者： Tao, Hongwei Chen, Yixiang Pang, Jianmin State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou45002 China MoE Engineering Center for Software/Hardware Co-Design Technology and Application East China Normal University Shanghai200062 China

ISBN: (纸本)9783662471999

There exist many software trustworthiness measures based on the decompositions of attributes. However, few of them are concerned with using more rigorous approaches to measure software trustworthiness and carrying out the theoretical validation of measures. Axiomatic approaches formalize the empirical understanding of a software attribute through the definition of a set of desirable software measure properties. It can provide precise and formal terms for the quantification of software attributes. We once used axiomatic approaches to measure software trustworthiness based on multi-dimensional attributes, in this paper, based on previous works, we apply axiomatic approaches to measure software trustworthiness based on the decompositions of attributes, propose the desirable properties of software trustworthiness measures based on the decompositions of attributes, present a software trustworthiness measure and validate this measure from the theory by proving that it complies with the set of properties. Compared with the popular software trustworthiness measures, this measure can evaluate software trustworthiness better in view of our properties. © Springer-Verlag Berlin Heidelberg 2015.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Micro-structure characteristics of undisturbed expansive soil under the wetting-drying effect

引用

International Symposium on Geomechanics from Micro to Macro, IS-Cambridge 2014

作者： Wang, Y. Kong, L.W. Wang, Y.L. Liu, T. State Key Laboratory of Geomechanics and Geotechnical Engineering Institute of Rock and Soil Mechanics Chinese Academy of Sciences Wuhan China Key Laboratory of Geotechnical Mechanics and Engineering Ministry OfWater Resources Yangtze River Scientific Research Institute Wuhan China School of Civil Engineering and Architecture Wuhan University of Tehnology Wuhan China

ISBN: (纸本)9781138027077

The drying-wetting process of expansive soil caused by atmospheric action is the most important factor that contributes to the degradation of the soil's engineering properties. Studies on the evolution law of the microstructure of undisturbed expansive soil are conducted under the wetting-drying process. The drying-wetting effect of expansive soil caused by atmospheric action is simulated in a constant temperature and humidity box, and then some tests of mercury intrusion porosimetry and scanning electron microscopy are carried out. Results show that the influence of wetting and drying on the characteristics of the expansive soil microstructure is significant;the manner by which the microstructures adjust and change differs significantly during the drying or wetting process. Structures with the large pore diameter generate a significant effect. The drying process causes damage more easily to the primary macro pore structure or micro fractures of expansive soil compared with the wetting process;however, the wetting process amplifies the damage and results in uniform pore size distribution. © 2015 Taylor & Francis Group.

关键词： Microstructure

来源：评论

学校读者我要写书评

暂无评论

SIMD vectorization of nested loop based on strip mining

SIMD vectorization of nested loop based on strip mining

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Jinlong Xu Huihui Sun Rongcai Zhao State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

The difference between vector machine and SIMD extension is analyzed at the very start. The multilevel loop vector code generation algorithm termed Codegen put forward by Kennedy and other fellows can't be directly applied to SIMD extension as it is oriented to vector machine. The vectorization algorithm in state-of-the-art compilers can only process one level of nested loop. In order to vectorize the entire nested loop, a vectorization algorithm based on strip mining called simdcodegen is proposed. Firstly, the formation reason of dependence circles is analyzed and the role of strip mining played in elimination of dependence circles is discussed. Then on the basis of codegen, strip mining is applied on each level of the loop recursively to explore the SIMD parallelism in the nested loop. Although strip mining is always legitimate, the executing cost increases after strip mining. To assure that strip mining is beneficial, that is to say, strip mining can break some dependence circles, cycle broken test is applied before implementation of strip mining. Effectiveness of this method is verified by the experimental results.

关键词： Strips Support vector machines Parallel processing Data mining Fellows Registers Data processing

来源：评论

学校读者我要写书评

暂无评论

Improving Steganalysis by Fusing SVM Classifiers for JPEG Images

Improving Steganalysis by Fusing SVM Classifiers for JPEG Im...

引用

International Conference on Computer Science and Mechanical Automation (CSMA)

作者： Peiqing Liu Fenlin Liu Chunfang Yang Xiaofeng Song State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781467391672

As the present fusing strategies cannot utilize the correlation of different detection results for image steganography effectively, a steganalysis method is proposed based on fusing SVM classifiers. Firstly, different feature subsets are used for the training of SVM classifiers. Secondly, the detection results of multi-classifiers are utilized to train a fusing classifier, the fusing classifier can learn the correlation and diversity of detection results of sub-classifiers. From the experimental result, it can be seen that the proposed steganalysis method can achieve better detection performance for J-UNIWARD steganography compared with voting and Bayesian methods.

关键词： Feature extraction Discrete cosine transforms Support vector machines Training Correlation Transform coding Bayes methods

来源：评论

学校读者我要写书评

暂无评论

Data layout transformation for structure vectorization on SIMD architectures

Data layout transformation for structure vectorization on SI...

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Peng-yuan Li Qing-hua Zhang Rong-cai Zhao Hai-ning Yu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Structure references are commonly-used at the core of applications in a multitude of domains such as image processing, signal processing, especially the scientific and engineering applications. SIMD instruction sets, as SSE, AVX, AltiVec and 3DNow, provide a promising and widely available avenue for enhancing performance on modern processors. However existing memory accessing shackles limit the achieved performance for structure reference on modern SIMD architectures. In this paper, we propose a novel data layout transformation technology that addresses the accessing obstacles, along with a static analysis technique for detecting the legal loops in where this transformation is suitable. And this approach is implemented in the Optimizing Compiler Open64. The experimental results show that the proposed method can translate application with structure access into vectorizable codes, thereby advancing the execution efficiency adequately.

关键词： Decision support systems Arrays Layout Switches Indexes Transforms Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Achieving high throughput and low delay in mobile data networks by accurately predicting queue lengths 15

Achieving high throughput and low delay in mobile data netwo...

引用

12th ACM International Conference on computing Frontiers, CF 2015

作者： Liu, Ke Lee, Jack Y.B. State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Department of Information Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781450333580

Knowledge of the queue length for a radio link in a mobile data network has a significant effect on the performance of the communication protocol TCP. If the queue length can be accurately estimated and regulated to a target value, then low end-to-end delay and high bandwidth utilization can be achieved. One method for estimating and regulating the queue length is the queue-length-based congestion control (QCC) algorithm. However, this algorithm estimates the queue length over one RTT interval prior to transmission, and the actual queue length after that time can differ significantly, because the bandwidth can vary substantially between the neighboring propagation delays, which could result in a false positive in the queue length adaption, thereby affecting the QoS performance. To address this problem, we propose PQ-TCP, a method that predicts the queue length directly by predicting the bandwidth variations over the ensuing period of time equal to the propagation delay and using post-bandwidth analysis to minimize the prediction error. Trace-driven simulations are used to show that the QoS performance of PQ-TCP is superior to that of current QCC algorithms. PQ-TCP achieves the lowest RTT while maintaining nearly 90% bandwidth utilization for a small target queue length of 5 packets. © Copyright 2015 ACM.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Distributed key revocation scheme based on shared binary tree

Distributed key revocation scheme based on shared binary tre...

引用

IEEE International Conference on Progress in Informatics and computing (PIC)

作者： Shaoren Wang Xuehui Du Zhi Yang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Concerning the identity-based binary tree key revocation scheme, the storage and use of binary tree can not be guaranteed in open cloud environment. This paper proposes a distributed key revocation scheme based on shared binary tree. The scheme splits the binary key tree into branches and distributes them to multiple nodes to save. Then multiple nodes work together to rebuild the key. At the same time, this paper optimizes the lookup algorithm during rebuilding. It solves the issues on distributed storage, safe use and fast reconstruction of the binary tree in the open environment. Experiments and analysis show that the scheme has higher efficiency and makes identity-based key revocation scheme run safely in the open environment.

关键词： Peer-to-peer computing Cryptography

来源：评论

学校读者我要写书评

暂无评论

Executable Program Code Segment Address Randomization

Executable Program Code Segment Address Randomization

引用

International Conference on Computer Sciences and Applications (CSA)

作者： Jian Lin Yu-Dong Guo Yu-Jia Man Shao-Huang Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479999620

In Linux Address Space layout Randomization, not all memory addresses are random. Executable Program is still loaded to a static address, so an attacker can do code reuse attack by using gadgets in executable program code segment. To improve the weaken ASLR, this paper proposes and implements a new protection method named EPCSAR (Executable Program Code Segment Address Randomization). Taking advantage of static analysis results of IDA, EPCSAR used an IDA plugin to identify the instructions needing relocation in the ELF executable program. By modifying the ELF loader, EPCSAR mapped the executable program code segment into a random address. Evaluation shows the EPCSAR can defense the code reuse attack using gadgets in static region, and only has low runtime overhead of 1.31%.

关键词： Ground penetrating radar Geophysical measurement techniques Linux Libraries Registers Layout Data mining

来源：评论

学校读者我要写书评

暂无评论

Discussion on heuristic teaching method for arithmetic unit design

Discussion on heuristic teaching method for arithmetic unit ...

引用

International Conference on Computer Science & Education (ICCSE)

作者： Qingbao Li Ping Zhang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479966011

Arithmetic unit design has been one of the important and difficult parts in teaching of principles of computer organization course and is hard for students to understand and master. Because teaching of arithmetic unit design is usually began with examining the process of computer arithmetic, many students are apt to think it as numerical calculation and don't really understand the main idea in computer design of simplification, normalization and rapid processing. In this paper, we reveal the basic idea of computer arithmetic unit design by the analysis of data representation and the process of calculation, taking addition, subtraction and multiplication as example. Based on the background of our many years' teaching and research, we discuss some effective heuristic methods in teaching of arithmetic unit design.

关键词： Computer science Education

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：