基于NR-Transformer的集群作业运行时间预测

高性能集群的作业调度通常使用作业调度系统来实现，准确填写作业运行时间能在很大程度上提升作业调度效率。现有的研究通常使用机器学习的预测方式，在预测精度和实用性上还存在一定的提升空间。为了进一步提高集群作业运行时间预测的准确率，考虑先对集群作业日志进行聚类，将作业类别信息添加到作业特征中，再使用基于注意力机制的NR-Transformer网络对作业日志数据建模和预测。在数据处理上，根据与预测目标的相关性、特征的完整性和数据的有效性，从历史日志数据集中筛选出7维特征，并按作业运行时间的长度将其划分为多个作业集，再对各作业集分别进行训练和预测。实验结果表明，相比于传统机器学习和BP神经网络，时序神经网络结构有更好的预测性能，其中NR-Transformer在各作业集上都有较好的性能。     

Image sequence-based risk behavior detection of power operation inspection personnel

A novel image sequence-based risk behavior detection method to achieve high-precision risk behavior detection for power maintenance personnel is proposed in this paper. In this method, the original image sequence data is first separated from the foreground and background. Then, the free anchor frame detection method is used in the foreground image to detect the personnel and correct their direction. Finally, human posture nodes are extracted from each frame of the image sequence, which are then used to identify the abnormal behavior of the human. Simulation experiment results demonstrate that the proposed algorithm has significant advantages in terms of the accuracy of human posture node detection and risk behavior identification.     

Breeding schemes with optimum-contribution selection or truncation selection for beef cattle destined for use on dairy females

We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective.     

Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review

Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed.     

A charge sharing–based switching scheme for SAR ADCs

This paper presents an energy-efficient switching scheme for successive approximation register (SAR) analogue-to-digital converter (ADC). The proposed scheme employs charge recycling method to keep the capacitor arrays free of transitional energy between bit generations except reset phase. In comparison with the conventional switching scheme, the proposed one achieves 100% transitional energy saving without considering reset phase. In addition, configuration of a 10-bit SAR ADC shows that the proposed switching scheme reduces the capacitor area by 25% compared with the conventional switching scheme.     

Container-based cluster orchestration systems: A taxonomy and future directions

Containers, enabling lightweight environment and performance isolation, fast and flexible deployment, and fine-grained resource sharing, have gained popularity in better application management and deployment in addition to hardware virtualization. They are being widely used by organizations to deploy their increasingly diverse workloads derived from modern-day applications such as web services, big data, and internet of things in either proprietary clusters or private and public cloud data centers. This has led to the emergence of container orchestration platforms, which are designed to manage the deployment of containerized applications in large-scale clusters. These systems are capable of running hundreds of thousands of jobs across thousands of machines. To do so efficiently, they must address several important challenges including scalability, fault tolerance and availability, efficient resource utilization, and request throughput maximization among others. This paper studies these management systems and proposes a taxonomy that identifies different mechanisms that can be used to meet the aforementioned challenges. The proposed classification is then applied to various state-of-the-art systems leading to the identification of open research challenges and gaps in the literature intended as future directions for researchers.     

Couple-based particle swarm optimization for short-term hydrothermal scheduling

A novel couple-based particle swarm optimization (CPSO) is presented in this paper, and applied to solve the short-term hydrothermal scheduling (STHS) problem. In CPSO, three improvements are proposed compared to the canonical particle swarm optimization, aimed at overcoming the premature convergence problem. Dynamic particle couples, a unique sub-group structure in maintaining population diversity, is adopted as the population topology, in which every two particles compose a particle couple randomly in each iteration. Based on this topology, an intersectional learning strategy using the partner learning information of last iteration is employed in every particle couple, which can automatically reveal useful history information and reduce the overly rapid evolution speed. Meanwhile, the coefficients of each particle in a particle couple are set as distinct so that the particle movement patterns can be described and controlled more precisely. In order to demonstrate the effectiveness of our proposed CPSO, the algorithm is firstly tested with four multimodal benchmark functions, and then applied to solve an engineering multimodal problem known as STHS, in which two typical test systems with four different cases are tested, and the results are compared with those of other evolutionary methods published in the literature.     

Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect

This article addresses the no-wait flowshop scheduling problem with simultaneous consideration of common due date assignment, convex resource allocation and learning effect in a two machine setting. The processing time of each job can be controlled by its position in a sequence and also by allocating extra resource, which is a convex function of the amount of a common continuously divisible resource allocated to the job. The objective is to determine the optimal common due date, the resource allocation and the schedule of jobs such that the total earliness, tardiness and common due date cost (the total resource consumption cost) are minimized under the constraint condition that the total resource consumption cost (the total earliness, tardiness and common due date cost) is limited. Polynomial time algorithms are developed for two versions of the problem.     

A Reliable Stochastic Numerical Analysis for Typhoid Fever Incorporating With Protection Against Infection

In this paper, a reliable stochastic numerical analysis for typhoid fever incorporating with protection against infection has been considered. We have compared the solutions of stochastic and deterministic typhoid fever model. It has been shown that the stochastic typhoid fever model is more realistic as compared to the deterministic typhoid fever model. The effect of threshold number T* hold in stochastic typhoid fever model. The proposed framework of the stochastic non-standard finite difference scheme (SNSFD) preserves all dynamical properties like positivity, bounded-ness and dynamical consistency defined by Mickens, R. E. The stochastic numerical simulation of the model showed that increase in protection leads to low disease prevalence in a population.