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

1993 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1993

作者： Talwar, Shilpa Paulraj, Arogyaswami Golub, Gene H. Scientific Computing Stanford University StanfordCA94305 United States Information Systems Lab Stanford University StanfordCA94305 United States Dept. of Computer Science Stanford University StanfordCA94305 United States

ISBN: (纸本)0780309464

In this paper, we focus on the problem of sensor array calibration in the presence of noise field uncertainties. The objective is to compute a reliable estimate of the array response vector given finite sample estimates of the signal plus noise and noise only array covariances. These covariances are computed from data collected at the sensor array with a calibration signal turned on and off. Numerical difficulties are encountered in applying the usual generalized eigenvalue technique when the noise field is near singular or has changed significantly over the two covariance measurements. We present a robust numerical approach for determining the response vector in these situations. Results of computer simulations to verify the proposed technique are also presented. © 1993 IEEE

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Support for the evolution of C++ generic functions

Support for the evolution of C++ generic functions

引用

Lecture Notes in computer science

作者： Pirkelbauer, Peter Dechev, Damian Stroustrup, Bjarne Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA 94550-9698 United States University of Central Florida Department of Electrical Engineering and Computer Science Orlando FL 32816-2362 United States Texas AandM University Department of Computer Science and Engineering College Station TX 77843-3112 United States

ISBN: (纸本)9783642194399

The choice of requirements for an argument of a generic type or algorithm is a central design issue in generic programming. In the context of C++, a specification of requirements for a template argument or a set of template arguments is called a concept. In this paper, we present a novel tool, TACE (template analysis and concept extraction), designed to help programmers understand the requirements that their code de facto imposes on arguments and help simplify and generalize those through comparisons with libraries of well-defined and precisely-specified concepts. TACE automatically extracts requirements from the body of function templates. These requirements are expressed using the notation and semantics developed by the ISO C++ standards committee. TACE converts implied requirements into concept definitions and compares them against concepts from a repository. Components of a well-defined library exhibit commonalities that allow us to detect problems by comparing requirements from many components: Design and implementation problems manifest themselves as minor variations in requirements. TACE points to source code that cannot be constrained by concepts and to code where small modifications would allow the use of less constraining concepts. For people who use a version of C++ with concept support, TACE can serve as a core engine for automated source code rejuvenation. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Topological Methods in Data Analysis and Visualization 1

引用

丛书名： Mathematics and Visualization

1000年

作者： Valerio Pascucci Xavier Tricoche Hans Hagen Julien Tierny

ISBN: (数字)9783642150142

ISBN: (纸本)9783642150135;9783662506042

Topology-based methods are of increasing importance in the analysis and visualization of datasets from a wide variety of scientific domains such as biology, physics, engineering, and medicine. Current challenges of topology-based techniques include the management of time-dependent data, the representation of large and complex datasets, the characterization of noise and uncertainty, the effective integration of numerical methods with robust combinatorial algorithms, etc. . The editors have brought together the most prominent and best recognized researchers in the field of topology-based data analysis and visualization for a joint discussion and scientific exchange of the latest results in the field. This book contains the best 20 peer-reviewed papers resulting from the discussions and presentations at the third workshop on "Topological Methods in Data Analysis and Visualization", held 2009 in Snowbird, Utah, US. The 2009 "TopoInVis" workshop follows the two successful workshops in 2005 (Slovakia) and 2007 (Germany).

关键词： Visualization Topology Geometry computer Graphics Mechanical Engineering Computational Intelligence

来源：评论

学校读者我要写书评

暂无评论

Relationship extraction methods based on co-occurrence in web pages and files

Relationship extraction methods based on co-occurrence in we...

引用

13th International Conference on Information Integration and Web-Based Applications and Services, iiWAS2011

作者： Song, Qiang Watanabe, Yousuke Yokota, Haruo Department of Computer Science Graduate School of Information Science and Engineering Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo Japan Global Scientific Information and Computing Center Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo Japan

ISBN: (纸本)9781450307840

Every day, information on the Web becomes increasingly enriched. Web access is now very useful in many aspects of daily life, particularly for writing documents and programs. In fact, it has become quite usual to edit files while referring to information on the Web. During the file-editing process, we usually visit so many Web pages that we cannot remember all of the relevant ones. Later, if we want to revisit the same Web pages to modify some part of a file, it can be very hard to track down the Web pages originally referred to. In this paper, we propose methods for finding relationships between files and Web pages based on the co-occurrence of data in Web-access logs and file-access logs. These relationships are very useful for revisiting Web pages related to target files. To analyze co-occurrence in these two types of access logs, there are two approaches for merging the logs, involving a trade-off between accuracy and execution time. We call them the Pre-Merge and Post-Merge methods, and we have evaluated these two methods using actual access logs. © 2011 ACM.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Musical instruments recognition using hidden Markov model

Musical instruments recognition using hidden Markov model

引用

Asilomar Conference on Signals, Systems & computers

作者： Jonghyun Lee Joohwan Chun Scientific Computing Laboratory Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea

ISBN: (纸本)0780375769

A new musical instrument recognition technique based on a hidden Markov model (HMM) is proposed. The spectral envelope is the key information of instrument characteristic and timbre. We decompose an instrument sound into sinusoidal components (harmonics) and noise components and estimate the amplitudes of the harmonics component. We want to express the spectral envelope effectively using estimated amplitude, therefore, we define three kinds of features and apply a recognition procedure to each feature. The HMM model used is continuous single Gaussian output HMM. To evaluate the performance of the recognition technique, the proposed technique is applied to classify the real instrumental sound of MUMS (MacGill University Master Samples). The recognition success ratio is more than 70%.

关键词： Instruments Frequency estimation Hidden Markov models Amplitude estimation Frequency synthesizers Sampling methods Acoustic noise Noise level Phase noise Stochastic resonance

来源：评论

学校读者我要写书评

暂无评论

A survey of IPv6 site multihoming proposals

A survey of IPv6 site multihoming proposals

引用

International Conference on Telecommunications (ConTEL)

作者： P. Savola T. Chown CSC-Scientific Computing Limited Espoo Finland School of Electronics and Computer Science University of Southampton Southampton UK

来源：评论

学校读者我要写书评

暂无评论

Testing the Unknown: A Framework for OpenMP Testing via Random Program Generation

Testing the Unknown: A Framework for OpenMP Testing via Rand...

引用

High Performance computing, Networking, Storage and Analysis, SC-W: Workshops of the International Conference for

作者： Ignacio Laguna Patrick Chapman Konstantinos Parasyris Giorgis Georgakoudis Cindy Rubio-González Center for Applied Scientific Computing Lawrence Livermore National Laboratory Department of Computer Science University of California Davis

ISBN: (数字)9798350355543

ISBN: (纸本)9798350355550

We present a randomized differential testing approach to test OpenMP implementations. In contrast to previous work that manually creates dozens of verification and validation tests, our approach is able to randomly generate thousands of tests, exposing OpenMP implementations to a wide range of program behaviors. We represent the space of possible random OpenMP tests using a grammar and implement our method as an extension of the Varity program generator. By generating 1,800 OpenMP tests, we find various performance anomalies and correctness issues when we apply them to three OpenMP implementations: GCC, Clang, and Intel. We also present several case studies that analyze the anomalies and give more details about the classes of tests that our approach creates.

关键词： Automatic programming High performance computing Conferences computer bugs Production Encoding Grammar Testing

来源：评论

学校读者我要写书评

暂无评论

Fast Fourier-Galerkin methods for first-kind logarithmic-kernel integral equations on open arcs

引用

science China Mathematics 2010年第1期53卷 1-22页

作者： WANG Bo1,WANG Rui2 & XU YueSheng3,4,1Academy of Mathematics and Systems science,Chinese Academy of sciences,Beijing 100190,China 2School of Information science and Engineering,Graduate University of the Chinese Academy of sciences,Beijing 100190,China 3Department of Mathematics,Syracuse University,Syracuse,NY 13244,USA 4Department of scientific computing and computer Applications,Sun Yat-sen University,Guangzhou 510275,China 1. Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing 100190 China2. School of Information Science and Engineering Graduate University of the Chinese Academy of Sciences Beijing 100190 China3. Department of Mathematics Syracuse University Syracuse NY 13244 USA4. Department of Scientific Computing and Computer Applications Sun Yat-sen University Guangzhou 510275 China

We propose a fully discrete fast Fourier-Galerkin method for solving an integral equation of the first kind with a logarithmic kernel on a smooth open arc,which is a reformulation of the Dirichlet problem of the Laplace equation in the *** optimal convergence order and quasi-linear complexity order of the proposed method are established.A precondition is *** this method with an efficient numerical integration algorithm for computing the single-layer potential defined on an open arc,we obtain the solution of the Dirichlet problem on a smooth open arc in the *** examples are presented to confirm the theoretical estimates and to demonstrate the efficiency and accuracy of the proposed method.

关键词： Dirichlet problem open arc singular boundary integral equations Fourier-Galerkin methods logarithmic potentials

来源：评论

学校读者我要写书评

暂无评论

Combining Generative and Discriminative Methods for Pixel Classification with Multi-Conditional Learning

Combining Generative and Discriminative Methods for Pixel Cl...

引用

International Conference on Pattern Recognition

作者： B.M. Kelm C. Pal A. McCallum Interdisciplinary Center for Scientific Computing University of Heidelberg Germany Department of Computer Science University of Massachusetts Amherst USA

It is possible to broadly characterize two approaches to probabilistic modeling in terms of generative and discriminative methods. Provided with sufficient training data the discriminative approach is expected to yield superior accuracy as compared to the analogous generative model since no modeling power is expended on the marginal distribution of the features. Conversely, if the model is accurate the generative approach can perform better with less data. In general it is less vulnerable to overfitting and allows one to more easily specify meaningful priors on the model parameters. We investigate multi-conditional learning - a method combining the merits of both approaches. Through specifying a joint distribution over classes and features we derive a family of models with analogous parameters. Parameter estimates are found by optimizing an objective function consisting of a weighted combination of conditional log-likelihoods. Systematic experiments in the context of foreground/background pixel classification with the Microsoft-Berkeley segmentation database using mixtures of factor analyzers illustrate tradeoffs between classifier complexity, the amount of training data and generalization accuracy. We show experimentally that this approach can lead to models with better generalization performance than purely generative or discriminative approaches

关键词： Character generation Parameter estimation Training data Context modeling Linear discriminant analysis Logistics scientific computing computer science Power generation Power system modeling

来源：评论

学校读者我要写书评

暂无评论

Large-scale electronic structure calculations of high-Z metals on the BlueGene/L platform

Large-scale electronic structure calculations of high-Z meta...

引用

2006 ACM/IEEE Conference on Supercomputing, SC'06

作者： Gygi, Francois Draeger, Erik W. Schulz, Martin De Supinski, Bronis R. Gunnels, John A. Austel, Vernon Sexton, James C. Franchetti, Franz Kral, Stefan Ueberhuber, Christoph W. Lorenz, Juergen Department of Applied Science University of California Davis Davis CA 95616 Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA 94551 IBM Thomas J. Watson Research Center Yorktown Heights NY 10598 Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA 15213 Institute of Analysis and Scientific Computing Vienna University of Technology Vienna Austria

ISBN: (纸本)0769527000

First-principles simulations of high-Z metallic systems using the Qbox code on the BlueGene/L supercomputer demonstrate unprecedented performance and scaling for a quantum simulation code. Specifically designed to take advantage of massively-parallel systems like BlueGene/L, Qbox demonstrates excellent parallel efficiency and peak performance. A sustained peak performance of 207.3 TFlop/s was measured on 65,536 nodes, corresponding to 56.5% of the theoretical full machine peak using all 128k CPUs. © 2006 IEEE.

关键词： Electronic structure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：