席夫碱结构对Cu缓蚀作用的影响

用自组装技术使席夫碱在Cu表面自组装成膜,用扫描电子显微镜(SEM)、交流阻抗方法及量子化学法研究了席夫碱结构对Cu缓蚀作用的影响.结果表明:席夫碱类化合物在发挥其活性时应以接受电子为主,此类化合物的亚胺或甲亚胺特性基团(-RC=N-)和苯环上的-OH是该类化合物的主要活性区,席夫碱苯环的-H被给电子基团取代会提高对Cu的缓蚀效率,且取代基团越靠进-C=N-,形成的螯合物越稳定,缓蚀效率越高.     

软件类专业校企合作共建实训基地研究

从国家发展时工程型人才需求出发,分析了工程应用型人才培养的必要性,以及校企共建实训基地在工程应用型人才培养方面所起的作用.结合高校软件类专业工程应用型人才培养的现状、特点和要求,以及软件类专业实训基地的特点,提出了当前软件类专业校企合作实训基地的模式,探讨了建立校企合作实训基地必须要考虑和解决的问题.     

A Polymer Defect Passivator for Efficient Hole-Conductor-Free Printable Mesoscopic Perovskite Solar Cells

Due to the low cost and excellent potential for mass production, printable mesoscopic perovskite solar cells (p-MPSCs) have drawn a lot of attention among other device structures. However, the low open-circuit voltage (V_OC) of such devices restricts their power conversion efficiency (PCE). This limitation is brought by the high defect density at perovskite grain boundaries in the mesoporous scaffold, which results in severe nonradiative recombination and is detrimental to the V_OC. To improve the perovskite crystallization process, passivate the perovskite defects, and enhance the PCE, additive engineering is an effective way. Herein, a polymeric Lewis base polysuccinimide (PSI) is added to the perovskite precursor solution as an additive. It improves the perovskite crystallinity and its carbonyl groups strongly coordinate with Pb²⁺, which can effectively passivate defects. Additionally, compared with its monomer, succinimide (SI), PSI serves as a better defect passivator because the long-chained macromolecule can be firmly anchored on those defect sites and form a stronger interaction with perovskite grains. As a result, the champion device has a PCE of 18.84%, and the V_OC rises from 973 to 1030 mV. This study offers a new strategy for fabricating efficient p-MPSCs.     

Connecting the 3D DGS Calques3D with the CAS Maple

Many (2D) Dynamic Geometry Systems (DGSs) are able to export numeric coordinates and equations with numeric coefficients to Computer Algebra Systems (CASs). Moreover, different approaches and systems that link (2D) DGSs with CASs, so that symbolic coordinates and equations with symbolic coefficients can be exported from the DGS to the CAS, already exist. Although the 3D DGS Calques3D can export numeric coordinates and equations with numeric coefficients to Maple and Mathematica, it cannot export symbolic coordinates and equations with symbolic coefficients. A connection between the 3D DGS Calques3D and the CAS Maple, that can handle symbolic coordinates and equations with symbolic coefficients, is presented here. Its main interest is to provide a convenient time-saving way to explore problems and directly obtain both algebraic and numeric data when dealing with a 3D extension of “ruler and compass geometry”. This link has not only educational purposes but mathematical ones, like mechanical theorem proving in geometry, geometric discovery (hypotheses completion), geometric loci finding… As far as we know, there is no comparable “symbolic” link in the 3D case, except the prototype 3D-LD (restricted to determining algebraic surfaces as geometric loci).     

On properties not inherited by monoids from their Schützenberger groups

We give an example of a monoid with finitely many left and right ideals, all of whose Schützenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does not have finite derivation type, and therefore does not admit a presentation by a finite complete rewriting system. The example also serves as a counterexample to several other natural questions regarding complete rewriting systems and finite derivation type. Specifically it allows us to construct two finitely generated monoids M and N with isometric Cayley graphs, where N has finite derivation type (respectively, admits a presentation by a finite complete rewriting system) but M does not. This contrasts with the case of finitely generated groups for which finite derivation type is known to be a quasi-isometry invariant. The same example is also used to show that neither of these two properties is preserved under finite Green index extensions.     

Some algebraic methods for solving multiobjective polynomial integer programs

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the past few years. However, the polynomial case has not been studied in detail due to its theoretical and computational difficulties. This paper presents an algebraic approach for solving these problems. We propose a methodology based on transforming the polynomial optimization problem to the problem of solving one or more systems of polynomial equations and we use certain Gröbner bases to solve these systems. Different transformations give different methodologies that are theoretically stated and compared by some computational tests via the algorithms that they induce.     

On the decoding of binary cyclic codes with the Newton identities

We revisit in this paper the concept of decoding binary cyclic codes with Gröbner bases. These ideas were first introduced by Cooper, then Chen, Reed, Helleseth and Truong, and eventually by Orsini and Sala. We discuss here another way of putting the decoding problem into equations: the Newton identities. Although these identities have been extensively used for decoding, the work was done manually, to provide formulas for the coefficients of the locator polynomial. This was achieved by Reed, Chen, Truong and others in a long series of papers, for decoding quadratic residue codes, on a case-by-case basis. It is tempting to automate these computations, using elimination theory and Gröbner bases.Thus, we study in this paper the properties of the system defined by the Newton identities, for decoding binary cyclic codes. This is done in two steps, first we prove some facts about the variety associated with this system, then we prove that the ideal itself contains relevant equations for decoding, which lead to formulas.Then we consider the so-called online Gröbner basis decoding, where the work of computing a Gröbner basis is done for each received word. It is much more efficient for practical purposes than preprocessing and substituting into the formulas. Finally, we conclude with some computational results, for codes of interesting length (about one hundred).     

Fuzzy functions with LSE

“Fuzzy Functions” are proposed to be determined by the least squares estimation (LSE) technique for the development of fuzzy system models. These functions, “Fuzzy Functions with LSE” are proposed as alternate representation and reasoning schemas to the fuzzy rule base approaches. These “Fuzzy Functions” can be more easily obtained and implemented by those who are not familiar with an in-depth knowledge of fuzzy theory. Working knowledge of a fuzzy clustering algorithm such as FCM or its variations would be sufficient to obtain membership values of input vectors. The membership values together with scalar input variables are then used by the LSE technique to determine “Fuzzy Functions” for each cluster identified by FCM. These functions are different from “Fuzzy Rule Base” approaches as well as “Fuzzy Regression” approaches. Various transformations of the membership values are included as new variables in addition to original selected scalar input variables; and at times, a logistic transformation of non-scalar original selected input variables may also be included as a new variable. A comparison of “Fuzzy Functions-LSE” with Ordinary Least Squares Estimation (OLSE)” approach show that “Fuzzy Function-LSE” provide better results in the order of 10% or better with respect to RMSE measure for both training and test cases of data sets.     

Balancing Misclassification Rates in Classification-Tree Models of Software Quality

Software product and process metrics can be useful predictorsof which modules are likely to have faults during operations.Developers and managers can use such predictions by softwarequality models to focus enhancement efforts before release.However, in practice, software quality modeling methods in theliterature may not produce a useful balance between the two kindsof misclassification rates, especially when there are few faultymodules.This paper presents a practical classificationrule in the context of classification tree models that allowsappropriate emphasis on each type of misclassification accordingto the needs of the project. This is especially important whenthe faulty modules are rare.An industrial case study using classification trees, illustrates the tradeoffs.The trees were built using the TREEDISC algorithm whichis a refinement of the CHAID algorithm. We examinedtwo releases of a very large telecommunications system, and builtmodels suited to two points in the development life cycle: theend of coding and the end of beta testing. Both trees had onlyfive significant predictors, out of 28 and 42 candidates, respectively.We interpreted the structure of the classification trees, andwe found the models had useful accuracy.