支持中文句法结构套叠的组合范畴语法

词组入句时发生语法性质转变,词组的句法范畴就应该转换,这种转换依赖词组作为整体进入更大词组的结构需要。要解释这种现象,组合范畴语法应该增加相应的转换规则。从集合论角度看,汉语有名词-动词-形容词依次包含关系,由此可归纳基本句法结构之间的转类套叠。在类有定职的前提下,得出转类套叠对应的范畴转换规则,形成有范畴转换机制的组合范畴语法C^2-CCG。研究表明这种基于词组本位的形式语法有希望解释中文句法中各种转类套叠。     

An extension of a procedure to prove statements in differential geometry

An extension of the Carra'-Gallo procedure is presented. By using this extension, one can prove the validity of certain examples that are not within the scope of that procedure.Supported by Italian MURST 40%.     

Analyzing the Core of Categorial Grammar

Even though residuation is at the core of Categorial Grammar (Lambek, 1958), it is not always immediate to realize how standard logical systems like Multi-modal Categorial Type Logics (MCTL) (Moortgat, 1997) actually embody this property. In this paper, we focus on the basic system NL (Lambek, 1961) and its extension with unary modalities NL() (Moortgat, 1996), and we spell things out by means of Display Calculi (DC) (Belnap, 1982; Goré, 1998). The use of structural operators in DC permits a sharp distinction between the core properties we want to impose on the logical system and the way these properties are projected into the logical operators. We will show how we can obtain Lambek residuated triple \, / and of binary operators, and how the operators and introduced by Moortgat (1996) are indeed their unary counterpart.In the second part of the paper we turn to other important algebraic properties which are usually investigated in conjunction with residuation (Birkhoff, 1967): Galois and dual Galois connections. Again, DC let us readily define logical calculi capturing them. We also provide preliminary ideas on how to use these new operators when modeling linguistic phenomena.     

基于记分函数的区间值Vague集的相似度量

分别利用区间的中值和Hausdorff测度将基于记分函数的实数型Vague集的相似度方法扩展到i-v Vague集上，比较各种方法的优缺点．并且充分利用Vague集的性质，给出动态的i-v Vague集之间的相似度量方法．     

A procedure to prove statements in differential geometry

An algorithm for theorem proving in differential geometry based on the calculation of the differential dimension of differential quasi-algebraic sets is shown. In the case in which only ordinary differential equations are involved, an algorithm for such computation is presented. Different notions of validity for differential geometry statements are also compared.This paper was supported by Italian M.P.I. (40% 1985).     

零件尺寸的信息效率特性分析及其应用

针对零件尺寸在产品变型设计过程中的数据传递效用问题,从信息学的角度提出零件尺寸的信息中心性分析方法.首先根据产品组成零件之间的尺寸约束网络结构特征,分析了零件尺寸传递信息的特性以及尺寸对之间的简单路径;在此基础上构造了尺寸约束网络的信息效率模型,根据尺寸移除引起的尺寸约束网络信息效率衰减构建零件尺寸的信息中心性模型,并提出了基于尺寸信息中心性的约束解算规划方法;从入度和深度2个因素定义尺寸约束网络的复杂性模型,分析了不同尺寸约束解算顺序下尺寸约束网络的复杂性及其累积结果.实验结果表明,按照尺寸信息中心性的降序来求解尺寸约束,尺寸约束网络具有最小的复杂性,为产品变型设计过程组织与管理提供了一个新的思路.     

双论域上粗糙集的矩阵定义

提出了两个关系矩阵的序偶取小乘法的概念,并利用关系矩阵和布尔列向量重量上乘法和下乘法的有关结论,给出了计算双论域上任一集合上下近似的具体算法,从而使得双论域上粗糙集的计算程序化。     

浅谈软件质量度量和软件产品评价

软件质量度量和软件产品评价系列标准是国际标准化组织ISO／IEC JTC1近年来在软件工程标准方面的研究重点之一,对于通过量化手段进行软件产品的度量和评价,规范软件产品的质量管理,这两个系列标准提供了一条可以参考的实施途径。本文在多年跟踪研究国际上软件工程标准和制定软件工程国家标准的基础上,对ISO／IEC JTC1近年推出的ISO／IEC 9126和ISO／IEC 14598系列,以及正在研制的ISO／IEC 25000系列标准进行综合介绍。     

Computing minimal doubly resolving sets of graphs

In this paper we consider the minimal doubly resolving sets problem (MDRSP) of graphs. We prove that the problem is NP-hard and give its integer linear programming formulation. The problem is solved by a genetic algorithm (GA) that uses binary encoding and standard genetic operators adapted to the problem. Experimental results include three sets of ORLIB test instances: crew scheduling, pseudo-boolean and graph coloring. GA is also tested on theoretically challenging large-scale instances of hypercubes and Hamming graphs. Optimality of GA solutions on smaller size instances has been verified by total enumeration. For several larger instances optimality follows from the existing theoretical results. The GA results for MDRSP of hypercubes are used by a dynamic programming approach to obtain upper bounds for the metric dimension of large hypercubes up to 2⁹⁰$2^{90}$ nodes, that cannot be directly handled by the computer.     

广义M-J集的边界构造及分维数计算

讨论逃逸时间算法、Lyapunov指数法、反函数法和同胚分形插值法等方法的适用范围,提出构造广义M-J集分形边界的一种通用算法即边界检测算法.利用设计的检测模板将广义M-J集的边界部分提取出来并计算这种分形边界的盒维数 .实验结果表明,与几种现有的算法相比较,新算法具有普适性和精确性,用于构造任意形式复映射的广义M-J集的分形边界.     

一种基于维度投影的多维数据相关性可视分析方法

针对高维多元数据相关性分析需求,首先提出一种基于KNN和Pearson相关系数的维度相关性度量方法KNN-Pearson,通过数据集在维度某数据值处的密度定量地表示某维度对聚类的贡献度,并将其作为计算元素,通过Pearson相关系数计算各维度间的相关性大小,定量地表示各维度之间的相关程度;进而提出一种基于维度投影的相关性可视分析方法,通过多维尺度分析(MDS)进行维度投影,用投影散点图和矩阵热图展示维度之间的相关性,用投影矩阵和平行坐标展示数据的分布态势和聚类特征,允许通过维度选择构造用户感兴趣的子空间,在子空间中交互地分析数据、探索规律;将上述方法应用于食品安全领域,设计并实现了一个农残数据相关性可视分析系统,通过数据筛选、维度选择、尺度缩放以及多视图联动等交互手段实现对多地区农产品中检出农药的相关性分析,从而发现检测地区对农产品施用农药的模式,掌握农药施用的规律.最后通过用户体验以及评价,证明了文中方法的有效性.     

网络匿名度量研究综述

保护网络空间隐私的愿望推动了匿名通信系统的研究,使得用户可以在使用互联网服务时隐藏身份和通信关系等敏感信息,不同的匿名通信系统提供不同强度的匿名保护.如何量化和比较这些系统提供的匿名程度,从开始就是重要的研究主题,如今愈发得到更多关注,成为新的研究焦点,需要开展更多的研究和应用.匿名度量可以帮助用户了解匿名通信系统提供...     

自然语言处理评测中的问题与对策

自然语言处理中的评测任务引导和推动着技术、模型和方法上的研究.近年来,新的评测数据集和评测任务不断被提出,与此同时,现有评测暴露的一系列问题也限制了自然语言处理技术的进步.该文从自然语言处理评测的概念、构成、发展和意义出发,分类综述了主流自然语言处理评测的任务和特点,进而总结归纳了自然语言处理评测中的问题及其成因.最后...     

粗糙集的矩阵定义

提出了关系矩阵和布尔列向量重量上乘法和下乘法的概念,证明了上乘法就是上近似,下乘法就是下近似,同时研究了上下近似的性质,最后给出了计算上下近似的算法。     

Aspects of non-cartesian robotics

Non-Cartesian robotics, which began with the introduction of subsumption architecture by Rodney Brooks, now encompasses a wide range of robotics that do not follow traditional cartesian principles in the running of a robot. The new field is sometimes called biorobotics as it draws its guiding principles from biology, physiology, behavioural sciences, genetics and theories of evolution, brain sciences, genetics and theories of evolution, brain sciences, ethology, psychology, and other related non-engineering disciplines. The difference in principles of operation, however, has roots deeper in the philosophical underpinnings of the way we view controlling artifacts and the concept of control itself when it is contrasted against the concept of autonomy. Realization of increasingly higher levels of autonomy is routinely demanded today not only in industry where most robotic applications occur, but also in areas closer to our daily life where a gradual but steady increase in service applications of robotics is observed. This paper introduces the concept of non-Cartesian robotics as an antithesis to conventional (Cartesian) robotics and describes various aspects of this new way of running a robotic system. This work was presented, in part, at the International symposium on Artificial Life and Robotics, Oita, Japan, February 18–20, 1996