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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

497 篇 会议
10 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 185 篇 计算机科学与技术...
- 96 篇 软件工程
- 37 篇 信息与通信工程
- 26 篇 电气工程
- 13 篇 控制科学与工程
- 10 篇 材料科学与工程（可...
- 9 篇 电子科学与技术（可...
- 4 篇 网络空间安全
- 3 篇 安全科学与工程
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 冶金工程
54 篇 理学
- 48 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 地质学
34 篇 管理学
- 28 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
1 篇 军事学

主题

93 篇 computer science
79 篇 concurrent compu...
71 篇 distributed comp...
67 篇 application soft...
65 篇 database systems
62 篇 parallel process...
59 篇 databases
57 篇 distributed data...
43 篇 transaction data...
42 篇 delay
39 篇 computer archite...
37 篇 algorithm design...
36 篇 costs
36 篇 relational datab...
35 篇 hardware
30 篇 processor schedu...
30 篇 large-scale syst...
27 篇 computational mo...
27 篇 performance anal...
27 篇 computer network...

机构

7 篇 ibm thomas j. wa...
4 篇 department of co...
3 篇 ieee
3 篇 king saud univer...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 toyohashi univer...
2 篇 center for paral...
2 篇 department of co...
2 篇 school of comput...
2 篇 computer science...
2 篇 department of el...
2 篇 university of el...
2 篇 school of comput...
2 篇 department of bi...
2 篇 school of comput...
2 篇 eth zurich
2 篇 computer science...
2 篇 computer science...

作者

6 篇 a. choudhary
5 篇 j. saltz
4 篇 t. kurc
4 篇 a. boukerche
4 篇 a. el abbadi
3 篇 f. dehne
3 篇 p.s. yu
3 篇 wan maseri wan m...
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 jasni mohamad za...
3 篇 eyas el-qawasmeh
3 篇 d. agrawal
2 篇 a. burger
2 篇 a. rau-chaplin
2 篇 a. ghafoor
2 篇 s. bandyopadhyay
2 篇 hoefler torsten
2 篇 o. wolfson

语言

512 篇 英文
1 篇 其他

检索条件"任意字段=Proceedings of the Second International Symposium on Databases in Parallel and Distributed Systems"

共 513 条记录，以下是461-470 订阅

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

详细简洁

排序：

Computer network reliability evaluation from application's point of view

Computer network reliability evaluation from application's p...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. Kumar D.P. Agrawal Engineering Maths and Computer Science Department University of Louisville Louisville KY USA Department of Electrical & Computer Engineering North Carolina State University Raleigh NC USA

distributed computing systems are composed of processing elements, memory modules, data files, and programs. These shared resources are interconnected via communication links that enable a program (application) to run on a node by using data files available at other nodes. The authors introduce a very efficient one-step algorithm which can compute reliability parameters from an application's point of view directly, without requiring any a priori knowledge of multiterminal connections. This algorithm can be extended to evaluate many other reliability parameters such as computer network reliability, source to multiterminal reliability, distributed system reliability.< >

关键词： Computer network reliability distributed control distributed computing Telecommunication network reliability Application software Reliability engineering Computer science Computer networks Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

distributed input/output processing in data-driven multiprocessors

Distributed input/output processing in data-driven multiproc...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： P. Evripidou J.-L. Gaudiot Department of Computer Science and Engineering Southern Methodist University Dallas TX USA Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

Data-flow principles of execution provide an elegant way to ensure at runtime that instructions can be executed asynchronously in a parallel environment. However, while the conventional von Neumann model of interpretation has a very rigid ordering of instructions, it is the very asynchronous character of the data-flow model of execution that introduces conflicts when 'state' tasks (such as I/O operations) must share common data objects. In order to execute I/O operations safely and in parallel, an algorithm to detect and classify cases of potential conflicts (hazards) has been developed and is described. It is based upon localizing the effect of I/O operations by splitting the data-flow graph into two subgraphs: (a) the computation subgraph, and (b) the I/O subgraph. The scheme presented thus enables the creation and interaction of both subgraphs, which in turn yields a deterministic execution. Furthermore, the proposed scheme enables the distributed execution of I/O operations as permitted by data dependencies.< >

关键词： Computer science Data engineering Runtime environment Hazards Multiprocessing systems Delay Functional programming NASA Power engineering and energy Data mining

来源：评论

学校读者我要写书评

暂无评论

A probabilistic inference method with multiple evidences and its implementation using a layered network

A probabilistic inference method with multiple evidences and...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. Tanaka O. Nakamura NTT Communications and Information Processing Laboratories Musashino Tokyo Japan

The inference method can deal with multiple ambiguous evidences, and can describe effectiveness of evidences and relationships between evidences. Therefore, it is more advantageous than the Dempster-Shafer theory because of its ability to describe relationships between evidences. This method divides the whole world into possible worlds according to element value combinations. The probability of each possible world is decided so as to satisfy constraints corresponding to a priori knowledge and to maximize the entropy of the whole world. Furthermore, the method can be implemented using a layered network. In this network, individual network units do not have to perform complicated operations and connections between the layers are restricted. In other words, this network consists of simple units and restricted connections, thus, high speed processing will be possible using parallel processing.< >

关键词： Bayesian methods Artificial intelligence Information processing Laboratories Entropy parallel processing Humans Character recognition Expert systems Marine vehicles

来源：评论

学校读者我要写书评

暂无评论

Multi-failure fault-tolerance of embedded loops on hypercubes: issues and performance study

Multi-failure fault-tolerance of embedded loops on hypercube...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： C.T. Liang W.T. Tsai Department of Computer Sciences University of Minnesota Minneapolis MN USA

The authors study the multi-failure fault-tolerance of hypercubes. Reconfiguration algorithms are proposed to reallocate the function of failed nodes to spare nodes so the communication structure of the interrupted parallel algorithms is preserved. Both clustered fault and concurrent fault are considered. Loops are selected as the embedded communication structures, where a wide variety of applications have been implemented. In early work, two classes of fault-tolerant embedded loops, Mapping II and III, have been designed and proved one-step reconfigurable for any single failure. The authors derive from shortest path algorithms a distributed reconfiguration algorithm for multiple failures on these embedded loops. Proof of reconfigurability for clustered fault is conducted for Mapping III. Performance of both mappings is evaluated by simulation with parameters such as the average number of tolerable failures, the average number of job migrations, and the utilization rate of nodes.< >

关键词： Fault tolerance Hypercubes Clustering algorithms parallel algorithms Network topology Hardware Computer science Computational modeling Large-scale systems Computer networks

来源：评论

学校读者我要写书评

暂无评论

A comprehensive modeling for performance evaluation of regular interconnection network

A comprehensive modeling for performance evaluation of regul...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： C.C.-Y. Chen Hee Yong Youn Department of Computer Sciences University of North Texas Denton TX USA

Interconnection network is one of the major factors which determine the performance of a multiprocessor system. Therefore, it is imperative to have a model by which the efficiency of the interconnection network can be correctly evaluated for various application environments. The authors present an interconnection network evaluation mode where the memory bandwidth and processor acceptance probability are considered primary measures. The proposed analytical model includes typical network control policies such as bus arbitration and rejected request handling policies as well as home memory concept. The crossbar network is selected to test the model and computer simulation validates the correctness. The study also confirms that the home memory and dynamic bus arbitration policy improve the network performance.< >

关键词： Multiprocessor interconnection networks Bandwidth Multiprocessing systems Analytical models Testing Computer simulation Computer networks Application software Computer architecture parallel processing

来源：评论

学校读者我要写书评

暂无评论

parallel execution of Lanczos algorithm in a CAM systolic ring

Parallel execution of Lanczos algorithm in a CAM systolic ri...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： C. Ko Department of Electrical and computer Engineering College of Engineering Rutgers University Piscataway NJ USA

The author presents an efficient array processing scheme to exploit Lanczos algorithm for solving a large-scale eigenvalue problem. He shows that an array of processing elements with content addressable memories (CAM), connected in a simple ring topology, can solve the problem efficiently. The nonzero elements of a problem matrix are stored in a content addressable memory for an efficient storage and the required operations are executed in a pipeline fashion around the systolic ring. The algorithm consists of two steps: Lanczos triangularisation followed by QR method to obtain full eigenvalues and eigenvectors. It is shown that the speedup obtained in such a system is almost linear with the number of processing elements used when the problem is partitioned to be executed with relatively small number of processing element.< >

关键词： Computer aided manufacturing CADCAM Eigenvalues and eigenfunctions Symmetric matrices Sparse matrices Associative memory Matrix decomposition Large-scale systems Topology Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Synthesis of simple distributed detection networks

Synthesis of simple distributed detection networks

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： N.S.V. Rao Department of Computer Sciences Old Dominion University Norfolk VA USA

The article studies algorithmic issues of simple object detection problems in the context of a system consisting of a finite set of sensors S that monitor a workspace. Each sensor a in S detects the presence of any object that belongs to a certain subset, Det(a), of a given set of objects O. The detection problem is defined as follows: given that an object had been detected at a subset D contained in S of sensors, identify if the object in the workspace could be a member of O. If yes, compute the maximal set of such members. If not, declare the object in the workspace to be unidentified. Two versions are considered of this problem based on how the input is specified. In the forward detection problem, one is given (Det(a))/sub a in S/. In the backward detection problem, one is given (Set(b))/sub b in O/, where Set(b) is the set of sensors at which the object b in O would be detected. The article constructs a conceptual graph structure called the detection network that yields efficient implementation of detection algorithms using combinational circuits, message-based systems and parallel computing systems. It shows the problem of computing a network with minimum number of edges is computationally intractable, and then presents several polynomial-time approximation algorithms. Then it presents sequential algorithms to solve the detection problems with and without preprocessing. It also discusses parallel algorithms on shared memory systems and hypercube-based message passing systems. Finally, it shows that the problem of recognizing multiple objects is computationally intractable.< >

关键词： Network synthesis Object detection Computer networks Sensor systems Monitoring Detection algorithms Combinational circuits parallel processing Polynomials Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel time complexity of a heuristic algorithm for the k-center problem with usage weights

Parallel time complexity of a heuristic algorithm for the k-...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Qingzhou Wang Kam Hoi Cheng Computer Science Department University of Houston Houston TX USA

ISBN: (纸本)0818620870

The authors analyze the parallel time-complexity of a heuristic algorithm for solving the NP-hard k-center problem with usage weights. The problem is to choose k vertices as service centers so that the maximum weighted service delivery distance to any vertex is minimized. The algorithm uses a greedy strategy to choose the vertex with maximum usage weights as the next service vertex. It generates results that are guaranteed to be no greater than twice the optimal solution values, which is the best possible polynomial time heuristic unless P=NP, and its uniprocessor time complexity is O(n/sup 3/). The authors show that the algorithm may be implemented on a multiprocessor system in O(n log/sup 2/ n) time, where n is the total number of vertices. They further show that even with unlimited parallelism, this algorithm will have higher than polylogarithmic time complexity unless polylogspace=P.< >

关键词： Heuristic algorithms Polynomials Multiprocessing systems Joining processes Computer science Algorithm design and analysis parallel processing Accidents Approximation algorithms Microwave integrated circuits

来源：评论

学校读者我要写书评

暂无评论

Forward chaining parallel inference

Forward chaining parallel inference

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M.C. Rowe J. Labhart R. Bechtel S. Matney S. Carrow Merit Technology Inc.orporated Plano TX USA Naval Research Laboratory Inc. Washington D.C. DC USA

The paper describes the completed and ongoing efforts of the parallel Inferencing Performance Evaluation and Refinement project (PIPER). The PIPER inference engine is based on the Merit Enhanced Traversal Engine (METE) algorithm which is an extension of Forgy's (1979) RETE algorithm. To evaluate the efficacy of this design and implementation, an iterating 108 rule knowledge base was composed. This rule set was designed to roughly simulate the information rich nature of its target application domain, Strategic Defense Initiative contact discrimination, and was processed on from 7 to 89 Butterfly Plus processor nodes. Three uniprocessor control groups were also employed to gauge speed-up. Using the control group which produced the most conservation speed-up factors, the Phase I inference engine achieved a maximum true speed-up in excess of 31 utilizing 45 processors.< >

关键词： Production Inference algorithms Engines Laboratories Testing Assembly Load management parallel processing Pipeline processing Expert systems

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of hierarchically structured multiple bus multiprocessor system

Performance analysis of hierarchically structured multiple b...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A.K. Ramani N. Gore P.C. Sharma P.K. Chande School of Computer Sciences Devi Ahilya University Indore India Department of Computer Engineering Shri G.S. Institute of Technology and Science Indore India

This paper presents a discrete time model of multiple level multiprocessor network with multiple buses at each level of hierarchy. The model describes each processing element's (PE's) behavior by means of a semi-Markov process. It takes as input the number of PEs, the number of memory modules (MMs), number of buses, the mean think time of a PE and the first and second moments of connection time. The model produces as output the bandwidth, the MM utilization PE utilization, average queue length, and average wait-time experienced by a PE while waiting to access a MM. An important design issue in the system under consideration is to optimize the communication network at each hierarchical level, meeting the overall communication requirements. The model developed is used to study the system behavior with different accessing patterns and design changes in the interconnection network at different hierarchical levels, enabling optimization of the design scheme.< >

关键词： Performance analysis Multiprocessing systems Design optimization Multiprocessor interconnection networks distributed computing Bandwidth Communication networks Process control Computerized monitoring Computer architecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 43 44 45 46 47 48 49 50 51 52 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：