By applying spectra of matrix to the computation of panel data model , one can convert such computation as in - computability or complexity into computability or simplicity 摘要将矩阵谱分解的方法运用于平行数据模型的计算中，使难以进行的计算变成可能、复杂的运算变得简单。
2.
With the use of computability theory dividing whole - word coding into two parts : writing - input coding and computational coding , an method of none keyboard mapping for spelling language is proposed 本文依据可计算性理论，提出了拼音文字非键盘映射编码方法，将整词编码分为输写码与计算码。
3.
Because of the limited power supply , limited ability of communications , limited computability and memory on the mote , it is always a research emphasis to design a more efficient and power saving protocol for wireless data transmission 由于传感器节点具有电源能量有限、通信能力有限、计算和存储能力有限的特点,因此设计更加高效和省电的无线传输协议一直是这一领域研究的重点。
4.
The whole words computing codes can do both bearing information of complex whole word features and guaranteeing the computability of information , so that sets up an feasible and scientific best for unified computation and parallel processing of mongolian whole words 整词计算码既可载荷整词复杂特征知识信息、又可保证信息的可计算性，从而为蒙古文整词复杂特征合一计算和并行处理奠定了可行性科学基础。
5.
Now , the most word sense disambiguation algorithm on the parallel corpora is limited in the context of the single ambiguous word and its alignment information . in this paper , we made full use of computability of the concept in the hownet and changed word sense disambiguation problem into the similarity calculation problem between the ambiguous word and the whole sentence of the other language . in this way , we disambiguated the ambiguous word from a new point of view and achieved the satisfactory result 当前大多数基于双语语料的词义排歧算法都局限在利用单个多义词的上下文环境及其对应信息，本文则充分利用当前hownet资源中概念的可计算性，将词义排歧的问题转化为多义词和另一种语言的相应句子的整体意义相似性问题，从一个新的角度来进行词义排歧，因此得出了满意的研究结果。
6.
The thesis consists of four sections . in section one , we introduce some background of the topic , in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic - the algebraic structure of the plus cupping turing degrees , in section three , we outline the basic principles of the priority tree argument , one of the main frameworks and tools of theorem proving in computability theory , and in section four , we prove a new result concerning the algebraic structure of the plus cupping turing degrees that there exist two computably enumerable degrees a , b such that a , b ? pc , and the join a v b of a and b is high 本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题?加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a ， b ，满足a ， b pc ，而且a和b的并a b是一个高度。
