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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,343 篇 会议
47 篇 期刊文献
18 册 图书

馆藏范围

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

日期分布

学科分类号

1,077 篇 工学
- 1,026 篇 计算机科学与技术...
- 463 篇 软件工程
- 189 篇 电气工程
- 99 篇 信息与通信工程
- 49 篇 控制科学与工程
- 34 篇 机械工程
- 30 篇 电子科学与技术（可...
- 19 篇 生物工程
- 13 篇 动力工程及工程热...
- 13 篇 安全科学与工程
- 12 篇 网络空间安全
- 11 篇 仪器科学与技术
- 10 篇 化学工程与技术
- 9 篇 交通运输工程
- 9 篇 生物医学工程（可授...
- 8 篇 石油与天然气工程
- 6 篇 力学（可授工学、理...
223 篇 理学
- 157 篇 数学
- 32 篇 系统科学
- 26 篇 生物学
- 22 篇 物理学
- 21 篇 统计学（可授理学、...
- 17 篇 化学
120 篇 管理学
- 84 篇 管理科学与工程(可...
- 46 篇 工商管理
- 44 篇 图书情报与档案管...
16 篇 经济学
- 16 篇 应用经济学
14 篇 法学
- 12 篇 社会学
10 篇 医学
- 8 篇 临床医学
6 篇 教育学
- 6 篇 教育学
5 篇 农学
3 篇 文学
1 篇 军事学

主题

91 篇 distributed comp...
85 篇 parallel process...
70 篇 grid computing
61 篇 cloud computing
49 篇 concurrent compu...
47 篇 computational mo...
46 篇 computer network...
45 篇 distributed comp...
38 篇 parallel computi...
37 篇 scalability
35 篇 computer archite...
31 篇 costs
30 篇 high performance...
30 篇 distributed data...
29 篇 algorithm design...
29 篇 parallel process...
29 篇 hardware
27 篇 computer science
27 篇 application soft...
27 篇 parallel program...

机构

7 篇 department of co...
6 篇 institute of com...
5 篇 oak ridge natl l...
5 篇 department of co...
4 篇 univ warwick dep...
4 篇 natl univ def te...
4 篇 chinese acad sci...
4 篇 oak ridge natl l...
4 篇 department of co...
4 篇 university of te...
3 篇 nanyang technol ...
3 篇 institute of par...
3 篇 school of engine...
3 篇 argonne natl lab...
3 篇 univ calif davis...
3 篇 univ manchester ...
3 篇 key laboratory o...
3 篇 purdue univ sch ...
3 篇 hiroshima univ d...
3 篇 cnrs laas 7 ave ...

作者

7 篇 jiannong cao
6 篇 el-baz didier
6 篇 wang huaimin
6 篇 rothermel kurt
5 篇 jack dongarra
5 篇 yin gang
4 篇 ould-khaoua moha...
4 篇 koldehofe boris
4 篇 li maozhen
4 篇 wang tao
4 篇 jeong chang-sung
4 篇 min geyong
4 篇 vlassov v
4 篇 kacsuk peter
4 篇 labarta jesus
4 篇 schulze bruno
4 篇 jin hai
4 篇 ramachandran uma...
3 篇 fahringer thomas
3 篇 taura kenjiro

语言

1,398 篇 英文
5 篇 其他
4 篇 俄文
1 篇 西班牙文

检索条件"任意字段=7th International Symposium on Parallel and Distributed Computing"

共 1408 条记录，以下是121-130 订阅

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

详细简洁

排序：

Tree-like hierarchical model for distributed micro-security system

Tree-like hierarchical model for distributed micro-security ...

引用

7th international symposium on parallel Architectures, Algorithms and Networks (I-SPAN 2004)

作者： Zhang, Q Jin, H Yi, CJ Pang, LP Huazhong Univ Sci & Technol Cluser & Grid Comp Lab Wuhan 430074 Peoples R China

ISBN: (纸本)0769521355

this paper presents a large-scale dynamic self-immune security architecture. In this architecture, a network is modeled as a hierarchy of administrators and hosts. We use a tree-like hierarchical model to guarantee security, scalability and availability of the system. We adopt a simple SSL-based authentication protocol to avoid unauthorized access to administrators, a group management mechanism for trust model, and two fault-tolerant schemes to address single point of failure of administrators.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Research of Information Retrieval in the Cloud computing Environment 7

Research of Information Retrieval in the Cloud Computing Env...

引用

7th international Conference Intelligent Computation Technology Automation (ICICTA)

作者： Ma Zhen-zhong Changsha Normal Univ Elect & Informat Engn Dept Changsha 410100 Hunan Peoples R China

ISBN: (纸本)9781479966363

With the rapid development of the cloud computing, massive information is distributed in the structure "cloud storage", leading to the heterogeneous data sources, and the "lost phenomenon" may occur in the process of information retrieval. To solve this problem, this paper builds the heterogeneous data integration model in the cloud computing environment, which includes three layers and five function modules: data acquisition and analysis interface in the cloud, data organization task scheduling engine, and heterogeneous data integrated interface based on the ontology. Also, common technologies used in unified retrieval of heterogeneous data resources are presented in this paper, such as parallel retrieval technology, server cluster retrieval technology, webpage's deep mining technology and retrieval database sharing technology.

关键词： Heterogeneous Data Information Retrieval Search Engine Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A New parallel Algorithm for the Frequent Itemset Mining Problem

A New Parallel Algorithm for the Frequent Itemset Mining Pro...

引用

7th international symposium on parallel and distributed computing

作者： Craus, Mitica Gh Asachi Tech Univ Dept Comp Sci & Engn Iasi 700050 Romania

ISBN: (纸本)9780769534725

A new parallel algorithm for finding the frequent itemsets in databases is presented. It differs fundamentally of well known Apriori algorithm, where at the beginning of every step, the dimension of the new frequent itemsets increases by I. In our algorithm the frequent itemsets are determined by progressively enlarging the interval which the individual items appertain, i.e. if at the k-th step the new candidates are from [i, i + k] intervals, i = 1, 2...., n - k, at the next step, k + 1 1, the new candidates will belong to [i, i + k + 1] intervals, i = 1, 2,..., n - k - 1. the frequent individual items are identified by their index. the basic idea is that the new frequent itemsets with individual items from the interval [i, j], simultaneously contain the items i and j. the frequent itemsets are built by sharing the work between n processors. Hereby, the processor P(i) computes, step by step, the sets F(i,j) of the frequent itemsets with individual items from the intervals [i, j], j i,..., n. In order to compute the set F(i,j), the processing unit Pi uses F(i,j-1) obtained in the previous step and F(i+1,j) received from the processor P(i+1). the main advantage of our parallel algorithm is that it uses a communication pattern known before algorithm start, which allows mapping communication to hardware. Another major advantage is that the set of the transactions can be distributed to processors prior to beginning. this is possible because a processor Pi has to compute F(i,j), j = i,..., n and therefore only the transactions containing the frequent item i are needed.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Agent and Spatial Based parallelization of Biological Network Motif Search 17

Agent and Spatial Based Parallelization of Biological Networ...

引用

2015 IEEE 17th international Conference on High Performance computing and Communications (HPCC)

作者： Kipps, Matthew Kim, Wooyoung Fukuda, Munehiro Univ Washington Comp & Software Syst 18115 NE Campus Way Bothell WA 98011 USA

ISBN: (纸本)9781479989379

Most graph algorithms are challenging in parallelization, in particular executing fine-grain computation at each graph node in parallel from both programmability and performance viewpoints. To bridge the semantic gap between the original sequential algorithms and their corresponding parallelized programs, we have been developing MASS: a parallel library for multi-agent spatial simulation. the library allows software agents to crawl a distributed array, e.g., a graph mapped over a cluster system. To demonstrate the MASS library's fitness to graph parallelization, we have focused on biological network motif search. this paper compares three different parallelizing approaches such as the MASS agent-based, MASS array-based, and the conventional MPI parallelizations, and discusses the MASS library's applicability to graph algorithms.

关键词： Biological network motif Graph algorithms Mobile agents Multi-agents parallelization

来源：评论

学校读者我要写书评

暂无评论

Flexible Linear Algebra Development and Scheduling with Cholesky Factorization 17

Flexible Linear Algebra Development and Scheduling with Chol...

引用

2015 IEEE 17th international Conference on High Performance computing and Communications (HPCC)

作者： Haidar, Azzam YarKhan, Asim Cao, Chongxiao Luszczek, Piotr Tomov, Stanimire Dongarra, Jack Univ Tennessee Knoxville TN 37996 USA Oak Ridge Natl Lab Oak Ridge TN USA Univ Manchester Manchester M13 9PL Lancs England

ISBN: (纸本)9781479989379

Modern high performance computing environments are composed of networks of compute nodes that often contain a variety of heterogeneous compute resources, such as multicore CPUs and GPUs. One challenge faced by domain scientists is how to efficiently use all these distributed, heterogeneous resources. In order to use the GPUs effectively, the workload parallelism needs to be much greater than the parallelism for a multicore-CPU. Additionally, effectively using distributed memory nodes brings out another level of complexity where the workload must be carefully partitioned over the nodes. In this work we are using a lightweight runtime environment to handle many of the complexities in such distributed, heterogeneous systems. the runtime environment uses task-superscalar concepts to enable the developer to write serial code while providing parallel execution. the task-programming model allows the developer to write resource-specialization code, so that each resource gets the appropriate sized workload-grain. Our task-programming abstraction enables the developer to write a single algorithm that will execute efficiently across the distributed heterogeneous machine. We demonstrate the effectiveness of our approach with performance results for dense linear algebra applications, specifically the Cholesky factorization.

关键词： Cholesky factorization accelerator-based distributed memory computers superscalar dataflow scheduling heterogeneous HPC computing

来源：评论

学校读者我要写书评

暂无评论

Minimizing ohmic loss in future processor IR events 06

Minimizing ohmic loss in future processor IR events

引用

7th international symposium on Quality Electronic Design

作者： Budnik, Mark M. Roy, Kaushik Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

ISBN: (纸本)0769525237

IR events are periods in time when processors draw a high level of steady state operating current. During IR events, ohmic losses occur in the power delivery path. To minimize these ohmic losses, conventional systems use parallelism to reduce the resistance of the power delivery path. As operating currents continue to increase, however, additional remedies may be required to maintain acceptable ohmic losses. We show how a processor with integrated step down converters can be used to reduce the ohmic loss in its power delivery path. In a 130nm technology node, our integrated solution can reduce the delivery path ohmic loss by 32.8%.

关键词： Voltage Regulators Optical computing Power engineering computing Power engineering and energy Steady-state parallel processing Electric resistance Power dissipation Microprocessors

来源：评论

学校读者我要写书评

暂无评论

computing the rupture degrees of graphs

Computing the rupture degrees of graphs

引用

7th international symposium on parallel Architectures, Algorithms and Networks (I-SPAN 2004)

作者： Li, FW Li, XL Nankai Univ Ctr Combinator Tianjin 300071 Peoples R China

ISBN: (纸本)0769521355

the rupture degree of a noncomplete connected graph G is defined by r(G) = max{w(G - X) - \X\ - m(G - X) : X subset of V (G), w (G - X) greater than or equal to 2}, where w (G - X) denotes the number of components in the graph G - X. For a complete graph K-n, we define r (K-n) = 1 - n. this parameter can be used to measure the vulnerability of a graph. To some extent, it represents a trade-off between the amount of work done to damage the network and how badly the network is damaged. In this paper we prove that the problem of computing the rupture degree of a graph is NP-complete. We obtain the rupture degree of the Cartesian product of some special graphs and also give the exact values or bounds for the rupture degrees of Harary graphs.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

ORthOGONAL SPACE TIME BLOCK CODING FOR TWO-WAY WIRELESS RELAY NETWORKS UNDER IMPERFECT SYNCHRONIZATION

ORTHOGONAL SPACE TIME BLOCK CODING FOR TWO-WAY WIRELESS RELA...

引用

7th IEEE international Wireless Communications and Mobile computing Conference (IWCMC)

作者： Mannai, U. N. Abdurahman, F. M. Elazreg, A. M. Chambers, J. A. Univ Loughborough Dept Elect & Elect Engn Adv Signal Proc Grp Loughborough LE11 3TU Leics England

ISBN: (纸本)9781424495375

In this paper distributed space time block codes (D-STBCs) are applied within an asynchronous two-way cooperative wireless relay network using two relay nodes. A parallel interference cancelation (PIC) detection scheme with low structural and computational complexity is applied at the terminal nodes in order to overcome the effect of imperfect synchronization among the cooperative relay nodes. Simulation results based on end-to-end bit error rate (BER) illustrate that the PIC detection algorithm can mitigate the inter symbol interference (ISI) introduced by the asynchronism, and that only a small number of iterations is necessary within the PIC detection to improve the system performance.

关键词： Cooperative relay networks two-way communication distributed space time block coding and parallel interference cancelation

来源：评论

学校读者我要写书评

暂无评论

parallel Stochastic Search for PAPR Reduction of OFDM Signal 7

Parallel Stochastic Search for PAPR Reduction of OFDM Signal

引用

Joint 7th international Conference on Soft computing and Intelligent Systems (SCIS) and 15th international symposium on Advanced Intelligent Systems (ISIS)

作者： Shigei, Noritaka Kumashiro, Hideaki Miyajima, Hiromi Kagoshima Univ 1-21-40 Korimoto Kagoshima 8900065 Japan

ISBN: (纸本)9781479959556

Tone injection (TI) is an effective technique to overcome high PAPR (peak-to-average power ratio) of OFDM. the PAPR reduction problem solved with TI is a combinatorial problem. Although the effectiveness of GA has been demonstrated for this problem, GA involves relative complex operators. this implies that, when implementing the methods of TI on digital circuits, other methods may outperform GA under the same processing time. In this paper, we investigate effective parallel search methods for the PAPR reduction, which are of simple structure for implementing digital circuits. At first, as the basis of the parallel methods, we propose two types of stochastic search methods. the one is Flip-Probability-specified type (FP) search and the other is a specified-Number-of-Flips type (NF) search. Both of them use only simple stochastic operators. then, we propose an effective digital circuit implementation of the solution evaluation function. Finally, we propose a parallel search method based on FP and NF search. the simulation results show that, the proposed parallel search methods can improve not only the processing speed but also the quality of the solution.

关键词： OFDM modulation combinatorial mathematics digital circuits genetic algorithms radiocommunication search problems stochastic processes stochastic programming telecommunication computing FP search GA NF search OFDM signal PAPR reduction TI combinatorial problem digital circuit implementation flip-probability-specified type search genetic algorithm orthogonal frequency division multiplexing parallel stochastic search method peak-to-average power ratio specified-number-of-flip type search tone injection wireless communication Digital circuits Genetic algorithms Noise measurement Peak to average power ratio Search methods Simulation

来源：评论

学校读者我要写书评

暂无评论

Optimizing protocol parameters to large scale PC cluster and evaluation of its effectiveness with parallel data mining 7

Optimizing protocol parameters to large scale PC cluster and...

引用

7th international symposium on High Performance distributed computing

作者： Oguchi, M Shintani, T Tamura, T Kitsuregawa, M Univ Tokyo Inst Ind Sci Minato Ku Tokyo 1068558 Japan

ISBN: (纸本)0818685794

Recently, PC clusters have come to be studied intensively, for a large scale parallel computer in the next generation. ATM technology is a strong candidate as a de facto standard of high speed communication networks. therefore an ATM connected PC cluster is very promising platform from the cost/performance point of view, as a future high performance computing environment. In this paper, an ATM connected PC cluster consists of 100 PCs is reported, and characteristics of a transport layer protocol for the PC cluster are evaluated. Point-to-point communication performance is measured and discussed when a TCP window size parameter is changed. Retransmission caused by cell loss at the ATM switch is analyzed, and parameters of retransmission mechanism suitable for parallel processing on the large scale PC cluster are clarified In the viewpoint of applications, data intensive applications such as data mining and ad-hoc query processing in databases are considered very important for massively parallel processors, in addition to the conventional scientific calculation. thus investigating the feasibility of such applications on an ATM connected PC cluster is quite meaningful. parallel data mining is implemented and evaluated on the cluster. Default TCP protocol cannot provide good performance, since a lot of collisions happen during all-to-all multicasting executed on the large scale PC cluster. Using TCP parameters according to the proposed optimization, sufficient performance improvement is achieved for parallel data mining on 100 PCs.

关键词： Transmission control protocol

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共141页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：