封闭空间爆炸载荷特性研究

封闭空间爆炸载荷主要包含瞬态冲击波和持续时间较长的准静态超压。为了研究封闭空间爆炸载荷特性,基于FORTRAN平台,采用三阶WENO有限差分格式编写了爆炸波高精度三维数值计算程序。应用Sod激波管、双爆轰波碰撞等经典算例验证了所开发数值程序的可靠性。在封闭空间内炸药爆炸波数值计算的基础上,基于冲量等效原则提出封闭空间内爆炸载荷简化模型,理论推导给出准静态超压峰值计算公式并通过数值计算结果验证了该公式的可靠性。开发的高精度爆炸波三维数值计算程序及提出的简化载荷模型可用于封闭空间内爆炸载荷的快速计算,为工程抗爆结构设计提供载荷输入。     

求解变系数对流扩散反应方程的指数型高精度紧致差分方法

本文给出了一种数值求解变系数对流扩散反应方程的指数型高精度紧致差分方法.我们首先将模型方程变形,借助常系数对流扩散方程的指数型高精度紧致差分格式,采用残量修正法得到变系数对流扩散反应方程的指数型高精度紧致差分格式;并从理论上分析了当Pelect数很大时,本文格式达到四阶计算精度时网格步长的限制条件;离散得到的代数方程组可采用追赶法直接求解.数值实验结果与理论分析完全吻合,表明了本文格式对于边界层问题或大梯度变化的物理量求解问题具有的高精度和鲁棒性的优点.     

DES加密算法在秘密共享中的应用

秘密共享思想提出后,经过几十年的发展已经出现了很多不同方案、模型等。本文根据秘密共享的特性提出了一种基于对称密钥系统的秘密共享方案。该方案解决了一些秘密共享现有的问题的,尤其是可验证性。存储在密钥分发者的信息都是加密后的密文,因此,其抗攻击的强度就是使用的加密算法的强度。通过简单C＋＋程序实现这一方案。对方案的可行性进行分析。     

地方高校计算机应用人才培养的困难与对策研究

介绍在计算机科学与技术专业规范指导下,我校以理论素质培养与技术能力掌握为导向,对计算机科学与技术两个方向的教学培养计划、课程改革、教学组织设计和课程评价等方面进行的一些探索,希望能为其他地方院校提供参考。     

Critical point analysis using domain lifting for fast geometry queries

In this paper, a general scheme for solving coherent geometric queries on freeform geometry is presented and demonstrated on a variety of problems common in geometric modeling. The underlying strategy of the approach is to lift the domain of the problem into a higher-dimensional space to enable analysis on the continuum of all possible configurations of the geometry. This higher-dimensional space supports analysis of changes to solution topology by solving for critical points using a B-spline-based constraint solver. The critical points are then used to guide fast, local methods to robustly update repeated queries. This approach effectively combines the speed of local updates with the robustness of global search solutions. The effectiveness of the domain lifting scheme (DLS) is demonstrated on several geometric computations, including accurately generating offset curves and finding minimum distances. Our approach requires a preprocessing step that computes the critical points, but once the topology is analyzed, an arbitrary number of geometry queries can be solved using fast local methods. Experimental results show that the approach solves for several hundred minimum distance computations between planar curves in one second and results in a hundredfold speedup for trimming self-intersections in offset curves.     

A verifiable multi-secret sharing scheme based on cellular automata

In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme, based on one-dimensional cellular automata where the number of secrets is not restricted by n or t. We show that our scheme can be used to solve an open problem proposed recently in Alvarez et al. (2008) [G. Alvarez, L. Hernández Encinas, A. Martín del Rey, A multisecret sharing scheme for color images based on cellular automata, Information Sciences 178 (2008) 4382-4395].     

A high quality and small shadow size visual secret sharing scheme based on hybrid strategy for grayscale images

Many secret sharing schemes for digital images have been developed in recent decades. Traditional schemes typically must deal with the problem of computational complexity, and other visual secret sharing schemes come with a higher transmission cost and storage cost; that is, each shadow size is m times as big as the original secret image. The new (2,n) secret sharing scheme for grayscale images proposed in this paper is based a combination of acceptable image quality using block truncation coding (BTC), high compression ratio discrete wavelet transform (DWT) and good subjective performance of the vector quantization (VQ) technique. Experimental results confirm that our proposed scheme not only generates a high quality reconstructed original image but also generates small, random-like grayscale shadows.     

无线传感器网络的一种可调节的拓扑控制算法

在无线传感器网络的拓扑控制问题中,保持节点能耗最低路径和低节点度之间存在一种平衡.最佳的平衡点与具体的应用和网络状态有关.文中提出一种新的拓扑控制算法,使所构造的拓扑能在这两个不一致的目标之间进行调节.该算法所构造的拓扑结构在一极能保持所有能耗最低路径,另一极能使平均节点度逼近理论最小值.仿真结果证实新算法在比已有方案更真实的能量消耗模型下可以保持所有能耗最低路径,同时也显示新算法对节点度有更大的调节范围.     

基于贪婪算法的卫星区域观测方案制定

针对卫星区域最优观测方案制定,将其抽象为集合覆盖问题和带附加条件的集合覆盖问题,在利用多星观测资源的情况下,提出了一种基于贪婪算法的解决方法,在该方法的基础上通过多次迭代求解来满足观测的实际需求。通过对该方法进行仿真实验,实验了不同条件下的求解情况,并对仿真结果进行了相关分析。