An Evaluation of the Crosier's CUSUM Control Chart with Estimated Parameters

We evaluate the performance of the Crosier's cumulative sum (C‐CUSUM) control chart when the probability distribution parameters of the underlying quality characteristic are estimated from Phase I data. Because the average run length (ARL) under estimated parameters is a random variable, we study the estimation effect on the chart performance in terms of the expected value of the average run length (AARL) and the standard deviation of the average run length (SDARL). Previous evaluations of this control chart were conducted while assuming known process parameters. Using the Markov chain and simulation approaches, we evaluate the in‐control performance of the chart and provide some quantiles for its in‐control ARL distribution under estimated parameters. We also compare the performance of the C‐CUSUM chart to that of the ordinary CUSUM (O‐CUSUM) chart when the process parameters are unknown. Our results show that large number of Phase I samples are required to achieve a quite reasonable performance. Additionally, the performance of the C‐CUSUM chart is found to be superior to that of the O‐CUSUM chart. Finally, we recommend the use of a recently proposed bootstrap procedure in designing the C‐CUSUM chart to guarantee, at a certain probability, that the in‐control ARL will be of at least the desired value using the available amount of Phase I data. Copyright © 2015 John Wiley & Sons, Ltd.     

Detecting Periods of Significant Increased Communication Levels for Subgroups of Targeted Individuals

This paper investigates detecting significant increases in communication patterns and levels between small groups of individuals within a moderate‐size targeted group. Potential applications range from trying to establish emerging thought leaders within an organisation to the detection of the planning stages of a crime. The scan statistic is a popular choice for monitoring and detecting spatio‐temporal outbreaks, but it is difficult to apply to large‐scale target groups because of the computational effort required. When monitoring communication levels between thousands of people, the number of combinations of people whose communication may have increased is very high, and to scan through all of these to find which combinations have increased communications significantly is an enormous task. A successful surveillance plan will have early communication outbreak detection properties and good diagnostic capabilities for identifying individuals contributing to this outbreak. This paper proposes a new computationally feasible approach for detecting communication outbreaks based on exponentially weighted moving average smoothed communication counts between individuals within the network. We apply a cumulative sum of ordered signal‐to‐noise (SN) ratios for communication counts to flag significant departures from their respective median values. This plan is demonstrated to be efficient at detecting changes in communication levels for a small part of the network and diagnosing who is involved in the outbreak. Copyright © 2015 John Wiley & Sons, Ltd.     

Correction on link relative based approach to CUSUM chart

Link relative-based approach was used in an article (see reference 1) to enhance the performance of the cumulative sum (CUSUM) control chart. This technique involves the use of firstly, the link relative variable to convert the process observations in a relative to the mean form and secondly, optimal constants to define a new variable which is used as the plotting statistic of the link relative CUSUM chart. In this article, it is proven through simulation study that the optimal constants with fixed values, as reported in the aforementioned article, give different results. Instead, if the regression technique is used, then the same results will be obtained.     

Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval

We describe an implementation of a parallel document clustering scheme based on latent semantic indexing, which uses singular value decomposition. Given a set of documents, the clustering algorithm is dynamic in the sense that it automatically infers the number of clusters to be output. The parallel version has been implemented on a LAN and on a dual‐core system. Experimental evaluation of the algorithm shows an average speed‐up of 6.22 for the LAN implementation and an average speed‐up of 3.71 for the dual‐core implementation, while still maintaining a precision and recall in the range [0.85, 1]. To put these implementations in the context of information retrieval, we use the parallel clustering algorithm and develop a document similarity search system. The similarity search system shows good performance in terms of precision and recall. Copyright © 2010 John Wiley & Sons, Ltd.     

基于综合匹配的鸟类视频中运动物体的检测

鄱阳湖是中国最大的湿地。每年秋末冬初,会有成千上万只候鸟来此越冬,该地区的自然生态系统和这些鸟类的活动有着密切的联系,因此,研究该地区的鸟类是了解该地生态系统的一个重要方式。本文采用帧间差分法对该地所拍摄鸟类视频数据进行运动物体检测。由于视频在获取过程中存在摄像机的移动,所以在处理过程中首先需要估计背景的运动并加以补偿。背景运动的估计是在常用的块匹配方法的基础上作了一定的改进,通过多个匹配块的匹配结果来计算运动矢量。为提高正确率,块的匹配在差分图像上进行。最后,利用在鄱阳湖录取的视频对本文所述方法进行了实验,实验结果表明本文所述方法对背景的去除和运动物体的检测的有效性。     

On Bézier surfaces in three-dimensional Minkowski space

In this paper, we study Bézier surfaces in three-dimensional Minkowski space. In particular, we focus on timelike and spacelike cases for Bézier surfaces. We also deal with the Plateau–Bézier problem in , obtaining conditions over the control net to be extremal of the Dirichlet function for both timelike and spacelike Bézier surfaces. Moreover, we provide interesting examples showing the behavior of the Plateau–Bézier problem in and illustrating the relationship between it and the corresponding Plateau–Bézier problem in the Euclidean space R³.     

Control design for discrete‐time bilinear systems using the scalarized Schur complement

In this paper, controller design for discrete‐time bilinear systems is investigated by using sum of squares programming methods and quadratic Lyapunov functions. The class of rational polynomial controllers is considered, and necessary conditions on the degree of controller polynomials for quadratic stability are derived. Next, a scalarized version of the Schur complement is proposed. For controller design, the Lyapunov difference inequality is converted to a sum of squares problem, and an optimization problem is proposed to design a controller, which maximizes the region of quadratic stability of the bilinear system. Input constraints can also be accounted for. Copyright © 2017 John Wiley & Sons, Ltd.     

基于快速模板匹配的智能视觉传感器设计*

针对传统视觉传感器信号处理能力差、模拟信号输出易受干扰等问题,设计了基于ARM 6410处理器的智能化数字视觉传感器,应用于白车身在线视觉检测系统,完成数据采集、像素级二维定位和通讯控制工作。在Linux平台上,研究了一种快速稳定的像素级模板匹配算法,以去均值归一化灰度互相关法为相似性测度,多分辨率金字塔匹配法为搜索策略,使用“滚动相加补全像素法冶的二维求和新方法来优化计算过程,并进行了全局冗错设计,确保传感器工作稳定性。现场实验表明：采用该匹配算法和冗错机制使得视觉传感器定位功能速度快、精度高、鲁棒性好,能较好完成白车身视觉检测系统前端数据采集和处理任务。     

The Search of Equilibrium Strategies for Controlled Boundary Value Problem

The present paper is focused on the finite‐time differential game of m players with nonzero sum. The principal difference from regular cases consists in the fact that the states of players are subordinated to boundary value system of ordinary differential equations (rather than the initial value system). By the end of the game we understand the equilibrium situation and our purpose is to design a well‐founded suitable method for the equilibrium control search.