A hybrid homogeneously weighted moving average control chart for process monitoring

Several modifications and enhancements to control charts in increasing the performance of small and moderate process shifts have been introduced in the quality control charting techniques. In this paper, a new hybrid control chart for monitoring process location is proposed by combining two homogeneously weighted moving average (HWMA) control charts. The hybrid homogeneously weighted moving average (HHWMA) statistic is derived using two smoothing constants λ₁ and λ₂ . The average run length (ARL) and the standard deviation of the run length (SDRL) values of the HHWMA control chart are obtained and compared with some existing control charts for monitoring small and moderate shifts in the process location. The results of study show that the HHWMA control chart outperforms the existing control charts in many situations. The application of the HHWMA chart is demonstrated using a simulated data.     

Simultaneous process optimization and heat integration based on rigorous process simulations

This paper introduces a simultaneous process optimization and heat integration approach, which can be used directly with the rigorous models in process simulators. In this approach, the overall process is optimized utilizing external derivative-free optimizers, which interact directly with the process simulation. The heat integration subproblem is formulated as an LP model and solved simultaneously during optimization of the flowsheet to update the minimum utility and heat exchanger area targets. A piecewise linear approximation for the composite curve is applied to obtain more accurate heat integration results. This paper describes the application of this simultaneous approach for three cases: a recycle process, a separation process and a power plant with carbon capture. Case study results indicate that this simultaneous approach is relatively easy to implement and achieves higher profit and lower operating cost and, in the case of the power plant example, higher net efficiency than the sequential approach.     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.     

Thermal imaging of time-varying longitudinal defects in the internal coating of a tube

We deal with the mathematical model of the incremental degradation of the internal coating (e.g. a polymeric material) of a metallic pipe in which a fluid flows relatively fast. The fluid drags solid impurities so that longitudinal scratches, inaccessible to any direct inspection procedure, are produced on the coating. Time evolution of this kind of defects can be reconstructed from the knowledge of a sequence of temperature maps of the external surface. The time-varying orthogonal section of this damaged interface is determined as a function of time and polar angle through the identification of a suitable effective heat transfer coefficient by means of Thin Plate Approximation.     

基于时空的弱点状运动目标检测技术

如何在复杂背景下持续有效地检测目标位置,一直是研究者们需要面对的主要挑战。本文在研究红外点状移动目标特征的基础上,根据目标无纹理,无形状的特性,提出一种改进的形态学目标增强算法,并利用目标连续时空不变性检测目标。首先,建立多尺度的图像金字塔,在每层上采用改进的形态学算法快速、粗糙定位小目标。然后进一步的根据目标在时空上的位置相关性,提出基于目标运动特征分析的精确检测方法。得到精确稳定的检测结果。最后实验结果表明与经典的形态学检测算法及其他算法相比,该技术能更有效地检测弱小目标,具有更高的鲁棒性。     

LTE系统多小区上行联合功控算法

针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标，忽略了当前小区用户对邻小区用户同频干扰的问题，为提升边缘用户性能的同时兼顾系统整体性能，提出了一种LTE系统小区间上行联合功率控制（UJPC）算法。该算法采用单基站三扇区为系统模型，以最优化系统吞吐量比例公平函数为目标，首先根据最小信干噪比（SINR）约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型，然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明，与基准的开环功控方案相比，联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率，其最佳性能增益能达到50%。     

Effect of Moving Speed of Charged Metallic Spherical Electrode on Electrostatic Discharge

In this investigation, the nature of the electrostatic discharge (ESD) that occurs when a charged object moves toward a stationary grounded object is experimentally clarified. The spark lengths, discharge currents, and induced voltages in a magnetic probe were measured when a charged metallic spherical electrode connected to a 422 pF capacitor approached a stationary grounded object, which was the current target, for different moving speeds of the charged metallic spherical electrode in a range of 1 mm/s to 100 mm/s. The charge voltages of the capacitor were +6.5 kV and +10 kV. Based on the results, the average gap length shortened with the speed of the spherical electrode. The average peak values of the discharge current and the induced voltage were likely to increase with the speed of the spherical electrode. The average rise times of the discharge current and the induced voltage were likely to drop with the speed of the spherical electrode. The relation between the spark length and the discharge current due to the ESD can be explained qualitatively by using an equation derived from the spark resistance formula proposed by Rompe and Weizel.     

国有科研单位人才流失原因分析及对策

近年来,国有科研单位,尤其是地处经济不发达地区的国有科研单位,出现了较为严重的人才流失现象,一定程度上影响和制约了国有科研单位的发展。通过对国有科研单位人才流失原因的分析,提出了相应的对策。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.