用Hubbard模型对高Tc氧化物超导性的研究

本文的简化 Hubbard 哈密顿量,不仅包括单电子跳跃和一个电子从一个格点到近邻单占据格点运动的反铁磁虚交换作用,而且保留有关三个格点的单重态电子对运动的虚跳跃过程和同格点上电子的关联作用项。同时引入重整化因子(?)来描述电子在宏观区域上的巡游程度,研究了超导的转变温度 Tc。结果显示,Tc 作为空穴含量δ的函数存在一个极大值,且随 U 的减小而升高。与实验数据相对比,本文结果是合理的。     

基于选择准则的参数模型评价方法

为评价参数模型的优劣,分析了模型信息量与数据被模型拟合后的残差信息量之间的关系,提出了综合考虑模型拟合残差大小、残差信息量与参数数目的一种模型选择的新方法RIA。结合RIA方法,定义了时序模型评价的一种准则,并以航天测量数据处理为例,说明了不同模型在工程实际中的不同表现和本质区别的意义所在。     

一种基于统计参数映射融合独立成分分析的新的激活区探测方法

统计参数映射在某种程度上依赖于广义线性模型和高斯场理论。广义线性模型的缺陷在于这些假设不能很好地表示fMRI数据,并且脑活动分布模式和血液动力学模型也不能由广义线性模型回归方程来恰如其分地模拟。而独立成分分析不能够提供每一独立成分激活区的显著性估计,这使得实验者不能够很好地解释所获得的结果。提出一种将SPM和ICA技术进行融合的方法,此方法可以将ICA自身的某些优势和GLM的假设检验方法结合起来,互相取长补短。实验结果证明了这种方法在探测由运动任务所产生的激活区方面是有效的。     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

机动目标建模及机动检测算法

为解决机动目标跟踪问题,建立了非机动(匀速直线运动)和机动目标当前统计两种动态模型,并对机动目标当前统计模型的输入控制的估计进行了适当改进.同时对非机动模型的观测残差和机动模型的输入估计进行检验,以便准确检测目标机动.     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

Pickands型推广估计量的渐近正态性

极值指数在许多实际领域广泛应用:如组合投资、风险值的计算、预报地震等, 估计极值指数γ以及它的性质的研究近年来成为极值统计理论的基本问题。主要研究极值指数γ的一个估计量:Pickands型推广估计量的渐近正态性质。首先研究由Pickands型推广估计量构成的一随机过程,得到了该过程的渐近分布;然后利用研究结果证明了Pickands 型推广估计量的渐近正态性,得到其渐近方差;最后对提出的Pickands型推广估计的平滑估计量进行了相应研究。     

基于PMC模型的神经网络

在计算机系统中有许多诊断算法,其中针对PMC模型有0-1规划的诊断算法,这个诊断算法是NP完全的,是在多项式时间内不可解的。然而利用神经网络的高度并行性这个特点,就可以在很短的时间内解出结果。主要分析了系统诊断模型PMC的症候特征,得到其充要条件,提出了新的算法,该算法具有高度的并行性,神经网络的发展为此提供了用模拟电路来实现算法的可能性,并进行了模拟验证。     

一种高超声速飞行器在线反馈滤波算法

高超声速飞行器是近年来各国大力发展的新概念飞行器,针对其飞行运动轨迹难以进行高精度跟踪这一问题,结合神经网络强大的自适应和自学习能力,提出了一种高超声速飞行器在线反馈滤波算法.其核心是在当前统计模型的基础上,利用BP神经网络与卡尔曼滤波相结合进行滤波器设计,实现对高超声速飞行器高精度跟踪.最后通过仿真试验进行比较,验证...