The Modeling of Ion Implantation in a Three-Layer Structure Using the Method of Dose Matching

The method of modeling ion implantation in a multilayer target using moments of a statistical distribution and numerical integration for dose calculation in each target layer is applied to the modelling of As⁺ in poly-Si/SiO2/Si. Good agreement with experiment is obtained. Copyright © 1985 by The Institute of Electrical and Electronics Engineers, Inc.

Robust pairwise matching of interest points with complex wavelets

We present a matching framework to find robust correspondences between image features by considering the spatial information between them. To achieve this, we define spatial constraints on the relative orientation and change in scale between pairs of features. A pairwise similarity score, which measures the similarity of features based on these spatial constraints, is considered. The pairwise similarity scores for all pairs of candidate correspondences are then accumulated in a 2-D similarity space. Robust correspondences can be found by searching for clusters in the similarity space, since actual correspondences are expected to form clusters that satisfy similar spatial constraints in this space. As it is difficult to achieve reliable and consistent estimates of scale and orientation, an additional contribution is that these parameters do not need to be determined at the interest point detection stage, which differs from conventional methods. Polar matching of dual-tree complex wavelet transform features is used, since it fits naturally into the framework with the defined spatial constraints. Our tests show that the proposed framework is capable of producing robust correspondences with higher correspondence ratios and reasonable computational efficiency, compared to other well-known algorithms. © 1992-2012 IEEE.

Large scale heterogeneous networks, the Davis-Wielandt shell, and graph separation

We consider a large scale network of interconnected heterogeneous dynamical components. Scalable stability conditions are derived that involve the input/output properties of individual subsystems and the interconnection matrix. The analysis is based on the Davis-Wielandt shell, a higher dimensional version of the numerical range with important convexity properties. This can be used to allow heterogeneity in the agent dynamics while relaxing normality and symmetry assumptions on the interconnection matrix. The results include small gain and passivity approaches as special cases, with the three dimensional shell shown to be inherently connected with corresponding graph separation arguments. © 2012 Society for Industrial and Applied Mathematics.

Distribution matching for transduction

Many transductive inference algorithms assume that distributions over training and test estimates should be related, e.g. by providing a large margin of separation on both sets. We use this idea to design a transduction algorithm which can be used without modification for classification, regression, and structured estimation. At its heart we exploit the fact that for a good learner the distributions over the outputs on training and test sets should match. This is a classical two-sample problem which can be solved efficiently in its most general form by using distance measures in Hilbert Space. It turns out that a number of existing heuristics can be viewed as special cases of our approach.

Matching an oscillator model to a phase response curve

The Phase Response Curve (PRC) has proven a useful tool for the reduction of complex oscillator models. It is also an information often experimentally available to the biologist. This paper introduces a numerical tool based on the sensitivity analysis of the PRC to adapt initial model parameters in order to match a particular PRC shape. We illustrate the approach on a simple biochemical model of circadian oscillator. © 2011 IEEE.

Probability-Matching Predictors for Extreme Extremes

A location- and scale-invariant predictor is constructed which exhibits good probability matching for extreme predictions outside the span of data drawn from a variety of (stationary) general distributions. It is constructed via the three-parameter {\mu, \sigma, \xi} Generalized Pareto Distribution (GPD). The predictor is designed to provide matching probability exactly for the GPD in both the extreme heavy-tailed limit and the extreme bounded-tail limit, whilst giving a good approximation to probability matching at all intermediate values of the tail parameter \xi. The predictor is valid even for small sample sizes N, even as small as N = 3. The main purpose of this paper is to present the somewhat lengthy derivations which draw heavily on the theory of hypergeometric functions, particularly the Lauricella functions. Whilst the construction is inspired by the Bayesian approach to the prediction problem, it considers the case of vague prior information about both parameters and model, and all derivations are undertaken using sampling theory.

Output feedback H2 model matching for decentralized systems with delays

This paper gives a new solution to the output feedback H2 model matching problem for a large class of delayed information sharing patterns. Existing methods for similar problems typically reduce the decentralized problem to a centralized problem of higher state dimension. In contrast, this paper demonstrates that the decentralized model matching solution can be constructed from the original centralized solution via quadratic programming. © 2013 AACC American Automatic Control Council.

Model-based compressive Harmonic-Aware Matching Pursuit: An evaluation

This paper addresses devising a reliable model-based Harmonic-Aware Matching Pursuit (HAMP) for reconstructing sparse harmonic signals from their compressed samples. The performance guarantees of HAMP are provided; they illustrate that the introduced HAMP requires less data measurements and has lower computational cost compared with other greedy techniques. The complexity of formulating a structured sparse approximation algorithm is highlighted and the inapplicability of the conventional thresholding operator to the harmonic signal model is demonstrated. The harmonic sequential deletion algorithm is subsequently proposed and other sparse approximation methods are evaluated. The superior performance of HAMP is depicted in the presented experiments. © 2013 IEEE.