L/sup p/ approximation of Sigma-Pi neural networks

A feedforward Sigma-Pi neural network with a single hidden layer of m neurons is given by /sup m//spl Sigma//sub j=1/c/sub j/g(n/spl Pi//sub k=1/x/sub k/-/spl theta//sub k//sup j///spl lambda//sub k//sup j/) where c/sub j/, /spl theta//sub k//sup j/, /spl lambda//sub k//spl isin/R. We investigate the approximation of arbitrary functions f: R/sup n//spl rarr/R by a Sigma-Pi neural network in the L/sup p/ norm. An L/sup p/ locally integrable function g(t) can approximate any given function, if and only if g(t) can not be written in the form /spl Sigma//sub j=1//sup n//spl Sigma//sub k=0//sup m//spl alpha//sub jk/(ln|t|)/sup j-1/t/sub k/.     

Adaptive optimization of least-squares tracking algorithms: with applications to adaptive antenna arrays for randomly time-varying mobile communications systems

Adaptive antenna arrays are used for reducing the effects of interference and increasing capacity in mobile communications systems. Typical algorithms recursively compute the antenna weights that minimize the weighted error function (at discrete times kh, k=1,2,..., for a sampling interval h) /spl sigma//sub l=1//sup k//spl alpha//sup k-l/[e/sub l/(W)]/sup 2/, where e/sub l/(W) is a measure of the reception error at time lh with antenna weight vector W, and /spl alpha/<1. The forgetting factor /spl alpha/<1 allows tracking as conditions change and the minimization is used only to get the weights. The average detection error rate depends heavily on the chosen value of /spl alpha/, whose optimal value can change rapidly in time, perhaps significantly in seconds. We add another adaptive loop that tracks the optimal value of /spl alpha/ and greatly improves the operation when the environment is randomly time-varying. The additional adaptive loop is based on an approximation to a natural "gradient descent" method. The algorithm is practical and can improve the performance considerably. In terms of average detection error rates and for all of the scenarios tested, the new system tracks the optimal value of /spl alpha/ well, and always performs better (sometimes much better) than the original algorithm that uses any fixed value of /spl alpha/. Although the initial motivation arises in adaptive antennas, the method can be used to improve algorithms for tracking parameters of time-varying nonlinear systems, where similar issues are involved.     

A note on deciding controllability in pushdown systems

Consider an event alphabet /spl Sigma/. The supervisory control theory of Ramadge and Wonham asks the question, given a plant model G, with language K L/sub M/(G)/spl sube//spl Sigma//sup */ and another language K/spl sube/ L/sub M/(G), is there a supervisor /spl psi/ such that L/sub M/(/spl psi//G)=K. Ramadge and Wonham showed that a necessary condition for this to be true is the so-called controllability of K with respect to L/sub M/(G). They showed that when G is a finite state automaton and K is a regular language (also generated by a finite state automaton), then the controllability property was decidable for K. The class of languages generated by pushdown automata properly includes the regular languages. They are accepted by finite state machines coupled with pushdown stack memory. This makes them interesting candidates as supervisory languages, since the supervisor will have nonfinite memory. In this note, we show the following: i) If S is a specification given by a deterministic pushdown automaton and L is generated by a finite state machine, then there is an algorithm to decide whether K=S/spl cap/L is controllable with respect to L. ii) It is undecidable for an arbitrary specification S generated by a nondeterministic pushdown automaton and plant language L generated by a finite state machine whether K=S/spl cap/L is controllable with respect to L.     

Quasi-continuous high-order sliding-mode controllers

A universal finite-time-convergent controller is developed capable to control the output of any uncertain single-input-single-output system with a known permanent relative degree r. The tracking error /spl sigma/ is steered to zero by means of a control dependent only on /spl sigma/, /spl sigma//spl dot/, ..., /spl sigma//sup (r-1)/ and continuous everywhere except the set /spl sigma/=/spl sigma//spl dot/=/spl middot//spl middot//spl middot/=/spl sigma//sup (r-1)/=0. A robust output-feedback controller version provides for the tracking accuracy proportional to the sampling noise magnitude.     

Learning capability and storage capacity of two-hidden-layer feedforward networks

The problem of the necessary complexity of neural networks is of interest in applications. In this paper, learning capability and storage capacity of feedforward neural networks are considered. We markedly improve the recent results by introducing neural-network modularity logically. This paper rigorously proves in a constructive method that two-hidden-layer feedforward networks (TLFNs) with 2/spl radic/(m+2)N (/spl Lt/N) hidden neurons can learn any N distinct samples (x/sub i/, t/sub i/) with any arbitrarily small error, where m is the required number of output neurons. It implies that the required number of hidden neurons needed in feedforward networks can be decreased significantly, comparing with previous results. Conversely, a TLFN with Q hidden neurons can store at least Q/sup 2//4(m+2) any distinct data (x/sub i/, t/sub i/) with any desired precision.     

Output regulation of periodic signals for DPS: an infinite-dimensional signal Generator

In this note, we consider output regulation and disturbance rejection of periodic signals via state feedback in the setting of exponentially stabilizable linear infinite-dimensional systems. We show that if an infinite-dimensional exogenous system is generating periodic reference signals, solvability of the state feedback regulation problem is equivalent to solvability of the so called equations. This result allows us to consider asymptotic tracking of periodic reference signals which only have absolutely summable Fourier coefficients, while in related existing work the reference signals are confined to be infinitely smooth. We also discuss solution of the regulator equations and construct the actual feedback law to achieve output regulation in the single-input-single-output (SISO) case: The output regulation problem is solvable if the transfer function of the stabilized plant does not have zeros at the frequencies i/spl omega//sub n/ of the periodic reference signals and if the sequence ([CR(i/spl omega//sub n/, A+BK)B]/sup -1/ /spl times/(Q/spl phi//sub n/-CR(i/spl omega//sub n/, A+BK)P/spl phi//sub n/)) /sub n/spl isin/z//spl isin/l/sup n2/. A one-dimensional heat equation is used as an illustrative example.     

Remarks on the L/sup p/-input converging-state property

Let X /spl sub/ /spl Ropf//sup N/ and consider a system x/spl dot/ = f(x,u), f : X /spl times/ /spl Ropf//sup M/ /spl rarr/ /spl Ropf//sup N/, with the property that the associated autonomous system x/spl dot/ = f (x,0) has an asymptotically stable compactum C with region of attraction A. Assume that x is a solution of the former, defined on [0,/spl infin/), corresponding to an input function u. Assume further that, for each compact K /spl sub/ X, there exists k > 0 such that |f(z,v) - f(z,0)| /spl les/ k|v| for all (z,v) /spl isin/ /spl times/ /spl Ropf//sup M/. A simple proof is given of the following L/sup p/-input converging-state property: if u /spl isin/ L/sup p/ for some p /spl isin/ [1,/spl infin/) and x has an /spl omega/-limit point in A, then x approaches C.     

Computation of the frequency response of multilinear affine systems

Deals with the problem of computing the frequency response of an uncertain transfer function whose numerator and denominator polynomials are multiples of independent uncertain polynomials of the form P(s, q) = l/sub o/ (q) + l/sub 1/ (q) s + /spl middot//spl middot//spl middot/ + l/sub n/, (q) s/sup n/ whose coefficients depend linearly on q = [q/sub 1/, q/sub 2/, ..., q/sub q/]/sup T/ and the uncertainty box is Q = {q: q/sub i/ /spl epsiv/ [q/sub i/, q/sub i/], i = 1, 2,..., q}. Using the geometric structure of the value set of P(s, q), a powerful edge elimination procedure is proposed for computing the Bode, Nyquist, and Nichols envelopes of these uncertain systems. A numerical example is included to illustrate the benefit of the method presented.     

On nonlinear controllability of homogeneous systems linear in control

This paper considers small-time local controllability (STLC) of single- and multiple-input systems, x/spl dot/=f/sub 0/(x)+/spl Sigma//sub i=1//sup m/f/sub i/u/sub i/ where f/sub 0/(x) contains homogeneous polynomials and f/sub 1/,...,f/sub m/ are constant vector fields. For single-input systems, it is shown that even-degree homogeneity precludes STLC if the state dimension is larger than one. This, along with the obvious result that for odd-degree homogeneous systems STLC is equivalent to accessibility, provides a complete characterization of STLC for this class of systems. In the multiple-input case, transformations on the input space are applied to homogeneous systems of degree two, an example of this type of system being motion of a rigid-body in a plane. Such input transformations are related via consideration of a tensor on the tangent space to congruence transformation of a matrix to one with zeros on the diagonal. Conditions are given for successful neutralization of bad type (1,2) brackets via congruence transformations.     

A min-max approach to fuzzy clustering, estimation, and identification

This study, for any unknown physical process y=f(x/sub 1/,...,x/sub n/), is concerned with the: 1) fuzzy partition of n-dimensional input space X=X/sub 1//spl times//spl middot//spl middot//spl middot//spl times/X/sub n/ into K different clusters, 2) estimating the process behavior y/spl circ/=f(x/spl circ/) for a given input x/spl circ/=(x/spl circ//sub 1/,/spl middot//spl middot//spl middot/,x/spl circ//sub n/)/spl isin/X, and 3) fuzzy approximation of the process, with uncertain input-output identification data {(x(k)/spl plusmn//spl delta/x/sub k/),(y(k)/spl plusmn/v/sub k/)}/sub k=1,.../, using a Sugeno type fuzzy inference system. A unified min-max approach (that attempts to minimize the worst-case effect of data uncertainties and modeling errors on estimation performance), is suggested to provide robustness against data uncertainties and modeling errors. The proposed method of min-max fuzzy parameters estimation does not make any assumption and does not require a priori knowledge of upper bounds, statistics, and distribution of data uncertainties and modeling errors. To show the feasibility of the approach, simulation studies and a real-world application of physical fitness classification based on the fuzzy interpretation of physiological parameters, have been provided.     

A necessary algebraic condition for controllability and observability of linear time-varying systems

In this note, we give an algebraic condition which is necessary for the system x'(t)=A(t)x(t)+B(t)u(t), y(t)=C(t)x(t), either to be totally controllable or to be totally observable, where x/spl isin//spl Ropf//sup d/, u/spl isin//spl Ropf//sup p/, y/spl isin//spl Ropf//sup q/, and the matrix functions A, B and C are (d-2), (d-1) and (d-1) times continuously differentiable, respectively. All conditions presented here are in terms of known quantities and therefore easily verified. Our conditions can be used to rule out large classes of time-varying systems which cannot be controlled and/or observed no matter what the nonzero time-varying coefficients are. This work is motivated by the deep result of Silverman and Meadows.     

A residue number system on reconfigurable mesh with applications to prefix sums and approximate string matching

Several new number representations based on a residue number system are presented which use the smallest prime numbers as moduli and are suited for parallel computations on a reconfigurable mesh architecture. The bit model of linear reconfigurable mesh with exclusive write and unit-time delay for broadcasting on a subbus is assumed. It is shown how to convert in O(1) time any integer, ranging between 0 and n-1, from any commonly used representation to any new representation proposed in this paper (and vice versa) using an n/spl times/O(log/sup 2/ n/log log n) reconfigurable mesh. In particular, some of the previously known conversion techniques are improved. Moreover, as a byproduct, it is shown how to compute in O(1) time the Prefix Sums of n bits by a reconfigurable mesh having the above mentioned size, thus improving previously known results. Applications to the Prefix Sums of n h-bit integers and to Approximate String Matching with /spl alpha/ mismatches are also considered. The Summation and the Prefix Sums can be computed in O(1) time using O(h log N+log/sup 2/ N/log log N)/spl times/Nh and O(h/sup 2/+log/sup 2/ N/log(h+log N))/spl times/O(N(h+log N)) reconfigurable meshes, respectively. Moreover, it is shown for the first time how to find in O(1) time all the occurrences of a pattern of length m in a text of length n, allowing less than /spl alpha/ mismatches, using a reconfigurable mesh of size O(m log|/spl Sigma/|)/spl times/O (n(log|/spl Sigma/|+log/sup 2/ /spl alpha//log log /spl alpha/)), where the pattern and the text are strings over a finite alphabet /spl Sigma/ and /spl alpha/相似文献   

An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model

We develop a parallel algorithm for the 2D Euclidean distance transform (2D/spl I.bar/EDT, for short) of a binary image of size N /spl times/ N in O(1) time using N/sup 2+/spl delta/+/spl epsi// CRCW processors and a parallel algorithm for the 3D Euclidean distance transform (3D/spl I.bar/EDT, for short) of a binary image of size N /spl times/ N /spl times/ N in O(1) time using N/sup 3+/spl delta/+/spl epsi// CRCW processors, where /spl delta/=1/, /spl epsi/=1/(2/sup c+1/-1), h, and are constants and positive integers. Our 2D/spl I.bar/EDT (3D/spl I.bar/EDT) parallel algorithm can be used to build up Voronoi diagram and Voronoi polygons (polyhedra) in a 2D (3D) binary image also. All of these parallel algorithms can be performed in O(1) time using N/sup 2+/spl delta/+/spl epsi// (N/sup 3+/spl delta/+/spl epsi//) CRCW processors. To the best of our knowledge, all results derived above are the best O(1) time algorithms known.     

An exact stability analysis test for single-parameter polynomially-dependent linear systems

We provide a new condition for testing the stability of a single-parameter, polynomially-dependent linear system of polynomial degree N of the form x/spl dot/=A(/spl rho/)x, A(/spl rho/)=/spl Sigma//sub i=0//sup N//spl rho//sup i/ A/sub i/ (1) over a compact interval. The test is nonconservative and can be cast as a convex feasibility problem in terms of a pair of linear matrix inequalities (LMIs).     

When does the H/sup /spl infin// fixed-lag smoothing performance saturate for a finite smoothing lag?

A notable difference between the H/sup 2/ and H/sup /spl infin// smoothing is that the achievable performance in the latter problem might "saturate" as the function of the smoothing lag in the sense that there might exist a finite smoothing lag for which the achievable performance level is the same as for the infinite smoothing lag. In this note, necessary and sufficient conditions under which such a saturation occurs are derived. In particular, it is shown that the H/sup /spl infin// performance saturates only if the H/sup /spl infin// norm of the optimal error system is achieved at the infinite frequency, i.e., if the worst case disturbance for the infinite smoothing lag case can be arbitrarily fast and thus in a sense unpredictable.     

Stabilization of singularly perturbed fuzzy systems

This paper presents some novel results for stabilizing singularly perturbed (SP) nonlinear systems with guaranteed control performance. By using Takagi-Sugeno fuzzy model, we construct the SP fuzzy (SPF) systems. The corresponding fuzzy slow and fast subsystems of the original SPF system are also obtained. Two fuzzy control designs are explored. In the first design method, we propose the composite fuzzy control to stabilize the SPF subsystem with H/sup /spl infin// control performance. Based on the Lyapunov stability theorem, the stability conditions are reduced to the linear matrix inequality (LMI) problem. The composite fuzzy control will stabilize the original SP nonlinear systems for all /spl epsiv//spl isin/(0,/spl epsiv//sup */) and the upper bound /spl epsiv//sup */ can be determined. For the second design method, we present a direct fuzzy control scheme to stabilize the SP nonlinear system with H/sup /spl infin// control performance. By utilizing the Lyapunov stability theorem, the direct fuzzy control can guarantee the stability of the original SP nonlinear systems for a given interval /spl epsiv//spl isin/[/spl epsiv/_,/spl epsiv/~]. The stability conditions are also expressed in the LMIs. Two SP nonlinear systems are adopted to demonstrate the feasibility and effectiveness of the proposed control schemes.     

Sparse component analysis and blind source separation of underdetermined mixtures

In this letter, we solve the problem of identifying matrices S /spl isin/ /spl Ropf//sup n/spl times/N/ and A /spl isin/ /spl Ropf//sup m/spl times/n/ knowing only their multiplication X = AS, under some conditions, expressed either in terms of A and sparsity of S (identifiability conditions), or in terms of X (sparse component analysis (SCA) conditions). We present algorithms for such identification and illustrate them by examples.     

Microsieve supporting palladium-silver alloy membrane and application to hydrogen separation

A submicron thick and defect-free palladium-silver (Pd-Ag) alloy membrane is fabricated on a supporting microsieve by using microfabrication techniques. The microfabrication process also creates a robust wafer-scale membrane module, which can easily be inserted into a membrane holder to have gas-tight connections to the outer world. The microfabricated membrane demonstrated high separation fluxes of up to 4 mol H/sub 2//m/sup 2//spl middot/s with a minimal selectivity of 1500 for hydrogen over helium (H/sub 2//He) at 450/spl deg/C and 83 kPa H/sub 2/ retentate pressure. The present membrane has great potential for hydrogen purification and in applications like dehydrogenation chemistry. In addition, the presented technology can be used to fabricate other kinds of ultrathin but strong and defect-free membranes to set up new applications.     

Should model-based inverse inputs be used as feedforward under plant uncertainty?

Bounds on the size of the plant uncertainties are found such that the use of the inversion-based feedforward input improves the output-tracking performance when compared to the use of feedback alone. The output-tracking error is normalized by the size of the desired output and used as a measure of the output tracking performance. The worst-case performance is compared for two cases: (1) with the use of feedback alone and (2) with the addition of the feedforward input. It is shown that inversion-based feedforward controllers can lead to performance improvements at frequencies w where the uncertainty /spl Delta/ (jw) in the nominal plant is smaller than the size of the nominal plant G/sub 0/(jw) divided by its condition number K/sub G0/ (jw), i.e., /spl par//spl Delta/(jw)/spl par//sub 2/ < /spl par/G/sub 0/(jw) /spl par//sub 2//k/sub G0/ (jw). A modified feedforward input is proposed that only uses the model information in frequency regions where plant uncertainty is sufficiently small. The use of this modified inverse with (any) feedback results in improvement of the output tracking performance, when compared to the use of the feedback alone.     

A new methodology to investigate fracture toughness of freestanding MEMS and advanced materials in thin film form

This work presents a novel membrane deflection fracture experiment (MDFE) to investigate the fracture toughness of microelectromechanical systems (MEMS) and other advanced materials in thin film form. It involves the stretching of freestanding thin-film membranes, in a fixed-fixed configuration, containing preexisting cracks. The fracture behavior of ultrananocrystalline diamond (UNCD), a material developed at Argonne National Laboratory, is investigated to illustrate the methodology. When the fracture initiates from sharp cracks, produced by indentation, the fracture toughness was found to be 4.5/spl plusmn/0.25 MP m/sup 1/2/. When the fracture initiates from blunt notches with radii about 100 nm, machined by focused ion beam (FIB), the mean value of the apparent fracture toughness was found to be 6.9 MPa m/sup 1/2/. Comparison of these two values, using the model proposed by Drory et al., provides a correction factor of two-thirds, which corresponds to a mean value of /spl rho//2x=1/2.