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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是331-340 订阅

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

详细简洁

排序：

parallel Processing - 18th international conference, Euro-Par 2012, Proceedings

引用

18th international conference on parallel Processing, Euro-Par 2012

ISBN: (纸本)9783642328190

the proceedings contain 76 papers. the topics discussed include: selfish distributed optimization;tulipse: a visualization framework for user-guided parallelization;pattern-independent detection of manual collectives in MPI programs;a type-based approach to separating protocol from application logic: a case study in hybrid computer programming;energy consumption modeling for hybrid computing;HPC file systems in wide area networks: understanding the performance of luster over wan;understanding I/O performance using I/O skeletal applications;CRAW/P: a workload partition method for the efficient parallel simulation of manycores;job scheduling using successive linear programming approximations of a sparse model;speed scaling on parallel processors with migration;dynamic distributed scheduling algorithm for state space search;and using load information in work-stealing on distributed systems with non-uniform communication latencies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

18th IFIP WG 6.1 international conference on Coordination Models and Languages, COORDINATION 2016 and Held as Part of the 11th international Federated conference on distributed computing Techniques, DisCoTec 2016

18th IFIP WG 6.1 International Conference on Coordination Mo...

引用

18th IFIP WG 6.1 international conference on Coordination Models and Languages, COORDINATION 2016 and Held as Part of the 11th international Federated conference on distributed computing Techniques, DisCoTec 2016

ISBN: (纸本)9783319395180

the proceedings contain 16 papers. the special focus in this conference is on Coordination Models and Languages. the topics include: Multilevel transitive and intransitive non-interference, causally;a game interpretation of retractable contracts;tuple spaces implementations and their efficiency;on-the-fly mean-field model-checking for attribute-based coordination;scheduling games for concurrent systems;an asynchronous parallel abstraction for speculative pipeline computations;modelling ambulance deployment with CARMA;on synchronous and asynchronous compatibility of communicating components;a formal analysis of the global sequence protocol;improving gossip dynamics through overlapping replicates;from modelling to systematic deployment of distributed active objects;an interference-free programming model for network objects and on sessions and infinite data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using unfolding to minimize inter-iteration dependencies

Using unfolding to minimize inter-iteration dependencies

引用

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

作者： O'Neil, Timothy W. Sha, Edwin H.-M. Computer Science Dept. University of Akron Akron OH 44325-4002 Computer Science Dept. Univ. of Texas at Dallas Richardson TX 75083-0688

Since data dependencies greatly decrease instruction level parallelism, minimizing dependencies becomes a crucial part of the process of parallelizing sequential code. Eliminating all unnecessary hazards leads to the more efficient use of resources, fewer processor stalls and easily maintainable code. Previously we proposed a novel approach for eliminating redundant data dependencies from code. In this paper, we review this method and show how this elimination technique may be combined with unfolding so as to parallelize code even further.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Reliability for network swapping systems that support migration of remotely swapped pages

Reliability for network swapping systems that support migrat...

引用

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

作者： Newhall, Tia Mitchell, Benjamin Rosse, Julian Swarthmore College Swarthmore PA United States

Network swapping systems allow individual cluster nodes with over-committed memory to use the idle memory of remote nodes as their backing store, and to swap their pages over the network. As the number of nodes in a cluster increases, it becomes more likely that a node will fail or become unreachable, making it important that such a system provide reliability support. Without reliability, a single node crash can affect programs running on other cluster nodes by losing remotely swapped page data that was stored on the crashed node. Our network swapping system, Nswap, has design features that complicate reliability: swapped pages can migrate from one node to another in response to changes in a node's local memory needs. As a result, reliability schemes that rely on fixed placement of page and reliability data are not applicable to our system. Our reliability solutions solve the unique challenge of providing reliability to network swapping systems that both support dynamic changes to the size of remote RAM swap space and support migration of remotely swapped page data. Results show that even though our Mirroring reliability scheme adds time and space overhead to Nswap, it still outperforms swapping to disk by a factor of up to 8.2. Our dynamic Parity scheme will provide reliability with minimal time and space overhead.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

WPress: An Application-Driven Performance Benchmark For Cloud-Based Virtual Machines 18

WPress: An Application-Driven Performance Benchmark For Clou...

引用

18th IEEE international Enterprise distributed Object computing conference (EDOC)

作者： Borhani, Amir Hossein Leitner, Philipp Lee, Bu-Sung Li, Xiaorong Hung, Terence Inst High Performance Comp Singapore 13863 Singapore Univ Zurich Seal Software Evolut & Architecture Lab CH-8006 Zurich Switzerland Nanyang Technol Univ Sch Comp Engn Parallel & Distributed Comp Ctr Singapore 639798 Singapore

ISBN: (纸本)9781479954704

Approaching a comprehensive performance benchmark for on-line transaction processing (OLTP) applications in a cloud environment is a challenging task. Fundamental features of clouds, such as the pay-as-you-go pricing model and unknown underlying configuration of the system, are contrary to the basic assumptions of available benchmarks such as TPC-W or RUBiS. In this paper, we introduce a systematic performance benchmark approach for OLTP applications on public clouds that use virtual machines (VMs). We propose WPress benchmark, which is based on the widespread blogging software, WordPress, as a representative OLTP application and implement an open source workload generator. Furthermore, we utilize a CPU micro-benchmark to investigate CPU performance of cloud-based VMs in greater detail. Average response time and total VM cost are the performance metrics measured by WPress. We evaluate small and large instance types of three real-life cloud providers, Amazon EC2, Microsoft Azure and Rackspace cloud. Results imply that Rackspace cloud has better average response times and total VM cost on small instances. However, Microsoft Azure is preferable for large instance type.

关键词： Benchmarking Cloud computing Virtual Machine Amazon EC2 Microsoft Azure Rackspace Cloud OLTP CPU Micro-Benchmark

来源：评论

学校读者我要写书评

暂无评论

Nature-Inspired Optimization Method : Hydrozoan Algorithm for Solving Continuous Problems 18

Nature-Inspired Optimization Method : Hydrozoan Algorithm fo...

引用

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

作者： Tansui, Daranat thammano, Arit King Mongkuts Inst Technol Ladkrabang Fac Informat Technol Computat Intelligence Lab Bangkok 10520 Thailand

ISBN: (纸本)9781509055043

In this article, a new optimization algorithm that is inspired by the biology of hydrozoa (HA) is proposed. Our aim was to develop an algorithm that is based on the regeneration and transplantation processes of hydrozoa for finding the best solutions for continuous optimization problems. Basically, HA follows the same general processes of evolutionary algorithm;however, its distinctive processes mimic the life cycle of 3 basic forms of hydrozoa: motile planula, polyps, and medusa. In particular, the growth of strong buds from the polyp stage depends on levels of morphogens: activators and inhibitors. these 3 forms develop or evolve into the best solution. HA was performance tested with 20 standard benchmark functions and compared with genetic algorithm and Particle Swarm Optimization (PSO). the test results have confirmed that the proposed algorithm is computationally more efficient than both GA and PSO. It works very well on most benchmark functions.

关键词： nature-inspired optimization method hydrozoan life cycle continuous optimization problems

来源：评论

学校读者我要写书评

暂无评论

Automatic Manga Colorization with Color Style by Generative Adversarial Nets 18

Automatic Manga Colorization with Color Style by Generative ...

引用

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

作者： Kataoka, Yuusuke Matsubara, Takashi Uehara, Kuniaki Kobe Univ Grad Sch Syst Informat Kobe Hyogo Japan

ISBN: (纸本)9781509055043

Many comic books are now published as digital books, which easily provide color contents compared to the physical books. the motivation of automatic colorization of comic books now arises. Previous studies colorize sketches without other clues or with spatial color annotations. they are expected to reduce workloads of comic artists but still require spatial color annotations for desirable colorizations. this study introduces a color style information and combines it with conditional adversarially learned inference. the experimental results demonstrate that the objects are painted with colors depending on the color style information and that the color style information extracted from a color image supports to painting an object with a desirable color.

关键词： Estimation Field programmable gate arrays OFDM Modulation Filtration Clocks Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel computation for luc cryptosystems on distributed memory multiprocessor machine

Parallel computation for luc cryptosystems on distributed me...

引用

4th iasted international conference on Advances in Computer Science and Technology, ACST 2008

作者： Ali, Zulkarnain Md Othman, Mohamed Said, Mohd Rushdan Muhd Sulaiman, Mohammad Nasir Department of Computer Science Universiti Kebangsaan Malaysia 43600 Bangi Selangor Malaysia

ISBN: (纸本)9780889867307

Cryptosystem based on Lucas Function is known as LUC Cryptosystems. Lucas Function is a special form of second order linear recurrence relation using a large public integer as a modulus. We are sure that, an existing computation technique will suffer a huge computations time and spaces when calculating a very large size of public-key and private-key. Recently, a method for fast LUC Cryptosystems computation on single processor has been proposed. In this paper, we extend the method in parallel on distributed memory multiprocessor machine using message-passing interface. We are generating a special sequence from a given value of public-key and private-key. this special sequence will be used to direct the computation of LUC. We examine the parallelism efficiency of the algorithm by analyze the simulation time and speedup.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Text Mining and Pattern Clustering for Relation Extraction of Breast Cancer and Related Genes 18

Text Mining and Pattern Clustering for Relation Extraction o...

引用

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

作者： Kawashima, Koya Bai, Wenjun Quan, Changqin Kobe Univ Grad Sch Syst Informat Dept Computat Sci Kobe Hyogo Japan

ISBN: (纸本)9781509055043

With the number increase of biomedical literatures, biomedical relation extraction discovery from the literature represents a new challenge for researchers in recent years. then, a system that automatically extracts the related genes to the targeted disease is required. In this paper, we explore text mining and pattern clustering for relation extraction of breast cancer and related genes. It can be considered an unsupervised method and labeled data is not necessary. We firstly extract the candidate genes related to breast cancer by checking the window distance between the appearance of genes and breast cancer in a sentence. then, two different clustering approaches (simple clustering and K-means clustering) are applied for finding the candidate association words that indicate the relationship between breast cancer and genes. the comparison experiment demonstrates that simple clustering is superior to K-means clustering in this task.

关键词： text mining clustering relation extraction breast cancer biomedical literatures

来源：评论

学校读者我要写书评

暂无评论

A Novel Passenger Hotspots Searching Algorithm for Taxis in Urban Area 18

A Novel Passenger Hotspots Searching Algorithm for Taxis in ...

引用

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

作者： Dong, Yuhan Qian, Siyuan Zhang, Kai Zhai, Yongzhi Tsinghua Univ Grad Sch Shenzhen Beijing Peoples R China Xian Univ Posts & Telecommun Sch Commun & Info Engn Xian Shaanxi Peoples R China

ISBN: (纸本)9781509055043

Passenger hotspots searching is essential to increase profits for taxis drivers in urban area. In this paper, we propose a two-step approach for pick-up hotspots searching. In the first step, a traveling similarity model is built to quantify the similarity of traveling behaviors. In the second step, we utilize affinity propagation and simulated annealing to identify the daily passenger hotspots in a selected period. Numerical results based on GPS data of Manhattan taxis suggest that the proposed approach outperforms the traditional spatio-temporal clustering regardless of buffer radius.

关键词： Pick-up hotspots trajectories mining traveling behavior affinity propagation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：