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

Evolving OpenMP in an Age of Extreme Parallelism 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Matthias S. Müller Bronis R. Supinski Barbara M. Chapman

来源：评论

学校读者我要写书评

暂无评论

RF-AdaCost: WebShell Detection Method that Combines Statistical Features and Opcode 3rd

RF-AdaCost: WebShell Detection Method that Combines Statisti...

引用

3rd International Conference on Frontiers in Cyber Security, FCS 2020

作者： Kang, Wenzhuang Zhong, Shangping Chen, Kaizhi Lai, Jianhua Xu, Guangquan College of Mathematics and Computer Science Fuzhou University FuzhouFujian350100 China Fujian Institute of Scientific and Technological Information FuzhouFujian350003 China College of Intelligence and Computing Tianjin University Tianjin300350 China

ISBN: (纸本)9789811597381

WebShell is called a webpage backdoor. After hackers invade a website, they usually mix backdoor files with normal webpage files in the WEB directory of the website service area. Then, they use a browser to access the backdoor and obtain a command execution environment to control the website server. WebShell detection methods have stringent requirements because of the flexibility of the PHP language and the increasing number of hidden techniques used by hackers. The term frequency–inverse document frequency (TF-IDF) used in the existing random forest–gradient boosting decision tree (RF-GBDT) algorithm does not consider the distribution information and classification capabilities of feature words among classes, and no balance exists between false negative and false positive rates. This work proposes a PHP WebShell detection model called RF-AdaCost, which stands for random forest–misclassification cost-sensitive AdaBoost, based on RF-GBDT. We used the statistical characteristics of PHP source files, including information entropy and index of coincidence, and extracted the opcode sequences of PHP source files, thus merging statistical features and opcode sequences to improve the detection efficiency of the WebShell. Experimental results show that the RF-AdaCost algorithm demonstrates better performance than the RF-GBDT algorithm. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Constrained migration of an atmospheric circulation model

Constrained migration of an atmospheric circulation model

引用

International Conference and Exhibition on High-Performance computing and Networking, HPCN EUROPE 1996

作者： Kandhai, B.D. Sloot, P.M.A. Huot, J.P. University of Amsterdam Computer Science and Physics Parallel Scientific Computing and Simulation Group Kruislaan 403 Amsterdam1098 SJ Netherlands European Space Research and Technology Centre Keplerlaan 1 Noordwijk2201 AZ Netherlands

ISBN: (纸本)9783540611424

In the migration of large production codes from sequential to parallel implementations a total rewriting of the original code is often prohibited. The reason for this is that very complicated codes took years of evolution to reach a stable and reliable state. Exploring the possibilities for parallelization should therefore be done with extreme care rather than by means of a complete rewrite from scratch. In this paper we discuss the migration of an atmospheric simulation program as an example of such ‘constrained migration’. We show that this type of migration allows for a fast and reliable, though not optimal, parallel implementation. Moreover it forces the researcher to identify locality and sequential hot spots in his code, thus guiding him into new strategies for a complete parallelization of the code. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Improving communication performance in dense linear algebra via topology aware collectives

Improving communication performance in dense linear algebra ...

引用

2011 International Conference for High Performance computing, Networking, Storage and Analysis, SC11

作者： Solomonik, Edgar Bhatele, Abhinav Demmel, James Dept. of Electric Engineering and Computer Science University of California at Berkeley Berkeley CA 94720 United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 United States

ISBN: (纸本)9781450307710

Recent results have shown that topology aware mapping reduces network contention in communication-intensive kernels on massively parallel machines. We demonstrate that on mesh interconnects, topology aware mapping also allows for the utilization of highly-efficient topology aware collectives. We map novel 2.5D dense linear algebra algorithms to exploit rectangular collectives on cuboid partitions allocated by a Blue Gene/P supercomputer. Our mappings allow the algorithms to exploit optimized line multicasts and reductions. Commonly used 2D algorithms cannot be mapped in this fashion. On 16,384 nodes (65,536 cores) of Blue Gene/P, 2.5D algorithms that exploit rectangular collectives are sig- nificantly faster than 2D matrix multiplication (MM) and LU factorization, up to 8.7x and 2.1x, respectively. These speed-ups are due to communication reduction (up to 95.6% for 2.5D MM with respect to 2D MM). We also derive LogP- based novel performance models for rectangular broadcasts and reductions. Using those, we model the performance of matrix multiplication and LU factorization on a hypothetical exascale architecture. Copyright 2011 ACM.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A Quantum Secret Sharing Scheme Using Orbital Angular Momentum onto Multiple Spin States Based on Fibonacci Compression Encoding

引用

Communications in Theoretical Physics 2018年第10期70卷 384-390页

作者： Hong Lai Ming-Xing Luo Yong-Jian Xu Josef Pieprzyk Jun Zhang Lei Pan Mehmet A.Orgun School of Computer and Information Science and Centre for Research and Innovation in Software Engineering（RISE） Southwest UniversityChongqing 400715China Information Security and National Computing Grid Laboratory School of Information Science and TechnologySouthwest Jiaotong UniversityChengdu 610031China Data61 Commonwealth Scientific and Industrial Research OrganisationSydneyAustralia Institute of Computer Science Polish Academy of SciencesWarsaw01-248Poland School of Software and Electrical Engineering Swinburne University of TechnologyHawthornVIC3122Australia School of Information Technology Deakin UniversityGeelongVIC3220Australia Department of Computing Macquarie UniversitySydneyNSW 2109Australia Faculty of Information Technology Macao University of Science and TechnologyAvenida Wai LongTaipa999078Macao

Since the use of a quantum channel is very expensive for transmitting large messages, it is vital to develop an effective quantum compression encoding scheme that is easy to implement. Given that, with the single-photon spin-orbit entanglement, we propose a quantum secret sharing scheme using orbital angular momentum onto multiple spin states based on Fibonacci compression encoding. In our proposed scheme, we can represent the frequency of any secret message which is typically collection of bits encodings of text or integers as a bitstring using the base Fibonacci sequence, which is encoded multiple spin states for secret shares transmitted to participants. We demonstrate that Fibonacci compression encoding carries excellent properties that enable us to achieve more robust quantum secret sharing schemes with fewer number of photons.

关键词： spin-orbit entanglement multiple spin states Fibonacci compression encoding quantum secretsharing

来源：评论

学校读者我要写书评

暂无评论

USB flash drives as an energy efficient storage alternative

USB flash drives as an energy efficient storage alternative

引用

2009 10th IEEE/ACM International Conference on Grid computing, Grid 2009

作者： Mordvinova, Olga Kunkel, Julian Martin Baun, Christian Ludwig, Thomas Kunze, Marcel University of Heidelberg Department of Computer Science 69120 Heidelberg Germany Karlsruhe Institute of Technology Institute for Scientific Computing 76344 Karlsruhe Germany University of Hamburg Department of Informatics c/o DKRZ 20146 Hamburg Germany

ISBN: (纸本)9781424451494

Increasing energy costs and the trend to green solutions are generating growing interest in eco-friendly computing. Flash storage technology satisfies low-energy requirements and falling prices for flash storage have recently made it possible to replace conventional hard disks with solid state drives. These can provide higher performance when deployed properly but they are still too expensive for the low-cost server market. In this paper we analyze inexpensive flash drives and conventional hard drives with a focus on energy efficiency. Our main goal is to decide whether replacing hard drives with USB flash drives is a reasonable and economic way to build energy-efficient servers. Our evaluation shows that despite the high throughput of hard disks, flash drives have a better performance per joule. In some cases, inexpensive USB flash can compete not only with hard disks but also with solid state drives. © 2009 IEEE.

关键词： Hard disk storage

来源：评论

学校读者我要写书评

暂无评论

An executable business model for generic web applications

An executable business model for generic web applications

引用

2010 International Conference on computer Information Systems and Industrial Management Applications, CISIM 2010

作者： Chen, Zhenxiang Ma, Kun Abraham, Ajith Yang, Bo Sun, Runyuan Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan China School of Computer Science and Technology Shandong University Jinan China Scientific Network for Innovation and Research Excellence United States

ISBN: (纸本)9781424478170

In this paper, a novel platform-specific executable business model called xBM is proposed to sufficiently represent the business logic process. The metamodel of xBM have been analysed, formalised and illustrated. Traditional version control idea based on the copy-modify-merge approach is also applied in xBM. Moreover, our approach for model development approach based on xBM is presented for generic web applications. Finally a case study of simplified Provincial Excellent Academic Degree Thesis Review System is demonstrated how to build xBMs and transform them into the final system. ©2010 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Direct GPU Compilation and Execution for Host Applications with OpenMP Parallelism 8

Direct GPU Compilation and Execution for Host Applications w...

引用

8th IEEE/ACM Annual Workshop on the LLVM Compiler Infrastructure in HPC, LLVM-HPC 2022

作者： Tian, Shilei Huber, Joseph Parasyris, Konstantinos Chapman, Barbara Doerfert, Johannes Stony Brook University Department of Computer Science Stony Brook United States Advanced Micro Devices Austin United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore United States

ISBN: (纸本)9781665475587

Currently, offloading to accelerators requires users to identify which regions are to be executed on the device, what memory needs to be transferred, and how synchronization is to be resolved. On top of these manual tasks, many standard (C/C++ library) functions, such as file I/O or memory manipulation, cannot be directly executed on the device and need to be worked around by the user explicitly. This makes it challenging to port programs in the first place and hinders developers from testing features on the GPU and within the GPU compilation pipeline. Existing tests and test suites for the host are effectively unusable for accelerators and need to be manually ported to provide the same benefits for the devices as they do on the host. In this paper, we propose a direct GPU compilation scheme that leverages the portable target offloading interface provided by LLVM/OpenMP. Utilizing this infrastructure allows us to compile an existing host application for the GPU and execute it there with only a minimal wrapper layer for the user code, command line arguments, and a compiler provided GPU implementation of C/C++ standard library functions. The C/C++ library functions are partially implemented for direct device execution and otherwise fallback to remote procedure call (RPC) to call host functions transparently. Our proposed prototype will allow users to quickly compile for, and test on, the GPU without explicitly handling kernel launches, data mapping, or host-device synchronization. We evaluate our implementation using three proxy applications with host OpenMP parallelism and three microbenchmarks to test the correctness of our prototype GPU compilation. © 2022 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

The fusion of image and range flow 10th

The fusion of image and range flow

引用

10th International Workshop on Theoretical Foundations of computer Vision, 2000

作者： Barron, John L Spies, Hagen Dept. of Computer Science University of Western Ontario LondonONN6A 5B7 Canada Interdisciplinary Center for Scientific Computing University of Heidelberg INF 368 Heidelberg69121 Germany

ISBN: (纸本)354042122X

We present quantitative results for computing local least squares and global regularized range flow using both image and range data. We first review the computation of local least squares range flow and then show how its computation can be cast in a global Horn and Schunck like regularization framework [15]. These computations are done using both range data only and using a combination of image and range data [14]. We present quantitative results for these two least squares range flow algorithms and for the two regularization range flow algorithms for one synthetic range sequence and one real range sequence, where the correct 3D motions are known a priori. We show that using both image and range data produces more accurate and more dense range flow than the use of range flow alone. © Springer-Verlag Berlin Heidelberg 2001.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

A class of parallel multilevel sparse approximate inverse preconditioners for sparse linear systems

引用

Scalable computing 2006年第2期7卷 93-106页

作者： Wang, Kai Zhang, Jun Shen, Chi Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Science University of Kentucky LexingtonKY40506-0046 United States

We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. We do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for solving difficult problems. Forward and backward preconditioning iteration and two Schur complement preconditioning strategies are proposed to improve the performance and to reduce the storage cost of the multilevel preconditioners. One version of the parallel multilevel SAI preconditioner based on the MSP strategy is implemented. Numerical experiments for solving a few sparse matrices on a distributed memory parallel computer are reported. © 2006 SWPS.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：