Het(aryl)isatin to het(aryl)aminoindoline scaffold hopping: A route to selective inhibitors of matrix metalloproteinases

Matrix metalloproteinases (MMPs) are a large family of zinc-dependent endoproteases known to exert multiple regulatory roles in tumor progression. A variety of chemical classes have been explored for targeting individual MMP isoforms. In the present study, we further developed our isatin based scaffold BB0223107 capable of binding to and inactivating MMP-2 in a zinc-independent manner (Agamennone et al., 2016). Forty four new compounds were synthesized based on the modified BB0223107. All compounds were tested in enzyme inhibition assays against MMP-2, ?8 and ?13. SAR studies demonstrated that 5-het(aryl)-3-aminoindolin-2-ones (37–39) were active toward MMP-2 and MMP-13. The most potent compounds 33 and 37 displayed an IC₅₀ of 3 µM against MMP-13 and showed a negligible activity toward MMP-8; almost all new compounds were inactive toward MMP-8. Replacement of the isatin ring with a biaryl system (compound 33) did not decrease the potency against MMP-13 but reduced the selectivity. Structure-based computational studies were carried out to rationalize the inhibitory activity data. The analysis of binding geometries confirmed that all fragments occupied the S1′ site in the three enzymes while no ligand was able to bind the catalytic zinc ion. To the best of our knowledge, this is the first example of 3-aminoindolin-2-one-based MMP inhibitors that, based on the computer modeling study, do not coordinate the zinc ion. Thus, the het(aryl)-3-aminoindolin-2-one derivatives emerge as a drug-like and promising chemotype that, along with the hetaryl variations, represents an alternative and thrifty tool for chemical space exploration aimed at MMP inhibitor design.     

Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

von Neumann’s trace inequality for Hilbert–Schmidt operators

von Neumann’s inequality in matrix theory refers to the fact that the Frobenius scalar product of two matrices is less than or equal to the scalar product of the respective singular values. Moreover, equality can only happen if the two matrices share a joint set of singular vectors, and this latter part is hard to find in the literature. We extend these facts to the separable Hilbert space setting, and provide a self-contained proof of the “latter part”.     

Molecular design of ambipolar redox-active molecules II: closed-shell systems

This mini-review highlights key structural features that should be taken into account when creating ambipolar redox-active closed-shell metal-free molecules. This type of compound is strongly required for the fabrication of all-organic ‘poleless’ batteries and semiconductors. The suggested strategies aimed at stabilization of both oxidized (cationic) and reduced (anionic) redox-states are based on the comprehensive analysis of the most successful structures taken from the recent publications.     

煤直接液化油中混合酚的分离研究

利用分子筛择形特点，对煤直接液化油中的混合酚实施高效分离。本研究选取间甲酚和对甲酚作为分离煤直接液化油馏分段混合酚的模型化合物，采用化学液相沉积法对HZSM-5吸附剂的孔口结构进行改变，分析分子筛硅铝比及颗粒粒径对模型化合物间甲酚和对甲酚吸附分离性能的影响，以获得高性能固相吸附剂，并将其应用于180-190℃馏分段混合酚分离。结果表明，当分子筛硅铝比为25、粒径为3-5 μm时，分子筛的孔口结构调节效果最优；当正硅酸乙酯的最小用量为0.2 mL/g时，固相吸附剂的吸附量为0.03 g/g，对甲酚选择性高于95%。由于外表面沉积物对吸附剂的孔口结构变化，导致对甲酚选择性的提高。进一步采用HZSM-5（1）吸附剂对真实煤直接液化油混合酚的分离中发现，苯酚和对甲酚的选择性均达到100%。     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.