A hybrid homogeneously weighted moving average control chart for process monitoring: Discussion

The sensitivity of a monitoring scheme depends on many factors including the variance of the charting statistic which is very important in the computation of the control limits. This paper discusses the computation of the variance of the recently proposed hybrid homogeneously weighted moving average (HHWMA) $\overline{X}$ scheme which was based on an incorrect assumption. The correct variance is used to evaluate the run-length characteristics of the HHWMA $\overline{X}$ scheme. It is observed that the incorrect variance has a significant impact on the sensitivity (or performance) of the HHWMA $\overline{X}$ scheme.     

基于学科竞赛的中医药类院校程序设计课程教学模式的探索

高素质人才培养是我国可持续发展战略、科教兴国战略以及人才强国战略等多项发展战略的一项基础性工程。本文针对中医药类院校程序设计类课程实践教学模式单一等教学实际，以“学科竞赛”为平台，“赛教结合”为理念，以《C语言程序设计》为例，从现存问题、赛教结合模式的引入、建立实施及其评价机制4个方面展开阐述，旨在提高学生学习积极性和能力。     

云杉八齿小蠹Ips typographus L.虚拟模型构建方法研究

本文以云杉八齿小蠹Ips typographus Linnaeus为例,经标本选取,观察虫体整体形态,绘制整体结构草图,电子显微镜观察局部、得到局部数字图像,分别建立虫体每一部分的高精度细节。把模型每部分拼装在一起组成整体模型,构建出了云杉八齿小蠹三维虚拟昆虫数字化模型。     

Unreliable numbers: error and harm induced by bad design can be reduced by better design

Number entry is a ubiquitous activity and is often performed in safety- and mission-critical procedures, such as healthcare, science, finance, aviation and in many other areas. We show that Monte Carlo methods can quickly and easily compare the reliability of different number entry systems. A surprising finding is that many common, widely used systems are defective, and induce unnecessary human error. We show that Monte Carlo methods enable designers to explore the implications of normal and unexpected operator behaviour, and to design systems to be more resilient to use error. We demonstrate novel designs with improved resilience, implying that the common problems identified and the errors they induce are avoidable.     

Evolutionary collective behavior decomposition model for time series data mining

In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model.     

An experiential account of phantom vibration syndrome

A small handful of recent studies have addressed a phenomenon known as “phantom vibration syndrome”. This refers to when phone users perceive their device to vibrate, indicating that a call or text is incoming, when in fact the phone did not vibrate at all. Though these studies show that most users do not find phantom vibration hallucinations to be very bothersome, they also find that a large majority of users experience this phenomenon. This paper explores what the striking prevalence of phantom vibration syndrome means for our contemporary relationships with technology. I begin with a review of the theories purporting to explain these data, which largely rely on particular understandings of the brain. Next I develop an alternative theory of phantom vibration syndrome based on insights from the philosophical tradition of phenomenology. This account considers the ways users develop bodily and perceptual habits regarding how the phone is understood and used. By critically contrasting these different theories, we can refine our questions about what the high prevalence of phantom vibration syndrome implies about our contemporary technological situation.     

Low complexity quantum private queries protocol

Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.