Mooij correlation in disordered metals

We point out that the Mooij correlation follows naturally from a dynamically disordered tight-binding Hamiltonian with random modulations of both the diagonal and the off-diagonal matrix elements which are known to act in opposition. The dynamic disorder is treated exactly while the static disorder is incorporated approximately as an effective additional time-dependent disorder affecting the diffusive electron. Such a time translation of static disorder is known to manifest itself in certain limits as a renormalization of the diffusion coefficient. The calculated conductivity exhibits the Mooij correlation at high temperatures, where quantum coherence associated with the static disorder can be ignored.

Nonadiabatic charge pumping by oscillating potentials in one dimension: Results for infinite system and finite ring

We study charge pumping when a combination of static potentials and potentials oscillating with a time period T is applied in a one-dimensional system of noninteracting electrons. We consider both an infinite system using the Dirac equation in the continuum approximation and a periodic ring with a finite number of sites using the tight-binding model. The infinite system is taken to be coupled to reservoirs on the two sides which are at the same chemical potential and temperature. We consider a model in which oscillating potentials help the electrons to access a transmission resonance produced by the static potentials and show that nonadiabatic pumping violates the simple sin phi rule which is obeyed by adiabatic two-site pumping. For the ring, we do not introduce any reservoirs, and we present a method for calculating the current averaged over an infinite time using the time evolution operator U(T) assuming a purely Hamiltonian evolution. We analytically show that the averaged current is zero if the Hamiltonian is real and time-reversal invariant. Numerical studies indicate another interesting result, namely, that the integrated current is zero for any time dependence of the potential if it is applied to only one site. Finally we study the effects of pumping at two sites on a ring at resonant and nonresonant frequencies, and show that the pumped current has different dependences on the pumping amplitude in the two cases.

Weber-Fechner type nonlinear behavior in zigzag edge graphene nanoribbons

Using a continuum Dirac theory, we study the density and spin response of zigzag edge-terminated graphene ribbons subjected to edge potentials and Zeeman fields. Our analytical calculations of the density and spin responses of the closed system (fixed particle number) to the static edge fields, show a highly nonlinear Weber-Fechner type behavior where the response depends logarithmically on the edge potential. The dependence of the response on the size of the system (e.g., width of a nanoribbon) is also uncovered. Zigzag edge graphene nanoribbons, therefore, provide a realization of response of organs such as the eye and ear that obey Weber-Fechner law. We validate our analytical results with tight-binding calculations. These results are crucial in understanding important effects of electron-electron interactions in graphene nanoribbons such as edge magnetism, etc., and also suggest possibilities for device applications of graphene nanoribbons.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

Armchair or Zigzag? A tool for characterizing graphene edge

Electronic, magnetic, and structural properties of graphene flakes depend sensitively upon the type of edge atoms. We present a simple software tool for determining the type of edge atoms in a honeycomb lattice. The algorithm is based on nearest neighbor counting. Whether an edge atom is of armchair or zigzag type is decided by the unique pattern of its nearest neighbors. Particular attention is paid to the practical aspects of using the tool, as additional features such as extracting out the edges from the lattice could help in analyzing images from transmission microscopy or other experimental probes. Ultimately, the tool in combination with density-functional theory or tight-binding method can also be helpful in correlating the properties of graphene flakes with the different armchair-to-zigzag ratios. Program summary Program title: edgecount Catalogue identifier: AEIA_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEIA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 66685 No. of bytes in distributed program, including test data, etc.: 485 381 Distribution format: tar.gz Programming language: FORTRAN 90/95 Computer: Most UNIX-based platforms Operating system: Linux, Mac OS Classification: 16.1, 7.8 Nature of problem: Detection and classification of edge atoms in a finite patch of honeycomb lattice. Solution method: Build nearest neighbor (NN) list; assign types to edge atoms on the basis of their NN pattern. Running time: Typically similar to second(s) for all examples. (C) 2010 Elsevier B.V. All rights reserved.

Bayesian Decentralized Spectrum Sensing in Cognitive Radio Networks

This paper considers the problem of spectrum sensing, i.e., the detection of whether or not a primary user is transmitting data by a cognitive radio. The Bayesian framework is adopted, with the performance measure being the probability of detection error. A decentralized setup, where N sensors use M observations each to arrive at individual decisions that are combined at a fusion center to form the overall decision is considered. The unknown fading channel between the primary sensor and the cognitive radios makes the individual decision rule computationally complex, hence, a generalized likelihood ratio test (GLRT)-based approach is adopted. Analysis of the probabilities of false alarm and miss detection of the proposed method reveals that the error exponent with respect to M is zero. Also, the fusion of N individual decisions offers a diversity advantage, similar to diversity reception in communication systems, and a tight bound on the error exponent is presented. Through an analysis in the low power regime, the number of observations needed as a function of received power, to achieve a given probability of error is determined. Monte-Carlo simulations confirm the accuracy of the analysis.

DNA polymerase alpha-primase complex from the silk glands of the non-mulberry silkworm Philosamia ricini.

The DNA content in the silk glands of the non-mulberry silkworm Philosamia ricini increases continuously during the fourth and fifth instars of larval development indicating high levels of DNA replication in this terminally differentiated tissue. Concomitantly, the DNA polymerase alpha activity also increases in the middle and the posterior silk glands during development, reaching maximal levels in the middle of the fifth larval instar. A comparable level of DNA polymerase delta/epsilon was also observed in this highly replicative tissue. The DNA polymerase alpha-primase complex from the silk glands of P. ricini has been purified to homogeneity by conventional column chromatography as well as by immunoaffinity techniques. The molecular mass of the native enzyme is 560 kDa and the enzyme comprises six non-identical subunits. The identity of the enzyme as DNA polymerase alpha has been established by its sensitivity to inhibitors such as aphidicolin, N-ethylmaleimide, butylphenyl-dGTP, butylanilino-dATP and antibodies to polymerase alpha. The enzyme possesses primase activity capable of initiating DNA synthesis on single-stranded DNA templates. The tight association of polymerase and primase activities at a constant ratio of 6:1 is observed through all the purification steps. The 180 kDa subunit harbours the polymerase activity, while the primase activity is associated with the 45 kDa subunit.

Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance

In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions in this paper are two-fold. First, we propose a low-complexity algorithm for large-MIMO detection based on a layered low-complexity local neighborhood search. Second, we obtain a lower bound on the maximum-likelihood (ML) bit error performance using the local neighborhood search. The advantages of the proposed ML lower bound are i) it is easily obtained for MIMO systems with large number of antennas because of the inherent low complexity of the search algorithm, ii) it is tight at moderate-to-high SNRs, and iii) it can be tightened at low SNRs by increasing the number of symbols in the neighborhood definition. Interestingly, the proposed detection algorithm based on the layered local search achieves bit error performances which are quite close to this lower bound for large number of antennas and higher-order QAM. For e. g., in a 32 x 32 V-BLAST MIMO system, the proposed detection algorithm performs close to within 1.7 dB of the proposed ML lower bound at 10(-3) BER for 16-QAM (128 bps/Hz), and close to within 4.5 dB of the bound for 64-QAM (192 bps/Hz).

The Shannon Cipher System With a Guessing Wiretapper: General Sources

The Shannon cipher system is studied in the context of general sources using a notion of computational secrecy introduced by Merhav and Arikan. Bounds are derived on limiting exponents of guessing moments for general sources. The bounds are shown to be tight for i.i.d., Markov, and unifilar sources, thus recovering some known results. A close relationship between error exponents and correct decoding exponents for fixed rate source compression on the one hand and exponents for guessing moments on the other hand is established.

Modification of photochemical reactivity on formation of inclusion complexes: photorearrangement of benzyl phenyl ethers and methyl phenoxyacetates

The photorearrangement of benzyl phenyl ethers and methyl phenoxyacetates was investigated in methanol and in complexes with cyclodextrin in both the solid state and aqueous solutions. Irradiation in cyclodextrin media leads to a large change in product distribution with a very significant ortho selectivity different from that found in methanol where the reaction is non-selective. For meta-substituted ethers and phenoxyacetates, an impressive regioselectivity between the two ortho-rearranged isomers is observed and this is significantly enhanced by increasing the substituent chain length which acts as a spacer to induce a tight fit between the host and the guest. The observed results are rationalized on the basis of specific orientations of the unsubstituted and meta-substituted ethers and phenoxyacetates in the cyclodextrin cavity.

On Walkup's class K (d) and a minimal triangulation of (S-3 (sic) S-1)(#3)

For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex-links are stacked (d - 1)-spheres. Kalai showed that for d >= 4, all connected members of K (d) are obtained from stacked d-spheres by finitely many elementary handle additions. According to a result of Walkup, the face vector of any triangulated 4-manifold X with Euler characteristic chi satisfies f(1) >= 5f(0) - 15/2 chi, with equality only for X is an element of K(4). Kuhnel observed that this implies f(0)(f(0) - 11) >= -15 chi, with equality only for 2-neighborly members of K(4). Kuhnel also asked if there is a triangulated 4-manifold with f(0) = 15, chi = -4 (attaining equality in his lower bound). In this paper, guided by Kalai's theorem, we show that indeed there is such a triangulation. It triangulates the connected sum of three copies of the twisted sphere product S-3 (sic) S-1. Because of Kuhnel's inequality, the given triangulation of this manifold is a vertex-minimal triangulation. By a recent result of Effenberger, the triangulation constructed here is tight. Apart from the neighborly 2-manifolds and the infinite family of (2d + 3)-vertex sphere products Sd-1 X S-1 (twisted for d odd), only fourteen tight triangulated manifolds were known so far. The present construction yields a new member of this sporadic family. We also present a self-contained proof of Kalai's result. (C) 2011 Elsevier B.V. All rights reserved.

Popular mixed matchings

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M, T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based on the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distribution over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P, Q) >= phi(Q, P) for all mixed matchings Q. We show that popular mixed matchings always exist and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem. (C) 2010 Elsevier B.V. All rights reserved.

Thiophene adsorption studies on clean and hydrogen-preadsorbed MoS2(100) surface

It is known from temperature-programmed desorption studies that the binding energy of thiophene over Mo/gamma-Al2O3 and Co-Mo/gamma-Al2O3, hydrodesulfurization catalysts, is lower in the presence of hydrogen. The adsorption of thiophene on clean and hydrogen-adsorbed MoS2 was modelled using extended Huckel tight binding band structure calculations. In the eta(1) adsorption configuration the calculations show a lower binding energy for adsorption on the hydrogen-preadsorbed surface similar to that observed experimentally. The lowering is due to an increased occupancy of the Mo density of states in the presence of hydrogen.

Real-time kinetic analysis of hCG-monoclonal antibody interaction using radiolabeled hCG probe: presence of two forms of Ag-mAb complex as revealed by solid phase dissociation studies

Real-time kinetics of ligand-ligate interaction has predominantly been studied by either fluorescence or surface plasmon resonance based methods. Almost all such studies are based on association between the ligand and the ligate. This paper reports our analysis of dissociation data of monoclonal antibody-antigen (hCG) system using radio-iodinated hCG as a probe and nitrocellulose as a solid support to immobilize mAb. The data was analyzed quantitatively for a one-step and a two-step model. The data fits well into the two-step model. We also found that a fraction of what is bound is non-dissociable (tight-binding portion (TBP)). The TBP was neither an artifact of immobilization nor does it interfere with analysis. It was present when the reaction was carried out in homogeneous solution in liquid phase. The rate constants obtained from the two methods were comparable. The work reported here shows that real-time kinetics of other ligand-ligate interaction can be studied using nitrocellulose as a solid support. (C) 2002 Elsevier Science B.V. All rights reserved.

Ab initio, DFT and transition state theory calculations on 1,2-HF, HCI and CIF elimination reactions from CH2F-CH2Cl

This paper reports ab intio, DFT and transition state theory (TST) calculations on HF, HCI and CIF elimination reactions from CH2Cl-CH2F molecule. Both the ground state and the transition state for HX elimination reactions have been optimized at HF, MP2 and DFT calculations with 6-31G*, 6-31G** and 6-311++G** basis sets. In addition, CCSD(T) single point calculations were carried out with MP2/6-311++G** optimized geometry for more accurate determination of the energies of the minima and transition state, compared to the other methods employed here. Classical barriers are converted to Arrhenius activation energy by TST calculations for comparisons with experimental results. The pre-exponential factors, A, calculated at all levels of theory are significantly larger than the experimental values. For activation energy, E-a DFT gives good results for HF elimination, within 4-8 W mol(-1) from experimental values. None of the methods employed, including CCSD(T), give comparable results for HCI elimination reactions. However, rate constants calculated by CCSD(T) method are in very good agreement with experiment for HCI elimination and they are in reasonable agreement for HF elimination reactions. Due to the strong correlation between A and E., the rate constants could be fit to a lower A and E-a (as given by experimental fitting, corresponding to a tight TS) or to larger A and E-a (as given by high level ab initio calculations, corresponding to a loose TS). The barrier for CIF elimination is determined to be 607 U mol(-1) at HF level and it is unlikely to be important for CH2FCH2Cl. Results for other CH2X-CH2Y (X,Y = F/Cl) are included for comparison.