混合效应模型中的D-最优设计

本研究的是混合效应-Ⅱ模型，首先，给出二阶模型存在D-最优回归设计点的必要条件。其次，组合D-最优回归设计和D-最优区组设计BIBD构造D-最优设计并给出寻找新的D-最优设计点的方法。以两种有代表性的组合误差分布为例，阐明新的D-最优设计点的获得过程，并给出了数值结果。     

最大2-正则诱导子图的长度

设G是2-连通图，c(G)是图G的最长诱导圈的长度，c′(G)是图G的最长诱导2-正则子图的长度。本文我们用图的特征值给出了c(G)和c′(G)的几个上界。     

Internal standardization for the determination of cadmium,cobalt, chromium and manganese in saline produced water from petroleum industry by inductively coupled plasma optical emission spectrometry after cloud point extraction

In the present paper a procedure is proposed for the determination of traces of Cd, Co, Mn and Cr in petroleum industry produced water by inductively coupled plasma optical emission spectrometry. The procedure is based on cloud point extraction of these metals, as their dithizonate complexes, into the surfactant-rich phase of octylphenoxypolyethoxyethanol surfactant (Triton X-114). Extractions were carried out in solutions with salinities between 10‰ and 70‰. Since residual salinity in the surfactant-rich phase caused differences in its transport to the plasma, yttrium was used as an internal standard to correct for this effect. The simultaneous metal extraction procedure was optimized by response surface methodology using a Doehlert design and desirability function. Enhancement factors of 21, 21, 9 and 19, along with limits of quantification of 0.093, 0.20, 0.73 and 1.2 μg L^− 1, and precision expressed as relative standard deviation (n = 8, 20.0 μg L^− 1) of 5.8, 1.2, 1.7 and 5.7% were obtained for Cd, Co, Mn and Cr, respectively. The accuracy was evaluated by spike recovery tests on the high salinity water samples with salinity of 40 and 63‰.     

干电池供电式电子标准电池的设计

标准电池是度量电源电动势的标准仪器．利用RC4191和MC1403精密的低压稳压特性，设计一款电子稳压式的标准电池，既可克服传统汞镉标准电池的缺点，又能保证相同精度的实验性能要求．     

强色指数的一个新的上界

给出了图的强色指数的一个新的上界，并指出几类恰好达到该上界的图，从而改进了Erodoes和Nesetri的强色指数猜想，在某种意义上证明了这个猜想。     

Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?     

Fully-angular polyhex chains with minimal total π-electron energy

By Hückel molecular orbital (HMO) theory, the calculation of the total energy of all π-electrons in conjugated hydrocarbons can be reduced to that of E(G)=|λ₁|+|λ₂|+?+|λn|, where λi are the eigenvalues of the corresponding graph G. Denote by Ψn the set of all fully-angular polyhex chains with n hexagons. In this paper, we show that Hn has the minimum total π-electron energy among chains in Ψn, where Hn is the helicene chain.     

Diameter graphs of polygons and the proof of a conjecture of Graham

We show that for an n-gon with unit diameter to have maximum area, its diameter graph must contain a cycle, and we derive an isodiametric theorem for such n-gons in terms of the length of the cycle. We then apply this theorem to prove Graham's 1975 conjecture that the diameter graph of a maximal 2m-gon (m?3) must be a cycle of length 2m−1 with one additional edge attached to it.     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

w-DENSITY AND w-BALANCED PROPERTY OF WEIGHTED GRAPHS

§ 1　IntroductionAll graphsconsidered in this paperare finite undirected ones withoutloops ormultipleedges.Our terminology and notation are standard exceptas indicated.A good reference forany undefined terms is[1 ] .Let G be a graph with vertex set V( G) and edge set E( G) .The density of G is definedbyd( G) =ε( G)ν( G) ,whereν( G) andε( G) denote| V( G) | and| E( G) | ,respectively.G is said to be balanced iffor each subgraph H of G we have d( H )≤ d( G) ,where V( H ) is assum…