基于指纹识别的虚拟硬盘研究

为防止机密数据不被窃取或篡改,本文提出一种基于指纹身份识别的虚拟硬盘文件加密存储方法。该方法是在Windows设备驱动程序的基础上,利用指纹识别技术和虚拟硬盘驱动程序,实现用户身份的唯一认证和文件的安全性管理。实验证明,该方法是一种安全、高效、实用的加密存储方法。     

虚拟环境平台上的Linux裁剪分析

分析在虚拟环境平台上（虚拟机上）,采用原有的和新的方法来裁减Linux系统,得到的效果和意义。     

虚拟现实在室内设计中的研究

主要探讨了选择虚拟现实系统,建立虚拟现实环境以及虚拟现实系统在实际应用,同时阐述了虚拟现实在未来室内设计的发展趋势。通过该系统让用户仿佛置身于这个设计的虚拟场景中,感受身临其境的效果。     

虚拟现实技术在反恐训练中的研究进展

介绍了虚拟现实技术的国内外研究现状,以及仿真技术与虚拟现实技术结合使用的发展趋势.为了更好地履行反恐使命,适应形势的发展,有必要提高反恐教学训练质量,创新反恐行动教学训练手段.将仿真技术和虚拟现实技术应用于路边炸弹的虚拟及仿真,能使反恐受训者不受时间、空间、经费和器材的限制,利用各种3D虚拟模型任意组装不同起爆方式下的路边炸弹,拓展其想象空间和创新思维,使之对路边炸弹的结构组成、工作原理及爆炸效应等有深刻理解.     

Personalizing 3D virtual fashion stores: Exploring modularity with a typology of atmospherics based on user input

This research develops a typology of atmospherics that contains user-identified modules and modular options for personalizing 3D virtual fashion stores. A content analysis of 46 focus group discussions (n = 170) was conducted to understand the user’s perspective for personalizing 3D virtual fashion store atmospherics. Based on three atmospheric categories (pathfinding assistant, environment, and the manner of product presentation), 17 modules and 207 modular options were identified for personalizing 3D virtual stores. This research pioneers the development of an atmospherics typology for personalizing 3D virtual shopping environments as a persuasive selling tool in the emerging field of 3D virtual reality (VR) retailing.     

Arnold置乱在零水印中的二次复用

为了提高水印的鲁棒性和减小对应版权信息的大小,本文提出了一种基于Arnold变换、DWT和SVD的零水印算法。该算法将载体图像进行DWT变换,对低频子带进行分块SVD;比较置乱后的最大奇异值的大小,若大于则对应位为1,否则为0;将结果与预处理过的水印做异或运算,得密钥矩阵。该矩阵为检测水印提供密钥。实验证明,本算法对图像压缩、滤波、模糊、噪声及脏图具有良好的鲁棒性。     

基于TLM2．0的硬件虚拟平台设计

利用OVP（Open Virtual Platform）提供的模型创建基于TLM2．0的硬件虚拟平台,可以为嵌入式软件提供一个快速有效的开发环境,实现软件和硬件的协同设计。提早开发出的软件也可以对系统虚拟平台进行功能验证,分析系统性能,确定系统的最优架构。     

Blind estimation of the PN sequence in lower SNR DS-SS signals with residual carrier

This paper presents a method of singular value decomposition (SVD) plus digital phase lock loop (DPLL) to solve the difficult problem of blind pseudo-noise (PN) sequence estimation in low signal to noise ratios (SNR) direct sequence spread spectrum (DS-SS, DS) signals with residual carrier. Of course, the method needs to know the parameters of DS signal, such as the period and code rate of PN sequence. Firstly, the received signal is sampled and divided into non-overlapping signal vectors according to a temporal window, whose duration is two periods of PN sequence. Then, an autocorrelation matrix is computed and accumulated by the signal vectors one by one. The PN sequence with residual carrier can be estimated by the principal eigenvector of this autocorrelation matrix. Furthermore, a DPLL is used to deal with the estimated PN sequence with residual carrier, it estimates and tracks the residual carrier, removes the residual carrier in the end. Theory analysis and computer simulation results show that this method can effectively realize the PN sequence estimation from the input DS signals with residual carrier in lower SNR.     

Equations of state for hard-sphere fluids

Equations of state and contact values of hard-sphere radial distribution functions (rdf's) which are given by a linear combination of the Percus— Yevick and scaled-particle virial expressions are considered. In the one-component case the mixing coefficient() is, in general, a function of the volume fraction. In mixtures the coefficient( _i ,d _i ), in general, depends upon the volume fraction _i , and diameterd _i , of each species,i andj. For the contact valuesY _ij of the rdf's, the mixing coefficients _ij ( _k ) also depend on speciesi andj. Density expansions for the exact for the one-component hard-sphere fluid are obtained and compared with several approximations made in earlier works and in our own work, as well as with simulations. For a mixture, it turns out that one cannot obtain the exact fourth virial coefficient by using a linear combination of the Percus-Yevick and scaled-particle virial expressions forY _ij unless one allows _ij to depend on mole fractionsx _i even at the zeroth order of its density expansion. We also find that _ij must depend on particle speciesi andj in order to satisfy the exact limits obtained earlier by Sung and Stell. A new equation of state for the binary hard-sphere mixture which satisfies all the exact limits we have considered is suggested.Paper presented at the Tenth Symposium on Thermophysical Properties, June 20–23, 1988, Gaithersburg, Maryland, U.S.A.     

Supporting inconsistent rules in database systems

When a set of rules generates (conflicting) values for a virtual attribute of some tuple, the system must resolve the inconsistency and decide on a unique value that is assigned to that attribute. In most current systems, the conflict is resolved based on criteria that choose one of the rules in the conflicting set and use the value that it generated. There are several applications, however, where inconsistencies of the above form arise, whose semantics demand a different form of resolution. We propose a general framework for the study of the conflict resolution problem, and suggest a variety of resolution criteria, which collectively subsume all previously known solutions. With several new criteria being introduced, the semantics of several applications are captured more accurately than in the past. We discuss how conflict resolution criteria can be specified at the schema or the rule-module level. Finally, we suggest some implementation techniques based on rule indexing, which allow conflicts to be resolved efficiently at compile time, so that at run time only a single rule is processed.An earlier version of this work appeared under the title Conflict Resolution of Rules Assigning Values to Virtual Attributes inProceedings of the 1989 ACM-Sigmod Conference, Portland, OR, June 1989, pp. 205–214.Partially supported by the National Science Foundation under Grant IRI-9157368 (PYI Award) and by grants from DEC, HP, and AT&T.Partially supported by the National Science Foundation under Grant IRI-9057573 (PYI Award), IBM, DEC, and the University of Maryland Institute for Advanced Computer Studies (UMIACS).