固态富马酸单乙酯在变温1H MAS与CRAMPS研究

富马酸单乙酯(FAME)的单脉冲¹H MAS谱由-高分辨成分与-宽线谱成分组成.高分辨成分可由Hahn回波脉冲序列单独获得.文中通过变温¹H MAS与CRAMPS实验对两组分的性质进行了系统的研究.发现当温度趋于样品的熔点时,其¹H CRAMPS谱可观察到化学位移明显区别的两套谱,它们分别对应于¹H MAS谱的高分辨与宽线组分.实验表明:高分辨成分来自FAME样品的-塑性相,而宽线组分来自通常的刚性相.文中所给出的实验事实充分说明¹H MAS与CRAMPS技术是研究有机塑性固体的强有力的工具.     

蕃茄酱流变特性的数学模型

把化工领域中的Casson模型和Power-lawPlashc模型用于描述蕃茄酱的流变特性，经回归分析验证它们都具有良好的相关程度．用残差平方和分析方法检验，在同样条件下，用Casson模型描述蕃茄酱的流变特性更为合理．     

二元外代数的Z_n-Galois覆盖代数的Hochschild(上)同调群

设Λ是特征不整除n的域k上的二元外代数,■是Λ的Zn-Galois覆盖代数.首先构造了■的极小投射双模分解,并由此清晰地计算了■的各阶Hochschild同调和上同调群的维数;并且在域的特征为零时,计算了■的循环同调群的维数.     

Some insight into characterizations of minimally nonideal matrices

Lehman (Polyhedral combinatorics 1 of DIMACS series in discrete math. and theoretical computer science, pp 101–105, 1990) described some conditions regular minimally nonideal (mni) matrices must satisfy. Although, there are few results on sufficient conditions for mni matrices. In most of these results, the covering polyhedron must have a unique fractional extreme point. This condition corresponds to ask the matrix to be the blocker of a near-ideal matrix, defined by the authors in a previous work (2006). In this paper we prove that, having the blocker of a near-ideal matrix, only a few very easy conditions have to be checked in order to decide if the matrix is regular mni. In doing so, we define the class of quasi mni matrices, containing regular mni matrices, and we find a generalization on the number of integer extreme points adjacent to the fractional extreme point in the covering polyhedron. We also give a relationship between the covering and stability number of regular mni matrices which allows to prove when a regular mni matrix can be a proper minor of a quasi mni. Partially supported by CONICET Grant PIP 2807/2000 (Argentina) and by CNPq/PROSUL Grant 490333/2004-4 (Brasil).     

热分析在包膜技术中的应用

应用包膜技术来改造粉末物理化学性能是近年来的一种新技术,也是界面科学应用的一个领域。本文应用热分析对硅铝包膜立德粉进行热稳定性研究,从包膜对它的热分解温度或氧化温度的影响及分解的表观活化能来对它进行评价。发现包膜后的立德粉比原始的立德粉其氧化外延起始温度从878.9K提高到969.7K,表观活化能从170.95千焦/克分子提高到279.65干焦/克分子。研究表明包膜后的立德粉其热稳定性大为提高,也反映了它的耐晒性能改善了。立德粉是涂料和油漆的主要基料,耐晒性是涂料质量的指标之一。     

用发射光谱分析法检测地膜中金属杂质含量

本文描述农用薄膜中Ａｌ、Ｆｅ、Ｍｇ、Ｃａ、Ｓｉ、Ｃｕ、Ｔｉ杂质元素的发射光谱分析法，该方法直接压样于石墨电极中，简便，快速，取得了满意的结果。     

A probabilistic analysis of the set covering problem

A probabilistic analysis of the minimum cardinality set covering problem (SCP) is developed, considering a stochastic model of the (SCP), withn variables andm constraints, in which the entries of the corresponding (m, n) incidence matrix are independent Bernoulli distributed random variables, each with constant probabilityp of success. The behaviour of the optimal solution of the (SCP) is then investigated as bothm andn grow asymptotically large, assuming either an incremental model for the evolution of the matrix (for each size, the matrixA is obtained bordering a matrix of smaller size by new columns and rows) or an independent one (for each size, an entirely new set of entries forA are considered). Two functions ofm are identified, which represent a lower and an upper bound onn in order the (SCP) to be a.e. feasible and not trivial. Then, forn lying within these bounds, an asymptotic formula for the optimum value of the (SCP) is derived and shown to hold a.e.The performance of two simple randomized algorithms is then analyzed. It is shown that one of them produces a solution value whose ratio to the optimum value asymptotically approaches 1 a.e. in the incremental model, but not in the independent one, in which case the ratio is proved to be tightly bounded by 2 a.e. Thus, in order to improve the above result, a second randomized algorithm is proposed, for which it is proved that the ratio between the approximate solution value and the optimum approaches 1 a.e. also in the independent model.     

On DRC‐covering of Kn by cycles

This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF‐networks which are protected independently from each other. The problem can be stated as follows: for a given graph G, find a cycle covering of the edge set of K_n, where V(K_n) = V(G), such that each cycle in the covering satisfies the disjoint routing constraint (DRC7rpar;, relatively to G, which can be stated as follows: to each edge of K_n we associate in G a path and all the paths associated to the edges of a cycle of the covering must be vertex disjoint. Here we consider the case where G = C_n, a ring of size n and we want to minimize the number of cycles in the covering. We give optimal solutions for the problem as well as for variations of the problem, namely, its directed version and the case when the cycle length is fixed to 4. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 100–112, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10040     

Accelerations for global optimization covering methods using second derivatives

Two improvements for the algorithm of Breiman and Cutler are presented. Better envelopes can be built up using positive quadratic forms. Better utilization of first and second derivative information is attained by combining both global aspects of curvature and local aspects near the global optimum. The basis of the results is the geometric viewpoint developed by the first author and can be applied to a number of covering type methods. Improvements in convergence rates are demonstrated empirically on standard test functions.Partially supported by an University of Canterbury Erskine grant.     

格序摸的f－覆盖

讨论了格序模的ｆ－模覆盖，给出了覆盖函子、ｆ－张量积函子和嵌入函子之间的关系．