手性铁催化体系在不对称催化中的应用研究

本文介绍了手性铁催化体系在酮及亚胺的不对称还原、烯烃及硫醚的不对称氧化、不对称环加成、不对称环丙烷化以及不对称Friedel-Crafts烷基化等反应中的应用.     

Ultrasonic‐assisted Synthesis of Fe Nanoparticles in the Presence of Poly(N‐vinyl‐2‐pyrrolidone)

Zero‐valent iron particles were prepared by wet reduction chemistry assisted with ultrasonic treatment. Such prepared particles have uniform size, exhibit crystalline structure and show strong paramagnetic property. Their surface modification by coating poly(N‐vinyl‐2‐pyrrolidone) (PVP) was investigated. The resulting Fe(0)‐PVP particles were monodispersed and possessed enhancing magnetization saturation. Those synthesis conditions to control the particle size and distribution were exploited.     

Magnetically Separable and Versatile Pd/Fe3O4 Catalyst for Efficient Suzuki Cross‐Coupling Reaction and Selective Hydrogenation of Nitroarenes

Magnetic nanoparticle‐supported Pd/Fe₃O₄ was readily prepared and proved to be versatile catalyst for efficient Suzuki cross‐coupling reaction, and the reduction of nitroarenes under mild conditions (balloon H₂ pressure and room temperature). The catalyst could be conveniently recovered and reused several times with sustained catalytic activity.     

锌-丙酸铵还原体系用于氢化偶氮苯的合成

选用锌粉和镁粉与不同饱和铵盐（草酸铵、丙酸铵和苯甲酸铵）水溶液组成还原体系,由偶氮苯制备氢化偶氮苯,根据反应时间及结果选取锌一饱和丙酸铵水溶液为最佳还原体系。在反应温度25℃时,研究了锌一饱和丙酸铵水溶液还原体系还原偶氮苯反应,考察了偶氮苯与锌粉物质的量比、饱和丙酸铵水溶液的用量对氢化偶氮苯收率的影响。实验结果表明：偶...     

Enhanced Electrocatalytic Performance of Anthraquinonemonosulfonate‐Doped Polypyrrole Composite: Electroanalysis for the Specific Roles of Anthraquinone Derivative and Polypyrrole Layer on Oxygen Reduction Reaction

To analyze the specific roles of anthraquinone‐2‐sulfonate (AQS) and polypyrrole (PPy) layer on oxygen reduction reaction (ORR), the electrocatalytic reduction of oxygen was investigated on the AQS/PPy composite modified graphite electrode. Results show that the enhanced electrocatalytic performance is attributed to the excellent electrocatalytic activity of the immobilized AQS functional groups to mediate two‐electron reduction of O₂ to H₂O₂. The PPy layer may not participate in ORR, but it can further catalyze the two‐electron reduction of H₂O₂ to produce H₂O in the potential range more negative than that the two‐electron reduction of oxygen proceeds efficiently on the AQS sites.     

Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints

We propose an efficient approach to the problem of multi-degree reduction of rectangular Bézier patches, with prescribed boundary control points. We observe that the solution can be given in terms of constrained bivariate dual Bernstein polynomials. The complexity of the method is O(mn₁n₂) with m ? min(m₁, m₂), where (n₁, n₂) and (m₁, m₂) is the degree of the input and output Bézier surface, respectively. If the approximation—with appropriate boundary constraints—is performed for each patch of several smoothly joined rectangular Bézier surfaces, the result is a composite surface of global C^r continuity with a prescribed r ? 0. In the detailed discussion, we restrict ourselves to r ∈ {0, 1}, which is the most important case in practical application. Some illustrative examples are given.     

Iterative process for G-multi degree reduction of Bézier curves

In this paper, the issue of multi-degree reduction of Bézier curves with C¹ and G²-continuity at the end points of the curve is considered. An iterative method, which is the first of this type, is derived. It is shown that this algorithm converges and can be applied iteratively to get the required accuracy. Some examples and figures are given to demonstrate the efficiency of this method.     

EXISTENCE OF PERIODIC SOLUTIONS FOR A DIFFERENTIAL INCLUSION SYSTEMS INVOLVING THE p（t）-LAPLACIAN

We study a nonlinear periodic problem driven by the p(t)-Laplacian and having a nonsmooth potential (hemivariational inequalities). Using a variational method based on nonsmooth critical point theory for locally Lipschitz functions, we first prove the existence of at least two nontrivial solutions under the generalized subquadratic and then establish the existence of at least one nontrivial solution under the generalized superquadratic.     

A relational perspective of attribute reduction in rough set-based data analysis

Attribute reduction is very important in rough set-based data analysis (RSDA) because it can be used to simplify the induced decision rules without reducing the classification accuracy. The notion of reduct plays a key role in rough set-based attribute reduction. In rough set theory, a reduct is generally defined as a minimal subset of attributes that can classify the same domain of objects as unambiguously as the original set of attributes. Nevertheless, from a relational perspective, RSDA relies on a kind of dependency principle. That is, the relationship between the class labels of a pair of objects depends on component-wise comparison of their condition attributes. The larger the number of condition attributes compared, the greater the probability that the dependency will hold. Thus, elimination of condition attributes may cause more object pairs to violate the dependency principle. Based on this observation, a reduct can be defined alternatively as a minimal subset of attributes that does not increase the number of objects violating the dependency principle. While the alternative definition coincides with the original one in ordinary RSDA, it is more easily generalized to cases of fuzzy RSDA and relational data analysis.     

DEA based dimensionality reduction for classification problems satisfying strict non-satiety assumption

This study shows how data envelopment analysis (DEA) can be used to reduce vertical dimensionality of certain data mining databases. The study illustrates basic concepts using a real-world graduate admissions decision task. It is well known that cost sensitive mixed integer programming (MIP) problems are NP-complete. This study shows that heuristic solutions for cost sensitive classification problems can be obtained by solving a simple goal programming problem by that reduces the vertical dimension of the original learning dataset. Using simulated datasets and a misclassification cost performance metric, the performance of proposed goal programming heuristic is compared with the extended DEA-discriminant analysis MIP approach. The holdout sample results of our experiments shows that the proposed heuristic approach outperforms the extended DEA-discriminant analysis MIP approach.