308,984 research outputs found
Recommended from our members
Radial basis function classifier construction using particle swarm optimisation aided orthogonal forward regression
We develop a particle swarm optimisation (PSO)
aided orthogonal forward regression (OFR) approach for constructing radial basis function (RBF) classifiers with tunable nodes. At each stage of the OFR construction process, the centre vector and diagonal covariance matrix of one RBF node is determined efficiently by minimising the leave-one-out (LOO) misclassification rate (MR) using a PSO algorithm. Compared with the state-of-the-art regularisation assisted orthogonal least square algorithm based on the LOO MR for selecting fixednode RBF classifiers, the proposed PSO aided OFR algorithm for constructing tunable-node RBF classifiers offers significant advantages in terms of better generalisation performance and smaller model size as well as imposes lower computational complexity in classifier construction process. Moreover, the proposed algorithm does not have any hyperparameter that requires costly tuning based on cross validation
Recommended from our members
Sparse kernel density estimation technique based on zero-norm constraint
A sparse kernel density estimator is derived based on the zero-norm constraint, in which the zero-norm of the kernel weights is incorporated to enhance model sparsity. The classical Parzen window estimate is adopted as the desired response for density estimation, and an approximate function of the zero-norm is used for achieving mathemtical tractability and algorithmic efficiency. Under the mild condition of the positive definite design matrix, the kernel weights of the proposed density estimator based on the zero-norm approximation can be obtained using the multiplicative nonnegative quadratic programming algorithm. Using the -optimality based selection algorithm as the preprocessing to select a small significant subset design matrix, the proposed zero-norm based approach offers an effective means for constructing very sparse kernel density estimates with excellent generalisation performance
Inverter-Based Low-Voltage CCII- Design and Its Filter Application
This paper presents a negative type second-generation current conveyor (CCII-). It is based on an inverter-based low-voltage error amplifier, and a negative current mirror. The CCII- could be operated in a very low supply voltage such as ±0.5V. The proposed CCII- has wide input voltage range (±0.24V), wide output voltage (±0.24V) and wide output current range (±24mA). The proposed CCII- has no on-chip capacitors, so it can be designed with standard CMOS digital processes. Moreover, the architecture of the proposed circuit without cascoded MOSFET transistors is easily designed and suitable for low-voltage operation. The proposed CCII- has been fabricated in TSMC 0.18μm CMOS processes and it occupies 1189.91 x 1178.43μm2 (include PADs). It can also be validated by low voltage CCII filters
Three-dimensional elliptic grid generation technique with application to turbomachinery cascades
Described is a numerical method for generating 3-D grids for turbomachinery computational fluid dynamic codes. The basic method is general and involves the solution of a quasi-linear elliptic partial differential equation via pointwise relaxation with a local relaxation factor. It allows specification of the grid point distribution on the boundary surfaces, the grid spacing off the boundary surfaces, and the grid orthogonality at the boundary surfaces. A geometry preprocessor constructs the grid point distributions on the boundary surfaces for general turbomachinery cascades. Representative results are shown for a C-grid and an H-grid for a turbine rotor. Two appendices serve as user's manuals for the basic solver and the geometry preprocessor
Distance-two labelings of digraphs
For positive integers , an -labeling of a digraph is a
function from into the set of nonnegative integers such that
if is adjacent to in and if
is of distant two to in . Elements of the image of are called
labels. The -labeling problem is to determine the
-number of a digraph , which
is the minimum of the maximum label used in an -labeling of . This
paper studies - numbers of digraphs. In particular, we
determine - numbers of digraphs whose longest dipath is of
length at most 2, and -numbers of ditrees having dipaths
of length 4. We also give bounds for -numbers of bipartite
digraphs whose longest dipath is of length 3. Finally, we present a linear-time
algorithm for determining -numbers of ditrees whose
longest dipath is of length 3.Comment: 12 pages; presented in SIAM Coference on Discrete Mathematics, June
13-16, 2004, Loews Vanderbilt Plaza Hotel, Nashville, TN, US
Landauer-type transport theory for interacting quantum wires: Application to carbon nanotube Y junctions
We propose a Landauer-like theory for nonlinear transport in networks of
one-dimensional interacting quantum wires (Luttinger liquids). A concrete
example of current experimental focus is given by carbon nanotube Y junctions.
Our theory has three basic ingredients that allow to explicitly solve this
transport problem: (i) radiative boundary conditions to describe the coupling
to external leads, (ii) the Kirchhoff node rule describing charge conservation,
and (iii) density matching conditions at every node.Comment: final version, to be published in PR
- …