Coal Ash Beneficiation and Utilization in Coal Separation Process
In recent years, coal production and consumption increased dramatically, especially in China. So, more and more attentions have been paid to coal preparation and coal ash utilization with the growing concern about the pollution by fly ash. The unburned carbon in fly ash significantly affects its utilization in many fields, especially in concrete production industry. Technologies such as flotation, triboelectrostatic separation and carbon burnout have been developed to remove carbon from coal ash. This paper introduces chemical compositions of a typical coal ash and a dry beneficiation method. For some kinds of fly ash, magnetically stabilized fluidized bed was studied to recover magnetic pearls from fly ash. The magnetic pearls are mainly composed of Fe3O2 and Fe3O4 and are mostly hollow spheres. The size distributions of three kinds of magnetic pearls are from 300 to 25 µm. A magnetic pearls fluidized bed and a magnetically stabilized magnetic pearls fluidized bed for coal dry separation are studied in the paper.
ABOUT EMISSIONS CONTAINING SEDIMENTABLE SOLID PARTICLES
As pollutants concentration on large areas is difficult to measure and also for designing industrial installations for emissions in the atmosphere, it is necessary the evaluation of sedimentary particles quantity at ground level, around the pollution source. Depending on emission and dispersion conditions, climate and pollutant type (gases or particles), the ground-level concentration may be expected as the following: near to source, due to high emission and air currents carrying the pollutants, the concentrations are equal to zero; maximum value can be attended at long distances from the source. The paper presents an analytical evaluation of deposition rate to the ground of pollutant containing solid particles, which was emitted in atmosphere by an elevated point source. Results are presented for specific particles size, depending on distance from the source, in wind direction.
Rubik's for cryptographers
Hard mathematical problems are at the core of security arguments in cryptography. In this paper, we study mathematical generalizations of the famous Rubik’s cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups. These problems arise naturally when describing the security of Cayley hash functions, a class of cryptographic hash functions with very interesting properties. The factorization problem is also strongly related to a famous long-standing conjecture of Babai, at the intersection of group theory and graph theory. A constructive proof of Babai’s conjecture would make all Cayley hash functions insecure, but on the other hand it would have many positive applications in graph theory and computer science. In this paper, we classify existing attacks against Cayley hash functions and we review known results on Babai’s conjecture. Despite recent cryptanalytic progress on particular instances, we show that the factorization, representation and balance problems presumably remain good sources of cryptographic hard problems. Our study demonstrates that Cayley hash functions deserve further interest by the cryptography community.