Edge states of a three-dimensional topological insulator

We use the bulk Hamiltonian for a three-dimensional topological insulator such as Bi-2 Se-3 to study the states which appear on its various surfaces and along the edge between two surfaces. We use both analytical methods based on the surface Hamiltonians (which are derived from the bulk Hamiltonian) and numerical methods based on a lattice discretization of the bulk Hamiltonian. We find that the application of a potential barrier along an edge can give rise to states localized at that edge. These states have an unusual energy-momentum dispersion which can be controlled by applying a potential along the edge; in particular, the velocity of these states can be tuned to zero. The scattering and conductance across the edge is studied as a function of the edge potential. We show that a magnetic field in a particular direction can also give rise to zero energy states on certain edges. We point out possible experimental ways of looking for the various edge states.

Crack stability in edge-notched clamped beam specimens: modeling and experiments

Stability of a fracture toughness testing geometry is important to determine the crack trajectory and R-curve behavior of the specimen. Few configurations provide for inherent geometric stability, especially when the specimen being tested is brittle. We propose a new geometrical construction called the single edge notched clamped bend specimen (SENCB), a modified form of three point bending, yielding stable cracking under load control. It is shown to be particularly suitable for small-scale structures which cannot be made free-standing, (e.g., thin films, coatings). The SENCB is elastically clamped at the two ends to its parent material. A notch is inserted at the bottom center and loaded in bending, to fracture. Numerical simulations are carried out through extended finite element method to derive the geometrical factor f(a/W) and for different beam dimensions. Experimental corroborations of the FEM results are carried out on both micro-scale and macro-scale brittle specimens. A plot of vs a/W, is shown to rise initially and fall off, beyond a critical a/W ratio. The difference between conventional SENB and SENCB is highlighted in terms of and FEM simulated stress contours across the beam cross-section. The `s of bulk NiAl and Si determined experimentally are shown to match closely with literature values. Crack stability and R-curve effect is demonstrated in a PtNiAl bond coat sample and compared with predicted crack trajectories from the simulations. The stability of SENCB is shown for a critical range of a/W ratios, proving that it can be used to get controlled crack growth even in brittle samples under load control.

A feasibility study of a post-buckled beam for actuating helicopter trailing edge flap

Active trailing edge flaps (TEFs) are one of the most promising devices for helicopter vibration reduction. Smart actuators such as the piezoelectric stack actuators (PEAs) are used for TEF actuation. PEAs possess high energy density and have large force in dynamic condition but are limited to small displacements. In this investigation, we study a linear to rotary motion amplification mechanism (AM-2) based on a pinned-pinned post-buckled beam to actuate trailing edge flaps. A linear motion amplification mechanism is developed and coupled with AM-2 to amplify angular flap deflections. Experiments are conducted on bench top-test setup, and maximum flap angle deflections of the order of 12A degrees are achieved in the static case. An aeroelastic analysis is performed and 91 % reduction in helicopter vibration is obtained with multiharmonic control inputs.

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

New low band gap 2-(4-(trifluoromethyl)phenyl)-1H-benzod]imidazole and benzo1,2-c; 4,5-c `]bis1,2,5]thiadiazole based conjugated polymers for organic photovoltaics

Two new low band gap D-A structured conjugated polymers, PBDTTBI and PBDTBBT, based on 2-(4-(trifluoromethyl)phenyl)-1H-benzod]imidazole and benzo1,2-c; 4,5-c']bis1,2,5]thiadiazole acceptor units with benzo1,2-b; 3,4-b']dithiophene as a donor unit have been designed and synthesized via a Stille coupling reaction. The incorporation of the benzo1,2-c; 4,5-c']bis1,2,5]thiadiazole unit into PBDTBBT has significantly altered the optical and electrochemical properties of the polymer. The optical band gap estimated from the onset absorption edge is similar to 1.88 eV and similar to 1.1 eV, respectively for PBDTTBI and PBDTBBT. It is observed that PBDTBBT exhibited a deeper HOMO energy level (similar to 4.06 eV) with strong intramolecular charge transfer interactions. Bulk heterojunction solar cells fabricated with a configuration of ITO/PEDOT: PSS/PBDTBBT: PC71BM/Al exhibited a best power conversion efficiency of 0.67%, with a short circuit current density of 4.9 mA cm(-2), an open-circuit voltage of 0.54 V and a fill factor of 25%.

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

Local disorder investigation in NiS2-xSex using Raman and Ni K-edge x-ray absorption spectroscopies

We report on Raman and Ni K-edge x-ray absorption investigations of a NiS2-xSex (with x = 0.00, 0.50/0.55, 0.60, and 1.20) pyrite family. The Ni K-edge absorption edge shows a systematic shift going from an insulating phase (x = 0.00 and 0.50) to a metallic phase (x = 0.60 and 1.20). The near-edge absorption features show a clear evolution with Se doping. The extended x-ray absorption fine structure data reveal the evolution of the local structure with Se doping which mainly governs the local disorder. We also describe the decomposition of the NiS2-xSex Raman spectra and investigate the weights of various phonon modes using Gaussian and Lorentzian profiles. The effectiveness of the fitting models in describing the data is evaluated by means of Bayes factor estimation. The Raman analysis clearly demonstrates the disorder effects due to Se alloying in describing the phonon spectra of NiS2-xSex pyrites.

Effect of functional groups on separating carbon dioxide from CO2/N-2 gas mixtures using edge functionalized graphene nanoribbons

Development of microporous adsorbents for separation and sequestration of carbon dioxide from flue gas streams is an area of active research. In this study, we assess the influence of specific functional groups on the adsorption selectivity of CO2/N-2 mixtures through Grand Canonical Monte Carlo (GCMC) simulations. Our model system consists of a bilayer graphene nanoribbon that has been edge functionalized with OH, NH2, NO2, CH3 and COOH. Ab initio Moller-Plesset (MP2) calculations with functionalized benzenes are used to obtain binding energies and optimized geometries for CO2 and N-2. This information is used to validate the choice classical forcefields in GCMC simulations. In addition to simulations of adsorption from binary mixtures of CO2 and N-2, the ideal adsorbed solution theory (IAST) is used to predict mixture isotherms. Our study reveals that functionalization always leads to an increase in the adsorption of both CO2 and N-2 with the highest for COOH. However, significant enhancement in the selectivity for CO2 is only seen with COOH functionalized nanoribbons. The COOH functionalization gives a 28% increase in selectivity compared to H terminated nanoribbons, whereas the improvement in the selectivity for other functional groups are much Enure modest. Our study suggests that specific functionalization with COOH groups can provide a material's design strategy to improve CO2 selectivity in microporous adsorbents. Synthesis of graphene nanoplatelets with edge functionalized COOH, which has the potential for large scale production, has recently been reported (Jeon el, al., 2012). (C) 2014 Elsevier Ltd. All rights reserved,

An open source massively parallel solver for Richards equation: Mechanistic modelling of water fluxes at the watershed scale

In this paper we present a massively parallel open source solver for Richards equation, named the RichardsFOAM solver. This solver has been developed in the framework of the open source generalist computational fluid dynamics tool box OpenFOAM (R) and is capable to deal with large scale problems in both space and time. The source code for RichardsFOAM may be downloaded from the CPC program library website. It exhibits good parallel performances (up to similar to 90% parallel efficiency with 1024 processors both in strong and weak scaling), and the conditions required for obtaining such performances are analysed and discussed. These performances enable the mechanistic modelling of water fluxes at the scale of experimental watersheds (up to few square kilometres of surface area), and on time scales of decades to a century. Such a solver can be useful in various applications, such as environmental engineering for long term transport of pollutants in soils, water engineering for assessing the impact of land settlement on water resources, or in the study of weathering processes on the watersheds. (C) 2014 Elsevier B.V. All rights reserved.

Small-Signal Stability Analysis of an Open-loop Induction Motor Drive Including the Effect of Inverter Dead-Time

This paper demonstrates light-load instability in open-loop induction motor drives on account of inverter dead-time. The dynamic equations of an inverter fed induction motor, incorporating the effect of dead-time, are considered. A procedure to derive the small-signal model of the motor, including the effect of inverter dead-time, is presented. Further, stability analysis is carried out on a 100-kW, 415V, 3-phase induction motor considering no-load. For voltage to frequency (i.e. V/f) ratios between 0.5 and 1 pu, the analysis brings out regions of instability on the V-f plane, in the frequency range between 5Hz and 20Hz. Simulation and experimental results show sub-harmonic oscillations in the motor current in this region, confirming instability as predicted by the analysis.

Open loop Model for WDM Links

Wavelength Division Multiplexing (WDM) techniques overfibrelinks helps to exploit the high bandwidth capacity of single mode fibres. A typical WDM link consisting of laser source, multiplexer/demultiplexer, amplifier and detectoris considered for obtaining the open loop gain model of the link. The methodology used here is to obtain individual component models using mathematical and different curve fitting techniques. These individual models are then combined to obtain the WDM link model. The objective is to deduce a single variable model for the WDM link in terms of input current to system. Thus it provides a black box solution for a link. The Root Mean Square Error (RMSE) associated with each of the approximated models is given for comparison. This will help the designer to select the suitable WDM link model during a complex link design.

Maze solving automatons for self-healing of open interconnects: Modular add-on for circuit boards

We present the circuit board integration of a self-healing mechanism to repair open faults. The electric field driven mechanism physically restores fractured interconnects in electronic circuits and has the ability to solve mazes. The repair is performed by conductive particles dispersed in an insulating fluid. We demonstrate the integration of the healing module onto printed circuit boards and the ability of maze solving. We model and perform experiments on the influence of the geometry of conductive particles as well as the terminal impedances of the route on the healing efficiency. The typical heal rate is 10 mu m/s with healed route having mean resistance of 8 k Omega across a 200 micron gap and depending on the materials and concentrations used. (C) 2015 AIP Publishing LLC.

EXPERIENCE OF OPERATING OPEN TOP BIOMASS GASIFIER USING A LOW DENSITY FUEL-COCONUT FRONDS

Use of fuel other than woody generally has been limited to rice husk and other residues are rarely tried as a fuel in a gasification system. With the availability of woody biomass in most countries like India, alternates fuels are being explored for sustainable supply of fuel. Use of agro residues has been explored after briquetting. There are few feedstock's like coconut fronts, maize cobs, etc, that might require lesser preprocessing steps compared to briquetting. The paper presents a detailed investigation into using coconut fronds as a fuel in an open top down draft gasification system. The fuel has ash content of 7% and was dried to moisture levels of 12 %. The average bulk density was found to be 230 kg/m3 with a fuel size particle of an average size 40 mm as compared to 350 kg/m3 for a standard wood pieces. A typical dry coconut fronds weighs about 2.5kgs and on an average 6 m long and 90 % of the frond is the petiole which is generally used as a fuel. The focus was also to compare the overall process with respect to operating with a typical woody biomass like subabul whose ash content is 1 %. The open top gasification system consists of a reactor, cooling and cleaning system along with water treatment. The performance parameters studied were the gas composition, tar and particulates in the clean gas, water quality and reactor pressure drop apart from other standard data collection of fuel flow rate, etc. The average gas composition was found to be CO 15 1.0 % H-2 16 +/- 1% CH4 0.5 +/- 0.1 % CO2 12.0 +/- 1.0 % and rest N2 compared to CO 19 +/- 1.0 % H-2 17 +/- 1.0 %, CH4 1 +/- 0.2 %, CO2 12 +/- 1.0 % and rest N2. The tar and particulate content in the clean gas has been found to be about 10 and 12 mg/m3 in both cases. The presence of high ash content material increased the pressure drop with coconut frond compared to woody biomass.

Rainbow matchings in strongly edge-colored graphs

A rainbow matching of an edge-colored graph G is a matching in which no two edges have the same color. There have been several studies regarding the maximum size of a rainbow matching in a properly edge-colored graph G in terms of its minimum degree 3(G). Wang (2011) asked whether there exists a function f such that a properly edge-colored graph G with at least f (delta(G)) vertices is guaranteed to contain a rainbow matching of size delta(G). This was answered in the affirmative later: the best currently known function Lo and Tan (2014) is f(k) = 4k - 4, for k >= 4 and f (k) = 4k - 3, for k <= 3. Afterwards, the research was focused on finding lower bounds for the size of maximum rainbow matchings in properly edge-colored graphs with fewer than 4 delta(G) - 4 vertices. Strong edge-coloring of a graph G is a restriction of proper edge-coloring where every color class is required to be an induced matching, instead of just being a matching. In this paper, we give lower bounds for the size of a maximum rainbow matching in a strongly edge-colored graph Gin terms of delta(G). We show that for a strongly edge-colored graph G, if |V(G)| >= 2 |3 delta(G)/4|, then G has a rainbow matching of size |3 delta(G)/4|, and if |V(G)| < 2 |3 delta(G)/4|, then G has a rainbow matching of size |V(G)|/2] In addition, we prove that if G is a strongly edge-colored graph that is triangle-free, then it contains a rainbow matching of size at least delta(G). (C) 2015 Elsevier B.V. All rights reserved.