A class U of recursive functions is said to be finitely (a, b) learnable if and only if for any b tuple of pairwise distinct functions from U at least a of the b functions have been learned correctly from examples of ...
详细信息
A class U of recursive functions is said to be finitely (a, b) learnable if and only if for any b tuple of pairwise distinct functions from U at least a of the b functions have been learned correctly from examples of their behavior after some finite amount of time. It is shown that this approach, called learning in parallel, is more powerful than nonparallel learning. Furthermore, it is shown that imposing the restriction (called parallel super learning) on parallel learning that the learning algorithm also identiy on which of the input functions it is successful is still more powerful than nonparallel learning, A necessary and sufficient condition is derived for (a, b) superlearning and (c, d) superlearning being the same power, Our new notion of parallel learning is compared with other, previously defined notions of learning in parallel. Finally, we synthesize our notion of learning in parallel with the concept of team learning and obtain some interesting trade-offs and comparisons. (C) 1995 Academic Press, Inc.
Grzegorczyk (1953) defines a recursive hierarchy f(i)(x). The diagonal function f(x)(x) majorizes every primitive recursive function and gives an example of an effectively computable, nonprimitive recursive function. ...
详细信息
Grzegorczyk (1953) defines a recursive hierarchy f(i)(x). The diagonal function f(x)(x) majorizes every primitive recursive function and gives an example of an effectively computable, nonprimitive recursive function. An iterative algorithm is presented which computes f(i)(x). It has 0(i) space complexity and 0(i.f(i)(x)) time complexity, each of which is significantly better than the corresponding algorithm implemented directly from the recursive definition of the function.
A programmable one-dimensional discrete wavelet packet transform processor is presented. Compared with existing architectures, the proposed processor can carry out both wavelet transforms and wavelet packet transforms...
详细信息
A programmable one-dimensional discrete wavelet packet transform processor is presented. Compared with existing architectures, the proposed processor can carry out both wavelet transforms and wavelet packet transforms, and is suitable for high-tap filters and high decomposition levels. It is small, and is especially suitable for on-chip or single-chip implementation.
Church's Thesis states that the effectively computable functions are the same as the recursive functions. This paper outlines the characters of the thesis, with the aim of casting doubt on the formulation and accu...
详细信息
Church's Thesis states that the effectively computable functions are the same as the recursive functions. This paper outlines the characters of the thesis, with the aim of casting doubt on the formulation and accuracy of the thesis.
A novel architecture for a 2D 8 x 8 discrete cosine transform (DCT) is presented. The architecture uses a new algebraic integer encoding of a I D radix-8 DCT that allows the separable computation of a 2D 8 x 8 DCT wit...
详细信息
A novel architecture for a 2D 8 x 8 discrete cosine transform (DCT) is presented. The architecture uses a new algebraic integer encoding of a I D radix-8 DCT that allows the separable computation of a 2D 8 x 8 DCT without any intermediate number representation conversions. This is a considerable improvement on previously introduced algebraic integer encoding techniques. Using this encoding scheme, an entire 8 x 8 2D DCT-SQ (scalar quantisation) algorithm can be implemented with only 24 adders.
Presents algorithms for rendering the intersection curves of implicit surfaces using octree-based recursive space subdivision techniques. Influence of interval techniques used during the subdivision process in increas...
详细信息
Presents algorithms for rendering the intersection curves of implicit surfaces using octree-based recursive space subdivision techniques. Influence of interval techniques used during the subdivision process in increasing the algorithm's robustness; Equations of implicit surfaces; Curvature of implicit surfaces.
The paper presents recursive algorithms for state bounding, using ellipsoidal sets to describe the state uncertainties and to bound the process and observation noises. The algorithms optimize each stage of updating, a...
详细信息
The paper presents recursive algorithms for state bounding, using ellipsoidal sets to describe the state uncertainties and to bound the process and observation noises. The algorithms optimize each stage of updating, according to the minimum-volume and minimum-trace criteria. Simulations compare the performance of the bounding algorithms with that of a Kalman filter, and investigate the influence of noise distribution within the bounds.
Identification algorithms for non-stationary linear processes are reviewed. In control, signal processing and many other areas of applications, to track the time varying dynamics of a system is a fundamental problem. ...
详细信息
Identification algorithms for non-stationary linear processes are reviewed. In control, signal processing and many other areas of applications, to track the time varying dynamics of a system is a fundamental problem. The methods considered are the recursive least squares, the Kalman filter and the stochastic approaches. Special attention is paid to the study of how different design parameters affect these algorithms. Simulation examples are shown to demonstrate the character of the trade-off between the tracking ability and noise rejection. Also, the comparison provides considerable insight into the application of these methods to the on-line identification.
The 'degenerate' Bernoulli numbers beta(m)(lambda) can be defined by means of the exponential generating function x((1+lambda x)(1/lambda)-1)(-1). L. Carlitz proved an analogue of the Staudt-Clausen theorem fo...
详细信息
The 'degenerate' Bernoulli numbers beta(m)(lambda) can be defined by means of the exponential generating function x((1+lambda x)(1/lambda)-1)(-1). L. Carlitz proved an analogue of the Staudt-Clausen theorem for these numbers, and he showed that beta(m)(lambda) is a polynomial in lambda of degree less than or equal to m. In this paper we find explicit formulas for the coefficients of the polynomial beta(m)(lambda), and we give a new proof of the degenerate Staudt-Clausen theorem. New recursion formulas for beta(m)(lambda) are also proved.
Many tracking applications need to deal with the randomly sampled measurements, for which the traditional recursive estimation method may fail. Moreover, getting the accurate dynamic model of the target becomes more d...
详细信息
Many tracking applications need to deal with the randomly sampled measurements, for which the traditional recursive estimation method may fail. Moreover, getting the accurate dynamic model of the target becomes more difficult. Therefore, it is necessary to update the dynamic model with the real-time information of the tracking system. This paper provides a solution for the target tracking system with randomly sampling measurement. Here, the irregular sampling interval is transformed to a time-varying parameter by calculating the matrix exponential, and the dynamic parameter is estimated by the online estimated state with Yule-Walker method, which is called the closed-loop estimation. The convergence condition of the closed-loop estimation is proved. Simulations and experiments show that the closed-loop estimation method can obtain good estimation performance, even with very high irregular rate of sampling interval, and the developed model has a strong advantage for the long trajectory tracking comparing the other models.
暂无评论