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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

660 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

检索条件"任意字段=18th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 660 条记录，以下是281-290 订阅

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

详细简洁

排序：

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Behl, Sanjiv Verma, Rakesh M. Computer Science Department University of Houston-Victoria Victoria TX 77901 United States Computer Science Department University of Houston Houston TX 77204 United States

ISBN: (纸本)9780889867048

Multiple-disk architectures are an attractive approach to meet high performance I/O demands in I/O intensive applications such as search engines, web servers and information retrieval systems. this requires that the issues of dynamic load balancing and access parallelism be addressed, which is the goal of this paper. We address the problem of document declustering in a keyword-based information retrieval system for parallel architectures consisting of a single processor and multiple disks. We propose and evaluate experimentally four similarity-based methods, viz., set, multiset, vector, and euclidean, for declustering documents. Interestingly, our results show that for single keyword queries as well as boolean and queries the set and multiset methods generally outperform the vector and euclidean methods with set being the best for the so-called simple plan. We also introduce a highest-frequency first retrieval scenario and compare the methods under this scenario, and find that set and multiset methods are still generally superior to the other methods with the multiset outperforming the set method. We compare these methods with the (theoretically) optimal values, which are practically impossible to achieve. Finally, we approximated the multiset method using the harmonic mean and found that the results were slightly inferior than multiset method, but still better than the vector and euclidean methods.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Challenges for data mining in distributed sensor networks

Challenges for data mining in distributed sensor networks

引用

18th international conference on Pattern Recognition (ICPR 2006)

作者： Cantoni, Virginio Lombardi, Luca Lombardi, Paolo Univ Pavia Dipartimento Informat & Sistemist Via Ferrata 1 I-27100 Pavia Italy European Commission Joint Res Ctr IPSC I-21020 Ispra Italy

ISBN: (纸本)0769525210

the way of collecting sensor data will face a revolution when the newly developing technology of distributed sensor networks becomes fully functional and widely available. Smart sensors will acquire full interconnection capabilities with similar devices, so that run-time data aggregation, parallel computing, and distributed hypothesis formation will become reality with off-the-shelf components and sensor boards. this revolution started around ten years ago, and now hardware and network are converging on the first convincing solutions. Exploring and exploiting this paradigm are a renovated challenge for the pattern recognition and data mining community. this paper attempts a survey on state-of-the-art of wireless sensor technology, with an eye on data-related problems and technological limits. Although the possibilities seem promising, the today limited computational resources of individual nodes hamper the elaboration of data with recent, computationally-intensive algorithms. New software paradigms must be developed, both creating new techniques or adapting, for network computing, old algorithms of earlier ages of computing.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 8th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

Proceedings - 8th International Conference on Parallel and D...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2007

ISBN: (纸本)0769530494

the proceedings contain 79 papers. the topics discussed include: message dissemination under the multicasting communication mode;e-science in the cloud with CARMEN;exploring biocomplexity: new challenges for high performance computing;multiprocessor scheduling for distance constrained task systems;task allocation in distributed embedded systems by genetic programming;distant-based resource placement in product networks;monitoring employees' emails without violating their privacy right;email categorization using multi-stage classification technique;a trap-door method for subscription-based mobile content;improved genetic algorithms and list scheduling techniques for independent task scheduling in distributed systems;a remote memory swapping system for cluster computers;a distributed approach for negotiating resource contributions in dynamic collaboration;and performance evaluation of a novel CMP cache structure for hybrid workloads.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of multi-resolution models in distributed simulation system

Parallel implementation of multi-resolution models in distri...

引用

18th iasted international conference on Modelling and Simulation, MS 2007

作者： Liu, Baohong Hao, Jianguo Huang, Kedi College of Mechatronics Engineering and Automation National University of Defense Technology Changsha Hunan 410073 China

ISBN: (纸本)9780889866638

Multi-Resolution Modeling (MRM) is a relatively new research area. With the development of distributed interactive simulation, especially as the emergence of High Level Architecture (HLA), multi-resolution modeling becomes one of the key technologies for advanced modeling and simulation. the parallel implementation of multi-resolution models is often encountered in distributed interactive combat simulation. Correctness of parallel implementation of multi-resolution models in distributed simulation is very important to the validity of simulation result. In this paper, some key techniques on the parallel implementation of multiresolution models are studied. Two new concepts, named morphism attribute and morphism event are presented. then the problem of interaction conflict in MRM is researched. To solve this problem, three methods are given, including mutex locking, conflict detecting and model-oriented method. the affection of morphism interaction to simulation result is analyzed and some basic principles to deal with this problem are given. Our study may greatly contribute to multi-resolution modeling, and enhance the validity of simulation and engagement fairness in combat simulation.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

A free openmp compiler and run-time library infrastructure for research on shared memory parallel computing

A free openmp compiler and run-time library infrastructure f...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Karlsson, Sven Brorsson, Mats Department of Microelectronics KTH Royal Institute of Technology Sweden

OpenMP is an informal industry standard for programming parallel computers with a shared memory and has during the last few years achieved considerable acceptance in both the academic world and the industry. OpenMP is a thread-level fork-join programming model and relies on a set of compiler directives. An OpenMP aware compiler uses these directives to generate a multi-threaded application. In practice, an OpenMP run-time library is also needed as OpenMP specifies a set of run-time library calls. In this paper we report on a free OpenMP compiler and run-time library infrastructure. We present an OpenMP compiler for C called OdinMP and briefly discuss the run-time library that the compiler targets. the source code to both the compiler and the run-time libraries are available and can be freely used for OpenMP research. the compilation system is evaluated using the EPCC micro-benchmark suite for OpenMP and a set of applications from the SPLASH-2 benchmarks suite ported to OpenMP. Comparisons are made to OpenMP aware compiler systems from SGI and Intel. the performance of code generated with the presented compilation system is shown to be very close to or exceeding that of commercial compilers for a wide range of benchmark applications.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

ProjectileSort - Rule based parallel sorting algorithm - Architecture for reconfigurable multi-partition object arrays 18

ProjectileSort - Rule based parallel sorting algorithm - Arc...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2017

作者： Liyanage, Nandika Staffordshire University United Kingdom

ISBN: (纸本)9781538631515

Data can be store as structured, semi-structured or unstructured formats in various distributed environments. Extraction of data from multiple data sources or data warehouse and convert to a proper order is quite time consuming task even using the latest hardware and software technologies. Sorting is one of the key concepts that helps to improve the efficiency of various computational process. Unlike the early single processor or single server operations using monolithic applications, multi-core distributed environments required more advanced computational theories and algorithms. Existing sorting theories are basically derived from linear algorithms and enhanced to support for distributed processing. this research discuss the characteristics of existing parallel sorting algorithms, techniques, limitation. Aim and objective is to introduce a new pure parallel sorting algorithm and sorting architecture that pointing to execute under latest distributed environments. the proposed pattern and the sorting architecture can be used as rule based parallel sorting technique and algorithm to support for any type of distributed environment to sort infinite dataset. © 2017 IEEE.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

SMG: Shared memory for grids

SMG: Shared memory for grids

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Ryan, John P. Coghlan, Brian A. Computer Architecture Group Dept. of Computer Science Trinity College Dublin Dublin 2 Ireland

this paper discusses some of the salient issues involved in implementing the illusion of a shared-memory programming model across a group of distributed memory processors from a cluster through to an entire Grid. this illusion can be provided by a distributed shared memory (DSM) runtime system. Mechanisms that have the potential to increase the performance by minimizing high-latency intra site messages & data transfers are highlighted. Relaxed consistency models are investigated, as well as the use of a grid information system to ascertain topology information. the latter allows for hierarchy-aware management of shared data and synchronization variables. the process of incremental hybridization is also explored, where more efficient message-passing mechanisms can incrementally replace DSM actions when circumstances dictate that performance improvements can be obtained. In this paper we describe the overall design/architecture of a prototype system, SMG, which integrates DSM and message passing paradigms and may be the target of an OpenMP compiler. Our initial findings based on some trivial examples indicate some of the potential benefits that can be obtained for grid Applications.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Interactive Decoration Design Support System by Fitness Evaluation Based on Design Knowledge and Subjective Evaluation 18

Interactive Decoration Design Support System by Fitness Eval...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Unehara, Muneyuki Ekihiro, Yoshiki Matsumoto, Eriko Yamada, Koichi Suzuki, Izumi Nagaoka Univ Technol Dept Management & Informat Syst Sci Nagaoka Niigata Japan

ISBN: (纸本)9781509055043

this paper proposes interactive decoration design support system introducing interactive evolutionary computation. Evaluation problem existing human can be evaluated synthesizing multi objectives. the proposed system made it importance dividing the human evaluation into two part, which is including regular level of design quality and user's subjective evaluation by affective or Kansei image, and assumed to acquire good results by executing in serial order in a certain evaluation phase. From the experimental results, effectiveness of proposed methodology involving evolution by using fitness evaluation of decoration designs for quality and evolution by user evaluation are confirmed.

关键词： Interactive Genetic Algorithm Decoration Design Affective Engineering Multi Objective Optimization Problem

来源：评论

学校读者我要写书评

暂无评论

A Discrete Firefly Algorithm Based on Similarity for Graph Coloring Problems 18

A Discrete Firefly Algorithm Based on Similarity for Graph C...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Chen, Kui Kanoh, Hitoshi Univ Tsukuba Grad Sch Syst & Informat Engn Dept Comp Sci Tsukuba Ibaraki Japan Univ Tsukuba Fac Engn Informat & Syst Div Informat Engn Tsukuba Ibaraki Japan

ISBN: (纸本)9781509055043

In this paper, we propose a novel non-hybrid discrete firefly algorithm (DFA) for solving planar graph coloring problems. the original FA handles continuous optimization problems only. To apply it to discrete problems, we should redefined the original FA over discrete space. In this work, we introduce a new algorithm based on Similarity and discretize FA directly without any other hybrid algorithm. the experiments show that the proposed method outperforms the success rate of HDPSO and HDABC when solving planar graph coloring problems.

关键词： Swarm Intelligence Graph Coloring Problem Firefly Algorithm

来源：评论

学校读者我要写书评

暂无评论

EPDKS: An efficient proximity-based distributed k-ary structured overlay network

EPDKS: An efficient proximity-based distributed k-ary struct...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Alima, Luc Onana Beauport, Stefan Institut d'Informatique Université de Mons-Hainaut Avenue du Champ de Mars 6 57000 Mons Belgium

ISBN: (纸本)9780889867048

Structured peer-to-peer overlay networks provide a means for interconnecting a large set of computing nodes called peers in a distributed, scalable and self-organizing manner. Typically in such systems, each peer maintains contact information about a small subset of other peers called neighbors. these neighbors are often chosen to ensure that each lookup operation takes a logarithmic number of overlay hops under normal conditions. Relying solely on the number of overlay hops as the metric for the quality of the lookup operation is not sufficient both for the applications using the overlay network and, for the effective use of the underlying communication network which is typically the Internet. DKS [1] is a P2P middleware built upon the principle we called distributed K-ary search, which ensures that any lookup takes O(log k(N)) overlay hops, where N is the number of nodes in the system and K is the search arity. In a DKS overlay network, proximity is not considered. As a result, end-to-end latencies could be significantly large. In this paper we present EPDKS, a novel structured peer-to-peer overlay network that is based on the distributed K-ary search principle. EPDKS takes proximity into account by combining round-trip times and the number of IP hops for interconnecting peers, thereby reducing end-to-end latencies and making effective use of the underlying network. Furthermore, we propose improvements for some of the algorithms currently implemented in the DKS. Simulation results confirm our expectations that EPDKS ensures lower end-to-end latencies and smaller number of IP hops when compared to DKS.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：