因素空间与概念内涵的表示

本文综合应用因素空间、信息系统和重于关系的方法,讨论了概念的内涵表示及其他有关问题。特别是,对在描述概念问题中不同于内涵和外延的第三种方法,即典型示范表示做了进一步的分析。     

Fuzzy Entropy： Axiomatic Definition and Neural Networks Model

The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model.     

平面凸集存在最小凸生成集的充要条件

本文在平面上解决了StevenRLay在 [1 ]中提出的开放性问题“什么样的凸集存在唯一的最小凸生成子集” ,给出并证明了“平面上的凸集存在唯一的最小凸生成子集”的一个充要条件 .同时证明了En 中的开集一定不存在最小凸生成集 .     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

介质光波导的数值计算及近似方法

综述介质光波导中模式分析方法的最新进展。着重分析严格的数值分析方法及近似方法最近的研究进展。依据方法的计算精确度、计算效率和计算复杂度等因素．对有限元法和有限差分法这两种数值分析方法以及有效指数法和频谱指数法等近似方法进行讨论。论述磁光波导的分析方法。     

Difference schemes on uniform grids performed by general discrete operators

Our aim is to set the foundations of a discrete vectorial calculus on uniform n-dimensional grids, that can be easily reformulated on general irregular grids. As a key tool we first introduce the notion of tangent space to any grid node. Then we define the concepts of vector field, field of matrices and inner products on the space of grid functions and on the space of vector fields, mimicking the continuous setting. This allows us to obtain the discrete analogous of the basic first order differential operators, gradient and divergence, whose composition define the fundamental second order difference operator. As an application, we show that all difference schemes, with constant coefficients, for first and second order differential operators with constant coefficients can be seen as difference operators of the form for suitable choices of q, and  . In addition, we characterize special properties of the difference scheme, such as consistency, symmetry and positivity in terms of q, and  .     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

校准电表的一种方法

利用电位差计的高精度，设计出合理的实验电路对C31型电表进行校准，使得电表的准确度等级得以提高。     

双振动合成仪器的设计

指出了用示波器演示双振动合成的不足，设计了BS—Ⅱ型双频调相信号仪，并给出了应用该仪器获得的部分实验图象。     

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

We consider the parameterized problem, whether for a given set  of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time  . The results are based on problem kernelization and a new “geometric ( -separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.”