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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

3,536 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3536 条记录，以下是721-730 订阅

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

详细简洁

排序：

A parallel interest matching algorithm for distributed-memory systems 11

A parallel interest matching algorithm for distributed-memor...

引用

15th ieee/ACM International symposium on distributed Simulation and Real Time Applications, DS-RT 2011

作者： Liu, Elvis S. theodoropoulos, Georgios K. School of Computer Science University of Birmingham United Kingdom IBM Research Dublin Research Lab. Ireland

ISBN: (纸本)9780769545530

As the scale of distributed Virtual Environments (DVEs) grows in terms of participants and virtual entities, using interest management schemes to reduce bandwidth consumption becomes increasingly common for DVE development. the interest matching process is essential for most of the interest management schemes which determines what data should be sent to the participants as well as what data should be filtered. However, if the computational overhead of interest matching is too high, it would be unsuitable for real-time DVEs for which runtime performance is important. this paper presents a new approach of interest matching which divides the workload of matching process among a cluster of computers. Experimental evidence shows that our approach is an effective solution for the real-time applications. © 2011 ieee.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Quantitative Evaluation of distributed Cavity Phase Shifts to Improve the Accuracy of SYRTE FO2

Quantitative Evaluation of Distributed Cavity Phase Shifts t...

引用

5th Joint Conference of the 65th ieee International Frequency Control symposium / 25th European Frequency and Time Forum

作者： Guena, J. Bize, S. Clairon, A. Li, R. Gibble, K. Observ Paris UPMC CNRS UMR 8630 LNE SYRTE Paris France Penn State Univ Dept Phys University Pk PA 16802 USA

ISBN: (纸本)9781612841106

We report measurements and ab initio calculations of the distributed cavity phase (DCP) shifts of the LNE-SYRTE FO2 atomic fountain clock. the measurements and validated model provide the first complete and quantitative evaluation of the DCP shift in an atomic fountain, reducing the FO2 DCP uncertainty to +/- 8.4x10(-17). Here we emphasize the experimental techniques that precisely determine the fountain parameters to stringently test the DCP model.

关键词： Atomic clocks Atomic measurements Cavity resonators DCP shifts FO2 DCP uncertainty Feeds LNE-SYRTE FO2 atomic fountain clock Measurement by laser beam Microwave oscillators Pollution measurement ab initio calculations atomic clocks distributed cavity phase shifts quantitative evaluation

来源：评论

学校读者我要写书评

暂无评论

distributed simulation of situated multi-agent systems 11

Distributed simulation of situated multi-agent systems

引用

15th ieee/ACM International symposium on distributed Simulation and Real Time Applications, DS-RT 2011

作者： Cicirelli, Franco Giordano, Andrea Nigro, Libero Italy

ISBN: (纸本)9780769545530

this work develops techniques for modeling and distributed simulation of complex situated multi-agent systems, which are highly dynamic and possess an intrinsic spatial character. Each agent owns its spatial coordinates and acts and interacts with its peers in a hosting territory. In a distributed/parallel scenario of a typical situated agent model, the territory represents a huge shared variable. Frequent access by agents to territory information easily becomes a bottleneck degrading system performance and scalability. this paper proposes an original approach and supporting API to distributing situated multi-agent models using actors. the approach exploits time management for resolving conflicts and to achieve data consistency. Approach contribution is twofold: (a) it simplifies M&S tasks by making the modeler unaware of distribution concerns, (b) it is capable of ensuring good model scalability and simulation performance. Practical aspects of the approach are demonstrated by a Tile-World model and its distributed simulation experiments. © 2011 ieee.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Completely distributed particle filters for target tracking in sensor networks

Completely distributed particle filters for target tracking ...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Jiang, Bo Ravindran, Binoy Department of Electrical and Computer Engineering Virginia Tech. Blacksburg VA 24061 United States

ISBN: (纸本)9780769543857

Particle filters (or PFs) are widely used for the tracking problem in dynamic systems. Despite their remarkable tracking performance and flexibility, PFs require intensive computation and communication, which are strictly constrained in wireless sensor networks (or WSNs). thus, distributed particle filters (or DPFs) have been studied to distribute the computational workload onto multiple nodes while minimizing the communication among them. However, weight normalization and resampling in generic PFs cause significant challenges in the distributed implementation. Few existing efforts on DPF could be implemented in a completely distributed manner. In this paper, we design a completely distributed particle filter (or CDPF) for target tracking in sensor networks, and further improve it with neighborhood estimation toward minimizing the communication cost. First, we describe the particle maintenance and propagation mechanism, by which particles are maintained on different sensor nodes and propagated along the target trajectory. then, we design the CDPF algorithm by adjusting the order of PFs' four steps and leveraging the data aggregation during particle propagation. Finally, we develop a neighborhood estimation method to replace the measurement broadcasting and the calculation of likelihood functions. With this approximate estimation, the communication cost of DPFs can be minimized. Our experimental evaluations show that although CDPF incurs about 50% more estimation error than semi-distributed particle filter (or SDPF), its communication cost is lower than that of SDPF by as much as 90%. © 2011 ieee.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

parallelization of high dynamic range image creation on multi-core processor architectures

Parallelization of high dynamic range image creation on mult...

引用

2011 10th International symposium on parallel and distributed Computing, ISPDC 2011

作者： Spoiala, Vlad-Marian Slusanschi, Emil Dagadita, Monica Bancu, Cristian Computer Science and Engineering Department University Politehnica of Bucharest Romania

ISBN: (纸本)9780769545400

the emergence of multi-core processor architectures and of diverse parallel computing paradigms has permeated into the area of mainstream computing. In this paper we present various parallelization approaches to High Dynamic Range image creation, a rising technology employed in the field of imaging manipulation and processing. OpenMP and Pthreads implementation details are provided, and the performance and load-balancing capabilities of each approach is discussed, together with a scheme for overlapping I/O intensive regions with CPU-bound sections of the code, on three relevant datasets with resolutions spanning from 1:2 to 20 Mega Pixels. © 2011 ieee.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Comparing parallel simulation of social agents using Cilk and OpenCL 11

Comparing parallel simulation of social agents using Cilk an...

引用

15th ieee/ACM International symposium on distributed Simulation and Real Time Applications, DS-RT 2011

作者： Moser, Dominik Riener, Andreas Zia, Kashif Ferscha, Alois Johannes Kepler University Linz Institute for Pervasive Computing A-4040 Linz Austria

ISBN: (纸本)9780769545530

Recent advances in wireless/mobile communication and body worn sensors, together with ambient intelligence and seamless integrated pervasive technology have paved the way for applications operating based on social signals, i.e., sensing and processing of group behavior, interpersonal relationships, or emotions. thinking in large, it should be apparent that modeling social systems allowing to study crowd behavior emerging from individual entities' (agents') condition and/or characteristics is, in fact, a challenging task. To address the heterogeneity, analytical agent-based models (ABMs) are gaining popularity due to its capability of directly representing individual entities and their interactions, unfortunately, ABMs (in which each agent has unique behavior) are not very well suited for large populations, expressed by exponentially rising simulation time. To solve this problem, the questions (i) how does the parallel execution of such models scale with capabilities of both the machine (number of cores, cluster size, etc.) and agents (behavioral adaptation function, interaction extent, etc.) and (ii) what is, in comparison, the performance coefficient applying the approach of model execution on graphical processors (GPUs) with its different pipelining architecture, need answers. To this end, we have performed simulation runs with parameter variation on a real parallel and distributed hardware platform using Cilk as well as on a GPU employing OpenCL. Simulation efficiency for two realistic models with varying complexity on a scale of 107 agents has shown the usefulness of both approaches. © 2011 ieee.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

parallel metagenomic sequence clustering via sketching and maximal quasi-clique enumeration on map-reduce clouds

Parallel metagenomic sequence clustering via sketching and m...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Yang, Xiao Zola, Jaroslaw Aluru, Srinivas Department of Electrical and Computer Engineering Iowa State University Ames IA United States Department of Computer Science and Engineering Indian Institute of Technology Bombay Mumbai India

ISBN: (纸本)9780769543857

Taxonomic clustering of species is an important and frequently arising problem in metagenomics. High-throughput next generation sequencing is facilitating the creation of large metagenomic samples, while at the same time making the clustering problem harder due to the short sequence length supported and unknown species sampled. In this paper, we present a parallel algorithm for hierarchical taxonomic clustering of large metagenomic samples with support for overlapping clusters. We adapt the sketching techniques originally developed for web document clustering to deduce significant similarities between pairs of sequences without resorting to expensive all vs. all alignments. We formulate the metagenomics classification problem as that of maximal quasi-clique enumeration in the resulting similarity graph, at multiple levels of the hierarchy as prescribed by different similarity thresholds. We cast execution of the underlying algorithmic steps as applications of the map-reduce framework to achieve a cloud based implementation. Apart from solving an important problem in metagenomics, this work demonstrates the applicability of map-reduce framework in relatively complicated algorithmic settings. © 2011 ieee.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

2011 ieee International symposium on parallel and distributed processing, Workshops and Phd Forum, IPDPSW 2011

2011 IEEE International Symposium on Parallel and Distribute...

引用

25th ieee International parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

ISBN: (纸本)9780769543857

the proceedings contain 267 papers. the topics discussed include: an agent-based approach to reconciling data heterogeneity in cyber-physical systems;NVCR: a transparent checkpoint-restart library for NVIDIA CUDA;use of Internet embedding tools for heterogeneous resources aggregation;a high-level power model for MPSoC on FPGA;modular framework for multi-level multi-device MPSoC simulation;a heterogeneous multicore system on chip with run-time reconfigurable virtual FPGA architecture;a scalable microarchitecture design that enables dynamic code execution for variable-issue clustered processors;CRM: configurable range memory for fast reconfigurable computing;tuple spaces in hardware for accelerated implicit routing;an FPGA-based accelerator to speed-up matrix multiplication of floating point operations;the SecretBlaze: a configurable and cost-effective open-source soft-core processor;and bitonic sorting on dynamically reconfigurable architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Unique parallel processing Technique for Generating Digital Chirp Signals for the Applications of Synthetic Aperture Radar

A Unique Parallel Processing Technique for Generating Digita...

引用

UKSim 5th European Modelling symposium on Computer Modelling and Simulation (EMS)

作者： Samarah, Ashraf Albashar, Alaa Loffeld, Otmar Univ Siegen Ctr Sensor Syst ZESS D-57068 Siegen Germany

ISBN: (纸本)9780769546193

this paper proposes a unique parallel processing technique to generate a high bandwidth digital chirp signal up to 320 MHz with 200 MHz clock frequency using the approximation of the piecewise parabolic interpolation for the applications of radar, particularly Synthetic Aperture Radar (SAR). In this work, a smart parallel processing technique with 4 threads is completely derived, implemented and exploited to increase the bandwidth of the generated chirp signals using a hybrid system based on direct digital frequency synthesizer with low cost and minimal hardware overhead, in addition to having a smaller ROM size with respect to the other existing techniques in the literature.

关键词： digital chirp signal piecewise parabolic interpolation parallel processing technique

来源：评论

学校读者我要写书评

暂无评论

HSK: A hierarchical parallel simulation kernel for multicore platform

HSK: A hierarchical parallel simulation kernel for multicore...

引用

9th ieee International symposium on parallel and distributed processing with Applications, ISPA 2011

作者： Wenjie, Tang Yao, Yiping Department of Computer Science National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9780769544281

the development of CPU has stepped into the era of multi-core. Due to lack of support on thread level, most of the simulation platform can not take full advantage of multicore. To fulfill this gap, we proposed a hierarchical parallel simulation kernel(HSK) model. the model has two layers. the first layer, named processkernel, was responsible for managing all threadkernels on second layer. the second layer is a group of threadkernels, which were responsible for scheduling and advancing logical processes. Each threadkernel was mapped onto an executing thread to advance simulation parallel. In addition, two algorithms were proposed to support high performance: (1) To improve the communication efficiency between threads, we proposed a pointer-based communication mechanism. By using buffers, synchronization between threads can be annihilated. (2) To eliminate redundant Lower Bound on Time Stamp(LBTS) computation and not to interrupt thread execution, we employ an approximate method to compute LBTS asynchronously. A proof of validity was presented. the execution performance of HSK was demonstrated by a series of simulation experiments with a modified phold model. the HSK can achieve good speedup for applications, especially with coarse-grained event. © 2011 ieee.

关键词： Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 69 70 71 72 73 74 75 76 77 78 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：