非部分嵌套信息结构的LQG动态队决策问题的可解性（II）*

本文讨论非嵌套信息结构的递阶队决策问题和控制均享信息结构的LQG分散控制问题,文中首先证明这两类问题的信息结构都是“部分控制嵌入”的,进而给出最优策略(或控制)存在的充要条件和当此条件成立时最优策略(或控制)的表达式。     

A Heuristic Approach to the Discovery of Macro-Operators

This paper describes a heuristic approach to the discovery of useful macro-operators (macros) in problem solving. The approach has been implemented in a program, MACLEARN, that has three parts: macro-proposer, static filter, and dynamic filter. Learning occurs during problem solving, so that performance improves in the course of a single problem trial. Primitive operators and macros are both represented within a uniform representational framework that is closed under composition. This means that new macros can be defined in terms of others, which leads to a definitional hierarchy. The representation also supports the transfer of macros to related problems. MACLEARN is embedded in a supporting system that carries out best-first search. Experiments in macro learning were conducted for two classes of problems: peg solitaire (generalized Hi-Q puzzle), and tile sliding (generalized Fifteen puzzle). The results indicate that MACLEARN'S filtering heuristics all improve search performance, sometimes dramatically. When the system was given practice on simpler training problems, it learned a set of macros that led to successful solutions of several much harder problems.     

Probability densities for conditional statistics in the cubic sensor problem

This paper applies the techniques of Malliavin’s stochastic calculus of variations to Zakai’s equation for the one-dimensional cubic sensor problem in order to study the existence of densities of conditional statistics. Let {X _t} be a Brownian motion observed by a cubic sensor corrupted by white noise, and let denote the unnormalized conditional estimate of φ(X _i ). If φ₁,...,φ _n are linearly independent, and if , it is shown that the probability distribution of admits a density with respect to Lebesgue measure for anyn. This implies that, at any fixed time, the unnormalized conditional density cannot be characterized by a finite set of sufficient statistics. Research supported in part by NSF Grant No. MCS-8301880 and by the Institute for Mathematics and It Applications, Minneapolis, Minnesota.     

曝光数据流优化问题的蒙特卡罗算法

集成工艺中控制图形发生器产生掩模图形的数据流文件的数据排列顺序优化,是一个其结点数可达数千个之多的大规模旅行商问题(从镜头架的位置,即每个矩形的矩心为结点),常规算法早已不适用。本文采用多阶段蒙特卡罗算法并加以改进,补充了“分层优化模式”,邻接结点的预合并和在各个阶段末提取共同子路径并删去相关结点等一系列逐步缩小问题规模的措施,形成了一个实用的优化算法。相应的软件已成功地应用于薄膜磁头的数据流文件的优化。     

A heuristic 0–1 integer programming method

Summary In this paper, we present a novel relaxation method for the integer programming problem:Ax=b,A {–1,0,+1}^m×N,x {0,1}^N, N>m. The report includes experimental results of problems with up tom=100 equations andN=400 variables.     

一种谱分解降维的模糊有监督局部保持投影策略

提出一种谱分解降维的模糊有监督局部保持投影策略。首先针对监督局部保持投影SLPP存在过学习和不能较好地保持图像空间的差异信息等问题,通过最小化局部离散度和最大化差异离散度准则提取投影方向,找到一种线性鉴别分析的等价形式。其次,通过采用模糊k近邻(FKNN)方法得到相应的样本分布隶属度信息,同时考虑到离群样本对整个分类结果的不利影响,提出一种模糊化方法,根据样本的隶属度对样本分布矩阵重定义所做的贡献,将每个样本的隶属度融入到SLPP特征抽取的过程中,从而得到完整有效的模糊样本特征向量集,有效解决了小样本问题的特征抽取问题。第三,提出一种谱分解的矩阵分析方法,在SLPP投影准则下,对散布矩阵实现降维。在ORL和NUST603人脸库上的实验结果验证了该方法的有效性。     

An analytical and numerical study of the two-dimensional Bratu equation

Bratu's problem, which is the nonlinear eigenvalue equationu+ exp(u)=0 withu=0 on the walls of the unit square and as the eigenvalue, is used to develop several themes on applications of Chebyshev pseudospectral methods. The first is the importance ofsymmetry: because of invariance under the C₄ rotation group and parity in bothx andy, one can slash the size of the basis set by a factor of eight and reduce the CPU time by three orders of magnitude. Second, the pseudospectral method is ananalytical as well as a numerical tool: the simple approximation3.2A exp(–0.64A), whereA is the maximum value ofu(x, y), is derived via collocation with but a single interpolation point, but is quantitatively accurate for small and moderateA. Third, the Newton-Kantorovich/Chebyshev pseudospectral algorithm is so efficient that it is possible to compute good numerical solutions—five decimal places—on amicrocomputer inbasic. Fourth, asymptotic estimates of the Chebyshev coefficients can be very misleading: the coefficients for moderately or strongly nonlinear solutions to Bratu's equations fall off exponentially rather than algebraically withv untilv is so large that one has already obtained several decimal places of accuracy. The corner singularities, which dominate the behavior of the Chebyshev coefficients in thelimit v, are so weak as to be irrelevant, and replacing Bratu's problem by a more complicated and realistic equation would merely exaggerate the unimportance of the corner branch points even more.     

密集观测场景下的敏捷成像卫星任务规划方法

针对密集观测场景下敏捷成像卫星任务规划问题求解空间大、输入任务序列较长的特点,综合考虑时间窗口约束、任务转移时卫星姿态调整时间、存储约束和电量约束,对敏捷成像卫星任务规划问题进行建模. 提出融合IndRNN和Pointer Networks的算法模型（Ind-PN）对敏捷成像卫星任务规划问题进行求解,使用多层的IndRNN结构作为算法模型的解码器. 基于Pointer Networks机制对输入任务序列进行选择,使用Mask向量考虑敏捷成像卫星任务规划问题中的各类约束. 基于Actor Critic强化学习算法对算法模型进行训练,以获得最大的观测收益率. 实验结果表明,对于密集观测场景下的任务规划,Ind-PN算法的收敛速度更快,可以获得更高的观测收益率.     

浅谈贵冶转炉残极加料机无液压控制及应用

转炉残极加料机是贵冶转炉重要辅助设备之一。本文分析了贵溪冶炼厂熔炼车间转炉残极加料机运行过程存在的问题。从设备管理角度出发,分析故障原因并提出改进措施。同时改变现有残极加入的方式,顺应时代趋势,实现自动化、岗位无人化操作并在一定程度上得到应用。     

我国超细粉碎与超细分级技术的现状及问题

近年来 ,我国的超细粉碎与超细分级技术有很大的发展 ,但在发展过程中存在着一些问题。超细粉体涉及的行业众多 ,但对其粒度的分类至今国内尚无定论。通过调研 ,分析了目前国内超细粉碎设备的现状。对超细粉体分级技术中的干法分级和湿法分级作了比较全面的介绍 ,并对我国超细粉碎与超细分级技术的发展提出了建议