WO3 thermodynamic properties at 80–1256 K revisited

Journal of Thermal Analysis and Calorimetry - Thermodynamic properties (heat capacity Cp, entropy S°, enthalpy change ΔH° and reduced Gibbs energy ΔΦ°) of crystalline...     

诺贝尔物理学奖与长度基准的历史沿革

从2005年诺贝尔物理学奖出发,考察了已往和长度基准有关的诺贝尔物理学奖,从物理学史的角度．探讨了长度基准的历史沿革及其意义．     

具有模糊变量的线性规划问题

讨论含模糊变量的线性规划问题，研究了其求解方法。利用新定义的模糊数序关系，将它转换成一个多目标线性规划问题，然后进一步转换成两层多目标线性规划问题，进而利用分层规划法求解。     

半导体可饱和吸收镜实现固体激光器皮秒锁模的机理研究

对半导体可饱和吸收镜(SESAM)实现固体激光器皮秒锁模的机理进行了研究。通过对染料锁模介质和SESAM的结构对比,对SESAM皮秒锁模机理提出了一个新的解释。其在锁模激光器中充当锁模器件时,不仅仅是一个吸收体,同时也是一个增益介质。当腔内增益和损耗保持平衡时实现稳定的连续锁模。     

The structure and expression of power group

With the application of the topological upgrade, more and more experts are interested in the problems concerning the mathematical structure’s upgrade to its power set. This paper is a further study on the structure and interrelationship of a power group. By revealing the nature of relationship between the power group and a regular one, the present paper proves some theorems of the structure of the power group and constructs some theorems on its homomorphism and isomorphism as well, proposing an expression form and isomorphism replacement construct methods of the power group.     

Similarity mass and approximate reasoning

It can reflect the nature of approximate reasoning and meet more application expectations to design the approximate reasoning matching schemes and the corresponding algorithms with similarity relation Q instead of equivalence relation R. In this paper, based on similarity relation Q, we introduce type V matching scheme and corresponding approximate reasoning type V Q-algorithm with the given input A* and knowledge A → B. Besides, we present completeness of type V and its perfection on knowledge base K in Q-logic ℂ _Q in this paper.     

目标系数模糊型模糊关系线性规划

提出了目标系数模糊型模糊关系线性规划问题,这是传统模糊关系线性规划的扩展.以三角模糊数为例,基于它的一种排序方法给出了求解该类规划的一个算法.最后,为了说明算法的有效性给出了两个数值例子.     

双重看涨期权定价的估计

在市场无套利、无摩擦和无风险利率为常数假定下,分别讨论了无红利配发和有红利配发情形时,一种新型期权—双重看涨期权的定价问题,主要利用套期保值策略对期权定价进行了若干估计,给出了上下界.     

Global optimization method for linear multiplicative programming

In this paper, a new global algorithm is presented to globally solve the linear multiplicative programming(LMP). The problem(LMP) is firstly converted into an equivalent programming problem(LMP(H))by introducing p auxiliary variables. Then by exploiting structure of(LMP(H)), a linear relaxation programming(LP(H)) of(LMP(H)) is obtained with a problem(LMP) reduced to a sequence of linear programming problems. The algorithm is used to compute the lower bounds called the branch and bound search by solving linear relaxation programming problems(LP(H)). The proposed algorithm is proven that it is convergent to the global minimum through the solutions of a series of linear programming problems. Some examples are given to illustrate the feasibility of the proposed algorithm.     

Fuzzy ordinary differential equation (I)

Fuzzy ordinary differential equation has been studied in many ways. In this paper we put forward concepts of ordinary differential equation of a fuzzy-valued function for the first time, discuss the existence and uniqueness of the solution at common points by applying decomposition theorem in fuzzy sets as well, so that a solution is obtained for the equation. Finally the method proves to be feasible and effective by a numerical example.