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 摘要將矩陣譜分解的方法運(yùn)用于平行數(shù)據(jù)模型的計(jì)算中,使難以進(jìn)行的計(jì)算變成可能、復(fù)雜的運(yùn)算變得簡單。
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 本文依據(jù)可計(jì)算性理論,提出了拼音文字非鍵盤映射編碼方法,將整詞編碼分為輸寫碼與計(jì)算碼。
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 由于傳感器節(jié)點(diǎn)具有電源能量有限、通信能力有限、計(jì)算和存儲(chǔ)能力有限的特點(diǎn),因此設(shè)計(jì)更加高效和省電的無線傳輸協(xié)議一直是這一領(lǐng)域研究的重點(diǎn)。
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 整詞計(jì)算碼既可載荷整詞復(fù)雜特征知識(shí)信息、又可保證信息的可計(jì)算性,從而為蒙古文整詞復(fù)雜特征合一計(jì)算和并行處理奠定了可行性科學(xué)基礎(chǔ)。
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 當(dāng)前大多數(shù)基于雙語語料的詞義排歧算法都局限在利用單個(gè)多義詞的上下文環(huán)境及其對(duì)應(yīng)信息,本文則充分利用當(dāng)前hownet資源中概念的可計(jì)算性,將詞義排歧的問題轉(zhuǎn)化為多義詞和另一種語言的相應(yīng)句子的整體意義相似性問題,從一個(gè)新的角度來進(jìn)行詞義排歧,因此得出了滿意的研究結(jié)果。
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個(gè)部分:第一部分介紹了這個(gè)領(lǐng)域的一些背景知識(shí);第二部分主要回顧了前人在研究可計(jì)算枚舉度的結(jié)構(gòu)和層譜時(shí)所取得的一些基本和最新結(jié)果,這些結(jié)果與我們的主題?加杯圖靈度的代數(shù)結(jié)構(gòu)密切相關(guān);在第三部分中,我們概要的描述了優(yōu)先樹方法的基本原理,此方法是可計(jì)算性理論中定理證明的一個(gè)重要框架和工具;第四部分證明了一個(gè)加杯圖靈度代數(shù)結(jié)構(gòu)的新結(jié)果:存在兩個(gè)可計(jì)算枚舉度a , b ,滿足a , b pc ,而且a和b的并a b是一個(gè)高度。
百科解釋
Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science.