X分形晶格上Gauss模型的临界性质

采用实空间重整化群变换的方法,研究了2维和d(d>2)维X分形晶格上Gauss模型的临界性质.结果表明:这种晶格与其他分形晶格一样,在临界点处,其最近邻相互作用参量也可以表示为K=bqiqi(qi是格点i的配位数,bqi是格点i上自旋取值的Gauss分布常数)的形式;其关联长度临界指数v与空间维数d(或分形维数df)有关.这与Ising模型的结果存在很大的差异. 关键词： X分形晶格 重整化群 Gauss模型 临界性质     

Optimal design of a convergent-barrel cold spray nozzle by numerical method

A convergent-barrel (CB) cold spray nozzle was designed through numerical simulation. It was found that the main factors influencing significantly particle velocity and temperature include the length and diameter of the barrel section, the nature of the accelerating gas and its pressure and temperature, and the particle size. Particles can achieve a relatively low velocity but a high temperature under the same gas pressure using a CB nozzle compared to a convergent-divergent (CD) nozzle. The experiment results with Cu powder using the designed CB nozzle confirmed that particle deposition can be realized under a lower gas pressure with a CB nozzle.     

Effect of end groups on complexation kinetics between cyclodextrins and guest polymers

α‐Cyclodextrin (α‐CD) has been complexed with various poly(ethylene glycol) (PEG) derivatives in aqueous solution. It has been found that the end groups of PEG derivatives affect the complexation kinetics greatly, but have only a little influence on the thermodynamic behavior. By increasing the hydrophobicity of end groups, the complexation speeds up rapidly. On the other hand, the bulky end groups slow down the threading of polymeric guests into the cavity of CD. By changing the hydrophobicity and the size of end groups, the complexation rate can be adjusted in the range of several orders of magnitudes, which should be quite useful in the design of new supramolecular systems. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 2050–2057, 2006     

Experimental identification of physical parameters of fluid-filled pipes using acoustical signal processing

A method is formulated for the identification of an unknown physical parameter of a fluid-filled pipe using the measurement of sound speed in the pipe. The method uses a simple formula which provides the relationship between the sound speed and a few physical parameters of the pipe: thickness, diameter, wall material constants and fluid constants. Once the sound speed in the pipe is measured, the simple formula can be used to extract one of the unknown parameters providing the remaining ones are known.The sound speed in the pipe is measured using a 3-transducer array. In order to demonstrate the potential of the technique the results of several measurements obtained in a water-filled steel pipe are presented.The required accuracy of the measurement of sound speed and of the specification of known parameters is analysed. The accuracy depends on the unknown parameter which is to be identified. For example, if the pipe thickness is the unknown parameter, the other parameters have to be known within a very narrow margin of error. On the contrary, if the fluid properties have to be identified the needed accuracy of known parameters gets much lower.     

CP violation and extra dimensions

It is shown that new sources of CP violation can be generated in models with more than one extra dimension. In the supersymmetric models on the space-time , where the radius moduli have auxiliary vacuum expectation values and the supersymmetry breaking is mediated by the Kaluza–Klein states of the gauge supermultiplets, we analyze the gaugino masses and trilinear couplings for two scenarios and obtain the result that there exist relative CP violating phases among the gaugino masses and trilinear couplings. Received: 10 October 2001 / Published online: 20 December 2001     

B物理中的难题

讨论单举B介子衰变中的难题, 包括直接CP非对称性及纵向极化分支比, 这些难题可能皆归因于量子色动力学的不准确度, 并非新物理的讯号.     

Sizes of Critical Graphs with Small Maximum Degrees

In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of Luo [6] and Y. Zhao [12].     

On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

A Characterization of Graphs without Even Factors

In this paper, we first reduce the problem of finding a minimum parity (g,f)-factor of a graph G into the problem of finding a minimum perfect matching in a weighted simple graph G*. Using the structure of G*, a necessary and sufficient condition for the existence of an even factor is derived. This paper was accomplished while the second author was visiting the Center for Combinatorics, Nankai University. The research is supported by NSFC