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

通过对新疆野生黑加仑和野生马林的脂肪油，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％。     

Über die abstandsverträglichen Abbildungen auf dem Kreis und auf der reellen Geraden

Zusammenfassung. Eine Abbildung zwischen metrischen R?umen hei?t abstandsvertr?glich, wenn der Abstand der Bilder zweier Punkte nur vom Abstand der Punkte selbst abh?ngt. Wir zeigen, dass eine Abbildung genau dann abstandsvertr?glich ist, wenn der Cauchyschen Funktionalgleichung genügt, also ein Endomorphismus der Gruppe ist. Ein entsprechendes Resultat gilt auch für die abstandsvertr?glichen Abbildungen des Kreises (mit der Multiplikation komplexer Zahlen als Gruppenverknüpfung). Damit kann man sowohl alle messbaren abstandsvertr?glichen Abbildungen von bzw. in sich angeben, als auch einen Nachweis für die Existenz nichtmessbarer abstandsvertr?glicher Abbildungen auf und erbringen. Eingegangen am 20. Juni 2001 / Angenommen am 13. September 2001     

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.     

An Enumerative Geometry for Magic and Magilatin Labellings

A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005     

条件愈苦,意志愈坚 --记王淦昌早年的科研活动

文章介绍了中国物理学家王淦昌早期的科研工作，特别是在抗日战争时期的科研成绩．王淦昌早期的科研贡献并不是在先进的实验仪器上，在条件优裕的实验室内完成的，而是在实验设备缺乏，科学文献不足等极端困难的环境中完成的．从王淦昌身上，可以看到那个时代中国优秀科学家脚踏实地、执志若金的奋斗精神．     

On the structure of finite coverings of compact connected groups

Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.     

TRANILAST ^1H^13CNMR谱分析及其结构的鉴定

本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定.