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

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

作者： R.M. Todd J.R. Cruz Communications and Signal Processing Laboratory (CMP Lab) School of Electrical Engineering and Computer Science University of Oklahama Norman OK USA

Statistical analysis of a fast algorithm for frequency estimation is presented. Details of how the analysis was derived with the aid of a symbolic algebra software package, Maple, are given, and some issues involved i... 详细信息

关键词： Frequency estimation Statistical analysis Algebra Signal processing algorithms Gaussian noise White noise computer science Signal analysis Software packages Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A path metric for sequential search and its application in edge linking

A path metric for sequential search and its application in e...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： A.A. Farag E.J. Delp Engineering Mathematics & Computer Science Department Speed Scientific School University of Louisville Louisville KY USA Computer Vision & Image Processing Laboratory School of Electrical Engineering Purdue University West Lafayette IN USA

The authors develop a path metric for sequential search based on the linear model. The metric forms the heart of an edge-linking algorithm that combines edge elements enhanced by an optimal filter. From a starting node, transitions are made to the goal nodes by a maximum likelihood metric. This metric requires only local calculations on the search space and its use in edge linking provides more accurate results than other linking techniques.< >

关键词： Joining processes Image edge detection Filters Application software Heart Layout Decoding Mathematics computer science computer vision

来源：评论

学校读者我要写书评

暂无评论

Co-scheduling compute-intensive tasks on a network of workstations: model and algorithms

Co-scheduling compute-intensive tasks on a network of workst...

引用

International Conference on Distributed Computing Systems

作者： M.J. Atallah C. Lock D.C. Marinescu H.J. Siegel T.L. Casavant Computer Sciences Department Purdue University West Lafayette IN USA Dept. of Comput. Sci. Purdue Univ. West Lafayette IN USA Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa IA USA

The problem of using the idle cycles of a number of high-performance workstations, interconnected by a high-speed network, for solving computationally intensive tasks is discussed. The classes of distributed applications examined require some form of synchronization among the sub-tasks, hence the need for coscheduling to guarantee that sub-tasks start at the same time and execute at the same pace on a group of workstations. A model of the system that allows the definition of an objective function to be maximized is presented. Then a quadratic time and linear space algorithm is derived for computing the optimal coscheduling.< >

关键词： computer networks Workstations High performance computing Processor scheduling Resource management Concurrent computing Intelligent networks parallel processing Laboratories High-speed networks

来源：评论

学校读者我要写书评

暂无评论

Convergence behavior and convergence rates of stack filters

Convergence behavior and convergence rates of stack filters

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： M. Gabbouj P.-T. Yu E.J. Coyle Signal Processing Laboratory Tampere University of Technology Tampere Finland Institute of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan School of Electrical Engineering Purdue University West Lafayette IN USA

The convergence behavior of type-0 through type-3 stack filters is investigated. It is shown that stack filters of type-0 through type-2 all possess the convergence property; that is, they filter any input signal to a root after consecutive passes of the filter under any appending strategy. A counterexample is given to show that not all type-3 stack filters have this convergence property. The rate of convergence for convergent stack filters is also shown. It is shown that stack filters of type-0 will take at most a single pass to filter any input signal to a root. The rate of convergence of type-1 and type-2 stack filters is shown to be linear in the length of the input signal.< >

关键词： Convergence Filters Boolean functions Signal processing Laboratories computer science Shape Filtering theory Design methodology Signal design

来源：评论

学校读者我要写书评

暂无评论

ON THE COMPLEXITY OF HYPERELLIPTIC DISCRETE LOGARITHM PROBLEM

ON THE COMPLEXITY OF HYPERELLIPTIC DISCRETE LOGARITHM PROBLE...

引用

WORKSHOP ON THE THEORY AND APPLICATION OF CRYPTOGRAPHIC TECHNIQUES

作者： SHIZUYA, H ITOH, T SAKURAI, K Department of Electrical Communications Faculity of Engineering Tohoku University Aramaki-Aza-Aoba Aoba-ku Sendai 980 Japan Département d’I.R.O. Université de Montréal C.P.6128 Succ.A Montréal H3C 3J7 QC Canada Department of Information Processing The Graduate School at Nagatsuta Tokyo Institute of Technology 4259 Nagatsuta Midori-ku Yokohama 227 Japan Computer & Information Systems Laboratory Mitsubishi Electric Corporation 5-1-1 Ofuna Kamakura 247 Japan

ISBN: (纸本)3540546200

We give a characterization for the intractability of hyperelliptic discrete logarithm problem from a viewpoint of computational complexity theory. It is shown that the language of which complexity is equivalent to that of the hyperelliptic discrete logarithm problem is in NP ∩ co-AM, and that especially for elliptic curves, the corresponding language is in NP ∩ co-NP. It should be noted here that the language of which complexity is equivalent to that of the discrete logarithm problem defined over the multiplicative group of a finite field is also characterized as in NP ∩ co-NP. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

DISJOINT PATH PROPERTIES OF THE DATA MANIPULATOR NETWORK FAMILY

引用

JOURNAL OF parallel AND DISTRIBUTED COMPUTING 1990年第4期9卷 419-423页

作者： NATION, WG SIEGEL, HJ Parallel Processing Laboratory School of Electrical Engineering Purdue University West Lafayette Indiana 47907 USA

A critical component of any parallel processing system is the interconnection network that provides communications among the system's processors and memories. The data manipulator (gamma) network family is an important class of multistage interconnection networks that is being studied by various researchers. One interesting property of the data manipulator network family is the existence of multiple paths through the network for most source/ destination pairs. The condition that must be present to have disjoint paths through the network for a given source/ destination pair is shown, where disjoint paths are multiple paths with no links in common. It is derived that the maximum number of disjoint paths for any source/destination pair is two and a method for finding the routing tags that specify these paths is given. For source/destination pairs that have disjoint paths, a single fault cannot prevent communication between that source/ destination pair. The effect of a fault in a given stage of the network on the number of source/destination pairs that can be connected is also discussed. All results are proven mathematically.

关键词： computer Networks

来源：评论

学校读者我要写书评

暂无评论

INVARIANT RECOVERY OF CURVES IN M-DIMENSIONAL SPACE FROM SPARSE DATA

引用

JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION 1990年第3期7卷 480-490页

作者： STEVENSON, RL DELP, EJ Computer Vision and Image Processing Laboratory School of Electrical Engineering Purdue University West Lafayette Indiana 47907 USA

We address the problem of reconstructing a smooth curve from sparse and noisy information that is invariant to the choice of the coordinate system. Tikhonov regularization is used to form a well-posed mathematical problem statement, and conditions for an invariant reconstruction are given. The resulting functional minimization problem is shown to be nonconvex. Approximations to the invariant functional are often used to form a convex problem that can be solved efficiently. Two common approximations, those of cubic and weighted cubic splines, are detailed, and examples are given to show that the approximations are often invalid. To form a valid approximation to the invariant functional we propose a two-step algorithm. The first step forms a piecewise-linear curve, which is invariant to the coordinate system. This piecewise-linear curve is then used to construct a parameterization of the curve for which we can make a valid approximation to the invariant functional. Examples are given to demonstrate the effectiveness of the algorithm, and two example applications for which the invariant property is important are given.

关键词： Algorithms Curvature Inverse problems Machine vision Reconstruction algorithms Strain

来源：评论

学校读者我要写书评

暂无评论

Embedding of cycles and grids in star graphs 2

Embedding of cycles and grids in star graphs

引用

2nd IEEE Symposium on parallel and Distributed processing, SPDP 1990

作者： Jwo, Jung-Sing Lakshmivarahan, S. Dhall, S.K. Parallel Processing Institute School of Electrical Engineering and Computer Science University of Oklahoma NormanOK United States

ISBN: (纸本)0818620870

The use of star graphs as a viable interconnection scheme for parallel computers has been examined by a number of authors. An attractive feature of this class of graphs is that it has sublogarithmic diameter and has a great deal of symmetry akin to the binary hypercube. The authors describe a new class of algorithms for embedding Hamiltonian cycle, the set of all even cycles and a variety of two and multi-dimensional grids in a star graph. They derive an algorithm for the ranking and the unranking problem with respect to the Hamiltonian cycle. © 1990 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Experimental analysis of communication/data-conditional aspects of a mixed-mode parallel architecture via synthetic computations 90

Experimental analysis of communication/data-conditional aspe...

引用

Proceedings of the 1990 ACM/IEEE conference on Supercomputing

作者： Samuel A. Fineberg Thomas L. Casavant Howard Jay Siegel Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa City IA Parallel Processing Laboratory School of Electrical Engineering Purdue University West Lafayette IN

ISBN: (纸本)9780897914123

Experimentation aimed at determining the potential benefit of mixed-mode SIMD/MIMD parallel architectures is reported. The experimentation is based on timing measurements made on the PASM system prototype at Purdue utilizing carefully coded synthetic variations of a well-known algorithm. The synthetic algorithms used to measure and evaluate this system were based on bitonic sorting of sequences stored in the processing elements. This computation was mapped to both the SIMD and MIMD modes of parallelism, as well as two hybrids of the SIMD and MIMD modes. The computations were coded in these four ways and experiments were performed that explore the trade-offs among them. The results of these experiments are presented and are discussed with special consideration of the effects of the system's architecture. The goal is to (as much as possible) obtain implementation independent analyses of the attributes of mixed-mode parallel processing with respect to the computational characteristics of the application being examined. The results are used to gain insight into the impact of computation mode on synchronization and data-conditional aspects of system performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Experimental analysis of communication/data-conditional aspects of a mixed-mode parallel architecture via synthetic computations

Experimental analysis of communication/data-conditional aspe...

引用

Supercomputing Conference

作者： S.A. Fineberg T.L. Casavant H.J. Siegel Parallel Processing Laboratory Department of Electrical and Computer Engineering University of Iowa Iowa IA USA Parallel Processing Laboratory School of Electrical Engineering Purdue University West Lafayette IN USA

Experimentation aimed at determining the potential benefit of mixed-mode SIMD/MIMD (single instruction, multiple data/multiple instruction, multiple data) parallel architectures is reported. The experimentation is based on timing measurements made on the PASM (Partitionable SIMD/MIMD) system prototype utilizing carefully coded synthetic variations of a well-known algorithm. The synthetic algorithms used to measure and evaluate this system were based on bitonic sorting of sequences stored in the processing elements. This computation was mapped to both the hybrids of the SIMD and MIMD modes. The computations were coded in these four ways and experiments were performed that explore the tradeoffs among them. The results of these experiments are presented and discussed, with special consideration of the effects of the system's architecture. The goal is to obtain implementation-independent analyses of the attributes of mixed-mode parallel processing with respect to the computational characteristics of the application being examined.< >

关键词： computer architecture Concurrent computing parallel processing Sorting parallel architectures Laboratories Prototypes Performance gain Algorithm design and analysis Switches

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：