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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
127 篇 期刊文献
2 册 图书
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

230 篇 工学
- 157 篇 电气工程
- 104 篇 计算机科学与技术...
- 55 篇 软件工程
- 28 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 13 篇 核科学与技术
- 12 篇 仪器科学与技术
- 12 篇 信息与通信工程
- 7 篇 机械工程
- 6 篇 动力工程及工程热...
- 5 篇 力学（可授工学、理...
- 3 篇 石油与天然气工程
- 3 篇 生物医学工程（可授...
- 2 篇 测绘科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 航空宇航科学与技...
- 1 篇 网络空间安全
30 篇 理学
- 18 篇 物理学
- 6 篇 数学
- 5 篇 化学
- 5 篇 系统科学
- 1 篇 地球物理学
10 篇 管理学
- 10 篇 管理科学与工程(可...
6 篇 医学
- 5 篇 临床医学
- 1 篇 基础医学(可授医学...
- 1 篇 特种医学
4 篇 文学
- 4 篇 新闻传播学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 军事学
- 1 篇 军队指挥学
1 篇 艺术学

主题

823 篇 data flow comput...
176 篇 computer archite...
153 篇 flow graphs
152 篇 concurrent compu...
122 篇 hardware
112 篇 computer network...
111 篇 computational mo...
109 篇 parallel process...
107 篇 computer science
107 篇 application soft...
74 篇 processor schedu...
67 篇 algorithm design...
61 篇 distributed comp...
60 篇 control systems
58 篇 costs
56 篇 delay
49 篇 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 篇 dipartimento di ...
2 篇 eecs department ...
2 篇 univ wisconsin m...
2 篇 dipartimento di ...
2 篇 school of comput...
2 篇 c&c research lab...

作者

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

语言

800 篇 英文
20 篇 其他
2 篇 中文
1 篇 俄文

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

共 823 条记录，以下是641-650 订阅

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

详细简洁

排序：

Parallel function invocation in a dynamic argument-fetching dataflow architecture

Parallel function invocation in a dynamic argument-fetching ...

引用

International Conference on databases, Parallel Architectures and Their Applications

作者： G.R. Gao H.H.J. Hum Y.-B. Wong School of Computer Science McGill University Montreal QUE Canada McGill University Canada School of Computer Science McGill University Canada

The basic structure of a dynamic data-flow architecture based on the argument-fetching data-flow principle is outlined. In particular, the authors present a scheme to exploit fine-grain parallelism in function invocation based on the argument-fetching principle. They extend the static architecture by associating a frame of consecutive memory space for each parallel function invocation, called a function overlay, and identify each invocation instance with the base address of its overlay. The scheme gains efficiency by making effective use of the power provided by the argument-fetching data-flow principle: the separation of the instruction scheduling mechanism and the instruction execution. To handle function applications and memory management, the proposed architecture will have a memory overlay manager that is separate from the pipelined execution unit. To verify the design, a set of standard benchmark programs was mapped onto the new architecture and executed on an experimental general-purpose data-flow architecture simulation testbed.< >

关键词： Computer architecture Parallel processing Computer science Memory management Computational modeling Application software Benchmark testing Concurrent computing data flow computing Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Bounding algorithms for design space exploration

Bounding algorithms for design space exploration

引用

Great Lakes Symposium on VLSI

作者： S. Chaudhuri R.A. Walker Magrnu Design Automation San Antonio CA USA Kent University Kent OH USA

This paper describes several new algorithms for computing lower bounds on the length of the schedule and the number of functional units in high-level synthesis.

关键词： Algorithm design and analysis Space exploration Processor scheduling High level synthesis Delay data flow computing Scheduling algorithm Clocks Upper bound flow graphs

来源：评论

学校读者我要写书评

暂无评论

Development of neural network tools for rapid computer system design

Development of neural network tools for rapid computer syste...

引用

International Workshop on Rapid System Prototyping (RSP)

作者： D.W. Gassen J.D. Carothers Department of Electrical and Computer Engineering University of Arizona Tucson Tucson AZ USA

Methodologies are developed for improving design quality and the speed of the design process. The authors present the portion of the work which involves the application and extension of neural networks to solve optimization problems that arise in this design process. Specifically, they discuss the use of neural networks to solve the scheduling and allocation problems that arise when assigning operations to control steps and functional units. The goal is to minimize the number of control steps, number of each type of functional unit, allow multi-step operations, and handle bussing constraints. The application of neural networks to high-level computer design has the potential to provide more flexible, advanced computer system design tools.< >

关键词： Neural networks Computer networks Computer aided manufacturing Design optimization Process design Application software Design engineering Computer interfaces data flow computing Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Near optimal flow labeling in ATM/IP-LSR networks using multi-segment flows

Near optimal flow labeling in ATM/IP-LSR networks using mult...

引用

IEEE International Conference on Networks

作者： A. Harwood H. Shen School of Computing and Information Technology Griffith University QLD Australia

Packet or datagram based routing is widely used for the Internet mainly due to its robustness, ease of implementation and autonomous behavior. Hierarchical networks are necessary to provide scalability. Previous developments proposed for ATM technology to be the basis of packet switched routing protocols. This technology provides flows to reduce the number of times a packet's destination address must be looked up in a routing table thereby increasing the performance of the overall system. Basic methods to establish and maintain these flows have emerged. Clearly one cannot define a flow between every (source, destination) pair since the number of destinations (in the Internet) is prohibitively large. We provide a definition of the problem with optimality criteria, and an algorithm that autonomously establishes a dynamic hierarchy of flows over an arbitrary network according to traffic demand. If the network is of size n, our algorithm uses only O(n/sub 0/log/sub n0/n) labels at each router where n/sub 0/=e/spl ap/3. Packets are routed over a /spl lambda/-segmented flow such that the label table is accessed at most /spl lambda/=log/sub n0/n-1 times. We show that the total table look-up complexity, O(n0log/sub n0//sup 2/n), is a factor /spl Theta/(log/sub n0/log/sub n0/n) times the optimal, which makes substantial improvement of other results known to us. Our hierarchy of flows naturally exists transparently on top of the underlying hierarchical address space (IP) and requires no additional information.

关键词： Labeling Intelligent networks Routing Asynchronous transfer mode Packet switching data flow computing Information technology Australia Robustness Scalability

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the P2P file sharing technique by Indexed-Priority Metric

Evaluation of the P2P file sharing technique by Indexed-Prio...

引用

International Symposium on Advanced Networks and Telecommunication Systems (ANTS)

作者： Toshinori Takabatake Yoshikazu Komano Department of Information Science Shonan Institute of Technology Fujisawa Kanagawa Japan

ISBN: (纸本)9781424459896

Recently, the improvements in processing performance of a computer and high speed communication of an optical fiber have been achieved, so that the amount of data which are processed by a computer and flowed on a network has been increasing greatly. However, in a client-server system, since the server receives and processes the amount of data from the clients through the network, a load on the server is increasing. Thus, there are needed to introduce a server with high processing ability and to have a line with high bandwidth. In this paper, concerning to P2P networks to resolve the load on a specific server, a criterion called an indexed-priority metric has been proposed and its performance is evaluated. The proposed metric is to allocate some files to each node. As a result, the load on a specific server can distribute them to each node equally well. Simulation results show that the proposed metric can make files distribution on the specific server.

关键词： Peer to peer computing Network servers Computer networks data flow computing High performance computing Optical computing Optical fibers Client-server systems Bandwidth File servers

来源：评论

学校读者我要写书评

暂无评论

Functional VLSI Design For Low Level Image Processing ICs

Functional VLSI Design For Low Level Image Processing ICs

引用

Asilomar Conference on Signals, Systems & Computers

作者： E. Allart G. Quenot B. Zavidovique SODIMA/ETCA France ETCA France ADFAC-ETCA Paris France

We propose a VLSI circuit design method which is derived from a functional decomposition of low level image processing algorithms. In order to design high powerful architecture, we have been testing this functional approach quite extensively and special purpose circuits have already been developed. Finally from a broad class of various image processing algorithms and operators, we have defined a computational unit called functional element. These elements is to be associated in order to form a mesh connected programmable data flow computer. This data flow computer had been defined in order to get a straight mapping of the expressed algorithms thanks to the functionnal programming proposed by BACKUS. Thus, high computing power can be easily obtained for real time complex image processing applications. Using the equivalent data flow graphs of the algorithms, this computer can help to determine whether a given combination of precisely specified IC operators would have the requested behaviour, so that special purpose VLSI could be easily designed. In this paper the approach will be described shortly as well as the programmable data flow computer we defined. Several examples of implementation onto this computer are shown in order to point out the salient concept and advantages of this approach.

关键词： Very large scale integration Image processing Application software Computer architecture data flow computing Circuit testing Functional programming Algorithm design and analysis Concurrent computing Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Probabilistic communication optimizations and parallelization for distributed-memory systems

Probabilistic communication optimizations and parallelizatio...

引用

Euromicro Workshop on Parallel and Distributed Processing

作者： E. Mehofer B. Scholz Institute for Software Science University of Technology Vienna Vienna Austria Institute of Computer Languages University of Technology Vienna Vienna Austria

ISBN: (纸本)0769509878

In high-performance systems execution time is of crucial importance justifying advanced optimization techniques. Traditionally, optimization is based on static program analysis. The quality of program optimizations, however, can be substantially improved by utilizing runtime information. Probabilistic data-flow frameworks compute the probability with what data-flow facts may hold at some program point based on representative profile runs. Advanced optimizations can use this information in order to produce highly efficient code. In this paper we introduce a novel optimization technique in the context of High Performance Fortran (HPF) that is based on probabilistic data-flow information. We consider statically undefined attributes which play an important role for parallelization and compute for those attributes the probabilities to hold some specific value during runtime. For the most probable attribute values highly-optimized, specialized code is generated. In this way significantly better performance results can be achieved. The implementation of our optimization is done in the context of VFC, a source-to-source parallelizing compiler for HPF/F90.

关键词： data analysis Runtime Concurrent computing Optimizing compilers Program processors Computer languages data flow computing Information analysis

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable SoC design with hierarchical FSM and synchronous dataflow model 02

Reconfigurable SoC design with hierarchical FSM and synchron...

引用

Proceedings of the tenth international symposium on Hardware/software codesign

作者： Sunghyun Lee Sungjoo Yoo Kiyoung Choi Seoul National Univ. Seoul Korea TIMA Lab. 46 Avenue Felix Viallet 38031 Grenoble France Seoul National Univ. Seoul 151-742 Korea

ISBN: (纸本)9781581135428

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation in system representation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short HFSM-SDF model. In reconfigurable SoC design with the HFSM-SDF model, the problem of configuration scheduling is challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex flow (in the HFSM), and complex schedules of SDF actor firing. Thus, compile-time static configuration scheduling may not efficiently hide configuration *** resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configuration, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before the execution of state transition of top FSM. After obtaining the order information in a queue called ready configuration queue, we execute the state transition. During the execution, whenever there is new available FPGA resource, a new configuration is selected from the queue and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder design and obtained up to 21.8% improvement in system runtime with a negligible overhead of runtime (1.4%) and memory usage (0.94%).

关键词： reconfigurable architectures data flow computing field programmable gate arrays runtime configuration scheduling reconfigurable SoC design system representation formal model synchronous dataflow model configuration scheduling dynamic behavior state transitions order information ready configuration queue FPGA resource MPEG4 decoder design

来源：评论

学校读者我要写书评

暂无评论

Dense optical flow Computation for 2D and 3D images via multigrid on a parallel machine

Dense optical Flow Computation for 2D and 3D images via mult...

引用

International Symposium on Computational Intelligence and Intelligent Informatics, ISCIII

作者： El Mostafa Kalmoun Ecole Nationale des Sciences Appliquees (ENSA) Cadi Ayyad University Marrakech Morocco

Summary form only given. Optical flow computation is known to be a fundamental step in many applications in image processing, pattern recognition, data compression, and biomedical technology. The goal is to compute an approximation to the projection of the 3D motion field onto the imaging surface. I consider in this talk the problem of real-time computation of dense optical flow for 2D and 3D images by the classical Horn-Schunck model. The basic assumption of this model is that the intensity variations are weak and only due to a movement in the image plan. This constant brightness assumption leads to an ill-posed problem that can only be solved by imposing an additional constraint requiring the flow field to be smooth by means of a standard regularization approach. The Horn-Schuck model is traditionally solved via a coupled point wise relaxation. The performance is generally poor when the image sequence data are strongly textured. I will review and discuss the multigrid components for a fast and robust computation. The parallel implementation of the proposed scheme using domain partitioning shows that the algorithm scales well up to 32 processors on a cluster of AMD Opteron CPUs which consists of four-way nodes connected by an Infiniband network. I will conclude by presenting some experimental results showing the good performance of the proposed algorithm on some classical 2D test images and also for computing 3D motion from cardiac C-arm CT images.

关键词： Optical computing Image motion analysis Concurrent computing Parallel machines Biomedical optical imaging Biomedical computing Clustering algorithms Partitioning algorithms data flow computing Image processing

来源：评论

学校读者我要写书评

暂无评论

A secure method for transferring active packet using digital signature schemes

A secure method for transferring active packet using digital...

引用

International Conference on Telecommunications (ICT)

作者： Youngsoo Kim Jungchan Na Seungwon Sohn Network Security Department Information Security Technology Division Electronics and Telecommunications Research Institute Daejeon South Korea

Active networks represent a new approach to network architecture. Active networks provide a much more flexible network infrastructure than traditional networks do. Flexibility is a powerful merit of active networks, but it can raise considerable security problems. Current active network researches have applied diverse techniques to solve them. Cryptography is one way of protecting active networks. However it should not be applied conventionally, since the active network paradigm is different from the traditional one. It means that, in active network environments, active packets containing programmable codes should perform computations at intermediate-nodes as well as end-nodes. That is, since the packet sending-node does not know the intermediate receiving-node, it cannot apply traditional cryptographic techniques that can process each other only between end-nodes. The paper proposes a secure method for transferring active packets and performing computations using a transformed digital signature schemes with message recovery, in an active network environment in which intermediate packet receiving-nodes are not fixed. The proposed scheme uses a modified public key digital signature scheme in which signing/verifying key pairs have almost the same bit length and the verification-key storing server plays the role of key management server.

关键词： Digital signatures Computer networks Public key Public key cryptography Information security data flow computing Protection Network servers Routing Quality of service

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共83页 << < 61 62 63 64 65 66 67 68 69 70 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：