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

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： J.C. Tejero S. Bernal J.A. Hidaldo J. Fernandez R. Urquiza A. Gago Department of Architecture and Technology of Computer and Electronics Malaga Spain Department of Architecture & Technol. of Comput. Electron. Malaga Spain Department of Otorhinolaryngology University Hospital Virgen de la Victoria Malaga Spain

Introduces a digital hearing aid that compensates the signal spoken in sensorineural impaired listeners with the object of improving their intelligibility. The technique used is based on a digital analysis/synthesis of speech; the authors divided the input signal into short time blocks then make a multiband analysis, nonlinear amplification and synthesis based on a sinusoidal model of the voice, according to the subject's dynamic range in that band. This system has been implemented in real-time using a DSP (TMS320C30) based microprocessor board within a host personal computer IBM PC, and one of the principal objectives of the project is to make an easy implementation VLSI system with low consumption for it to be a portable digital hearing aid.

关键词： Auditory system Speech analysis Speech synthesis Signal analysis Signal synthesis Dynamic range Real time systems Digital signal processing Microprocessors Microcomputers

来源：评论

学校读者我要写书评

暂无评论

Transport-triggering vs. Operation-triggering 5th

Transport-triggering vs. Operation-triggering

引用

5th International Conference on Compiler Construction, CC 1994

作者： Hoogerbrugge, Jan Corporaal, Henk Delft University of Technology Department of Electrical Engineering Section Computer Architecture and Digital Systems Netherlands

ISBN: (纸本)9783662466629

Transport-triggered architectures are a new class of architectures that provide more scheduling freedom and have unique compiler optimizations. This paper reports experiments that quantify the advantages of transport-triggered architectures with respect to traditional operation-triggered architectures. For the experiments we use an extended basic block scheduler that is currently being developed. The paper gives an description of the scheduling techniques used. The results of our experiments show that the extra scheduling freedom together with the new optimizations are very welcome when resource constraints are limiting the performance. This is the case when resources are scarce or when the application contains a lot of instruction level parallelism. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Parallel and distributed programming with an actor-based language 2

Parallel and distributed programming with an actor-based lan...

引用

2nd Euromicro Workshop on Parallel and Distributed Processing, PDP 1994

作者： Hernandez, J. de Miguel, P. Barrena, M. Martinez, J. Polo, A. Nieto, M. Computer Science Department Extremadura University Spain Architecture and Technology of Information Systems Department Technical University of Madrid Spain

ISBN: (纸本)0818653701

ALBA, A parallel Language Based on Actors is a new programming language designed to take advantage of highly parallel architectures that use message passing as the fundamental low-level interaction primitive. In this paper, we present the contribution of ALBA to develop parallel and distributed programs through well known parallel programming paradigms. We discuss how process groups and group communications are modeled in our language using meta-actors, and by extrapolation, in other actor-based and object-based concurrent languages. In addition, we describe a new programming paradigm called the Actor-TupleSpace, which integrates the Actor and the Linda models. The Actor-TupleSpace allows a simple way of specification of synchronization constraints among actors. Tuples do not contain values as in the Linda model, instead they contain messages and other attributes described in this paper. The use of the Actor-TupleSpace is applied to the definition of distributed data structures. © 1994 IEEE.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Brains for autonomous robots: hardware and surgery tools

Brains for autonomous robots: hardware and surgery tools

引用

Proceedings of the From Perception to Action Conference

作者： L. Bengtsson B. Svensson P.-A. Wiberg Centre for Computer Architecture Halmstad University Halmstad Sweden Department of Computer Engineering Chalmers University of Technology Gothenburg Sweden

This paper presents a hardware architecture and a software tool needed for future autonomous robots. Specific attention is given to the execution of artificial neural networks and to the need for a good inspection and visualization tool when developing this kind of system. Achievable performance using state of the art technology is estimated and module miniaturization issues are discussed.

关键词： Robots Hardware Surgery computer architecture Artificial neural networks Observability Embedded computing Software tools Inspection Visualization

来源：评论

学校读者我要写书评

暂无评论

Parallel And Distributed Programming With An Actor-based Language

Parallel And Distributed Programming With An Actor-based Lan...

引用

Euromicro Workshop on Parallel and Distributed Processing

作者： J. Hernandez P. de Miguel M. Barrena J. Martinez A. Polo M. Nieto Computer Science Department Extremadura University Spain Architecture and Technology of Information Systems Department Technical University Madrid Spain

来源：评论

学校读者我要写书评

暂无评论

Comments on "Analysis of self-stabilizing clock synchronization by means of stochastic Petri nets"

引用

IEEE Transactions on computers 1994年第12期43卷 1453-1456页

作者： G. Ciardo C. Lindemann Department of Computer Science College of William and Mary Williamsburg VA USA GMD Institute for Computer Architecture and Software Technology (GMD-FIRST) Technische Universitat Berlin Berlin Germany

We point out some errors in the combinatorial approach for the steady-state analysis of a deterministic and stochastic Petri net (DSPN) presented by M. Lu, D. Zhang, and T. Murata (1990). However, the methodology for analyzing the self-stability of fault-tolerant clock synchronisation (FCS) systems introduced in that paper is applicable for FCS systems with many clocking modules, even if the combinatorial approach is not valid. This is due to the progress in improving the efficiency of the DSPN solution algorithm made in recent years. We show that the explicit computation of the steady-state solution of the DSPN can be performed with reasonable computational effort on a modern workstation by the software package DSPNexpress.< >

关键词： Clocks Synchronization Stochastic processes Petri nets Electromagnetic compatibility Stochastic systems Steady-state Fault tolerant systems Probability distribution Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Nonnumeric search results on the EM-4 distributed-memory multiprocessor 94

Nonnumeric search results on the EM-4 distributed-memory mul...

引用

Supercomputing Conference

作者： A. Sohn M. Sato S. Sakai Y. Kodama Y. Yamaguchi Computer and Information Science Department New Jersey Institute of Technology Newark NJ USA Computer Architecture Section Electro Technical Laboratory Tsukuba Ibaraki Japan

ISBN: (纸本)9780818666056

Numeric scientific problems have been the main focus of supercomputing as their numerous implementations on various multiprocessors indicate. Nonnumeric problems on the other hand have received very little attention for parallel implementation due to their irregular behaviors and a large amount of resource usage. This report presents our experiences implementing difficult nonnumeric problems on the EM-4 multiprocessor, believing that supercomputers should also be able to effectively execute nonnumeric problems if they are to be considered 'supercomputers'. We selected two typical search problems, the Eight-Puzzle and the Tower-of-Hanoi. Two parallel search techniques we used to implement the search problems, unidirectional and bidirectional heuristic search. A total of eight different programs have been implemented on the EM-4 multiprocessor with realistic problem sizes. Execution results demonstrate that the parallel bidirectional heuristic search can solve the tree depth 20 to 40 of the Eight-Puzzle in an optimal or near optimal number of iterations in less than two seconds, and is highly scalable as it gives over 40-fold speedup for both problems on 80 processors.< >

关键词： Concurrent computing Search problems Supercomputers Artificial intelligence Runtime Information science computer architecture Laboratories Buildings Parallel machines

来源：评论

学校读者我要写书评

暂无评论

A minimal window system architecture for distributed environment

A minimal window system architecture for distributed environ...

引用

EUROMICRO Conference

作者： Jinsoo Yoon Yigal Hoffner Kilnam Chon Department of Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea Architecture and Project Management Limited Cambridge UK

ISBN: (纸本)0818664304

In this paper, we assert that window system plays a fundamental role in supporting multiple interaction channels distributed over a finite number of I/O devices. For historical as well as technical reasons, window systems usually deal with the issues which concern distribution of window system components, heterogeneity, user interface, multimedia, and distributed application support. We propose a minimal window system architecture which allows separate treatment of these issues. The minimal window-system architecture serves as a basis for discussing the influence of these issues on each other. Also in the viewpoint of the transparency facilities inherent in a distributed system, a window system model based on the minimal window system is proposed for the distributed environment.< >

关键词： Application software computer architecture User interfaces Distributed computing Multimedia systems Workstations computer science Project management Operating systems computer networks

来源：评论

学校读者我要写书评

暂无评论

Optimization Of Critical Paths In Circuits With Level-sensitive Latches 94

Optimization Of Critical Paths In Circuits With Level-sensit...

引用

IEEE International Conference on computer-Aided Design

作者： T.M. Burks K.A. Sakallah Systems Technology and Architecture Division IBM Corporation Austin TX USA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

ISBN: (纸本)9780897916905

A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a sufficient set of constraints to ensure that, when all slacks are non-negative, the corresponding circuit will be free of late signal timing problems. Cycle stealing is directly permitted by the formulation. However, moderate restrictions may be necessary to ensure that the timing constraint graph is acyclic. Forcing the constraint graph to be acyclic allows a broad range of existing optimization algorithms to be easily extended to better optimize circuits with level-sensitive latches. We describe the extension of two such algorithms, both of which attempt to solve the problem of selecting parts from a library to minimize area subject to a cycle time constraint.

关键词： Latches Delay effects Flip-flops Costs Timing Utility programs Combinational circuits Sequential circuits Circuit analysis Libraries

来源：评论

学校读者我要写书评

暂无评论

Parallel bidirectional heuristic search on the EM-4 multiprocessor

Parallel bidirectional heuristic search on the EM-4 multipro...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

Solving search problems takes a large amount of computational resources both in terms of execution time and memory usage. This report presents experimental results of Parallel Bidirectional Heuristic Search (PBiHS) on the 80-processor EM-4 multithreaded data-flow multiprocessor. The PBiHS searches from two directions in parallel while search in each direction is also performed in parallel. Important data structures are distributed to all processors to help reduce the execution time of realistic problem sizes down to a few seconds or less. We implement two search problems, the Eight Puzzle and the Tower of Hanoi, and execute on the target multiprocessor. Execution results demonstrate that the Parallel Bidirectional Heuristic Search can solve the tree depth 20-40 of the Eight-Puzzle and the 3-9 disks of the Tower of Hanoi in an optimal or near optimal number of iterations in less than two seconds, is highly scalable as it gives over 40-fold speedup on 80 processors, and yields on the average 10-fold improvement over unidirectional search for the 8-Puzzle while generating a far less number of nodes.< >

关键词： Search problems Poles and towers Artificial intelligence Concurrent computing Data structures Parallel processing Information science computer architecture Laboratories Buildings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：