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

高素质人才培养是我国可持续发展战略、科教兴国战略以及人才强国战略等多项发展战略的一项基础性工程。本文针对中医药类院校程序设计类课程实践教学模式单一等教学实际，以“学科竞赛”为平台，“赛教结合”为理念，以《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.     

Achieving Rich and Active Alkaline Hydrogen Evolution Heterostructures via Interface Engineering on 2D 1T‐MoS2 Quantum Sheets

Large‐scale production of hydrogen from water‐alkali electrolyzers is impeded by the sluggish kinetics of hydrogen evolution reaction (HER) electrocatalysts. The hybridization of an acid‐active HER catalyst with a cocatalyst at the nanoscale helps boost HER kinetics in alkaline media. Here, it is demonstrated that 1T–MoS₂ nanosheet edges (instead of basal planes) decorated by metal hydroxides form highly active ${\text{edge}}_{{\text{1T‐MoS}}_{\text{2}}}$/ ${\text{edge}}_{\text{Ni}{(\text{OH})}_{\text{2}}}$ heterostructures, which significantly enhance HER performance in alkaline media. Featured with rich ${\text{edge}}_{{\text{1T‐MoS}}_{\text{2}}}$/ ${\text{edge}}_{\text{Ni}{(\text{OH})}_{\text{2}}}$ sites, the fabricated 1T–MoS₂ QS/Ni(OH)₂ hybrid (quantum sized 1T–MoS₂ sheets decorated with Ni(OH)₂ via interface engineering) only requires overpotentials of 57 and 112 mV to drive HER current densities of 10 and 100 mA cm^?2, respectively, and has a low Tafel slope of 30 mV dec^?1 in 1 m KOH. So far, this is the best performance for MoS₂‐based electrocatalysts and the 1T–MoS₂ QS/Ni(OH)₂ hybrid is among the best‐performing non‐Pt alkaline HER electrocatalysts known. The HER process is durable for 100 h at current densities up to 500 mA cm^?2. This work not only provides an active, cost‐effective, and robust alkaline HER electrocatalyst, but also demonstrates a design strategy for preparing high‐performance catalysts based on edge‐rich 2D quantum sheets for other catalytic reactions.     

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.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.