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

2005 IEEE International Conference on Electric Machines and Drives

作者： Phyu, Hla Nu Jabbar, M.A. Liu, Z.J. Inst. of High Performance Computing Science Park II 1 Sci. Pk. Rd. #01-01 The Capricorn Singapore 117528 Singapore Dept. Electrical and Computer Engineering National University of Singapore 10 Kent Ridge Crescent Singapore 119260 Singapore Data Storage Institute DSI Building NUS 5 Eng. Dr. 1 Kent Ridge Crescent Singapore 117608 Singapore

ISBN: (纸本)0780389875

A numerical model has been developed to analyze and optimize the run-time performance of a disk drive spindle motor. A field-circuit coupled time-stepping finite element method is used for the analysis of the motor optimal performances with limits of supply voltage, current and power consumption during the spin-up time of the drive. Results of investigations with one and two disks are presented. ©2005 IEEE.

关键词： Electric motors

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of hose bandwidth allocation method using feedback control and class-based queueing for VPNs

Performance evaluation of hose bandwidth allocation method u...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

作者： M. Shimamurat K. Iida H. Koga Y. Kadobayashfi S. Yamaguchi Guraduate Sch. of Inf. Sci. Nara Inst. of Sci. & Technol. Japan Global Scientific Information and Computing Center Tokyo Institute of Technology Tokyo Japan Kitakyushu JGN2 Research Center National Institute of Information and Communications Technology Kitakyushu Japan Guraduate School of Information Science Nara Institute of Science and Technology Ikoma Nara Japan

A strong demand for quality of service (QoS) to subscribers of VPNs has emerged. Weighted proportional fair rate allocation (WPFRA) provides a QoS method for one VPN model, the customer-pipe model. However, constructing large-scale VPNs with the customer-pipe model is difficult because of an exponential increase in required bandwidth. In future VPNs, a new model, the hose model, is useful to improve the scalability. We present an adaptive bandwidth allocation method for providing QoS in the hose model. Our method is evaluated quantitatively through simulations.

关键词： Hoses Channel allocation Feedback control Virtual private networks

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of motion patterns in spatio-temporal data sets

Efficient detection of motion patterns in spatio-temporal da...

引用

GIS 2004: Proceedings of the Twelfth ACM International Symposium on Advances in Geographic information Systems

作者： Gudmundsson, Joachim Van Kreyeld, Marc Speckmann, Bettina Dep. of Mathematics and Computer Science TU Eindhoven Netherlands Inst. of Information and Computing Sciences Utrecht University Netherlands

Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock, leadership, convergence, and encounter, as defined by Laube et al., 2004. These patterns are large enough subgroups of the moving point objects that exhibit similar movement in the sense of direction, heading for the same location, and/or proximity. By the use of techniques from computational geometry, including approximation algorithms, we improve the running time bounds of existing algorithms to detect these patterns. Copyright 2004 ACM.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Reversible N-bit to N-bit integer haar-like transforms

Reversible N-bit to N-bit integer haar-like transforms

引用

Proceedings of the Seventh IASTED International Conference on Computer Graphics and Imaging

作者： Senecal, Joshua G. Duchaineau, Mark A. Joy, Kenneth I. Inst. for Sci. Computing Research L-419 PO Box 808 Livermore CA 94551 United States Ctr. for Appl. Scientific Computing Lawrence Livermore Natl. Laboratory L-561 PO Box 808 Livermore CA 94551 United States Inst. Data Anal. and Visualization Computer Science Department University of California Davis One Shields Ave. Davis CA 95616 United States

We introduce TLHaar, an n-bit to n-bit reversible trans-form similar to the S-transform, TLHaar uses lookup tables that approximate the S-transform, but reorder the co-efficients so they fit into n bits. TLHaar is suited for loss-less compression in fixed-width channels, such as digital video channels and graphics hardware frame buffers. Tests indicate that when the incoming image data has lines or hard edges TLHaar coefficients compress better than S-transform coefficients. For other types of image data TL-Haar coefficients compress up to 2.5% worse than those of the S-transform, depending on the data and the compression method used.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

An improved N-bit to N-bit reversible Haar-like transform

An improved N-bit to N-bit reversible Haar-like transform

引用

Pacific Conference on Computer Graphics and Applications

作者： J.G. Senecal P. Lindstrom M.A. Duchaineau K.I. Joy Inst. for Sci. Comput. Res. Lawrence Livermore Nat. Lab. CA USA Center for Applied Scientific Computing Lawrence Livemore National Laboratory USA Institute for Data Analysis and Visualization Computer Science Department University of California Davis USA

We introduce the piecewise-linear Haar (PLHaar) transform, a reversible n-bit to n-bit transform that is based on the Haar wavelet transform. PLHaar is continuous, while all current n-bit to n-bit methods are not, and is therefore uniquely usable with both lossy and lossless methods (e.g. image compression). PLHaar has both integer and continuous (i.e. non-discrete) forms. By keeping the coefficients to n bits PLHaar is particularly suited for use in hardware environments where channel width is limited, such as digital video channels and graphics hardware.

关键词： Wavelet transforms Continuous wavelet transforms Hardware Dynamic range Image coding Scientific computing Image reconstruction Laboratories data analysis data visualization

来源：评论

学校读者我要写书评

暂无评论

Complementary relationship between familiarity and SNR in word intelligibility test

引用

Acoustical science and Technology 2004年第4期25卷 290-292页

作者： Sakamoto, Shuichi Iwaoka, Naoki Suzuki, Yôiti Amano, Shigeaki Kondo, Tadahisa Res. Inst. of Elec. Communication Grad. School of Information Sciences Tohoku University 2-1-1 Katahira Aoba-ku Sendai 980-8577 Japan NTT Commun. Science Laboratories NTT Corporation 2-4 Hikaridai Seika-cho Soraku-gun Kyoto 619-0237 Japan NTT DATA Corporation

The complementary relationship between familiarity and SNR in word intelligibility test is discussed. A regression plane was calculated to examine the complementary relationship between the two. A logistic regression model was fitted to the data. Word intelligibility and correlation of determination were found. Results show that a difference of 1.0 in the familiarity value is almost equivalent to a 2 dB difference of SNR.

关键词： Audition

来源：评论

学校读者我要写书评

暂无评论

A comment on the shape of the solution set for systems of interval linear equations with dependent coefficients

引用

Reliable computing 2001年第3期7卷 275-277页

作者： Alefeld, G. Kreinovich, V. Mayer, G. Huth, M. Inst. für Angewandte Mathematik Universität Karlsruhe D-76128 Karlsruhe Germany Department of Computer Science University of Texas at El Paso El Paso TX 79968 United States Fachbereich Mathematik Universität Rostock D-18051 Rostock Germany Computing and Information Sciences Kansas State University Manhattan KS 66506 United States

This article is a short supplement to our previously published paper, in which we proved that each semialgebraic set can be represented as a projection of a solution set of some system of interval linear equations with dependent coefficients. The new result says that interval occurring can be chosen as narrow as wanted. The new result is proved by a simple linear transformation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An assessment of Beowulf-class computing for NASA requirements: Initial findings from the first NASA workshop on Beowulf-class clustered computing

An assessment of Beowulf-class computing for NASA requiremen...

引用

1998 IEEE Aerospace Conference, AERO 1998

作者： Sterling, Thomas Becker, Don Warren, Mike Cwik, Tom Salmon, John Nitzberg, Elill Jet Propulsion Lab. California Inst. of Technol. PasadenaCA United States Center of Excellence for Space Data and Information Science Goddard Space Flight Center United States California Institute of Technology United States Los Alamos National Laboratory United States NASA Ames Research Center United States

ISBN: (纸本)0780343115

The Beowulf class of parallel computing machine started as a small research project at NASA Goddard Space Flight Center's Center of Excellence in Space data and information sciences (CESDIS). From that work evolved a new class of scalable machine comprised of mass market common off-the-shelf components (M2COTS) using a freely available operating system and industry-standard software packages. A Beowulf-class system provides extraordinary benefits in price-performance. Beowulf-class systems are in place and doing real work at several NASA research centers, are supporting NASA-funded academic research, and operating at DOE and NIH. The NASA user community conducted an intense two-day workshop in Pasadena, California on October 22-23, 1997. This paper provides an overview of the findings and conclusions of the workshop. The workshop determined that Beowulf-class systems can deliver multi-Gflops performance at unprecedented price-performance but that software environments were not fully functional or robust, especially for larger dreadnought-scale systems. It is recommended that the Beowulf community engage in an activity to integrate, port, or develop, where appropriate, necessary components of the software infrastructure to fully realize the potential of Beowulf class computing to meet NASA and other agency computing requirements. © 1998 IEEE.

关键词： NASA

来源：评论

学校读者我要写书评

暂无评论

Complexity and expressive power of logic programming

Complexity and expressive power of logic programming

引用

Annual IEEE Conference on Computational Complexity

作者： E. Dantsin T. Eiter G. Gottlob A. Voronkov Steklov Math. Inst. St. Petersburg Russia AG Informatik University of Giessen Giessen Germany Information Systems Department Technical University of of Vienna Vienna Austria Computing Science Department University of Uppsala Uppsala Sweden

This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming. The complexity of the unification problem is also addressed.

关键词： Logic programming Knowledge representation database languages Complexity theory Mathematics Computer languages Approximation algorithms Computer science Application software Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Splitters and near-optimal derandomization

Splitters and near-optimal derandomization

引用

Annual IEEE Symposium on Foundations of Computer science

作者： M. Naor L.J. Schulman A. Srinivasan Department of Applied Mathematics and Computer Science Weizmann Institute of Science Israel Department of Apllied Mathematics and Computer Science Weizmann Institute of Science Israel Georgia Inst. Technology College of Computing Georgia Institute of Technology Atlanta GA USA Department of Information Systems & Computer Science National University of Singapore Singapore

We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2/sup k/ configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/spl Sigma/ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits.

关键词： Computer science Circuit testing Mathematics Protocols Engineering profession information systems Contracts Educational inst.tutions Boosting Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：