Charge source and the charging mechanism of the contact electrification of polymer powder

The charge sources, as well as the charging mechanism of the contact electrification (CE) of polymers, are still debatable. Since CE is accompanied by destruction, it is considered that “hard contacting” via ball milling can induce covalent bond scission and produce naked-activated-charge sources. Regarding “soft contacting” via nano-scale sliding, which does not induce covalent bond scission, a frontier-electron, “f-electron,” of the naked-activated-charge source is crucial to electron transfer among the naked-activated-charge sources. Here, we configure naked-activated-charge-source models, naked-activated-mechano-anion, and naked-activated-mechano-cation, which are produced by mechanical energy induced heterogeneous covalent bond scission, as well as naked-activated-mechano-radicals that are produced by homogeneous covalent bond scission. Regarding “soft contacting” among naked-activated-charge sources in a vacuum, f-electron can be transferred from a donor to an acceptor if the energy level of the donor is higher than that of the acceptor. The net amount of the normalized transferred-f-electrons is obtained by adopting settings in which the average energy level of the naked-activated-charge sources (as the donors) is higher than that of the sources employed as acceptors. Thus, the surfaces comprising the donors and acceptors will exhibit positive and negative net surface charges, respectively. We conclude that net surface charges depend on the average energy level of naked-activated-charge sources. Further, we observe that the alignment of polyethylene (PE)-polyvinyl chloride (PVC)-polytetrafluoroethylene (PTFE) to the average energy level is identical to that of the triboelectric series.     

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.     

An improved feedrate scheduling method for NURBS interpolation in five-axis machining

Five-axis machining plays an important role in manufacturing by dint of its high efficiency and accuracy. While two rotation axes benefit the flexibility of machining, it also brings limitations and challenges. In order to further balance machining precision and efficiency, an improved feedrate scheduling method is presented considering geometric error and kinematic constraints for the Non Uniform Rational B-Spline (NURBS) interpolation in five-axis machining. A simplification method is proposed to calculate the geometric error which describes the deviation between the ideal tool path and the real tool path induced by the non-linear movement. A linear relation between geometric error and feedrate is built to limit the feedrate. The constraints determined by single axis kinematic performance and tangential kinematic performance are also considered. Under these constraints, a constrained feedrate profile is determined. Aiming to get more constant feedrate in the difficult-to-machine areas, this work proposes a scheduling method which combines morphological filtering and S-shape acceleration/deceleration (acc/dec) mode. Simulations and experiments are performed to compare the proposed feedrate scheduling method with two previous feedrate scheduling method and the results prove that the proposed feedrate scheduling method is reliable and effective.     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

尿素装置液位仪表失真分析及处理

介绍了尿素装置中3起液位仪表失真案例,分析了故障现象和设备工况,确定失真原因,采取了相应的处理措施,解决了仪表故障。     

基于组合双向拍卖的云资源调度方法

针对跨数据中心的资源调度问题，提出了一种基于组合双向拍卖（PCDA）的资源调度方案。首先，将云资源拍卖分为三个部分：云用户代理报价、云资源提供商要价、拍卖代理组织拍卖；其次，在定义用户的优先级及任务紧迫度的基础上，在拍卖过程中估算每一个工作发生的服务等级协议（SLA）违规并以此计算云提供商的收益，同时每轮竞拍允许成交多项交易；最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率，与传统一次拍卖成交一项的组合双向拍卖方案相比，PCDA在竞拍时间段产生的能耗降低了35.00%，拍卖云提供商的利润提高了约38.84%。     

Supply chain planning and scheduling integration using Lagrangian decomposition in a knowledge management environment

The integration of planning and scheduling decisions in rigorous mathematical models usually results in large scale problems. In order to tackle the problem complexity, decomposition techniques based on duality and information flows between a master and a set of subproblems are widely applied. In this sense, ontologies improve information sharing and communication in enterprises and can even represent holistic mathematical models facilitating the use of analytic tools and providing higher flexibility for model building. In this work, we exploit this ontologies’ capability to address the optimal integration of planning and scheduling using a Lagrangian decomposition approach. Scheduling/planning sub-problems are created for each facility/supply chain entity and their dual solution information is shared by means of the ontological framework. Two case studies based on a STN representation of supply chain planning and scheduling models are presented to emphasize the advantages and limitations of the proposed approach.     

综采放顶煤工作面高位巷抽采关键技术研究

为了保证九里山矿1508工作面采空区瓦斯治理效果，通过现场数据测定、实验考察和理论分析，研究了推进度、抽采负压、抽采管网等高位巷抽采关键参数。研究结果表明，工作面煤层越厚、推进度越快，瓦斯涌出量越大；孔抽期间理想抽采负压为25～30 kPa、巷抽期间理想抽采负压为5～10 kPa，高位巷并联支路及管路阻力会影响高位巷的抽采效果。     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.     

黄浦江下游吴淞口站低潮位重现期研究

黄浦江为感潮河流,低潮位重现期的确定对黄浦江航道的设计具有重要意义。为了准确估计黄浦江低潮位的重现期,以黄浦江下游吴淞口站年最低潮位序列为例,在对样本进行三性审查的基础上,分别采用传统的数理统计方法和时变矩方法进行水文频率分析。结果表明:吴淞口站年最低潮位序列在1996年发生了变异;还现修正后的序列服从位置参数线性时变的GEV模型,低潮位存在缓慢的上升趋势;一致性条件下百年一遇低潮位约为0.261 m,在非一致性条件下其重现期增大为150 a。非一致性条件下的重现期增大说明黄浦江现有的航道设计标准偏安全,航道通航保证率提高。