Quantum Dots and Nanoroads of Graphene Embedded in Hexagonal Boron Nitride

The quest for novel two-dimensional materials has led to the discovery of hybrids where graphene and hexagonal boron nitride (h-BN) occur as phase-separated domains. Using first-principles calculations, we study the energetics and electronic and magnetic properties of such hybrids in detail. The formation energy of quantum dot inclusions (consisting of n carbon atoms) varies as 1/root n, owing to the interface. The electronic gap between the occupied and unoccupied energy levels of quantum dots is also inversely proportional to the length scale, 1/root n-a feature of confined Dirac fermions. For zigzag nanoroads, a combination of the intrinsic electric field caused by the polarity of the h-BN matrix and spin polarization at the edges results in half-metallicity; a band gap opens up under the externally applied ``compensating'' electric field. For armchair nanoroads, the electron confinement opens the gap, different among three subfamilies due to different bond length relaxations at the interfaces, and decreasing with the width.

Recommendations for driver licensing and traffic law enforcement in India aiming to improve road safety

During the last decade, developing countries such as India have been exhibiting rapid increase in human population and vehicles, and increase in road accidents. Inappropriate driving behaviour is considered one of the major causes of road accidents in India as compared to defective geometric design of pavement or mechanical defects in vehicles. It can result in conditions such as lack of lane discipline, disregard to traffic laws, frequent traffic violations, increase in crashes due to self-centred driving, etc. It also demotivates educated drivers from following good driving practices. Hence, improved driver behaviour can be an effective countermeasure to reduce the vulnerability of road users and inhibit crash risks. This article highlights improved driver behaviour through better driver education, driver training and licensing procedures along with good on-road enforcement; as an effective countermeasure to ensure road safety in India. Based on the review and analysis, the article also recommends certain measures pertaining to driver licensing and traffic law enforcement in India aimed at improving road safety.

Local environmental structures of Mo in the superionic conducting glass (AgI)(0.6)(Ag2MoO4)(0.4) by anomalous X-ray scattering

The anomalous X-ray scattering (AXS) method using Mo K absorption edges has been employed for obtaining the local structural information of superionic conducting glass having the composition (AgI)(0.6)(Ag2MoO4)(0.4). The possible atomic arrangements in the near-neighbor region of this glass were estimated by coupling the results with the least-squares variational analysis so as to reproduce the differential intensity profile for Mo as well as the ordinary scattering profile. The coordination number of oxygen around Mo is found to be about 4 at the distance of 0.180 mn. This implies that the most probable structural entity in the glass is the MoO4 tetrahedral unit which has been proposed based on infrared spectroscopy. The value of the coordination number of I- around Ag+ is estimated as 4.4 at 0.287 nm, suggesting an arrangement similar to that of crystalline or molten AgI.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

Single-Generation Network Coding for Networks with Delay

A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding are forced to do inter-generation network coding, as a result of which the problem of some or all sinks requiring a large amount of memory for decoding is faced. In this work, we address this problem by utilizing memory elements at the internal nodes of the network also, which results in the reduction of the number of memory elements used at the sinks. We give an algorithm which employs memory at all the nodes of the network to achieve single- generation network coding. For fixed latency, our algorithm reduces the total number of memory elements used in the network to achieve single- generation network coding. We also discuss the advantages of employing single-generation network coding together with convolutional network-error correction codes (CNECCs) for networks with unit- delay and illustrate the performance gain of CNECCs by using memory at the intermediate nodes using simulations on an example network under a probabilistic network error model.

Data rectification and detection of trend shifts in jet engine path measurements using median filters and fuzzy logic

Filtering methods are explored for removing noise from data while preserving sharp edges that many indicate a trend shift in gas turbine measurements. Linear filters are found to be have problems with removing noise while preserving features in the signal. The nonlinear hybrid median filter is found to accurately reproduce the root signal from noisy data. Simulated faulty data and fault-free gas path measurement data are passed through median filters and health residuals for the data set are created. The health residual is a scalar norm of the gas path measurement deltas and is used to partition the faulty engine from the healthy engine using fuzzy sets. The fuzzy detection system is developed and tested with noisy data and with filtered data. It is found from tests with simulated fault-free and faulty data that fuzzy trend shift detection based on filtered data is very accurate with no false alarms and negligible missed alarms.

Acyclic Edge-Coloring of Planar Graphs

A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].

Nanotubes of the disulfides of groups 4 and 5 metals

The layered chalcogenides, having structures analogous to graphite, are known to be unstable toward bending and show high propensity to form curved structures, thus eliminating dangling bonds at the edges. Since the discovery of fullerene and nanotube structures of WS2 and MoS2 by Tenne et al. [1-3], there have been attempts to prepare and characterize nanotubes of other layered dichalcogenides with structures analogous to MoS2. Nanotubes of MoS2 and WS2 were prepared by Tenne et al. by reducing the corresponding oxides to the suboxides followed by heating in an atmosphere of forming gas (5 % H-2 + 95 % N-2) and H2S at 700-900 degreesC [1-3]. Alternative methods of synthesis of MoS2 and WS2 nanotubes have since been proposed by employing the decomposition of the ammonium thiometallates or the corresponding trisulfide precursors. This alternative procedure was based on the observation that the trisulfide seems to be formed as an intermediate in the synthesis of the MoS2 and WS2 nanotubes [4]. Accordingly, the decomposition of the trisulfides of MoS2 and W in a reducing atmosphere directly yielded nanotubes of the disulfides MoS2 and WS2 [5]. In this article, we describe the synthesis, structure, and characterization of a few novel nanotubes of the disulfides of groups 4 and 5 metals. These include nanotubes of NbS2, TaS2, ZrS2, and HfS2. The study enlarges the scope of the inorganic nanotubes significantly and promises other interesting possibilities, including the synthesis of the diselenide nanotubes of these metals.

Organically templated linear and layered cadmium sulfates

By reacting cadmium salts with H2SO4 in the presence of organic amines or directly with amine sulfates under hydrothermal conditions, it has been possible to prepare three linear cadmium sulfates of linarite topology, with the compositions [H3N(CH2)(2)NH3](2)[CdCl2(SO4)][SO4].H2O, I, [HN(CH2)(6)NH][CdBr2(SO4)], II, [HN(CH2)(6)NH][CdCl2-(SO4)], III. A layered cadmium sulfate of composition [H3N(CH2)(3)NH3][Cd-2(H2O)(2)(SO4)(3)], IV, has also been obtained. These sulfates are the first examples of a family of organically templated metal sulfates with interesting structural features. In the linarite chains, the CdX4O2 (X = Cl, Br) octahedron shares two trans-edges to form an [Mphi(4)] (phi = anionic ligand) chain decorated by the SO4 tetrahedron that adopts a staggered arrangement on either side of the chain. IV is constructed by the fusion of four-membered ring ladders involving edge sharing between the sulfate tetrahedron and metal octahedron. IV appears to be the first member of a family of organically templated metal sulfates containing an octahedral-tetrahedral 2D net wherein the sulfate tetrahedron is connected at all four corners.

Optical and Electronic Properties of Conjugated Polymer -Nanocluster Semiconductor Hybrid Systems

Conjugated polymers are intensively pursued as candidate materials for emission and detection devices with the optical range of interest determined by the chemical structure. On the other hand the optical range for emission and detection can also be tuned by size selection in semiconductor nanoclusters. The mechanisms for charge generation and separation upon optical excitation, and light emission are different for these systems. Hybrid systems based on these different class of materials reveal interesting electronic and optical properties and add further insight into the individual characteristics of the different components. Multilayer structures and blends of these materials on different substrates were prepared for absorption, photocurrent (Iph), photoluminescence (PL) and electroluminscence (EL) studies. Polymers chosen were derivatives of polythiophene (PT) and polyparaphenylenevinylene (PPV) along with nanoclusters of cadmium sulphide of average size 4.4 nm (CdS-44). The photocurrent spectral response in these systems followed the absorption response around the band edges for each of the components and revealed additional features, which depended on bias voltage, thickness of the layers and interfacial effects. The current-voltage curves showed multi-component features with emission varying for different regimes of voltage. The emission spectral response revealed additive features and is discussed in terms of excitonic mechanisms.

On synthesis of easily testable (k, K) circuits

A (k-, K) circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no more than K external inputs, such that the graph formed by letting each block be a node and inserting edges between blocks if they share a signal line, is a partial k-tree. (k, K) circuits are special in that they have been shown to be testable in time polynomial in the number of gates in the circuit, and are useful if the constants k and K are small. We demonstrate a procedure to synthesise (k, K) circuits from a special class of Boolean expressions.

Rainbow Connection Number and Radius

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r+2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that, for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (K_{1,n} for instance). We further show that for every bridgeless graph G with radius r and chordality (size of a largest induced cycle) k, rc(G) <= rk. Hitherto, the only reported upper bound on the rainbow connection number of bridgeless graphs is 4n/5 - 1, where n is order of the graph [Caro et al., 2008]

Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.

Bounded Unpopularity Matchings

We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal way of matching people to jobs? Here we consider the notion of popularity. A matching M is popular if there is no matching M' such that more people prefer M' to M than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied by Abraham et al. (SIAM J. Comput. 37(4):1030-1045, 2007). If there is no popular matching, a reasonable substitute is a matching whose unpopularity is bounded. We consider two measures of unpopularity-unpopularity factor denoted by u(M) and unpopularity margin denoted by g(M). McCutchen recently showed that computing a matching M with the minimum value of u(M) or g(M) is NP-hard, and that if G does not admit a popular matching, then we have u(M) >= 2 for all matchings M in G. Here we show that a matching M that achieves u(M) = 2 can be computed in O(m root n) time (where m is the number of edges in G and n is the number of nodes) provided a certain graph H admits a matching that matches all people. We also describe a sequence of graphs: H = H(2), H(3), ... , H(k) such that if H(k) admits a matching that matches all people, then we can compute in O(km root n) time a matching M such that u(M) <= k - 1 and g(M) <= n(1 - 2/k). Simulation results suggest that our algorithm finds a matching with low unpopularity in random instances.

Continued self-similar breakup of drops in viscous continuous phase in agitated vessels

Drop breakup inviscous liquids in agitated vessels occurs in elongational flow around impeller blade edges. The drop size distributions measured over extended periods for impellers of different sizes show that breakup process continues up to 15-20 h, before a steady state is reached. The size distributions evolve in a self-similar way till the steady state is reached. The scaled size distributions vary with impeller size and impeller speed, in contrast with the near universal scaling known for drop breakup in turbulent flows. The steady state size of the largest drop follows inverse scaling with impeller tip velocity. The breadth of the scaled size distributions also shows a monotonic relationship with impeller tip velocity only. (C) 2011 Elsevier Ltd. All rights reserved.