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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,713 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,298 篇 工学
- 1,197 篇 计算机科学与技术...
- 536 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
165 篇 管理学
- 116 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

155 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
68 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 grid computing

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 shen hong
11 篇 rothermel kurt
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,724 篇 英文
30 篇 俄文
9 篇 其他
4 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1767 条记录，以下是731-740 订阅

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

详细简洁

排序：

A parallel, distributed-Memory Framework for Comparative Motif Discovery 1

引用

10th international conference on parallel Processing and Applied Mathematics (PPAM)

作者： De Witte, Dieter Van Bel, Michiel Audenaert, Pieter Demeester, Piet Dhoedt, Bart Vandepoele, Klaas Fostier, Jan Univ Ghent iMinds Dept Informat Technol INTEC Ghent Belgium

ISBN: (数字)9783642551956

ISBN: (纸本)9783642551956

the increasing number of sequenced organisms has opened new possibilities for the computational discovery of cis-regulatory elements ('motifs') based on phylogenetic footprinting. Word-based, exhaustive approaches are among the best performing algorithms, however, they pose significant computational challenges as the number of candidate motifs to evaluate is very high. In this contribution, we describe a parallel, distributed-memory framework for de novo comparative motif discovery. Within this framework, two approaches for phylogenetic footprinting are implemented: an alignment-based and an alignment-free method. the framework is able to statistically evaluate the conservation of motifs in a search space containing over 160 million candidate motifs using a distributed-memory cluster with 200 CPU cores in a few hours. Software available from http://***/blsspeller/

关键词： Motif discovery Phylogenetic footprinting parallel computing distributed memory

来源：评论

学校读者我要写书评

暂无评论

parallel Computations in the Volunteer-Based Comcute System

Parallel Computations in the Volunteer-Based Comcute System

引用

10th international conference on parallel Processing and Applied Mathematics (PPAM)

作者： Czarnul, Pawel Kuchta, Jaroslaw Matuszek, Mariusz Gdansk Univ Technol Fac Elect Telecommun & Informat Gdansk Poland

ISBN: (纸本)9783642552243

the paper presents Comcute which is a novel multi-level implementation of the volunteer based computing paradigm. Comcute was designed to let users donate the computing power of their PCs in a simplified manner, requiring only pointing their web browser at a specific web address and clicking a mouse. the server side appoints several servers to be in charge of execution of particular tasks. thanks to that the system can survive failures of individual computers and allow definition of redundancy of desired order. On the client side, computations are executed within web browsers using technologies such as Java, JavaScript, Adobe Flash etc. without the need for installation of additional software. this paper presents results of scalability experiments carried on the Comcute system.

关键词： Volunteer computing parallel computations Scalability Reliability

来源：评论

学校读者我要写书评

暂无评论

High-Performance Zonal Histogramming on Large-Scale Geospatial Rasters Using GPUs and GPU-Accelerated Clusters 28

High-Performance Zonal Histogramming on Large-Scale Geospati...

引用

28th IEEE international parallel & distributed Processing Symposium Workshops (IPDPSW)

作者： Zhang, Jianting Wang, Dali CUNY City Coll Dept Comp Sci New York NY 10031 USA Oak Ridge Natl Lab Environm Sci Div Oak Ridge TN USA

ISBN: (纸本)9781479941162

Hardware Accelerators are playing increasingly important roles in achieving desired performance from desktop to cluster computing. While General Purpose computing on Graphics Processing Units (GPGPU) technologies have been widely applied to computing intensive applications, there is relatively little work on using GPUs and GPU-accelerated clusters for data intensive computing that typically involves significant irregular data accesses. In this study, we report our designs and implementations of a popular geospatial operation called Zonal Histogramming on Nvidia GPUs. Given a zonal dataset in the form of a collection of polygons and a geospatial raster that can be considered as a 2D grid, for each polygon, Zonal Histogramming computes a histogram of the values of raster cells that fall within the polygon. Our experiments on 3000+ US counties (polygons) over 20+ billion NASA Shuttle Radar Topography Mission (SRTM) 30 meter resolution Digital Elevation Model (DEM) raster cells have shown that, an impressive 46 seconds end-to-end runtime can be achieved using a single Nvidia GTX Titan GPU device. the runtime is further reduced to similar to 10 seconds using 8 nodes on ORNL's Titan GPU-accelerated cluster. the desired high performance opens many possibilities for large-scale geospatial computing that is important for environmental and climate research.

关键词： Zonal Histogramming Geospatial Rasters Point-in-Polygon Test parallel computing GPU

来源：评论

学校读者我要写书评

暂无评论

Information-theoretical secure verifiable secret sharing with vector space access structures over bilinear groups

Information-theoretical secure verifiable secret sharing wit...

引用

10th international conference on Information Security Practice and Experience, ISPEC 2014

作者： Zhang, Jie Zhang, Futai School of Computer Science and Technology Nanjing Normal University 210097 Nanjing China Jiangsu Engineering Research Center on Information Security and Privacy Protection Technology 210097 Nanjing China

ISBN: (纸本)9783319063195

Verifiable secret sharing (VSS) is a fundamental tool of threshold cryptography and distributed computing. A number of VSS schemes for sharing a secret that is an element of a finite field, either on threshold access structures or on general access structures have been available. In this paper, we study the verifiably sharing of a random element of a bilinear group on vector space access structures. We propose such two information-theoretical secure schemes: a basic scheme and a modified one with improved efficiency. the basic one is more general for applications while the modified one has a smaller computational cost compared with the basic one. the computational cost as well as the security analysis for the proposed schemes are presented. © 2014 Springer international Publishing.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Protecting Movement Trajectories through Fragmentation 10

Protecting Movement Trajectories Through Fragmentation

引用

10th international conference on Mobile and Ubiquitous Systems - computing, Networking, and Services (MOBIQUITOUS)

作者： Wernke, Marius Duerr, Frank Rothermel, Kurt Univ Stuttgart Inst Parallel & Distributed Syst IPVS D-70569 Stuttgart Germany

ISBN: (纸本)9783319115689

Location-based applications (LBAs) like geo-social networks, points of interest finders, and real-time traffic monitoring applications have entered people's daily life. Advanced LBAs rely on location services (LSs) managing movement trajectories of multiple users in a scalable fashion. However, exposing trajectory information raises user privacy concerns, in particular if LSs are non-trusted. For instance, an attacker compromising an LS can use the retrieved user trajectory for stalking, mugging, or to trace user movement. To limit the misuse of trajectory data, we present a new approach for the secure management of trajectories on non-trusted servers. Instead of providing the complete trajectory of a user to a single LS, we split up the trajectory into a set of fragments and distribute the fragments among LSs of different providers. By distributing fragments, we avoid a single point of failure in case of compromised LSs, while different LBAs can still reconstruct the trajectory based on user-defined access rights. In our evaluation, we show the effectiveness of our approach by using real world trajectories and realistic attackers using map knowledge and statistical information to predict and reconstruct the user's movement.

关键词： Location management Fragmentation Trajectories Privacy

来源：评论

学校读者我要写书评

暂无评论

Scalable and Efficient parallel Selection

Scalable and Efficient Parallel Selection

引用

10th international conference on parallel Processing and Applied Mathematics (PPAM)

作者： Siebert, Christian Rhein Westfal TH Aachen Dept Comp Sci Lab Parallel Programming Aachen Germany

ISBN: (纸本)9783642552243

Selection algorithms find the kth smallest element from a set of elements. Although there are optimal parallel selection algorithms available for theoretical machines, these algorithms are not only difficult to implement but also inefficient in practice. Consequently, scalable applications can only use few special cases such as minimum and maximum, where efficient implementations exist. To overcome such limitations, we propose a general parallel selection algorithm that scales even on today's largest supercomputers. Our approach is based on an efficient, unbiased median approximation method, recently introduced as median-of-3 reduction, and Hoare's sequential QuickSelect idea from 1961. the resulting algorithm scales with a time complexity of O(log(2) n) for n distributed elements while needing only O(1) space. Furthermore, we prove it to be a practical solution by explaining implementation details and showing performance results for up to 458, 752 processor cores.

关键词： Selection QuickSelect Median parallel algorithms MPI

来源：评论

学校读者我要写书评

暂无评论

FooPar: A Functional Object Oriented parallel Framework in Scala 1

引用

10th international conference on parallel Processing and Applied Mathematics (PPAM)

作者： Hargreaves, Felix Palludan Merkle, Daniel Univ Southern Denmark Dept Math & Comp Sci Odense Denmark

ISBN: (数字)9783642551956

ISBN: (纸本)9783642551956

We present FooPar, an extension for highly efficient parallel computing in the multi-paradigm programming language Scala. Scala offers concise and clean syntax and integrates functional programming features. Our framework FooPar combines these features with parallel computing techniques. FooPar is designed to be modular and supports easy access to different communication backends for distributed memory architectures as well as high performance math libraries. In this article we use it to parallelize matrix-matrix multiplication and show its scalability by a isoefficiency analysis. In addition, results based on a empirical analysis on two supercomputers are given. We achieve close-to-optimal performance wrt. theoretical peak performance. Based on this result we conclude that FooPar allows programmers to fully access Scalas design features without suffering from performance drops when compared to implementations purely based on C and MPI.

关键词： Functional programming Isoefficiency Matrix multiplication

来源：评论

学校读者我要写书评

暂无评论

Large-Scale Scientific computing: 9th international conference, LSSC 2013, Sozopol, Bulgaria, June 3-7, 2013. Revised Selected Papers

Large-Scale Scientific Computing: 9th International Conferen...

引用

2014年

作者： Ivan Lirkov Svetozar D Margenov Jerzy Waśniewski

ISBN: (纸本)9783662438817

this book constitutes the thoroughly refereed post-conference proceedings of the 9th international conference on Large-Scale Scientific Computations, LSSC 2013, held in Sozopol, Bulgaria, in June 2013. the 74 revised full papers presented together with 5 plenary and invited papers were carefully reviewed and selected from numerous submissions. the papers are organized in topical sections on numerical modeling of fluids and structures; control and uncertain systems; Monte Carlo methods: theory, applications and distributed computing; theoretical and algorithmic advances in transport problems; applications of metaheuristics to large-scale problems; modeling and numerical simulation of processes in highly heterogeneous media; large-scale models: numerical methods, parallel computations and applications; numerical solvers on many-core systems; cloud and grid computing for resource-intensive scientific applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A massively parallel processing for the Multiple Linear Regression 10

A massively parallel processing for the Multiple Linear Regr...

引用

international conference on Signal-Image Technology and Internet-Based Systems SITIS

作者： Adjout, Moufida Rehab Boufares, Faouzi Univ Paris 13 Lab LIPN UMR 7030 CNRS Av JB Clement F-93430 Villetaneuse France

ISBN: (纸本)9781479979783

the amount of data generated by traditional business activities, has resulted data warehouses with a size up to petabytes. the ability to analyze this torrent of data will become the basis of competition and growth for individual firms by ever-narrower segmentation of customers, improvement of decision-making and unearth valuable insights that would otherwise remain hidden. For this purpose, the large size of data to be processed requires the use of high-performance analytical systems running on distributed environments. Because the data is so big it affects the types of algorithms we are willing to consider. then standard analytics algorithms need to be adapted to take advantage of cloud computing models which provide scalability and flexibility. this work illustrates an implementation of a parallel version of the multiple linear regression. It can extract coefficients from large amounts of data, based on MapReduce Framework with large scale. parallel processing of multiple linear regression will be based on the QR decomposition and the ordinary least squares method adapted to Map Reduce. Our platform in deployed on Cloud Amazon EMR. Experimental results demonstrate that the our parallel version of the multiple linear regression can efficiently handle very large datasets on commodity hardware with a good performance on different evaluation criterions, including number, size and structure of machines in the cluster.

关键词： Data mining Predictive analysis Multiple linear regression Big Data Hadoop MapReduce Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Service Delivery in Complex Heterogeneous and distributed Environment

Efficient Service Delivery in Complex Heterogeneous and Dist...

引用

10th international conference on parallel Processing and Applied Mathematics (PPAM)

作者： Fras, Mariusz Kwiatkowski, Jan Wroclaw Univ Technol Inst Informat PL-50370 Wroclaw Poland

ISBN: (纸本)9783642552243

the problem of providing quality of service (QoS) guarantees is studied in many areas of information technologies. For network services three attributes are directly related to everyday perception of the QoS by the end user: availability, usability, and performance. the paper focuses on performance issues of service delivery with use of virtualization of services and processing resources. there are presented general issues of efficient service delivery, and proposed solutions with different formulation of guaranties for service processing. the best effort and SLA-based approaches are considered. the selected aspects of utilizing processing resources virtualization are also discussed.

关键词： Quality of services Service request distribution Virtualization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 70 71 72 73 74 75 76 77 78 79 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：