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...
详细信息
ISBN:
(纸本)9781424480333
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.
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 t...
详细信息
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.
Physic-based fluid simulation is used extensively nowadays;however the traditional serial algorithm can’t satisfy the realtime requirement due to its complexity and computeintensive. The development of modern GPU mak...
详细信息
Physic-based fluid simulation is used extensively nowadays;however the traditional serial algorithm can’t satisfy the realtime requirement due to its complexity and computeintensive. 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.
We present the design of time parallel trace-driven cache simulation for the purpose of evaluating different cache architectures. Due to the long simulation cycles, traditional sequential simulation methods are no lon...
详细信息
We present the design of time parallel trace-driven cache simulation for the purpose of evaluating different cache architectures. Due to the long simulation cycles, traditional sequential simulation methods are no longer practical. An obvious way to achieve fast parallel simulation is time parallel. It splits the whole trace into small slices which are assigned to parallel processors for concurrent simulation. In this paper, we introduce a novel time parallel multiconfiguration simulation on single pass method. It exploits time partitioning as the main sources of parallelism and takes the full advantage of the computational capability offered by the Compute Unified Device Architecture (CUDA) on the GPU. Our experimental results demonstrate that the cache simulator based on GPU platform gains 1.91x performance improvement compared to traditional serial algorithm.
In this paper, we first propose a specification ap-proach combining interface automata and Z language. This approach can be used to describe temporal properties and data properties of software components. A branching ...
详细信息
In this paper, we first propose a specification ap-proach combining interface automata and Z language. This approach can be used to describe temporal properties and data properties of software components. A branching time logic for ZIAs is presented. We then give an algorithm for model checking this logic on ZIAs with finite domain. Furthermore, we present a mu-calculus logic for ZIAs, and give a model checking algorithm for this logic.
Trace-driven cache simulation is the most widely used method to evaluate different cache structures. Several techniques have been proposed to reduce the simulation time of sequential trace-driven simulation. An obviou...
详细信息
A modeling and simulation tool called SimRC is described in this paper. It is dedicated to improve the efficiency of reconfigurable computing development. In SimRC, a new architecture description language is designed ...
详细信息
ISBN:
(纸本)9780889868106
A modeling and simulation tool called SimRC is described in this paper. It is dedicated to improve the efficiency of reconfigurable computing development. In SimRC, a new architecture description language is designed for architecture modeling, and the target architecture simulator is generated according to that model with our code generation approach. In this way, SimRC achieves the general purpose in a certain scope. The results of the preliminary experiments show that not only SimRC is able to model various architectures, but also it achieves the high simulation efficiency.
Since the virtual network traffic is invisible outside the hypervisor, it is impossible for traditional network-base security devices to harness the attacks happened in virtual computing environment. Industry and acad...
详细信息
Efficient rendering of complex scenes has receive great attention in real-time computer graphics. Current researches are mostly concentrated on reducing the geometric complexity of the scene model such as reconstructi...
详细信息
Efficient rendering of complex scenes has receive great attention in real-time computer graphics. Current researches are mostly concentrated on reducing the geometric complexity of the scene model such as reconstructing an LOD representation, performing visibility culling etc. However, the rendering process of complex scenes involves not only the geometric information of each object, but also multiple attributes, including lighting, material, texture, etc. The invocation of each attribute corresponds to a specific state in the rendering pipeline, frequent transfer between different states in the pipeline will introduce large amount of overhead, hence reducing the rendering efficiency. A rendering method accounting for efficient invocation of multiple attributes of objects based on state transition optimization strategies is presented. It estimates the cost for invoking each attribute of objects in the rendering pipeline and expresses the transitions between various render states as a weighted directed graph. Then the optimized sequence of state transition is obtained by optimization. Experimental results show that our proposed method can effectively reduce the overhead of state transition and improve the rendering efficiency of scenes containing large amounts of multi-attribute objects.
Survivability has become a focal point of research. Simulation is a common method for experimental verification to identify the advantages and deficiencies of survivability models and architectures. This paper propose...
详细信息
暂无评论