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

On adaptive threshold intervals for stopping recursive least squares in the space of signals

Informatica 1996年第1期7卷 27-38页

作者： Pupeikis, Rimantas Inst. of Mathematics and Informatics 2600 Vilnius Akademijos St. 4 Lithuania Kaunas Polytechnic Institute Kaunas Lithuania Inst. of Mathematics and Informatics

In the papers (Kaminskas, 1973;Kaminskas and Nemura, 1975) the stopping rule of recursive least squares (RLS) is worked out using the length of the confidence interval for the respective current meaning of the true output signal of a linear dynamic system. The aim of the given paper is the development of techniques for calculating threshold intervals of respective criteria, used in such a stopping rule. In this connection adaptive threshold intervals based on the Cramer-Rao lower bound according to Pupeikis (1995) are proposed here, too. The results of numerical simulation by IBM PC/AT are given.

关键词： Dynamic system Least squares recursive algorithm Threshold

来源：评论

学校读者我要写书评

暂无评论

Improved algorithm to evaluate the reliability of a circular consecutive 2-out-of-r-from-n:F system

Improved algorithm to evaluate the reliability of a circular...

引用

35th SICE International Annual Conference (SICE 96)

作者： Higashiyama, Y Kraetzl, M Caccetta, L EHIME UNIV DEPT ELECT & ELECT ENGNMATSUYAMAEHIME 790JAPAN

ISBN: (纸本)0780337514

A circular consecutive k-out-of-r-from-n:F system consists of n components ordered on a cycle. The system fails if and only if there are r consecutive components at least k of which are failed. The time complexity of a recently published algorithm for circular consecutive k-out-of-r-from-n:F system is O(nr). This paper proposes a method to improve upon this O(nr) algorithm.

关键词： circular consecutive 2-out-of-r-from-n:F system exact reliability recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

The influence of burstiness and correlation of traffic on an ATM multiplexer

The influence of burstiness and correlation of traffic on an...

引用

1996 International Conference on Communication Technology

作者： Liao, JX Li, LM Sun, HR UNIV ELECT SCI & TECHNOL CHINA NATL KEY LAB OPT FIBER COMMUNCHENGDU 610054PEOPLES R CHINA

ISBN: (纸本)7505336355

This paper presents a traffic model for an ATM multiplexer providing video, voice, image, and data services. The traffic model classifies the input traffic into two types: real-time and non-real-time. The input process for real-time traffic is a Markov modulated Bernoulli process (MMBP), while that for non-real-time traffic is a Bernoulli process with batches. The z-transform of the cell interarrival time A/sub MMBP/(z) is obtained. The average traffic load /spl rho//sub MMBP/ and the squared coefficient of variation of the time between success cell C/sup 2//sub MMBP/ are then obtained from the respective derivatives of A/sub MMBP/(z). The autocorrelation coefficient of the cell interarrival time with lag 1 /spl psi/, can be also obtained. This paper presents an iterative algorithm that can be used to calculate the MMBP probability distribution of the cell interarrival time. So far few results about discrete-time finite buffer queues with correlated inputs are known. This paper analyzes the performance of an ATM multiplexer considering the correlation and burst in cell arrivals. For the MMBP-stream, the waiting time distribution and the cell loss probability for MMBP+M/sup [X]//D/1/K finite buffer system are all exactly calculated with the use of a recursive algorithm. Calculations show the influence of burstiness and correlation on both the loss probability and waiting time. The accuracy of the analytical results has been largely validated by means of a simulation approach.

关键词： asynchronous transfer mode multiplexing equipment telecommunication traffic Markov processes modulation buffer storage correlation methods queueing theory Poisson distribution iterative methods Z transforms ATM multiplexer burstiness correlation traffic model real-time traffic nonreal-time traffic Markov modulated Bernoulli process Bernoulli process z-transform cell interarrival time average traffic load autocorrelation coefficient iterative algorithm probability distribution discrete-time finite buffer queues correlated inputs waiting time distribution cell loss probability recursive algorithm simulation poisson distribution

来源：评论

学校读者我要写书评

暂无评论

ROUTING IN A LINEAR LIGHTWAVE NETWORK

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1995年第4期3卷 459-469页

作者： BALA, K STERN, TE SIMCHILEVI, D BALA, K COLUMBIA UNIV DEPT ELECT ENGNNEW YORKNY 10027 NORTHWESTERN UNIV DEPT IND ENGN & MANAGEMENT SCIEVANSTONIL 60201 MIT COMP SCI LABCAMBRIDGEMA 02139

In this work, dynamic routing of point-to-point connections in a waveband selective linear lightwave network is addressed, Linear lightwave networks are all optical networks in which only linear operations are performed on signals in a waveband selective manner, Special constraints arise because of the linearity in the linear lightwave network, The overall problem of finding a path satisfying all the routing constraints for point-to-point connections is shown to be very complex, Owing to the complexity, the overall routing problem is decomposed into several subproblems. In particular, given a request for a point-to-point connection a waveband is first chosen for the call, Two heuristics, MAXBAND which allocates the most used band to a call acid another MINBAND (least used band) were studied, Then, the problem of routing in a given waveband was further divided into smaller subproblems of finding a path in the waveband, checking for feasibility of the path in the chosen waveband and channel allocation (within the waveband), For finding paths in a waveband, K-SP, BLOW-UP and MIN-INT algorithms were proposed, A recursive algorithm checks for feasibility of the path on the waveband, Two channel allocation schemes (within a single waveband) MIN and MAX were presented, Simulations showed;that using MAXBAND (waveband), MIN-INT (path on waveband) and MIN (channel within waveband) policies resulted in the best performance (least blocking).

关键词： Optical Fibre Networks Telecommunication Network Routing Frequency Allocation Telecommunication Channels Linear Lightwave Network Point To Point Connections Dynamic Routing All Optical Networks MAXBAND MINBAND Least Used Band Channel Allocation K SP BLOW UP MIN INT recursive algorithm Policies Routing Intelligent Networks Optical Receivers Optical Transmitters Optical Fiber Networks Optical Modulation Stimulated Emission Channel Allocation Optical Control All Optical Networks

来源：评论

学校读者我要写书评

暂无评论

A recursive algorithm FOR FINDING THE MINIMUM NORM POINT IN A POLYTOPE AND A PAIR OF CLOSEST POINTS IN 2 POLYTOPES

引用

MATHEMATICAL PROGRAMMING 1993年第2期61卷 233-249页

作者： SEKITANI, K YAMAMOTO, Y 1. Institute of Socio-Economic Planning University of Tsukuba 305 Tsukuba Ibaraki Japan

For a given pair of finite point sets P and Q in some Euclidean space we consider two problems: Problem 1 of finding the minimum Euclidean norm point in the convex hull of P and Problem 2 of finding a minimum Euclidean distance pair of points in the convex hulls of P and Q. We propose a finite recursive algorithm for these problems. The algorithm is not based on the simplicial decomposition of convex sets and does not require to solve systems of linear equations.

关键词： MINIMUM NORM POINT MINIMUM DISTANCE PAIR OF POINTS recursive algorithm CONVEX QUADRATIC PROGRAM

来源：评论

学校读者我要写书评

暂无评论

SHAPE DECOMPOSITION AND REPRESENTATION USING A recursive MORPHOLOGICAL OPERATION

引用

PATTERN RECOGNITION 1995年第11期28卷 1783-1792页

作者： WANG, DM HAESECOAT, V RONSIN, J INST NATL SCI APPL AUTOMAT LABEQUIPE IMAGEF-35043 RENNESFRANCE

This paper presents a recursive morphological operation developed in order to perform efficient shape representation. This operation uses a structuring element as a geometrical primitive to evaluate the shape of an object. It results in a set of loci of the translated structuring elements that are included in the object but which do not overlap. The analysis of its computational complexity shows that it is usually less time-consuming than morphological erosion. By using this operation, an object decomposition algorithm is then developed for shape representation. It decomposes an object into a union of simple and nonoverlapping object components. The object is represented by the sizes and loci of its object components. This representation is information preserving shift and scale invariant, and non-redundant. It has been compared with skeletons, morphological decomposition, chain codes and quatrees in terms of compression ability and image processing facility. Experimental results shows that it is very compact, especially if information loss is allowed. Because of the non-overlap between object components, many image processing tasks can be easily performed by directly using this shape representation.

关键词： SHAPE REPRESENTATION OBJECT DESCRIPTION IMAGE DECOMPOSITION MATHEMATICAL MORPHOLOGY recursive algorithm DATA COMPRESSION IMAGE CODING

来源：评论

学校读者我要写书评

暂无评论

HYBRID algorithm FOR THE COMPUTATION OF THE MATRIX POLYNOMIAL I+A+CENTER-DOT-CENTER-DOT-CENTER-DOT+A(N-1)

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS 1995年第7期42卷 377-380页

作者： DIMITROV, V COOKLEV, T TOKYO INST TECHNOL DEPT PHYS ELECTRTOKYO 152JAPAN

In this brief, a new method for computing the matrix polynomial is proposed. The comparison demonstrates that this is the most efficient technique at the moment, Furthermore we argue that the approach is optimal in the framework of the discussed algorithms. The algorithm is recursive and it can be viewed as resulting from a new number system.

关键词： computational complexity matrix multiplication polynomial matrices hybrid algorithm matrix polynomial number system recursive algorithm recursive algorithms AN 1 counting system algorithms complexity classes Polynomial matrices Matrix multiplication

来源：评论

学校读者我要写书评

暂无评论

RELIABILITY OF A LINEAR CONNECTED-(R,S)-OUT-OF-(M,N)-F LATTICE SYSTEM

引用

IEEE TRANSACTIONS ON RELIABILITY 1995年第2期44卷 333-336页

作者： YAMAMOTO, H MIYAKAWA, M UNIV TOKYO DEPT MATH ENGN & INFORMAT PHYSBUNKYO KUTOKYO 113JAPAN

A linear connected-(r,s)-out-of-(m,n):F lattice system has its components ordered like the elements of a (m,n)-matrix such that the system fails iff all components in a connected (r,s)-submatrix fail. This paper proposes a recursive algorithm, named Yamamoto-Miyakawa (YM), for the system reliability. The YM algorithm requires O(s(m-r) . m(2) . r . n) computing time. Comparisons with the existing methods show its usefulness. We prove that the reliability of the large system tends to exp(-mu . lambda(r . s)) as n = mu . m(eta-1), m --> infinity if every component has failure probability lambda . m(-eta/(r . s)), where mu,lambda,eta are constant, mu > 0, lambda > 0, eta > s, or r/(r-1) - eta > 1.

关键词： LINEAR CONNECTED-(R,S)-OUT-OF-(M,N)-F LATTICE SYSTEM recursive algorithm LIMIT VALUE

来源：评论

学校读者我要写书评

暂无评论

AN algorithm TO APPROXIMATE THE LIKELIHOOD FOR PEDIGREE DATA WITH LOOPS BY CUTTING

引用

THEORETICAL AND APPLIED GENETICS 1995年第6-7期91卷 1054-1063页

作者： STRICKER, C FERNANDO, RL ELSTON, RC LOUISIANA STATE UNIV MED CTRDEPT BIOMETRY & GENETNEW ORLEANSLA 70112 LOUISIANA STATE UNIV MED CTRCTR MOLEC & HUMAN GENETNEW ORLEANSLA 70112 UNIV ILLINOIS DEPT ANIM SCIURBANAIL 61801

This paper presents a recursive algorithm to approximate the likelihood in arbitrary pedigrees with loops. The algorithm handles any number and nesting levels of loops in pedigrees. The loops are cut as described in a previous publication and the approximate likelihood is simultaneously computed using the cut pedigree. No identification of a loop in the pedigree is necessary before the algorithm is applied.

关键词： ARBITRARY PEDIGREES WITH LOOPS recursive algorithm PEELING LIKELIHOOD CUTTING LOOPS

来源：评论

学校读者我要写书评

暂无评论

ORTHO-ORDENT INITIALIZATION OF FFANNAS TO IMPROVE THEIR GENERALIZATION ABILITY

ORTHO-ORDENT INITIALIZATION OF FFANNAS TO IMPROVE THEIR GENE...

引用

1st International Conference on Applications and Science of Artificial Neural Networks

作者： SARKAR, D UNIV MIAMI DEPT MATH & COMP SCICORAL GABLESFL 33124

ISBN: (纸本)0819418455

There are several models for neurons and their interconnections. Among them, feedforward artificial neural networks (FFANNs) are very popular for being quite simple. However, to make them truly reliable and smart information processing systems, such characteristics as learning speed, local minima, and generalization ability need more understanding. Difficulties such as long learning-time and local minima, may not affect them as much as the question of generalization ability, because in many applications a network needs only one training, and then it may be used for a long time. However, the question of generalization ability of ANNs is of great interest for both theoretical understanding and practical use, because generalization ability is a measure of a learning system that indicates how closely its actual output approximates to the desired output for an input that it has never seen. We investigate novel techniques for systematic initializations (as opposed to purely random initializations) of FFANN architectures for possible improvement of their generalization ability. Our preliminary work has successfully employed row-vectors of Hadamard matrices to generate initializations;this initialization method has produced networks with better generalization ability. © 1995 SPIE.

关键词： ARTIFICIAL NEURAL NETWORKS (ANNS) BIPOLAR VECTORS ERROR BACKPROPAGATION LEARNING FEEDFORWARD NETWORKS GENERALIZATION ABILITY OF LEARNING SYSTEMS HADAMARD MATRICES INITIALIZATION OF ANNS ORTHOGONAL VECTORS recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：