On the geometry of the smallest circle enclosing a finite set of points

A number of numerical codes have been written for the problem of finding the circle of smallest radius in the Euclidean plane that encloses a finite set P of points, but these do not give much insight into the geometry of this circle. We investigate geometric properties of the minimal circle that may be useful in the theoretical analysis of applications. We show that a circle C enclosing P is minimal if and only if it is rigid in the sense that it cannot be translated while still enclosing P. We show that the center of the minimal circle is in the convex hull of P. We use this rigidity result and an analysis of the case of three points to find sharp estimates on the diameter of the minimal circle in terms of the diameter of P.     

国产十种乌头的染色体研究

本文描述了我国产毛茛科乌头属的10个种的染色体数目和形态。  根据该属染色体基 数为8(x＝8)，可将这些种归为二倍体、四倍体、六倍体和八倍体种。  10种乌头的染色体在数目、大小、结构上表现出相关性。其中具根状茎而多年生的种多为二倍体，染色体形态较大，第3-7号多为近端着丝点(st)染色体, 具块茎而二年生的种多为多倍体，染色体形态较小，第3-7号多为近中着丝点(sm)染色体。染色体演化方向可能是二倍体→多倍体、大→ 小、st→sm。这进一步证明根状茎种较块茎种原始。根据染色体数目和形态，又可将这些种的染色体分为两类。这进一步支持了目前分类学上的牛扁亚属和乌头亚属的划分。本文还讨论了这些种的有关分类问题。     

Unsupervised word sense disambiguation for Korean through the acyclic weighted digraph using corpus and dictionary

Word sense disambiguation (WSD) is meant to assign the most appropriate sense to a polysemous word according to its context. We present a method for automatic WSD using only two resources: a raw text corpus and a machine-readable dictionary (MRD). The system learns the similarity matrix between word pairs from the unlabeled corpus, and it uses the vector representations of sense definitions from MRD, which are derived based on the similarity matrix. In order to disambiguate all occurrences of polysemous words in a sentence, the system separately constructs the acyclic weighted digraph (AWD) for every occurrence of polysemous words in a sentence. The AWD is structured based on consideration of the senses of context words which occur with a target word in a sentence. After building the AWD per each polysemous word, we can search the optimal path of the AWD using the Viterbi algorithm. We assign the most appropriate sense to the target word in sentences with the sense on the optimal path in the AWD. By experiments, our system shows 76.4% accuracy for the semantically ambiguous Korean words.     

Optimization of some factors affecting the performance of query expansion

This paper examines the factors affecting the performance of global query expansion based on term co-occurrence data and suggests a way to maximize the retrieval effectiveness. Major parameters to be optimized through experiments are term similarity measure and the weighting scheme of additional terms. The evaluation of four similarity measures tested in query expansion reveal that mutual information and Yule's Y, which emphasize low frequency terms, achieve better performance than cosine and Jaccard coefficients that have the reverse tendency. In the evaluation of three weighting schemes, similarity weight performs well only with short queries, whereas fixed weights of approximately 0.5 and similarity rank weights were effective with queries of any length. Furthermore, the optimal similarity rank weight achieving the best overall performance seems to be the least affected by test collections and the number of additional terms. For the efficiency of retrieval, the number of additional terms needs not exceed 70 in our test collections, but the optimal number may vary according to the characteristics of the similarity measure employed.     

中国薯蓣属根状茎组系统分类的初步研究

   本文根据我国薯蓣属(Dioscorea L．)根状茎组(Sect.  Stenophora Uline)的外部形态特征、细胞染色体数、花粉形态、植物化学成分、地理分布等的规律，证明根状茎组是该属中的一个比较原始的自然类群：1．具横走的多年生地下根状茎，其它组是一年生或多年生的块茎；2．大部分是2倍体，其它组是多倍体；3．花粉粒单沟型，外壁纹饰网纹或颗粒条纹，其它组为双沟型，外壁纹饰网纹；4．含甾体皂甙元(steroidal sapogenin)，其它组不含。   我们的研究观察证明，N．N．TepaCNMeHKO根据R.Knuth系统(1924)提出的薯蓣皂甙元在该属中无分布规律的说法是无充分依据的。   本文讨论了某些组或种的划分及系统位置：取消sect.Illigerestrum Prain et Burk.；将马    肠薯蓣(D．simulans Prain et Burk．)改属根状茎组；触丝薯蓣(D．tentaculigera Prain et Burk.)应列入顶生翅组  (Sect．shannicorea Prain et Burk．)，  并提出了盾叶薯蓣  (D. zingiberensis  Wright)和穿龙薯蓣(D．nipponica Makino)种的划分和定名的意见。     

Parsimonious translation models for information retrieval

In the KL divergence framework, the extended language modeling approach has a critical problem of estimating a query model, which is the probabilistic model that encodes the user’s information need. For query expansion in initial retrieval, the translation model had been proposed to involve term co-occurrence statistics. However, the translation model was difficult to apply, because the term co-occurrence statistics must be constructed in the offline time. Especially in a large collection, constructing such a large matrix of term co-occurrences statistics prohibitively increases time and space complexity. In addition, reliable retrieval performance cannot be guaranteed because the translation model may comprise noisy non-topical terms in documents. To resolve these problems, this paper investigates an effective method to construct co-occurrence statistics and eliminate noisy terms by employing a parsimonious translation model. The parsimonious translation model is a compact version of a translation model that can reduce the number of terms containing non-zero probabilities by eliminating non-topical terms in documents. Through experimentation on seven different test collections, we show that the query model estimated from the parsimonious translation model significantly outperforms not only the baseline language modeling, but also the non-parsimonious models.     

An empirical study of query expansion and cluster-based retrieval in language modeling approach

The term mismatch problem in information retrieval is a critical problem, and several techniques have been developed, such as query expansion, cluster-based retrieval and dimensionality reduction to resolve this issue. Of these techniques, this paper performs an empirical study on query expansion and cluster-based retrieval. We examine the effect of using parsimony in query expansion and the effect of clustering algorithms in cluster-based retrieval. In addition, query expansion and cluster-based retrieval are compared, and their combinations are evaluated in terms of retrieval performance by performing experimentations on seven test collections of NTCIR and TREC.     

云服务协议引发的信息安全风险及图情机构的应对措施

[目的/意义] 云服务在图书馆的应用可有效提升图书馆的数据存储与计算能力,但也为图书馆带来众多信息资源安全问题,而云计算服务协议的不规范性更加剧了图书馆面临的信息安全风险。[方法/过程] 选取8家云服务代表运营商的服务协议作为样本,聚焦云服务协议中有关信息安全的条款,从数据收集、数据存储、数据传输、数据访问和服务安全等5个方面深入分析当前云服务协议条款中存在的信息安全风险。[结果/结论] 图书馆应用云服务可能面临的信息安全风险包括：云服务协议内容缺失,用户信息安全难以得到确切保护;云服务协议表述模糊,尚未建立健全的安全保障机制;云服务协议的制定更有利于云提供商,用户权利易受侵犯。在此环境下,图书馆应当进一步明确图书馆用户数据的所有权,强调图书馆信息资源的安全性。     

国内英语学习自我效能感量表研究

笔者主要参考了国内的有关英语自我效能感研究的优秀硕士论文,从量表来源、量表维度等方面对这些论文中的英语自我效能感量表设计特征做了总结,以呈现现有量表编制的发展现状。     

“如同”的语法化研究

＂如同＂的语法化经过了＂如……同＂→＂如同＂的发展过程,句法结构和语义的改变是＂如同＂语法化的主要因素,如同语法化的过程还是一个主观化的过程。此外,还有一些其他因素的影响,如双音化趋势、语言省力原则,等等。