Coal preparation is an integral part of the coal commodity supply chain. This stage of post-mining, pre-utilization beneficiation uses low-cost separation technologies to remove unwanted mineral matter and moisture wh...Coal preparation is an integral part of the coal commodity supply chain. This stage of post-mining, pre-utilization beneficiation uses low-cost separation technologies to remove unwanted mineral matter and moisture which hinder the value of the coal product. Coal preparation plants typically employ several parallel circuits of cleaning and dewatering operations, with each circuit designed to optimally treat a specific size range of coal. Recent innovations in coal preparation have increased the efficiency and capac- ity of individual unit operations while reinforcing the standard parallel cleaning approach. This article, which describes the historical influences and state-of-the-art design for the various coal preparation unit operations, is organized to distinguish between coarse/intermediate coal cleaning and fine/ultrafine coal cleaning. Size reduction, screening, classification, cleaning, dewatering, waste disposal unit operations are particularly highlighted, with a special focus on the LI.S. design philosophy. Notable differences between the U.S. and international operations are described as appropriate.展开更多
This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure ...This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm. This algorithm uses the FDG (formula to divide elements into groups) to sort (the FDG sorts a sequence of n elements in expected tir O(n)) and uses the method of path compression to find and to unite. Therefore. n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).展开更多
文摘Coal preparation is an integral part of the coal commodity supply chain. This stage of post-mining, pre-utilization beneficiation uses low-cost separation technologies to remove unwanted mineral matter and moisture which hinder the value of the coal product. Coal preparation plants typically employ several parallel circuits of cleaning and dewatering operations, with each circuit designed to optimally treat a specific size range of coal. Recent innovations in coal preparation have increased the efficiency and capac- ity of individual unit operations while reinforcing the standard parallel cleaning approach. This article, which describes the historical influences and state-of-the-art design for the various coal preparation unit operations, is organized to distinguish between coarse/intermediate coal cleaning and fine/ultrafine coal cleaning. Size reduction, screening, classification, cleaning, dewatering, waste disposal unit operations are particularly highlighted, with a special focus on the LI.S. design philosophy. Notable differences between the U.S. and international operations are described as appropriate.
文摘This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm. This algorithm uses the FDG (formula to divide elements into groups) to sort (the FDG sorts a sequence of n elements in expected tir O(n)) and uses the method of path compression to find and to unite. Therefore. n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).
