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个方面展开阐述，旨在提高学生学习积极性和能力。     

Automatic generation of variants depending on changes of product properties in a flexible manufacturing environment

Competition forces manufacturing systems to be flexible and to increase product variety and process complexity. These tasks depend on the flexible design of a bill of materials (BOM), one of the most important inputs in manufacturing planning and control systems. Product variety forces systems to generate BOMs with regard to product properties through a BOM pattern. A variant bill of materials provides a structure to manage product variability. In this study, an algorithm is designed to build a BOM pattern using computer-aided design and computer-aided manufacturing (CAD/CAM) data, and another algorithm is designed to generate variants with regard to product specifications. Genetic algorithm is used to generate new products to provide high product variability for testing algorithms. After the test, both algorithms are applied to a real industry problem. The BOM pattern is built automatically using CAD/CAM data, and variants are generated with regard to the pattern, and the results are discussed.     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes

This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances.     

Event-triggered variable horizon Supervisory Predictive control of hybrid power plants

The supervision of a hybrid power plant, including solar panels, a gas microturbine and a storage unit operating under varying solar power profiles is considered. The Economic Supervisory Predictive controller assigns the power references to the controlled subsystems of the hybrid cell using a financial criterion. A prediction of the renewable sources power is embedded into the supervisor. Results deteriorate when the solar power is unsteady, owing to the inaccuracy of the predictions for a long-range horizon of 10 s. The receding horizon is switched between an upper and a lower value according to the amplitude of the solar power trend. Theoretical results show the relevance of horizon switching, according to a tradeoff between performance and prediction accuracy. Experimental results, obtained in a Hardware In the Loop (HIL) framework, show the relevance of the variable horizon approach. Power amplifiers allow us to simulate virtual components, such as a gas microturbine, and to blend their powers with that of real devices (storage unit, real solar panels). In this case, fuel savings, reaching 15%, obtained under unsteady operating conditions lead to a better overall performance of the hybrid cell. The overall savings obtained in the experiments amount to 12%.     

Annual and regional variations of aflatoxin B1 levels seen in grains and feed coming from Croatian dairy farms over a 5-year period

The aim of the study was to investigate annual and regional differences in the level of aflatoxin B₁ (AFB₁) in grains and dairy cattle feed. Maize (n = 972), wheat (n = 201), barley (n = 147), oat (n = 136), grain mixtures (n = 168), and dairy cattle feed (n = 325) were sampled from 2009 to 2013 on different farms and in different farm factories situated in four Croatian regions. The samples were analysed for AFB₁ using the validated ELISA immunoassay. AFB₁ was determined in 16.4% of all investigated samples, among which maize was proven to be the most contaminated, with 21.7% of the samples recovered during 2013 harbouring AFB₁ in concentrations over the permissible ones. Levels higher than permitted were observed in 17.9% and 12.3% of grain mixtures and dairy cattle feed, respectively, whereas concentrations of AFB₁ determined in other crops throughout the investigated period met the stipulated requirements. The results revealed the AFB₁ occurrence to be significantly (p < 0.05) dependent on the cultivation region, with the highest levels generally found in maize harvested in 2013 and consequently in grain mixtures and cattle feed that can most likely be associated with climatic conditions as the most critical factor for mould formation, and thus also AFB₁ production.     

仙游抽水蓄能电站尾水系统充排水试验

为检查工程质量,查找输水系统可能存在的问题并消除隐患,保障电站安全运行,福建仙游抽水蓄能电站在投产发电前,要对输水发电系统进行充水试验与放空排水试验,在试验过程中监测输水系统的应力、应变与渗漏水情况。本文以尾水系统为例,介绍了试验所应具备的工程条件、工作程序及技术要求、试验成果分析和存在问题处理等。试验表明,仙游抽水蓄能电站尾水系统设计合理,施工质量优良,结构可靠,可供同类工程参考与借鉴。     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.