19F NMR chemical shifts of n-F-alkyl compounds

The examination of ¹⁹F chemical shifts for ca. 650 F-alkylated compounds of general formula CF₃(CF₂)_nCF₂X led to the following conclusions: the CF₂ groups α to X are very sensitive to the nature of X, and are spread over a range of 85 ppm. The effect of the length of the F-alkyl chain decreases rapidly, so that δCF₂(α) can already be considered as characteristic of X for n = 1 or 2 for most practical purposes. Solvent effects (in 9 different solvents having ε = 1.8 to 52.1) were found to be rather small except for the F-alkyl iodides. A chart which indicates the domain in which the CF₂(α) resonance signal is to be expected is given for 42 different series of F-alkylated compounds; it is expected to provide the synthetic chemist with a useful tool for the identification and characterization of such compounds.     

Application of co-eluting structural analog internal standards for expanded linear dynamic range in liquid chromatography/electrospray mass spectrometry

Non-linear standard calibration curves occur frequently in liquid chromatography/electrospray ionization mass spectrometry (LC/ESI-MS), necessitating the use of non-linear regression curve fitting or a reduction in assay dynamic range. Non-linearity can be minimized by the use of stable isotope internal standards, if the cause of curve bending is ionization saturation. Unfortunately, stable isotope internal standards can be difficult or expensive to synthesize. Structural analog internal standards, if sufficiently close to analytes both in chemical structures and HPLC retention times, may mimic the effect of stable isotope internal standards. Tentative experimental evidence supporting this concept is presented in this paper.     

用凝胶色谱法测定聚N-乙烯咔唑中残留单体含量

本文用 GPC方法测定了聚 N-乙烯咔唑中残留单体含量,测定精确度约为±2％,聚合物中单体的最小检知量为0.03％。并且讨论了凝胶的孔径、溶剂纯度及不同检测器对结果的影响。     

某些子群介于正规与反正规之间的有限群北大核心CSCD

有限群G的子群H称为G的BNA子群,若对任意的x∈G有H^(x)=H或x∈.若有限群G的所有素数阶和4阶循环子群都是G的BNA子群,则称G为CBNA群.本文主要刻画CBNA群的结构,并且给出所有真子群都是CBNA群的完全分类.     

Quantifying uncertainty with ensembles of surrogates for blackbox optimization

Blackbox optimization tackles problems where the functions are expensive to evaluate and where no analytical information is available. In this context, a tried and tested technique is to build surrogates of the objective and the constraints in order to conduct the optimization at a cheaper computational cost. This work introduces an extension to a specific type of surrogates: ensembles of surrogates, enabling them to quantify the uncertainty on the predictions they produce. The resulting extended ensembles of surrogates behave as stochastic models and allow the use of efficient Bayesian optimization tools. The method is incorporated in the search step of the mesh adaptive direct search (MADS) algorithm to improve the exploration of the search space. Computational experiments are conducted on seven analytical problems, two multi-disciplinary optimization problems and two simulation problems. The results show that the proposed approach solves expensive simulation-based problems at a greater precision and with a lower computational effort than stochastic models.

     

Hypergraph Turán Numbers of Vertex Disjoint Cycles

The Turán number of a k-uniform hypergraph H,denoted by ex_k(n;H),is the maximum number of edges in any k-uniform hypergraph F on n vertices which does not contain H as a subgraph.Let C_l~((k)) denote the family of all k-uniform minimal cycles of length l;S(?₁,…,?_r) denote the family of hypergraphs consisting of unions of r vertex disjoint minimal cycles of length ?₁,…?_r,respectively,and C_l~((k))denote a k-uniform linear ...     

A Tail Measure With Variable Risk Tolerance: Application in Dynamic Portfolio Insurance Strategy

Methodology and Computing in Applied Probability - Risk measures for tail risk have an important application in the dynamic portfolio insurance strategies. We propose a new risk measure called...     

Robust Group Synchronization via Cycle-Edge Message Passing

We propose a general framework for solving the group synchronization problem, where we focus on the setting of adversarial or uniform corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of group ratios and consequently solve the synchronization problem in our setting. We first explain why the group cycle consistency information is essential for effectively solving group synchronization problems. We then establish exact recovery and linear convergence guarantees for the proposed message passing procedure under a deterministic setting with adversarial corruption. These guarantees hold as long as the ratio of corrupted cycles per edge is bounded by a reasonable constant. We also establish the stability of the proposed procedure to sub-Gaussian noise. We further establish exact recovery with high probability under a common uniform corruption model.