Analysis of operating limits and combustion state regulation for low-calorific value gases in industrial burners

The effective and efficient utilization of low-calorific value (LCV) gases has gained increasing attention in scientific research and industrial fields. In this study, the combustion characteristics of three LCV gases in practical devices are analyzed by using a nonadiabatic perfectly stirred reactor model. The complete steady-state solution in the temperature-residence time parameter space is obtained with arc-length continuation. The stable operation region is quantified by the eigenvalue analysis. The transition of solution curves is quantified with heat loss coefficient. Five key system parameters are systematically investigated on their effects on stability limits. With the combustion performance being quantified by a combustion state index, a combustion state regulation method is proposed to find the optimal regulation path of system parameters. Active subspace method is further applied to shorten the regulation step by identifying the active direction. The proposed method and findings are useful for optimal regulation of burning LCV gases in industrial burners.     

Adaptive GLR-, Rao- and Wald-based CFAR detectors for a subspace signal embedded in structured Gaussian interference

The problem of detecting a subspace signal embedded in subspace Gaussian interference and thermal noise is studied in this paper. In this problem, both the signal-independent and signal-dependent interferences are assumed to be present, therefore the overall interference subspace covers the signal subspace. The approach of this paper extends previous works involving either of those two kinds of interferences. A set of secondary data containing only interference plus noise is employed to estimate the interference covariance matrix and the noise power. Three new detectors are designed via the generalized likelihood ratio (GLR), Rao and Wald tests, respectively. Their probabilities of false alarms (PFAs) and detections are analytically derived. The PFAs show that the new detectors have the constant false alarm rate (CFAR) property against the interference and noise. Numerical results show that the new detectors outperform their counterparts for the studied problem. Furthermore, the new detectors are less sensitive to the secondary data size and to the mismatched subspace signal than some other detectors, such as the GLR detector (GLRD), the adaptive matched filter (AMF), the adaptive subspace detector (ASD), etc.     

An iterative method for suboptimal control of linear time-delayed systems

This article presents a new approach for solving the Optimal Control Problem (OCP) of linear time-delay systems with a quadratic cost functional. The proposed method can also be used for designing optimal control time-delay systems with disturbance. In this study, the Variational Iteration Method (VIM) is employed to convert the original Time-Delay Optimal Control Problem (TDOCP) into a sequence of nonhomogeneous linear two-point boundary value problems (TPBVPs). The optimal control law obtained consists of an accurate linear feedback term and a nonlinear compensation term which is the limit of an adjoint vector sequence. The feedback term is determined by solving Riccati matrix differential equation. By using the finite-step iteration of a nonlinear compensation sequence, we can obtain a suboptimal control law. Finally, Illustrative examples are included to demonstrate the validity and applicability of the technique.     

应用金属迭片挠性联轴器改造D1000-32型风机

使用液力偶合器因故障频繁，对高炉稳产、高产造成严重威胁，而且维修费用较高，对偶合器改造后，应用金属迭片挠性联轴器其故障率、维修费用都很低。     

MC-CDMA系统迭代检测中的一种信道估计算法

在DS—CDMA系统中，联合译码的迭代多用户检测是克服多址干扰增加系统容量的有效方法。本文将多用户检测和译码相结合的迭代检测技术应用于MC—CDMA系统，其中，多用户检测器由串行干扰消除和其后的MMSE滤波器组成。文中提出一种时域信道估计作为迭代初始值的频域信道估计算法，比单纯的频域信道估计方法节约导频符号数量，并且由于信道估计性能的改善，加快了迭代检测的收敛速度。     

求非线性方程近似解的逐次迭代法

本文提出了求解非线性问题的一种新方法——逐次迭代法，本方法先是给出一个初始近似解，然后将这个近似解进行校正迭代，使之接近于真实解，把一个非线性问题转化为一个线性问题来解决。     

A feasibility study of a direct-mapping parallel processing method to solve linear equations in load-flow calculation

With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.     

一种全局优化的多面体凸分解匹配方法

提出了一种全局优化的多面体匹配方法，该方法对物体的拓扑关系和结构关系进行多级匹配,利用全局优化的松驰迭代方法减少匹配误差，并由匹配的一致性准则进行匹配结果的检测，根据物体的内在特征来进行匹配，从而解决非同构物体的匹配.可广泛应用于物体识别、三维物体重建、医学图象处理等领域，实验证明此方法质量好、自动化程度高，是一种有效的全局优化结构匹配方法．     

集团变分法(CVM)及其在合金相图计算中的应用

介绍了集团变分法的集团概率变量、配置熵等统计分析的理论基础及Helmholtz自由能的描述模型.提出了巨势及相对化学势的几何分析理论.讨论了应用集团变分法和巨势分析理论进行相平衡计算的过程,并分析了同结构平衡相图计算的若干实例.     

A time aggregation approach to Markov decision processes

We propose a time aggregation approach for the solution of infinite horizon average cost Markov decision processes via policy iteration. In this approach, policy update is only carried out when the process visits a subset of the state space. As in state aggregation, this approach leads to a reduced state space, which may lead to a substantial reduction in computational and storage requirements, especially for problems with certain structural properties. However, in contrast to state aggregation, which generally results in an approximate model due to the loss of Markov property, time aggregation suffers no loss of accuracy, because the Markov property is preserved. Single sample path-based estimation algorithms are developed that allow the time aggregation approach to be implemented on-line for practical systems. Some numerical and simulation examples are presented to illustrate the ideas and potential computational savings.