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

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： T. Taniguchi F. Amano M. Johnson Radio Communication Processing Technology Section Fujitsu Laboratories Limited Kawasaki Japan Department of Electrical Engineering and Computer Science MIT Cambridge MA USA

The authors review the CELP (code excited linear prediction) coding algorithm, and the efforts recently made for improving the performance and reducing the complexity. The efforts for improving the coding performance have been aimed not only at making the quality better, but also at further reducing the bit rate without degrading the quality. A sparse-delta codebook is introduced as an example of a codebook with a computationally efficient structure. Multimode coding is then described for improving the perceptual quality of CELP at low bit rates.< >

关键词： Speech coding Bit rate Speech synthesis Speech processing Vector quantization Speech analysis Computational complexity Search methods Degradation Signal synthesis

来源：评论

学校读者我要写书评

暂无评论

On the computational power of sigmoid versus Boolean threshold circuits

On the computational power of sigmoid versus Boolean thresho...

引用

Annual IEEE Symposium on Foundations of computer science

作者： W. Maass G. Schnitger E.D. Sontag Institutes for Information Processing Graz Graz University of Technology Graz Austria Department of Computer Science Pennsylvania State University SYCON-Rutgers Center for Systems and Control Department Rutgers University

The power of constant depth circuits with sigmoid (i.e., smooth) threshold gates for computing Boolean functions is examined. It is shown that, for depth 2, constant size circuits of this type are strictly more powerful than constant size Boolean threshold circuits (i.e., circuits with Boolean threshold gates). On the other hand it turns out that, for any constant depth d, polynomial size sigmoid threshold circuits with polynomially bounded weights compute exactly the same Boolean functions as the corresponding circuits with Boolean threshold gates.< >

关键词： Circuits Boolean functions Analog computers computer networks Concurrent computing Neurons Computational modeling Information processing Polynomials Neural networks

来源：评论

学校读者我要写书评

暂无评论

FULL-WAVE SOLUTION OF DIELECTRIC LOADED WAVE-GUIDES AND SHIELDED MICROSTRIPS UTILIZING FINITE-DIFFERENCE AND THE CONJUGATE-GRADIENT METHOD

引用

INTERNATIONAL JOURNAL OF MICROWAVE AND MILLIMETER-WAVE computer-AIDED ENGINEERING 1991年第4期1卷 346-357页

作者： NARAYANAN, V MANELA, M LADE, RK SARKAR, TK Department of Electrical and Computer Engineering Syracuse University Syracuse New York 13244-1240 Viswanathan Narayanan was born in Bangalore India on December 14 1965. He received the BE degree in Electronics and Communications from B.M.S. College of Engineering Bangalore in 1988. He joined the Department of Electrical Engineering at Syracuse University for his graduate studies in 1989 where he is currently a research assistant. His research interests are in microwave measurements numerical electromagnetics and signal processing. Biographies and photos are not available for M. Manela and R. K. Lade. Tapan K. Sarkar (Sf69-M'76-SM'X1) was born in Calcutta. India on August 2 1948. He received the BTech degree from the Indian Institute of Technology Kharagpur India in 1969 the MScE degree from the University of New Brunswick Fredericton Canada in 1971. and the MS and PhD degrees from Syracuse University. Syracuse NY in 1975. From 1975-1976 he was with the TACO Division of the General Instruments Corporation. He was with the Rochester Institute of Technology (Rochester NY) from 1976-1985. He was a Research Fellow at the Gordon Mckay Laboratory Harvard University Cambridge MA from 1977 to 1978. He is now a Professor in the Department of Electrical and Computer Engineering Syracuse University. His current research interests deal with numerical solutions of operator equations arising in electromagnetics and signal processing with application to system design. He obtained one of the “ best solution” awards in May 1977 at the Rome Air Development Center (RADC) Spectral Estimation Workshop. He has authored or coauthored more than 154 journal articles and conference papers and has written chapters in eight books. Dr. Sarkar is a registered professional engineer in the state of New York. He received the Best Paper Award of the IEEE Transactions on Electromagnetic Compatibility in 1979. He was an Associate Editor for feature articles of the lEEE Antennas arid Propagation Sociefy Newsletter and was

Dynamic analysis of waveguide structures containing dielectric and metal strips is presented. The analysis utilizes a finite difference frequency domain procedure to reduce the problem to a symmetric matrix eigenvalue problem. Since the matrix is also sparse, the eigenvalue problem can be solved quickly and efficiently using the conjugate gradient method resulting in considerable savings in computer storage and time. Comparison is made with the analytical solution for the loaded dielectric waveguide case. For the microstrip case, we get both waveguide modes and quasi-TEM modes. The quasi-TEM modes in the limit of zero frequency are checked with the static analysis which also uses finite difference. Some of the quasi-TEM modes are spurious. This article describes their origin and discusses how to eliminate them. Numerical results are presented to illustrate the principles.

关键词： Waveguides

来源：评论

学校读者我要写书评

暂无评论

A design data manager 88

A design data manager

引用

Proceedings of the 1988 ACM SIGMOD international conference on Management of data

作者： Kari Alho Hannu Peltonen Martti Mäntylä Rejio Sulonen Helsinki University of Technology Department of Computer Science Laboratory of Information Processing Science Otakaari 1 SF-02150 Espoo Finland

ISBN: (纸本)9780897912686

HutBase is a visual design data manager that can be used to store and manipulate data objects created and processed by a variety of design applications. In particular, HutBase allows the user to manipulate the data and start applications, and provides a access mechanism for the *** consists of three software layers. The lowest layer, the Object Management System (OMS), is based on the Entity-Relationship model and includes those basic operations related to the storage and access of design data objects that are common to all applications. The database is divided into workspaces, which are collections of OMS objects and relationships organized according to an application-dependent schema and forming a significant whole (e.g., a design project) from the user's point of view Workspace is also the unit for locking and access *** object is a collection of attributes. Each attribute has a name and value. The name is a string and the value is an arbitrary sequence of bytes. The value of an attribute can be of any length, from a single integer to an external representation of a complicated geometric model. A relationship is a named directed connection between two objects. Relationships have attributes like *** OMS library contains functions for creating, opening and removing workspaces, objects, relationships and attributes. All operations are carried out within transactions. The functions do not change the permanent data on the disk until the user calls the save_changes function, which saves the current state of all workspaces opened in a given *** next layer is a prototype data model built on top of OMS, which stores the objects in each workspace as a hierarchical tree by means of relationships. The leaves of the hierarchy are called representations and contain the actual data manipulated by the applications. Each representation is associated with a representation type, which in turn are linked to the application programs, or too

关键词：

来源：评论

学校读者我要写书评

暂无评论

The AMIGO Project - Advanced group communication model for computer-based communications environment 86

The AMIGO Project - Advanced group communication model for c...

引用

1986 ACM Conference on computer-Supported Cooperative Work, CSCW 1986

作者： Danielsen, Thore Pankoke-Babatz, Uta Prinz, Wolfgang Patel, Ahmed Pays, Paul-André Smaaland, Knut Speth, Rolf Department of Computer Science University of Tromsoe Norway Institute for Applied Information Technology Society for Mathematics and Data Processing St Augustin Germany Department of Computer Science University College Dublin Belfield Dublin 4 Ireland Ecole des Mines Department Informatique Appliquée Saint-Etienne Cedex 242033 France University of Oslo Norway Information Technologies and Telecommunications Task Force Commission of the European Communities Rue de la Loi Brussels Belgium

ISBN: (纸本)9781450373654

In this paper we discuss and elaborate on the conceptual requirements as well as the tools of the General AMIGO Model for group communication. The special features of the model are examined with particular reference to the social and ethical implications in the communication process. The applicability of the AMIGO Model is demonstrated by examples, and we give indications of further work to refine and advance the model. © 1986 Association for Computing Machinery. All rights reserved.

关键词： Philosophical aspects

来源：评论

学校读者我要写书评

暂无评论

Bintrees, CSG trees, and time 85

Bintrees, CSG trees, and time

引用

Proceedings of the 12th annual conference on computer graphics and interactive techniques

作者： Hanan Samet Markku Tamminen Computer Science Department University of Maryland College Park MD Laboratory for Information Processing Science Helsinki University of Technology 02150 Espoo 15 Finland

ISBN: (纸本)9780897911665

A discussion is presented of the relationship between two solid representation schemes: constructive solid geometry (CSG trees) and recursive spatial subdivision exemplified by the bintree, a generalization of the quadtree and octree. Detailed algorithms are developed and analyzed for evaluating CSG trees by bintree conversion, i.e., by determining explicitly which parts of space are solid and which empty. These techniques enable the addition of the time dimension and motion to the approximate analysis of CSG trees in a simple manner to solve problems such as dynamic interference detection. For "well-behaved" CSG trees, the execution time of the conversion algorithm is directly related to the spatial complexity of the object represented by the CSG tree (i.e., asymptotically it is proportional to the number of bintree nodes as the resolution increases). The set of well-behaved CSG trees includes all trees that define multidimensional polyhedra in a manner that does not give rise to tangential intersections at CSG tree nodes.

关键词： constructive solid geometry (CSG) octrees image processing hierarchical data structures motion bintrees time interference detection solid modeling quadtrees conversion

来源：评论

学校读者我要写书评

暂无评论

Efficient octree conversion by connectivity labeling 84

Efficient octree conversion by connectivity labeling

引用

Proceedings of the 11th annual conference on computer graphics and interactive techniques

作者： Markku Tamminen Hanan Samet Laboratory of Information Processing Science Helsinki University of Technology 02150 Espoo 15 Finland Computer Science Department University of Maryland College Park MD

ISBN: (纸本)9780897911382

We present an algorithm for converting from the boundary representation of a solid to the corresponding octree model. The algorithm utilizes an efficient new connected components labeling technique. A novelty of the method is the demonstration that all processing can be performed directly on linear quad and octree encodings. We illustrate the use of the algorithm by an application to geometric mine modeling and verify its performance by analysis and practical experiments.

关键词： Image processing Conversion Octree

来源：评论

学校读者我要写书评

暂无评论

From information requirements to DBTG-data structures

From information requirements to DBTG-data structures

引用

1976 Conference on Data: Abstraction, Definition and Structure

作者： Bubenko, J.A. Berild, S. Lindencrona-Ohlin, E. Nachmens, S. Research Group CADIS Department of Information Processing and Computer Science Royal Institute of Technology University of Stockholm Sweden

The problem of determining, analysis and description of a particular application's information structure (and relations) and the process of mapping the information structure to a data structure (in this case a DBTG-type structure) is considered. The applicability of a top-down oriented design procedure to a relatively large practical data base design case is demonstrated. A conceptual framework and a notation to be used for determining and definition of information requirements, information structure and information relations is suggested. A systematic and partly formalized approach to map an information structure to a DBTG-type data structure is discussed. The problem of analysis and evaluation of alternative DBTG-type structures is also considered. © Association for Computing Machinery. All rights reserved.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Report on ACM's activity on community and junior college curriculum career program in computer programming 76

Report on ACM's activity on community and junior college cur...

引用

1976 ACM SIGCSE-SIGCUE Technical Symposium on computer science and Education, SIGCSE 1976

作者： Little, Joyce Currie Seeds, Harice Lenhardt, Ronald Dineen, John Maniotes, John Data Processing and Computing Sciences Community College of Baltimore Maryland United States Department of Data Processing Los Angeles City College California United States Department of Computer Services Yavapai College PrescottAZ United States Department of Computer Science Middlesex Community College EdisonNJ United States Department of Computer Technology Calumet Campus Purdue University HammondIN United States

ISBN: (纸本)9781450374125

A Workshop in Two Year College Programs in computer science was held August 11-13, 1975 in Gloucester Point, Virginia. Sponsored by the ACM's Special Interest Group in computer science Education (SIGCSE), it brought thirteen community and junior college participants together at the Virginia Institute for Marine science (VIMS) to work toward recommendations for a two year program.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

A Protocol for Packet Network Intercommunication

引用

IEEE Transactions on Communications 1974年第5期22卷 637-648页

作者： Cerf, Vinton G. Kahn, Robert E. Department of Computer Science and Electrical Engineering Stanford University Stanford Calif. United States Information Processing Technology Office Advanced Research Projects Agency Department of Defense Arlington Va. United States

A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process-to-process connections. Some implementation issues are considered, and problems such as internetwork routing, accounting, and timeouts are exposed. Copyright © 1974 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Protocols Packet switching Communication switching Internet Switches Error correction Routing computer networks Size control Communication networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：