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

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

基于K-means和SOM的水下传感器数据采集方法

随着海洋资源勘探和海洋污染物监控工作的开展，水文数据的监测和采集等已经成为重要的研究方向。其中，水下无线传感器网络在水文数据采集过程中起着举足轻重的作用。本文研究的是水下无线传感器二维监测网络模型中，传感器节点数据采集的问题，其设计方法是通过自组织映射（Self-organizing mapping，SOM）对传感器节点进行路径最优化处理，结合优化的路径图形和K-means算法找到路径内部聚合点，利用聚合点和传感器的节点得到传感器通信半径内的数据采集点，最后通过SOM得到水下机器人（Autonomous underwater vehicle，AUV）到各个数据采集点采集数据的最优路径。经过实验验证，在水下1 200 m×1 750 m范围内布置52个传感器节点的情景下，数据采集点相比于传感器节点路径规划采用相同的采集顺序得到的路径优化了6.7%；对数据采集点重新进行自组织路径规划得到的路径比传感器结点路径的最优解提高了12.2%。增加传感器节点的数量，其结果也大致相同，因此采用该方法可以提高水下机器人采集数据的效率。     

Prediction of mode I fracture toughness of rock using linear multiple regression and gene expression programming

Prediction of mode I fracture toughness (K_IC) of rock is of significant importance in rock engineering analyses. In this study, linear multiple regression (LMR) and gene expression programming (GEP) methods were used to provide a reliable relationship to determine mode I fracture toughness of rock. The presented model was developed based on 60 datasets taken from the previous literature. To predict fracture parameters, three mechanical parameters of rock mass including uniaxial compressive strength (UCS), Brazilian tensile strength (BTS), and elastic modulus (E) have been selected as the input parameters. A cluster of data was collected and divided into two random groups of training and testing datasets. Then, different statistical linear and artificial intelligence based nonlinear analyses were conducted on the training data to provide a reliable prediction model of K_IC. These two predictive methods were then evaluated based on the testing data. To evaluate the efficiency of the proposed models for predicting the mode I fracture toughness of rock, various statistical indices including coefficient of determination (R²), root mean square error (RMSE), and mean absolute error (MAE) were utilized herein. In the case of testing datasets, the values of R², RMSE, and MAE for the GEP model were 0.87, 0.188, and 0.156, respectively, while they were 0.74, 0.473, and 0.223, respectively, for the LMR model. The results indicated that the selected GEP model delivered superior performance with a higher R² value and lower errors.     

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.     

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

高素质人才培养是我国可持续发展战略、科教兴国战略以及人才强国战略等多项发展战略的一项基础性工程。本文针对中医药类院校程序设计类课程实践教学模式单一等教学实际，以“学科竞赛”为平台，“赛教结合”为理念，以《C语言程序设计》为例，从现存问题、赛教结合模式的引入、建立实施及其评价机制4个方面展开阐述，旨在提高学生学习积极性和能力。     

Theoretical framework for formulating MIP scheduling models with multiple and non-uniform discrete-time grids

We present a framework for the formulation of MIP scheduling models based on multiple and nonuniform discrete time grids. In a previous work we showed that it is possible to use different (possibly non-uniform) time grids for each task, unit, and material. Here, we generalize these ideas to account for general resources, and a range of processing characteristics such as limited intermediate storage and changeovers. Each resource has its own grid based on resource consumption and availability allowing resource constraints to be modeled more accurately without increasing the number of binary variables. We develop algorithms to define the unit-, task-, material-, and resource-specific grids directly from problem data. Importantly, we prove that the multi-grid formulation is able to find a schedule with the same optimal objective as the discrete-time single-grid model with an arbitrarily fine grid. The proposed framework leads to the formulation of models with reduced number of binary variables and constraints, which are able to find good solutions faster than existing models.     

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.     

基于Stateflow电力机车变流器控制设计与实现

某出口型号交流电力机车牵引控制系统要求变流器控制逻辑具备接触器控制、牵引系统数据交互、变流器故障保护、变流器启动自检等功能。针对以上功能,基于MATLAB中的Simulink/Stateflow可视化编程工具进行牵引控制模型的搭建,遵循模块化编程理念,采用较少的程序代码编写实现复杂的逻辑控制模型,生成逻辑清晰的控制功能流程图,进行半实物仿真测试,增强控制模型的可靠性。通过该变流器产品型式试验检验,验证变流器控制逻辑的功能可以满足控制系统的需求。     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.