地源热泵垂直埋管周围土壤温度场数值模拟及分析

概述了地源热泵技术,对影响埋管换热器的最主要因素——埋管周围土壤温度场进行了研究,采用了建立传热模型并借助FLUENT软件进行数值模拟的方法,对垂直U型埋管换热器周围土壤温度场的特性进行了研究,分析了不同管井水平间距、系统冬夏季不同的运行天数、热泵系统长期和短期运行、不同埋管类型等不同工况对埋管换热器周围土壤温度场的影响,以提供冬、夏季节的运行时间分配和管井水平间距等方面的基础数据,从而为垂直埋管换热器的设计提供参考。     

环形掺铒光纤激光器自混合散斑及动态目标距离测量

研究了一种基于环形腔的光纤激光器自混合散斑动态目标距离测量方法。提出环形掺铒光纤激光器自混合散斑效应的实验模型,对环形光纤激光器内自混合散斑信号的产生进行了理论分析,并通过实验得到了动态自混合散斑信号。应用动态散斑信号的频谱能量密度分析,得到垂直扫描光束探测距离与频谱能量密度的线性关系。研究结果表明,应用光纤激光器和自混合散斑效应,可以对动态目标的距离进行高精度测量。     

基于DTMB的NR解码器算法研究与FPGA实现

针对恶劣信道条件下最小汉明距算法判决效果较差的特点,提出了一种改进算法,与4QAM解映射相结合,应用于DTMB系统的NR解码模块。仿真结果表明,改良后的算法令系统性能提高了近1.5dB;另外,利用NR码字特点,硬件设计中采用对称实现,节约了近一半ROM;定系数乘法器采用CSD编码技术,以节省硬件资源。     

双噻唑苯二聚体自由基分子的极化率与二阶超极化率的理论研究

采用量子化学UMP2/6-31G(d,p)方法优化双噻唑苯二聚体自由基分子的几何结构,以0.05nm为单位步长拉长与缩短2分子片之间的距离,选取5个点,采用DFTUB3LYP/6-31G(d,p)方法,对双噻唑苯二聚体自由基分子的极化率和二阶超极化率进行理论计算.结果表明,自由基体系的单重态为相对稳定状态.在完全重叠的体系中,在单、三重态时极化率都随着2分子片间距离的增大而增加;三重态时二阶超极化率的绝对值随着2分子片间距离的增大而增大.部分重叠的体系,单重态时极化率随2分子片距离的增大而减小;三重态时,二阶超极化率的绝对值随着2分子片间距离的增大而增大.     

基于直觉犹豫模糊集的TOPSIS法

直觉犹豫模糊集集成了直觉模糊集和犹豫模糊集的优势,能更有效地刻画决策者偏好不一致的情况。距离测度一直是研究的热点问题,但尚没有文献研究直觉犹豫模糊集间的距离测度,因此本文定义了直觉犹豫模糊集间的Hamming距离、Euclidean距离和广义距离,同时考虑每个元素的权重,定义了加权距离。犹豫度是直觉犹豫模糊集的重要特性,因此在考虑犹豫度的基础上,又定义了一些距离测度。这些距离测度不仅考虑了直觉犹豫模糊数间的差异,同时考虑了犹豫度的影响,决策者可以根据对直觉犹豫模糊数和犹豫度之间偏好的不同,设置不同的偏好值得到距离测度。然后基于这些距离测度,又提出了直觉犹豫模糊环境下的TOPSIS法。最后通过实例说明了所提出的TOPSIS法的合理性与实用性。     

JADE for Tensor-Valued Observations

Independent component analysis is a standard tool in modern data analysis and numerous different techniques for applying it exist. The standard methods however quickly lose their effectiveness when the data are made up of structures of higher order than vectors, namely, matrices or tensors (e.g., images or videos), being unable to handle the high amounts of noise. Recently, an extension of the classic fourth-order blind identification (FOBI) specially suited for tensor-valued observations was proposed and showed to outperform its vector version for tensor data. In this article, we extend another popular independent component analysis method, the joint approximate diagonalization of eigen-matrices (JADE), for tensor observations. In addition to the theoretical background, we also provide the asymptotic properties of the proposed estimator and use both simulations and real data to show its usefulness and superiority over its competitors. Supplementary material including the proofs of the theorems and the codes for running the simulations and the real data example are available online.     

Inexact Iterative Bregman Method for Optimal Control Problems

In this article, we investigate an inexact iterative regularization method based on generalized Bregman distances of an optimal control problem with control constraints. We show robustness and convergence of the inexact Bregman method under a regularity assumption, which is a combination of a source condition and a regularity assumption on the active sets. We also take the discretization error into account. Numerical results are presented to demonstrate the algorithm.     

Transportation distances and noise sensitivity of multiplicative Lévy SDE with applications

This article assesses the distance between the laws of stochastic differential equations with multiplicative Lévy noise on path space in terms of their characteristics. The notion of transportation distance on the set of Lévy kernels introduced by Kosenkova and Kulik yields a natural and statistically tractable upper bound on the noise sensitivity. This extends recent results for the additive case in terms of coupling distances to the multiplicative case. The strength of this notion is shown in a statistical implementation for simulations and the example of a benchmark time series in paleoclimate.     

Some new non-additive maximum rank distance codes

In this paper, a construction of maximum rank distance (MRD) codes as a generalization of generalized Gabidulin codes is given. The family of the resulting codes is not covered properly by additive generalized twisted Gabidulin codes, and does not cover all twisted Gabidulin codes. When the basis field has more than two elements, this family includes also non-affine MRD codes, and such codes exist for all parameters. Therefore, these codes are the first non-additive MRD codes for most of the parameters.     

Feng–Rao decoding of primary codes

We show that the Feng–Rao bound for dual codes and a similar bound by Andersen and Geil (2008) [1] for primary codes are consequences of each other. This implies that the Feng–Rao decoding algorithm can be applied to decode primary codes up to half their designed minimum distance. The technique applies to any linear code for which information on well-behaving pairs is available. Consequently we are able to decode efficiently a large class of codes for which no non-trivial decoding algorithm was previously known. Among those are important families of multivariate polynomial codes. Matsumoto and Miura (2000) [30] (see also Beelen and Høholdt, 2008 [3]) derived from the Feng–Rao bound a bound for primary one-point algebraic geometric codes and showed how to decode up to what is guaranteed by their bound. The exposition in Matsumoto and Miura (2000) [30] requires the use of differentials which was not needed in Andersen and Geil (2008) [1]. Nevertheless we demonstrate a very strong connection between Matsumoto and Miuraʼs bound and Andersen and Geilʼs bound when applied to primary one-point algebraic geometric codes.