牛顿弦截法预估校正迭代格式的收敛阶

研究如下形式的牛顿弦截法的预估校正(P.C.)格式:P(预估):~xk+1=xk-(xk-xk-1)f(xk)f(xk)-f(xk-1)C(校正):xk+1=xk-(~xk+1-xk)f(xk)f~(xk+1)-f(xk)证明了它的收敛阶为2.618.     

Measures on minimally generated Boolean algebras

We investigate properties of minimally generated Boolean algebras. It is shown that all measures defined on such algebras are separable but not necessarily weakly uniformly regular. On the other hand, there exist Boolean algebras small in terms of measures which are not minimally generated. We prove that under CH a measure on a retractive Boolean algebra can be nonseparable. Some relevant examples are indicated. Also, we give two examples of spaces satisfying some kind of Efimov property.     

Predicting automobile claims bodily injury severity with sequential ordered logit models

Despite the large cost of bodily injury (BI) claims in motor insurance, relatively little research has been done in this area. Many companies estimate (and therefore reserve) bodily injury compensation directly from initial medical reports. This practice may underestimate the final cost, because the severity is often assessed during the recovery period. Since the evaluation of this severity is often only qualitative, in this paper we apply an ordered multiple choice model at different moments in the life of a claim reported to an insurance company. We assume that the information available to the insurer does not flow continuously, because it is obtained at different stages. Using a real data set, we show that the application of sequential ordered logit models leads to a significant improvement in the prediction of the BI severity level, compared to the subjective classification that is used in practice. We also show that these results could improve the insurer’s reserves notably.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.     

新疆野生黑加仑与马林果实的营养成分分析

通过对新疆野生黑加仑和野生马林的脂肪油，8种微量元素，17种氨基酸以及维生素C的含量进行测定得出：黑加仑脂肪油含量为17．9％，马林的脂肪油含量为22．3％，其中，黑加仑脂肪油中，r－亚麻酸的含量为19．02％，而马林中，其含量为9．40％，黑加仑中K，Na,Ca,Cu,Zn,Fe的含量比马林中的含量高，而Mn,Mg元素的含量却比马林含量低；马林的维生素C含量为16．22mg/g，黑加仑的含量为108mg/g，黑加仑的氨基酸的总量为1．63％，马林为1．14％。     

硼砂与氯化铵合成hBN反应机理的研究

 研究了以硼砂、氯化铵为原料在氨气气氛下合成hBN 的反应机理。指出氯化铵在反应中的主要作用是与硼砂反应形成可阻止硼砂颗粒团聚的高熔点膜层；而氨气的主要作用就是提供大量参与反应的NH₃分子，增加了反应几率；新生成的hBN则进一步隔离高度熔融的硼砂团粒，防止玻璃相的生成。     

Adhesion measurement of thin films by a modified laser spallation technique: theoretical analysis and experimental investigation

Laser driven shocks can lead to a dynamic failure, called film spallation. Here, we use a modified laser spallation set-up to measure the dynamic adhesion of thin films and we propose a novel diagnostic technology. Based on correlation theory, new spallation criteria for characterizing the progressive damage at the interface between the film and the substrate are established, such as interface delamination, film spallation and film expulsion. With the help of the theory, the degree of damage and the dimension of damage (i.e. fracture), such as the minimum width of delamination radius, the thickness of the film etc., are estimated. Experiments are carried out on epoxy/stainless steel and epoxy/Al, and the experimental results show that their dynamic bonding strengths are about 25 MPa and 20 MPa, respectively. The detailed results, analyses and discussions are presented in this paper. Received: 6 February 2001 / Accepted: 3 December 2001 / Published online: 11 February 2002     

一维无序体系电子跳跃导电研究

建立了电子隧穿电导模型,推导了一维无序体系新的直流电导公式.通过计算20000格点无序体系的直流电导率,分析了直流电导率和温度及外场电压的关系,讨论了无序度对直流电导的影响.计算结果表明,无序体系的直流电导率随无序度的增加而减小;外加电场较小时,电导率相对较大,且出现一系列峰值,电压较大时,电导率反而较小;无序体系在低温区出现了负微分电阻特性,电导率随温度的升高而增大,在高温区电导率随温度的升高而减小.计算结果和实验符合很好 关键词： 无序体系 电子隧穿 直流电导率     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.     

Large Discrepancy In Homogenous Quasi-Arithmetic Progressions

We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and gives a better bound on the discrepancy.