Hierarchical porous onion-shaped LiMn<Subscript>2</Subscript>O<Subscript>4</Subscript> as ultrahigh-rate cathode material for lithium ion batteries

Spinel LiMn₂O₄ is a widely utilized cathode material for Li-ion batteries. However, its applications are limited by its poor energy density and power density. Herein, a novel hierarchical porous onion-like LiMn₂O₄(LMO) was prepared to shorten the Li⁺ diffusion pathway with the presence of uniform pores and nanosized primary particles. The growth mechanism of the porous onion-like LiMn₂O₄ was analyzed to control the morphology and the crystal structure so that it forms a polyhedral crystal structure with reduced Mn dissolution. In addition, graphene was added to the cathode (LiMn₂O₄/graphene) to enhance the electronic conductivity. The synthesized LiMn₂O₄/graphene exhibited an ultrahigh-rate performance of 110.4 mAh·g^–1 at 50 C and an outstanding energy density at a high power density, maintaining 379.4 Wh·kg^–1 at 25,293 W·kg^–1. Besides, it shows durable stability, with only 0.02% decrease in the capacity per cycle at 10 C. Furthermore, the (LiMn₂O₄/graphene)/graphite full-cell exhibited a high discharge capacity. This work provides a promising method for the preparation of outstanding, integrated cathodes for potential applications in lithium ion batteries.

Open image in new window

     

Synthesis of ultrathin semicircle-shaped copper nanowires in ethanol solution for low haze flexible transparent conductors

Nano Research - Copper nanowires (CuNWs) are becoming an indispensable item for next-generation transparent optical devices due to their excellent conductivity and transparency. In this work,...     

Computational Parametric Analysis of Cellular Solids with the Miura-Ori Metamaterial Geometry under Quasistatic Compressive Loads

Origami-based metamaterials have widespread application prospects in various industries including aerospace, automotive, flexible electronics, and civil engineering structures. Among the wide range of origami patterns, the fourfold tessellation known as Miura-ori is of particular attraction to engineers and designers. More specifically, researchers have proposed different 3D structures and metamaterials based on the geometric characteristics of this classic origami pattern. Herein, a computational modeling approach for the design and evaluation of 3D cellular solids with the Miura-ori metamaterial geometry which can be of zero or nonzero thicknesses is presented. To this end, first, a range of design alternatives generated based on a numerical parametric model is designed. Next, their mechanical properties and failure behavior under quasistatic axial compressive loads along three perpendicular directions are analyzed. Then, the effects of various geometric parameters on their energy absorption behavior under compression in the most appropriate direction are investigated. The findings of this study provide a basis for future experimental investigations and the potential application of such cellular solids for energy-absorbing purposes.     

改革实践教学模式、培养学生综合能力──增设给水排水专业质量检测实习的体会

对给排水专业在优化专业教学体系,深化专科教学模式及教学内容改革中,实施的四次大型综合性实践教学,进行了认真总结．经过改变随课跟进的实验教学旧模式,在教学计划中增设了“水质指标综合测试与水质评价”实习内容使分散的教学实验得以“水质监测与评价”为骨架,有机穿插在实践教学中,为专科学校培养复合应用型人才,进行了有益的探索与实践,并获得较好效果．     

基于CORBA和TLl的STP网元集中管理系统实现

设计了STP网元集中管理系统,阐述了该系统的体系结构和各模块的功能以及各模块间的通信方式.通过使用CORBA构建技术、IDL接口描述语言以及文本描述语言TLl,使得系统具有灵活性、可维护性和可扩展性的特点.该系统的实现,使得对信令网中的STP设备进行集中管理和统一维护成为可能,为进一步对信令网的检测和历史数据的采集分析提供了基础.     

ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.     

结合变尺度法的改进类电磁机制算法

标准类电磁机制算法处理连续函数优化问题时存在最优参数选取和收敛速度问题.数值实验研究表明类电磁算法不具备初值敏感性,并在搜索后期算法收敛速度缓慢甚至可能出现停滞.数值实验分析指出粒子之间达成动态力平衡状态是造成算法停滞的可能原因之一,提出一种解决策略是摒弃EM算法后期搜索过程,结合变尺度法对EM算法前期搜索到的近似最优值进行二次优化.该混合计算方法将二者的优势相结合,实验结果表明新方法在保证计算实时性的同时,取得了较高的计算精度.最后,对EM算法本身构造提出一些改进意见,并初步建立用于连续函数优化的EM算法计算框架,为后续更深入的研究EM算法提供参考.     

Solving single-product economic lot-sizing problem with non-increasing setup cost,constant capacity and convex inventory cost in O(N log N) time

This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost, and convex inventory cost function. Algorithms with computational time of O(N×TD_N)have been developed for solving the model, where N is the number of planning periods and TD_N is the total demand. This study partially characterizes the optimal planning structure of the model. A new efficient algorithm with computational time of O(N log N) has also been developed based on the partial optimal structure. Moreover, computational study demonstrates that the new algorithm is efficient.     

CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles

Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher effi...