A Gibbs-ensemble based technique for Monte Carlo simulation of electric double layer capacitors (EDLC) at constant voltage

Current methods for molecular simulations of Electric Double Layer Capacitors (EDLC) have both the electrodes and the electrolyte region in a single simulation box. This necessitates simulation of the electrode-electrolyte region interface. Typical capacitors have macroscopic dimensions where the fraction of the molecules at the electrode-electrolyte region interface is very low. Hence, large systems sizes are needed to minimize the electrode-electrolyte region interfacial effects. To overcome these problems, a new technique based on the Gibbs Ensemble is proposed for simulation of an EDLC. In the proposed technique, each electrode is simulated in a separate simulation box. Application of periodic boundary conditions eliminates the interfacial effects. This in addition to the use of constant voltage ensemble allows for a more convenient comparison of simulation results with experimental measurements on typical EDLCs. (C) 2014 AIP Publishing LLC.

Flame surface statistics of constant-pressure turbulent expanding premixed flames

In this paper we investigate the local flame surface statistics of constant-pressure turbulent expanding flames. First the statistics of local length ratio is experimentally determined from high-speed planar Mie scattering images of spherically expanding flames, with the length ratio on the measurement plane, at predefined equiangular sectors, defined as the ratio of the actual flame length to the length of a circular-arc of radius equal to the average radius of the flame. Assuming isotropic distribution of such flame segments we then convolute suitable forms of the length-ratio probability distribution functions (pdfs) to arrive at the corresponding area-ratio pdfs. It is found that both the length ratio and area ratio pdfs are near log-normally distributed and shows self-similar behavior with increasing radius. Near log-normality and rather intermittent behavior of the flame-length ratio suggests similarity with dissipation rate quantities which stimulates multifractal analysis. (C) 2014 AIP Publishing LLC.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Upper Bounds on the Size of Grain-Correcting Codes

In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature.

On Precoding for Constant K-User MIMO Gaussian Interference Channel With Finite Constellation Inputs

This paper considers linear precoding for the constant channel-coefficient K-user MIMO Gaussian interference channel (MIMO GIC) where each transmitter-i (Tx-i) requires the sending of d(i) independent complex symbols per channel use that take values from fixed finite constellations with uniform distribution to receiver-i (Rx-i) for i = 1, 2, ..., K. We define the maximum rate achieved by Tx-i using any linear precoder as the signal-to-noise ratio (SNR) tends to infinity when the interference channel coefficients are zero to be the constellation constrained saturation capacity (CCSC) for Tx-i. We derive a high-SNR approximation for the rate achieved by Tx-i when interference is treated as noise and this rate is given by the mutual information between Tx-i and Rx-i, denoted as I(X) under bar (i); (Y) under bar (i)]. A set of necessary and sufficient conditions on the precoders under which I(X) under bar (i); (Y) under bar (i)] tends to CCSC for Tx-i is derived. Interestingly, the precoders designed for interference alignment (IA) satisfy these necessary and sufficient conditions. Furthermore, we propose gradient-ascentbased algorithms to optimize the sum rate achieved by precoding with finite constellation inputs and treating interference as noise. A simulation study using the proposed algorithms for a three-user MIMO GIC with two antennas at each node with d(i) = 1 for all i and with BPSK and QPSK inputs shows more than 0.1-b/s/Hz gain in the ergodic sum rate over that yielded by precoders obtained from some known IA algorithms at moderate SNRs.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Combinatorial effect of rolling and carbonaceous nanoparticles on the evolution of crystallographic texture and structural properties of ultra high molecular weight polyethylene

Ultra high molecular weight polyethylene (PE) is a structural polymer widely used in biomedical implants. The mechanical properties of PE can be improved either by controlled crystalline orientation (texture) or by the addition of reinforcing agents. However, the combinatorial effect has not received much attention. The objective of this study was to characterize the structure and mechanical properties of PE composites incorporating multiwall carbon nanotubes (MWCNT) and reduced graphene oxide (RGO) subjected to hot rolling. The wide angle X-ray diffraction studies revealed that mechanical deformation resulted in a mixture of orthorhombic and monoclinic crystals. Furthermore, the presence of nanoparticles resulted in lower crystallinity in PE with smaller crystallite size, more so in RGO than in MWCNT composites. Rolling strengthened the texture of both orthorhombic and the monoclinic phases in PE. Presence of RGO weakened the texture of both phases of PE after rolling whereas MWCNT only mildly weakened the texture. This resulted in a reduction in the elastic modulus of RGO composites whereas moduli of neat polymer and the MWCNT composite increased after rolling. This study provides new insight into the role of nanoparticles in texture evolution during polymer processing with implications for processing of structural polymer composites.

OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

Strategy for Enhancing the Dielectric Constant of Organic Semiconductors Without Sacrificing Charge Carrier Mobility and Solubility

Current organic semiconductors for organic photovoltaics (OPV) have relative dielectric constants (relative permittivities, epsilon(r)) in the range of 2-4. As a consequence, Coulombically bound electron-hole pairs (excitons) are produced upon absorption of light, giving rise to limited power conversion efficiencies. We introduce a strategy to enhance epsilon(r) of well-known donors and acceptors without breaking conjugation, degrading charge carrier mobility or altering the transport gap. The ability of ethylene glycol (EG) repeating units to rapidly reorient their dipoles with the charge redistributions in the environment was proven via density functional theory (DFT) calculations. Fullerene derivatives functionalized with triethylene glycol side chains were studied for the enhancement of epsilon(r) together with poly(p-phenylene vinylene) and diketo-pyrrolopyrrole based polymers functionalized with similar side chains. The polymers showed a doubling of epsilon(r) with respect to their reference polymers in identical backbone. Fullerene derivatives presented enhancements up to 6 compared with phenyl-C-61-butyric acid methyl ester (PCBM) as the reference. Importantly, the applied modifications did not affect the mobility of electrons and holes and provided excellent solubility in common organic solvents.

Experimental Characterization and Control of Miniaturized Pneumatic Artificial Muscle

Robotic surgical tools used in minimally invasive surgeries (MIS) require miniaturized and reliable actuators for precise positioning and control of the end-effector. Miniature pneumatic artificial muscles (MPAMs) are a good choice due to their inert nature, high force to weight ratio, and fast actuation. In this paper, we present the development of miniaturized braided pneumatic muscles with an outer diameter of similar to 1.2 mm, a high contraction ratio of about 18%, and capable of providing a pull force in excess of 4 N at a supply pressure of 0.8 MPa. We present the details of the developed experimental setup, experimental data on contraction and force as a function of applied pressure, and characterization of the MPAM. We also present a simple kinematics and experimental data based model of the braided pneumatic muscle and show that the model predicts contraction in length to within 20% of the measured value. Finally, a robust controller for the MPAMs is developed and validated with experiments and it is shown that the MPAMs have a time constant of similar to 10 ms thereby making them suitable for actuating endoscopic and robotic surgical tools.

A Matroidal Framework for Network-Error Correcting Codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of matroids. Furthermore, it was shown through the connection between network coding and matroid theory that linear network coding is not always sufficient for general network coding scenarios. The current work attempts to establish a connection between matroid theory and network-error correcting and detecting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of linear network-error detecting codes to arrive at the definition of a matroidal error detecting network (and similarly, a matroidal error correcting network abstracting from network-error correcting codes). An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error detecting (correcting) network code if and only if it is a matroidal error detecting (correcting) network associated with a representable matroid. Therefore, constructing such network-error correcting and detecting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa. We then present algorithms that enable the construction of matroidal error detecting and correcting networks with a specified capability of network-error correction. Using these construction algorithms, a large class of hitherto unknown scalar linearly solvable networks with multisource, multicast, and multiple-unicast network-error correcting codes is made available for theoretical use and practical implementation, with parameters, such as number of information symbols, number of sinks, number of coding nodes, error correcting capability, and so on, being arbitrary but for computing power (for the execution of the algorithms). The complexity of the construction of these networks is shown to be comparable with the complexity of existing algorithms that design multicast scalar linear network-error correcting codes. Finally, we also show that linear network coding is not sufficient for the general network-error correction (detection) problem with arbitrary demands. In particular, for the same number of network errors, we show a network for which there is a nonlinear network-error detecting code satisfying the demands at the sinks, whereas there are no linear network-error detecting codes that do the same.

On flame-turbulence interaction in constant-pressure expanding flames

In this paper we present one of the first high-speed particle image velocimetry measurements to quantify flame-turbulence interaction in centrally-ignited constant-pressure premixed flames expanding in nearisotropic turbulence. Measurements of mean flow velocity and rms of fluctuating flow velocity are provided over a range of conditions both in the presence and absence of the flame. The distributions of stretch rate contributions from different terms such as tangential straining, normal straining and curvature are also provided. It is found that the normal straining displays non-Gaussian pdf tails whereas the tangential straining shows near Gaussian behavior. We have further tracked the motion of the edge points that reside and co-move with the edge of the flame kernel during its evolution in time, and found that within the measurement conditions, on average the persistence time scales of stretch due to pure curvature exceed that due to tangential straining by at least a factor of two. (C) 2014 The Combustion Institute. Published by Elsevier Inc. All rights reserved.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d) regenerating code has been characterized under functional repair (FR), the case of exact repair (ER) remains unresolved. It is known that there do not exist ER codes which lie on the FR tradeoff at most of the points. The question as to whether one can asymptotically approach the FR tradeoff was settled recently by Tian who showed that in the (4, 3, 3) case, the ER region is bounded away from the FR region. The FR tradeoff serves as a trivial outer bound on the ER tradeoff. In this paper, we extend Tian's results by establishing an improved outer bound on the ER tradeoff which shows that the ER region is bounded away from the FR region, for any (n; k; d). Our approach is analytical and builds upon the framework introduced earlier by Shah et. al. Interestingly, a recently-constructed, layered regenerating code is shown to achieve a point on this outer bound for the (5, 4, 4) case. This represents the first-known instance of an optimal ER code that does not correspond to a point on the FR tradeoff.

Enhanced photocatalytic efficiency of AuPd nanoalloy decorated ZnO-reduced graphene oxide nanocomposites

Inhibition of electron-hole pair recombination is the most desirable solution for stimulating photocatalytic activity in semiconductor nanostructures. To implement this, herein we study the photocatalytic efficiency of elemental Au, Pd and bimetallic AuPd nanoalloy decorated pristine and reduced graphene oxide (RGO) hybridized ZnO nanorods for degrading rhodamine 6G (R6G) dye. Fabrication of Au, Pd and AuPd nanoalloy on pristine and RGO modified ZnO nanorods is simple and more importantly surfactant or polymer free. AuPd nanoalloyed ZnO-RGO nanocomposites exhibit higher photocatalytic activity for degrading dye than both Au and Pd hybridized ones, indicating the promising potential of bimetallic nanoalloys over elemental components. A non-monotonic dependence on the composite composition was found by analyzing photodegradation efficiency of a series of ZnO-RGO-AuPd hybrid nanostructures with different weight percentages of RGO. The hybrid nanostructure ZnO-RGO (5 wt%)-AuPd (1 wt%) exhibits highest photodegradation efficiency (similar to 100% degradation in 20 min) with an improvement in rate constant (k) by a factor of 10 compared to that of the ZnO-RGO nanocomposite. The enhancement of the photocatalytic activity is attributed to the better separation of photogenerated charge carriers in photocatalysts thereby suggesting possible usefulness in a broad range of applications, such as sensing, photocatalysis and solar energy conversion.

Studies on the effects of varying secondary gas properties in a low entrainment ratio supersonic ejector

A dilution cum purge ejector for application in fuel cells represents a domain of ejector operation involving low entrainment ratio with differing secondary and primary gas; which is hardly investigated and a cohesive design framework is not readily available. We comprehensively study a constant area ejector using analytical, experimental and numerical tools at low entrainment ratio (0.004-0.065) with Air, Helium and Argon as secondary gas while the primary gas is Air. For the first time, limits of operating parameters used in control volume method to design the ejector are found to be highly dependent on the secondary molecular weight. The entrainment ratio in the ejector (low for Helium and high for Argon) is affected by the molecular weight and the static pressure within the ejector (low for Air and high for Argon & Helium) by the gamma of the secondary gas. Sufficient suction pressure (0.3-0.55 bar) is generated by the ejector thereby preventing any backflow of secondary gas at all primary stagnation pressures (1.5, 2.2 and 3.1 bar). Numerical results agree well with experimental results. The ejector is shown to completely dilute and purge the secondary flow, meeting all key design requirements. (C) 2014 Elsevier Ltd. All rights reserved.