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.     

一种基于能带工程设计的CaAsSb/InP异质结双极晶体三极管

异质结晶体三极管（HBT）的性能与其材料体系密不可分，利用能带工程可以大大优化器件的结构，提高器件性能，文章从分析HBT的能带结构及设计要求入手，介绍了一种利用能带工程设计的基于GaAsSb/InP材料体系的新型HBT器件的结构及其性能，分析了该器件与其它材料体系器件相比所具有的优异特性，说明了对HBT的各区材料，其带边的相对位置所起的重要作用，最后，文章还报道了近期的实验情况，说明了GaAsSb/InP体系HBT的实际性能与理论预言一致。     

The Properties of Light Pressure Force with High Order in Laser Fields

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｉｎｒｅｃｅｎｔｙｅａｒｓ,ｂｏｔｈｔｈｅｔｈｅｏｒｅｔｉｃａｌａｎｄｅｘｐｅｒｉｍｅｎｔａｌｉｎｖｅｓｔｉｇａｔｉｏｎｓｏｎｌａｓｅｒｃｏｏｌｉｎｇａｎｄｔｒａｐｐｉｎｇｈａｖｅｂｅｃｏｍｅｏｎｅｏｆｔｈｅｍａｊｏｒｆｉｅｌｄｓｉｎａｔｏｍｉｃ,ｍｏｌｅｃｕｌａｒａｎｄｏｐｔｉｃａｌ ｐｈｙｓｉｃｓ[1～ 8] .Ｔｈｅｄｅｖｅｌｏｐｍｅｎｔｏｆｌａｓｅｒｃｏｏｌｉｎｇａｎｄｔｒａｐｐｉｎｇｔｅｃｈｎｏｌｏｇｙｉｓｉｍｐｏｒｔａｎｔｆｏｒｔｈｅａｐｐｌｉｃａｔｉｏｎｓｓｕ…     

Influence of SiO2 in SiCp on the microstructure and impact strength of Al/SiCp composites fabricated by pressureless infiltration

The effect of SiO₂ in SiC_p and the following processing parameters on the microstructure and impact strength of Al/SiC_p composites fabricated by pressureless infiltration was investigated: Mg content in the aluminum alloy, SiC particle size, and holding time. Preforms of SiC_p in the form of rectangular bars (10 × 1 × 1 cm) were infiltrated at 1150°C in an argon→nitrogen atmosphere for 45 and 60 min by utilizing two aluminum alloys (Al-6 Mg-11 Si and Al-9 Mg-11 Si, wt.%). The results obtained show that the presence of SiO₂ in SiC affects the microstructure and impact strength of the composites significantly. When Al₄C₃ is formed, the impact strength decreases. However, a high proportion of SiC to SiO₂ limits the formation of the unwanted Al₄C₃ phase in the composites. Also, a higher content of Mg in the Al alloy lowers the residual porosity and, consequently, increases the composite strength. The impact strength grows with decrease in SiC particle size and increases considerably when the residual porosity is less than 1%. Russian translation published in Mekhanika Kompozitnykh Materialov, Vol. 42, No. 3, pp. 401–418, May–June, 2006.     

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％。     

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.