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

2011 International Conference on Computational and Information Sciences, ICCIS 2011

作者： Shen, Lu Liang, Xiaoyan Bo, Yang Xia, Chunhe State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769545011

The existing penetration testing systems need to rely on the professional skills in the testing process, so they increase the penetration testing of human resources and costs. While it also reduces the efficiency of the test, it increases the test cycle. This paper presents a new penetration testing scheme by an automatically generated method. Through penetration testing scheme description, we establish an automatic generation system about penetration testing scheme, and the automatic generation penetration testing scheme for network analysis model (AGPTSAM) is established, and then the termination of the AGPTSAM is proved by the pushdown automaton. The prototype system of AGPTSAM is implemented. The penetration testing scheme could provide guidance and basis for the implementation of the penetration testing system, and shorten the test cycle and the human resources cost. This method is verification of effectiveness by experimental which works on the implementing platform. © 2011 IEEE.

关键词： Analytical models Automatica Generation Computational modeling Information security Penetration Testing Prototypes Scheme Testing

来源：评论

学校读者我要写书评

暂无评论

A Network Security Situation Analysis framework based on information fusion

A Network Security Situation Analysis framework based on inf...

引用

2011 6th IEEE Joint International Information technology and Artificial Intelligence Conference, ITAIC 2011

作者： Zhang, Songmei Yao, Shan Ye, Xin'En Xia, Chunhe State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9781424486236

With the rapid development of the Internet, the network structure becomes larger and more complicated and attacking methods are more sophisticated, too. To enhance network security, Network Security Situation Analysis (NSSA) technology is a research hot spot in the network security domain. But at present, the NSSA framework and model which not only analyze the affected results of the network security but also the process how the network security is affected are less. In this paper, a novel NSSA framework is presented. The framework includes two parts: calculate the Network Security Situation Value (NSSV) and discover intrusion processes. NSSA quantitative assesses the impact on network security caused by attacks upon Analytical Hierarchy Process (AHP) and hierarchical network structure. Based on attack classification, intrusion processes discover the process how network security is affected. At last from the experiments results, NSSV exactly changes as attacks take place and the accurate intrusion processes are discovered. The applicability of the framework and algorithms are verified. © 2011 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

GPU Accelerating for Rapid Multi-core Cache Simulation

GPU Accelerating for Rapid Multi-core Cache Simulation

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Wan Han Long Xiang Gao Xiaopeng Li Yi State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China

To find the best memory system for emerging workloads, traces are obtained during application's execution, then caches with different configurations are simulated using these traces. Since program traces can be several gigabytes, simulation of cache performance is a time consuming process. Compute unified device architecture (CUDA) is a software development platform which enables programmers to accelerate the general-purpose applications on the graphics processing unit (GPU). This paper presents a real time multi-core cache simulator, which was built based on the Pin tool to get the memory reference, and fast method for multi-core cache simulation using the CUDA-enabled GPU. The proposed method is accelerated by the following techniques: execution parallelism exploration, memory latency hiding, a novel trace compression methodology. We describe how these techniques can be incorporated into CUDA code. Experimental results show that the hybrid parallel method of time-partitioning combines with set-partitioning presented here is 11.10× speedup compared to the CPU serial simulation algorithm. The present simulator can characterize cache performance of single-threaded or multi-threaded workloads at the speeds of 6-15 MIPS. It can simulates 6 cache configurations within one single pass at this speeds compared to CMP$im, which can only simulate one cache configuration each simulation pass at the speeds of 4-10 MIPS.

关键词： Graphics processing unit Instruction sets Computational modeling Parallel processing Instruments Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

On the controller synthesis for probabilistic systems of conflict tolerant specification

引用

Journal of Computational Information systems 2011年第4期7卷 1286-1293页

作者： Zhang, Junhua Huang, Zhiqiu Cao, Zining College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China Vocational Education Faculty Ningbo University Ningbo 315100 China National Key Laboratory of Science and Technology on Avionics System Integration Shanghai 200233 China

For an embedded control system, different requirements maybe need be satisfied at same time. Always some of them makes the system to act inconsistently, or even conflicted. Conflict tolerant specification is provided to denote this situation. In such a system, there often exist probabilistic and non-deterministic behaviors. We use Markov Decision Process (MDP) to denote these features. Based on this context, we study the controller synthesis for MDP over conflict tolerant specification. We extend PCTL star by adding past operator to denote the conflict tolerant specification succinctly. We use CT-PLTL to denote possibly conflicted actions and PCTL to denote the specification for probability demand. We first synthesize a controller on a base system over CT-PLTL and then use it to prune the corresponding MDP of the system model. We use the resulting sub-MDP as the model to further synthesis a controller over PCTL. The whole controller for MDP is a conjunction of the two controllers obtained. Copyright © 2011 Binary Information Press.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Interval-valued matrix factorization with applications

Interval-valued matrix factorization with applications

引用

10th IEEE International Conference on Data Mining, ICDM 2010

作者： Shen, Zhiyong Du, Liang Shen, Xukun Shen, Yidong Hewlett Packard Labs China State Key Laboratory of Computer Science China State Key Laboratory of Virtual Reality Technology and system China

ISBN: (纸本)9780769542560

In this paper, we propose the Interval-valued Matrix Factorization (IMF) framework. Matrix Factorization (MF) is a fundamental building block of data mining. MF techniques, such as Nonnegative Matrix Factorization (NMF) and Probabilistic Matrix Factorization (PMF), are widely used in applications of data mining. For example, NMF has shown its advantage in Face Analysis (FA) while PMF has been successfully applied to Collaborative Filtering (CF). In this paper, we analyze the data approximation in FA as well as CF applications and construct interval-valued matrices to capture these approximation phenomenons. We adapt basic NMF and PMF models to the interval-valued matrices and propose Interval-valued NMF (I-NMF) as well as Interval-valued PMF (I-PMF). We conduct extensive experiments to show that proposed I-NMF and I-PMF significantly outperform their single-valued counterparts in FA and CF applications. © 2010 IEEE.

关键词： Matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Using GPU to accelerate a pin-based multi-level cache simulator 10

Using GPU to accelerate a pin-based multi-level cache simula...

引用

Proceedings of the 2010 Spring Simulation Multiconference

作者： Han, Wan Gao, Xiaopeng Long, Xiang Chen, Xianqin State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781450300698

Trace-driven simulation methodology is the most widely used method to evaluate the design of future computer memory architecture. Since this methodology demands large amounts of storage and computer time, there is a growing need for simulation methodologies to determine the memory system requirements of emerging workloads in a reasonable amount of time. Several techniques have been proposed to reduce the space that store memory reference and improve the performance of sequential trace-driven simulation. This paper presents the use of binary instrumentation as the memory reference generator and parallel simulation technique that based on the generic graphics processing unit (GPU). One way to achieve fast parallel simulation is to simulate the independent sets of a cache concurrently on different compute resource, but results show that this method is not efficient because of a high correlation of the activity between different sets. To put parallelism to effective use, we show that a multi-configuration simulation in single pass method gains 2.44x performance improvement compared to traditional sequential algorithm. © 2010 SCS.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Accelerate Smoothed Particle Hydrodynamics using GPU

Accelerate Smoothed Particle Hydrodynamics using GPU

引用

2010 IEEE Youth Conference on Information, Computing and Telecommunications, YC-ICT 2010

作者： Gao, Xiaopeng Wang, Zhiqiang Wan, Han Long, Xiang State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University 100191 Beijing China

ISBN: (纸本)9781424488841

Physic-based fluid simulation is used extensively nowadays;however the traditional serial algorithm can't satisfy the realtime requirement due to its complexity and compute-intensive. The development of modern GPU makes this possible. In this paper, a Smoothed Particle Hydrodynamics (SPH) method for incompressible fluid was implemented using CUDA on GPU. Since the algorithm was executed on the GPU entirely, the method can take full advantage of massive computational power of modern graphics hardware. The experiment results show that our GPU based SPH implementation can achieve the rate of 89 frames per second in the simulation of 102K particles and gain nearly 140x speedups compared with the serial algorithm. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Simplification for texture mapping models with mesh segmentation

Simplification for texture mapping models with mesh segmenta...

引用

2010 16th International Conference on virtual systems and Multimedia, VSMM 2010

作者： Wang, Lili Ma, Zhiqiang Xue, Bing Shen, Zhe State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing 100191 China

ISBN: (纸本)9781424490264

To reduce the loss of visual details in simplification for textured meshes, this paper presents a simplification method based on mesh segmentation. Firstly, the model is partitioned into some sub-meshes according to their properties of appearance, such as texture, normal, etc. Thus, the correlation between sub-meshes can be decreased. Then, we calculate the error metric for the edge collapse in each sub-mesh. Lastly, we merge the simplified sub-meshes and fix the gap among them to regain an integrated mesh. Because the properties of appearance are used to separate the high-frequency details from low-frequency ones, our approach decreases the loss of the detailed. Therefore, we can not only keep the over whole contours of the model, but also maintain better geometric and appearance details. The results of experiments demonstrate our mesh segmentation based method is effective. ©2010 IEEE.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

引用

2010 International Conference on Educational and Information technology, ICEIT 2010

作者： Hao, Senshen Jiao, Jian Xia, Chunhe Li, Xiaojian Yao, Shan State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China Beijing Key Laboratory of Network Technology School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781424480340

In order to effectively deal with large-scale attacks on computer networks, computer Network Defense (CND) policy refinement based on descriptive language is wildly used. However, it's very difficult to figure out the semantic discrepancies between the measures and the predefined policy after the calculation with symbols by computers. A new method is presented to solve the discordance of semantic between the measures and the predefined policy automatically. Based on the establishment of the ontology of CND policy and measure (CNDPM), the CND policy and measure semantic similarity analysis model (CNDPMSSAM) is established, and then the termination of the two main components of CNDPMSSAM are proofed by the putdown automaton, and the prototype system of CNDPMSSAM is implemented. At last, we validate the validity of this method on analyzing semantic similarity of transferring from computer Network Defense Policy Specification Language (CNDPSL) to Defense Measure Description Language (DMDL) with experiments. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Descriptive model of peer-to-peer botnet structures

Descriptive model of peer-to-peer botnet structures

引用

2010 International Conference on Educational and Information technology, ICEIT 2010

作者： Duan, Junfeng Jiao, Jian Xia, Chunhe Yao, Shan Li, Xiaojian State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China Beijing Key Laboratory of Network Technology School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781424480340

Peer-to-peer (P2P) Botnets, which are more resilient and robust than centralized botnets, have emerged as the peer-to-peer technology evolves. Better understanding of this new phenomenon will help researchers develop detection and mitigation methods. Most of existing work is case study of typical P2P botnets. In this paper, we focus on systematically analyzing structures of P2P botnets. We propose a descriptive model of P2P botnet structures, which consists of features of P2P bot, definitions of structures, and structural properties. Firstly, we detail two key functionalities of P2P bot, command-and-control (C&C) functionality and peer-to-peer (P2P) functionality, and give several features of P2P bot. And then, we define two structures of P2P botnets: C&C structure and P2P structure. To characterize these structures, we propose several properties and corresponding quantitative methods. Finally, we conduct experiments to verify our results. © 2010 IEEE.

关键词： Structural properties

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：