A Comparative Study on the Modelling of Soybean Particles Based on the Discrete Element Method

To solve the poor universality in the existing modelling approaches of soybean particles, we proposed a soybean particle modelling approach by combining five, nine, and 13 balls. The soybean seeds from three varieties (Suinong42, Jidou17, and Zhongdou39 with a sphericity of 94.78%, 86.86%, and 80.6%, respectively) are chosen as the study objects. By the comparisons between the simulation results and the test results in the “self-flow screening” and “piling angle” tests, it is concluded that the soybean particle modelling approach we presented in this paper is a universal modelling approach appropriate for soybean particles with different sphericities. The five-ball model is appropriate for the soybean particles with high sphericity, and the nine- or 13-ball models are applicable to those with low sphericity. The soybean particle modelling approach we presented is also compared with the ellipsoidal equation modelling approach for soybean particles and with the modelling approaches presented by other researchers. From an overall perspective, the soybean particle modelling approach we presented is better than the ellipsoidal equation modelling approach and those modelling approaches presented by other researchers. Additionally, it is shown that the multiple contacts issue in the multi-ball model has a little influence on the simulation results of soybean particle models. The study in this paper provides a new modelling approach for soybean particles in the DEM simulation of the contacts between soybean particles and the related machines.

Closing the Gap for Makespan Scheduling via Sparsification Techniques

Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of n jobs to a set of m identical machines that minimizes the makespan. The problem is strongly NP-hard, and thus we do not expect a ([Formula: see text])-approximation algorithm with a running time that depends polynomially on [Formula: see text]. It has been recently shown that a subexponential running time on [Formula: see text] would imply that the Exponential Time Hypothesis (ETH) fails. A long sequence of algorithms have been developed that try to obtain low dependencies on [Formula: see text], the better of which achieves a quadratic running time on the exponent. In this paper we obtain an algorithm with an almost-linear dependency on [Formula: see text] in the exponent, which is tight under ETH up to logarithmic factors. Our main technical contribution is a new structural result on the configuration-IP integer linear program. More precisely, we show the existence of a highly symmetric and sparse optimal solution, in which all but a constant number of machines are assigned a configuration with small support. This structure can then be exploited by integer programming techniques and enumeration. We believe that our structural result is of independent interest and should find applications to other settings. We exemplify this by applying our structural results to the minimum makespan problem on related machines and to a larger class of objective functions on parallel machines. For all these cases, we obtain an efficient PTAS with running time with an almost-linear dependency on [Formula: see text] and polynomial in n.

Neutrophils as Main Players of Immune Response towards Nondegradable Nanoparticles

Many nano/microparticles (n/µP), to which our body is exposed, have no physiological way of removal. Our immune system sense these “small particulate objects”, and tries to decrease their harmfulness. Since oxidation, phagocytosis and other methods of degradation do not work with small, chemically resistant, and hydrophobic nanoparticles (nP). This applies to soot from air pollution, nano-diamonds from cosmic impact, polishing and related machines, synthetic polymers, and dietary n/µP. Our body tries to separate these from the surrounding tissue using aggregates from neutrophil extracellular traps (NETs). This effectively works in soft tissues where n/µP are entrapped into granuloma-like structures and isolated. The interactions of hydrophobic nanocrystals with circulating or ductal patrolling neutrophils and the consequent formation of occlusive aggregated NETs (aggNETs) are prone to obstruct capillaries, bile ducts in gallbladder and liver, and many more tubular structures. This may cause serious health problems and often fatality. Here we describe how specific size and surface properties of n/µP can activate neutrophils and lead to aggregation-related pathologies. We discuss “natural” sources of n/µP and those tightly connected to unhealthy diets.