Transition from random packing to stable state in a continuously avalanching granular flow

We investigate the transition evolution from the initial state with the random packing of the particles to the stable state in which successive avalanches exhibit consistent characteristics under the slumping regime. It is found that there exist three distinct stages in the transition evolution, considering the change of the volume fraction. The coordination number is almost unchanged during the transition evolution, which indicates the particle contact form is consistent in the three stages. The pause phenomena are discovered in some avalanches, and the probability of pause occurrence increases continuously in the three consecutive stages. We also explore the distribution of particles in the passive layer at the stable state. The particles in the middle region of the passive layer have the closest packing status, and the deeper the region is located, the later it reaches the stable state.     

Revealing cracking and breakage behaviours of gibbsite particles

Mitigating gibbsite particle cracking and breakage during industrial alumina production can increase the quality of smelter grade alumina product by reducing the ultrafine particle content. Therefore, it is essential to investigate the particle cracking during static calcination and the breakage of calcined gibbsite particles under external force. In this work, we investigated the impact of the calcination ramping rate and the crystallite size on gibbsite particle cracking during static calcination. A slow ramping rate and a large pristine crystallite size tend to increase particle cracking. Apart from the study of particle cracking behaviour, we also investigated the breakage of calcined gibbsite particle under external force. Cracks on the particle surface can initiate breakage within the crystallite and along the grain boundary under external force. The breakage within crystallite occurs as the cleavage of the crystallite, while the breakage along the grain boundary leads to the shedding of a whole crystallite. We further explored the factors influencing the strength of calcined gibbsite particles. With increasing calcination temperature, the strength of particle increases when gibbsite converts to boehmite, and then decreases when boehmite converts into amorphous alumina. Particles containing smaller crystallites and calcined with fast ramping rates exhibit higher resistance to breakage.     

Robust optimisation of sustainable food grain transportation with uncertain supply and intentional disruptions

The proliferating need for sustainability intervention in food grain transportation planning is anchoring the attention of researchers in the interests of stakeholders and environment at large. Uncertainty associated with food grain supply further intensifies the problem steering the need for designing robust, cost-efficient and sustainable models. In line with this, this paper aims to develop a robust and sustainable intermodal transportation model to facilitate single type of food grain commodity shipments while considering procurement uncertainty, greenhouse gas emissions, and intentional hub disruption. The problem is designed as a mixed integer non-linear robust optimisation model on a hub and spoke network for evaluating near optimal shipment quantity, route selection and hub location decisions. The robust optimisation approach considers minimisation of total relative regret associated with total cost subject to several real-time constraints. A version of Particle Swarm Optimisation with Differential Evolution is proposed to tackle the resulting NP-hard problem. The model is tested with two other state-of the art meta-heuristics for small, medium, and large datasets subject to different procurement scenarios inspired from real time food grain operations in Indian context. Finally, the solution is evaluated with respect to total cost, model and solution robustness for all instances.     

SDN中基于KMOBPSO的高可靠性控制器部署算法

针对SDN中控制器系统的单节点故障问题,兼顾系统成本和系统时延,应用N+1冗余备份模型来提高SDN控制器部署的可靠性,并将其抽象为多目标优化问题.同时,提出了一种融合K-means聚类算法和遗传算子的多目标二进制粒子群算法——KMOBPSO算法,以求解SDN控制器高可靠性部署问题的解.仿真结果表明,所提算法具有求解精度高、分布均匀、沿Pareto前沿面覆盖广的特点,能够显著提高SDN中控制器部署的可靠性.     

Multi-objective particle swarm optimisation based integrated production inventory routing planning for efficient perishable food logistics operations

Sustainable and efficient food supply chain has become an essential component of one’s life. The model proposed in this paper is deeply linked to people's quality of life as a result of which there is a large incentive to fulfil customer demands through it. This proposed model can enhance food quality by making the best possible food quality accessible to customers, construct a sustainable logistics system considering its environmental impact and ensure the customer demand to be fulfilled as fast as possible. In this paper, an extended model is examined that builds a unified planning problem for efficient food logistics operations where four important objectives are viewed: minimising the total expense of the system, maximising the average food quality along with the minimisation of the amount of CO₂ emissions in transportation along with production and total weighted delivery lead time minimisation. A four objective mixed integer linear programming model for intelligent food logistics system is developed in the paper. The optimisation of the formulated mathematical model is proposed using a modified multi-objective particle swarm optimisation algorithm with multiple social structures: MO-GLNPSO (Multi-Objective Global Local Near-Neighbour Particle Swarm Optimisation). Computational results of a case study on a given dataset as well as on multiple small, medium and large-scale datasets followed by sensitivity analysis show the potency and effectiveness of the introduced method. Lastly, there has been a scope for future study displayed which would lead to the further progress of these types of models.     

A Student's t-based density peaks clustering with superpixel segmentation (tDPCSS) method for image color clustering

Image color clustering is a basic technique in image processing and computer vision, which is often applied in image segmentation, color transfer, contrast enhancement, object detection, skin color capture, and so forth. Various clustering algorithms have been employed for image color clustering in recent years. However, most of the algorithms require a large amount of memory or a predetermined number of clusters. In addition, some of the existing algorithms are sensitive to the parameter configurations. In order to tackle the above problems, we propose an image color clustering method named Student's t-based density peaks clustering with superpixel segmentation (tDPCSS), which can automatically obtain clustering results, without requiring a large amount of memory, and is not dependent on the parameters of the algorithm or the number of clusters. In tDPCSS, superpixels are obtained based on automatic and constrained simple non-iterative clustering, to automatically decrease the image data volume. A Student's t kernel function and a cluster center selection method are adopted to eliminate the dependence of the density peak clustering on parameters and the number of clusters, respectively. The experiments undertaken in this study confirmed that the proposed approach outperforms k-means, fuzzy c-means, mean-shift clustering, and density peak clustering with superpixel segmentation in the accuracy of the cluster centers and the validity of the clustering results.     

Abrasive waterjet micro-machining of channels in metals: Comparison between machining in air and submerged in water

Abrasive water jet technology can be used for micro-milling using recently developed miniaturized nozzles. Abrasive water jet (AWJ) machining is often used with both the nozzle tip and workpiece submerged in water to reduce noise and contain debris. This paper compares the performance of submerged and unsubmerged abrasive water jet micro-milling of channels in 316L stainless steel and 6061-T6 aluminum at various nozzle angles and standoff distances. The effect of submergence on the diameter and effective footprint of AWJ erosion footprints was measured and compared. It was found that the centerline erosion rate decreased with channel depth due to the spreading of the jet as the effective standoff distance increased, and because of the growing effect of stagnation as the channel became deeper. The erosive jet spread over a larger effective footprint in air than in water, since particles on the jet periphery were slowed much more quickly in water due to increased drag. As a result, the width of a channel machined in air was wider than that in water. Moreover, it was observed that the instantaneous erosion rate decreased with channel depth, and that this decrease was a function only of the channel cross-sectional geometry, being independent of the type of metal, the jet angle, the standoff distance, and regardless of whether the jet was submerged or in air, in either the forward or backward directions. It is shown that submerged AWJM results in narrower features than those produced while machining in air, without a decrease in centerline etch rate.     

Stream-Based Data Sampling Mechanism for Process Object

Process object is the instance of process. Vertexes and edges are in the graph of process object. There are different types of the object itself and the associations between object. For the large-scale data, there are many changes reflected. Recently, how to find appropriate real-time data for process object becomes a hot research topic. Data sampling is a kind of finding c hanges o f p rocess o bjects. There i s r equirements f or s ampling to be adaptive to underlying distribution of data stream. In this paper, we have proposed a adaptive data sampling mechanism to find a ppropriate d ata t o m odeling. F irst o f all, we use concept drift to make the partition of the life cycle of process object. Then, entity community detection is proposed to find changes. Finally, we propose stream-based real-time optimization of data sampling. Contributions of this paper are concept drift, community detection, and stream-based real-time computing. Experiments show the effectiveness and feasibility of our proposed adaptive data sampling mechanism for process object.