Tailoring of Structural Morphology of Silver Nanowires in Electrochemical Growth

Noble metal such as Ag normally exists in an fcc crystal structure. However as the size of the material is decreased to nanometer lengthscales, a structural transformation from that of its bulk state can be expected with new atomic arrangements due to competition between internal packing and minimization of surface energy. In many previous studies, it has been shown that silver nanowires (AGNWs) grown inside anodic alumina (AAO) templates by ac or dc electrochemical deposition from silver salts or complexes, adopt fcc structure and below some critical diameter ∼ 20 nm they may acquire hcp structure at low temperature. This is, however, critically dependant on the nature of confinement, as AgNWs grown inside nanotube confinement with subnanometer diameter have been reported to have fcc structure. Hence the question of the crystal structure of metal nanowires under combined influence of confinement, temperature and deposition condition remains open. In this abstract we show that the alternative crystal structures of AGNWs at room temperature can be achieved with electrochemical growth processes under specific conditions determined by the deposition parameters and nature of confinement. We fabricated AgNWs of 4H hexagonal structure with diameters 30 – 80 nm inside polycarbonate (PC) templates with a modified dc electrodeposition technique, where the nanowires were grown at deposition potentials as low as 10 mV in 2 M silver nitrate solution[1]. We call this low-potential electrodeposition (LPED) since the electrodeposition process occurs at potential much less than the standard Nernst potential (770 mV) of silver. Two types of electrodes were used – stainless steel and sputtered thin Pt film, neither of which had any influence on the crystal structure of the nanowires. EDS elemental analysis showed the nanowires to consist only of silver. Although the precise atomic dynamics during the LPED process is unclear at present, we investigated this with HRTEM (high-resolution transmission electron microscopy) characterization of nanowires grown over various deposition times, as well as electrical conductivity measurements. These experiments indicate that nanowire growth does not occur through a three-dimensional diffusion controlled process, as proposed for conventional over-potential deposition, but follow a novel instantaneous linear growth mechanism. Further experiments showed that, (a) conventional electrochemical growth at a small over-potential in a 2 mM AgNO3 solution yields nanowires with expected fcc structure inside the same PC templates, and (2) no nanowire was observed under the LPED conditions inside hard AAO templates, indicating that LPED-growth process, and hcp structure of the corresponding nanowires depend on deposition parameters, as well as nature of confinement.

Understanding the building-up process of three dimensional open-framework metal phosphates: Acid degradation of the 3D structures to lower dimensional structures

Acid degradation of 3D zinc phosphates primarily yields a one-dimensional ladder compound, an observation that is significant considering that the latter forms 3D structures on heating in water.

An investigation of carbon nanotubes obtained from the decomposition of methane over reduced Mg1− xM xAl2O4 spinel catalysts

Carbon nanotubes produced by the treatment of Mg1−xMxAl2O4 (M = Fe, Co, or Ni; x = 0.1, 0.2, 0.3, or 0.4) spinels with an H2–CH4 mixture at 1070 °C have been investigated systematically. The grains of the oxide-metal composite particles are uniformly covered by a weblike network of carbon nanotube bundles, several tens of micrometers long, made up of single-wall nanotubes with a diameter close to 4 nm. Only the smallest metal particles (<5 nm) are involved in the formation of the nanotubes. A macroscopic characterization method involving surface area measurements and chemical analysis has been developed in order to compare the different nanotube specimens. An increase in the transition metal content of the catalyst yields more carbon nanotubes (up to a metal content of 10.0 wt% or x = 0.3), but causes a decrease in carbon quality. The best compromise is to use 6.7 wt% of metal (x = 0.2) in the catalyst. Co gives superior results with respect to both the quantity and quality of the nanotubes. In the case of Fe, the quality is notably hampered by the formation of Fe3C particles.

Cyclometalated complexes derived from calix[4] arene bisphosphites and their catalytic applications in cross-coupling reactions

Palladium and platinum dichloride complexes of a series of symmetrically and unsymmetrically substituted 25,26;27,28-dibridged p-tert-butyl-calix[4]arene bisphosphites in which two proximal phenolic oxygen atoms of p-tert-butyl-or p-H-calix[4]arene are connected to a P(OR) ( R = substituted phenyl) moiety have been synthesized. The palladium dichloride complexes of calix[4]arene bisphosphites bearing sterically bulky aryl substituents undergo cyclometalation by C-C or C-H bond scission. An example of cycloplatinated complex is also reported. The complexes have been characterized by NMR spectroscopic and single crystal X-ray diffraction studies. During crystallization of the palladium dichloride complex of a symmetrically substituted calix[4]arene bisphosphite in dichloromethane, insertion of oxygen occurs into the Pd-P bond to give a P,O-coordinated palladium dichloride complex. The calix[4]arene framework in these bisphosphites and their metal complexes adopt distorted cone conformation; the cone conformation is more flattened in the metal complexes than in the free calix[4]arene bisphosphites. Some of these cyclometalated complexes proved to be active catalysts for Heck and Suzuki C-C cross-coupling reactions but, on an average, the yields are only modest. (C) 2011 Elsevier B.V. All rights reserved.

Optimal local polynomial regression of noisy time varying signals

We address the problem of local-polynomial modeling of smooth time-varying signals with unknown functional form, in the presence of additive noise. The problem formulation is in the time domain and the polynomial coefficients are estimated in the pointwise minimum mean square error (PMMSE) sense. The choice of the window length for local modeling introduces a bias-variance tradeoff, which we solve optimally by using the intersection-of-confidence-intervals (ICI) technique. The combination of the local polynomial model and the ICI technique gives rise to an adaptive signal model equipped with a time-varying PMMSE-optimal window length whose performance is superior to that obtained by using a fixed window length. We also evaluate the sensitivity of the ICI technique with respect to the confidence interval width. Simulation results on electrocardiogram (ECG) signals show that at 0dB signal-to-noise ratio (SNR), one can achieve about 12dB improvement in SNR. Monte-Carlo performance analysis shows that the performance is comparable to the basic wavelet techniques. For 0 dB SNR, the adaptive window technique yields about 2-3dB higher SNR than wavelet regression techniques and for SNRs greater than 12dB, the wavelet techniques yield about 2dB higher SNR.

Network Coding for TCP Throughput Enhancement over a Multi-Hop wireless Network

The poor performance of TCP over multi-hop wireless networks is well known. In this paper we explore to what extent network coding can help to improve the throughput performance of TCP controlled bulk transfers over a chain topology multi-hop wireless network. The nodes use a CSMA/ CA mechanism, such as IEEE 802.11’s DCF, to perform distributed packet scheduling. The reverse flowing TCP ACKs are sought to be X-ORed with forward flowing TCP data packets. We find that, without any modification to theMAC protocol, the gain from network coding is negligible. The inherent coordination problem of carrier sensing based random access in multi-hop wireless networks dominates the performance. We provide a theoretical analysis that yields a throughput bound with network coding. We then propose a distributed modification of the IEEE 802.11 DCF, based on tuning the back-off mechanism using a feedback approach. Simulation studies show that the proposed mechanism when combined with network coding, improves the performance of a TCP session by more than 100%.

Numerical modeling of the contaminant Transport through stratified soil

The transport processes of the dissolved chemicals in stratified or layered soils have been studied for several decades. In case of the solute transport through stratified layers, interface condition plays an important role in determining appropriate transport parameters. First‐ type and third‐ type interface conditions are generally used in the literature. A first‐type interface condition will result in a continuous concentration profile across the interface at the expense of solute mass balance. On the other hand, a discontinuity in concentration develops when a third‐ type interface condition is used. To overcome this problem, a combined first‐ and third‐ type condition at the interface has been widely employed which yields second‐ type condition. This results in a similar break‐through curve irrespective of the layering order, which is non‐physical. In this work, an interface condition is proposed which satisfies the mass balance implicitly and brings the distinction between the breakthrough curves for different layering sequence corroborating with the experimental observations. This is in disagreement with the earlier work by H. M. Selim and co‐workers but, well agreement with the hypothetical result by Bosma and van der Zee; and Van der Zee.

Embedded Foundations Under Vertical Vibration

In this note, a simplified procedure based on energy consideration, has been developed, for the solution of steady-state vibration of a system with combined viscous and Coulomb friction damping, subjected to frequency in dependent and frequency dependent excitation, which yields results essentially same as the exact solution. The proposed method uses results essentially same as the exact solution. The proposed method uses equivalent damping which assumes that if the damping in a system is small, the total damping effect can be represented by that of an equivalent damper.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

A Combinatorial Family of Near Regular LDPC Codes

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.

An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where |E| = m and c is the maximum u-vedge connectivity, where u,v ∈ V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n-1; so the expected running time of our algorithm for simple unweighted graphs is Õ(mn).All the algorithms currently known for constructing a Gomory-Hu tree [8,9] use n-1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest Õ(n20/9) max flow algorithm due to Karger and Levine [11] yields the current best running time of Õ(n20/9n) for Gomory-Hu tree construction on simpleunweighted graphs with m edges and n vertices. Thus we present the first Õ(mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs.We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S ⊆ V can be reused for computing a minimum Steiner cut for certain Steiner sets S' ⊆ S.

Filtered density function for large eddy simulation of turbulent reacting flows

A methodology termed the “filtered density function” (FDF) is developed and implemented for large eddy simulation (LES) of chemically reacting turbulent flows. In this methodology, the effects of the unresolved scalar fluctuations are taken into account by considering the probability density function (PDF) of subgrid scale (SGS) scalar quantities. A transport equation is derived for the FDF in which the effect of chemical reactions appears in a closed form. The influences of scalar mixing and convection within the subgrid are modeled. The FDF transport equation is solved numerically via a Lagrangian Monte Carlo scheme in which the solutions of the equivalent stochastic differential equations (SDEs) are obtained. These solutions preserve the Itô-Gikhman nature of the SDEs. The consistency of the FDF approach, the convergence of its Monte Carlo solution and the performance of the closures employed in the FDF transport equation are assessed by comparisons with results obtained by direct numerical simulation (DNS) and by conventional LES procedures in which the first two SGS scalar moments are obtained by a finite difference method (LES-FD). These comparative assessments are conducted by implementations of all three schemes (FDF, DNS and LES-FD) in a temporally developing mixing layer and a spatially developing planar jet under both non-reacting and reacting conditions. In non-reacting flows, the Monte Carlo solution of the FDF yields results similar to those via LES-FD. The advantage of the FDF is demonstrated by its use in reacting flows. In the absence of a closure for the SGS scalar fluctuations, the LES-FD results are significantly different from those based on DNS. The FDF results show a much closer agreement with filtered DNS results. © 1998 American Institute of Physics.

Hexa-arm star shaped hydrazone derivatives from hexakis(4-formylphenoxy)-cyclotriphosphazene core

A series of novel hexasubstituted cyclophosphazene hydrazones [N(3)P(3)(-OC(6)H(4)-p-CH=N-NH-C(O)-C(6)H(4)-p-X)(6)] (X = H, Br, Cl, F, OH, OCH(3), CH(3), NO(2), NH(2)) were prepared by a sixfold condensation reaction of [N(3)P(3)(-OC(6)H(4)-p-CHO)(6)] with para-substituted benzoic hydrazides [NH(2)-NH-C(O)-C(6)H(4)-p-X] with excellent yields (91-98%). The structures of the compounds were confirmed by elemental analysis, FT-IR, (1)H, (13)C, (31)P, 2D-HSQC NMR and mass spectrometry (MALDI-TOF). All the synthesized cyclophosphazene hydrazones exhibit high thermal stability. The crystal structure of a homogeneously substituted hexakis(4-formylphenoxy)-cyclotriphosphazene was determined by X-ray diffraction analysis. The compound crystallizes in the monoclinic system, space group P2(1)/n with a = 16.558(3) angstrom, b = 10.250(2) angstrom, c = 23.429(5) angstrom, alpha = gamma = 90.00 degrees, beta = 90.461(4)degrees, V = 3976.5(14) angstrom(3) and Z = 4. The R value is 0.0823 for 4290 observed reflections. The conformations of the 4-formylphenoxy-groups are different at the three phosphorus atoms. (C) 2011 Elsevier B.V. All rights reserved.

Optimal association of mobile wireless devices with a WLAN-3G access network

In this paper, we consider the problem of association of wireless stations (STAs) with an access network served by a wireless local area network (WLAN) and a 3G cellular network. There is a set of WLAN Access Points (APs) and a set of 3G Base Stations (BSs) and a number of STAs each of which needs to be associated with one of the APs or one of the BSs. We concentrate on downlink bulk elastic transfers. Each association provides each ST with a certain transfer rate. We evaluate an association on the basis of the sum log utility of the transfer rates and seek the utility maximizing association. We also obtain the optimal time scheduling of service from a 3G BS to the associated STAs. We propose a fast iterative heuristic algorithm to compute an association. Numerical results show that our algorithm converges in a few steps yielding an association that is within 1% (in objective value) of the optimal (obtained through exhaustive search); in most cases the algorithm yields an optimal solution.

An analytical model for an IEEE~802.11 WLAN using DCF with two types of VoIP calls

In this paper we develop and numerically explore the modeling heuristic of using saturation attempt probabilities as state dependent attempt probabilities in an IEEE 802.11e infrastructure network carrying packet telephone calls and TCP controlled file downloads, using enhanced distributed channel access (EDCA). We build upon the fixed point analysis and performance insights. When there are a certain number of nodes of each class contending for the channel (i.e., have nonempty queues), then their attempt probabilities are taken to be those obtained from saturation analysis for that number of nodes. Then we model the system queue dynamics at the network nodes. With the proposed heuristic, the system evolution at channel slot boundaries becomes a Markov renewal process, and regenerative analysis yields the desired performance measures. The results obtained from this approach match well with ns2 simulations. We find that, with the default IEEE 802.11e EDCA parameters for AC 1 and AC 3, the voice call capacity decreases if even one file download is initiated by some station. Subsequently, reducing the voice calls increases the file download capacity almost linearly (by 1/3 Mbps per voice call for the 11 Mbps PHY)