Superporous nanocarbon materials upcycled from polyethylene terephthalate waste for scalable energy storage

Plastic pollution is becoming a universal threat affecting wildlife, marines, the atmosphere, soil, and human wellbeing. The insufficient waste management traditions, along with a growth in the "throw-away" and "single -use" culture, exacerbate the problem. Meanwhile, the fast-growing energy storage industry, such as the lithium -ion battery (LIB), requires renewable resources to provide a steady and reliable production supply chain. This work introduces a scalable industrial mature route to transform polyethylene terephthalate (PET) plastic waste into a superporous activated carbon material for rechargeable LIBs. We characterized the analytical properties of the waste-derived carbon material and used it to develop LIB anodes. Then, we generated carbon-silicon com-posite anodes by impregnating silicon nanoparticles (SiNPs) into the superporous connected architecture network. We conducted density functional-based tight-binding (DFTB+) quantum chemical calculations to elucidate the binding interactions between PET and SiNPs. By implementing electrochemical impedance spec-troscopy (EIS), galvanostatic intermittent titration technique (GITT), and differential capacity analysis (DCA), we investigated the root causes of the degradation mechanisms of the material. Finally, our techno-economical study highlights the merits of a sustainable approach for transferring waste materials into valuable products such as energy storage. This work can create further research and development for recycling plastic wastes towards scalable stationary battery storage with the benefits of environmental sustainability and circular economics

A characterization of those automata that structurally generate finite groups

Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of the production functions. Antonenko has proved that this constitutes a characterization in the non-invertible case and asked for the invertible case, which is proved in this paper

Obese and female adolescents skip breakfast more than their non-obese and male peers

We examined the association between overweight/gender and skipping breakfast among adolescent students in Tehran city using a cross-sectional study and a multistage random sampling method. All educational zones in Tehran city were covered during the educational year of 2000-01. In total, 2321 students aged 11-16 years (1068 male; 1263 female) participated in the study. Weight and height were measured and body mass index (BMI; kg/m2) was calculated. Overweight, pre-obesity and obesity were defined as BMI � 85 th , 85 th to 95 th , and � 95 th percentile of age-sex-specific BMI reference values, respectively. Self-reported frequency of breakfast consumption was categorized as usual/always, often, and rarely/never (5-7, 2-4 and 0-1 times/wk, respectively). Student's t and Chi-square tests were employed to analyze the data. Statistical inferences were made at α = 0.05. In boys and girls, the mean ± standard deviation of BMI was 19.8 ± 4.0 and 20.6 ± 4.1 kg/m2, the 18.8 and 23.1 were overweight, and 7.3 and 8.3 were obese, respectively. There was a significant difference in the frequency of breakfast consumption between obese and normal male students (P < 0.001). Differences between pre-obese and normal, and obese and normal female students were also significant (P < 0.002 and P < 0.001, respectively). A significant difference was found in the frequency of breakfast consumption between male and female adolescents in all three categories (P < 0.001). These results suggest that obese and female adolescents are more likely to skip breakfast than their normal and male peers and are therefore at higher risk for growth deficits and low educational performance. Preventive/educational programs are urgently needed in this age group. © 2007 Versita Warsaw and Springer-Verlag

Initial Commitment to Pre-Exposure Prophylaxis and Circumcision for HIV Prevention amongst Indian Truck Drivers

Studies of HIV prevention interventions such as pre-exposure prophylaxis (PREP) and circumcision in India are limited. The present study sought to investigate Indian truck-drivers initial commitment to PREP and circumcision utilizing the AIDS Risk Reduction Model. Ninety truck-drivers completed an in-depth qualitative interview and provided a blood sample for HIV and HSV-2 testing. Truck-drivers exhibited low levels of initial commitment towards PREP and even lower for circumcision. However, potential leverage points for increasing commitment were realized in fear of infecting family rather than self, self-perceptions of risk, and for PREP focusing on cultural beliefs towards medication and physicians. Cost was a major barrier to both HIV prevention interventions. Despite these barriers, our findings suggest that the ARRM may be useful in identifying several leverage points that may be used by peers, health care providers and public health field workers to enhance initial commitment to novel HIV prevention interventions in India

Resistivity and galvanomagnetic coefficients of iron group metallic glasses with chromium substitutions

Magnetic field and temperature dependences of the electrical resistivities and Hall resistivities were measured for the metallic glass ferromagnets Fe13Ni60Cr5Si10B12, Fe37Ni36Cr5Si10B12, Fe81B13.5Si3.5C2, and Fe5Co75Si15B5. Resistance minima and magnetoresistivity of the FeNiCr glasses have been found to be consistent with a modified Kondo model of low temperature scattering. The Hall resistivities are positive and large. The spontaneous Hall coefficients of the FeNiCr glasses are in good agreement with previous magnetization measurements on the same glasses. Journal of Applied Physics is copyrighted by The American Institute of Physics

On the theoretical link between LLL-reduction and Lambda-decorrelation

International audienceThe LLL algorithm, introduced by Lenstra et al. (Math Ann 261:515-534, 1982), plays a key role in many fields of applied mathematics. In particular, it is used as an effective numerical tool for preconditioning the integer least-squares problems arising in high-precision geodetic positioning and Global Navigation Satellite Systems (GNSS). In 1992, Teunissen developed a method for solving these nearest-lattice point (NLP) problems. This method is referred to as Lambda (for Least-squares AMBiguity Decorrelation Adjustment). The preconditioning stage of Lambda corresponds to its decorrelation algorithm. From an epistemological point of view, the latter was devised through an innovative statistical approach completely independent of the LLL algorithm. Recent papers pointed out some similarities between the LLL algorithm and the Lambda-decorrelation algorithm. We try to clarify this point in the paper. We first introduce a parameter measuring the orthogonality defect of the integer basis in which the NLP problem is solved, the LLL-reduced basis of the LLL algorithm, or the $\Lambda$ -basis of the Lambda method. With regard to this problem, the potential qualities of these bases can then be compared. The $\Lambda$ -basis is built by working at the level of the variance-covariance matrix of the float solution, while the LLL-reduced basis is built by working at the level of its inverse. As a general rule, the orthogonality defect of the $\Lambda$ -basis is greater than that of the corresponding LLL-reduced basis; these bases are however very close to one another. To specify this tight relationship, we present a method that provides the dual LLL-reduced basis of a given $\Lambda$ -basis. As a consequence of this basic link, all the recent developments made on the LLL algorithm can be applied to the Lambda-decorrelation algorithm. This point is illustrated in a concrete manner: we present a parallel $\Lambda$ -type decorrelation algorithm derived from the parallel LLL algorithm of Luo and Qiao (Proceedings of the fourth international C $^*$ conference on computer science and software engineering. ACM Int Conf P Series. ACM Press, pp 93-101, 2012)