带化学反应的膛口温度场方程分歧解

提出膛口系统是一种准耗散结构，并分析了符合耗散结构的条件，在分析分歧解线性稳定性的基础上，使用高维定态投影解定态分歧解，分歧解与实验结果吻合较好。     

炼钢厂钢水温度—时间优化匹配系统开发

根据软件开发的基本原则，提出了炼钢厂的钢水温度－时间优化匹配系统开发总则和结构设计，并闻相应的软，硬件系统。     

Kernel-based least squares policy iteration for reinforcement learning.

In this paper, we present a kernel-based least squares policy iteration (KLSPI) algorithm for reinforcement learning (RL) in large or continuous state spaces, which can be used to realize adaptive feedback control of uncertain dynamic systems. By using KLSPI, near-optimal control policies can be obtained without much a priori knowledge on dynamic models of control plants. In KLSPI, Mercer kernels are used in the policy evaluation of a policy iteration process, where a new kernel-based least squares temporal-difference algorithm called KLSTD-Q is proposed for efficient policy evaluation. To keep the sparsity and improve the generalization ability of KLSTD-Q solutions, a kernel sparsification procedure based on approximate linear dependency (ALD) is performed. Compared to the previous works on approximate RL methods, KLSPI makes two progresses to eliminate the main difficulties of existing results. One is the better convergence and (near) optimality guarantee by using the KLSTD-Q algorithm for policy evaluation with high precision. The other is the automatic feature selection using the ALD-based kernel sparsification. Therefore, the KLSPI algorithm provides a general RL method with generalization performance and convergence guarantee for large-scale Markov decision problems (MDPs). Experimental results on a typical RL task for a stochastic chain problem demonstrate that KLSPI can consistently achieve better learning efficiency and policy quality than the previous least squares policy iteration (LSPI) algorithm. Furthermore, the KLSPI method was also evaluated on two nonlinear feedback control problems, including a ship heading control problem and the swing up control of a double-link underactuated pendulum called acrobot. Simulation results illustrate that the proposed method can optimize controller performance using little a priori information of uncertain dynamic systems. It is also demonstrated that KLSPI can be applied to online learning control by incorporating an initial controller to ensure online performance.     

Optimal Conditions for Preparing Ultra-Fine CeO2 Powders in A Submerged Circulative Impinging Stream Reactor

Cerium carbonate powders were produced in a submerged circulation impinging stream reactor (SCISR) from Ce(NO3)3·6H2O. NH4HCO3 was used as a precipitant in the reaction. Cerium carbonate powders were roasted to produce ultra-fine cerium dioxide (CeO2) powders. The optimal conditions of such production process were obtained by orthogonal and one-factor experiments. The results showed that ultra-fine and narrowly distributed cerium carbonate powders were produced under the optimal flowing conditions. The concentrations of Ce(NO3)3 and NH4HCO3 solutions were 0.25 and 0.3 mol·L-1, respectively. The concentration of PEG4000 added in these two solutions was 4 g·L-1. The stirring ratio, reaction temperature, feeding time, solution pH, reaction time and digestion time were 900 r·min-1, 80 ℃, 20 min, 5～6, 5 min and 1 h, respectively. The final product, CeO2 powders, was obtained by roasting the produced cerium carbonate in air for 3 h at 500 ℃. The finally produced CeO2 powders were torispherical particles with a narrow size distribution of 0.8～2.5 μm. The crystal structure of CeO2 powders belonged to cubic crystal system and its space point group was O5H-FM3M. Under optimal conditions, powders produced by SCISR were finer and more narrowly distributed than that by Stirred Tank Reactor (STR).     

Representation and reconstruction of polygons and polyhedra using Hierarchical Extended Gaussian Images

In this paper, two new representation schemes called the Branched Gaussian Image (BGI) and the Hierarchical Extended Gaussian Image (HEGI) are proposed. They can be used for uniquely representing both concave and convex, two-dimensional figures and three-dimensional objects. The representation by the Branched Gaussian Image involves several Gaussian spheres connected by branches where the traversing directions might be different. Examples showing how the use of the BGI enables us to achieve the mapping and inverse mapping of concave polygons and polyhedra uniquely are presented. The Gaussian spheres in the BGI can be organized into a tree-like hierarchical structure known as the Hierarchical Extended Gaussian Image. A general procedure for mapping a polygon or polyhedron to its HEGI representation is described. An approach for reconstructing concave polygons from Branched Gaussian Images is presented. The reconstruction of a concave polyhedron from its Hierarchical Extended Gaussian Images by using an iterative method or a closed-form method for each convex component is also described.     

含油废水处理

在水量水质调查的基础上，本文提出了以出水回用为目的的含油废水隔油调节沉淀－混凝沉淀－砂滤处理工艺，动态模型试验表明，废水中油和ＣＯＤ的去除率分别达到９５％和９０％，出水浊度低于２，此水质完全可回用于有关生产车间。     

IBM—PC系列机中的定时功能

本文介绍 IBM-PC 系列机中的定时信息。进而介绍利用这些信息实现各类长、短定时间隔的编程技巧,并以实例说明之。     

I．O．T．旧梦成真

该文较详细地介绍了Ｉ．Ｏ．Ｔ管的发展历程，其特点及工作方式。     

Study on phase behavior–impact strength relationship of unsaturated polyester/polyurethane hybrid polymer network

The phase behavior of a hybrid polymer network (HPN) composed of poly[(propylene glycol maleate)-co-(propylene glycol phthalate)] crosslinked with styrene and polyester–urethane crosslinked with methylene-bis-ortho-chloroaniline was examined. The correlation between phase separation and impact strength of the HPNs is discussed. The composition of HPNs has an effect on their properties.     

Real-time homogenous translucent material editing

This paper presents a novel method for real-time homogenous translucent material editing under fixed illumination. We consider the complete analytic BSSRDF model proposed by Jensen et al. [ [JMLH01] ], including both multiple scattering and single scattering. Our method allows the user to adjust the analytic parameters of BSSRDF and provides high-quality, real-time rendering feedback. Inspired by recently developed Precomputed Radiance Transfer (PRT) techniques, we approximate both the multiple scattering diffuse reflectance function and the single scattering exponential attenuation function in the analytic model using basis functions, so that re-computing the outgoing radiance at each vertex as parameters change reduces to simple dot products. In addition, using a non-uniform piecewise polynomial basis, we are able to achieve smaller approximation error than using bases adopted in previous PRT-based works, such as spherical harmonics and wavelets. Using hardware acceleration, we demonstrate that our system generates images comparable to [ [JMLH01] ]at real-time frame-rates.