Nonlinear Transport in Hybrid Polypyrrole-Gold Nanostructures

We have studied charge transport in nanometer scale films of polypyrrole (PPy) that were grown electrochemically onto discontinuous ultrathin films of gold. The gold films consisted of 100 nm size islands, separated from each other by nanometer-size gaps. The thickness of PPy can be varied from 30 to 200 nm. The I-V characteristics of these hybrid PPy-Au nanostructures show strong non-linearity at low temperatures, and in particular for the more insulating samples. The hopping transport is further verified from the log / versus V-1/4 plots. Furthermore, the I-V data follow an empirical relation dlog//dV(1/4) similar to T-1/2.

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

In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs

We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Theta(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Theta(root n) time units. We further extend our approach to a network with noisy links. While the refresh rate remains Theta(1) time units per sample, the delay increases to Theta(root n log n). The number of transmissions in both cases is Theta(n) per histogram sample. The achieved Theta(1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of Theta(1/log n) for histogram computation in noiseless networks. We achieve this by operating in the supercritical thermodynamic regime where large pathways for communication build up, but the network may have more than one component. The largest component however will have an arbitrarily large fraction of nodes in order to enable approximate computation of the histogram to the desired level of accuracy. Operation in the supercritical thermodynamic regime also reduces energy consumption. A key step in the proof of our achievability result is the construction of a connected component having bounded degree and any desired fraction of nodes. This construction may also prove useful in other communication settings on the random geometric graph.

Vapor-Pressure Of Calcium Corresponding To The Reduction Of Calcia By Aluminum

The equilibrium pressure of calcium corresponding to the reduction reaction 6CaO (s) + 2Al (l) half-arrow-right-over-half-arrow-left 3CaO.Al2O3 (s) + 3Ca (g) has been measured by Knudsen effusion - mass loss analysis in the temperature range 1190 - 1500 K. The measured vapour pressure can be expressed as a function of temperature by the relation: log p(Ca) (Pa) = -10,670/T + 9.267 The calcium generated is partially absorbed by aluminium to form an alloy. The equilibrium composition of the alloy at 1373 K was found to be 22 mol% Ca - 78 mol% Al. The measured vapour pressure is in good agreement with that computed from thermodynamic data.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

Impurity diffusion in bismuth single-crystals

Measurements of impurity diffusion of 86Rb, 90Sr, 133Ba, and 137Cs in single crystal Bi were carried out. Diffusion samples were prepared from single crystal Bi by ion implantation. About 1012-1013 ions were implanted, resulting in surface activities approx =104 cpm. After implantation, specimens were annealed for specified times at 220-265 deg C, and tracer penetration profiles were determined by an electrolytic method. A typical penetration profile for 137Cs in Bi showed a linear relationship for log C vs x in with Fick's law for volume diffusion. Laws of grain boundary diffusion were not obeyed and the order of magnitude of the penetration distances was much less than on a grain boundary mechanism. Results were interpreted in terms of a modified Fischer analysis using a kinetic trapping term. Effective half lengths for trapping at a twin boundary were determined for each impurity.

Remark on factorials that are products of factorials

In a paper published in 1993, Erdos proved that if n! = a! b!, where 1 < a a parts per thousand currency sign b, then the difference between n and b does not exceed 5 log log n for large enough n. In the present paper, we improve this upper bound to ((1 + epsilon)/ log 2) log log n and generalize it to the equation a (1)!a (2)! ... a (k) ! = n!. In a recent paper, F. Luca proved that n - b = 1 for large enough n provided that the ABC-hypothesis holds.

Some nonstandard error analysis of discontinuous Galerkin methods for elliptic problems

An a priori error analysis of discontinuous Galerkin methods for a general elliptic problem is derived under a mild elliptic regularity assumption on the solution. This is accomplished by using some techniques from a posteriori error analysis. The model problem is assumed to satisfy a GAyenrding type inequality. Optimal order L (2) norm a priori error estimates are derived for an adjoint consistent interior penalty method.

Locally checkable proofs

This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distributed algorithm: all nodes must accept a valid proof, and at least one node must reject an invalid proof. We focus on locally checkable proofs that can be verified with a constant-time distributed algorithm. For example, it is easy to prove that a graph is bipartite: the locally checkable proof gives a 2-colouring of the graph, which only takes 1 bit per node. However, it is more difficult to prove that a graph is not bipartite—it turns out that any locally checkable proof requires Ω(log n) bits per node. In this work we classify graph problems according to their local proof complexity, i.e., how many bits per node are needed in a locally checkable proof. We establish tight or near-tight results for classical graph properties such as the chromatic number. We show that the proof complexities form a natural hierarchy of complexity classes: for many classical graph problems, the proof complexity is either 0, Θ(1), Θ(log n), or poly(n) bits per node. Among the most difficult graph properties are symmetric graphs, which require Ω(n2) bits per node, and non-3-colourable graphs, which require Ω(n2/log n) bits per node—any pure graph property admits a trivial proof of size O(n2).

Optimal explicit terminal guidance for a launch vehicle

It is observed that general explicit guidance schemes exhibit numerical instability close to the injection point. This difficulty is normally attributed to the demand for exact injection which, in turn, calls for finite corrections to be enforced in a relatively short time. The deviations in vehicle state which need corrective maneuvers are caused by the off-nominal operating conditions. Hence, the onset of terminal instability depends on the type of off-nominal conditions encountered. The proposed separate terminal guidance scheme overcomes the above difficulty by minimizing a quadratic penalty on injection errors rather than demanding an exact injection. There is also a special requirement in the terminal phase for the faster guidance computations. The faster guidance computations facilitate a more frequent guidance update enabling an accurate terminal thrust cutoff. The objective of faster computations is realized in the terminal guidance scheme by employing realistic assumptions that are accurate enough for a short terminal trajectory. It is observed from simulations that one of the guidance parameters (P) related to the thrust steering angular rates can indicate the onset of terminal instability due to different off-nominal operating conditions. Therefore, the terminal guidance scheme can be dynamically invoked based on monitoring of deviations in the lone parameter P.

Bacteriophage therapy for Staphylococcus aureus bacteremia in streptozotocin-induced diabetic mice

The protective effect of bacteriophage was assessed against experimental Staphylococcus aureus lethal bacteremia in streptozotocin (STZ) induced-diabetic and non-diabetic mice. Intraperitoneal administrations of S. aureus (RCS21) of 2 x 10(8) CFU caused lethal bacteremia in both diabetic and non-diabetic mice. A single administration of a newly isolated lytic phage strain (GRCS) significantly protected diabetic and nondiabetic mice from lethal bacteremia (survival rate 90% and 100% for diabetic and non-diabetic bacteremic groups versus 0% for saline-treated groups). Comparison of phage therapy to oxacillin treatment showed a significant decrease in RCS21 of 5 and 3 log units in diabetic and nondiabetic bacteremic mice, respectively. The same protection efficiency of phage GRCS was attained even when the treatment was delayed up to 4 h in both diabetic and non-diabetic bacteremic mice. Inoculation of mice with a high dose (10(10) PFU) of phage GRCS alone produced no adverse effects attributable to the phage per se. These results suggest that phages could constitute valuable prophylaxis against S. aureus infections, especially in immunocompromised patients. (C) 2010 Institut Pasteur. Published by Elsevier Masson SAS. All rights reserved.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes, i.e. each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset where S is the ground set and P is a reflexive, anti-symmetric and transitive binary relation on S. The dimension of P, dim(P) is the minimum integer l such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with its extended double cover, denoted as G(c). Let P-c be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P-c) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension. In the other direction, using the already known bounds for partial order dimension we get the following: (I) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta) which is an improvement over the best known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0, unless NP=ZPP.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

A comparative-study of vapor-compression refrigeration working fluids, in the wake of the montreal protocal

A comparative study has been carried out of R-12, 22, 125, 134a, 152a, 218, 245, 500, 502, 507 and 717 as working fluids in a vapour-compression refrigeration system. Two performance parameters were defined, which are expressed in reduced quantities for a corresponding-states comparison of these refrigerants in the temperature range -20 to 50-degrees-C. One is based on the product of temperature drop to pressure penalty ratio and the available volumetric heat of vaporisation at the evaporator; the other considers the effect of isentropic compression in the ideal gas state. It was shown that R-125, 507 and 218 could be better alternatives to R-12 than R-134a. Among these, R-218 has a lower maximum cycle pressure.

Photocatalytic Inactivation of Escherichia coli with LbL Fabricated Immobilized TiO2 Thin Films

Photocatalysis using semiconductor catalyst such as TiO2, in presence of UV light, is a promising technique for the inactivation of various microorganisms present in water. In the current study, the photocatalytic inactivation of Escherichia coli bacteria was studied with commercial Degussa Aeroxide TiO2 P25 (Aeroxide) and combustion synthesized TiO2 (CS TiO2) catalysts immobilized on glass slides in presence of UV irradiation. Thin films of the catalyst and polyelectrolytes, poly(allyl amine hydrochloride) and poly(styrene sulfonate sodium salt), were deposited on glass slides by layer by layer (LbL) deposition method and characterized by SEM and AFM imaging. The effect of various parameters, namely, catalyst concentration, surface area and number of bilayers, on inactivation was studied. Maximum inactivation of 8-log reduction in the viable count was observed with 1.227 mg/cm(2) of catalyst loaded slides. With this loading, complete inactivation was observed within 90 min and 75 min of irradiation, for Aeroxide and CS TiO2, respectively. Further increase in the catalyst concentration or increasing number of bilayers had no significant effect on inactivation. The effect of surface area on the inactivation was studied by increasing the number of slides and the inactivation was observed to increase with increasing surface area. It was also observed that the immobilized catalyst slides can be used for several cycles leading to an economic process. The study shows potential application of TiO2, for the inactivation of bacteria, in its fixed form by a simple immobilization technique.