Possible spectroscopic manifestation of the angular group induced bond alteration (AGIBA) effect in toluene

The most obvious consequence of the concept of aromaticity is the common confidence that in aromatic compounds, bond lengths do not alternate and are between typical to the single and double ones. However, in 1994, performing crystal structure investigations of substituted pyridines and their salts, Krygowski and co‐workers have discovered a very surprising angular group induced bond alteration (AGIBA) effect: It appears that some angular substituents, like methoxy or nitrozo groups, can induce bond alternation in aromatic rings. Crystal studies do not allow one to operate with liquids that are more common in organic chemistry. This paper presents the first possible evidence of spectroscopic manifestations of the AGIBA effect. Raman spectra of the liquid toluene are analyzed. It is found that instead of being single, the line corresponding to the ring breathing vibrations is clearly split by 1.0–1.4 cm^?1, thus indicating the presence of two (cis‐ and trans‐) AGIBA isomers. The energy difference between these isomers estimated in temperature dependent Raman studies is found equal to 6.68 kJ mol^?1. The low‐wavenumber line therefore corresponds to the cis‐AGIBA isomer and the high‐wavenumber line to the trans‐AGIBA isomer stabilized by the AGIBA effect. Copyright © 2007 John Wiley & Sons, Ltd.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

On the Patterson–Sullivan Measure for Geometrically Finite Groups Acting on Complex or Quaternionic Hyperbolic Space

The goal of this paper is to provide a tool, the Global Measure Formula, that will facilitate the study of the limit set of discrete geometrically finite groups of isometries of the rank one symmetric spaces. We consider the shadow of a ball from a fixed reference point onto the boundary, and prove a formula that describes the measure of the shadow in terms of the center of the shadowed ball, generalizing a result from real hyperbolic geometry.     

HL—1装置中心热区电子热传导初步分析

在电流及温度分布满足“不变性”原理的基础上,本文分析了等离子体中心热区的能量平衡,求出了电子热传导系数,根据实验数据拟合出HL-1装置电子热传导系数的定标关系为X_e=6.8(n_(eq1))~(-1.2)。此关系与其他托卡马克装置的结果类似。     

On the successive supersymmetric rank‐1 decomposition of higher‐order supersymmetric tensors

In this paper, a successive supersymmetric rank‐1 decomposition of a real higher‐order supersymmetric tensor is considered. To obtain such a decomposition, we design a greedy method based on iteratively computing the best supersymmetric rank‐1 approximation of the residual tensors. We further show that a supersymmetric canonical decomposition could be obtained when the method is applied to an orthogonally diagonalizable supersymmetric tensor, and in particular, when the order is 2, this method generates the eigenvalue decomposition for symmetric matrices. Details of the algorithm designed and the numerical results are reported in this paper. Copyright © 2007 John Wiley & Sons, Ltd.     

Global existence and blow-up of solutions to a parabolic system with nonlocal sources and boundaries

This paper deals with a semi-linear parabolic system with nonlinear nonlocal sources and nonlocal boundaries.By using super-and sub-solution techniques,we first give the sufficient conditions that the classical solution exists globally and blows up in a finite time respectively,and then give the necessary and sufficient conditions that two components u and v blow up simultaneously.Finally,the uniform blow-up profiles in the interior are presented.     

采用激光光刀的叶片三维面形测量方法

提出一种采用激光光刀的叶片三维面形测量方法。介绍了方法原理、系统结构、信息获取与处理方案,并给出了对实际飞机发动机叶片的面形测量结果。     

统计优化迭代法测量质子交换波导折射率分布

提出了一种用于拟合测量渐变波导的折射率分布的新的理论处理。该方法把统计优化手段导入循环迭代法 ,可适用于费米函数这一类曲线变化范围大、且有多个自变量的函数。实验上用焦磷酸质子交换制备了LiNbO3波导样品 ,用该方法对退火后的折射率分布作了测量拟合 ,折射率拟合值与实验值的均方差为± 8.2× 10 - 4。     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

How to Express a Parallel Sum of k Matrices

We present an alternative expression for the parallel sum of k Hermitian nonnegative definite matrices by using the Moore-Penrose inverse of a block matrix.