13922126
Scene Simulation Platform Based on Data Fusion of Multiple Format 3D Models
Scene simulation technology has been the basal component for building 3D simulation application now. Constructing a general scene simulation platform based on multiple format 3D models can greatly speed developing process of simulation application and promote developing efficiency. According to the idea above, a method of building scene simulation platform based on models data fusion is put forward. With this method, multiple 3D model data format such as FLT, 3DS, X, WRL and GLS are fused and driven by OpenGL API. The layered structure and framework based on HLA are also presented to design the platform. Key technologies involving model data fusion and simulation driving are detailed. Finally, challenges associating with realization of the platform named plug-in framework and simulation examples based on the platform are brought forward. It shows greatest traits on building similar large-scale simulation application system.
6208997
Network Attack-Defense Simulation Training System Based on HLA
Soldiers possessing of network attack-defense ability are the key factor for future information war. Aiming at the problem of lacking daily training and drilling environment, a method of building Network Attack-Defense Simulation Training System (NADSTS) based on HLA is put forward. With the method, attack and defense training are designed as different federation member. The system is divided to presentation, application and adapter layer clearly. Key technologies involves network attack-defense, network simulation and simulation driving are also presented. Software is developed based on plug-in framework. Its simulation examples show greatest traits on building similar large-scale simulation system.
2501005
Coordinating Multiple Agents via Reinforcement Learning
In this paper, we attempt to use reinforcement learning techniques to solve agent coordination problems in task-oriented environments. The Fuzzy Subjective Task Structure model (FSTS) is presented to model the general agent coordination. We show that an agent coordination problem modeled in FSTS is a Decision-Theoretic Planning (DTP) problem, to which reinforcement learning can be applied. Two learning algorithms, ‘‘coarse-grained’’ and ‘‘fine-grained’’, are proposed to address agents coordination behavior at two different levels. The ‘‘coarse-grained’’ algorithm operates at one level and tackle hard system constraints, and the ‘‘fine-grained’’ at another level and for soft constraints. We argue that it is important to explicitly model and explore coordination-specific (particularly system constraints) information, which underpins the two algorithms and attributes to the effectiveness of the algorithms. The algorithms are formally proved to converge and experimentally shown to be effective.
20633806
Inelastic Simulation of Insect Cuticle Using Artificial Neural Network
Neural networks have been availably applied to the simulations of the mechanical behaviors of many materials. In this work, a neural network material model is built for the simulation of the inelastic behavior of biocomposite insect cuticle. Radial basis function neural network is adopted in the simulation for that the neural network has the characteristic of fast and exactly completing the simulation. In the construction of the neural network, the network is trained based on the experimental data of the load-displacement relationship of a chafer cuticle. A strain-controlled mode and the iterative method of data are adopted in the training process of the neural network. The obtained neural network model is used for the simulation of the inelastic behavior of another kind of insect cuticle. It is shown that the obtained material model of the radial basis function neural network can satisfactorily simulate the inelastic behavior of insect cuticle.
13987553
Assessment of Color Video Quality with Singular Value Decomposition of Complex Matrix
Most proposed video quality assessment approaches in the literature are only applied to the luminance layer of frame. Others are applied to luminance and chrominance layers respectively and then pooling by means of grayscale image quality metrics. In this paper, we proposed a full-reference objective video quality assessment called CMSVD,which treats luminance and chrominance parts as a whole and considers multiple factors of the human visual system(HVS)and video features. The algorithm is tested on the video quality experts group (VQEG) phase I FR-TV test data set.Experiments show that it has good correlation with perceived video quality.
30192317
Modeling and Simulation of Continuous Time-Invariant Systems in Simulation Based Learning Environments
Simulation based learning environments are widely used in elementary and secondary science education. However, a large number of these learning environments are domain-dependent so that they are only useful in some special domains. In this paper, we put forward a new method of simulating continuous time-invariant systems by using frame based knowledge representation and interpretive structural modeling. This method is helpful to realize the separation of knowledge representation and simulation program, and promotes the reusability of a simulation based learning environment.
1721891
Lempel–Ziv Factorization Using Less Time & Space
Abstract.For 30 years the Lempel–Ziv factorization LZx of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) in x. Traditionally the standard method for computing LZx was based on Θ(n)-time (or, depending on the measure used, O(n log n)-time) processing of the suffix tree STx of x. Recently Abouelhoda et al. proposed an efficient Lempel–Ziv factorization algorithm based on an “enhanced” suffix array – that is, a suffix array SAx together with supporting data structures, principally an “interval tree”. In this paper we introduce a collection of fast space-efficient algorithms for LZ factorization, also based on suffix arrays, that in theory as well as in many practical circumstances are superior to those previously proposed; one family out of this collection achieves true Θ(n)-time alphabet-independent processing in the worst case by avoiding tree structures altogether.