Proximity-Induced Fully Ferromagnetic Order with Eightfold Magnetic Anisotropy in Heavy Transition Metal Oxide CaRuO3

Ferromagnetic materials with a strong spin-orbit coupling (SOC) have attracted much attention in recent years because of their exotic properties and potential applications in energy-efficient spintronics. However, such materials are scarce in nature. Here, a proximity-induced paramagnetic to ferromagnetic transition for the heavy transition metal oxide CaRuO₃ in (001)-(LaMnO₃/CaRuO₃) superlattices is reported. Anomalous Hall effect is observed in the temperature range up to 180 K. Maximal anomalous Hall conductivity and anomalous Hall angle are as large as ∼15 Ω⁻¹ cm⁻¹ and ∼0.93%, respectively, by one to two orders of magnitude larger than those of the typical 3d ferromagnetic oxides such as La_0.67Sr_0.33MnO₃. Density functional theory calculations indicate the existence of avoid band crossings in the electronic band structure of the ferromagnetic CRO layer, which enhances Berry curvature thus strong anomalous Hall effects. Further evidences from polarized neutron reflectometry show that the CaRuO₃ layers are in a fully ferromagnetic state (∼0.8 μ_B/Ru), in sharp contrast to the proximity-induced canted antiferromagnetic state in 5d oxides SrIrO₃ and CaIrO₃ (∼0.1 μ_B/Ir). More than that, the magnetic anisotropy of the (001)-(LaMnO₃/CaRuO₃) superlattices is eightfold symmetric, showing potential applications in the technology of multistate data storage.     

从测角后交最佳点位规律看规范规定之不足

本文分析了文献[1]所总结的测角后交两类公式在取得最佳点位时的规律,指出当前规范对此问题规定之不足.     

基于完备抽象解释的模型检验CTL公式研究

在模型检验中,抽象是解决状态空间爆炸问题的重要方法之一.给定具体Kripke结构和时序描述语言CTL,基于抽象解释框架以及完备抽象解释和性质强保留之间的关系,抽象模型最小精化使得CTL性质强保留,可转换为抽象解释中抽象域的最小完备精化,并且总是存在抽象域的最小完备精化.根据状态标签函数确定初始抽象域,然后通过不动点求解,获得对CTL标准算子完备的最小抽象域,并依据此抽象域求得CTL性质强保留的最优抽象状态划分,最后构造出CTL性质强保留且最优的抽象状态转换系统.并指出了抽象域对CTL标准算子是完备的当且仅当抽象域对补集和标准前向转换是完备的.     

A blind watermarking method using maximum wavelet coefficient quantization

This paper proposes a blind watermarking algorithm based on maximum wavelet coefficient quantization for copyright protection. The wavelet coefficients are grouped into different block size and blocks are randomly selected from different subbands. We add different energies to the maximum wavelet coefficient under the constraint that the maximum wavelet coefficient is always maximum in a block. The watermark is embedded the local maximum coefficient which can effectively resist attacks. Also, using the block-based watermarking, we can extract the watermark without using the original image or watermark. Experimental results show that the proposed method is quite robust under either non-geometry or geometry attacks.     

基于间隔控制的信息隐藏算法

提出一种在图像离散余弦变换（DCT）域内的信息隐藏算法。为了在基本保证隐秘图像视觉质量的前提下有效提高载体图像的信息隐藏量,该方法使用随机序列进行间隔控制,选择信息嵌入位,把随机序列的种子看成密钥,通过比较变换后的2个DCT系数完成信息的隐藏。试验结果表明,该算法可以兼顾秘密信息隐藏的不可见性和鲁棒性,密钥空间大,能够实现自适应隐藏和提取信息的盲检测。     

HK网络演化模型的研究和改进

研究一种高集聚度的无标度网络模型,以Holme和Kim（HK）模型为基础,通过引进新增节点所应该具备的连接动态性,改进HK模型的局部特性。分析和仿真表明,改进模型HK’不仅继承了HK模型的高聚类效应和无标度特性,且它的幂律指数可在2～3之间变化,网络成员间的竞争机制也与现实社会网络较接近。     

Estimation of the Bivariate Stable Spectral Representation by theProjection Method

A method of estimating the spectral representation of a generalized bivariatestable distribution is presented, based on a series of maximum likelihood (ML)estimates of the stable parameters of univariate projections of the data. Thecorresponding stable spectral density is obtained by solving a quadraticprogram. The proposed method avoids the often arduous task of computing themultivariate stable density, relying instead on the standard univariate stabledensity. The paper applies this projection procedure, under the simplifyingassumption of symmetry, to simulated data as well as to foreign exchangereturn data, with favorable results. Kanter projection coefficients governingconditional expectations are computed from the estimated spectral density. For the simulated data these compare well to their known true values.     

用殷钢波导控制相控阵天线的监测精度

有效地控制某系统相控阵天线的指向精度,是保证整个系统精确定位的关键问题。这里介绍了如何利用殷钢材料的温度特性以及选用殷钢材料的波导来做监测歧管,保证监测精度的设计依据。     

基于F2上遍历矩阵的Shamir三次传递协议的实现

给出了Shamir三次传递协议的一种新的实现方案.与已有的基于离散对数问题的实现方案不同,它是基于在特定的非交换壹半群(m,·)中,由A和B＝x·A·y求解x和y的难度;为此我们选取有限域F2上的n×n矩阵在F2矩阵乘法下所构成的非交换壹半群作为研究的对象,利用F2上"遍历矩阵"的密码学特性,提出了一个基于F2上遍历矩阵的Shamir三次传递协议的实现方案,并对可能的攻击手段进行了分析.为了增加通讯的安全性,提出了"强壮矩阵"的概念,并对于给定的两个遍历矩阵Q1和Q2,给出了关于Q1,Q2的强壮矩阵的判别标准和寻找算法;利用<Q1>,<Q2>以及关于Q1,Q2的强壮矩阵m,可以构造一个单向(陷门)函数,基于该单向函数,可具体实现Shamir三次传递协议、Diffie-Hellman密钥交换协议以及常规的公钥密码.