分布式光纤测温技术在冻结修复工程中的应用

针对采用冻结法进行成井井壁修复工程的特殊性,在进行常规水文孔、测温孔监测的同时,增加新型检测手段,利用分布式光纤测温技术检测每个冻结器的纵向温度,通过数据分析,为指导冻结施工安全顺利进行提供依据。详细介绍了修复工程的概况和分布式光纤测温系统的原理、组成、检测方法及测温光缆结构。给出了现场实测数据,与常规测温孔数据相比,数据量大,能全面、直观地反映冻结壁实际发展状况。系统结构简单,机动灵活,检测方法具有一定的推广价值。     

镀膜长周期光纤光栅透射谱研究

基于三包层长周期光纤光栅的耦合模型,研究了镀膜长周期光纤光栅的光栅参数和膜层厚度对长周期光纤光栅谐振波长的影响。研究发现,当长周期光纤光栅的纤芯半径、折射率和周期增大时,谐振波向长波方向漂移;当长周期光纤光栅的包层半径和折射率增大时,谐振波向短波方向漂移。不同折射率的膜层介质其所对应的最优厚度(Optimum Overlay Thickness,OOT)不同,薄膜介质的折射率越高,对应的最优厚度越小,敏感区域范围也较窄;不同包层模式对应的最优厚度具体位置区别不大,较高阶次包层模对应的谐振波长在敏感区域范围内漂移量较大。     

面向决策的信任融合模型研究

信任关系模型无论是在现实生活中还是在开放网络中都是最复杂的社会关系模型之一,是一个很难度量的抽象的心理认知,因为它涉及假设、期望、行为和环境等多种因素。借鉴以往的研究经验,综合考虑多种信任关系要素,提出了一种新的面向决策的信任融合模型。该模型基于直接信任度、间接信任度和信誉值的演化,依据信任融合获得决策信任度,为主体评判下一次的交互提供依据。为了证明信任融合模型的有效性,假设客体在ω类活动中以期望为PωX的概率从事该项活动。实验证明,信任融合模型得到的决策信任度和客体可信度的差异明显小于直接信任度、间接信任度或信誉值。     

可组合的描述符泄露类型检查

应用程序通过操作系统的系统调用对文件描述符进行操作并管理文件资源。如果应用程序对资源描述符的管理出现错误并发生描述符泄漏,会严重影响系统的可用性。据此,提出了一种检查程序是否会导致描述符泄漏的类型系统,给出了描述符操作方法的语义和类型约束,证明了类型系统的可靠性定理。此外,还初步讨论了该类型系统在并发程序下的扩展。     

正则化半监督判别分析方法

为了克服加权线性判别分析(WLDA)只利用有标签的训练样本而不能反映样本数据流形结构的缺点,提出一种正则化的半监督判别分析方法。首先构建所有样本的近邻图来估计数据的局部流形结构,然后将此作为正则项引入WLDA的准则函数中。该方法避免了类内散度矩阵奇异,同时保持了样本数据的判别结构和几何结构。在ORL和YALE人脸数据库上的实验结果证明了该算法的有效性。     

Finite‐time asynchronous filtering for discrete‐time Markov jump systems over a lossy network

This paper is concerned with the problem of finite‐time asynchronous filtering for a class of discrete‐time Markov jump systems. The communication links between the system and filter are assumed to be unreliable, which lead to the simultaneous occurrences of packet dropouts, time delays, sensor nonlinearity and nonsynchronous modes. The objective is to design a filter that ensures not only the mean‐square stochastic finite‐time bounded but also a prescribed level of performance for the underlying error system over a lossy network. With the help of the Lyapunov–Krasovskii approach and stochastic analysis theory, sufficient conditions are established for the existence of an admissible filter. By using a novel simple matrix decoupling approach, a desired asynchronous filter can be constructed. Finally, a numerical example is presented and a pulse‐width‐modulation‐driven boost converter model is employed to demonstrate the effectiveness of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd.     

Dispersion Constraint Based Non-negative Sparse Coding Model

Based on advantages of basic non-negative sparse coding (NNSC) model, and considered the prior class constraint of image features, a novel NNSC model is discussed here. In this NNSC model, the sparseness criteria is selected as a two-parameter density estimation model and the dispersion ratio of within-class and between-class is used as the class constraint. Utilizing this NNSC model, image features can be extracted successfully. Further, the feature recognition task by using different classifiers can be implemented well. Simulation results prove that our NNSC model proposed is indeed effective in extracting image features and recognition task in application.     

New quantum codes from dual-containing cyclic codes over finite rings

Let \(R=\mathbb {F}_{2^{m}}+u\mathbb {F}_{2^{m}}+\cdots +u^{k}\mathbb {F}_{2^{m}}\), where \(\mathbb {F}_{2^{m}}\) is the finite field with \(2^{m}\) elements, m is a positive integer, and u is an indeterminate with \(u^{k+1}=0.\) In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over R. A new Gray map over R is defined, and a sufficient and necessary condition for the existence of dual-containing cyclic codes over R is given. A new family of \(2^{m}\)-ary quantum codes is obtained via the Gray map and the Calderbank–Shor–Steane construction from dual-containing cyclic codes over R. In particular, a new family of binary quantum codes is obtained via the Gray map, the trace map and the Calderbank–Shor–Steane construction from dual-containing cyclic codes over R.     

多样性攻击下的WSN位置隐私保护方案

研究无线传感器网络节点隐私保护问题,节点位置隐私是无线传感器网络领域中所研究的一个基本问题。传统的位置隐私保护算法存在抵御攻击类型单一、保护目标单一以及无法应对复杂多样性攻击等问题。为了解决上述问题,在传统的位置隐私保护算法基础上提出了针对多样性攻击的位置隐私保护方案。通过增加冗余抵御数据包流量分析,破坏数据包之间的相关性抵御数据包追踪,利用数据包分组、概率丢弃冗余包等方式降低网络资源消耗,达到抵御攻击类型、保护目标多样和应对多样性攻击的目的。理论分析和仿真结果表明,上述方案能够保证事件检测率和降低网络时延,同时实现多样性攻击下的位置隐私保护。