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

Asia-Pacific Conference on Software engineering

作者： Jin-Cheng Lin Szu-Wen Lin Louis Huang Dept. of Comput. Sci. & Eng. Tatung Inst. of Technol. Taipei Taiwan Department of Computer Science and Engineering Tatung Institute of Technology Taipei Taiwan

ISBN: (纸本)081868271X

Software testability is becoming an important factor to be considered during software development and assessment, especially for critical software. We give software testability, previously defined by Voas, a new model and measurement which is done before random black-box testing with respect to a particular input distribution. We also compare our measurement results with the results simulated according to Voas's model. It showed that our rough testability estimate provides enough information and will be used as guidelines for software development.

关键词： Software testing Software measurement State estimation computer science Guidelines Graphics Flow graphs Substations

来源：评论

学校读者我要写书评

暂无评论

Finite-element mesh generation using self-organizing neural networks

引用

computer-Aided Civil and Infrastructure engineering 1997年第4期12卷 233-250页

作者： Manevitz, Larry Yousef, Malik Givoli, Dan Dept. of Math. and Computer Science University of Haifa Haifa Israel Faculty of Aerospace Engineering Technion-Israel Inst. of Technology Haifa Israel

Neural networks are applied to the problem of mesh placement for the finite-element method. When the finite-element method is used to numerically solve a partial differential equation with boundary conditions over a domain, the domain must be divided into "elements." The precise placement of the nodes of the elements has a major affect on the accuracy of the numeric method. In this paper the self-organizing algorithm of Kohonen is adapted to solve the problem of automatically assigning (in a near-optimal way) coordinates from a two-dimensional domain to a given topologic grid (or mesh) of nodes in order to apply the finite-element method effectively when solving a partial differential equation with boundary conditions over that domain. One novelty of the method is the interweaving of versions of the Kohonen algorithm in different dimensions simultaneously in order to handle the boundary of the domain properly. Our method allows for the use of arbitrary types of two-dimensional elements (in particular, quadrilaterals or mixed shapes as opposed to just triangles) and for varying desired densities over the domain. (Thus more elements can be placed automatically near "areas of interest.") The methods and experiments developed here are for two-dimensional domains but seem naturally extendible to higher-dimensional problems. The method uses a mixture of both one- and two-dimensional versions of the Kohonen algorithm, with an improvement suggested by Tabakman and Exman, and further adapted to the particular problem here. Experimental results comparing this algorithm with a well-known two-dimensional grid-generating system (PLTMG) are presented. © 1997 Microcomputers in Civil engineering. Published by Blackwell Publishers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Acceleration of the Remez exchange algorithm for the design of L/sub /spl infin// optimum FIR filters

Acceleration of the Remez exchange algorithm for the design ...

引用

International Conference on Digital Signal Processing (DSP)

作者： E.Z. Psarakis G.V. Moustakides Dept. of Comput. Eng. & Inf. Patras Univ. Greece Computer Technology Institute CTI Patras Patras Greece Department of Computer Engineering aiid Informatics University of Patras Patras Greece

A new initialization scheme for the Remez exchange algorithm is proposed. More specifically, the solution of the well known "don't care" filter design method is proposed as a new efficient initialization scheme for the Remez algorithm. Our proposal is motivated by the fact that the "don't care" least squares optimum solution satisfies one of the two basic conditions that are sufficient for obtaining the L/sub /spl infin// optimal solution according to the alternation theorem and at the same time it adequately approximates the second one. Because of these properties we have a significant speed up of the convergence of the Remez exchange algorithm to the L/sub /spl infin// optimum solution.

关键词： Finite impulse response filter Acceleration Algorithm design and analysis H infinity control Chebyshev approximation Least squares approximation Least squares methods Design engineering informatics Design methodology

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of minimum variance CDMA receivers

Performance analysis of minimum variance CDMA receivers

引用

International Conference on Digital Signal Processing (DSP)

作者： M.K. Teatsanis Zhengyuan Xu Dept. of Electr. & Comput. Eng. Stevens Inst. of Technol. Hoboken NJ USA Elcctrical & Computer Engineering Department Stevens Institute of Technology Hoboken NJ USA

Constrained optimization of the receiver's output variance has been proposed as a relatively simple method for designing blind multiuser detectors for DS-CDMA systems. A single constraint is sufficient to avoid signal cancellation in the AWGN case, while multiple constraints should be used in a multipath environment. A max/min approach for optimizing the constraint is proposed, resulting in blind solutions with improved performance. It is shown that the performance of the proposed method approaches that of the MMSE receiver at high SNR, while the constraint parameters converge to the multipath channel parameters. The proposed method does not require knowledge of the interfering users' codes and timing. Simulation results support those performance claims.

关键词： Performance analysis Multiaccess communication Constraint optimization Delay Design optimization Design methodology Detectors Multipath channels Timing Training data

来源：评论

学校读者我要写书评

暂无评论

Associative memory design via perceptron learning

Associative memory design via perceptron learning

引用

International Conference on Neural Networks

作者： Derong Liu Zanjun Lu Dept. of Electr. & Comput. Eng. Stevens Inst. of Technol. Hoboken NJ USA Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken NJ USA

ISBN: (纸本)0780341228

In the present paper, a new synthesis approach is developed for associative memories based on the perceptron learning algorithm. The design (synthesis) problem of feedback neural networks for associative memories is formulated as a set of linear inequalities such that the use of perceptron learning is evident. The perceptron learning in the synthesis algorithms is guaranteed to converge. To demonstrate the applicability of the present results, a specific example is considered.

关键词： Associative memory Network synthesis Neural networks Neurofeedback Design methodology Information retrieval Prototypes Equations Design optimization Linear programming

来源：评论

学校读者我要写书评

暂无评论

Multiobjective search based algorithms for circuit partitioning problem for acceleration of logic simulation

Multiobjective search based algorithms for circuit partition...

引用

International Conference on VLSI Design

作者： S. Harikumer S. Kumar Dept. of Comput. Sci. & Eng. Indian Inst. of Technol. New Delhi India Department of Computer Science and Engineering Indian Institute of Technology New Delhi India

Speeding up logic simulation is important to reduce design time of complex systems. Hardware emulation through reconfigurable systems (RS) built using FPGA's offer an cheap and efficient method to achieve the required speed-up. Emulation through RS poses some unique problems because of the limited circuit and I/O resources. A preparatory step for emulation using RS is to partition the circuit into as few parts as possible satisfying the resource constraints. This paper presents multi-objective search based optimal and approximate algorithms for circuit partitioning for this purpose.

关键词： Partitioning algorithms Acceleration Logic circuits Circuit simulation Field programmable gate arrays Hardware Logic design Computational modeling Emulation Circuit testing

来源：评论

学校读者我要写书评

暂无评论

Algorithms for Hierarchical Spatial Reasoning

引用

GeoInformatica 1997年第3期1卷 251-273页

作者： Papadias, Dimitris Egenhofer, Max J. Department of Computer Science Hong Kong Univ. of Sci. and Technol. Clearwater Bay Hong Kong Natl. Ctr. Geogr. Info. and Anal. Department of Computer Science University of Maine Orono ME 04469-5711 United States Natl. Ctr. Geogr. Info. and Anal. University of Maine Germany Dept. of Spatial Info. Sci. and Eng. United States University of Stuttgart Germany Univ. of Maine in Surv. Engineering United States Computer Science Dept. Hong Kong Univ. of Sci. and Technol. Hong Kong Inst. Intelligent Robotics Info. S. Canada Elec. and Computer Engineering Dept. Natl. Technical University of Athens Greece Department of Geoinformation Technical University of Vienna Austria Dept. of Comp. Sci. and Engineering University of California San Diego CA United States Natl. Ctr. Geogr. Info. and Anal. University of Maine United States Artif. Intell. Research Division Ger. Natl. Res. Ctr. Info. Technol. Germany

In several applications, there is the need to reason about spatial relations using multiple local frames of reference that are hierarchically organized. This paper focuses on hierarchical reasoning about direction relations, a special class of spatial relations that describe order in space (e.g., north or northeast). We assume a spatial database of points and regions. Points belong to regions, which may recursively be parts of larger regions. The direction relations between points in the same region are explicitly represented (and not calculated from coordinates). Inference mechanisms are applied to extract direction relations between points located in different regions and to detect inconsistencies. We study two complementary types of inference. The first one derives the direction relation between points from the relations of their ancestor regions. The second type derives the relation through chains of common points using path consistency. We present algorithms for both types of inference and discuss their computational complexity.

关键词： Direction relations Geographic databases Path consistency Spatial reasoning

来源：评论

学校读者我要写书评

暂无评论

Optimized aluminum back surface field techniques for silicon solar cells

Optimized aluminum back surface field techniques for silicon...

引用

Conference Record of the Twenty Sixth IEEE Photovoltaic Specialists Conference - 1997

作者： S. Narasinha A. Rohatgi Dept. of Electr. & Comput. Eng. Georgia Inst. of Technol. Atlanta GA USA Department of Electrical and Computer Engineering Georgia Institute of Technology University Center of Excellence for Photovoltaics Research and Education Atlanta GA USA

Screen-printed Al and rapid thermal alloying have been combined in order to achieve an Al back surface field (Al-BSF) which lowers the effective back surface recombination velocity to 200 cm/s on 2.3 /spl Omega/cm Si. This Al-BSF process has been integrated into a high-efficiency, laboratory fabrication sequence as well as a high-throughput, industrial-type process in order to achieve solar cell efficiencies in excess of 19.0% and 17.0%, respectively, on 2.3 /spl Omega/cm FZ Si. For both process sequences, the efficiency values are 1-2 absolute percentage points higher than cells made with unoptimized Al-BSFs. The critical process requirements for optimal Al-BSF formation are: (1) the use of a fast ramp rate to reach the alloying temperature; and (2) thick film Al deposition prior to alloying.

关键词： Aluminum Silicon Alloying Rapid thermal processing Laboratories Fabrication Textile industry Photovoltaic cells Temperature Thick films

来源：评论

学校读者我要写书评

暂无评论

Elf90 - A first programming language

Elf90 - A first programming language

引用

1996 ASEE Annual Conference Proceedings

作者： Lahey, Thomas M. Walker, Thomas D.L. Lahey Computer Systems Inc. Virginia Polytech. Inst./State Univ. Dept. of Engineering Fundamentals VPI and SU

Essential Lahey FORTRAN 90 (Elf90) is a FORTRAN 90 compiler specifically designed from a pedagogical viewpoint to provide a FORTRAN teaching/learning environment that is user-friendly without damaging the power of the language. This paper introduces the language and its design criteria. It also explores the question of what language to teach as a first programming language.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

On transformations into linear database logic programs 2nd

On transformations into linear database logic programs

引用

2nd International Conference on Perspectives of Systems informatics, 1996

作者： Afrati, Foto Gergatsoulis, Manolis Katzouraki, Maria Dept. of Electrical and Computer Engineering National Technical University of Athens Athens157 73 Greece Inst. of Informatics and Telecom. N.C.S.R. ‘Demokritos’ 153 10 A. Paraskevi Attikis Greece

ISBN: (纸本)3540620648

We consider the problem of transformations of logic programs without function symbols (database logic programs) into a special subclass, namely linear logic programs. Linear logic programs are defined to be the programs whose rules have at most one intentional atom in their bodies. a) We investigate linearizability of several syntactically defined subclasses of programs and present both positive and negative results (i.e. demonstrate programs that cannot be transformed into a linear program by any transformation technique), and b) We develop an algorithm which transforms any program in a specific subclass namely the piecewise logic programs into a linear logic program. © Springer-Verlag Berlin Heidelberg 1996.

关键词： computer circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：