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

A Large-Scale Study of Failures on Petascale Supercomputers

Journal of Computer Science & Technology 2018年第1期33卷 24-41页

作者： Rui-Tao Liu Zuo-Ning Chen State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 213215 China National Research Center of Parallel Computer Engineering and Technology Beijing 100190 China

With the rapid development of supercomputers, the scale and complexity are ever increasing, and the reliability and resilience are faced with larger challenges. There are many important technologies in fault tolerance, such as proacrive failure avoidance technologies based on fault prediction, reactive fault tolerance based on checkpoint, and scheduling technologies to improve reliability. Both qualitative and quantitative descriptions on characteristics of system faults are very critical for these technologies, This study analyzes the source of failures on two typical petascale supercomputers called Sunway BlueLight （based on multi-core CPUs） and Sunway TaihuLight （based on heterogeneous manycore CPUs）. It uncovers some interesting fault characteristics and finds unknown correlation relationship among main components＇ faults. Finally the paper analyzes the failure time of the two supercomputers in various grains of resource and different time spans, and builds a uniform multi-dimensional failure time model for petascale supereomputers.

关键词： petascale supercomputer fault characteristic correlation relationship multi-dimension failure time model

来源：评论

学校读者我要写书评

暂无评论

Searching for similar binary code based on the influence of basic block vertex 3

Searching for similar binary code based on the influence of ...

引用

2021年第三届先进计算机技术、信息科学与通信国际会议(CTISC2021)

作者： Xiaodong Zhu Liehui Jiang Zeng Chen Lin Yan State key laboratory of mathematical engineering and advanced computing

ISBN: (纸本)9781665418683

Binary code similarity detection(BCSD) has many security applications and has attracted a lot of focus. But existing solutions for BCSD problems mainly focus on comparing the similarity between two binary functions and what need to be compared is not always a pair of equal-size binary *** solve the problem of searching similar binary code for a small size program in a large size program, in this manuscript,we propose a searching method based on the influence of basic block vertex. Firstly, we formalize the similar code searching problem as a subgraph matching problem and extract the attributed control flow graphs(ACFGs) of the binary ***, we propose a novel metrics to measure the influence of each basic block vertex in query ACFGs and choose the vertex with the largest influence value as the central node. Next, we take the matching nodes of the central node in target ACFG as seed nodes and extending each candidate sub-area from the seed nodes. At last, these candidate sub-areas are further filtered and similar subgraphs are verified in these *** results indicate that the proposed method can find similar binary code efficiently.

关键词： Measurement Matched filters Information science Binary codes Search problems Security Flow graphs

来源：评论

学校读者我要写书评

暂无评论

Research on Stream Cipher Model Based on Chaos Theory

Research on Stream Cipher Model Based on Chaos Theory

引用

第四届智能结构与振动控制国际会议

作者： Sun Wenjie State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9783038350507

Chaos is a similar and random process which is very sensitive to initial value in deterministic *** is a performance of nonlinear dynamical system with built-in *** with the advantages and disadvantages of the present chaos encryption model,the paper proposes a chaotic stream cipher model based on chaos theory,which not only overcomes finite precision effect,but also improves the randomness of chaotic system and output *** Sequence cycle theory generated by the algorithm can reach more than 10600 at least,which completely satisfies the actual application requirements of stream cipher system.

关键词： Chaos Theory,Stream Cipher,Algorithm

来源：评论

学校读者我要写书评

暂无评论

Power-Aware Data Management Based on Hybrid RAM-NVM Memory for Smart Bracelet

引用

Journal of Electronic Science and Technology 2017年第4期15卷 385-390页

作者： Jin-Yu Zhan Jun-Huan Yang Wei Jiang Yi-Xin Li Yi-Ming Zhang School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu 610054 China State Key Lab of Mathematical Engineering and Advanced Computing Wuxi 214000China

Wearable devices become popular because they can help people observe health *** battery life is the critical problem for wearable devices. The non-volatile memory(NVM) attracts attention in recent years because of its fast reading and writing speed, high density, persistence, and especially low idle power. With its low idle power consumption,NVM can be applied in wearable devices to prolong the battery lifetime such as smart bracelet. However, NVM has higher write power consumption than dynamic random access memory(DRAM). In this paper, we assume to use hybrid random access memory(RAM)and NVM architecture for the smart bracelet *** paper presents a data management algorithm named bracelet power-aware data management(BPADM) based on the architecture. The BPADM can estimate the power consumption according to the memory access, such as sampling rate of data, and then determine the data should be stored in NVM or DRAM in order to satisfy low power. The experimental results show BPADM can reduce power consumption effectively for bracelet in normal and sleeping modes.

关键词： Hybrid memory non-volatile memory(NVM) power-aware smart bracelet

来源：评论

学校读者我要写书评

暂无评论

Information diffusion network inferring and pathway tracking

引用

Science China(Information Sciences) 2015年第9期58卷 135-149页

作者： ZHOU DongHao HAN WenBao WANG YongJun YUAN BaoDi College of Computer National University of Defense Technology State Key Laboratory of Mathematical Engineering and Advanced Computing College of Computer Science and Technology Fudan University

Network diffusion, such as spread of ideas, rumors, contagious disease, or a new type of behaviors, is one of the fundamental processes within networks. Designing effective strategies for influence spread maximization, rumor spread minimization, or epidemic immunization has attracted considerable research attention. However, a key challenge is that many times we can only observe the trace of contagion spreading across network, but the underlying network structure is unknown and the transmission rates between node pairs are unclear to us. In this paper, given the observed information cascades, we aim to address two problems:diffusion network structure inferring and information diffusion pathways tracking. We propose a novel probabilistic model called Network Inferring from Multidimensional Features of Cascades(NIMFC) which takes into account heterogeneous features, including temporal and topological features of cascades, node attributes, and information content, to infer the latent network structure and transmission rates of edges. Also, based on the inferred network structure, we may track diffusion pathways of a cascade in social networks. We use blocked coordinate descent method to learn a sparse estimation of the latent network. Our proposed model NIMFC is evaluated both on large synthetic and real-world data sets, and experimental results show that our method significantly outperforms state-of-the-art models both in terms of recovering the latent network structure and information pathway tracking.

关键词： diffusion network network inferring information pathway tracking temporal feature node attributes topological feature informatio

来源：评论

学校读者我要写书评

暂无评论

Methods for solving equations with errors based on the HHL algorithm

引用

The Journal of China Universities of Posts and Telecommunications 2022年第4期29卷 9-20页

作者： LüLihui Wang Hong Ma Zhi Duan Qianheng Fei Yangyang Meng Xiangdong State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 450001China

To solve polynomial systems,Harrow,Hassidim,and Lloyd(HHL)proposed a quantum algorithm called HHL *** on the HHL algorithm,Chen et *** an algorithm,the solving the Boolean solutions of polynomial systems(PoSSoB)***,Ding et *** the Boolean Macaulay matrix and analyzed the lower bound on the condition *** by Ding et al.’s research,several related algorithms are proposed in this ***,the improved PoSSoB algorithm using the Boolean Macaulay matrix is proved to have lower ***,for solving equations with errors,a quantum algorithm for the max-polynomial system solving(Max-PoSSo)problem is proposed based on the improved PoSSoB ***,the Max-PoSSo algorithm is extended to the learning with errors(LWE)problem and its special case,the learning parity with noise(LPN)problem,providing a quantitative criterion,the condition number,for the security of these basic problems.

关键词： Harrow Hassidim and Lloyd polynomial system solving max-polynomial system solving learning parity with noise learning with errors

来源：评论

学校读者我要写书评

暂无评论

G Bytes Data Hiding Method Based on Cluster Chain Structure

引用

Wuhan University Journal of Natural Sciences 2013年第5期18卷 443-448页

作者： NIU Xiaopeng LI Qingbao WANG Wei WANG Yulong State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Information Engineering University

Protecting the security of sensitive information has become a matter of great concern to everyone. Data hiding technique solves the problem to some extent, but still, some shortcomings remain for researching. To improve the capability of hiding huge data file in disk with high efficiency. In this paper, we propose a novel approach called CryptFS, which is achieved by utilizing the file access mechanism and modifying the cluster chain structure to hide data. CryptFS can quickly hide data file with G bytes size in less than 0.1s. The time used for hiding and recovering data is irrelevant to the size of data file, and the reliability of the hidden file is high, which will not be overlaid by new created file and disk defragment.

关键词： data hiding file system cluster chain index entry efficiency robustness

来源：评论

学校读者我要写书评

暂无评论

A Static Backward Taint Data Analysis Method for Detecting Web Application Vulnerabilities 9

A Static Backward Taint Data Analysis Method for Detecting W...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Xuexiong Yan Hengtai Ma Qingxian Wang Institute of Software Chinese Academy of Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing Institute of Software Chinese Academy of Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9781509038237;9781509038220

This paper addresses detecting taint-style Thisvulnerabilities in PHP code. It extends classical taint-style model with an element called "cleans", which is used to specify sanitation routines. Based on the new model, a static backward taint data analysis method is proposed to detecting taint-style vulnerabilities. This method includes four key steps, first of which is collecting sinks and constructing contexts, the second is backward tracing variables during a basic block, the third is tracing variables between blocks, and the last is tracing variables crossing function call. A tool called POSE implements this method and testing results show that the method is valid for detecting taint-style web application vulnerabilities.

关键词： taint data analysis PHP web application vulnerabilities

来源：评论

学校读者我要写书评

暂无评论

APU-D* Lite: Attack Planning under Uncertainty Based on D* Lite

引用

Computers, Materials & Continua 2020年第11期65卷 1795-1807页

作者： Tairan Hu Tianyang Zhou Yichao Zang Qingxian Wang Hang Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China School of Electrical Engineering and Telecommunications UNSW KensingtonNSW 2033Australia

With serious cybersecurity situations and frequent network attacks,the demands for automated pentests continue to increase,and the key issue lies in attack *** the limited viewpoint of the attacker,attack planning under uncertainty is more suitable and practical for pentesting than is the traditional planning approach,but it also poses some *** address the efficiency problem in uncertainty planning,we propose the APU-D*Lite algorithm in this ***,the pentest framework is mapped to the planning problem with the Planning Domain Definition Language(PDDL).Next,we develop the pentest information graph to organize network information and assess relevant exploitation actions,which helps to simplify the problem ***,the APU-D*Lite algorithm is introduced based on the idea of incremental heuristic *** method plans for both hosts and actions,which meets the requirements of *** the pentest information graph as the input,the output is an alternating host and action *** experiments,we use the attack success rate to represent the uncertainty level of the *** result shows that APU-D*Lite displays better reliability and efficiency than classical planning algorithms at different attack success rates.

关键词： Attack planning under uncertainty automated pentest APU-D*Lite algorithm incremental heuristic search

来源：评论

学校读者我要写书评

暂无评论

Research on Fuzzing Technology for JavaScript Engines 21

Research on Fuzzing Technology for JavaScript Engines

引用

5th International Conference on Computer Science and Application engineering, CSAE 2021

作者： Tian, Ye Qin, Xiaojun Gan, Shuitao State Key Laboratory of Mathematical Engineering and Advanced Computing Zheng zhou Wuxi China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781450389853

JavaScript engine is the core component of web browsers, whose security issues are one of the critical aspects of the overall Web Eco-Security. Fuzzing technology, as an efficient software testing approach, has been widely applied to detecting vulnerabilities in different JavaScript engines, which is a security research hotspot at present. Based on systematical dissection of existing fuzzing methods, this paper reviews the development and technical ideas of JavaScript Engine Fuzzing combined with taxonomy, proposes a general framework of JavaScript Engine Fuzzing and analyzes the key techniques involved. Finally, we discuss the core issues that restrict efficiency in current research and present an outlook on the future trends of JavaScript Engine Fuzzing.. © 2021 Association for computing Machinery. All rights reserved.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：