Test-retest reliability of graph theory measures of structural brain connectivity

The human connectome has recently become a popular research topic in neuroscience, and many new algorithms have been applied to analyze brain networks. In particular, network topology measures from graph theory have been adapted to analyze network efficiency and 'small-world' properties. While there has been a surge in the number of papers examining connectivity through graph theory, questions remain about its test-retest reliability (TRT). In particular, the reproducibility of structural connectivity measures has not been assessed. We examined the TRT of global connectivity measures generated from graph theory analyses of 17 young adults who underwent two high-angular resolution diffusion (HARDI) scans approximately 3 months apart. Of the measures assessed, modularity had the highest TRT, and it was stable across a range of sparsities (a thresholding parameter used to define which network edges are retained). These reliability measures underline the need to develop network descriptors that are robust to acquisition parameters.

Planar silver nanowire, carbon nanotube and PEDOT:PSS nanocomposite transparent electrodes

Highly conductive, transparent and flexible planar electrodes were fabricated using interwoven silver nanowires and single-walled carbon nanotubes (AgNW:SWCNT) in a PEDOT:PSS matrix via an epoxy transfer method from a silicon template. The planar electrodes achieved a sheet resistance of 6.6 ± 0.0 Ω/squ and an average transmission of 86% between 400 and 800 nm. A high figure of merit of 367 Ω−1 is reported for the electrodes, which is much higher than that measured for indium tin oxide and reported for other AgNW composites. The AgNW:SWCNT:PEDOT:PSS electrode was used to fabricate low temperature (annealing free) devices demonstrating their potential to function with a range of organic semiconducting polymer:fullerene bulk heterojunction blend systems.

Bias-dependent effects in planar perovskite solar cells based on CH3NH3PbI3−xClx films

A unique bias-dependent phenomenon in CH3NH3PbI3−xClx based planar perovskite solar cells has been demonstrated, in which the photovoltaic parameters derived from the current–voltage (I–V) curves are highly dependent on the initial positive bias of the I–V measurement. In FTO/CH3NH3PbI3−xClx/Au devices, the open-circuit voltage and short-circuit current increased by ca. 337.5% and 281.9% respectively, by simply increasing the initial bias from 0.5 V to 2.5 V.

New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems

In the mining optimisation literature, most researchers focused on two strategic-level and tactical-level open-pit mine optimisation problems, which are respectively termed ultimate pit limit (UPIT) or constrained pit limit (CPIT). However, many researchers indicate that the substantial numbers of variables and constraints in real-world instances (e.g., with 50-1000 thousand blocks) make the CPIT’s mixed integer programming (MIP) model intractable for use. Thus, it becomes a considerable challenge to solve the large scale CPIT instances without relying on exact MIP optimiser as well as the complicated MIP relaxation/decomposition methods. To take this challenge, two new graph-based algorithms based on network flow graph and conjunctive graph theory are developed by taking advantage of problem properties. The performance of our proposed algorithms is validated by testing recent large scale benchmark UPIT and CPIT instances’ datasets of MineLib in 2013. In comparison to best known results from MineLib, it is shown that the proposed algorithms outperform other CPIT solution approaches existing in the literature. The proposed graph-based algorithms leads to a more competent mine scheduling optimisation expert system because the third-party MIP optimiser is no longer indispensable and random neighbourhood search is not necessary.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.

Automated topometric graph generation from floor plan analysis

The world is rich with information such as signage and maps to assist humans to navigate. We present a method to extract topological spatial information from a generic bitmap floor plan and build a topometric graph that can be used by a mobile robot for tasks such as path planning and guided exploration. The algorithm first detects and extracts text in an image of the floor plan. Using the locations of the extracted text, flood fill is used to find the rooms and hallways. Doors are found by matching SURF features and these form the connections between rooms, which are the edges of the topological graph. Our system is able to automatically detect doors and differentiate between hallways and rooms, which is important for effective navigation. We show that our method can extract a topometric graph from a floor plan and is robust against ambiguous cases most commonly seen in floor plans including elevators and stairwells.

Modeling of a pressure modulated desalination system using bond graph methodology

A desalination system is a complex multi energy domain system comprising power/energy flow across several domains such as electrical, thermal, and hydraulic. The dynamic modeling of a desalination system that comprehensively addresses all these multi energy domains is not adequately addressed in the literature. This paper proposes to address the issue of modeling the various energy domains for the case of a single stage flash evaporation desalination system. This paper presents a detailed bond graph modeling of a desalination unit with seamless integration of the power flow across electrical, thermal, and hydraulic domains. The paper further proposes a performance index function that leads to the tracking of the optimal chamber pressure giving the optimal flow rate for a given unit of energy expended. The model has been validated in steady state conditions by simulation and experimentation.

Bond graph toolbox for handling complex variable

Bond graph is an apt modelling tool for any system working across multiple energy domains. Power electronics system modelling is usually the study of the interplay of energy in the domains of electrical, mechanical, magnetic and thermal. The usefulness of bond graph modelling in power electronic field has been realised by researchers. Consequently in the last couple of decades, there has been a steadily increasing effort in developing simulation tools for bond graph modelling that are specially suited for power electronic study. For modelling rotating magnetic fields in electromagnetic machine models, a support for vector variables is essential. Unfortunately, all bond graph simulation tools presently provide support only for scalar variables. We propose an approach to provide complex variable and vector support to bond graph such that it will enable modelling of polyphase electromagnetic and spatial vector systems. We also introduced a rotary gyrator element and use it along with the switched junction for developing the complex/vector variable's toolbox. This approach is implemented by developing a complex S-function tool box in Simulink inside a MATLAB environment This choice has been made so as to synthesise the speed of S-function, the user friendliness of Simulink and the popularity of MATLAB.

Non-linear resonance in strings under narrow band random excitation, part I: Planar response and stability

Non-linear planar response of a string to planar narrow band random excitation is investigated in this paper. A response equation for the mean square deflection σ2 is obtained under a single mode approximation by using the equivalent linearization technique. It is shown that the response is triple valued, as in the case of harmonic excitation, if the centre frequency of excitation Ω lies in a certain specified range. The triple valued response occurs only if the excitation bandwidth β is smaller than a critical value βcrit which is a monotonically increasing function of the intensity of excitation. An approximate method of investigating the almost sure asymptotic stability of the solution is presented and regions of instability in the Ω-σ2 plane have been charted. It is shown that planar response can become unstable either due to an unbounded growth of the in-plane component of motion or due to a spontaneous appearance of an out-of-plane component.

A 13C-NMR study of non-planar distortions in amides

The technique of 13C-NMR spectroscopy of oriented systems to problems of biological importance has been suggested and used to investigate non-planar distortions in substituted amides—models for peptides. The studies in conjunction with the proton magnetic resonance data on 5N-[13C]methyl[13C]formamide oriented in a nematic solvent provide all the direct dipolar couplings between the interacting nuclei in the system. When the 13C- and the 1H-NMR experiments are performed under non-identical conditions, 22 different direct dipolar couplings are obtained. It is demostrated that they can be used to determine unambiguously non-planar distortions around the nitrogen atom together with other geometrical data and the molecular order.

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

Improving decisions for invasive species management: Reformulation and extensions of the Panetta-Lawes eradication graph

Aim: Effective decisions for managing invasive species depend on feedback about the progress of eradication efforts. Panetta & Lawes. developed the eradograph, an intuitive graphical tool that summarizes the temporal trajectories of delimitation and extirpation to support decision-making. We correct and extend the tool, which was affected by incompatibilities in the units used to measure these features that made the axes impossible to interpret biologically. Location: Victoria, New South Wales and Queensland, Australia. Methods: Panetta and Lawes' approach represented delimitation with estimates of the changes in the area known to be infested and extirpation with changes in the mean time since the last detection. We retain the original structure but propose different metrics that improve biological interpretability. We illustrate the methods with a hypothetical example and real examples of invasion and treatment of branched broomrape (Orobanche ramosa L.) and the guava rust complex (Puccinia psidii (Winter 1884)) in Australia. Results: These examples illustrate the potential of the tool to guide decisions about the effectiveness of search and control activities. Main conclusions: The eradograph is a graphical data summary tool that provides insight into the progress of eradication. Our correction and extension of the tool make it easier to interpret and provide managers with better decision support. © 2013 John Wiley & Sons Ltd.

The non-planar peptide unit II. Comparison of theory with crystal structure datastar, open

The theoretical results derived in Part I (Ramachandran, G.N., Lakshminarayan, A.V. and Kolaskar, A.S. (1973) Biochim. Biophys. Acta 303, 8–13) that the three bonds of the peptide unit meeting at N can have a pyramidal structure is confirmed by an analysis of 14 published crystal structures of small peptides. It is shown that the dihedral angles θN and Δω are correlated, while θC, is small and is uncorrelated with Δω, showing that the non-planar distortion at C′ is generally small.

Theory of the non-planar peptide unitstar, open

By means of CNDO/2 calculations on N-methyl acetamide, it is shown that the state of minimum energy of the trans-peptide unit is a non-planar conformation, with the NH and NC2α bonds being significantly out of the plane formed by the atoms C1α, C′, O and N.

Uniformity of film thickness on rotating planetary planar substrates

For the purposes of obtaining a number of components with nearly identical thickness distributions over the substrate area and of minimizing the inhomogeneities of the film, it is logical to presume that a substrate rotating on its own axis and revolving around another axis will give more uniformity in film thickness than a substrate only revolving around one axis. In relation to the practical applications, an investigation has been undertaken to study the refinement that can be achieved by using a planar planetary substrate holder. It is shown theoretically that the use of the planetary substrate holder under ideal conditions of source and geometry does not offer any further improvement in uniformity of thickness over the conventional rotary work-holder. It is also shown that the geometrical parameters alone have little influence over the uniformity achieved on a planetary substrate, because of the complex cyclidal motion of any point on it. However, for any given geometry, a non-integral speed ratio of the planetary substrate and the work-holder shows considerably less variation in thickness over the substrate area.