检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

846 篇 会议
297 篇 期刊文献
3 册 图书

馆藏范围

1,146 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

727 篇 工学
- 572 篇 计算机科学与技术...
- 418 篇 软件工程
- 127 篇 信息与通信工程
- 78 篇 电子科学与技术（可...
- 73 篇 控制科学与工程
- 55 篇 生物工程
- 54 篇 机械工程
- 38 篇 电气工程
- 25 篇 动力工程及工程热...
- 24 篇 仪器科学与技术
- 21 篇 化学工程与技术
- 18 篇 材料科学与工程（可...
- 14 篇 土木工程
- 14 篇 网络空间安全
- 12 篇 力学（可授工学、理...
- 12 篇 建筑学
- 12 篇 农业工程
- 11 篇 交通运输工程
- 11 篇 环境科学与工程（可...
280 篇 理学
- 177 篇 数学
- 58 篇 生物学
- 47 篇 物理学
- 39 篇 统计学（可授理学、...
- 38 篇 系统科学
- 22 篇 化学
185 篇 管理学
- 124 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 37 篇 工商管理
18 篇 法学
- 15 篇 社会学
17 篇 经济学
- 17 篇 应用经济学
13 篇 农学
9 篇 教育学
7 篇 医学
3 篇 文学
3 篇 军事学
2 篇 艺术学

主题

46 篇 distributed proc...
44 篇 laboratories
42 篇 computational mo...
31 篇 kernel
29 篇 algorithm design...
28 篇 concurrent compu...
28 篇 computer archite...
27 篇 graphics process...
27 篇 benchmark testin...
25 篇 fault tolerance
25 篇 hardware
24 篇 feature extracti...
23 篇 throughput
23 篇 semantics
22 篇 servers
22 篇 cloud computing
21 篇 parallel process...
21 篇 deep learning
21 篇 protocols
21 篇 training

机构

169 篇 national laborat...
135 篇 science and tech...
103 篇 college of compu...
88 篇 national laborat...
81 篇 national laborat...
38 篇 school of comput...
38 篇 national laborat...
29 篇 national key lab...
22 篇 science and tech...
22 篇 national key lab...
21 篇 national key lab...
18 篇 national laborat...
17 篇 laboratory of di...
16 篇 national laborat...
15 篇 national univers...
14 篇 national laborat...
14 篇 national key lab...
13 篇 national key lab...
13 篇 school of comput...
12 篇 national laborat...

作者

44 篇 wang huaimin
42 篇 yong dou
40 篇 li dongsheng
39 篇 liu jie
38 篇 dou yong
37 篇 wang ji
36 篇 dongsheng li
36 篇 huaimin wang
35 篇 ji wang
31 篇 jie liu
30 篇 yijie wang
30 篇 wang yijie
29 篇 xiaodong wang
27 篇 yin gang
26 篇 peng yuxing
25 篇 yuxing peng
25 篇 gang yin
22 篇 tao wang
21 篇 zhigang luo
21 篇 xicheng lu

语言

1,073 篇 英文
63 篇 中文
10 篇 其他

检索条件"机构=National Key Laboratory of Parallel and Distributed Processing"

共 1146 条记录，以下是181-190 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Implementation of a Fine-Grained parallel full pipeline Schnorr–Euchner sphere decoder algorithm accelerator on Field-Programmable gate array 4th

Implementation of a Fine-Grained parallel full pipeline Schn...

引用

4th International Conference on Computer Engineering and Networks, CENet2014

作者： Li, Shijie Guo, Lei Dou, Yong Jiang, Jingfei National laboratory for parallel and distributed processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783319111032

A new parallel full pipeline accelerator implemented on fieldprogrammable gate array (FPGA) for the Schnorr–Euchner sphere decoding (SE– SD) algorithm is presented in this paper. We firstly transform the serial SE–SD algorithm into a parallel one. Afterwards, we use multiple processing elements (PEs) to deal with the workload (particularly for tree searching in the SE–SD algorithm) in parallel. Each separated SE–SD search workload is divided averagely. Each PE searches a sub-tree by using a multilevel pipeline to increase the data throughput, and the whole system obtains a batch of different input data chronologically. We select the number of PEs to distribute our system according to the hardware platform by using a distribution unit. We’ve successfully placed four PEs in an accelerator and eight accelerators in a single FPGA (XC6VLX240T). The system obtains remarkable benefit in changing the accelerate mode, including latency- and throughput-prior modes. © Springer International Publishing Switzerland 2015.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

An efficient load balancing method for constant degree P2P systems

An efficient load balancing method for constant degree P2P s...

引用

2010 International Conference on Computer Design and Applications, ICCDA 2010

作者： Wang, XiaoHai Peng, YuXing Li, DongSheng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781424471638

Constant degree P2P systems are turning into the P2P domain's promising hotspot due to their good properties. However, it is often hard to convert a standard constant degree digraph to a flexible DHT schema adapting to dynamic P2P environments. Thus, most research about constant degree P2P focus on DHT's construction and maintenance, while leaving optimization and supporting to upper-layer application behind, such as complex query, load balance, etc. Combining constant degree topology's bit-shift routing schema, we presents an efficient load balancing algorithm based on Reverse Spanning Tree (REST) for constant degree P2P systems. Using the statistic information in joining process, REST judges how many Virtual Servers that a new join super peer can run, and then join all virtual servers evenly and fast with low cost based on the Spanning Tree Peer Set. Experimental results show, without additional data structure, REST keeps the constant degree P2P system load-balanced by assuring each peer of owning a key space proportional to its capability. © 2010 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Approximating quantified SMT-solving with SAT

Approximating quantified SMT-solving with SAT

引用

International Conference on Secure Software Integration and Reliability Improvement Companion

作者： Fu, Xianjin Liu, Wanwei Li, Jing National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769544540

Satisfiability Modulo Theories (SMT) is an extension of SAT towards FOL. SMT solvers have proven highly scalable and efficient for problems based on some ground theorems. However, SMT problems involving quantifiers and combination of theorems is a long-standing challenge, which has been a major bottleneck of practical application of SMT solvers in some fields. We reveal a decidable fragment of FOL involving quantifiers, which could not be solved by SMT solvers such as Z3, CVC3, etc., and show how to convert them into model checking problems. © 2011 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Fine-grained parallel application specific computing for RNA secondary structure prediction using SCFGS on FPGA

Fine-grained parallel application specific computing for RNA...

引用

Embedded Systems Week 2009, ESWEEK 2009 - 2009 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES'09

作者： Dou, Yong Xia, Fei Jiang, Jingfei National Laboratory for Parallel and Distributed Processing National University of Defence Technology 410073 ChangSha China

ISBN: (纸本)9781605586267

In the field of RNA secondary structure prediction, the CYK (Coche-Younger-Kasami) algorithm is a most popular methods using SCFG (stochastic context-free grammars) model. However, general purpose parallel computers including SMP multiprocessors or cluster systems exhibit low parallel efficiency and they are too expensive to be used easily for many research institutes. FPGA chips provide a new approach to accelerate the CYK algorithm by exploiting fine-grained custom design. The CYK algorithm shows complicated data dependence, in which the dependence distance is variable, and the dependence direction is also across two dimensions. We propose a systolic array structure including one master PE and multiple slave PEs for fine grain hardware implementation on FPGA. We partition tasks by columns and assign tasks to PEs for load balance. We exploit data reuse schemes to reduce the need to load matrix from external memory. To our knowledge, our implementation with 16 PEs is the only FPGA accelerator implementing the complete CYK/inside algorithm. The experimental results show a factor of more than 14 speedup over the Infernal-0.55 software running on a PC platform with Pentium 4 2.66GHz CPU. The computational power of our platform with FPGA accelerator is comparable to a PC cluster consisting of 20 Intel-Xeon CPUs for RNA secondary structure prediction using SCFGs, but the hardware cost and power consumption is only about 15% and 10% of the latter respectively. Copyright 2009 ACM.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Labeled topic detection of open source software from mining mass textual project profiles

Labeled topic detection of open source software from mining ...

引用

1st International Workshop on Software Mining, SoftwareMining-2012 - Held in Conjunction with the 18th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD-2012

作者： Wang, Tao Yin, Gang Li, Xiang Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781450315609

Nowadays open source software has become an indispensable basis for both individual and industrial software engineering. Various kinds of labeling mechanisms like categories and tags are used in open source communities to annotate projects and facilitate the discovery of certain software However as large amounts of software are attached with no/few labels or the existing labels are from different ontology space, it is still hard to retrieve potentially topic-relevant software. This paper highlights the valuable semantic information of project descriptions and labels, proposes labeled software topic detection LSTD a hybrid approach combining topic models and ranking mechanisms to detect and enrich the topics of software by mining the large amount of textual software profiles, which can be employed to do software categorization and tag recommendation. LSTD makes use of labeled LDA to capture the semantic correlations between labels and descriptions and then construct the label-based topic-word matrix. Based on the generated matrix and the generality of labels, LSTD designs a simple yet eficient algorithm to detect the latent topics of software that expressed as relevant and popular labels. Comprehensive evaluations are conducted on the large-scale datasets of representative open source communities and the results validate the effectiveness of LSTD.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Special-purposed VLIW architecture for IEEE-754 quadruple precision elementary functions on FPGA

Special-purposed VLIW architecture for IEEE-754 quadruple pr...

引用

29th IEEE International Conference on Computer Design 2011, ICCD 2011

作者： Lei, Yuanwu Dou, Yong Shen, Li Zhou, Jie Guo, Song National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781457719523

This work explores the feasibility to implement IEEE-754-2008 standard quadruple precision (Quad) elementary functions on recent FPGAs with plenty of embedded memories and DSP blocks. First, we analysis the implementation algorithm of Quad elementary functions in detail. Then, we present a special-purpose Very Large Instruction Word (VLIW) architecture for Quad elementary function (QE-Processor). The proposed processor uses a unified hardware structure, equipped with multiple basic arithmetic units, to implement various Quad algebraic and transcendental functions, in which several tradeoffs between latency and resource usage are carefully planned to avoid unbalanced resource utilization. The performance is improved through the explicitly parallel technology of custom VLIW instruction. Finally, we create a prototype of QE-Processor into Xilinx Virtex-5 and Virtex-6 FPGA chips. The experimental results show that our design can guarantee that the percentage of correct rounding is more than 99.9%. Moreover, the FPGA implementation on Virtex-6 XC6VLX760-2FF1760 FPGA, running at 220 MHz, outperforms the parallel software approach based on OpenMP running on an Intel Xeon E5620 CPU at 2.40GHz by a factor of 13X-20X for special function applications in Boost library. © 2011 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

An abstract domain to infer symbolic ranges over nonnegative parameters

An abstract domain to infer symbolic ranges over nonnegative...

引用

作者： Wu, Xueguang Chen, Liqian Wang, Ji National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

The value range information of program variables is useful in many applications such as compiler optimization and program analysis. In the framework of abstract interpretation, the interval abstract domain infers numerical bounds for each program variable. However, in certain applications such as automatic parallelization, symbolic ranges are often desired. In this paper, we present a new numerical abstract domain, namely the abstract domain of parametric ranges, to infer symbolic ranges over nonnegative parameters for each program variable. The new domain is designed based on the insight that in certain contexts, program procedures often have nonnegative parameters, such as the length of an input list and the size of an input array. The domain of parametric ranges seeks to infer the lower and upper bounds for each program variable where each bound is a linear expression over nonnegative parameters. The time and memory complexity of the domain operations of parametric ranges is O(nm) where n is the number of program variables and m is the number of nonnegative parameters. On this basis, we show the application of parametric ranges to infer symbolic ranges of the sizes of list segments in programs manipulating singly-linked lists. Finally, we show preliminary experimental results. © 2014 Elsevier B.V. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Kraken: A continuous incremental data acquisition system for GitHub and git repositories 7

Kraken: A continuous incremental data acquisition system for...

引用

2017 7th International Workshop on Computer Science and Engineering, WCSE 2017

作者： Zeng, Lingbin Yin, Gang Wang, Tao Yu, Yue Fan, Qiang Li, Zhi-Xing Yu, Jie Wang, H.M. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811136719

With the quick development of open source software, quantity of software is produced in the open source community (OSC) [1]. Lots of researches are launched to study the internal regular patterns of OSC [2], [3]. GitHub is one of the most famous open source community which owns thousands software projects. As a result, there are massive and abundant data of software development activities in GitHub. With the purpose to offer an accuracy and efficient dataset of GitHub, this paper proposes Kraken which is a continuous incremental data acquisition system for GitHub. Kraken contains three main modules which are independent with each other. Kraken gets the data of GitHub from two ways: git repositories and rest API. The final result shows that Kraken could extract the commits information of git repositories and get pull requests(PRs) and issues through rest API. The commits information contains the detail development history of software and the feedbacks and wisdom of software engineers are showed through PRs and issues.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Asycome: A JointCloud Data Asynchronous Collaboration Mechanism Based on Blockchain 3rd

Asycome: A JointCloud Data Asynchronous Collaboration Mechan...

引用

3rd International Conference on Blockchain and Trustworthy Systems, Blocksys 2021

作者： Li, Linhui Shi, Peichang Fu, Xiang Zhang, Shengtian Zhong, Tao Chen, Ming National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811679926

In the Internet of Everything (IoE), due to its issues of complexity and heterogeneity, message delay cannot be guaranteed, and it is not enough to leverage a centralized model for data collaboration. By leveraging the features of blockchain and asynchronous consensus algorithms, a new trust collaboration model can be established in an untrusted environment. Besides, the scalability issue of blockchain poses a challenge to data asynchronous collaboration. In this paper, we propose Asycome, a JointCloud data asynchronous collaboration mechanism based on Directed Acyclic Graph (DAG). This mechanism introduces the new Gossip about gossip protocol, driven by message-transmitting events, to keep data synchronized in an asynchronous environment. Through two stages of voting and committing. Transactions on the same time series do not need to reach the final confirmed state before proceeding to the next transaction processing. Over time, all transactions are connected to the DAG, ensuring that the consensus is finally reached. We evaluated the performance of the mechanism with experiments on throughput and latency. And the feasibility of Asycome is analyzed from the liveness and security. The results show that higher throughput, lower latency, and Asynchronous Byzantine Fault Tolerance (ABFT) characteristics can meet the technical requirements of complex and asynchronous data collaboration of the IoE to some extent. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Providing responsiveness requirement based consistency in DVE

Providing responsiveness requirement based consistency in DV...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Zhang, Wei Zhou, Hangjun Peng, Yuxing Li, Sikun National Laboratory for Parallel and Distributed Processing School of Computer Science ChangSha 410073 China

ISBN: (纸本)9780769539003

Consistency and responsiveness are two important factors in providing the sense of reality in distributed Virtual Environment (DVE). However, it is not easy to optimize both aspects because of the trade-off between these two factors. As a result, most existing consistency maintenance methods ignored the responsiveness requirements, or just assumed a simple responsiveness requirement model which cannot meet the real need of DVE systems. In this paper, we first present a new responsiveness requirement model. The model can describe requirement satisfaction situation of each node. Base on this model, we propose a responsiveness requirement based consistency method. The method can adjust the utilization of time resource according to the requirements of different nodes and improve the overall responsiveness performance by at least 20%. Therefore, it provides a good support to increase the applicability of DVE systems. © 2009 IEEE.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共115页 << < 15 16 17 18 19 20 21 22 23 24 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：