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

针对颗粒滚动摩擦作用对筒仓中玉米颗粒的力链空间分布进行研究，通过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.     

Exploring design trade-offs for achieving social inclusion in multi-tiered design problems

ABSTRACT

The digital age of the future is ‘not out there to be discovered’, but it needs to be ‘designed’. The design challenge has to address questions about how we want to live, work, and learn (as individuals and as communities) and what we value and appreciate, e.g.: reflecting on quality of life and creating inclusive societies. An overriding design trade-off for the digital age is whether new developments will increase the digital divide or will create more inclusive societies. Sustaining inclusive societies means allowing people of all ages and all abilities to exploit information technologies for personally meaningful activities. Meta-design fosters the design of socio-technical environments that end-user developers can modify and evolve at use time to improve their quality of life and favour their inclusion in the society. This paper describes three case studies in the domain of assistive technologies in which end users themselves cannot act as end-user developers, but someone else (e.g.: a caregiver or a clinician) must accept this role requiring multi-tiered architectures. The design trade-offs and requirements for meta-design identified in the context of the case studies and other researchers’ projects are described to inform the development of future socio-technical environments focused on social inclusion.     

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 new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.     

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.     

On recommendation problems beyond points of interest

Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead.     

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

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

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.