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.

Nature and strength of C-H center dot center dot center dot O interactions involving formyl hydrogen atoms: computational and experimental studies of small aldehydes

Structural and electronic properties of C-H center dot center dot center dot O contacts in compounds containing a formyl group are investigated from the perspective of both hydrogen bonding and dipole-dipole interactions, in a systematic and graded approach. The effects of a-substitution and self-association on the nature of the formyl H-atom are studied with the NBO and AIM methodologies. The relative dipole-dipole contributions in formyl C-H center dot center dot center dot O interactions are obtained for aldehyde dimers. The stabilities and energies of aldehyde clusters (dimer through octamer) have been examined computationally. Such studies have an implication in crystallization mechanisms. Experimental X-ray crystal structures of formaldehyde, acrolein and N-methylformamide have been determined in order to ascertain the role of C-H center dot center dot center dot O interactions in the crystal packing of formyl compounds.

Weak interactions involving organic fluorine: analysis of structural motifs in Flunazirine and Haloperidol

The crystal structure of Flunazirine, an anticonvulsant drug, is analyzed in terms of intermolecular interactions involving fluorine. The structure displays motifs formed by only weak interactions C–H⋯F and C–H⋯π. The motifs thus generated show cavities, which could serve as hosts for complexation. The structure of Flunazirine displays cavities formed by C–H⋯F and C–H⋯π interactions. Haloperidol, an antipsychotic drug, shows F⋯F interactions in the crystalline lattice in lieu of Cl⋯Cl interactions. However, strong O–H⋯N interactions dominate packing. The salient features of the two structures in terms of intermolecular interactions reveal, even though organic fluorine has lower tendency to engage in hydrogen bonding and F⋯F interactions, these interactions could play a significant role in the design of molecular assemblies via crystal engineering.

A System-C based Micro architectural Exploration Framework for Latency, Power and Performance Trade-offs of On-Chip Interconnection

We describe a System-C based framework we are developing, to explore the impact of various architectural and microarchitectural level parameters of the on-chip interconnection network elements on its power and performance. The framework enables one to choose from a variety of architectural options like topology, routing policy, etc., as well as allows experimentation with various microarchitectural options for the individual links like length, wire width, pitch, pipelining, supply voltage and frequency. The framework also supports a flexible traffic generation and communication model. We provide preliminary results of using this framework to study the power, latency and throughput of a 4x4 multi-core processing array using mesh, torus and folded torus, for two different communication patterns of dense and sparse linear algebra. The traffic consists of both Request-Response messages (mimicing cache accesses)and One-Way messages. We find that the average latency can be reduced by increasing the pipeline depth, as it enables higher link frequencies. We also find that there exists an optimum degree of pipelining which minimizes energy-delay product.

Impact of Energy Expenditure Rate Constraints on the performance of Multihop Wireless Mesh Networks

In this article we study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh network, where the nodes in the network are subjected to maximum energy expenditure rates. We model link contention in the wireless network using the contention graph and we model energy expenditure rate constraint of nodes using the energy expenditure rate matrix. We formulate the problem as an aggregate utility maximization problem and apply duality theory in order to decompose the problem into two sub-problems namely, network layer routing and congestion control problem and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. We study the e�ects of energy expenditure rate constraints of the nodes on the optimal throughput of the network.

(1S*,3S*,8S*,10S*)-10-Fluoro-15-oxatetracyclo[6.6.1.0(1,10).0( 3,8)]pentadeca-5,12-dien-3-ol

The title compound, C(14)H(17)FO(2), was obtained from anti-4a, 9a:8a,10a-diepoxy-1,4,4a,5,8,8a, 9,9a, 10,10a-decahydroanthracene via tandem hydrogen-fluoride-mediated epoxide ring-opening and transannular oxacyclization. With the two cyclohexene rings folded towards the oxygen bridge, the title tetracyclic fluoroalcohol molecule displays a conformation reminiscent of a pagoda. The crystal packing is effected via intermolecular O-H center dot center dot center dot O hydrogen bonds, which link the molecules into a zigzag chain along the b axis.

N-(2-Amino-3,5-dibromobenzyl)-N-methylcyclohexan-1-aminium p-toluenesulfonate

The title compound, C(14)H(21)Br(2)N(2)(+)center dot C(7)H(7)O(3)S, features a salt of protonated bromhexine, a pharmaceutical used in the treatment of respiratory disorders, and the p-toluenesulfonate anion. The crystal packing is stabilized by intermolecular N-H center dot center dot center dot O, N-H center dot center dot center dot Br and C-H center dot center dot center dot O hydrogen bonds.

3-Ethyl-4-methyl-1H-pyrazol-2-ium-5-olate

The title compound, C(6)H(10)N(2)O, is a zwitterionic pyrazole derivative. The crystal packing is predominantly governed by a three-center iminium-amine N(+)-H center dot center dot center dot O(-)center dot center dot center dot H-N interaction, leading to an undulating sheet-like structure lying parallel to (100).

Distributed Source Coding for Sensor Data Model and Estimation of Cluster Head Errors Using Bayesian and K-Near Neighborhood Classifiers in Deployment of Dense Wireless Sensor Networks

The lifetime calculation of large dense sensor networks with fixed energy resources and the remaining residual energy have shown that for a constant energy resource in a sensor network the fault rate at the cluster head is network size invariant when using the network layer with no MAC losses.Even after increasing the battery capacities in the nodes the total lifetime does not increase after a max limit of 8 times. As this is a serious limitation lots of research has been done at the MAC layer which allows to adapt to the specific connectivity, traffic and channel polling needs for sensor networks. There have been lots of MAC protocols which allow to control the channel polling of new radios which are available to sensor nodes to communicate. This further reduces the communication overhead by idling and sleep scheduling thus extending the lifetime of the monitoring application. We address the two issues which effects the distributed characteristics and performance of connected MAC nodes. (1) To determine the theoretical minimum rate based on joint coding for a correlated data source at the singlehop, (2a) to estimate cluster head errors using Bayesian rule for routing using persistence clustering when node densities are the same and stored using prior probability at the network layer, (2b) to estimate the upper bound of routing errors when using passive clustering were the node densities at the multi-hop MACS are unknown and not stored at the multi-hop nodes a priori. In this paper we evaluate many MAC based sensor network protocols and study the effects on sensor network lifetime. A renewable energy MAC routing protocol is designed when the probabilities of active nodes are not known a priori. From theoretical derivations we show that for a Bayesian rule with known class densities of omega1, omega2 with expected error P* is bounded by max error rate of P=2P* for single-hop. We study the effects of energy losses using cross-layer simulation of - large sensor network MACS setup, the error rate which effect finding sufficient node densities to have reliable multi-hop communications due to unknown node densities. The simulation results show that even though the lifetime is comparable the expected Bayesian posterior probability error bound is close or higher than Pges2P*.

Expediency of Penetration Ratio and Evaluation of Mean Throughput for Safety and Commercial Applications in VANETs

Vehicular ad hoc network (VANET) applications are principally categorized into safety and commercial applications. Efficient traffic management for routing an emergency vehicle is of paramount importance in safety applications of VANETs. In the first case, a typical example of a high dense urban scenario is considered to demonstrate the role of penetration ratio for achieving reduced travel time between source and destination points. The major requirement for testing these VANET applications is a realistic simulation approach which would justify the results prior to actual deployment. A Traffic Simulator coupled with a Network Simulator using a feedback loop feature is apt for realistic simulation of VANETs. Thus, in this paper, we develop the safety application using traffic control interface (TraCI), which couples SUMO (traffic simulator) and NS2 (network simulator). Likewise, the mean throughput is one of the necessary performance measures for commercial applications of VANETs. In the next case, commercial applications have been considered wherein the data is transferred amongst vehicles (V2V) and between roadside infrastructure and vehicles (I2V), for which the throughput is assessed.

On Optimal Performance in Mobile Ad-Hoc Networks

In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capacity region has long been known to be NP-hard. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the heuristic is very simple to implement and is not overly sensitive to the threshold value used. We find empirical conditions for our heuristic to be near-optimal as well as network scenarios when our simple heuristic does not perform very well. We provide extensive numerical and simulation results for different parameter settings of our model.

Intruder detection over sensor placement in a hexagonal lattice

The problem of intrusion detection and location identification in the presence of clutter is considered for a hexagonal sensor-node geometry. It is noted that in any practical application,for a given fixed intruder or clutter location, only a small number of neighboring sensor nodes will register a significant reading. Thus sensing may be regarded as a local phenomenon and performance is strongly dependent on the local geometry of the sensor nodes. We focus on the case when the sensor nodes form a hexagonal lattice. The optimality of the hexagonal lattice with respect to density of packing and covering and largeness of the kissing number suggest that this is the best possible arrangement from a sensor network viewpoint. The results presented here are clearly relevant when the particular sensing application permits a deterministic placement of sensors. The results also serve as a performance benchmark for the case of a random deployment of sensors. A novel feature of our analysis of the hexagonal sensor grid is a signal-space viewpoint which sheds light on achievable performance.Under this viewpoint, the problem of intruder detection is reduced to one of determining in a distributed manner, the optimal decision boundary that separates the signal spaces SI and SC associated to intruder and clutter respectively. Given the difficulty of implementing the optimal detector, we present a low-complexity distributive algorithm under which the surfaces SI and SC are separated by a wellchosen hyperplane. The algorithm is designed to be efficient in terms of communication cost by minimizing the expected number of bits transmitted by a sensor.

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.

Limits of Data Level Parallelism

Abstract—A new breed of processors like the Cell Broadband Engine, the Imagine stream processor and the various GPU processors emphasize data-level parallelism (DLP) and threadlevel parallelism (TLP) as opposed to traditional instructionlevel parallelism (ILP). This allows them to achieve order-ofmagnitude improvements over conventional superscalar processors for many workloads. However, it is unclear as to how much parallelism of these types exists in current programs. Most earlier studies have largely concentrated on the amount of ILP in a program, without differentiating DLP or TLP. In this study, we investigate the extent of data-level parallelism available in programs in the MediaBench suite. By packing instructions in a SIMD fashion, we observe reductions of up to 91 % (84 % on average) in the number of dynamic instructions, indicating a very high degree of DLP in several applications. I.

Single Particle and Packed Bed Combustion in Modern Gasifier Stoves—Density Effects

This article is concerned with a study of an unusual effect due to density of biomass pellets in modern stoves based on close-coupled gasification-combustion process. The two processes, namely, flaming with volatiles and glowing of the char show different effects. The mass flux of the fuel bears a constant ratio with the air flow rate of gasification during the flaming process and is independent of particle density; char glowing process shows a distinct effect of density. The bed temperatures also have similar features: during flaming, they are identical, but distinct in the char burn (gasification) regime. For the cases, wood char and pellet char, the densities are 350, 990 kg/m(3), and the burn rates are 2.5 and 3.5 g/min with the bed temperatures being 1380 and 1502 K, respectively. A number of experiments on practical stoves showed wood char combustion rates of 2.5 +/- 0.5 g/min and pellet char burn rates of 3.5 +/- 0.5 g/min. In pursuit of the resolution of the differences, experimental data on single particle combustion for forced convection and ambient temperatures effects have been obtained. Single particle char combustion rate with air show a near-d(2) law and surface and core temperatures are identical for both wood and pellet char. A model based on diffusion controlled heat release-radiation-convection balance is set up. Explanation of the observed results needs to include the ash build-up over the char. This model is then used to explain observed behavior in the packed bed; the different packing densities of the biomass chars leading to different heat release rates per unit bed volume are deduced as the cause of the differences in burn rate and bed temperatures.