Lorentz-Compton佯谬与一个双赢判决性散射实验设计

通过对“可见光区域是否存在Compton效应”的讨论而进一步深化到经典条件下“光的量子理论能否包含光的经典电磁理论”的实验验证,发现了Lorentz-Compton佯谬,并基于逆Compton散射设计了一个敏感而又可行的双赢判决性散射实验来解决此佯谬。     

Review and complements on mixed-hybrid finite element methods for fluid flows

Mixed and hybrid finite element methods for the resolution of a wide range of linear and nonlinear boundary value problems (linear elasticity, Stokes problem, Navier–Stokes equations, Boussinesq equations, etc.) have known a great development in the last few years. These methods allow simultaneous computation of the original variable and its gradient, both of them being equally accurate. Moreover, they have local conservation properties (conservation of the mass and the momentum) as in the finite volume methods.The purpose of this paper is to give a review on some mixed finite elements developed recently for the resolution of Stokes and Navier–Stokes equations, and the linear elasticity problem. Further developments for a quasi-Newtonian flow obeying the power law are presented.     

条形装箱问题的优化模型和增广Lagrange算法

This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches.     

Necessary and sufficient conditions in constrained optimization

Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.     

Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings

Recently, S. Reich and S. Simons provided a novel proof of the Kirszbraun-Valentine extension theorem using Fenchel duality and Fitzpatrick functions. In the same spirit, we provide a new proof of an extension result for firmly nonexpansive mappings with an optimally localized range.

     

Kuhn-Tucker条件与线性规划的对偶性

证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.     

Ekeland’s principle for vector equilibrium problems

In this paper, the authors deal with bifunctions defined on complete metric spaces and with values in locally convex spaces ordered by closed convex cones. The aim is to provide a vector version of Ekeland’s theorem related to equilibrium problems. To prove this principle, a weak notion of continuity of a vector-valued function is considered, and some of its properties are presented. Via the vector Ekeland’s principle, existence results for vector equilibria are proved in both compact and noncompact domains.     

极大单调算子和m增生映射值域的扰动定理及在非线性微分方程上的应用

利用不动点定理,分别证明了在自反Banach空间中极大单调算子值域扰动的抽象结论和在H ilbert空间中m增生映射值域的扰动结果,这些结论是对以往一些工作的推广;然后,利用文中的新结论讨论了一类微分方程解的存在性.     

Three-body problem in the theory of the dielectric constant

We study the corrections to the Clausius-Mossotti formula for the dielectric constant of a disordered system of polarizable spherical particles. Previously we have derived an exact cluster expansion for the correction terms. Here we study the three-body correction in detail. We derive an explicit expression for the integrand of the three-body cluster integral for a system of polarizable point dipoles.     

FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.