Some Properties of Smooth Convex Functions and Newton’s Method

Doklady Mathematics - New properties of convex infinitely differentiable functions related to extremal problems are established. It is shown that, in a neighborhood of the solution, even if the...     

Effect of Mechanical Stress on the Splitting of Spin Sublevels in 4H-SiC

JETP Letters - The effect of static mechanical strain on the splitting of spin sublevels of color centers based on spin 3/2 silicon vacancies in silicon carbide at room temperature has been shown....     

Crystallographic Parameters of Special Grain Boundaries in Multicrystalline Silicon

Crystallography Reports - The orientation of grains and the special boundaries formed by them in multicrystalline silicon has been studied by electron backscattered diffraction. It is found that...     

Raman Scattering Study of Natural and Synthetic Compounds Containing Polyene Chains

Doklady Physics - The dependence of Raman spectra of the molecules containing polyene chains on the conjugation length, structure of side and end groups, and isomer type is analyzed theoretically.     

Transformation of the Microwave Resonance Properties of Metastructures with CdS and CdSe at One- and Two-Photon Excitation

JETP Letters - Photonically controlled metastructures containing resonant conducting dipole and chiral elements with CdS and CdSe in gaps have been proposed, implemented, and studied in a waveguide...     

污泥基吸附剂对亚甲基蓝和环丙沙星的吸附性能研究

亚甲基蓝和环丙沙星是水体中2种污染物, 对生态环境有潜在危害. 本文以市政剩余活性污泥为原料, 氯化锌为活化剂热解制备污泥基吸附剂, 研究盐酸酸洗浓度、氯化锌浓度、热解温度、热解时间等对污泥基吸附剂吸附水中亚甲基蓝和环丙沙星性能的影响. 结果表明 (1)污泥基吸附剂对亚甲基蓝的吸附性能随盐酸酸洗浓度的增大而增加, 对环丙沙星的吸附性能则随盐酸酸洗浓度的增大呈先降后增趋势, 两者均在1.500mol·L-1盐酸浓度下取得最优值. (2)污泥基吸附剂对亚甲基蓝和环丙沙星的吸附性能随氯化锌浓度和热解温度的增加呈先升后降趋势, 在氯化锌浓度为4.0mol·L-1、热解温度为500℃时有最优值; 随着热解时间的延长, 污泥基吸附剂对亚甲基蓝和环丙沙星的吸附性能分别在500℃热解70min和80min时有最优值. (3)污泥基吸附剂的最佳制备条件为 氯化锌4.0mol·L-1活化2h、500℃热解70min和80min、1.500mol·L-1盐酸酸洗; 以此制得的污泥基吸附剂对亚甲基蓝和环丙沙星的去除率分别为97.7%和96.4%, 平衡吸附量分别为97.9mg·g-1和3.9mg·g-1, 且污泥基吸附剂对亚甲基蓝和环丙沙星的吸附过程均符合准二级动力学方程.     

Application of Synchrotron Radiation to Analyze the Friction-Induced Structural and Phase Transformations of Chrome-Nickel Austenitic Steel

Russian Physics Journal -     

Estimation of the Sorption Activity of Silver Nanoparticles on Biodegradable Fibers of Natural and Artificial Origin

Russian Physics Journal - The specific features of the sorption activity of silver nanoparticles (AgNPs) on biodegradable polymers of natural (collagen) and artificial (polyamide 6.6) origin have...     

Computing Integrated Information (Φ) in Discrete Dynamical Systems with Multi-Valued Elements

Integrated information theory (IIT) provides a mathematical framework to characterize the cause-effect structure of a physical system and its amount of integrated information (Φ). An accompanying Python software package (“PyPhi”) was recently introduced to implement this framework for the causal analysis of discrete dynamical systems of binary elements. Here, we present an update to PyPhi that extends its applicability to systems constituted of discrete, but multi-valued elements. This allows us to analyze and compare general causal properties of random networks made up of binary, ternary, quaternary, and mixed nodes. Moreover, we apply the developed tools for causal analysis to a simple non-binary regulatory network model (p53-Mdm2) and discuss commonly used binarization methods in light of their capacity to preserve the causal structure of the original system with multi-valued elements.     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.