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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,918 篇 会议
230 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

11,324 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

6,681 篇 工学
- 6,110 篇 计算机科学与技术...
- 2,915 篇 软件工程
- 1,181 篇 电气工程
- 1,069 篇 信息与通信工程
- 482 篇 电子科学与技术（可...
- 358 篇 控制科学与工程
- 176 篇 仪器科学与技术
- 152 篇 机械工程
- 117 篇 动力工程及工程热...
- 113 篇 生物医学工程（可授...
- 101 篇 生物工程
- 87 篇 光学工程
- 87 篇 建筑学
- 69 篇 土木工程
- 68 篇 网络空间安全
- 65 篇 化学工程与技术
- 63 篇 材料科学与工程（可...
- 58 篇 安全科学与工程
1,468 篇 理学
- 976 篇 数学
- 311 篇 物理学
- 156 篇 系统科学
- 140 篇 统计学（可授理学、...
- 136 篇 生物学
- 83 篇 化学
898 篇 管理学
- 648 篇 管理科学与工程(可...
- 307 篇 图书情报与档案管...
- 290 篇 工商管理
145 篇 医学
- 120 篇 临床医学
- 62 篇 基础医学(可授医学...
62 篇 经济学
- 62 篇 应用经济学
56 篇 法学
34 篇 农学
26 篇 教育学
18 篇 文学
11 篇 军事学

主题

1,464 篇 parallel process...
584 篇 computer archite...
555 篇 distributed comp...
534 篇 application soft...
531 篇 computational mo...
528 篇 concurrent compu...
342 篇 hardware
319 篇 graphics process...
309 篇 scalability
308 篇 parallel program...
306 篇 graphics process...
304 篇 computer science
285 篇 runtime
263 篇 big data
262 篇 optimization
250 篇 parallel process...
226 篇 throughput
225 篇 processor schedu...
214 篇 resource managem...
209 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
17 篇 school of comput...
17 篇 institute of com...
16 篇 school of comput...
15 篇 college of compu...
15 篇 georgia inst tec...
15 篇 barcelona superc...
15 篇 intel corporatio...
14 篇 school of comput...
14 篇 chinese acad sci...
14 篇 department of co...
13 篇 tsinghua univ de...
13 篇 ibm thomas j. wa...
13 篇 cent s univ sch ...
13 篇 college of compu...
13 篇 ohio state univ ...

作者

21 篇 jack dongarra
16 篇 badia rosa m.
16 篇 liu jie
15 篇 wang guojun
15 篇 yijie wang
15 篇 a. choudhary
14 篇 anon
14 篇 kurt rothermel
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
12 篇 fahringer thomas
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fernandes luiz g...
11 篇 guangwen yang

语言

11,155 篇 英文
135 篇 其他
36 篇 中文
2 篇 俄文
2 篇 土耳其文
1 篇 德文

检索条件"任意字段=International Conference on Parallel and Distributed Processing Techniques and Applications"

共 11324 条记录，以下是4031-4040 订阅

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

详细简洁

排序：

Review on Data Mining techniques in Wireless Sensor Networks 2

Review on Data Mining Techniques in Wireless Sensor Networks

引用

2nd international conference on Electronics and Communication Systems (ICECS)

作者： Raut, Archana R. Khandait, S. P. GH Raisoni Coll Engn Comp Sci & Engn Dept Nagpur Maharashtra India KDK Coll Engn Dept Informat Technol Nagpur Maharashtra India

ISBN: (纸本)9781479972258

Over the past few years, wireless sensor networks ( WSN) have emerged as one of the most exciting fields in Computer Science research. A Wireless Sensor Network ( WSN) is a set of sensors that are integrated with a physical environment. These sensors are small in size, and capable of sensing physical phenomenon and processing them. The main aim of deploying applications based on WSNs is to make use of the data sensed by the sensors to raise the real-time decisions. The main limitations of WSNs are characteristics of sensor nodes and nature of sensor data generated by networks. Due to these limitations, traditional data mining techniques are not suitable to WSNs. As the data generated by WSNs is highly resource-constrained, huge in volume, fast changing, it is very challenging to design suitable data mining techniques for WSNs. This inspires to explore a novel and appropriate data mining technique capable of extracting knowledge from huge volume and variety of continuously arriving data from WSNs. In this paper different existing data mining techniques adopted for WSNs are examined with different classification, evaluation approaches, Finally, some research challenges related to adopting data mining techniques in WSNs are also pointed out.

关键词： Data Mining Wireless Sensor networks distributed approach

来源：评论

学校读者我要写书评

暂无评论

parallel ASIP Based Design of Turbo Decoder 1

Parallel ASIP Based Design of Turbo Decoder

引用

1st international conference on Communication and Computer Engineering (ICOCOE)

作者： Zakaria, F. F. Ehkan, P. Warip, M. N. M. Elshaikh, M. Univ Malaysia Perlis Sch Comp & Commun Engn Arau 02600 Perlis Malaysia

ISBN: (纸本)9783319076744;9783319076737

Application Specific Instruction-set Processor (ASIP) has a general-purpose architecture that can be modified and used in a variety of applications. However, this increases the power and memory utilization and affects the functionality and efficiency of ASIP. This paper is defining the flexibility of ASIP for Turbo decoding in term of its functionality and architecture for specific applications such as DVB-RCS, 3GPP. The proposed architecture has a dedicated SIMD (Single Instruction Set Multiple Data), coupled with distributed memory based ASIP. It has been concluded in this paper that ASIP facilitates parallelism at different levels, thereby, increasing the efficiency, power consumption, and processing time.

关键词： Application-specific instruction-set processor Bahl-Cocke-Jelinek-Raviv (BCJR) Turbo decoding recognition

来源：评论

学校读者我要写书评

暂无评论

Large-scale distributed dependent nonparametric trees 32

Large-scale distributed dependent nonparametric trees

引用

32nd international conference on Machine Learning, ICML 2015

作者： Hu, Zhiting Ho, Qirong Dubey, Avinava Xing, Eric P. Language Technologies Institute Carnegie Mellon University United States Institute for Infocomm Research ASTAR Singapore Machine Learning Department Carnegie Mellon University United States

ISBN: (纸本)9781510810587

Practical applications of Bayesian nonparametric (BNP) models have been limited, due to their high computational complexity and poor scaling on large data. In this paper, we consider dependent nonparametric trees (DNTs), a powerful infinite model that captures time-evolving hierarchies, and develop a large-scale distributed training system. Our major contributions include: (1) an effective memoized variational inference for DNTs, with a novel birth-merge s-trategy for exploring the unbounded tree space;(2) a model-parallel scheme for concurrent tree growing/pruning and efficient model alignmen-t, through conflict-free model partitioning and lightweight synchronization;(3) a data-parallel scheme for variational parameter updates that allows distributed processing of massive data. Using 64 cores in 36 hours, our system learns a lOK-node DNT topic model on 8M documents that captures both high-frequency and long-tail topics. Our data and model scales are orders-of-magnitude larger than recent results on the hierarchical Dirichlet process, and the near-linear s-calability indicates great potential for even bigger problem sizes. Copyright © 2015 by the author(s).

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of real-time covert timing channel detection using a parallel system 9th

Performance analysis of real-time covert timing channel dete...

引用

9th international conference on Network and System Security, NSS 2015

作者： Gegan, Ross K. Archibald, Rennie Farrens, Matthew K. Ghosal, Dipak Department of Computer Science University of CaliforniaDavis DavisCA95616 United States AT & T Labs 2600 Camino Ramon San RamonCA94583 United States

ISBN: (纸本)9783319256443

As network data rates continue to increase, implementing real-time network security applications requires a scalable computing platform. Multicore and manycore parallel processing systems provide a way to scale network security applications. The focus of this study are network covert timing channels (CTCs) that provide secret communication between hosts by modulating the inter-packet delays of an overt application. In this paper, we present an implementation of a parallel CTC detection tool in a Massively parallel processing Array (MPPA) architecture. We examine the effectiveness of our tool for detecting model-based CTCs using parallel implementation of four common detection techniques, namely, the Kullback-Liebler Divergence (KLD), Kolmogorov-Smirnov (K-S), regularity and first order entropy tests. We evaluate the performance of the algorithms using classification rates and study the scalability by varying the number of cores. Results show that while parallelization provides benefit, the scalability is limited by the memory available in each core and the ability to stream in large number of flows to different cores. © Springer international Publishing Switzerland 2015.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Planning for distributed workflows: constraint-based coscheduling of computational jobs and data placement in distributed environments 16

Planning for distributed workflows: constraint-based cosched...

引用

international Workshop on Advanced Computing and Analysis techniques in Physics Research (ACAT)

作者： Makatun, Dzmitry Lauret, Jerome Rudova, Hana Sumbera, Michal Czech Tech Univ Fac Nucl Phys & Phys Engn CR-16635 Prague Czech Republic Brookhaven Natl Lab STAR Upton NY 11973 USA Acad Sci Czech Republ Nucl Phys Inst Prague Czech Republic Masaryk Univ CS-60177 Brno Czech Republic

When running data intensive applications on distributed computational resources long I/O overheads may be observed as access to remotely stored data is performed. Latencies and bandwidth can become the major limiting factor for the overall computation performance and can reduce the CPU/WallTime ratio to excessive TO wait. Reusing the knowledge of our previous research, we propose a constraint programming based planner that schedules computational jobs and data placements (transfers) in a distributed environment in order to optimize resource utilization and reduce the overall processing completion time. The optimization is achieved by ensuring that none of the resources (network links, data storages and CPUs) are oversaturated at any moment of time and either (a) that the data is pre-placed at the site where the job runs or (b) that the jobs are scheduled where the data is already present. Such an approach eliminates the idle CPU cycles occurring when the job is waiting for the I/O from a remote site and would have wide application in the community. Our planner was evaluated and simulated based on data extracted from log files of batch and data management systems of the STAR experiment. The results of evaluation and estimation of performance improvements are discussed in this paper.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Performance prediction for concurrent workloads in distributed database systems 15th

Performance prediction for concurrent workloads in distribut...

引用

15th international conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： Li, Hui Hou, Xiaohuan Chen, Mei Dai, Zhenyu Zhu, Ming Huang, Menglin Department of Computer Science Guizhou University Guiyang China Guizhou Engineering Laboratory of ACMIS Guiyang550025 China National Astronomical Observatories Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783319271392

In order to store and process data at large-scale, distributed databases are built to partition data and process it in parallel on distributed nodes in a cluster. When the database concurrently execute heterogeneous query workloads, performance prediction is needed. However, running queries in a distributed database heavily touches upon the network overhead as the data transmission between cluster nodes. Hence, in this work, we take network latency into account when predict concurrent query performance. We propose a linear regression model to estimate the interaction when execute concurrent query for analytical workloads in distributed database system. Since network latency and overheads of local processing are the two most significant factors for query execution, we analyze the query behavior with multivariate regression on both of them at different degree of concurrency. In addition, we use sampling techniques to obtain various query mixes as concurrency level increasing. The experiments for evaluation the performance of our prediction model are conducted over a Postgre SQL database cluster with a representative analytical workloads of TPC-H, the experimental results demonstrates that the query latency predictions of our model can minimize the relative error within 14% on average. © Springer international Publishing Switzerland 2015.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Large Scale distributed Matrix Computation with Spark 3

Efficient Large Scale Distributed Matrix Computation with Sp...

引用

IEEE international conference on Big Data

作者： Gu, Rong Tang, Yun Wang, Zhaokang Wang, Shuai Yin, Xusen Yuan, Chunfeng Huang, Yihua Nanjing Univ Collaborat Innovat Ctr Novel Software Technol & I Natl Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China Intel Corp Beijing 100190 Peoples R China

ISBN: (纸本)9781479999255

Matrix computation is the core of many massive data-intensive analytical applications such mining social networks, recommendation systems and nature language processing. Due to the importance of matrix computation, it has been widely studied for many years. In the Big Data ear, as the scale of the matrix grows, traditional single-node matrix computation systems can hardly cope with such large data and computation. Existing distributed matrix computation solutions are still not efficient enough, or have poor fault tolerance and usability. In this paper, we propose Marlin, an efficient distributed matrix computation library which is built on top of Spark. Marlin contains several distributed matrix operation algorithms and provides high-level matrix computation primitives for users. In Marlin, we proposed three distributed matrix multiplication algorithms for different situations. Based on this, we designed an adaptive model to choose the best approach for different problems. Moreover, to improve the computation performance, instead of naively using Spark, we put forward some optimizations including taking advantage of the native linear algebra library, reducing shuffle communication and increasing parallelism. Experimental results show that Marlin is over an order of magnitude faster than R (a widely-used statistical computing system) and the existing distributed matrix operation algorithms based on MapReduce. Moreover, Marlin achieves comparable performance to the specialized MPI-based matrix multiplication algorithm SUMMA but uses a general dataflow engine and gains common dataflow features such as scalability and fault tolerance.

关键词： matrix computation parallel algorithm in-memory computing Spark

来源：评论

学校读者我要写书评

暂无评论

TRACO: An Automatic Loop Nest parallelizer for Numerical applications

TRACO: An Automatic Loop Nest Parallelizer for Numerical App...

引用

3rd international conference on Innovative Network Systems and applications (iNetSApp) held in conjunction with Federated conference on Computer Science and Information Systems (FedCSIS)

作者： Palkowski, Marek Klimek, Tomasz Bielecki, Wlodzimierz West Pomeranian Univ Technol Szczecin Ul Zolnierska 49 PL-71210 Szczecin Poland

ISBN: (纸本)9788360810668

We present the source-to-source TRACO compiler allowing for increasing program locality and parallelizing arbitrarily nested loop sequences in numerical applications. Algorithms for generation of tiled code and extracting synchronization-free slices composed of tiles are presented. parallelism of arbitrary nested loops is obtained by creating a kernel of computations represented in the OpenMP standard to be executed independently on many CPUs. We consider benchmarks, typical from compute-intensive sequences of algebra operations or numerical computation from industry and engineering. The speed-up of programs generated by TRACO are discussed. Related compilers and techniques are considered. Future work is outlined.

关键词： application program interfaces mathematics computing numerical analysis parallel algorithms program compilers program control structures program slicing synchronisation CPUs OpenMP standard algebra operations arbitrary nested loop sequence parallelism automatic loop nest parallelizer compute-intensive sequences program locality source-to-source TRACO compiler synchronization-free slice extraction tiled code generation Benchmark testing Computational modeling Kernel Mathematical model Multicore processing parallel processing Schedules

来源：评论

学校读者我要写书评

暂无评论

Run Time Approximation of Non-blocking Service Rates for Streaming Systems 17

Run Time Approximation of Non-blocking Service Rates for Str...

引用

2015 IEEE 17th international conference on High Performance Computing and Communications (HPCC)

作者： Beard, Jonathan C. Chamberlain, Roger D. ARM Res Austin TX 78746 USA Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

ISBN: (纸本)9781479989379

Stream processing is a compute paradigm that promises safe and efficient parallelism. Its realization requires optimization of multiple parameters such as kernel placement and communications. Most techniques to optimize streaming systems use queueing network models or network flow models, which often require estimates of the execution rate of each compute kernel. This is known as the non-blocking "service rate" of the kernel within the queueing literature. Current approaches to divining service rates are static. To maintain a tuned application during execution (while online) with non-static workloads, dynamic instrumentation of service rate is highly desirable. Our approach enables online service rate monitoring for streaming applications under most conditions, obviating the need to rely on steady state predictions for what are likely non-steady state phenomena. This work describes an algorithm to approximate non-blocking service rate, its implementation in the open source RaftLib [2] framework, and validates the methodology using streaming applications on multi-core hardware.

关键词： data flow computing multiprocessing systems public domain software compute kernel execution rate dynamic instrumentation kernel communications kernel placement multicore hardware multiple parameter optimization nonblocking service rate approximation nonstatic workloads nonsteady state phenomena online service rate monitoring open source RaftLib framework parallelism run-time approximation service rate steady state predictions stream processing streaming system optimization streaming systems Approximation methods Computational modeling Instruments Kernel Monitoring Servers Timing instrumentation parallel processing raftlib

来源：评论

学校读者我要写书评

暂无评论

Simonstrator: Simulation and prototyping platform for distributed mobile applications 8

Simonstrator: Simulation and prototyping platform for distri...

引用

8th EAI international conference on Simulation Tools and techniques, SIMUTOOLS 2015

作者： Richerzhagen, Björn Stingl, Dominik Rückert, Julius Steinmetz, Ralf Technische Universität Darmstadt Germany Technische Universität Darmstadt Germany

ISBN: (纸本)9781631900792

The increasing market penetration of mobile devices, such as smartphones and tablets, poses additional challenges on the design of distributed systems. Due to the heterogeneous environment consisting of both, mobile and fixed devices, a multitude of effects on different scales need to be considered. Microscopic effects, such as an individual user's interaction with the device, as well as macroscopic effects, such as scalability with the number of users have an impact on the system's performance. The combined evaluation of micro- and macroscopic effects requires both, simulations and prototypical deployments. Furthermore, insights obtained through prototypes during user studies can lead to refined protocols and algorithms, thereby contributing to the overall design process. To enable parallel assessment of micro- and macroscopic effects, we propose the Simonstrator platform, consisting of a lightweight framework for the development and instrumentation of distributed systems as well as runtime environments for (i) the interaction with common simulators, (ii) the deployment on testbeds, and (iii) Android devices. The platform is specifically targeted towards distributed systems for heterogeneous scenarios, considering mobile and fixed networks. We show sample simulations and prototypical deployments of two exemplary use cases: a live video streaming system and a middleware for augmented reality games, highlighting different evaluation goals and environments supported by the proposed Simonstrator platform. Copyright © 2015 ICST.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 400 401 402 403 404 405 406 407 408 409 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：