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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

693 篇 会议
181 篇 期刊文献
2 册 图书
1 篇 学位论文

馆藏范围

877 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

270 篇 工学
- 160 篇 电气工程
- 131 篇 计算机科学与技术...
- 70 篇 软件工程
- 30 篇 电子科学与技术（可...
- 24 篇 控制科学与工程
- 19 篇 信息与通信工程
- 14 篇 仪器科学与技术
- 13 篇 核科学与技术
- 7 篇 机械工程
- 6 篇 动力工程及工程热...
- 5 篇 力学（可授工学、理...
- 3 篇 测绘科学与技术
- 3 篇 石油与天然气工程
- 3 篇 生物医学工程（可授...
- 2 篇 航空宇航科学与技...
49 篇 理学
- 23 篇 物理学
- 17 篇 数学
- 7 篇 系统科学
- 5 篇 化学
- 2 篇 地球物理学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
21 篇 管理学
- 18 篇 管理科学与工程(可...
- 2 篇 工商管理
7 篇 医学
- 5 篇 临床医学
4 篇 经济学
- 3 篇 理论经济学
- 2 篇 应用经济学
4 篇 文学
- 4 篇 新闻传播学
3 篇 法学
- 2 篇 社会学
- 1 篇 法学
1 篇 教育学
1 篇 军事学
1 篇 艺术学

主题

877 篇 data flow comput...
174 篇 computer archite...
152 篇 concurrent compu...
152 篇 flow graphs
118 篇 hardware
113 篇 computer network...
110 篇 computational mo...
109 篇 computer science
108 篇 application soft...
107 篇 parallel process...
73 篇 processor schedu...
66 篇 algorithm design...
62 篇 distributed comp...
60 篇 control systems
56 篇 costs
56 篇 delay
53 篇 data analysis
47 篇 digital signal p...
46 篇 signal processin...
40 篇 programming prof...

机构

5 篇 department of el...
5 篇 department of co...
4 篇 computer science...
4 篇 polish japanese ...
3 篇 mitre corporatio...
3 篇 department of el...
3 篇 purdue universit...
3 篇 imec leuven
3 篇 institute of com...
3 篇 department of el...
3 篇 department of el...
3 篇 department of co...
3 篇 faculty of techn...
3 篇 department of co...
3 篇 stanford univ st...
3 篇 dipartimento di ...
2 篇 eecs department ...
2 篇 univ london impe...
2 篇 dipartimento di ...
2 篇 school of comput...

作者

5 篇 r.a. ammar
5 篇 e.a. lee
5 篇 g.r. gao
5 篇 j.w. stoughton
4 篇 m. tudruj
4 篇 b. zavidovique
4 篇 r.r. mielke
4 篇 s. som
4 篇 m.l. soffa
4 篇 m.j. harrold
3 篇 m. sami
3 篇 r.a. walker
3 篇 j. krinke
3 篇 raulet mickael
3 篇 palumbo francesc...
3 篇 a. smyk
3 篇 m.n.s. swamy
3 篇 sau carlo
3 篇 b. qin
3 篇 j. teich

语言

844 篇 英文
30 篇 其他
2 篇 中文
1 篇 俄文

检索条件"主题词=Data Flow Computing"

共 877 条记录，以下是271-280 订阅

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

详细简洁

排序：

Exploiting data flow information in algorithm-based fault tolerance

Exploiting data flow information in algorithm-based fault to...

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： R. Shamsunder D.J. Rosenkrantz S.S. Ravi Department of Computer Science State University of New York Albany Albany NY USA

The authors examine the use of data flow information in algorithm-based fault tolerance for multiprocessor computations. They show that this information can lead to a more efficient design, by reducing the number of checks. They investigate both the analysis problem of determining the fault tolerance measures of a given system, and the design problem of constructing compact check sets to detect or locate a given number of faults. Specifically, it is shown that the analysis problem can be solved efficiently when the number of faults is fixed. The computational difficulty of this problem when the number of faults is not fixed is addressed. The authors consider the design problem for special classes of data flow graphs and establish upper and lower bounds on the number of checks needed to detect or locate a given number of faults.

关键词： Fault tolerance Fault detection Fault tolerant systems data flow computing Computer science Algorithm design and analysis flow graphs Multiprocessing systems Polynomials Fault location

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient data representation and routing for wireless sensor networks based on a distributed wavelet compression algorithm

Energy-efficient data representation and routing for wireles...

引用

International Symposium on Information Processing in Sensor Networks (IPSN)

作者： A. Ciancio S. Pattem A. Ortega B. Krishnamachari Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

We address the problem of energy consumption reduction for wireless sensor networks, where each of the sensors has limited power and acquires data that should be transmitted to a central node. The final goal is to have a reconstructed version of the data measurements at the central node, with the sensors spending as little energy as possible, for a given data reconstruction accuracy. In our scenario, sensors in the network have a choice of different coding schemes to achieve varying levels of compression. The compression algorithms considered are based on the lifting factorization of the wavelet transform, and exploit the natural data flow in the network to aggregate data by computing partial wavelet coefficients that are refined as data flows towards the central node. The proposed algorithm operates by first selecting a routing strategy through the network. Then, for each route, an optimal combination of data representation algorithms i.e. assignment at each node, is selected. A simple heuristic is used to determine the data representation technique to use once path merges are taken into consideration. We demonstrate that by optimizing the coding algorithm selection the overall energy consumption can be significantly reduced when compared to the case when data is just quantized and forwarded to the central node. Moreover, the proposed algorithm provides a tool to compare different routing techniques and identify those that are most efficient overall, for given node locations. We evaluate the algorithm using both a second-order autoregressive (AR) model and empirical data from a real wireless sensor network deployment

关键词： Energy efficiency Routing Wireless sensor networks Compression algorithms Energy consumption Energy measurement Wavelet transforms Aggregates Computer networks data flow computing

来源：评论

学校读者我要写书评

暂无评论

Interface-based hierarchy for synchronous data-flow graphs

Interface-based hierarchy for synchronous data-flow graphs

引用

IEEE Workshop on Signal Processing Systems (SIPS)

作者： Jonathan Piat Shuvra S. Bhattacharyya Mickael Raulet IETRIINSA UMR CNRS 6164 Image and Remote Sensing laboratory Rennes France Department of Electrical and Computer Engineering University of Maryland College Park MD USA

dataflow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of dataflow, termed synchronous dataflow (SDF), offers strong compile-time predictability properties, but has limited expressive power. In this paper we propose a new type of hierarchy in the SDF domain allowing more expressivity while maintaining its predictability. This new hierarchy semantic is based on interfaces that fix the number of tokens consumed/produced by a hierarchical vertex in a manner that is independent or separate from the specified internal dataflow structure of the encapsulated subsystem. This interface-based hierarchy gives the application designer more flexibility in iterative construction of hierarchical representations, and experimentation with different optimization choices at different levels of the design hierarchy.

关键词： flow graphs Application software Computer interfaces Power engineering computing Digital signal processing data mining Processor scheduling Computer architecture data flow computing Remote sensing

来源：评论

学校读者我要写书评

暂无评论

Executing Synchronous data flow Graphs on Multicomputers

Executing Synchronous Data Flow Graphs on Multicomputers

引用

Distributed Memory computing Conference

作者： Zhiwei Xu Department of Computer Science Polytechnic University Farmingdale NY USA

来源：评论

学校读者我要写书评

暂无评论

Impact of rack-level compaction on the data center cooling ensemble

Impact of rack-level compaction on the data center cooling e...

引用

Intersociety Conference on Thermal and Thermomechanical Phenomena in Electronic Systems (ITHERM)

作者： Amip Shah Chandrakant Patel Cullen Bash Ratnesh Sharma Rocky Shih Hewlett Packard Company Palo Alto CA USA

The growing energy consumption of computer data centers has recently received increased economic and environmental scrutiny. A significant portion of typical data center energy consumption can be apportioned to the cooling infrastructure. This paper shows the impact of heat load within the data center on the efficiency of the data center cooling ensemble, as measured in terms of a 'grand' Coefficient of Performance of the ensemble (COP G ). The paper begins by developing an expedient, semi-empirical model of the cooling infrastructure in an actual data center in Bangalore, India. These predictions are compared to experimental measurements at various levels of the ensemble, with good agreement between predicted and measured values. Having validated the model, the impact of replacing low-density racks with high-density blades into the data center is explored. For the test case considered in this paper, it is found that consolidation leads to greater efficiency of the infrastructure components, causing COP G to increase by about 15%. The paper concludes by quantifying the impact of this consolidation on the total cost-of-ownership (TCO). For the test case, the consolidation results in improved utilization of the infrastructure, thus effectively reducing the burdened TCO (per Watt of computation) by up to 30%.

关键词： Compaction Cooling Energy consumption Heat transfer Computer networks data flow computing Water heating Costs Refrigeration Thermodynamics

来源：评论

学校读者我要写书评

暂无评论

The ETCA data-flow functional computer for real-time image processing

The ETCA data-flow functional computer for real-time image p...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： G.M. Quenot B. Zavidovique Laboratoire Système de Perception DGA/Etablissement Technique Central de lArmement Arcueil France

A data-flow computer, constituted of a large array of data-flow processors and programmed using a functional language, and its application to real-time image processing are presented. The approach integrates tightly and efficiently the data-flow architecture principle and the functional programming concept. It leads to a very simple and regular hardware. It also provides a very efficient and user-friendly software interface for application development. It remains applicable in systems that includes processors of different granularity. Results of an experimental system, running several image processing algorithm in real time at digital video speed, are reported.< >

关键词： Image processing Computer architecture Application software Hardware Real time systems Dissolved gas analysis data flow computing Prototypes Concurrent computing Pixel

来源：评论

学校读者我要写书评

暂无评论

Techniques for flow inversion on sampled data

Techniques for flow inversion on sampled data

引用

IEEE Conference on Computer Communications Workshops, INFOCOM Wksps

作者： Richard G. Clegg Raul Landa Hamed Haddadi Miguel Rio Andrew W. Moore Department of Electronic & Electrical Engineering University College London UK Computer Laboratory University of Cambridge UK

The distribution of flow sizes is a quantity of interest fundamental to traffic engineering and network modelling and only likely to become more important in the future. The recovery of the flow-length distribution from (sampled) packet data is referred to as flow-inversion. Traditional packet sampling methods cause distortions in a recovered distribution of flow-length. We propose an improved method for inverting data sampled using the technique known as sample-and-hold. We show that the technique improves upon existing inversion techniques illustrated using both real and artificial data sets. The technique described may have applications to other inversion problems.

关键词： Sampling methods Telecommunication traffic Maximum likelihood estimation Protocols Monitoring Computer networks data flow computing Distributed computing Traffic control data engineering

来源：评论

学校读者我要写书评

暂无评论

Throughput Analysis of Synchronous data flow Graphs

Throughput Analysis of Synchronous Data Flow Graphs

引用

International Conference on Application of Concurrency to System Design

作者： A.H. Ghamarian M.C.W. Geilen S. Stuijk T. Basten B.D. Theelen M.R. Mousavi A.J.M. Moonen M.J.G. Bekooij Eindhovan University of Technology Netherlands Philips Research Laboratories Netherlands

ISBN: (纸本)0769525563;9780769525563

Synchronous data flow graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for application mapping on platforms. Throughput analysis of these SDFGs is an important step for verifying throughput requirements of concurrent real-time applications, for instance within design-space exploration activities. Analysis of SDFGs can be hard, since the worst-case complexity of analysis algorithms is often high. This is also true for throughput analysis. In particular, many algorithms involve a conversion to another kind of data flow graph, the size of which can be exponentially larger than the size of the original graph. In this paper, we present a method for throughput analysis of SDFGs, based on explicit state-space exploration and we show that the method, despite its worst-case complexity, works well in practice, while existing methods often fail. We demonstrate this by comparing the method with state-of-the-art cycle mean computation algorithms. Moreover, since the state-space exploration method is essentially the same as simulation of the graph, the results of this paper can be easily obtained as a byproduct in existing simulation tools

关键词： Throughput data analysis flow graphs Algorithm design and analysis Signal processing algorithms Failure analysis Computational modeling Analytical models data flow computing Laboratories

来源：评论

学校读者我要写书评

暂无评论

Volunteer-based distributed traffic data collection system

Volunteer-based distributed traffic data collection system

引用

International Conference on Advanced Communication Technology (ICACT)

作者： Kartheepan Balachandran Jacob Honoré Broberg Kasper Revsbech Jens Myrup Pedersen Department of Electronic Systems University of Aalborg Aalborg Denmark

ISBN: (纸本)9781424454273

An architecture for a traffic data collection system is proposed, which can collect data without having access to a backbone network. Contrary to other monitoring systems it relies on volunteers to install a program on their own computers, which will capture incoming and outgoing packets, group them into flows and send the flow data to a central server. data can be used for studying and characterising internet traffic and for testing traffic models by regenerating real traffic. The architecture is designed to have efficient and light usage of resources on both client and server *** case performance estimates indicate that this is obtained. Tests conducted by volunteers using an implemented prototype confirm the feasibility of the system.

关键词： Telecommunication traffic Traffic control Computer architecture Web server Spine Computerized monitoring data flow computing Network servers Internet Testing

来源：评论

学校读者我要写书评

暂无评论

A design tool for computations in large grain real-time data flow architectures

A design tool for computations in large grain real-time data...

引用

IEEE Southeastcon

作者： S. Som B. Mandala R.R. Mielke J.W. Stoughton Department of Electrical and Computer Engineering Old Dominion University Norfolk VA USA

A design tool for performance prediction in homogeneous, multicomputer dataflow architectures operating in real time is discussed. Algorithms are restricted to the class of large-grain, decision-free algorithms. Major applications are expected to be real-time implementation of control and signal processing algorithms, where performance is required to be highly predictable. The mapping of such algorithms onto the specified class of dataflow architectures is realized by a marked graph model called the algorithm to architecture mapping model (ATAMM). Performance measures which determine computing speed and throughput capacity are defined, and the lower bounds for these performance measures are stated. computing resource needs are determined for predictable periodic execution of algorithms. A software design tool is presented to aid the designer in predicting performance and resource requirements.< >

关键词： data flow computing Computer architecture Signal processing algorithms Algorithm design and analysis High performance computing Predictive models flow graphs Fluid flow measurement Velocity measurement Software measurement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：