基于滚动摩擦作用下玉米颗粒在模拟筒仓卸料中的力链分析（网络首发、推荐阅读）

针对颗粒滚动摩擦作用对筒仓中玉米颗粒的力链空间分布进行研究，通过EDEM离散元软件建立筒仓模型与仿真玉米颗粒模型进行卸粮仿真模拟，并与筒仓卸料实验作流态对比，验证模型与仿真结果的准确性。通过对模拟仓进行切片观察和数据处理，对比分析了不同摩擦情况下力链的细观参数随时间演化规律。模拟结果表明：颗粒间摩擦系数越大，卸粮完成的最终时间越长；颗粒间滚动摩擦系数越小，颗粒由整体流转变为管状流的时间越早。对于有漏斗的筒仓来说，减小颗粒间摩擦会改变整体流和管状流之间的极限，从而增加产生管状流的面积。标准滚动摩擦系数下玉米颗粒在卸料过程中会出现起拱-塌陷效应；减小滚动摩擦，玉米颗粒卸料较稳定，未出现起拱的应力突增、以及拱塌陷的应力衰减；增大颗粒间滚动摩擦不但会增加拱效应，且出现成拱高度距离漏斗口更高。     

Farmers' preferences for adopting on-farm concentration of raw milk: Results from a discrete choice experiment in Germany

Milk concentrates are used in the manufacturing of dairy products such as yogurt and cheese or are processed into milk powder. Processes for the nonthermal separation of water and valuable milk ingredients are becoming increasingly widespread at farm level. The technical barriers to using farm-manufactured milk concentrate in dairies are minimal, hence the suspicion that the practice of on-farm raw milk concentration is still fairly uncommon for economic reasons. This study, therefore, set out to investigate farmers' potential willingness to adopt a raw milk concentration plant. The empirical analysis was based on discrete choice experiments with 75 German dairy farmers to identify preferences and the possible adoption of on-farm raw milk concentration. The results showed that, in particular, farmers who deemed the current milk price to be insufficient viewed on-farm concentration using membrane technology as an option for diversifying their milk sales. We found no indication that adoption would be impeded by a lack of trustworthy information on milk processing technologies or capital.     

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.     

Time reversibility of the discrete element method

An algorithm is presented for discrete element method simulations of energy-conserving systems of frictionless, spherical particles in a reversed-time frame. This algorithm is verified, within the limits of round-off error, through implementation in the LAMMPS code. Mechanisms for energy dissipation such as interparticle friction, damping, rotational resistance, particle crushing, or bond breakage cannot be incorporated into this algorithm without causing time irreversibility. This theoretical development is applied to critical-state soil mechanics as an exemplar. It is shown that the convergence of soil samples, which differ only in terms of their initial void ratio, to the same critical state requires the presence of shear forces and frictional dissipation within the soil system.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

Teaching and Learning Electrochemistry

Numerous conceptual difficulties and misconceptions have been reported in the science and chemistry education literature about electrochemistry concepts such as electrolytes, redox equations, and about electrochemical (galvanic and electrolytic) cells. Other studies have considered teaching approaches aimed at improving learning and at overcoming misconceptions. This paper reviews these studies and considers strategies and approaches for the effective teaching of electrochemistry. Then, the review focuses on problem solving in equilibrium electrochemistry, especially problems involving the Nernst equation. The main findings of four studies with Greek university chemistry students, dealing with: (i) algorithmic problem‐solving ability; (ii) practice on problem solving; (iii) the effect of the format of a problem; and (iv) the construction and evaluation of a website devoted to electrochemistry problem solving, are reported.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Adaptive backstepping repetitive learning control design for nonlinear discrete‐time systems with periodic uncertainties

This paper addresses a tracking problem for uncertain nonlinear discrete‐time systems in which the uncertainties, including parametric uncertainty and external disturbance, are periodic with known periodicity. Repetitive learning control (RLC) is an effective tool to deal with periodic unknown components. By using the backstepping procedures, an adaptive RLC law with periodic parameter estimation is designed. The overparameterization problem is overcome by postponing the parameter estimation to the last backstepping step, which could not be easily solved in robust adaptive control. It is shown that the proposed adaptive RLC law without overparameterization can guarantee the perfect tracking and boundedness of the states of the whole closed‐loop systems in presence of periodic uncertainties. In addition, the effectiveness of the developed controller is demonstrated by an implementation example on a single‐link flexible‐joint robot. Copyright © 2014 John Wiley & Sons, Ltd.     

中子平衡节块离散纵标法及CMFD加速技术研究

本文基于横向积分离散纵标方程,解析得到横向积分通量中出射通量与入射通量的关系,并根据类似于扩散方程节块展开法的输运节块中子平衡方程形式,得到了一种高效的节块离散纵标法数值迭代策略。数值结果表明,本文提出的方法可行且数值结果正确。此外,粗网有限差分(CMFD)加速技术在节块离散纵标法中也取得了非常好的应用效果。