基于VEGA PRIME激光制导导弹三维视景仿真设计

三维视景仿真依据仿真目的,可实时再现导弹攻击目标的全过程,为激光制导武器半实物仿真的飞行仿真、航迹规划等提供了直观的分析手段。通过Vega prime和Creator建立了导弹攻击目标的三维视景仿真系统中所需的三维实体模型、地形模型、天空、海面、雪地和碰撞等特殊效果并对其进行优化处理。依据导弹弹道解算模型实时解算导弹弹道参数,通过人机交互界面实时显示导弹飞行的位置和姿态,实现了导弹攻击目标的可视化仿真。     

柯召 孙琦—单尊定理的拓广

柯老和孙琦教授在[1]中提出了一个猜想:任意2n-1(n≥1)个有理整数中必有n个整数之和能为n整除。本文目的是将这一猜想推广到任一代数数域的代数整数范围中去。     

基于Vega Prime的环境特效与爆炸特效实现技术

为了提高仿真的逼真程度,本文介绍了Vega Prime采用粒子系统来模拟环境特效,Vega Prime提供了简单易用的编辑粒子系统特效的图形化用户模块,即Lynx Prime。根据该模块重点研究特定粒子系统的生成、属性及运动模型上。并在Vega Prime基础上阐述了爆炸特效的实现技术。     

虚拟大气环境模拟仿真的研究

为更好地实现视景仿真的实时场景渲染,使虚拟环境更加逼真形象,提出了云彩和薄雾的实现方法,给出了虚拟大气环境的模拟仿真过程.Vega是一个先进的虚拟场景开发工具,采用Vega开发虚拟大气场景,在大气模拟仿真领域有着非常广泛的应用前景.     

一种改进的RSA加密算法设计与实现

针对RSA加密算法的加密速度进行了研究,在大数模幂、模乘和平方等运算上作了改进,提高了RSA加密算法的执行效率.最后在模拟环境中对该改进算法进行了测试.     

The Zariski topology on the spectrum of prime <Emphasis Type="Italic">L</Emphasis>-submodules

Let R be a commutative ring with identity and let M be an R-module. We topologize L − Spec(M), the collection of all prime L-submodules of M, analogous to that for FSpec(R), the spectrum of fuzzy prime ideals of R, and investigate the properties of this topological space. In particular, we will study the relationship between L − Spec(M) and L − Spec(R/Ann(M)) and obtain some results.     

A distance measure for large graphs based on prime graphs

Graphs are universal modeling tools. They are used to represent objects and their relationships in almost all domains: they are used to represent DNA, images, videos, social networks, XML documents, etc. When objects are represented by graphs, the problem of their comparison is a problem of comparing graphs. Comparing objects is a key task in our daily life. It is the core of a search engine, the backbone of a mining tool, etc. Nowadays, comparing objects faces the challenge of the large amount of data that this task must deal with. Moreover, when graphs are used to model these objects, it is known that graph comparison is very complex and computationally hard especially for large graphs. So, research on simplifying graph comparison gainedan interest and several solutions are proposed. In this paper, we explore and evaluate a new solution for the comparison of large graphs. Our approach relies on a compact encoding of graphs called prime graphs. Prime graphs are smaller and simpler than the original ones but they retain the structure and properties of the encoded graphs. We propose to approximate the similarity between two graphs by comparing the corresponding prime graphs. Simulations results show that this approach is effective for large graphs.     

Application of Parallel Virtual Machine Framework to the Strong Prime Problem

This paper use the well-discussed PVM (Parallel Virtual Machine) software with several personal computers, and adopt the widespread Microsoft Windows '98 operating system as our operation platform to construct a heterogeneous PCs cluster. By engaging the related researches of PC cluster system and cluster computing theory, we apply our heterogeneous PC cluster computing system to generate more secure parameters for some public key cryptosystems such as RSA. Copes with each parameter's related mathematic theory's restriction, enormous computation power is needed to get better computation performance in generating these parameters. In this paper, we contribute heterogeneous PCs combined with the PVM software to cryptosystem parameters, which is conformed to today's safety specification and requirement. We practically generate these data to prove that computer cluster can effectively accumulate enormous computation power, and then demonstrate the cluster computation application in finding strong primes which are needed in some public key cryptosystems.     

Two-Level Multiple-Output Logic Minimization Using A Single Function

A new method for obtaining a two-level collective minimal cover for a set of incompletely-specified switching functions $S={f_1,f_2,ldots,f_n}$ is presented. The method relies on the introduction of a single auxiliary function F whose subfunctions (restrictions) with respect to some additional auxiliary variables $y_1,y_2,ldots,y_{n-1}$ are certain members of S . The complete sum of F has full information on the multiple-output prime implicants (MOPIs) of the set of functions S . A particularly constrained minimal cover for F contains only labeled versions of some paramount prime implicants (PPIs) of S and can be used to construct a multiple-output minimal cover for S . The present method can proceed by map, algebraic or tabular techniques, though only the map version is presented herein. This version employs a single map whose construction avoids the ANDing operations needed in the classical method, and whose size is almost one half the total size of the maps used by the classical method, and whose entries can be variable as well as constant. The minimization process is a direct two-step technique that avoids constructing the set of all PPIs as it produces only these PPIs needed in the minimal cover. Details of the method are carefully explained and illustrated via a typical example.