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

A SOFTWARE TOOL FOR LEARNING ABOUT STOCHASTIC-MODELS

IEEE TRANSACTIONS ON EDUCATION 1993年第1期36卷 56-61页

作者： SAHNER, RA TRIVEDI, KS DUKE UNIV DEPT ELECT ENGN & COMP SCIDURHAMNC 27706

The study of stochastic modeling can be greatly enriched by the use of computer software. Such software should enable students to experiment with modeling techniques, check their understanding of algorithms for model analysis, develop the skills and ''intuition'' to know how to evaluate results, and experiment with using models to evaluate design tradeoffs. In this paper, we use a series of examples to show how a powerful and general modeling program can be used in an educational setting.

关键词： Software tools Stochastic processes Fault trees Computer network reliability algorithm design and analysis Education Mathematics Computer science Stochastic systems Software algorithms

来源：评论

学校读者我要写书评

暂无评论

CONVEXITY-BASED algorithmS FOR design CENTERING

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1994年第12期13卷 1536-1549页

作者： SAPATNEKAR, SS VAIDYA, PM KANG, SM UNIV ILLINOIS DEPT COMP SCIURBANAIL 61801 UNIV ILLINOIS COORDINATED SCI LABURBANAIL 61801 UNIV ILLINOIS DEPT ELECT & COMP ENGNURBANAIL 61801

A new technique for design centering and polytope approximation of the feasible region for a design are presented. In the first phase, the feasible region is approximated by a convex polytope, using a method based on a theorem on convex sets. As a natural consequence of this approach, a good approximation to the design center is obtained. In the next phase, the exact design center is estimated using one of two techniques that we present in this paper. The first inscribes the largest Hessian ellipsoid, which is known to be a good approximation to the shape of the polytope, within the polytope. This represents an improvement over previous methods, such as simplicial approximation, where a hypersphere or a crudely estimated ellipsoid is inscribed within the approximating polytope. However, when the probability density functions of the design parameters are known, the design center does not necessaily correspond to the center of the largest inscribed ellipsoid. Hence, a second technique is developed that incorporates the probability distributions of the parameters, under the assumption that their variation is modeled by Gaussian probability distributions. The problem is formulated as a convex programming problem and an efficient algorithm is used to calculate the design center, using fast and efficient Monte Carlo methods to estimate the yield gradient. An example is provided to illustrate how ellipsoid-based methods fail to incorporate the probability density functions and is solved using the convex programming-based algorithm.

关键词： algorithm design and analysis Ellipsoids Circuits Probability density function Probability distribution Phase estimation Shape Yield estimation Manufacturing processes Delay

来源：评论

学校读者我要写书评

暂无评论

COMPARATIVE-STUDY OF ACCELERATION TECHNIQUES FOR INTEGRALS AND SERIES IN ELECTROMAGNETIC PROBLEMS

引用

RADIO SCIENCE 1995年第6期30卷 1713-1722页

作者： KINAYMAN, N AKSUN, MI Department of Electrical and Electronics Engineering Bilkent University Bilkent Ankara Turkey

Most electromagnetic problems can be reduced to either integrating oscillatory integrals or summing up complex series. However, limits of the integrals and the series usually extend to infinity, and, in addition, they may be slowly convergent. Therefore numerically efficient techniques for evaluating the integrals or for calculating the sum of an infinite series have to be used to make the numerical solution feasible and attractive. In the literature there are a wide range of applications of such methods to various EM problems. In this paper our main aim is to critically examine the popular series transformation (acceleration) methods which are used in electromagnetic problems and to introduce a new acceleration technique for integrals involving Bessel functions and sinusoidal functions.

关键词： Acceleration Chebyshev approximation Convergence Magnetic domains Transforms Microstrip algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Loop-Free Routing Using Diffusing Computations

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1993年第1期1卷 130-141页

作者： Garcia-Lunes-Aceves, J. J. Univ Calif Santa Cruz Dept Comp Engn Santa Cruz CA 95064 USA SRI Int Network Informat Syst Ctr Menlo Pk CA 94025 USA

A family of distributed algorithms for the dynamic computation of the shortest paths in a computer network or internet is presented, validated, and analyzed. According to these algorithms, each node maintains a vector with its distance to every other node. Update messages from a node are sent only to its neighbors;each such message contains a distance vector of one or more entries, and each entry specifies the length of the selected path to a network destination, as well as an indication of whether the entry constitutes an update, a query, or a reply to a previous query. The new algorithms treat the problem of distributed shortest-path routing as one of diffusing computations, which was first proposed by Dijkstra and Scholten. They improve on algorithms introduced previously by Chandy and Misra, Jaffe and MOSS, Merlin and Segall, and the author. The new algorithms are shown to converge in finite time after an arbitrary sequence of link cost or topological changes, to be loop-free at every instant, and to outperform all other loop-free routing algorithms previously proposed from the standpoint of the combined temporal, message, and storage complexities.

关键词： Computer Networks Distributed algorithms Internetworking Optimisation Telecommunication Network Routing Loop Free Routing Convergence DUAL Diffusing Computations Distributed algorithms Dynamic Computation Shortest Paths Computer Network Internet Routing Protocols Computer Networks Distributed Computing Military Computing Internet H Infinity Control Distributed algorithms IP Networks algorithm design and analysis Costs

来源：评论

学校读者我要写书评

暂无评论

A SET OF algorithmS LINKING NLMS AND BLOCK RLS algorithmS

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1995年第2期43卷 444-453页

作者： MONTAZERI, M DUHAMEL, P ECOLE NATL SUPER TELECOMMUN BRETAGNE SIGF-75013 PARISFRANCE

This paper describes a set of block processing algorithms which contains as extremal cases the normalized least mean squares (NLMS) and the block recursive least squares (BRLS) algorithms. All these algorithms use small block lengths, thus allowing easy implementation and small input-output delay. It is shown that these algorithms require a lower number of arithmetic operations than the classical least mean squares (LMS) algorithm, while converging much faster. A precise evaluation of the arithmetic complexity is provided, and the adaptive behavior of the algorithm is analyzed. Simulations illustrate that the tracking characteristics of the new algorithm are also improved compared to those of the NLMS algorithm. The conclusions of the theoretical analysis are checked by simulations, illustrating that, even in the case where noise is added to the reference signal, the proposed algorithm allows altogether a faster convergence and a lower residual error than the NLMS algorithm. Finally, a sample-by-sample version of this algorithm is outlined, which is the link between the NLMS and recursive least squares (RLS) algorithms.

关键词： Joining processes Resonance light scattering Least squares methods Arithmetic algorithm design and analysis Delay Least squares approximation Signal analysis Analytical models Convergence

来源：评论

学校读者我要写书评

暂无评论

ARCHITECTURAL LEVEL TEST-GENERATION FOR MICROPROCESSORS

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1994年第10期13卷 1288-1300页

作者： LEE, JS PATEL, JH UNIV ILLINOIS CTR RELIABLE & HIGH PERFORMANCE COMPURBANAIL 61801

Hierarchically designed microprocessor-like VLSI circuits have complex data paths and embedded control machines to execute instructions. When a test pattern has to be applied to the input of an embedded module, determination of a sequence of instructions, which will apply this pattern and propagate the fault effects, is extremely difficult. After the instruction sequence is derived, to assign values at all interior lines without conflicts is also very difficult. In this paper, we propose a separation of test generation process into two phases: path analysis and value analysis. In the phase of path analysis, a new methodology for automatic assembly of a sequence of instructions is proposed to satisfy the internal test goals. In the phase of value analysis, an equation-solving algorithm is used to compute an exact value solution for all interior lines. This new ATPG methodology containing techniques for both path and value analysis forms a complete solution for a variety of microprocessor-like circuits. This new approach has been implemented and experimented on six high-level circuits. The results show that our approach is very effective in achieving complete automation for high-level test generation.

关键词： Microprocessors Circuit testing Automatic testing Very large scale integration Circuit faults Assembly algorithm design and analysis Equations Automatic test pattern generation Automation

来源：评论

学校读者我要写书评

暂无评论

PARAMETRIC SYSTEM-IDENTIFICATION ON LOGARITHMIC FREQUENCY-RESPONSE DATA

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1991年第9期36卷 1065-1070页

作者： SIDMAN, MD DEANGELIS, FE VERGHESE, GC MARTIN MARIETTA CORP IR&R ADV AVIONDENVERCO 80201 MIT DEPT ELECT ENGN & COMP SCICAMBRIDGEMA 02139

Gradient search methods that fit the parameters of a user-defined transfer function model to experimental logarithmic frequency response data are presented. The methods match a model based on physically significant parameters, including natural frequencies of poles and zeros and damping ratios of complex poles and zeroes. The algorithms construct and utilize their own analytical gradient descent functions, based on the desired model. One method attempts to fit both log magnitude and phase, while another identifies a minimum phase transfer function model from only log magnitude frequency response data. The performance of the log magnitude algorithm is shown to be superior to traditional methods using nonlogarithmic frequency response data, including those used in commercially available frequency response analyzers. The algorithms are shown to perform well, especially for systems with lightly damped dynamics.

关键词： System identification Frequency response Transfer functions Frequency measurement Dynamic range Signal processing algorithms Search methods Springs Performance analysis algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Face in any Form: New Challenges and Opportunities for Face Recognition Technology

引用

COMPUTER 2017年第4期50卷 80-90页

作者： Akhtar, Zahid Rattani, Ajita Univ Udine Dept Math & Comp Sci Udine Italy Univ Missouri Dept Comp Sci & Elect Engn Columbia MO 65211 USA

Despite new technologies that make face detection and recognition more sophisticated, long-recognized problems in security, privacy, and accuracy persist. Refining this technology and introducing it into new domains will require solving these problems through focused interdisciplinary efforts among developers, researchers, and policymakers.

关键词： Face recognition Feature extraction Solid modeling Image recognition Three-dimensional displays algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

ON NUMERICAL OPTIMIZATION OF COMMUNICATIONS-SYSTEM design

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1988年第1期6卷 106-125页

作者： ERUP, L HARRIS, RA European Space Agency Noordwijk Netherlands

The limiting factor in the use of computer tools for the design of communications systems is often the amount of human intervention needed, rather than the actual computation time. A technique is presented by which a large proportion of the low-level decision making is delegated to the computer, thereby allowing the designer to concentrate on the engineering aspects and higher-level tradeoffs. The implementation described can be used with existing design programs (e.g., transmission simulators). The possibilities and limitations of the technique are discussed, and several examples of its application are given.< >

关键词： design optimization Computational modeling Humans Computer simulation design engineering Operating systems algorithm design and analysis Satellites System performance Analytical models

来源：评论

学校读者我要写书评

暂无评论

A LOOSE-PATTERN PROCESS APPROACH TO CLUSTERING FUZZY DATA SETS

引用

IEEE TRANSACTIONS ON PATTERN analysis AND MACHINE INTELLIGENCE 1985年第3期7卷 366-372页

作者： GU, T DUBUISSON, B University of Technology of Compiegne 6020 Compiegne Cedex France

A loose-pattern process approach to clustering sets consists of three main computations: loose-pattern reject option, tight-pattern classifcation, and loose-pattern assigning classes. The loose-pattern rejection is implemented using a rule based on q nearest neighbors of each point. Two clustering methods, GLC and OUPIC, are introduced as tight-pattern clustering techniques. The decisions of loose-pattern assigning classes are related to a heuristic membership function. The function and experiments with one set is discussed.","doi":"10.1109/TPAMI.1985.4767669","publicationTitle":"IEEE Transactions on Pattern analysis and Machine Intelligence","startPage":"366","endPage":"372","rightsLink":"http://***/AppDispatchServlet?publisherName=ieee&publication=0162-8828&title=A+Loose-Pattern+Process+Approach+to+Clustering+Fuzzy+Data+Sets&isbn=&publicationDate=May+1985&author=Tao+Gu&ContentID=10.1109/TPAMI.1985.4767669&orderBeanReset=true&startPage=366&endPage=372&volumeNum=PAMI-7&issueNum=3","displayPublicationTitle":"IEEE Transactions on Pattern analysis and Machine Intelligence","pdfPath":"/iel5/34/4767650/***","keywords":[{"type":"IEEE Keywords","kwd":["Fuzzy sets","Kernel","Random variables","algorithm design and analysis","Convergence","Fast Fourier transforms","Sorting","Clustering algorithms","Probability","Statistics"]},{"type":"Author Keywords ","kwd":["membership function","Classification","clustering algorithm","fuzzy discrimination","fuzzy set"]}],"allowComments":false,"pubLink":"/xpl/***?punumber=34","issueLink":"/xpl/***?isnumber=4767650","standardTitle":"A Loose-Pattern Process Approach to Clustering Fuzzy Data Sets

关键词： Fuzzy sets Kernel Random variables algorithm design and analysis Convergence Fast Fourier transforms Sorting Clustering algorithms Probability Statistics Author Keywords membership function Classification clustering algorithm fuzzy discrimination fuzzy set

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：