Advanced kinetic tools for the evaluation of decomposition reactions

Summary An advanced kinetic study on the thermal behaviour of pyrotechnic ignition mixtures has been carried out by differential scanning calorimetry using different B/KNO3 mixtures (50:50, 30:70, 20:80) as a model reaction. The experimental conditions applied (isochoric conditions/closed crucibles and isobaric conditions/open crucibles) as well as the composition of the mixtures noticeably influences the relative thermal stabilities of the energetic materials. The kinetic study focused on the prediction of the thermal stability of the different mixtures both in extended temperature ranges and under temperature conditions at which ordinary investigation would be very difficult. Using advanced numerical tools [1], thermal ageing and influence of the complex thermal environment on the heat accumulation conditions were computed. This can be done for any surrounding temperature profile such as isothermal, non-isothermal, stepwise, modulated, shock, adiabatic conditions and additionally for temperature profiles reflecting real atmospheric temperature changes (yearly temperature profiles of different climates with daily minimal and maximal fluctuations). Applications of accurate decomposition kinetics enabled the determination of the time to maximum rate under adiabatic conditions (TMR_ad) with a precision given by the confidence interval of the predictions. This analysis can then be applied for the examination of the effects of the surrounding temperature for safe storage or transportation conditions (e.g. determination of the safe transport or storage temperatures).     

2-(8-羟基喹啉-5-磺酸-7-偶氮)-1,8-二羟基-3,6-萘二磺酸与牛血清白蛋白的相互作用

用平衡透析法和分光光度法研究了 2 (8 羟基喹啉 5 磺酸 7 偶氮 ) 1,8 二羟基 3,6 萘二磺酸与牛血清白蛋白 (BSA)在酸性溶液中的结合反应 ,认为 8Q5SAC与BSA之间的结合力是以静电引力为主的非共键作用力 ,并探讨了其结合模型。在 2 98K下 ,测得这一反应的最大结合数为 35～ 40 ,结合常数为 6 .1× 10 5L mol。还研究了溶液基本条件如酸度和离子强度等对 8Q5SAC与牛血清白蛋白分子复合物形成的影响 ,在pH =3.34条件下 ,标准工作曲线的线性范围为 0 .2 0～ 46 .90mg L。     

Performance of quantitative analyses by liquid chromatography–electrospray ionisation tandem mass spectrometry: from external calibration to isotopomer-based exact matching

Liquid chromatography–tandem mass spectrometry (LC-MS/MS) is a versatile coupling system which combines both selectivity and sensitivity and certainty. Hence, it is generally considered as the most reliable technique to quantify chemical compounds in complex matrices. In the present paper, we evaluate the performance of LC-MS/MS methods for the quantification of 3-nitrotyrosine in human urine in order to point out its dependence on the design of the quantification method, and emphasize the role of matrix effects in the performance. We compare external and internal calibrations, isotope dilution and isotopomer-based exact matching. The role of both sample preparation and multiple transitions monitoring is particularly addressed.     

排序集抽样下Inverse Rayleigh分布的Fisher信息量及其在参数估计中的应用

文章分别在简单随机抽样和排序集抽样下研究了Inverse Rayleigh分布中对应样本所含刻度参数θ的Fisher信息量.数值结果表示,同等样本容量的排序集样本比简单随机样本提供更多关于θ的信息.接着分别基于简单随机样本和排序集样本构造了θ的一些优良估计,并对估计结果进行了数值比较.     

On Schreier graphs of gyrogroup actions

The notion of a group action can be extended to the case of gyrogroups. In this article, we examine a digraph and graph associated with a gyrogroup action on a finite nonempty set, called a Schreier digraph and graph. We show that algebraic properties of gyrogroups and gyrogroup actions such as being gyrocommutative, being transitive, and being fixed-point-free are reflected in their Schreier digraphs and graphs. We also prove graph-theoretic versions of the three fundamental theorems involving actions: the Cauchy–Frobenius lemma (also known as the Burnside lemma), the orbit-stabilizer theorem, and the orbit decomposition theorem. Finally, we make a connection between gyrogroup actions and actions of symmetric groups by evaluation via Schreier digraphs and graphs.     

Large cycles in random generalized Johnson graphs

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.     

Two Hamiltonian cycles

If the line graph of a graph G decomposes into Hamiltonian cycles, what is G? We answer this question for decomposition into two cycles.     

The spum and sum-diameter of graphs: Labelings of sum graphs

A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph G is the minimum difference between the largest and smallest labels in a sum graph consisting of G and the minimum number of additional isolated vertices necessary so that a sum graph labeling exists. We investigate the spum of various families of graphs, namely cycles, paths, and matchings. We introduce the sum-diameter, a modification of the definition of spum that omits the requirement that the number of additional isolated vertices in the sum graph is minimal, which we believe is a more natural quantity to study. We then provide asymptotically tight general bounds on both sides for the sum-diameter, and study its behavior under numerous binary graph operations as well as vertex and edge operations. Finally, we generalize the sum-diameter to hypergraphs.     

Oriented hypergraphs: Balanceability

An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.     

An explicit characterization of cubic symmetric bi-Cayley graphs on nonabelian simple groups

One of the remarkable contributions in the study of symmetric Cayley graphs on nonabelian simple groups is the complete classification of such graphs that are cubic and nonnormal. This naturally motivates the study of cubic (normal and nonnormal) symmetric bi-Cayley graphs on nonabelian simple groups. In this paper, the full automorphism groups of these graphs are determined, and necessary and sufficient conditions are given for a graph being a cubic normal symmetric Cayley or bi-Cayley graph on a nonabelian simple group (one may then find many examples). As an application, we also prove that cubic symmetric Cayley graphs on nonabelian simple groups are stable.