磷酸铁锂电池负极黑斑成因分析

描述了一种锂离子电池负极片产生黑斑的失效现象,通过拆解及形貌、成分测试,分别从负极材料的结构特性、电解液成分、Na源追溯、水分残留四个方面分析了负极片产生黑斑的原因.     

Comparison of the affinity and selectivity of insoluble fibres and commercial proteins for wine proanthocyanidins

The fining action of commercial proteins and insoluble fibres for wine proanthocyanidin (PA) were compared. Fibres were prepared from fresh apple and grape sources, and their corresponding pomaces. PA removal by fibre was via adsorption, and required a higher dose to achieve a fining effect comparable with proteins. A principal component analysis data model revealed that PA molecular mass was significant in defining the fining response, and reflected changes in the proportion of the dominant terminal PA subunits catechin and epicatechin, but not epicatechin-3-O-gallate. For PA extension subunits, changes in epigallocatechin were inversely correlated with epicatechin and epicatechin-3-O-gallate. Generally, the application of proteins and fibres reduced PA molecular mass. Selectivity for PAs by subunit composition was variable between treatments, but differences were minor. This work demonstrates the potential use of fibres as an alternative to proteins in winemaking. Benefits, and possible limitations of such an approach are discussed.     

煤气钢管快速镶接技术的研究报告

1 基本情况上海煤气事业已有130余年历史,随着改革开放燃气大发展,上海城区基本燃气化,地下燃气管道已猛增到8000多公里,其中管网占相当比例,长期以来带气钢管的调换镶接(合拢)施工时,采用钢制套筒,外加棱圈焊接的方法完成的。     

建构的“不可见性（内在的可见性）” 重力和建构紧致集

作者对于建构的一个重要特点——不可见性作了详细的阐述。不可见性的另一重含义意味着将可见性内部化,应用到建构中去。作者认为建构从字面上一直没有得到确切的解释。从建构的不可见性（内在的可见性）作者引出了自己的一个概念,即建构的紧致集（在此作者引用了数学术语）,例如混凝土本身就可以成为一个“建构的紧致集”,它可以形成一个足够的系统,产生一个定义标准,让我们更好地建造。为此作者例举了现代建筑大师路易．康、勒里柯莱等人的实践来论证这一点;当阐述重力的概念对于建构的影响时,作者立足于传统的欧几里得数学、相对论和拓扑学等当代数学和物理学对重力概念的改变,以及这种改变在抽象艺术和现代建筑领域中所产生的影响,并认为这种影响与建构的阅读性和不可见性有着相当的关联。     

探讨电视媒体网络中的存储安全技术

随着计算机和网络技制作、播出、存储等正越来络体系,尤其是存储网络体络的建设,存储安全性问题工作者最需要关注的问题。术的发展,电视节目的越多地依赖于计算机网系。伴随着电视媒体网也正成为当前电视技术本文就此展开探讨。     

在线红外光谱法研究聚乙烯基苄基氯的交联反应动力学

利用傅里叶变换红外光谱仪(FTIR)在线追踪聚乙烯基苄基氯(PVBCl)与N,N,N′,N′-四甲基-1,6-己二胺(TMHDA)的交联反应历程,考察了反应时间与温度对交联程度的影响。实验结果表明,随着反应时间的延长,交联程度先迅速增大,而后趋于平缓直至不变;反应温度越高,交联程度越大。对反应进行动力学的研究计算结果显示,该交联反应的反应级数n=4,表观活化能Ea=97.2kJ/mol。     

赋予“老建筑”新的使命——东南大学老图书馆加固改造利用的启示

通过东南大学老图书馆加固改造利用的设计实践,分析了"老建筑"的范围界定和赋予新使命的重要性,提出改造设计的两项原则:"修旧如旧"、"传统精神与现代思想氛围互动"的原则,并通过功能提升、交通空间设计、结构加固设计、增添基础设施,更换配套设备、消防设计、室内装饰、节能设计等七方面具体的改造措施,保障这两个原则得以较好贯彻,从而揭示赋予"老建筑"新的使命,在快速发展的现代化城市建设中具有重要的现实意义。     

Fitting curves and surfaces with constrained implicit polynomials

A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: although the data set is simple, the fit exhibits undesired phenomena, such as loops, holes, extraneous components, etc. Previous work tackled these problems by optimizing heuristic cost functions, which penalize some of these topological problems in the fit. The paper suggests a different approach-to design parameterized families of polynomials whose zero-sets are guaranteed to satisfy certain topological properties. Namely, we construct families of polynomials with star-shaped zero-sets, as well as polynomials whose zero-sets are guaranteed not to intersect an ellipse circumscribing the data or to be entirely contained in such an ellipse. This is more rigorous than using heuristics which may fail and result in pathological zero-sets. The ability to parameterize these families depends heavily on the ability to parameterize positive polynomials. To achieve this, we use some powerful results from real algebraic geometry     

脱胶剂对大豆油脱胶效果及磷脂质量的影响

在以前试验得出的大豆油水化脱胶优化条件的基础上，对含磷脂１．９２％的大豆油水化时分别加入乙酸酐、柠檬酸、过氧化氢、磷酸、乙酸、氯化钠、氢氧化钠。结果是：加乙酸酐得到的脱胶油含磷脂量最低，为０．１５％；加过氧化氢得到的磷脂颜色最浅，为Ｇａｒｄｎｅｒ比色５￣＋，而脱胶油的过氧化值最高；加柠檬酸得到的磷脂丙酮不溶物含量最高，为８２．６％，精炼率也是高，为９７．９％；加磷酸得到的磷脂颜色最深，为Ｇａｒｄｎｅｒ比色９￣＋。     

Order optimal information spreading using algebraic gossip

In this paper we study gossip based information spreading with bounded message sizes. We use algebraic gossip to disseminate $k$ distinct messages to all $n$ nodes in a network. For arbitrary networks we provide a new upper bound for uniform algebraic gossip of $O((k+\log n + D)\varDelta )$ rounds with high probability, where $D$ and $\varDelta $ are the diameter and the maximum degree in the network, respectively. For many topologies and selections of $k$ this bound improves previous results, in particular, for graphs with a constant maximum degree it implies that uniform gossip is order optimal and the stopping time is $\varTheta (k + D)$ . To eliminate the factor of $\varDelta $ from the upper bound we propose a non-uniform gossip protocol, TAG, which is based on algebraic gossip and an arbitrary spanning tree protocol $\mathcal{S } $ . The stopping time of TAG is $O(k+\log n +d(\mathcal{S })+t(\mathcal{S }))$ , where $t(\mathcal{S })$ is the stopping time of the spanning tree protocol, and $d(\mathcal{S })$ is the diameter of the spanning tree. We provide two general cases in which this bound leads to an order optimal protocol. The first is for $k=\varOmega (n)$ , where, using a simple gossip broadcast protocol that creates a spanning tree in at most linear time, we show that TAG finishes after $\varTheta (n)$ rounds for any graph. The second uses a sophisticated, recent gossip protocol to build a fast spanning tree on graphs with large weak conductance. In turn, this leads to the optimally of TAG on these graphs for $k=\varOmega (\text{ polylog }(n))$ . The technique used in our proofs relies on queuing theory, which is an interesting approach that can be useful in future gossip analysis.