Spatial neighborhood matrix computation: Inverse distance weighted versus binary contiguity

Paper presented at Geo-Spatial Crossroad GI_Forum, Salzburg, Austria.

Testing Spatial Autocorrelation in Weighted Networks : the Modes Permutation Test

In a weighted spatial network, as specified by an exchange matrix, the variances of the spatial values are inversely proportional to the size of the regions. Spatial values are no more exchangeable under independence, thus weakening the rationale for ordinary permutation and bootstrap tests of spatial autocorrelation. We propose an alternative permutation test for spatial autocorrelation, based upon exchangeable spatial modes, constructed as linear orthogonal combinations of spatial values. The coefficients obtain as eigenvectors of the standardised exchange matrix appearing in spectral clustering, and generalise to the weighted case the concept of spatial filtering for connectivity matrices. Also, two proposals aimed at transforming an acessibility matrix into a exchange matrix with with a priori fixed margins are presented. Two examples (inter-regional migratory flows and binary adjacency networks) illustrate the formalism, rooted in the theory of spectral decomposition for reversible Markov chains.

Testing Spatial Autocorrelation in Weighted Networks : the Modes Permutation Test

In a weighted spatial network, as specified by an exchange matrix, the variances of the spatial values are inversely proportional to the size of the regions. Spatial values are no more exchangeable under independence, thus weakening the rationale for ordinary permutation and bootstrap tests of spatial autocorrelation. We propose an alternative permutation test for spatial autocorrelation, based upon exchangeable spatial modes, constructed as linear orthogonal combinations of spatial values. The coefficients obtain as eigenvectors of the standardised exchange matrix appearing in spectral clustering, and generalise to the weighted case the concept of spatial filtering for connectivity matrices. Also, two proposals aimed at transforming an acessibility matrix into a exchange matrix with with a priori fixed margins are presented. Two examples (inter-regional migratory flows and binary adjacency networks) illustrate the formalism, rooted in the theory of spectral decomposition for reversible Markov chains.

A note on the Fredholm properties of Toeplitz operators on weighted Bergman spaces with matrix-valued symbols

We characterize the essential spectra of Toeplitz operators Ta on weighted Bergman spaces with matrix-valued symbols; in particular we deal with two classes of symbols, the Douglas algebra C+H∞ and the Zhu class Q := L∞ ∩VMO∂ . In addition, for symbols in C+H∞ , we derive a formula for the index of Ta in terms of its symbol a in the scalar-valued case, while in the matrix-valued case we indicate that the standard reduction to the scalar-valued case fails to work analogously to the Hardy space case. Mathematics subject classification (2010): 47B35,

Diffusion-weighted imaging for the follow-up of patients after matrix-associated autologous chondrocyte transplantation

To evaluate the use of diffusion-weighted imaging (DWI) for the assessment of cartilage maturation in patients after matrix-associated autologous chondrocyte transplantation (MACT).

Multimodal approach in the use of clinical scoring, morphological MRI and biochemical T2-mapping and diffusion-weighted imaging in their ability to assess differences between cartilage repair tissue after microfracture therapy and matrix-associated autologous chondrocyte transplantation: a pilot study

OBJECTIVE: The aim of the present pilot study is to show initial results of a multimodal approach using clinical scoring, morphological magnetic resonance imaging (MRI) and biochemical T2-relaxation and diffusion-weighted imaging (DWI) in their ability to assess differences between cartilage repair tissue after microfracture therapy (MFX) and matrix-associated autologous chondrocyte transplantation (MACT). METHOD: Twenty patients were cross-sectionally evaluated at different post-operative intervals from 12 to 63 months after MFX and 12-59 months after MACT. The two groups were matched by age (MFX: 36.0+/-10.4 years; MACT: 35.1+/-7.7 years) and post-operative interval (MFX: 32.6+/-16.7 months; MACT: 31.7+/-18.3 months). After clinical evaluation using the Lysholm score, 3T-MRI was performed obtaining the MR observation of cartilage repair tissue (MOCART) score as well as T2-mapping and DWI for multi-parametric MRI. Quantitative T2-relaxation was achieved using a multi-echo spin-echo sequence; semi-quantitative diffusion-quotient (signal intensity without diffusion-weighting divided by signal intensity with diffusion weighting) was prepared by a partially balanced, steady-state gradient-echo pulse sequence. RESULTS: No differences in Lysholm (P=0.420) or MOCART (P=0.209) score were observed between MFX and MACT. T2-mapping showed lower T2 values after MFX compared to MACT (P=0.039). DWI distinguished between healthy cartilage and cartilage repair tissue in both procedures (MFX: P=0.001; MACT: P=0.007). Correlations were found between the Lysholm and the MOCART score (Pearson: 0.484; P=0.031), between the Lysholm score and DWI (Pearson:-0.557; P=0.011) and a trend between the Lysholm score and T2 (Person: 0.304; P=0.193). CONCLUSION: Using T2-mapping and DWI, additional information could be gained compared to clinical scoring or morphological MRI. In combination clinical, MR-morphological and MR-biochemical parameters can be seen as a promising multimodal tool in the follow-up of cartilage repair.

An Array Recursive Least-Squares Algorithm With Generic Nonfading Regularization Matrix

We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices with generic structure. Simulations in finite precision show the algorithm`s superiority as compared to alternative algorithms in the context of adaptive beamforming.

Predictive Optimal Matrix Converter Control for a Dynamic Voltage Restorer with Flywheel Energy Storage

This paper presents a predictive optimal matrix converter controller for a flywheel energy storage system used as Dynamic Voltage Restorer (DVR). The flywheel energy storage device is based on a steel seamless tube mounted as a vertical axis flywheel to store kinetic energy. The motor/generator is a Permanent Magnet Synchronous Machine driven by the AC-AC Matrix Converter. The matrix control method uses a discrete-time model of the converter system to predict the expected values of the input and output currents for all the 27 possible vectors generated by the matrix converter. An optimal controller minimizes control errors using a weighted cost functional. The flywheel and control process was tested as a DVR to mitigate voltage sags and swells. Simulation results show that the DVR is able to compensate the critical load voltage without delays, voltage undershoots or overshoots, overcoming the input/output coupling of matrix converters.

Definition of MV Load Diagrams via Weighted Evidence Accumulation Clustering using Subsampling

A definition of medium voltage (MV) load diagrams was made, based on the data base knowledge discovery process. Clustering techniques were used as support for the agents of the electric power retail markets to obtain specific knowledge of their customers’ consumption habits. Each customer class resulting from the clustering operation is represented by its load diagram. The Two-step clustering algorithm and the WEACS approach based on evidence accumulation (EAC) were applied to an electricity consumption data from a utility client’s database in order to form the customer’s classes and to find a set of representative consumption patterns. The WEACS approach is a clustering ensemble combination approach that uses subsampling and that weights differently the partitions in the co-association matrix. As a complementary step to the WEACS approach, all the final data partitions produced by the different variations of the method are combined and the Ward Link algorithm is used to obtain the final data partition. Experiment results showed that WEACS approach led to better accuracy than many other clustering approaches. In this paper the WEACS approach separates better the customer’s population than Two-step clustering algorithm.

Determination of electricity consumers’ load profiles via weighted evidence accumulation clustering using subsampling

With the electricity market liberalization, the distribution and retail companies are looking for better market strategies based on adequate information upon the consumption patterns of its electricity consumers. A fair insight on the consumers’ behavior will permit the definition of specific contract aspects based on the different consumption patterns. In order to form the different consumers’ classes, and find a set of representative consumption patterns we use electricity consumption data from a utility client’s database and two approaches: Two-step clustering algorithm and the WEACS approach based on evidence accumulation (EAC) for combining partitions in a clustering ensemble. While EAC uses a voting mechanism to produce a co-association matrix based on the pairwise associations obtained from N partitions and where each partition has equal weight in the combination process, the WEACS approach uses subsampling and weights differently the partitions. As a complementary step to the WEACS approach, we combine the partitions obtained in the WEACS approach with the ALL clustering ensemble construction method and we use the Ward Link algorithm to obtain the final data partition. The characterization of the obtained consumers’ clusters was performed using the C5.0 classification algorithm. Experiment results showed that the WEACS approach leads to better results than many other clustering approaches.

Quantification of endocrine disruptors and pesticides in water by gas chromatography–tandem mass spectrometry. Method validation using weighted linear regression schemes

Amulti-residue methodology based on a solid phase extraction followed by gas chromatography–tandem mass spectrometry was developed for trace analysis of 32 compounds in water matrices, including estrogens and several pesticides from different chemical families, some of them with endocrine disrupting properties. Matrix standard calibration solutions were prepared by adding known amounts of the analytes to a residue-free sample to compensate matrix-induced chromatographic response enhancement observed for certain pesticides. Validation was done mainly according to the International Conference on Harmonisation recommendations, as well as some European and American validation guidelines with specifications for pesticides analysis and/or GC–MS methodology. As the assumption of homoscedasticity was not met for analytical data, weighted least squares linear regression procedure was applied as a simple and effective way to counteract the greater influence of the greater concentrations on the fitted regression line, improving accuracy at the lower end of the calibration curve. The method was considered validated for 31 compounds after consistent evaluation of the key analytical parameters: specificity, linearity, limit of detection and quantification, range, precision, accuracy, extraction efficiency, stability and robustness.

Development of a retrospective job exposure matrix for PCB-exposed workers in capacitor manufacturing

Objectives: Polychlorinated biphenyls (PCBs) are considered probable human carcinogens by the International Agency for Research on Cancer and one congener, PCB126, has been rated as a known human carcinogen. A period-specific job exposure matrix (JEM) was developed for former PCB-exposed capacitor manufacturing workers (n=12,605) (1938-1977). Methods: A detailed exposure assessment for this plant was based on a number of exposure determinants (proximity, degree of contact with PCBs, temperature, ventilation, process control, job mobility). The intensity and frequency of PCB exposures by job for both inhalation and dermal exposures, and additional chemical exposures were reviewed. The JEM was developed in nine steps: (1) all unique jobs (n=1,684) were assessed using (2) defined PCB exposure determinants; (3) the exposure determinants were used to develop exposure profiles; (4) similar exposure profiles were combined into categories having similar PCB exposures; (5) qualitative intensity (high-medium-low-baseline) and frequency (continuous-intermittent) ratings were developed, and (6) used to qualitatively rate inhalation and dermal exposure separately for each category; (7) quantitative intensity ratings based on available air concentrations were developed for inhalation and dermal exposures based on equal importance of both routes of exposure; (8) adjustments were made for overall exposure, and (9) for each category the product of intensity and frequency was calculated, and exposure in the earlier era was weighted. Results: A period-specific JEM modified for two eras of stable PCB exposure conditions. Conclusions: These exposure estimates, derived from a systematic and rigorous use of the exposure determinant data, lead to cumulative PCB exposure-response relationships in the epidemiological cancer mortality and incidence studies of this cohort. [Authors]

Improved estimation of the covariance matrix of stock returns with an application to portofolio selection

This paper proposes to estimate the covariance matrix of stock returnsby an optimally weighted average of two existing estimators: the samplecovariance matrix and single-index covariance matrix. This method isgenerally known as shrinkage, and it is standard in decision theory andin empirical Bayesian statistics. Our shrinkage estimator can be seenas a way to account for extra-market covariance without having to specifyan arbitrary multi-factor structure. For NYSE and AMEX stock returns from1972 to 1995, it can be used to select portfolios with significantly lowerout-of-sample variance than a set of existing estimators, includingmulti-factor models.

Weighted metric multidimensional scaling

This paper establishes a general framework for metric scaling of any distance measure between individuals based on a rectangular individuals-by-variables data matrix. The method allows visualization of both individuals and variables as well as preserving all the good properties of principal axis methods such as principal components and correspondence analysis, based on the singular-value decomposition, including the decomposition of variance into components along principal axes which provide the numerical diagnostics known as contributions. The idea is inspired from the chi-square distance in correspondence analysis which weights each coordinate by an amount calculated from the margins of the data table. In weighted metric multidimensional scaling (WMDS) we allow these weights to be unknown parameters which are estimated from the data to maximize the fit to the original distances. Once this extra weight-estimation step is accomplished, the procedure follows the classical path in decomposing a matrix and displaying its rows and columns in biplots.

Weighted Euclidean biplots

We construct a weighted Euclidean distance that approximates any distance or dissimilarity measure between individuals that is based on a rectangular cases-by-variables data matrix. In contrast to regular multidimensional scaling methods for dissimilarity data, the method leads to biplots of individuals and variables while preserving all the good properties of dimension-reduction methods that are based on the singular-value decomposition. The main benefits are the decomposition of variance into components along principal axes, which provide the numerical diagnostics known as contributions, and the estimation of nonnegative weights for each variable. The idea is inspired by the distance functions used in correspondence analysis and in principal component analysis of standardized data, where the normalizations inherent in the distances can be considered as differential weighting of the variables. In weighted Euclidean biplots we allow these weights to be unknown parameters, which are estimated from the data to maximize the fit to the chosen distances or dissimilarities. These weights are estimated using a majorization algorithm. Once this extra weight-estimation step is accomplished, the procedure follows the classical path in decomposing the matrix and displaying its rows and columns in biplots.