Microwave and conventional treatment of low-cement high-alumina castables with different water-to-cement ratio; Part II. Dehydration

Modern refractory castables contain between 3.5 and 5?wt.-% water that is necessary for sufficient flow during emplacement and for the formation of hydrate phases, necessary for the green strength of the material. Prior to the high temperature use of this material, it must be dried very carefully to avoid explosive spalling.This paper will demonstrate that beside conventional drying of pre-shaped materials in resistance furnaces microwave radiation is an energy saving and rapid method to remove pore water as well as hydrate bond water from the castable. In comparison to resistance furnaces, the use of microwave radiation does not affect the castable properties as there are mechanical strength (MOR, CCS), open porosity and pore size distribution. This study proved microwave radiation as valuable alternative with a series of tabular alumina based low cement castables (LLC) in which the water-to-cement-ratio (wcr = 0.64, 0.75, 0.82 and 1.13) was systematically altered by changing the cement concentration at constant mixing water concentration of 4.5%.     

基于颜色四通道及空间金字塔的鱼类图像检索

随着计算机视觉技术在海洋水产领域中的应用不断加深，鱼类图像检索在渔业资源调查、鱼类行为学分析等方面发挥了巨大的作用。通过研究发现，鱼类图像的背景信息会对鱼类图像检索造成极大干扰，而且鱼类图像中颜色、纹理、形状等特征由于空间位置信息的缺乏而使检索的准确率不高。为解决以上问题，提出了一种新的基于颜色四通道及空间金字塔的鱼类图像检索算法。首先，提取视觉显著性图将鱼类图像的前景和背景分开，从而减少图像背景对检索的干扰；其次，为了使图像特征包含一定的空间位置信息，利用空间金字塔的理论对图像进行分割，在此基础上，将图像转为HSVG四通道图并提取SURF特征；；最后，得到检索结果。为验证所提算法的有效性，在QUT_fish_data数据集和DLOU_fish_data数据集上对算法的查全率、查准率与经典的HSVG算法和显著性分块算法进行对比：在两个数据集上查准率分别比传统的HSVG算法最多分别提高12%和5%，查全率最多分别提高7%和22%；比传统的显著性分块算法查准率最多分别提高15%和5%，查全率最多分别提高36%和22%；从而证明所提算法是有效的，能有效提升鱼类图像的检索效果。     

基于投影寻踪的径向基函数网络在参考腾发量预测中的应用

径向基函数网络(RBFN)已广泛应用于参考腾发量预测等领域，但常用的K均值聚类和自组织特征映射等方法在求取径向基函数网络隐层节点中心时存在较大不足。针对这一问题，本文引入投影寻踪方法，在投影降维的基础上实现对大量高维数据的聚类，建立了基于投影寻踪的径向基函数网络模型，并将该模型应用于山西潇河灌区参考腾发量的预测，研究了不同气象因子输入对参考腾发量预测精度的影响。结果表明，基于投影寻踪的径向基函数网络具有较强的适用性，只需使用最高温度、最低温度、日照时数和旬序数作为输入因子，就能以较高的精度预测参考腾发量。     

A note on the value function for constrained control problems

We consider the Mayer optimal control problem with dynamics given by a nonconvex differential inclusion, whose trajectories are constrained to a given set and we obtain a relation between the costate function that appears in the maximum principle and the value function. This relation extends the known conditions existing in the literature for unconstrained problems to those for problems under state constraints.     

GIS在深圳市三防指挥信息系统中的应用

深圳市三防指挥信息系统利用GIS技术,结合水利(水务)、防汛、抗旱的具体业务,建立了水情遥测数据处 理分系统、工况监测数据处理分系统、水务行业三防信息管理分系统、决策支持分系统、水源优化调度分 系统,提高了现代化管理水平。     

HFC电缆分配系统的建设与思考

结合沧州市网络的实际情况，主要分析HFC电缆分配系统双向传输改造的建设标准和实施方案。     

Experimental and modeling approaches of MR behaviors under large step strains

Rheological properties of MR fluids under large step strain shear are presented in this paper. The experiments were carried out using a rheometer with parallel-plate geometry. Under the large step strain shear, MR fluids behave as nonlinear viscoelastic properties, where the stress relaxation modulus, G(t, γ), shows a decreasing trend with step strain. The experimental results indicate that G(t, γ) obeys time-strain separability. Thus, a mathematical form based on finite exponential serials is proposed to predict MR behavior. In this model, G(t, γ) is represented as the product of a linear stress relaxation, G(t), and the damping function, h(γ), i.e. G(t, γ)=G(t) h(γ). G(t) is simply represented as a three-parameter exponential serial and h(γ) has a sigmoidal form with two parameters. The parameters are identified by adopting an efficient optimization method proposed by Stango et al. The comparison between the experimental results and the model-predicted values indicates that this mathematical model can accurately predict MR behavior.     

一种改进的颜色匹配对图像检索算法

以子块直方图彩色图像检索算法为基础， 分析了进一步利用图像空间相似信息的颜色匹配对检索算法的性能。在子块直方图的构成、直方图距离值的归类等方面提出了行之有效的改进方法；给出了子块大小、相似度阈值等参数选择的优化原则，使查准率、查全率等检索性能指标得到了较大的提高，得出了几个有用的结论并形成了实验系统。     

8VSB芯片的层次式设计方法

提出了深亚微米下系统级芯片层次式版图设计的方法，并用该方法设计了HDTV信道解码芯片8VSB的版图。实例设计结果表明，该方法在节约面积、加速时序收敛方面效果明显，大大缩短了芯片设计周期。     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.