An interdependence analysis of Australian house prices using variance decomposition

Purpose - The purpose of this paper is to analyse the interdependencies of the house price growth rates in Australian capital cities.
Design/methodology/approach - A vector autoregression model and variance decomposition are introduced to estimate and interpret the interdependences among the growth rates of regional house prices in Australia.
Findings - The results suggest the eight capital cities can be divided into three groups: Sydney and Melbourne; Canberra, Adelaide and Brisbane; and Hobart, Perth and Darwin.
Originality/value - Based on the structural vector autoregression model, this research develops an innovative interdependence analysis approach of regional house prices based on a variance decomposition method.

Convergence analysis of sampling-based decomposition methods for risk-averse multistage stochastic convex programs

We consider a class of sampling-based decomposition methods to solve risk-averse multistage stochastic convex programs. We prove a formula for the computation of the cuts necessary to build the outer linearizations of the recourse functions. This formula can be used to obtain an efficient implementation of Stochastic Dual Dynamic Programming applied to convex nonlinear problems. We prove the almost sure convergence of these decomposition methods when the relatively complete recourse assumption holds. We also prove the almost sure convergence of these algorithms when applied to risk-averse multistage stochastic linear programs that do not satisfy the relatively complete recourse assumption. The analysis is first done assuming the underlying stochastic process is interstage independent and discrete, with a finite set of possible realizations at each stage. We then indicate two ways of extending the methods and convergence analysis to the case when the process is interstage dependent.

Time-domain analysis of piezoelectric impedance-based structural health monitoring using multilevel wavelet decomposition

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Laurdan Spectrum Decomposition as a Tool for the Analysis of Surface Bilayer Structure and Polarity: a Study with DMPG, Peptides and Cholesterol

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

An application of the Adomian's decomposition method to the analysis of MHD duct flows

A new approach is proposed in this work for the treatment of boundary value problems through the Adomian's decomposition method. Although frequently claimed as accurate and having fast convergence rates, the original formulation of Adomian's method does not allow the treatment of homogeneous boundary conditions along closed boundaries. The technique here presented overcomes this difficulty, and is applied to the analysis of magnetohydrodynamic duct flows. Results are in good agreement with finite element method calculations and analytical solutions for square ducts. Therefore, new possibilities appear for the application of Adomian's method in electromagnetics.

Comparative studies of the sample decomposition of green and roasted coffee for determination of nutrients and data exploratory analysis

The contents of some nutrients in 35 Brazilian green and roasted coffee samples were determined by flame atomic absorption spectrometry (Ca, Mg, Fe, Cu, Mn, and Zn), flame atomic emission photometry (Na and K) and Kjeldahl (N) after preparing the samples by wet digestion procedures using i) a digester heating block and ii) a conventional microwave oven system with pressure and temperature control. The accuracy of the procedures was checked using three standard reference materials (National Institute of Standards and Technology, SRM 1573a Tomato Leaves, SRM 1547 Peach Leaves, SRM 1570a Trace Elements in Spinach). Analysis of data after application of t-test showed that results obtained by microwave-assisted digestion were more accurate than those obtained by block digester at 95% confidence level. Additionally to better accuracy, other favorable characteristics found were lower analytical blanks, lower reagent consumption, and shorter digestion time. Exploratory analysis of results using Principal Component Analysis (PCA) and Hierarchical Cluster Analysis (HCA) showed that Na, K, Ca, Cu, Mg, and Fe were the principal elements to discriminate between green and roasted coffee samples. ©2007 Sociedade Brasileira de Química.

Singular Value Decomposition and Ligand Binding Analysis

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Evaluation of Decomposition Kinetics of Poly (Ether-Ether-Ketone) by Thermogravimetric Analysis

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Thermal analysis of coordination compounds. Part 3. Thermal decomposition of platinum complexes containing triphenylphosphine, triphenylarsine and triphenylstibine

Studies by thermogravimetric analysis (TG) and differential thermal analysis (DTA) of the complexes [PtCl2L2] (L is PPh3, AsPh3, SbPh3), [PtLn] (n = 3, L is SbPh3; n = 4, L is PPh3, AsPh3); [(PtL3)2N2]; [(PtL3)2C2] and [Pt(CO)2L2] (L is SbPh3) are described. Analysis of the TG and DTA curves showed that Pt(II) complexes of the type [PtCl2L2] have a higher thermal stability than the corresponding Pt(0) complexes of the type [PtLn], with the exception of [Pt(SbPh3)3], which is more stable than [PtCl2(SbPh3)2]. Thermal stabilities of each of the complexes are compared with those of the others in the series. Mechanisms of thermal decomposition of complexes of the types [PtCl2L2] and [PtLn] are proposed. Residues of the samples were characterized by chemical tests and IR spectroscopy. The residue from the thermal decomposition of [PtCl2L2] (L is PPh3, AsPh3) and [Pt(PPh3)4] is metallic platinum. For [Pt(AsPh3)4] the residue is a mixture of Pt and As, whereas for the complexes containing SbPh3 the residues are mixtures of Pt and Sb. In these cases, the proportional contents of Pt and As or Pt and Sb correspond to the stoichiometry of these elements in the respective complexes. The complexes {[Pt(SbPh3)3]2N2}, {[Pt(SbPh3)3]2C2} lose N2 or the ethynediyl group at 130-150°C and are transformed into [Pt(SbPh3)3]. © 1995.

A novel method for power quality multiple disturbance decomposition based on Independent Component Analysis

In this paper, a novel method for power quality signal decomposition is proposed based on Independent Component Analysis (ICA). This method aims to decompose the power system signal (voltage or current) into components that can provide more specific information about the different disturbances which are occurring simultaneously during a multiple disturbance situation. The ICA is originally a multichannel technique. However, the method proposes its use to blindly separate out disturbances existing in a single measured signal (single channel). Therefore, a preprocessing step for the ICA is proposed using a filter bank. The proposed method was applied to synthetic data, simulated data, as well as actual power system signals, showing a very good performance. A comparison with the decomposition provided by the Discrete Wavelet Transform shows that the proposed method presented better decoupling for the analyzed data. (C) 2012 Elsevier Ltd. All rights reserved.

Curve Decomposition for Large Deflection Analysis of Fixed-Guided Beams With Application to Statically Balanced Compliant Mechanisms

Statically balanced compliant mechanisms require no holding force throughout their range of motion while maintaining the advantages of compliant mechanisms. In this paper, a postbuckled fixed-guided beam is proposed to provide the negative stiffness to balance the positive stiffness of a compliant mechanism. To that end, a curve decomposition modeling method is presented to simplify the large deflection analysis. The modeling method facilitates parametric design insight and elucidates key points on the force-deflection curve. Experimental results validate the analysis. Furthermore, static balancing with fixed-guided beams is demonstrated for a rectilinear proof-of-concept prototype.

How does spatial extent of fMRI datasets affect independent component analysis decomposition?

Spatial independent component analysis (sICA) of functional magnetic resonance imaging (fMRI) time series can generate meaningful activation maps and associated descriptive signals, which are useful to evaluate datasets of the entire brain or selected portions of it. Besides computational implications, variations in the input dataset combined with the multivariate nature of ICA may lead to different spatial or temporal readouts of brain activation phenomena. By reducing and increasing a volume of interest (VOI), we applied sICA to different datasets from real activation experiments with multislice acquisition and single or multiple sensory-motor task-induced blood oxygenation level-dependent (BOLD) signal sources with different spatial and temporal structure. Using receiver operating characteristics (ROC) methodology for accuracy evaluation and multiple regression analysis as benchmark, we compared sICA decompositions of reduced and increased VOI fMRI time-series containing auditory, motor and hemifield visual activation occurring separately or simultaneously in time. Both approaches yielded valid results; however, the results of the increased VOI approach were spatially more accurate compared to the results of the decreased VOI approach. This is consistent with the capability of sICA to take advantage of extended samples of statistical observations and suggests that sICA is more powerful with extended rather than reduced VOI datasets to delineate brain activity.

HIGH PERFORMANCE, LOW COST SUBSPACE DECOMPOSITION AND POLYNOMIAL ROOTING FOR REAL TIME DIRECTION OF ARRIVAL ESTIMATION: ANALYSIS AND IMPLEMENTATION

This thesis develops high performance real-time signal processing modules for direction of arrival (DOA) estimation for localization systems. It proposes highly parallel algorithms for performing subspace decomposition and polynomial rooting, which are otherwise traditionally implemented using sequential algorithms. The proposed algorithms address the emerging need for real-time localization for a wide range of applications. As the antenna array size increases, the complexity of signal processing algorithms increases, making it increasingly difficult to satisfy the real-time constraints. This thesis addresses real-time implementation by proposing parallel algorithms, that maintain considerable improvement over traditional algorithms, especially for systems with larger number of antenna array elements. Singular value decomposition (SVD) and polynomial rooting are two computationally complex steps and act as the bottleneck to achieving real-time performance. The proposed algorithms are suitable for implementation on field programmable gated arrays (FPGAs), single instruction multiple data (SIMD) hardware or application specific integrated chips (ASICs), which offer large number of processing elements that can be exploited for parallel processing. The designs proposed in this thesis are modular, easily expandable and easy to implement. Firstly, this thesis proposes a fast converging SVD algorithm. The proposed method reduces the number of iterations it takes to converge to correct singular values, thus achieving closer to real-time performance. A general algorithm and a modular system design are provided making it easy for designers to replicate and extend the design to larger matrix sizes. Moreover, the method is highly parallel, which can be exploited in various hardware platforms mentioned earlier. A fixed point implementation of proposed SVD algorithm is presented. The FPGA design is pipelined to the maximum extent to increase the maximum achievable frequency of operation. The system was developed with the objective of achieving high throughput. Various modern cores available in FPGAs were used to maximize the performance and details of these modules are presented in detail. Finally, a parallel polynomial rooting technique based on Newton’s method applicable exclusively to root-MUSIC polynomials is proposed. Unique characteristics of root-MUSIC polynomial’s complex dynamics were exploited to derive this polynomial rooting method. The technique exhibits parallelism and converges to the desired root within fixed number of iterations, making this suitable for polynomial rooting of large degree polynomials. We believe this is the first time that complex dynamics of root-MUSIC polynomial were analyzed to propose an algorithm. In all, the thesis addresses two major bottlenecks in a direction of arrival estimation system, by providing simple, high throughput, parallel algorithms.