Virtues of marginally metallic oxides

Transition-metal oxides at the metal-insulator boundary, especially those belonging to the perovskite family, exhibit fascinating phenomena such as insulator-metal transitions controlled by composition, high-temperature superconductivity and giant magnetoresistance (GMR), Interestingly, many of these marginally metallic oxides obey the established criteria for metallicity and have a finite density of states at the Fermi;level. The perovskite manganates exhibiting GMR, on the other hand, are unusual in that they possess very high resistivities in the 'metallic' state and show no significant density of states at the Fermi level, Marginal metallicity in oxide systems is a problem of great complexity and contemporary interest and its understanding is of crucial significance to the diverse phenomena exhibited by these materials.

Molecular theory for the effects of specific solute-solvent interaction on the diffusion of a solute particle in a molecular liquid

An understanding of the effect of specific solute-solvent interactions on the diffusion of a solute probe is a long standing problem of physical chemistry. In this paper a microscopic treatment of this effect is presented. The theory takes into account the modification of the solvent structure around the solute due to this specific interaction between them. It is found that for strong, attractive interaction, there is an enhanced coupling between the solute and the solvent dynamic modes (in particular, the density mode), which leads to a significant increase in the friction on the solute. The diffusion coefficient of the solute is found to depend strongly and nonlinearly on the magnitude of the attractive interaction. An interesting observation is that specific solute-solvent interaction can induce a crossover from a sliplike to a sticklike diffusion. In the limit of strong attractive interaction, we recover a dynamic version of the solvent-berg picture. On the other hand, for repulsive interaction, the diffusion coefficient of the solute increases. These results are in qualitative agreement with recent experimental observations.

On the sensitivity of elastic waves due to structural damages:Time-frequency based indexing method

Time-frequency analysis of various simulated and experimental signals due to elastic wave scattering from damage are performed using wavelet transform (WT) and Hilbert-Huang transform (HHT) and their performances are compared in context of quantifying the damages. Spectral finite element method is employed for numerical simulation of wave scattering. An analytical study is carried out to study the effects of higher-order damage parameters on the reflected wave from a damage. Based on this study, error bounds are computed for the signals in the spectral and also on the time-frequency domains. It is shown how such an error bound can provide all estimate of error in the modelling of wave propagation in structure with damage. Measures of damage based on WT and HHT is derived to quantify the damage information hidden in the signal. The aim of this study is to obtain detailed insights into the problem of (1) identifying localised damages (2) dispersion of multifrequency non-stationary signals after they interact with various types of damage and (3) quantifying the damages. Sensitivity analysis of the signal due to scattered wave based on time-frequency representation helps to correlate the variation of damage index measures with respect to the damage parameters like damage size and material degradation factors.

From “somatic scandals” to “a constant potential for violence”? The culture of dissection, brain-based learning, and the rewriting/rewiring of “the child”

This article analyzes the “messy and numberless beginnings” of the hope placed upon neurological foundationalism to provide a solution to the “problem” of differences between students and to the achievement of educational goals. Rather than arguing for or against educational neuroscience, the article moves through five levels to examine the conditions of possibility for subscribing to the brain as a causal organological locus of learning.

Inverse Sensitivity Analysis of Singular Solutions of FRF matrix in Structural System Identification

The problem of structural damage detection based on measured frequency response functions of the structure in its damaged and undamaged states is considered. A novel procedure that is based on inverse sensitivity of the singular solutions of the system FRF matrix is proposed. The treatment of possibly ill-conditioned set of equations via regularization scheme and questions on spatial incompleteness of measurements are considered. The application of the method in dealing with systems with repeated natural frequencies and (or) packets of closely spaced modes is demonstrated. The relationship between the proposed method and the methods based on inverse sensitivity of eigensolutions and frequency response functions is noted. The numerical examples on a 5-degree of freedom system, a one span free-free beam and a spatially periodic multi-span beam demonstrate the efficacy of the proposed method and its superior performance vis-a-vis methods based on inverse eigensensitivity.

Submission to the Senate Economics References Committee Inquiry into affordable housing 20 August 2014: De-risking development of medium density housing to improve housing affordability and boost supply

This submission addresses the problem of housing price inflation, the chronic under-supply of new housing stock, and the resultant decline in housing affordability for low and middle income households. It specifically focusses on the supply of medium density housing (multi-unit development) in Melbourne, although we believe that the observations made about housing in supply in Melbourne are relevant in other urban centres and to other types of housing supply. In terms of medium density housing (MDH) our concern also extends to the poor quality and design. Why the market tends to deliver generic apartments of poor quality and design which are uncompetitive with lower density housing and amenity despite planning objectives, and how this apparently intractable problem can be overcome is the topic of this submission...

The Parallel Complexity Of Propagation In Boolean Circuits

We consider the problem of deciding whether the output of a boolean circuit is determined by a partial assignment to its inputs. This problem is easily shown to be hard, i.e., co-Image Image -complete. However, many of the consequences of a partial input assignment may be determined in linear time, by iterating the following step: if we know the values of some inputs to a gate, we can deduce the values of some outputs of that gate. This process of iteratively deducing some of the consequences of a partial assignment is called propagation. This paper explores the parallel complexity of propagation, i.e., the complexity of determining whether the output of a given boolean circuit is determined by propagating a given partial input assignment. We give a complete classification of the problem into those cases that are Image -complete and those that are unlikely to be Image complete.

A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data

Background: A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from high-dimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN) from transcript profiling data. Results: The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l1-constrained fitting) problem and solved finally by formulating a Linear Program (LP). A bound on the Generalization Error of this approach is given in terms of the Leave-One-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM) initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known regulatory associations. In each S. cerevisiae LP-SLGN, the number of nodes with a particular degree follows an approximate power law suggesting that its degree distributions is similar to that observed in real-world networks. Inspection of these LP-SLGNs suggests biological hypotheses amenable to experimental verification. Conclusion: A statistically robust and computationally efficient LP-based method for estimating the topology of a large sparse undirected graph from high-dimensional data yields representations of genetic networks that are biologically plausible and useful abstractions of the structures of real genetic networks. Analysis of the statistical and topological properties of learned LP-SLGNs may have practical value; for example, genes with high random walk betweenness, a measure of the centrality of a node in a graph, are good candidates for intervention studies and hence integrated computational – experimental investigations designed to infer more realistic and sophisticated probabilistic directed graphical model representations of genetic networks. The LP-based solutions of the sparse linear regression problem described here may provide a method for learning the structure of transcription factor networks from transcript profiling and transcription factor binding motif data.

Bounds on isoperimetric values of trees

Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v) is an element of E : u is an element of S and v is an element of V - S} be the edge boundary of S. Given an integer i, 1 <= i <= vertical bar V vertical bar, let the edge isoperimetric value of G at i be defined as b(e)(i, G) = min(S subset of V:vertical bar S vertical bar=i)vertical bar delta(S, G)vertical bar. The edge isoperimetric peak of G is defined as b(e)(G) = max(1 <= j <=vertical bar V vertical bar)b(e)(j, G). Let b(v)(G) denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete t-ary trees was recently considered in [Y. Otachi, K. Yamazaki, A lower bound for the vertex boundary-width of complete k-ary trees, Discrete Mathematics, in press (doi: 10.1016/j.disc.2007.05.014)]. In this paper we provide bounds which improve those in the above cited paper. Our results can be generalized to arbitrary (rooted) trees. The depth d of a tree is the number of nodes on the longest path starting from the root and ending at a leaf. In this paper we show that for a complete binary tree of depth d (denoted as T-d(2)), c(1)d <= b(e) (T-d(2)) <= d and c(2)d <= b(v)(T-d(2)) <= d where c(1), c(2) are constants. For a complete t-ary tree of depth d (denoted as T-d(t)) and d >= c log t where c is a constant, we show that c(1)root td <= b(e)(T-d(t)) <= td and c(2)d/root t <= b(v) (T-d(t)) <= d where c(1), c(2) are constants. At the heart of our proof we have the following theorem which works for an arbitrary rooted tree and not just for a complete t-ary tree. Let T = (V, E, r) be a finite, connected and rooted tree - the root being the vertex r. Define a weight function w : V -> N where the weight w(u) of a vertex u is the number of its successors (including itself) and let the weight index eta(T) be defined as the number of distinct weights in the tree, i.e eta(T) vertical bar{w(u) : u is an element of V}vertical bar. For a positive integer k, let l(k) = vertical bar{i is an element of N : 1 <= i <= vertical bar V vertical bar, b(e)(i, G) <= k}vertical bar. We show that l(k) <= 2(2 eta+k k)

Local structure of Sr2FeMoxW1-xO6 double perovskites across the composition-driven metal to insulator transition

Sr2FeMoO6 oxides exhibit a half-metallic ferromagnetic (HM-FM) ground state and peculiar magnetic and magnetotransport properties, which are interesting for applications in the emerging field of spintronics and attractive for fundamental research in the field of heavily correlated electron systems. Sr2FeWO6 is an insulator with an antiferromagnetic (I-AFM) ground state. The solid solutions Sr2FeMoxW1-xO6 also have peculiar properties-W doping enhances chemical order which allows stabilization of the HM-FM state; as the W content exceeds a certain value a metal to insulator transition (MIT) occurs. The role of W in determining the physical properties of Sr2FeMoxW1-xO6 systems has been a matter of intense investigation. This work deals with the problem of the structural and electronic changes related to the MIT from a local perspective by means of x-ray absorption spectroscopy (XAS). This technique allows one to probe in detail the local structure and electronic modifications around selected absorber ions (W, Mo, Fe and Sr in our case). The results of XAS analysis in the whole composition range (0 <= x <= 1), in the near edge (XANES) and extended (EXAFS) regions, demonstrate an abrupt change of the local structure around the Fe and Mo sites at the critical composition, x(c). This change represents the microstructural counterpart associated with the MIT. Conversely, the local structure and electronic configuration of W ions remain unaltered in the whole composition range, suggesting indirect participation of W in the MIT.

Characterisation of k-Variegated Graphs, k greater-than-or-equal-to 3

A graph is said to be k-variegated if its vertex set can be partitioned into k equal parts such that each vertex is adjacent to exactly one vertex from every other part not containing it. Bednarek and Sanders [1] posed the problem of characterizing k-variegated graphs. V.N. Bhat-Nayak, S.A. Choudum and R.N. Naik [2] gave the characterization of 2-variegated graphs. In this paper we characterize k-variegated graphs for k greater-or-equal, slanted 3.

A Bayesian Framework for the Assessment of Vision-based Weed and Fruit Detection and Classification Algorithms

This paper proposes new metrics and a performance-assessment framework for vision-based weed and fruit detection and classification algorithms. In order to compare algorithms, and make a decision on which one to use fora particular application, it is necessary to take into account that the performance obtained in a series of tests is subject to uncertainty. Such characterisation of uncertainty seems not to be captured by the performance metrics currently reported in the literature. Therefore, we pose the problem as a general problem of scientific inference, which arises out of incomplete information, and propose as a metric of performance the(posterior) predictive probabilities that the algorithms will provide a correct outcome for target and background detection. We detail the framework through which these predicted probabilities can be obtained, which is Bayesian in nature. As an illustration example, we apply the framework to the assessment of performance of four algorithms that could potentially be used in the detection of capsicums (peppers).

Smooth stabilisation of nonholonomic robots subject to disturbances

In this paper, we address the problem of stabilisation of robots subject to nonholonommic constraints and external disturbances using port-Hamiltonian theory and smooth time-invariant control laws. This should be contrasted with the commonly used switched or time-varying laws. We propose a control design that provides asymptotic stability of an manifold (also called relative equilibria)-due to the Brockett condition this is the only type of stabilisation possible using smooth time-invariant control laws. The equilibrium manifold can be shaped to certain extent to satisfy specific control objectives. The proposed control law also incorporates integral action, and thus the closed-loop system is robust to unknown constant disturbances. A key step in the proposed design is a change of coordinates not only in the momentum, but also in the position vector, which differs from coordinate transformations previously proposed in the literature for the control of nonholonomic systems. The theoretical properties of the control law are verified via numerical simulation based on a robotic ground vehicle model with differential traction wheels and non co-axial centre of mass and point of contact.

Analysis of a finite composite plate with smooth rigid pin

A continuum method of analysis is presented in this paper for the problem of a smooth rigid pin in a finite composite plate subjected to uniaxial loading. The pin could be of interference, push or clearance fit. The plate is idealized to an orthotropic sheet. As the load on the plate is progressively increased, the contact along the pin-hole interface is partial above certain load levels in all three types of fit. In misfit pins (interference or clearance), such situations result in mixed boundary value problems with moving boundaries and in all of them the arc of contact and the stress and displacement fields vary nonlinearly with the applied load. In infinite domains similar problems were analysed earlier by ‘inverse formulation’ and, now, the same approach is selected for finite plates. Finite outer domains introduce analytical complexities in the satisfaction of boundary conditions. These problems are circumvented by adopting a method in which the successive integrals of boundary error functions are equated to zero. Numerical results are presented which bring out the effects of the rectangular geometry and the orthotropic property of the plate. The present solutions are the first step towards the development of special finite elements for fastener joints.

Approximate solutions of Fredholm integral equations of the second kind

This note is concerned with the problem of determining approximate solutions of Fredholm integral equations of the second kind. Approximating the solution of a given integral equation by means of a polynomial, an over-determined system of linear algebraic equations is obtained involving the unknown coefficients, which is finally solved by using the least-squares method. Several examples are examined in detail. (c) 2009 Elsevier Inc. All rights reserved.