缩酮席夫碱类阴离子识别的量子化学研究

缩酮席夫碱是良好的阴离子识别剂,利用量子化学密度泛函理论研究了3种缩酮席夫碱阴离子受体与阴离子客体相结合的空间结构、电荷分布、结合能等方面的变化,计算结果表明,阴离子受体分子的阴离子结合位点位于亚氨基-NH-部,受体分子和阴离子间通过氢键相互作用,阴离子有一部分负电荷转移到受体分子中,且转移的电荷量为R3-3 R3-2 R3-1,在考察的阴离子中,F~-与受体分子的结合能最大,而在3种受体分子中,R3-3对阴离子结合能最大.计算模拟结果,与实验情况相吻合.     

An efficient approach to isoquinoline via AgNO3-promoted 6-endo-dig cyclization followed by oxidative elimination of o-alkynylarylaldimines and its application in fluoride recognition

A novel 6-endo-dig cyclization followed by oxidation/elimination of o-alkynylarylaldimines with 4-hydroxybenzylamine was developed for preparation of isoquinolines. The intermediates of this tandem reaction were monitored by mass spectroscopy (MS) to confirm the reaction pathway. This methodology was further applied to the design and synthesis of a novel ratiometric chemosensor for determination of fluoride.     

基于视觉辐条图案识别方法的蓝宝石引晶机制研究

工业生产蓝宝石晶体过程中,引晶步骤有着至关重要的地位。引晶必须在温度梯度较小,温度分布趋于稳定的条件下进行。目前,工业生产蓝宝石主要依靠人工经验操控籽晶杆实现引晶操作,但是人工引晶操作的准确性不高会导致成品品质不佳、资源浪费。为此,本文提出一种基于蓝宝石视觉辐条图案识别方法来检测蓝宝石熔体状态自由液面状态,从而实现一种高效率引晶的机制。此方法利用经典骨架化算法细化辐条图案,Harris算子实现特征信息的提取,提取的特征信息放入运动轨迹模型中判断熔体稳定性,分析液面温度分布稳定性从而实现引晶。结果表明,此算法具有有效性,蓝宝石晶体引晶效率大大提高,生产出的成品良率也有提升,可有效指导蓝宝石的工业生产。     

High-fidelity Recognition of Organotrifluoroborate Anions (R−BF3−) as Designer Guest Molecules

The recognition of boron compounds is well developed as boronic acids but untapped as organotrifluoroborate anions (R−BF₃⁻). We are exploring the development of these and other designer anions as anion-recognition motifs by considering them as substituted versions of the parent inorganic ion. To this end, we demonstrate strong and reliable binding of organic trifluoroborates, R−BF₃⁻, by cyanostar macrocycles that are size-complementary to the inorganic BF₄⁻ progenitors. We find that recognition is modulated by the substituent's sterics and that the affinities are retained using the common K⁺ salts of R−BF₃⁻ anions.     

A Bait-and-Switch Method for the Construction of Artificial Esterases for Substrate-Selective Hydrolysis

Outcomes of chemical reactions are generally dominated by the intrinsic reactivities of reaction partners, but enzymes frequently override such constraints to transform less reactive molecules in the presence of more reactive ones. Despite the attractiveness of such catalysis, it is difficult to build synthetic catalysts with these features. Micellar imprinting is a powerful method to create template-complementary binding sites inside protein-sized water-soluble nanoparticles. When a photocleavable functional monomer was used to bind two phosphonate/phosphate templates as transition-state analogues, active sites with predetermined size and shape were formed inside doubly cross-linked micelles through molecular imprinting. Postmodification replaced the binding group with a catalytic pyridyl group, forming highly selective artificial esterases. The catalysts displayed enzyme-like kinetics and turnover numbers that were in the hundreds. The selectivity of the catalysts, derived from the substrate-complementary imprinted active sites, enabled transformation of less reactive esters in the presence of more reactive ones.     

A Self-Assembled Cage with Endohedral Acid Groups both Catalyzes Substitution Reactions and Controls Their Molecularity

A self-assembled Fe₄L₆ cage complex internally decorated with acid functions is capable of accelerating the thioetherification of activated alcohols, ethers and amines by up to 1000-fold. No product inhibition is seen, and effective supramolecular catalysis can occur with as little as 5 % cage. The substrates are bound in the host with up to micromolar affinities, whereas the products show binding that is an order of magnitude weaker. Most importantly, the cage host alters the molecularity of the reaction: whereas the reaction catalyzed by simple acids is a unimolecular, S_N1-type substitution process, the rate of the host-mediated process is dependent on the concentration of nucleophile. The molecularity of the cage-catalyzed reaction is substrate-dependent, and can be up to bimolecular. In addition, the catalysis can be prevented by a large excess of nucleophile, where substrate inhibition dominates, and the use of tritylated anilines as substrates causes a negative feedback loop, whereby the liberated product destroys the catalyst and stops the reaction.     

连续音素的改进深信度网络的识别算法*

为提高连续语音识别中的音素识别率,提出一种基于改进并行回火训练的受限波尔兹曼机的音素识别算法。首先,利用经过等能量划分后的改进并行回火算法来训练受限玻尔兹曼机,接着将受限玻尔兹曼机堆叠组成一个深信度网络,从而作为深度神经网络预训练的基础模型,然后通过softmax层输出,得到用于音素状态后验概率检测的深度神经网络。接着,利用少量的标签数据,根据反向传播算法对网络权重进行微调。最后,将所得后验概率作为隐马尔科夫的发射概率,然后利用Viterbi解码器实现音素识别。在TIMIT语料库上的实验表明,识别率相比于传统的对比散度类算法提高了约4.5%,在不增加计算量的情况下比原始并行回火算法提高约1%。     

The Plasticity of the Carbohydrate Recognition Domain Dictates the Exquisite Mechanism of Binding of Human Macrophage Galactose-Type Lectin

The human macrophage galactose-type lectin (MGL), expressed on macrophages and dendritic cells (DCs), modulates distinct immune cell responses by recognizing N-acetylgalactosamine (GalNAc) containing structures present on pathogens, self-glycoproteins, and tumor cells. Herein, NMR spectroscopy and molecular dynamics (MD) simulations were used to investigate the structural preferences of MGL against different GalNAc-containing structures derived from the blood group A antigen, the Forssman antigen, and the GM2 glycolipid. NMR spectroscopic analysis of the MGL carbohydrate recognition domain (MGL-CRD, C181-H316) in the absence and presence of methyl α-GalNAc (α-MeGalNAc), a simple monosaccharide, shows that the MGL-CRD is highly dynamic and its structure is strongly altered upon ligand binding. This plasticity of the MGL-CRD structure explains the ability of MGL to accommodate different GalNAc-containing molecules. However, key differences are observed in the recognition process depending on whether the GalNAc is part of the blood group A antigen, the Forssman antigen, or GM2-derived structures. These results are in accordance with molecular dynamics simulations that suggest the existence of a distinct MGL binding mechanism depending on the context of GalNAc moiety presentation. These results afford new perspectives for the rational design of GalNAc modifications that fine tune MGL immune responses in distinct biological contexts, especially in malignancy.     

Tunable Orthogonal Reversible Covalent (TORC) Bonds: Dynamic Chemical Control over Molecular Assembly

Dynamic assembly of macromolecules in biological systems is one of the fundamental processes that facilitates life. Although such assembly most commonly uses noncovalent interactions, a set of dynamic reactions involving reversible covalent bonding is actively being exploited for the design of functional materials, bottom‐up assembly, and molecular machines. This Minireview highlights recent implementations and advancements in the area of tunable orthogonal reversible covalent (TORC) bonds for these purposes, and provides an outlook for their expansion, including the development of synthetically encoded polynucleotide mimics.     

Bounds on the length of a game of Cops and Robbers

In the game of Cops and Robbers, a team of cops attempts to capture a robber on a graph $G$. All players occupy vertices of $G$. The game operates in rounds; in each round the cops move to neighboring vertices, after which the robber does the same. The minimum number of cops needed to guarantee capture of a robber on $G$ is the cop number of $G$, denoted $c\left(G\right)$, and the minimum number of rounds needed for them to do so is the capture time. It has long been known that the capture time of an $n$-vertex graph with cop number $k$ is $O\left(n^{k+1}\right)$. More recently, Bonato et al. (2009) and Gaven?iak (2010) showed that for $k=1$, this upper bound is not asymptotically tight: for graphs with cop number 1, the cop can always win within $n?4$ rounds. In this paper, we show that the upper bound is tight when $k\ge 2$: for fixed $k\ge 2$, we construct arbitrarily large graphs $G$ having capture time at least ${\left(\frac{\left|V\left(G\right)\right|}{40k^4}\right)}^{k+1}$.In the process of proving our main result, we establish results that may be of independent interest. In particular, we show that the problem of deciding whether $k$ cops can capture a robber on a directed graph is polynomial-time equivalent to deciding whether $k$ cops can capture a robber on an undirected graph. As a corollary of this fact, we obtain a relatively short proof of a major conjecture of Goldstein and Reingold (1995), which was recently proved through other means (Kinnersley, 2015). We also show that $n$-vertex strongly-connected directed graphs with cop number 1 can have capture time $\Omega \left(n^2\right)$, thereby showing that the result of Bonato et al. (2009) does not extend to the directed setting.