Performance analysis of boron nitride embedded armchair graphene nanoribbon metal-oxide-semiconductor field effect transistor with Stone Wales defects

We study the performance of a hybrid Graphene-Boron Nitride armchair nanoribbon (a-GNR-BN) n-MOSFET at its ballistic transport limit. We consider three geometric configurations 3p, 3p + 1, and 3p + 2 of a-GNR-BN with BN atoms embedded on either side (2, 4, and 6 BN) on the GNR. Material properties like band gap, effective mass, and density of states of these H-passivated structures are evaluated using the Density Functional Theory. Using these material parameters, self-consistent Poisson-Schrodinger simulations are carried out under the Non Equilibrium Green's Function formalism to calculate the ballistic n-MOSFET device characteristics. For a hybrid nanoribbon of width similar to 5 nm, the simulated ON current is found to be in the range of 265 mu A-280 mu A with an ON/OFF ratio 7.1 x 10(6)-7.4 x 10(6) for a V-DD = 0.68 V corresponding to 10 nm technology node. We further study the impact of randomly distributed Stone Wales (SW) defects in these hybrid structures and only 2.5% degradation of ON current is observed for SW defect density of 3.18%. (C) 2014 AIP Publishing LLC.

Higher spin entanglement entropy from CFT

We consider free fermion and free boson CFTs in two dimensions, deformed by a chemical potential mu for the spin-three current. For the CFT on the infinite spatial line, we calculate the finite temperature entanglement entropy of a single interval perturbatively to second order in mu in each of the theories. We find that the result in each case is given by the same non-trivial function of temperature and interval length. Remarkably, we further obtain the same formula using a recent Wilson line proposal for the holographic entanglement entropy, in holomorphically factorized form, associated to the spin-three black hole in SL(3, R) x SL(3, R) Chern-Simons theory. Our result suggests that the order mu(2) correction to the entanglement entropy may be universal for W-algebra CFTs with spin-three chemical potential, and constitutes a check of the holographic entanglement entropy proposal for higher spin theories of gravity in AdS(3).

An improved free surface modeling for incompressible SPH

In Incompressible Smooth Particle Hydrodynamics (ISPH), a pressure Poisson equation (PPE) is solved to obtain a divergence free velocity field. When free surfaces are simulated using this method a Dirichlet boundary condition for pressure at the free surface has to be applied. In existing ISPH methods this is achieved by identifying free surface particles using heuristically chosen threshold of a parameter such as kernel sum, density or divergence of the position, and explicitly setting their pressure values. This often leads to clumping of particles near the free surface and spraying off of surface particles during splashes. Moreover, surface pressure gradients in flows where surface tension is important are not captured well using this approach. We propose a more accurate semi-analytical approach to impose Dirichlet boundary conditions on the free surface. We show the efficacy of the proposed algorithm by using test cases of elongation of a droplet and dam break. We perform two dimensional simulations of water entry and validate the proposed algorithm with experimental results. Further, a three dimensional simulation of droplet splash is shown to compare well with the Volume-of-Fluid simulations. (C) 2014 Elsevier Ltd. All rights reserved.

Influence of curvature on the device physics of thin film transistors on flexible substrates

Thin film transistors (TFTs) on elastomers promise flexible electronics with stretching and bending. Recently, there have been several experimental studies reporting the behavior of TFTs under bending and buckling. In the presence of stress, the insulator capacitance is influenced due to two reasons. The first is the variation in insulator thickness depending on the Poisson ratio and strain. The second is the geometric influence of the curvature of the insulator-semiconductor interface during bending or buckling. This paper models the role of curvature on TFT performance and brings to light an elegant result wherein the TFT characteristics is dependent on the area under the capacitance-distance curve. The paper compares models with simulations and explains several experimental findings reported in literature. (C) 2014 AIP Publishing LLC.

Quantum entropy for the fuzzy sphere and its monopoles

Using generalized bosons, we construct the fuzzy sphere S-F(2) and monopoles on S-F(2) in a reducible representation of SU(2). The corresponding quantum states are naturally obtained using the GNS-construction. We show that there is an emergent nonabelian unitary gauge symmetry which is in the commutant of the algebra of observables. The quantum states are necessarily mixed and have non-vanishing von Neumann entropy, which increases monotonically under a bistochastic Markov map. The maximum value of the entropy has a simple relation to the degeneracy of the irreps that constitute the reducible representation that underlies the fuzzy sphere.

STOPPING THE CCR FLOW AND ITS ISOMETRIC COCYCLES

It is shown how to use non-commutative stopping times in order to stop the CCR flow of arbitrary index and also its isometric cocycles, i.e. left operator Markovian cocycles on Boson Fock space. Stopping the CCR flow yields a homomorphism from the semigroup of stopping times, equipped with the convolution product, into the semigroup of unital endomorphisms of the von Neumann algebra of bounded operators on the ambient Fock space. The operators produced by stopping cocycles themselves satisfy a cocycle relation.

Monopoles, Dirac operator, and index theory for fuzzy SU(3) / (U(1) x U(1))

The intersection of the ten-dimensional fuzzy conifold Y-F(10) with S-F(5) x S-F(5) is the compact eight-dimensional fuzzy space X-F(8). We show that X-F(8) is (the analogue of) a principal U(1) x U(1) bundle over fuzzy SU(3) / U(1) x U(1)) ( M-F(6)). We construct M-F(6) using the Gell-Mann matrices by adapting Schwinger's construction. The space M-F(6) is of relevance in higher dimensional quantum Hall effect and matrix models of D-branes. Further we show that the sections of the monopole bundle can be expressed in the basis of SU(3) eigenvectors. We construct the Dirac operator on M-F(6) from the Ginsparg-Wilson algebra on this space. Finally, we show that the index of the Dirac operator correctly reproduces the known results in the continuum.

Universal correction to higher spin entanglement entropy

We consider conformal field theories in 1 + 1 dimensions with W-algebra symmetries, deformed by a chemical potential mu for the spin-three current. We show that the order mu(2) correction to the Renyi and entanglement entropies of a single interval in the deformed theory, on the infinite spatial line and at finite temperature, is universal. The correction is completely determined by the operator product expansion of two spin-three currents, and by the expectation values of the stress tensor, its descendants and its composites, evaluated on the n-sheeted Riemann surface branched along the interval. This explains the recently found agreement of the order mu(2) correction across distinct free field CFTs and higher spin black hole solutions holographically dual to CFTs with W symmetry.

A Grassmann path from AdS(3) to flat space

We show that interpreting the inverse AdS(3) radius 1/l as a Grassmann variable results in a formal map from gravity in AdS(3) to gravity in flat space. The underlying reason for this is the fact that ISO(2, 1) is the Inonu-Wigner contraction of SO(2, 2). We show how this works for the Chern-Simons actions, demonstrate how the general (Banados) solution in AdS(3) maps to the general flat space solution, and how the Killing vectors, charges and the Virasoro algebra in the Brown-Henneaux case map to the corresponding quantities in the BMS3 case. Our results straightforwardly generalize to the higher spin case: the recently constructed flat space higher spin theories emerge automatically in this approach from their AdS counterparts. We conclude with a discussion of singularity resolution in the BMS gauge as an application.

Relative entropy in higher spin holography

We examine relative entropy in the context of the higher spin/CFT duality. We consider 3D bulk configurations in higher spin gravity which are dual to the vacuum and a high temperature state of a CFT with W-algebra symmetries in the presence of a chemical potential for a higher spin current. The relative entropy between these states is then evaluated using the Wilson line functional for holographic entanglement entropy. In the limit of small entangling intervals, the relative entropy should vanish for a generic quantum system. We confirm this behavior by showing that the difference in the expectation values of the modular Hamiltonian between the states matches with the difference in the entanglement entropy in the short-distance regime. Additionally, we compute the relative entropy of states corresponding to smooth solutions in the SL(2, Z) family with respect to the vacuum.

Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs

Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for intertask synchronization. For example, OpenMP 4.0 will integrate data-driven execution semantics derived from the StarSs research language. Compared to the more restrictive data-parallel and fork-join concurrency models, the advanced features being introduced into task-parallelmodels in turn enable improved scalability through load balancing, memory latency hiding, mitigation of the pressure on memory bandwidth, and, as a side effect, reduced power consumption. In this article, we develop a systematic approach to compile loop nests into concurrent, dynamically constructed graphs of dependent tasks. We propose a simple and effective heuristic that selects the most profitable parallelization idiom for every dependence type and communication pattern. This heuristic enables the extraction of interband parallelism (cross-barrier parallelism) in a number of numerical computations that range from linear algebra to structured grids and image processing. The proposed static analysis and code generation alleviates the burden of a full-blown dependence resolver to track the readiness of tasks at runtime. We evaluate our approach and algorithms in the PPCG compiler, targeting OpenStream, a representative dataflow task-parallel language with explicit intertask dependences and a lightweight runtime. Experimental results demonstrate the effectiveness of the approach.

A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).

3-D GPU Based Real Time Diffuse Optical Tomographic System

3-Dimensional Diffuse Optical Tomographic (3-D DOT) image reconstruction algorithm is computationally complex and requires excessive matrix computations and thus hampers reconstruction in real time. In this paper, we present near real time 3D DOT image reconstruction that is based on Broyden approach for updating Jacobian matrix. The Broyden method simplifies the algorithm by avoiding re-computation of the Jacobian matrix in each iteration. We have developed CPU and heterogeneous CPU/GPU code for 3D DOT image reconstruction in C and MatLab programming platform. We have used Compute Unified Device Architecture (CUDA) programming framework and CUDA linear algebra library (CULA) to utilize the massively parallel computational power of GPUs (NVIDIA Tesla K20c). The computation time achieved for C program based implementation for a CPU/GPU system for 3 planes measurement and FEM mesh size of 19172 tetrahedral elements is 806 milliseconds for an iteration.

Efficient QR Decomposition Using Low Complexity Column-wise Givens Rotation (CGR)

QR decomposition (QRD) is a widely used Numerical Linear Algebra (NLA) kernel with applications ranging from SONAR beamforming to wireless MIMO receivers. In this paper, we propose a novel Givens Rotation (GR) based QRD (GR QRD) where we reduce the computational complexity of GR and exploit higher degree of parallelism. This low complexity Column-wise GR (CGR) can annihilate multiple elements of a column of a matrix simultaneously. The algorithm is first realized on a Two-Dimensional (2 D) systolic array and then implemented on REDEFINE which is a Coarse Grained run-time Reconfigurable Architecture (CGRA). We benchmark the proposed implementation against state-of-the-art implementations to report better throughput, convergence and scalability.

Markov chains, R-trivial monoids and representation theory

We develop a general theory of Markov chains realizable as random walks on R-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via Mobius inversion along a lattice, a condition for diagonalizability of the transition matrix and some techniques for bounding the mixing time. In addition, we discuss several examples, such as Toom-Tsetlin models, an exchange walk for finite Coxeter groups, as well as examples previously studied by the authors, such as nonabelian sandpile models and the promotion Markov chain on posets. Many of these examples can be viewed as random walks on quotients of free tree monoids, a new class of monoids whose combinatorics we develop.