基于语料库的明清小说人名与称谓研究

在自然语言处理及其应用领域,人名和称谓作为重要的命名实体,是信息处理的关键部分之一。该文从命名实体识别和资讯提取的角度出发,在对4部明清古典小说的语料库进行标注的前提下,建构了姓名、字号和称谓作为命名实体的分类及标注系统。人名和称谓总体上分为单一型和复合型,根据复合型的内部组成元素和组合方式,将其进一步分为固定式、同位式、附属嵌套式、灵活嵌套式。结合语料库的完整数据统计,该文对各类型人名和称谓进行了比较分析,并分别展示了4部名著在人名、称谓使用上的特点。     

A Relational Representation of an Abstract Type System

Programming languages have traditionally had more data types than database systems. The flexibility of abstract types could make a database system more useful in supporting application development. Abstract types allow users to think about and manipulate data in terms and structures that they are familiar with. This paper proposes that databases have a type system interface and describes a representation of a type system in terms of relations. The type system model supports a variety of programming language constructs, such as user-defined parameterized data types and user-defined generic operations. The efficiency of the type system is compared to the access time of the database system.     

面向对象逻辑语言LKO的类型系统

文中主要介绍面向对象逻辑语言ＬＫＯ中基于声明和推理的有序类型系统，在谓词声明中，类型由有序的构子构造而成，子句中变量类型由类型推理决定，对象类型由方法声明决定，独立于便于代码复用，它可作为基类型参与项类型构造。     

Polymorphic type inference and containment

Type expressions may be used to describe the functional behavior of untyped lambda terms. We present a general semantics of polymorphic type expressions over models of untyped lambda calculus and give complete rules for inferring types for terms. Some simplified typing theories are studied in more detail, and containments between types are investigated.     

Semantic-Based Information Retrieval for Content Management and Security

An information retrieval system has to retrieve all and only those documents that are relevant to a user query, even if index terms and query terms are not matched exactly. However, term mismatches between index terms and query terms have been a serious obstacle to the enhancement of retrieval performance. In this article, we discuss automatic term normalization between words and phrases in text corpora and their application to a Korean information retrieval system. We perform three new types of term normalizations: transliterated word normalization, noun phrase normalization, and context-based term normalization. Transliterated words are normalized into equivalence classes by using contextual similarity to alleviate lexical term mismatches. Then, noun phrases are normalized into phrasal terms by segmenting compound nouns as well as normalizing noun phrases. Moreover, context-based terms are normalized by using a combination of mutual information and word context to establish word similarities. Next, unsupervised clustering is done by using the K-means algorithm and cooccurrence clusters are identified to alleviate semantic term mismatches. These term normalizations are used in both the indexing and the retrieval system. The experimental results show that our proposed system can alleviate three types of term mismatches and can also provide the appropriate similarity measurements. As a result, our system can improve the retrieval effectiveness of the information retrieval system.     

Generalized recursive data structures

Summary Recursive data types are data types which are defined in terms of themselves, such as lists and trees. There is a single access path to each component in a recursive data structure.Generalized recursive data structures may include multiple access paths to some parts of the data structure. Two way lists, threaded trees and circular lists are generalized recursive data types. The extra access paths in a generalized recursive data structure are uniquely determined by the type of the structure and the main paths through the structure.An extension to Pascal in which generalized recursive data structures may be defined is described.     

A diagnosability analysis by means of fault distance

A new concept of fault distance is introduced in a failure-diagnosis model. Diagnosability measures such as t-fault diagnosability and t/s-diagnosability are expressed in terms of the fault distance. A new diagnosability measure of partial t-fault diagnosability characterized in terms of fault distance is proposed. In addition, the fault distance of various types of self-diagnosis models are expressed in graph theoretical terms. Applying the fault distance to various types of self-diagnosis models, conditions for diagnosabilities of these models, which have been studied separately, are obtained in a unified manner. Conditions for t-fault diagnosability and sufficient conditions for t/s-diagnosability are obtained with this fault distance.     

Strongly Typed Term Representations in Coq

There are two approaches to formalizing the syntax of typed object languages in a proof assistant or programming language. The extrinsic approach is to first define a type that encodes untyped object expressions and then make a separate definition of typing judgements over the untyped terms. The intrinsic approach is to make a single definition that captures well-typed object expressions, so ill-typed expressions cannot even be expressed. Intrinsic encodings are attractive and naturally enforce the requirement that metalanguage operations on object expressions, such as substitution, respect object types. The price is that the metalanguage types of intrinsic encodings and operations involve non-trivial dependency, adding significant complexity. This paper describes intrinsic-style formalizations of both simply-typed and polymorphic languages, and basic syntactic operations thereon, in the Coq proof assistant. The Coq types encoding object-level variables (de Bruijn indices) and terms are indexed by both type and typing environment. One key construction is the boot-strapping of definitions and lemmas about the action of substitutions in terms of similar ones for a simpler notion of renamings. In the simply-typed case, this yields definitions that are free of any use of type equality coercions. In the polymorphic case, some substitution operations do still require type coercions, which we at least partially tame by uniform use of heterogeneous equality.     

A MAP K /G K /1/∞ Queueing System with Generalized Foreground-Background Processor Sharing Discipline

A queueing system with Markov arrival process, several customer types, generalized foreground-background processor sharing discipline with minimal served length, and an infinite buffer for all types of customers is studied. The joint stationary distribution of the number of customers of all types and the stationary distribution of time of sojourn of customers of every type are determined in terms of generating functions and Laplace–Stieltjes transforms.     

Towards a proof theory of rewriting: the simply typed 2λ-calculus

This paper describes the simply typed 2λ-calculus, a language with three levels: types, terms and rewrites. The types and terms are those of the simply typed λ-calculus, and the rewrites are expressions denoting sequences of β-reductions and η-expansions. An equational theory is imposed on the rewrites, based on 2-categorical justifications, and the word problem for this theory is solved by finding a canonical expression in each equivalence class. The canonical form of rewrites allows us to prove several properties of the calculus, including a strong form of confluence and a classification of the long-βη-normal forms in terms of their rewrites. Finally we use these properties as the basic definitions of a theory of categorical rewriting, and find that the expected relationships between confluence, strong normalisation and normal forms hold.     

Stability analysis for delayed genetic regulatory networks with reaction--diffusion terms

This paper deals with the problem of asymptotic stability for delayed genetic regulatory networks with reaction--diffusion terms. For three types of boundary conditions, delay-dependent criteria are established by the Lyapunov--Krasovskii functional approach, respectively. The obtained results are expressed in terms of linear matrix inequalities. Numerical examples illustrating the effectiveness of the proposed approach are provided.     

Adaptive associative memories capable of pattern segmentation

This paper presents an adaptive type of associative memory (AAM) that can separate patterns from composite inputs which might be degraded by deficiency or noise and that can recover incomplete or noisy single patterns. The behavior of AAM is analyzed in terms of stability, giving the stable solutions (results of recall), and the recall of spurious memories (the undesired solutions) is shown to be greatly reduced compared with earlier types of associative memory that can perform pattern segmentation. Two conditions that guarantee the nonexistence of undesired solutions are also given. Results of computer experiments show that the performance of AAM is much better than that of the earlier types of associative memory in terms of pattern segmentation and pattern recovery.     

A method to evaluate the spatial extensibility of a switching unit and network

Switching units and networks have been analyzed as extensible fabrics,mostly in terms of their scheduling algorithms.The traditional literature on switching extensibility has provided complexity theory only relating to the total numbers of inputs(or outputs)and exchange lines.This paper analyzes switching extensibility in terms of not only the scheduling algorithm and also the fabric itself.It is found that determining extensibility from soft complexity related to the number of inputs(or outputs)of the scheduling algorithm and the fabric extensibility in previous studies without quantization is a flawed conception.A method is thus proposed to express the spatial extensibility of a switching unit or network in terms of the connections of a switching resource and capacity.The method calculates parameter ES(the efciency of switching)of an m×n switching unit and obtains two functions of the switching unit to describe spatial extensibility along with the number of unilateral inputs or outputs.It is found that the range of ES is(0,1]and three types of switching unit and two types of crosspoint networks have ES=1.ES is calculated for banyan,Clos,parallel packet,fully interconnected and recirculation switching networks.The ES value for the banyan switching network is larger than that for other networks,and switching networks are classified into three types that have absolute/linear/denied spatial extensibility according to the limES value.It is demonstrated that a switching network has the largest ES value when it contains only the five types of switching unit for which ES=1.Finally,a group-switching-first self-routing banyan switching network with lower blocking probability and time delay is deduced,and the ES method is contrasted with two other methods of evaluating spatial extensibility in terms of their mathematical expressions and intuitive graphics,for the five types of switching network listed above.     

Mechanical procedure for proof construction via closed terms in typed λ calculus

In this paper is presented an algorithm for constructing natural deduction proofs in the propositional intuitionistic and classical logics according to the analogy relating intuitionistic propositional formulas and natural deduction proofs, respectively, to types and terms of simple type theory. Proofs are constructed as closed terms in the simple typed calculus. The soundness and completeness of this method are proved.     

分类问题中基于信息论度量的客观评价研究

基于信息论度量而系统性地研究了拒识分类中客观评价问题. 定义了客观评价度量为一类无自由参数描述的函数. 该定义是为了从技术上可以简单地判别度量或评价在“客观性”或“主观性”中的归属. 建议了应用并考察24个信息度量. 它们分别来自于互信息、散度、交叉熵的定义. 不同于传统的性能类度量是基于经验公式或用户直觉上的定义, 信息类度量是构建在更为普适的理论基础上. 该类度量可以对二值分类中的“误差类别”与“拒识类别”进行区分, 而不需求人们输入代价信息. 针对拒识分类评价中更为关注的需求, 提出了三个“元度量(meta-measure)”用于考察度量. 由此用户可以在更高知识层面上测评度量的各自优缺点. 应用数值实例比较了24个信息度量. 对其中最优的信息度量进行了在“误差”与“拒识”代价性质方面的解析分析.     

Performance Evaluation of Range Queries in Key Value Stores

Recently there has been a considerable increase in the number of different Key-Value stores, for supporting data storage and applications on the cloud environment. While all these solutions try to offer highly available and scalable services on the cloud, they are significantly different with each other in terms of the architecture and types of the applications, they try to support. Considering three widely-used such systems: Cassandra, HBase and Voldemort; in this paper we compare them in terms of their support for different types of query workloads. We are mainly focused on the range queries. Unlike HBase and Cassandra that have built-in support for range queries, Voldemort does not support this type of queries via its available API. For this matter, practical techniques are presented on top of Voldemort to support range queries. Our performance evaluation is based on mixed query workloads, in the sense that they contain a combination of short and long range queries, beside other types of typical queries on key-value stores such as lookup and update. We show that there are trade-offs in the performance of the selected system and scheme, and the types of the query workloads that can be processed efficiently.     

A Representation of Fω in LF

We study how the type theory F_ω can be adequately represented in the meta-logical framework Twelf [16]. This development puts special emphasis on the way how terms, types, and kinds are represented in that it uses higher-order abstract syntax to model variable binding and dependent types to model typing constraints. Furthermore our design ensures that only well-typed terms and well-kinded types can be constructed. A possible application of this work lies in the development of safe intermediate languages for compilation.     

Evolutionary algorithm characterization in real parameter optimization problems

This paper deals with the constant problem of establishing a usable and reliable evolutionary algorithm (EA) characterization procedure so that final users like engineers, mathematicians or physicists can have more specific information to choose the most suitable EA for a given problem. The practical goal behind this work is to provide insights into relevant features of fitness landscapes and their relationship to the performance of different algorithms. This should help users to minimize the typical initial stage in which they apply a well-known EA, or a modified version of it, to the functions they want to optimize without really taking into account its suitability to the particular features of the problem. This trial and error procedure is usually due to a lack of objective and detailed characterizations of the algorithms in the literature in terms of the types of functions or landscape characteristics they are well suited to handle and, more importantly, the types for which they are not appropriate. Specifically, the influence of separability and modality of the fitness landscapes on the behaviour of EAs is analysed in depth to conclude that the typical binary classification of the target functions into separable/non-separable and unimodal/multimodal is too general, and characterizing the EAs’ response in these terms is misleading. Consequently, more detailed features of the fitness landscape in terms of separability and modality are proposed here and their relevance in the EAs’ behaviour is shown through experimentation using standardized benchmark functions that are described using those features. Three different EAs, the genetic algorithm, the Covariance Matrix Adaptation Evolution Strategy and Differential Evolution, are evaluated over these benchmarks and their behaviour is explained in terms of the proposed features.