oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 308 )

2018 ( 5847 )

2017 ( 5977 )

2016 ( 6258 )

Custom range...

Search Results: 1 - 10 of 255499 matches for " 张焕炯 "
All listed articles are free for downloading (OA Articles)
Page 1 /255499
Display every page Item
网格互联组网的一种结构模式研究
,钟义信?
计算机科学 , 2010,
Abstract: 网格计算是一个热门的研究分支,它以借助网络互联的方式,把分散在不同地理位置中的电脑计算能力整合起来,构成蕴含超常计算能力的巨大虚拟超级计算机。研究了网格计算中网格互联的结构以及性能的相关问题,着重讨论了网格互联中协议的特性和资源共享等问题,同时对网格系统的分布式计算和平行计算的特性、协同性、智能性等也进行了论述。
网格网的智能化调度研究
,钟义信?
计算机科学 , 2010,
Abstract: 网格计算的资源管理和任务调度是解决网格资源描述、组织管理和任务分配等关键问题的技术,它既是保证网格网作为先进的计算基础的重要前提,也是体现网格网特色的重要要素。针对网格网任务调度进行研究,并给出了一种智能化的调度方案,预期该方案能快捷、有效和智能地进行网格网任务调度,极大地提高网格网任务调度的效率。
A New Method for Text Similarity Computing
文本相似度计算的一种新方法

,李玉鉴,钟义信
计算机科学 , 2002,
Abstract: 1 引言目前信息检索技术已应用于许多领域,尤其广泛应用在Internet网络、图书馆等领域,为快速查阅文本信息提供极大便利。文本信息检索利用文本相似度描述文本与查询式之间的匹配程度。计算文本相似度的传统方法有向量空间模型,它把文本和查询式表示成以词为元素单位的向量,根据词频tf以及逆文本频率idf,赋予该向量各个分量的权值,与欧氏空间的向量1-1对应,用向量夹角的余弦值定量表示文本和查询式之间的相似度,即
关于主动网络的体系和增值业务的研究
徐前方 钟义信?
计算机科学 , 2005,
Abstract: 现有的被动式网络遇到了较多的技术难题和增值业务拓展的瓶顼,为了解决网络体系的内在痼疾和拓展网络增值业务,人们引进了主动网络(an)的概念,主动网络现已引起广泛关注,随着研究的不断深入,它有望在将来的网络体系中扮演重要的角色。就它的体系结构和增值业务等进行了研究,同时对它的主要特性作了扼要的归纳。
文本相似度计算的一种新方法
李玉鉴 钟义信?
计算机科学 , 2002,
Abstract:
Research on Architecture of Grid Computing System
网格互联组网的一种结构模式研究

ZHANG Huan-jiong,ZHONG Yi-xin,
,钟义信

计算机科学 , 2010,
Abstract: Grid computation is a branch of computer science researching,the main idea is how to integrate some diffe-rent computation capabilities in different geographical positions,furthermore to unify them as a virtual super computer.We researched the architecture and performances of Grid internet,especially,the characters of the new protocols and the sharing of resources were studied,the distributing computation and parallel computation,the co-operating performance and the intelligent performance were discussed to...
Research on the Intelligent Schedule Measure of Grid Network
网格网的智能化调度研究

ZHANG Huan-jiong,ZHONG Yi-xin,
,钟义信

计算机科学 , 2010,
Abstract: The asset management and schedule measure in Grid computing system are the key technologies of describing the network souses, network management and task assignment. In this paper, the intelligent schedule measure in Grid Internet system was researched, the essential conditions of realizing intelligent schedule measure were discussed, furthermore,one intelligent schedule measure was pointed out.
时代呼唤新的目录学著作

图书情报工作 , 2005,
Abstract: ?指出我国当代目录学著作的数量呈下降趋势,在出版时间和出版内容上明显滞后以及形式不够生动、新颖等现状,认为其中既有目录学教育体制和出版发行方面的客观原因,也有目录学家和目录学工作者的主观原因。提出设立目录学研究基金、推出个性化的目录学著作、争取多个领域分工合作及培养目录学接班人等几点建议。
基于莱文森三层次意义理论的汉语双重否定范畴划分
The Classification of Double Negation Categories in Chinese Based on Levinson’s Three Levels of Meaning
 [PDF]

, 于洋
Modern Linguistics (ML) , 2015, DOI: 10.12677/ML.2015.33013
Abstract:
学者们对现代汉语双重否定的涵义及界定众说纷纭,莫衷一是。因而,有必要从新的视角――逻辑描写的角度,对此进行重新认识和进一步完善。现代汉语双重否定的逻辑特征为:语言结构中存在“?(?p)”或“p”,不表达否定意义。在将语用因素及惯用表达纳入到双重否定范畴中的基础上,以莱文森三层次意义理论为纲,从语义及语用两个层面上划分双重否定,分出语用双重否定的两个次范畴(类型型及实例型语用双重否定),并同时进一步划分出语义及语用双重否定的次范畴及次次范畴,对双重否定的研究从静态描写逐渐转向动态分析。
With scholars’ dispute about the definition and classification of double negation in modern Chinese, it is necessary to understand and improve them from the new angle—the angle of logical de-scription. Double Negation in modern Chinese has the characteristic that there is the logic form of “?(?p)” or “p” in the construction, and it doesn’t carry negative meaning. Based on Levinson's Three Levels of Meaning, with pragmatic factors and idiomatic patterns included in the categori-zation, the double negation in Chinese is classified and analyzed from the semantic and pragmatic levels, with two subcategories (type and token pragmatic double negation) in pragmatic double negation. Meanwhile, subcategories of semantic and pragmatic double negation are further classi-fied, thus changing the research focus from static to dynamic analysis.
LDPC码校验矩阵回路的求解算法
LDPC Code’s Girth Calculation Algorithm
 [PDF]

,
Hans Journal of Wireless Communications (HJWC) , 2014, DOI: 10.12677/HJWC.2014.41003
Abstract: 1996LDPC(低密度奇偶校验,Low-Density Parity-Check)码是性能限与香农限仅差0.0045 dB的一种差错控制码[1],译码采用SPA(和积算法),但其性能受Tanner图中回路长度和回路数目的影响,回路的存在使译码信息重复迭代,性能下降[2]。本论文通过计算机仿真,采用Matlab元胞数组,将二元校验矩阵转换为树矩阵,实现了求解LDPC码回路的算法。
 Low-Density Parity-Check codes have advantageous performances discovered in 1996 with Shannon limit only 0.0045 dB. Decoding algorithm adopts SPA (Sum-Product Algorithm). However, girths in LDPC codes are detrimental to the code’s performance, and the existence of loops makes the decoding information iterative and the performance reduced. This paper, through computer simulation, using the Matlab cellular array, to convert the binary check matrix to tree matrix, realizes the algorithm of LDPC codes loop
Page 1 /255499
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.