TIME-RESOLVED OPTICAL-EMISSION AND ELECTRON-ENERGY DISTRIBUTION FUNCTION MEASUREMENTS IN RF PLASMAS

Comparisons between experimentally measured time-dependent electron energy distribution functions and optical emission intensities are reported for low-frequency (100 and 400 kHz) radio-frequency driven discharges in argon. The electron energy distribution functions were measured with a time-resolved Langmuir probe system. Time-resolved optical emissions of argon resonance lines at 687.1 and 750.4 nm were determined by photon-counting methods. Known ground-state and metastable-state excitation cross sections were used along with the measured electron energy distribution functions to calculate the time dependence of the optical emission intensity. It was found that a calculation using only the ground-state cross sections gave the best agreement with the time dependence of the measured optical emission. Time-dependent electron density, electron temperature, and plasma potential measurements are also reported.

TIME-RESOLVED ELECTRON-ENERGY DISTRIBUTION FUNCTION MEASUREMENTS IN A PULSED MAGNETIC MULTIPOLE HYDROGEN DISCHARGE

The time evolution of measured plasma parameters, including the electron energy distribution function (EEDF), in the discharge and post-discharge regime of a pulsed hydrogen magnetic multipole plasma is presented. The time necessary for the plasma to reach equilibrium has been established as 160-mu-s. The present results clarify the mechanisms which initiate the discharge. The decay rates of the charged-particle density and energy in the post-discharge have been measured. These measurements indicate that particle transport to the wall is the dominant loss mechanism for both charged-particle density and energy. The time-resolved EEDF is found to be non-Maxwellian in the discharge and Maxwellian in the late post-discharge.

Application of radial basis function neural networks to a greenhouse inside air temperature model

The problem with the adequacy of radial basis function neural networks to model the inside air temperature as a function of the outside air temperature and solar radiation, and the inside relative humidity in an hydroponic greenhouse is addressed.

Comparing Support Vector Machines with Gaussian Kernels to Radial Basis Function Classifiers

The Support Vector (SV) machine is a novel type of learning machine, based on statistical learning theory, which contains polynomial classifiers, neural networks, and radial basis function (RBF) networks as special cases. In the RBF case, the SV algorithm automatically determines centers, weights and threshold such as to minimize an upper bound on the expected test error. The present study is devoted to an experimental comparison of these machines with a classical approach, where the centers are determined by $k$--means clustering and the weights are found using error backpropagation. We consider three machines, namely a classical RBF machine, an SV machine with Gaussian kernel, and a hybrid system with the centers determined by the SV method and the weights trained by error backpropagation. Our results show that on the US postal service database of handwritten digits, the SV machine achieves the highest test accuracy, followed by the hybrid approach. The SV approach is thus not only theoretically well--founded, but also superior in a practical application.

Fast calculation of the CAC convolution algorithm using the multinomial distribution function

The authors focus on one of the methods for connection acceptance control (CAC) in an ATM network: the convolution approach. With the aim of reducing the cost in terms of calculation and storage requirements, they propose the use of the multinomial distribution function. This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements. This in turn makes possible a simple deconvolution process. Moreover, under certain conditions additional improvements may be achieved

Fully complex-valued radial basis function networks for orthogonal least squares regression

We consider a fully complex-valued radial basis function (RBF) network for regression application. The locally regularised orthogonal least squares (LROLS) algorithm with the D-optimality experimental design, originally derived for constructing parsimonious real-valued RBF network models, is extended to the fully complex-valued RBF network. Like its real-valued counterpart, the proposed algorithm aims to achieve maximised model robustness and sparsity by combining two effective and complementary approaches. The LROLS algorithm alone is capable of producing a very parsimonious model with excellent generalisation performance while the D-optimality design criterion further enhances the model efficiency and robustness. By specifying an appropriate weighting for the D-optimality cost in the combined model selecting criterion, the entire model construction procedure becomes automatic. An example of identifying a complex-valued nonlinear channel is used to illustrate the regression application of the proposed fully complex-valued RBF network.

Grey-box radial basis function modelling: the art of incorporating prior knowledge

A basic principle in data modelling is to incorporate available a priori information regarding the underlying data generating mechanism into the modelling process. We adopt this principle and consider grey-box radial basis function (RBF) modelling capable of incorporating prior knowledge. Specifically, we show how to explicitly incorporate the two types of prior knowledge: the underlying data generating mechanism exhibits known symmetric property and the underlying process obeys a set of given boundary value constraints. The class of orthogonal least squares regression algorithms can readily be applied to construct parsimonious grey-box RBF models with enhanced generalisation capability.

A tunable radial basis function model for nonlinear system identification using particle swarm optimisation

A tunable radial basis function (RBF) network model is proposed for nonlinear system identification using particle swarm optimisation (PSO). At each stage of orthogonal forward regression (OFR) model construction, PSO optimises one RBF unit's centre vector and diagonal covariance matrix by minimising the leave-one-out (LOO) mean square error (MSE). This PSO aided OFR automatically determines how many tunable RBF nodes are sufficient for modelling. Compared with the-state-of-the-art local regularisation assisted orthogonal least squares algorithm based on the LOO MSE criterion for constructing fixed-node RBF network models, the PSO tuned RBF model construction produces more parsimonious RBF models with better generalisation performance and is computationally more efficient.