Non-monotonic, distance-dependent relaxation of water in reverse micelles: Propagation of surface induced frustration along hydrogen bond networks

Layer-wise, distance-dependent orientational relaxation of water confined in reverse micelles (RM) is studied using theoretical and computational tools. We use both a newly constructed ``spins on a ring'' (SOR) Ising-type model (with Shore-Zwanzig rotational dynamics) and atomistic simulations with explicit water. Our study explores the effect of reverse micelle size and role of intermolecular correlations, compromised by the presence of a highly polar surface, on the distance (from the interface) dependence of water relaxation. The ``spins on a ring'' model can capture some aspects of distance dependence of relaxation, such as acceleration of orientational relaxation at intermediate layers. In atomistic simulations, layer-wise decomposition of hydrogen bond formation pattern clearly reveals that hydrogen bond arrangement of water at a certain distance away from the surface can remain frustrated due to the interaction with the polar surface head groups. This layer-wise analysis also reveals the presence of a non-monotonic slow relaxation component which can be attributed to this frustration effect and which is accentuated in small to intermediate size RMs. For large size RMs, the long time component decreases monotonically from the interface to the interior of the RMs with slowest relaxation observed at the interface. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4732095]

Synthesis, luminescence and EPR studies on CaSiO 3: Pb, Mn-nano phosphors synthesized by the solution combustion method

Nano-ceramic phosphor CaSiO 3 doped with Pb and Mn was synthesized by the low temperature solution combustion method. The materials were characterized by Powder X-Ray Diffraction (XRD), Thermo-gravimetric and Differential Thermal Analysis (TG-DTA), Scanning Electron Microscopy (SEM) and Transmission Electron Microscopy (TEM). The Electron Paramagnetic Resonance (EPR) spectrum of the investigated sample exhibits a broad resonance signal centered at g=1.994. The number of spins participating in resonance (N) and its paramagnetic susceptibility (�) have been evaluated. Photoluminescence of doped CaSiO 3 was investigated when excited by UV radiation of 256 nm. The phosphor exhibits an emission peak at 353 nm in the UV range due to Pb 2+. Further, a broad emission peak in the visible range 550-625 nm can be attributed to 4T 1� 6A 1 transition of Mn 2+ ions. The investigation reveals that doping perovskite nano-ceramics with transition metal ions leads to excellent phosphor materials for potential applications. © 2012 Elsevier Ltd and Techna Group S.r.l.

Rainbow connection number and connected dominating sets

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Structural characterization, EPR and thermoluminescence properties of Cd-1 (-) xNixSiO3 nanocrystalline phosphors

Cd-1 - xNixSiO3 (x = 1-7 mol%) nanophosphors have been prepared for the first time by the combustion method using oxylyldihydrizide as a fuel. Powder X-ray diffraction results confirm the formation of monoclinic phase. Scanning electron micrographs show that Ni2+ influences the porosity of samples. The optical energy gap is widened with increase of Ni2+ ion dopant. The electron paramagnetic resonance spectrum of Ni2+ ions in CdSiO3 exhibits a symmetric absorption at g = 2.343 and the site symmetry around Ni2+ ions is predominantly octahedral. The number of spins participating in resonance (N) and the paramagnetic susceptibility (chi) has been evaluated. The thermoluminescence intensity is found to increase up to similar to 20 min ultra-violet exposure and thereafter, decrease with further increase of ultra-violet dose. The kinetic parameters such as activation energy (E), frequency factor (s)and order of kinetics was estimated using glow peak shape method and the results are discussed. (c) 2012 Elsevier Ltd. All rights reserved.

Magneto-Transport Study of Pure and Co Doped ZnO Thin Films

A detailed low temperature magneto-transport study is carried out to understand the transport mechanism in pure and Co doped ZnO thin films grown by pulsed laser deposition (PLD) technique. A negative transverse magneto-resistance (MR) (with a value similar to 4% at 4.5 K) which decreases monotonically with the increase in temperature, is observed for the undoped ZnO film. A competition between positive and negative MR is observed for the Co doped ZnO samples. In this case at higher field values negative MR contribution dominates over the positive MR, which gives rise to a slope change in the MR data. Our data for MR shows excellent agreement with the semi-empirical formula given by Khosla et al., which is originally proposed for the degenerate semiconductors. This formula incorporates the third order perturbation expansion of the s-d exchange scattering of the conduction electrons from the localised spins. We have also obtained the Hall mobility, carrier conc. and mean free path as function of temperature for the pure ZnO film.

A weighted average-based external clock synchronisation protocol for wireless sensor networks

Wireless Sensor Networks (WSNs) have many application scenarios where external clock synchronisation may be required because a WSN may consist of components which are not connected to each other. In this paper, we first propose a novel weighted average-based internal clock synchronisation (WICS) protocol, which synchronises all the clocks of a WSN with the clock of a reference node periodically. Based on this protocol, we then propose our weighted average-based external clock synchronisation (WECS) protocol. We have analysed the proposed protocols for maximum synchronisation error and shown that it is always upper bounded. Extensive simulation studies of the proposed protocols have been carried out using Castalia simulator. Simulation results validate our above theoretical claim and also show that the proposed protocols perform better in comparison to other protocols in terms of synchronisation accuracy. A prototype implementation of the WICS protocol using a few TelosB motes also validates the above conclusions.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.

Efficient Methods for Robust Classification Under Uncertainty in Kernel Matrices

In this paper we study the problem of designing SVM classifiers when the kernel matrix, K, is affected by uncertainty. Specifically K is modeled as a positive affine combination of given positive semi definite kernels, with the coefficients ranging in a norm-bounded uncertainty set. We treat the problem using the Robust Optimization methodology. This reduces the uncertain SVM problem into a deterministic conic quadratic problem which can be solved in principle by a polynomial time Interior Point (IP) algorithm. However, for large-scale classification problems, IP methods become intractable and one has to resort to first-order gradient type methods. The strategy we use here is to reformulate the robust counterpart of the uncertain SVM problem as a saddle point problem and employ a special gradient scheme which works directly on the convex-concave saddle function. The algorithm is a simplified version of a general scheme due to Juditski and Nemirovski (2011). It achieves an O(1/T-2) reduction of the initial error after T iterations. A comprehensive empirical study on both synthetic data and real-world protein structure data sets show that the proposed formulations achieve the desired robustness, and the saddle point based algorithm outperforms the IP method significantly.

A weighted average based external clock synchronization protocol for wireless sensor networks

Clock synchronization is an extremely important requirement of wireless sensor networks(WSNs). There are many application scenarios such as weather monitoring and forecasting etc. where external clock synchronization may be required because WSN itself may consists of components which are not connected to each other. A usual approach for external clock synchronization in WSNs is to synchronize the clock of a reference node with an external source such as UTC, and the remaining nodes synchronize with the reference node using an internal clock synchronization protocol. In order to provide highly accurate time, both the offset and the drift rate of each clock with respect to reference node are estimated from time to time, and these are used for getting correct time from local clock reading. A problem with this approach is that it is difficult to estimate the offset of a clock with respect to the reference node when drift rate of clocks varies over a period of time. In this paper, we first propose a novel internal clock synchronization protocol based on weighted averaging technique, which synchronizes all the clocks of a WSN to a reference node periodically. We call this protocol weighted average based internal clock synchronization(WICS) protocol. Based on this protocol, we then propose our weighted average based external clock synchronization(WECS) protocol. We have analyzed the proposed protocols for maximum synchronization error and shown that it is always upper bounded. Extensive simulation studies of the proposed protocols have been carried out using Castalia simulator. Simulation results validate our theoretical claim that the maximum synchronization error is always upper bounded and also show that the proposed protocols perform better in comparison to other protocols in terms of synchronization accuracy. A prototype implementation of the proposed internal clock synchronization protocol using a few TelosB motes also validates our claim.

Generating string solutions in BTZ

Integrability of classical strings in the BTZ black hole enables the construction and study of classical string propagation in this background. We first apply the dressing method to obtain classical string solutions in the BTZ black hole. We dress time like geodesics in the BTZ black hole and obtain open string solutions which are pinned on the boundary at a single point and whose end points move on time like geodesics. These strings upon regularising their charge and spins have a dispersion relation similar to that of giant magnons. We then dress space like geodesics which start and end on the boundary of the BTZ black hole and obtain minimal surfaces which can penetrate the horizon of the black hole while being pinned at the boundary. Finally we embed the giant gluon solutions in the BTZ background in two different ways. They can be embedded as a spiral which contracts and expands touching the horizon or a spike which originates from the boundary and touches the horizon.

Performance analysis of adaptive physical layer network coding for wireless two-way relaying

The performance analysis of adaptive physical layer network-coded two-way relaying scenario is presented which employs two phases: Multiple access (MA) phase and Broadcast (BC) phase. The deep channel fade conditions which occur at the relay referred as the singular fade states fall in the following two classes: (i) removable and (ii) non-removable singular fade states. With every singular fade state, we associate an error probability that the relay transmits a wrong network-coded symbol during the BC phase. It is shown that adaptive network coding provides a coding gain over fixed network coding, by making the error probabilities associated with the removable singular fade states contributing to the average Symbol Error Rate (SER) fall as SNR-2 instead of SNR-1. A high SNR upper-bound on the average end-to-end SER for the adaptive network coding scheme is derived, for a Rician fading scenario, which is found to be tight through simulations. Specifically, it is shown that for the adaptive network coding scheme, the probability that the relay node transmits a wrong network-coded symbol is upper-bounded by twice the average SER of a point-to-point fading channel, at high SNR. Also, it is shown that in a Rician fading scenario, it suffices to remove the effect of only those singular fade states which contribute dominantly to the average SER.

Riesz transforms and multipliers for the Grushin operator

We show that Riesz transforms associated to the Grushin operator G = -Delta - |x|(2 similar to) (t) (2) are bounded on L (p) (a''e (n+1)). We also establish an analogue of the Hormander-Mihlin Multiplier Theorem and study Bochner-Riesz means associated to the Grushin operator. The main tools used are Littlewood-Paley theory and an operator-valued Fourier multiplier theorem due to L. Weis.

Totally geodesic discs in strongly convex domains

We prove that every isometry from the unit disk Delta in , endowed with the Poincar, distance, to a strongly convex bounded domain Omega of class in , endowed with the Kobayashi distance, is the composition of a complex geodesic of Omega with either a conformal or an anti-conformal automorphism of Delta. As a corollary we obtain that every isometry for the Kobayashi distance, from a strongly convex bounded domain of class in to a strongly convex bounded domain of class in , is either holomorphic or anti-holomorphic.

Exact internal controllability for a hyperbolic problem in a domain with highly oscillating boundary

In this paper, by using the Hilbert Uniqueness Method (HUM), we study the exact controllability problem described by the wave equation in a three-dimensional horizontal domain bounded at the bottom by a smooth wall and at the top by a rough wall. The latter is assumed to consist in a plane wall covered with periodically distributed asperities whose size depends on a small parameter epsilon > 0, and with a fixed height. Our aim is to obtain the exact controllability for the homogenized equation. In the process, we study the asymptotic analysis of wave equation in two setups, namely solution by standard weak formulation and solution by transposition method.

Modelling and analysis of new coolstreaming for P2P IPTV

Peer to peer networks are being used extensively nowadays for file sharing, video on demand and live streaming. For IPTV, delay deadlines are more stringent compared to file sharing. Coolstreaming was the first P2P IPTV system. In this paper, we model New Coolstreaming (newer version of Coolstreaming) via a queueing network. We use two time scale decomposition of Markov chains to compute the stationary distribution of number of peers and the expected number of substreams in the overlay which are not being received at the required rate due to parent overloading. We also characterize the end-to-end delay encountered by a video packet received by a user and originated at the server. Three factors contribute towards the delay. The first factor is the mean shortest path length between any two overlay peers in terms of overlay hops of the partnership graph which is shown to be O (log n) where n is the number of peers in the overlay. The second factor is the mean number of routers between any two overlay neighbours which is seen to be at most O (log N-I) where N-I is the number of routers in the internet. Third factor is the mean delay at a router in the internet. We provide an approximation of this mean delay E W]. Thus, the mean end to end delay in New Coolstreaming is shown to be upper bounded by O (log E N]) (log N-I) E (W)] where E N] is the mean number of peers at a channel.