基于PCA-BPNN的膨胀土自由膨胀率预测

为了准确地对膨胀土进行分类,将主成分分析方法（PCA）和BP神经网络方法（BPNN）相结合,进行膨胀土自由膨胀率预测研究。首先,对影响自由膨胀率的几个物性指标数据进行主成分分析,得到主成分数据序列;然后,根据主成分数据序列建立输入样本并应用BP神经网络进行训练,得到PCA-BPNN预测结果,从而预测自由膨胀率。采用南阳膨胀土数据进行实例分析,结果表明,该模型比单一BP神经网络预测方法的效果更好。     

APPLICATION OF TIME-VARYING VISCOUS GROUT IN GRAVEL- FOUNDATION ANTI-SEEPAGE TREATMENT

The time-varying viscosity of common grout and the controllable grout are measured with a rotation viscometer in experiments.The time-varying viscosity of grout is analyzed according to the characteristics in the process of anti-seepage treatment for gravel foundation.The principle of effective stress for porous medium is applied to analyzes the fluid-structure coupling in grouting.In the consideration of coupling physical variables,dynamic models of porosity,permeability and viscosity are constructed.The diffusion radius can thus be defined by the foundational porosity.The distribution of holes in field experiments is designed according to the diffusion radius of grout.Then,the permeability test is designed to verify the grout effect.The calculated diffusion radius coincides with experimental results,and the permeability meets the requirements of the project,which is valuable for the anti-seepage treatment in gravel foundation.     

Robust video hashing based on representative-dispersive frames

This study proposes a robust video hashing for video copy detection.The proposed method,which is based on representative-dispersive frames(R-D frames),can reveal the global and local information of a video.In this method,a video is represented as a graph with frames as vertices.A similarity measure is proposed to calculate the weights between edges.To select R-D frames,the adjacency matrix of the generated graph is constructed,and the adjacency number of each vertex is calculated,and then some vertices that represent the R-D frames of the video are selected.To reveal the temporal and spatial information of the video,all R-D frames are scanned to constitute an image called video tomography image,the fourth-order cumulant of which is calculated to generate a hash sequence that can inherently describe the corresponding video.Experimental results show that the proposed video hashing is resistant to geometric attacks on frames and channel impairments on transmission.     

规则引擎在气象资料质量控制中的应用研究

为了提高气象观测资料的质量,为大气运动规律研究及各类气象业务系统提供可靠的数据来源,提出一种基于RETE算法和Drools规则引擎的气象观测资料质量控制方法.该方法能对各类字符编码的气象报文进行实时、准确的检查,并具有灵活的规则自定义与维护功能,以适应各类气象观测资料不断发展、变化的要求.该方法的应用,既继承了传统的历...     

模态描述逻辑MALC模型的几个代数性质

本文定义了MALC模型间的同构、同态等关系,并讨论了合式公式在这些关系下的不变性等代数性质。最后定义了MALC的拓扑语义及基于拓扑语义互模拟,得到MALC的合式公式在拓扑互模拟下具有不变性。     

Shape from shading using graph cuts

In this paper, we investigate the applicability of graph cuts to the SFS (shape-from-shading) problem. We propose a new semi-global method for SFS using graph cuts. The new algorithm combines the local method proposed by Lee and Rosenfeld [C.H. Lee, A. Rosenfeld, Improved methods of estimating shape from shading using the light source coordinate system, Artif. Intell. 26 (1985) 125-143] and a global method using an energy minimization technique. By employing a new global energy minimization formulation, the convex/concave ambiguity problem of Lee and Rosenfeld's method can be resolved efficiently. A new combinatorial optimization technique, the graph cuts method, is used for the minimization of the proposed energy functional. Experimental results on a variety of synthetic and real-world images show that the proposed algorithm reconstructs the 3-D shape of objects very efficiently.     

Hamiltonian-connected graphs

For a simple graph G, let . In this paper, we prove that if NCD(G)≥|V(G)|, then either G is Hamiltonian-connected, or G belongs to a well-characterized class of graphs. The former results by Dirac, Ore and Faudree et al. are extended.     

基于枚举算法设计“俄罗斯方块”游戏

该文绕开了晦涩难懂、比较复杂的矩阵算法,提出了另一种枚举算法来实现这个经典游戏。枚举算法没有复杂的数学理论,避免了在程序中大量使用矩阵运算公式,设计思路清晰、明了,非常适合游戏设计的初学者理解和实现,最后用Flash Active Script设计实现俄罗斯方块游戏     

可配置流处理器核心级指令设计及相关编译技术研究

针对目前微处理器面对通用性、高性能、功耗效率的矛盾,我们提出了可配置流处理器的解决方案。本文重点研究了可配置流处理器中核心级指令设计及相关的编译技术,其核心设计思想是根据应用的计算特征设计流处理器中的核心级指令集,从而降低指令集硬件资源的需求。     

一种无线传感器网络四边测距定位算法

根据RSSI测距特性,在三边测距定位的基础上,提出了基于RSSI值测距的四边测距定位算法,突破了三边测距定位的局限性。为进一步提高精度,采用了求质心和加权质心的方法,并用C++实现仿真比较,仿真结果表明:加权质心算法具有较高的精度,整个定位过程中节点间无需额外的通信开销,具有广泛的实用性。