利用浓盐酸脱苯基方法合成混合二烃基二氯化锡

利用RSnPh3(R= Me3SiCH2、EtMe2SiCH2、Bu)和浓盐酸直接混合加热反应,合成了三种混合二烃基二氯化锡,通过IR,1H NMR和MS的测定,对产物的结构进行了表征;并探讨了反应时间、温度和浓盐酸用量对该反应产率的影响.实验结果表明,该方法与其它方法比较,具有操作简单、反应速度快、环境污染小、产率较高等特点;当四烃基锡与浓盐酸的物质的量比为1:8,在97 ℃反应7 min,混合二烃基二氯化锡的产率大于70%.     

The effects of cubic potentials on discrete breathers in a mixed Klein－Gordon /Fermi－Pasta－Ulam chain

Nonlinearity has a crucial impact on the symmetry properties of dynamical systems. This paper studies a one-dimensional mixed Klein--Gordon/Fermi--Pasta--Ulam diatomic chain using the expanded rotating plane-wave approximation and numerical calculations to determine the effect of cubic potentials on the symmetry properties of discrete breathers in this system. The results will be very useful to researchers in the field of numerical calculations on discrete breathers.     

Topological aspect of Chern--Simons p-branes

By generalizing the topological current of Abelian Chern--Simons (CS) vortices, we present a topological tensor current of CS p-branes based on the \phi -mapping topological current theory. It is revealed that CS p-branes are located at the isolated zeros of the vector field \phi(x), and the topological structure of CS p-branes is characterized by the winding number of the \phi-mappings. Furthermore, the Nambu--Goto action and the equation of motion for multi CS p-branes are obtained.     

改进黏度在线凝胶色谱的测定结果

黏度在线凝胶色谱是一种同时配备浓度和黏度检测器的凝胶色谱,由于其测定过程简单直接,被越来越多地广泛采用,但因为数据处理方式和仪器精度的问题,其数均分子量、重均分子量与分散度结果存在较大误差.实验表明,选择适当的谱峰叠加处理、改进普适校正曲线精度、调整标样进样方式以及选择合适的积分点等手段可以明显改善存在的问题,从而大幅度地提高数均分子量、重均分子量与分散度的结果准确性.     

瞬变流中气泡动力过程研究

微气泡的生成等基础问题制约着鼓泡脱气技术的发展.本文基于对文丘里鼓泡器内流场的研究,对不同雷诺数下的气泡动力特性进行研究,采用大涡模拟和流体体积法相结合的数值模拟方法,对气泡在不同瞬时动态变化流场下的动力特性进行研究,通过分析气泡在不同湍流下的表面积,气泡球度,以及气泡表面所处的湍流应力,计算气泡所受的破坏应力与聚合应...     

The minimum forcing number of perfect matchings in the hypercube

Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of $M$. Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the $n$-dimensional hypercube is $2^{n?2}$, for all $n\ge 2$. This was revised by Riddle (2002), who conjectured that it is at least $2^{n?2}$, and proved it for all even $n$. We show that the revised conjecture holds for all $n\ge 2$. The proof is based on simple linear algebra.     

Continuum versus discrete networks,graph Laplacians,and reproducing kernel Hilbert spaces

Motivated by applications to machine learning, we construct a reversible and irreducible Markov chain whose state space is a certain collection of measurable sets of a chosen l.c.h. space $\mathfrak{X}$. We study the resulting network (connected undirected graph), including transience, Royden and Riesz decompositions, and kernel factorization. We describe a construction for Hilbert spaces of signed measures which comes equipped with a new notion of reproducing kernels and there is a unique solution to a regularized optimization problem involving the approximation of $L^2$ functions by functions of finite energy. The latter has applications to machine learning (for Markov random fields, for example).