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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

658 篇 会议
418 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

599 篇 工学
- 355 篇 计算机科学与技术...
- 270 篇 软件工程
- 162 篇 信息与通信工程
- 111 篇 电气工程
- 87 篇 电子科学与技术（可...
- 77 篇 生物工程
- 75 篇 控制科学与工程
- 74 篇 光学工程
- 60 篇 生物医学工程（可授...
- 38 篇 机械工程
- 38 篇 仪器科学与技术
- 33 篇 动力工程及工程热...
- 25 篇 材料科学与工程（可...
- 25 篇 化学工程与技术
- 14 篇 土木工程
- 11 篇 航空宇航科学与技...
366 篇 理学
- 197 篇 数学
- 108 篇 物理学
- 86 篇 生物学
- 68 篇 统计学（可授理学、...
- 41 篇 系统科学
- 31 篇 化学
127 篇 管理学
- 81 篇 管理科学与工程(可...
- 49 篇 图书情报与档案管...
- 38 篇 工商管理
39 篇 医学
- 35 篇 临床医学
- 32 篇 基础医学(可授医学...
- 21 篇 药学(可授医学、理...
22 篇 法学
- 22 篇 社会学
13 篇 经济学
- 13 篇 应用经济学
11 篇 农学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学

主题

95 篇 laboratories
56 篇 parallel process...
40 篇 image processing
39 篇 concurrent compu...
36 篇 image coding
36 篇 feature extracti...
32 篇 computer science
32 篇 image segmentati...
29 篇 computer archite...
29 篇 algorithm design...
27 篇 decoding
25 篇 video coding
25 篇 signal processin...
25 篇 hardware
24 篇 signal processin...
24 篇 shape
23 篇 streaming media
22 篇 computational mo...
22 篇 training
20 篇 digital signal p...

机构

43 篇 video and image ...
27 篇 parallel process...
25 篇 digital signal p...
23 篇 control and inte...
21 篇 school of electr...
14 篇 video and image ...
13 篇 computer vision ...
12 篇 parallel process...
12 篇 multimedia proce...
12 篇 shanghai key lab...
11 篇 department of el...
11 篇 parallel process...
9 篇 department of au...
9 篇 silicon intellig...
9 篇 electrical and c...
8 篇 fujian provincia...
8 篇 ieee
8 篇 parallel process...
8 篇 school of electr...
8 篇 school of electr...

作者

47 篇 edward j. delp
46 篇 e.j. delp
34 篇 h.j. siegel
19 篇 hamid soltanian-...
17 篇 mahmoud reza has...
16 篇 t.l. casavant
14 篇 majdi mansouri
14 篇 siegel howard ja...
13 篇 guo qinghua
12 篇 mansouri majdi
11 篇 soltanian-zadeh ...
10 篇 d.b. williams
9 篇 lakshmivarahan s...
9 篇 kais bouzrara
9 篇 howard jay siege...
9 篇 paul salama
9 篇 p. salama
9 篇 li zuoyong
8 篇 kang li
8 篇 bouzrara kais

语言

1,031 篇 英文
26 篇 其他
24 篇 中文
1 篇 阿拉伯文

检索条件"机构=Parallel Processing Laboratory School of Electrical and Computer Engineering"

共 1081 条记录，以下是861-870 订阅

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

详细简洁

排序：

A parallel/distributed architecture for hierarchically heterogeneous web-based cooperative applications 7th

A parallel/distributed architecture for hierarchically heter...

引用

7th International Conference on High-Performance Computing and Networking, HPCN Europe 1999

作者： Casavant, Thomas L. Scheetz, Todd E. Braun, Terry A. Munn, Kyle J. Kaliannan, Sureshkumar Parallel Processing Laboratory Dept. of Electrical and Computer Engineering University of Iowa Iowa CityIA52242 United States

ISBN: (纸本)3540658211

A new class of applications is described which requires cooperation among diverse users in multiple data and problem instance domains. The hierarchy of parallelism includes heterogeneity within a single instance of the problem, homogeneity among subsets of users within a problem domain, and multiple problem domains which share computational resources - software and hardware. The core of the architecture is a socket-server which registers clients and servers (both statically and dynamically), and assures isolation of users in separate problem domains. The users all see the system as a set of functions accessible via the WWW. The particular problem of genetic linkage analysis is used as a case study to illustrate and implement the architecture. GenoMap, the first implementation of this system is being deployed for several groups of cooperating users at multiple institutions in a study to isolate the genomic locus of the controlling gene(s) in several diseases including autism. More than 400 genetic markers are being analyzed from more than 300 individuals in this study. The users span geneticists, clinical physicians, statisticians, disease specialists, laboratory technicians, and computer scientists/engineers. © Springer-Verlag Berlin Heidelberg 1999.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for singular value decomposition as applied to failure tolerant manipulators

A parallel algorithm for singular value decomposition as app...

引用

International Symposium on parallel processing

作者： T.D. Braun A.A. Maciejewski H.J. Siegel Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

The system of equations that govern kinematically redundant manipulators is commonly solved by finding the singular value decomposition (SVD) of the corresponding Jacobian matrix. This can require considerable amounts of time to compute, thus a parallel SVD algorithm minimizing execution time is sought. The approach employed here lends itself to parallelization by using Givens rotations and information from previous decompositions. The key contributions of this research include the presentation and implementation of a new variation of a parallel SVD algorithm to compute the SVD for a set of post-fault Jacobians. Results from implementation of the algorithm on a MasPar MP-1 and an IBM SP2 are provided. Specific issues considered for each implementation include how data is mapped to the processing elements, the effect that increasing the number of processing elements has on execution time, and the type of parallel architecture used.

关键词： parallel algorithms Singular value decomposition Jacobian matrices Concurrent computing Equations parallel machines Laboratories Matrix decomposition Manipulators Kinematics

来源：评论

学校读者我要写书评

暂无评论

Analysis of stochastic gradient identification of Hermite polynomial systems with memory

Analysis of stochastic gradient identification of Hermite po...

引用

5th International Symposium on Signal processing and Its Applications, ISSPA 1999

作者： Celka, P. Bershad, N.J. Vesin, J.M. Department of Electrical Engineering Signal Processing Laboratory Swiss Federal Institute of Technology Lausanne 1015 Switzerland Department of Electrical and Computer Engineering School of Engineering University of California Imine CA 92697 United States

ISBN: (纸本)1864354518

This paper presents analytical and Monte Carlo results for a stochastic gradient adaptive scheme which identifies an orthogonal polynomial-type nonlinear system with memory. The analysis includes recursions for the mean and fluctuation behavior of the adaptive parameters as well computation of the mean-square error increase due to the adaptation process. © 1999 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Encoding of predictive error frames in rate scalable video codecs using wavelet shrinkage

Encoding of predictive error frames in rate scalable video c...

引用

IEEE International Conference on Image processing

作者： E. Asbun P. Salama E.J. Delp Video and Image Processing Laboratory (VIPER) School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Rate scalable video compression is appealing for low bit rate applications, such as video telephony and wireless communication, where bandwidth available to an application cannot be guaranteed. In this paper, we investigate a set of strategies to increase the performance of SAMCoW, a rate scalable encoder. These techniques are based on based on wavelet decomposition, spatial orientation trees, and motion compensation.

关键词： Encoding Video codecs Image coding Video compression Bit rate Application software Wavelet coefficients Scalability computer errors Image processing

来源：评论

学校读者我要写书评

暂无评论

Analysis of stochastic gradient identification of Hermite polynomial systems with memory

Analysis of stochastic gradient identification of Hermite po...

引用

International Symposium on Signal processing and Its Applications (ISSPA)

作者： P. Celka N.J. Bershad J.M. Vesin Department of Electrical Engineering Signal Processing Laboratory Swiss Federal Institute of Technology Lausanne Switzerland Department of Electrical and Computer Engineering School of Engineering University of California Irvine CA USA

关键词： Stochastic systems Polynomials Fluctuations Nonlinear filters Adaptive signal processing Taylor series Stochastic processes Signal processing algorithms Vectors Australia

来源：评论

学校读者我要写书评

暂无评论

High-performance mixed-machine heterogeneous computing 6

High-performance mixed-machine heterogeneous computing

引用

6th Euromicro Workshop on parallel and Distributed processing, PDP 1998

作者： Maheswaran, Muthucumaru Braun, Tracy D. Siegel, Howard Jay Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West LafayetteIN47907-1285 United States

ISBN: (纸本)0818683325

The focus of this invited keynote paper (to be presented by H. J. Siegel) is mixed-machine heterogeneous computing, where a suite of different kinds of high-performance machines are interconnected by high-speed links. Such a system can be orchestrated to perform an application whose subtasks have diverse execution requirements. Subtasks are assigned to and executed on the machines that will result an a minimal overall execution time for the task, considering factors including anter-machine communication overhead. A conceptual model of the automatic decomposition of tasks and assignment of subtasks is presented. Examples of static and dynamic approaches to the matching and scheduling of subtasks are summarized. Some open research problems are dascussed. © 1998 IEEE

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

A dynamic matching and scheduling algorithm for heterogeneous computing systems

A dynamic matching and scheduling algorithm for heterogeneou...

引用

Heterogeneous Computing Workshop

作者： M. Maheswaran H.J. Siegel Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette USA

A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks must be assigned to machines (matching) and ordered for execution (scheduling) such that the overall application execution time is minimized. A new dynamic mapping (matching and scheduling) heuristic called the hybrid remapper is presented here. The hybrid remapper is based on a centralized policy and improves a statically, obtained initial matching and scheduling by remapping to reduce the overall execution time. The remapping is non-preemptive and the execution of the hybrid remapper can be overlapped with the execution of the subtasks. During application execution, the hybrid remapper uses run-time values for the subtask completion times and machine availability times whenever possible. Therefore, the hybrid remapper bases its decisions on a mixture of run-time and expected values. The potential of the hybrid remapper to improve the performance of initial static mappings is demonstrated using simulation studies.

关键词： Scheduling algorithm Processor scheduling Runtime Dynamic scheduling Availability

来源：评论

学校读者我要写书评

暂无评论

High-performance mixed-machine heterogeneous computing

High-performance mixed-machine heterogeneous computing

引用

Euromicro Workshop on parallel and Distributed processing

作者： M. Maheswaran T.D. Braun H.J. Siegel Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Purdue University System West Lafayette IN US

The focus of this invited keynote paper (to be presented by H.J. Siegel) is mixed-machine heterogeneous computing, where a suite of different kinds of high-performance machines are interconnected by high-speed links. Such a system can be orchestrated to perform an application whose subtasks have diverse execution requirements. Subtasks are assigned to and executed on the machines that will result in a minimal overall execution time for the task, considering factors including inter-machine communication overhead. A conceptual model of the automatic decomposition of tasks and assignment of subtasks is presented. Examples of static and dynamic approaches to the matching and scheduling of subtasks are summarized. Some open research problems are discussed.

关键词： Concurrent computing Processor scheduling Dynamic scheduling Application software computer architecture parallel processing Laboratories Indium tin oxide Subcontracting Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the task graph scheduling algorithms

Benchmarking the task graph scheduling algorithms

引用

International Symposium on parallel processing

作者： Y.-K. Kwok I. Ahmad Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NP-completeness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compare against each other. A comprehensive performance evaluation and comparison of these algorithms entails addressing a number of difficult issues. One of the issues is that a large number of scheduling algorithms are based upon radically different assumptions, making their comparison on a unified basis a rather intricate task. Another issue is that there is no standard set of benchmarks that can be used to evaluate and compare these algorithms. Furthermore, most algorithms are evaluated using small problem sizes, and it is not clear how their performance scales with the problem size. The authors first provide a taxonomy for classifying various algorithms into different categories according to their assumptions and functionalities. They then propose a set of benchmarks which are of diverse structures without being biased towards a particular scheduling technique and still allow variations in important parameters. They have evaluated 15 scheduling algorithms, and compared them using the proposed benchmarks. Based upon the design philosophies and principles behind these algorithms, they interpret the results and discuss why some algorithms perform better than the others.

关键词： Scheduling algorithm Processor scheduling parallel processing Concurrent computing Heuristic algorithms Laboratories computer science Taxonomy Algorithm design and analysis Scalability

来源：评论

学校读者我要写书评

暂无评论

A comparative study of five parallel genetic algorithms using the traveling salesman problem

A comparative study of five parallel genetic algorithms usin...

引用

International Symposium on parallel processing

作者： L. Wang A.A. Maciejewski H.J. Siegel V.P. Roychowdhury Microsoft Corporation Redmond WA USA Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Electrical Engineering Department UCLA Los Angeles CA USA

parallel generic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial generic algorithms (SGAs). They have also been used to solve larger problems and to find better solutions. A comparative analysis of five different coarse-grained PGAs is conducted using the traveling salesman problem as the basis of this case study. To make fair comparisons, all of these PGAs are based on the same baseline SGA, implemented on the same parallel machine (IBM SP2), tested on the same set of traveling salesman problem instances, and started from the same set of initial populations. As a result of the experiments conducted in this study, a particular PGA that combines a new subtour technique with a known migration approach is identified to be the best for the traveling salesman problem among the five PGAs being compared.

关键词： Genetic algorithms Traveling salesman problems Electronics packaging Cities and towns Testing parallel machines Space exploration computer architecture Contracts parallel processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共109页 << < 83 84 85 86 87 88 89 90 91 92 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：