史华慈中国思想史研究中的“非化约”论及其当下意义

在20世纪的思想史和中国学研究领域,本杰明.史华慈素以其思想的深邃性和思考的前瞻性而深受学术界称道。他对中国思想"非化约"特性的研究,不仅凸显了其思想史研究在整个学术史上的方法论意义,同时为进一步反思中国传统思想在全球化语境下的现代价值及其转化问题具有重要的参考意义。

漆酶-ABTS介体体系活化木质素磺酸铵制备环保型纤维板及其性能表征

以木纤维为基体,漆酶-ABTS介体体系活化后的木质素磺酸铵(Lac+ABTS/ML)为黏结剂制备环保型纤维板(Lac+ABTS/MLF),利用傅里叶变换红外光谱(FT-IR)、紫外可见分光光度计(UV)、X射线衍射仪(XRD)和热重分析仪(TGA)分别分析材料的化学组分、酚羟基质量分数、结晶度和热稳定性;并通过单因素试验对漆酶用量、介体用量和活化时间3个工艺参数进行优化。结果表明,最佳的工艺参数为漆酶添加量为20 U/g、介体添加量为0.3%和活化时间为60 min,在此工艺下制备的纤维板的物理力学性能均已达到GB/T 11718—2009中干燥状态下使用的普通型中密度纤维板性能要求。

On reducibility of a class of nonlinear quasi-periodic systems with small perturbational parameters near equilibrium

Consider the reducibility of a class of nonlinear quasi-periodic systems with multiple eigenvalues under perturbational hypothesis in the neighborhood of equilibrium. That is, consider the following system x = （A ＋ εQ（ t） ）x ＋ eg（t） ＋ h（x, t）, where A is a constant matrix with multiple eigenvalues; h = O（x2） （x-4）） ; and h（x, t）, Q（t）, and g（t） are analytic quasi-periodic with respect to t with the same frequencies. Under suitable hypotheses of non-resonance conditions and non-degeneracy conditions, for most sufficiently small ε, the system can be reducible to a nonlinear quasi-periodic system with an equilibrium point by means of a quasi-periodic transformation.

Feasible SQP Descent Method for Inequality Constrained Optimization Problems and Its Convergence

In this paper,the new SQP feasible descent algorithm for nonlinear constrained optimization problems presented,and under weaker conditions of relative,we proofed the new method still possesses global convergence and its strong convergence.The numerical results illustrate that the new methods are valid.

Nonequivalent Similarity Reductions and Exact Solutions for Coupled Burgers-Type Equations

Using the machinery of Lie group analysis,the nonlinear system of coupled Burgers-type equations is studied.Using the infinitesimal generators in the optimal system of subalgebra of the said Lie algebras,it leads to two nonequivalent similarity transformations by using it we obtain two reductions in the form of system of nonlinear ordinary differential equations.The search for solutions of these systems by using the G'/G-method has yielded certain exact solutions expressed by rational functions,hyperbolic functions,and trigonometric functions.Some figures are given to show the properties of the solutions.

An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization (Ⅰ) Problems Without Path Constraints

This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.

A Trust-region Algorithm for Nonlinear Constrained Optimization Problem

This paper presents a new trust-region algorithm for general nonlinear constrained optimization problems. Certain equivalent KKT conditions of the problems are derived. Global convergence of the algorithm to a first-order KKT point is established under mild conditions on the trial steps. Numerical example is also reported.

A TRUST REGION ALGORITHM WITH NULL SPACE TECHNIQUE FOR EQUALITY CONSTRAINED OPTIMIZATION

This paper presents a trust region algorithm with null space technique fornonlinear equality constrained optimization. Considering in the null space methods that,the convergent rate of range space step is faster than the null space step for the most cases,the proposed algorithm computes null steps more often than range space step. Moreover,the new algorithm is based on the reduced Hessian SQP method. Global convergence ofthe proposed algorithm is proved. The effectiveness of the method is demonstrated bysome numerical examples.

A LINE SEARCH FILTER SECANT METHOD FOR NONLINEAR EQUALITY CONSTRAINED OPTIMIZATION

This paper formulates and analyzes a line search method for general nonlinear equalityconstrained optimization based on filter methods for step acceptance and secant methods for searchdirection.The feature of the new algorithm is that the secant algorithm is used to produce a searchdirection,a backtracking line search procedure is used to generate step size,some filtered rules areused to determine step acceptance,second order correction technique is used to reduce infeasibility andovercome the Maratos effect.Global convergence properties of this method are analyzed:under mildassumptions it is showed that every limit point of the sequence of iterates generated by the algorithmis feasible,and that there exists at least one limit point that is a stationary point for the problem.Moreover,it is also established that the Maratos effect can be overcome in our new approach by addingsecond order correction steps so that fast local superlinear convergence to a second order sufficient localsolution is achieved.Finally,the results of numerical experiments are reported to show the effectivenessof the line search filter secant method.

Global signatures of protein binding on structured RNAs in Saccharomyces cerevisiae

Protein binding is essential to the transport,decay and regulation of almost all RNA molecules.However,the structural preference of protein binding on RNAs and their cellular functions and dynamics upon changing environmental conditions are poorly understood.Here,we integrated various high-throughput data and introduced a computational framework to describe the global interactions between RNA binding proteins(RBPs)and structured RNAs in yeast at single-nucleotide resolution.We found that on average,in terms of percent total lengths,~15%of mRNA untranslated regions(UTRs),~37%of canonical non-coding RNAs(ncRNAs)and^11%of long ncRNAs(lncRNAs)are bound by proteins.The RBP binding sites,in general,tend to occur at single-stranded loops,with evolutionarily conserved signatures,and often facilitate a specific RNA structure conformation in vivo.We found that four nucleotide modifications of tRNA are significantly associated with RBP binding.We also identified various structural motifs bound by RBPs in the UTRs of mRNAs,associated with localization,degradation and stress responses.Moreover,we identified>200 novel lncRNAs bound by RBPs,and about half of them contain conserved secondary structures.We present the first ensemble pattern of RBP binding sites in the structured non-coding regions of a eukaryotic genome,emphasizing their structural context and cellular functions.

A Dwindling Filter Algorithm with a Modified Subproblem for Nonlinear Inequality Constrained Optimization

The authors propose a dwindling filter algorithm with Zhou's modified subproblem for nonlinear inequality constrained optimization.The feasibility restoration phase,which is always used in the traditional filter method,is not needed.Under mild conditions,global convergence and local superlinear convergence rates are obtained.Numerical results demonstrate that the new algorithm is effective.

An Integrated Quantitative Method to Simultaneously Monitor Soil Erosion and Non-Point Source Pollution in an Intensive Agricultural Area

In China, some areas with intensive agricultural use are facing serious environmental problems caused by non-point source pollution(NPSP) as a consequence of soil erosion(SE). Until now, simultaneous monitoring of NPSP and SE is difficult due to the intertwined effects of crop type, topography and management in these areas. In this study, we developed a new integrated method to simultaneously monitor SE and NPSP in an intensive agricultural area(about 6 000 km2) of Nanjing in eastern China, based on meteorological data,a geographic information system database and soil and water samples, and identified the main factors contributing to NPSP and SE by calculating the NPSP and SE loads in different sub-areas. The levels of soil total nitrogen(TN), total phosphorus(TP), available nitrogen(AN) and available phosphorus(AP) could be used to assess and predict the extent of NPSP and SE status in the study area.The most SE and NPSP loads occurred between April to August. The most seriously affected area in terms of SE and NPSP was the Jiangning District, implying that the effective management of SE and NPSP in this area should be considered as a priority. The sub-regions with higher vegetation coverage contributed to less SE and NPSP, confirming the conclusions of previous studies, namely that vegetation is an effective factor controlling SE and NPSP. Our quantitative method has both high precision and reliability for the simultaneous monitoring of SE and NPSP occurring in intensive agricultural areas.

A Dwindling Filter Line Search Algorithm for Nonlinear Equality Constrained Optimization

This paper proposes a dwindling filter line search algorithm for nonlinear equality constrained optimization. A dwindling filter, which is a modification of the traditional filter, is employed in the algorithm. The envelope of the dwindling filter becomes thinner and thinner as the step size approaches zero. This new algorithm has more flexibility for the acceptance of the trial step and requires less computational costs compared with traditional filter algorithm. The global and local convergence of the proposed algorithm are given under some reasonable conditions. The numerical experiments are reported to show the effectiveness of the dwindling filter algorithm.

A NEWε-GENERALIZED PROJECTION METHOD OF STRONGLY SUB-FEASIBLE DIRECTIONS FOR INEQUALITY CONSTRAINED OPTIMIZATION

In this paper, the nonlinear optimization problems with inequality constraints are discussed. Combining the ideas of the strongly sub-feasible directions method and the s-generalized projection technique, a new algorithm starting with an arbitrary initial iteration point for the discussed problems is presented. At each iteration, the search direction is generated by a new s-generalized projection explicit formula, and the step length is yielded by a new Armijo line search. Under some necessary assumptions, not only the algorithm possesses global and strong convergence, but also the iterative points always get into the feasible set after finite iterations. Finally, some preliminary numerical results are reported.

A FILTER SECANT METHOD WITH NONMONOTONE LINE SEARCH FOR EQUALITY CONSTRAINED OPTIMIZATION

This paper proposes a filter secant method with nonmonotone line search for non-linearequality constrained optimization.The Hessian of the Lagrangian is approximated using the BFGSsecant update.This new method has more flexibility for the acceptance of the trial step and requires lesscomputational costs compared with the monotone one.The global and local convergence of the proposedmethod are given under some reasonable conditions.Further,two-step Q-superlinear convergence rateis established by introducing second order correction step.The numerical experiments are reported toshow the effectiveness of the proposed algorithm.