Reduced Rank Discrimination

In this paper the problem of classifying an individual with p characteristics into one of k multivariate normal distributions with common unknown covariance matrix is considered when the matrix of ( k +1) means has a linear structural relationship, that is, it lies in an r -dimensional plane, where r 相似文献   

中国诗书画艺术的观照方式

“仰观俯察”、“远取近求”的艺术观照方式,构筑了华夏民族独特的认识自然、省悟人生的思维及审美模式和艺术生成发展的基础,形成了中国诗文、书法、绘画等艺术形式特有的品格特征。     

群组AHP排序的最小最大几何距离方法

对群组判断矩阵提出一种新的最小最大几何距离排序方法(MGDM)。鉴于不同专家所给判断矩阵质量上的差异,MGDM对群组判断矩阵进行不同程度的加权处理,并进行群组一致性检验。     

四川现代远程教育实践与发展对策

随着以计算机和网络技术为核心的现代远程教育的迅速发展 ,四川现代远程教育的发展也取得较大成绩。但仍然存在着思想观念落后、社会认知消极 ,整体建设水平不高 ,专业分布不合理 ,教学资源不足等问题。要促进四川网络教育实现跨越式发展 ,必须解放思想、更新观念 ,实现资源共享、优势互补 ,加强服务、提高质量。     

发展远程教育是实现西部地区教育腾飞的必然选择

随着计算机技术、网络技术和电子通信技术的迅速发展和应用,带来教育信息资源的极大丰富和教育手段的多样化.要实现西部地区的经济腾飞,必须使其教育腾飞,要使教育腾飞,必须解放思想,勇于创新,改变传统教育模式,大力发展远程教育是必然选择.     

Optimal algorithms for uncovering synteny problem

The syntenic distance between two genomes is the minimum number of fusions, fissions, and translocations that can transform one genome to the other, ignoring the gene order within chromosomes. As the problem is NP-hard in general, some particular classes of synteny instances, such as linear synteny, exact synteny and nested synteny, are examined in the literature. In this paper, we propose a new special class of synteny instances, called uncovering synteny. We first present a polynomial time algorithm to solve the connected case of uncovering synteny optimally. By performing only intra-component moves, we then solve the unconnected case of uncovering synteny. We will further calculate the diameters of connected and unconnected uncovering synteny, respectively.     

视频点击流数据挖掘在远程教育中的应用

Web数据挖掘已经成为数据挖掘技术一个重要的应用领域,文章主要通过对远程教育网站的视频点击流日志文件进行数据挖掘,寻求用户访问规律,构建动态的个性化教育网站.     

The Center Location Improvement Problem Under the Hamming Distance

In this paper, we consider the center location improvement problems under the sum-type and bottleneck-type Hamming distance. For the sum-type problem, we show that achieving an algorithm with a worst-case ratio of O(log |V|) is NP-hard, and for the bottleneck-type problem, we present a strongly polynomial algorithm.     

语用层面的象似性考察

本文主要探讨了象似性理论在语言中的体现,着重对其四原则:数量象似性原则、距离象似性原则、顺序象似性原则、标记象似性原则在语用层面上进行了分析,论述了其在象似性话语中的功能。旨在为语用研究开辟新的视野,也为语言象似与语言功能的结合作出新的尝试     

Slack free MEA and RDM with comprehensive efficiency measures

This paper extends two directional distance function models, the Multi-directional Efficiency Analysis (MEA) Model and the Range Directional Model (RDM), in order to account for any type of technical inefficiency, i.e. both directional and non-directional inefficiencies. We first focus on the variable returns to scale (VRS) case, because both VRS-MEA and RDM are translation invariant models, which mean that both models are able to deal with negative data. Our main result is the definition of a new comprehensive efficiency measure which is units invariant and translation invariant and covers both models. Secondly, we introduce the RDM model under constant returns to scale (CRS) together with a new comprehensive efficiency measure.