等离子体质谱(ICP-MS)测定高纯氧化镱中痕量稀土和非稀土杂质研究

本文报道ＩＣＰ－ＭＳ直接测定高纯（５Ｎ～６Ｎ）氧化镱中稀土和非稀土杂质的新方法．对ＩＣＰ－ＭＳ测定中的光谱干扰和基体效应进行了详细考察，结果表明：用镓作内标，可有效地补偿因氧化镱引起的基体效应．方法的检出限在０．０Ｘ－０．Ｘｎｇ／ｍＬ范围；相对标准偏差（ＲＳＤ）（ｎ＝７）＜１０％．已应用于高纯氧化镱的工艺流程及其产品分析．     

二阶中立型微分方程的区间振动准则

利用平均函数技巧 ,对二阶中立型微分方程 [a(t) (x(t) p(t)x(t-τ) )′]′ q(t)f[x(t) ,x(t-σ) ]g[x′(t) ]=0建立了一些区间振动准则 ,这些振动准则不同于已知依赖于整个区间 [t0 ,∞ )的性质的结果 ,而是仅依赖于 [t0 ,∞ )上的子区间列的性质     

区间值模糊命题逻辑的最大子代数及其广义重言式

将S-型蕴涵算子改为R0-蕴涵算子，从而找到区间值模糊逻辑I[0，1]的一个最大子代数IQ，进而将王国俊教授在逻辑系统W中的广义重言式理论推广应用到IQ中。     

Almost periodic Schrödinger operators along interval exchange transformations

It is shown that Schrödinger operators, with potentials along the shift embedding of irreducible interval exchange transformations in a dense set, have pure singular continuous spectrum for Lebesgue almost all points of the interval. Such potentials are natural generalizations of the Sturmian case.     

Fuzzy system reliability analysis by the use of Tω (the weakest t-norm) on fuzzy number arithmetic operations

In general, the sup-min convolution has been used for fuzzy arithmetic to analyze fuzzy system reliability, where the reliability of each system component is represented by fuzzy numbers. It is well known that T_ω-based addition preserves the shape of L-R type fuzzy numbers. In this paper, we show T_ω-based multiplication also preserves the shape of L-R type fuzzy numbers. We then apply T_ω-based arithmetic operations to fuzzy system reliability analysis. In fact, we show that we can simplify fuzzy arithmetic operations and even get the exact solutions for L-R type fuzzy system reliability, while others [Singer, Fuzzy Sets Syst. 34 (1990) 145; Cheng and Mon, Fuzzy Sets Syst. 56 (1993) 29; Chen, Fuzzy Sets Syst. 64 (1994) 31] have got the approximate solutions using sup-min convolution for evaluating fuzzy system reliability.     

The interval function of a connected graph and road systems

Let V be a finite nonempty set. In this paper, a road system on V (as a generalization of the set of all geodesics in a connected graph G with V(G)=V) and an intervaloid function on V (as a generalization of the interval function (in the sense of Mulder) of a connected graph G with V(G)=V) are introduced. A natural bijection of the set of all intervaloid functions on V onto the set of all road systems on V is constructed. This bijection enables to deduce an axiomatic characterization of the interval function of a connected graph G from a characterization of the set of all geodesics in G.     

一种精确检测细胞真实边缘的算法

分析了传统边缘检测算法在细胞边缘检测和形态分析中存在的缺陷。提出了最佳阈值分割和轮廓提取相结合的细胞边缘检测新方法。通过理论分析和实验,证明该方法能有效抑制噪声干扰的影响,实现细胞真实边缘的精确检测。     

The case for an interval-based representation of linguistic truth

This paper develops an interval-based approach to the concept of linguistic truth. A special-purpose interval logic is defined, and it is argued that, for many applications, this logic provides a potentially useful alternative to the conventional fuzzy logic.The key idea is to interpret the numerical truth value v(p) of a proposition p as a degree of belief in the logical certainty of p, in which case p is regarded as true, for example, if v(p) falls within a certain range, say, the interval [0.7, 1]. This leads to a logic which, although being only a special case of fuzzy logic, appears to be no less linguistically correct and at the same time offers definite advantages in terms of mathematical simplicity and computational speed.It is also shown that this same interval logic can be generalized to a lattice-based logic having the capacity to accommodate propositions p which employ fuzzy predicates of type 2.     

On multistep interval methods for solving the initial value problem

In this paper we shortly complete our previous considerations on interval versions of Adams multistep methods [M. Jankowska, A. Marciniak, Implicit interval multistep methods for solving the initial value problem, Comput. Meth. Sci. Technol. 8(1) (2002) 17–30; M. Jankowska, A. Marciniak, On explicit interval methods of Adams–Bashforth type, Comput. Meth. Sci. Technol. 8(2) (2002) 46–57; A. Marciniak, Implicit interval methods for solving the initial value problem, Numerical Algorithms 37 (2004) 241–251]. It appears that there exist two families of implicit interval methods of this kind. More considerations are dealt with two new kinds of interval multistep methods based on conventional well-known Nyström and Milne–Simpson methods. For these new interval methods we prove that the exact solution of the initial value problem belongs to the intervals obtained. Moreover, we present some estimations of the widths of interval solutions. Some conclusions bring this paper to the end.