对超重、失重演示实验的改进

对传统的超重、失重演示实验进行了改进,使弹簧秤的指针能静止在超重(或失重)的位置上,从而能准确地读出读数,提高演示效果.     

Line graphs of bipartite graphs with Hamiltonian paths

It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path P_t as a star complement for the eigenvalue ?2. The maximal graph is the line graph of K_m,m if t = 2m?1, and of K_m,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement P_r ∪ P_s or P_r ∪ C_s for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003     

西藏区域经济系统的灰色关联分析

区域经济的发展受许多不同因素的影响，本结合西藏社会经济发展的特点，选取了总产值指标、第一产业指标、第二产业指标和第三产业指标等四大类指标体系，采用灰色关联分析法对西藏的区域经济系统进行了简要的分析评价，以研究西藏区域经济的发展状况，从社会经济的角度探讨西藏经济发展落后的原因，以期能为西藏经济发展政策提供参考依据。     

期货经纪公司保证金的一种确定方法

本文基于马尔可夫链在存储论中的应用，结合Ergodic定理，得到确定期货经纪公司保证金的Ergodic模型，即一个双目标规划问题，然后应用乘积最大化准则，将该模型转化为单目标规划问题来求解。该方法考虑期货经纪公司承担的风险和对投资者的吸引程度，为保证金的确定提供新的思路。     

Degradative chain transfer in vinyl acetate polymerizations using toluene as solvent

In this work, we propose that retardation in vinyl acetate polymerization rate in the presence of toluene is due to degradative chain transfer. The transfer constant to toluene (C_trs) determined using the Mayo method is equal to 3.8 × 10^?3, which is remarkably similar to the value calculated from the rate data, assuming degradative chain transfer (2.7 × 10^?3). Simulations, including chain‐length‐dependent termination, were carried out to compare our degradative chain transfer model with experimental results. The conversion–time profiles showed excellent agreement between experiment and simulation. Good agreement was found for the M_n data as a function of conversion. The experimental and simulation data strongly support the postulate that degradative chain transfer is the dominant kinetic mechanism. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3620–3625, 2007     

The Two-Body Interaction with a Circle in Time

We complete our previous^{(1, 2)} demonstration that there is a family of new solutions to the photon and Dirac equations using spatial and temporal circles and four-vector behaviour of the Dirac bispinor. We analyse one solution for a bound state, which is equivalent to the attractive two-body interaction between a charged point particle and a second, which remains at rest. We show this yields energy and angular momentum eigenvalues that are identical to those found by the usual method of solving of the Dirac equation,⁽⁴⁾ including fine structure. We complete our previous derivation⁽²⁾ of QED from a set of rules for the two-body interaction and generalise these. We show that QED may be decomposed into a two-body interaction at every point in spacetime.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular n‐queens solutions

In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (a_ij), for all i and j it holds that a_ij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007