One-dimensional zinc phosphates with linear chain structure

Three one-dimensional zinc phosphates, [C5N2H14][Zn(HPO4)2], I, [C10N4H26][Zn(HPO4)2].2H2O II, and [C4N2H6]2[Zn(HPO4)], III, have been prepared employing hydro/solvothermal methods in the presence of organic amines. While I and II consist of linear chains of corner-shared four-membered rings, III is a polymeric wire where the amine molecule is directly bonded to the metal center. The wire, as well as the chain in these structures, are held together by hydrogen bond interactions involving the amine and the framework oxygens. The polymeric zinc phosphate with wire-like architecture, III, is only the second example of such architecture. Crystal data: I, monoclinic, P21/c (no. 14), a=8.603(2), b=13.529(2), c=10.880(1) Å, β=94.9(1)°, V=1261.6(1) Å3, Z=4, ρcalc.=1.893 gcm−3, μ(MoKα)=2.234 mm−1, R1=0.032, wR2=0.086, [1532 observed reflections with I>2σ(I)], II, orthorhombic, Pbca (no. 61), a=8.393(1), b=15.286(1), c=22.659(1) Å, V=2906.9(2) Å3, Z=8, ρcalc.=1.794 gcm−3, μ(MoKα)=1.957 mm−1, R1=0.055, wR2=0.11, [1565 observed reflections with I>2σ(I) and III, monoclinic, P21/c (no. 14), a=8.241(1), b=13.750(2), c=10.572(1) Å, β=90.9(1)°, V=1197.7(2) Å3, Z=4, ρcalc.=1.805 gcm−3, μ(MoKα)=2.197 mm−1, R1=0.036, wR2=0.10, [1423 observed reflections with I>2σ(I)].

Quadratic Lyapunov functions for linear systems Journal

The paper deals with the existence of a quadratic Lyapunov function V = x′P(t)x for an exponentially stable linear system with varying coefficients described by the vector differential equation S0305004100044777_inline1 The derivative dV/dt is allowed to be strictly semi-(F) and the locus dV/dt = 0 does not contain any arc of the system trajectory. It is then shown that the coefficient matrix A(t) of the exponentially stable sy

Effect of screening of intermicellar interactions on the linear and nonlinear rheology of a viscoelastic gel

We report our studies of the linear and nonlinear rheology of aqueous solutions of the surfactant cetyl trimethylammonium tosylate (CTAT) with varying amounts of sodium chloride (NaCl). The CTAT concentration is fixed at 42 mM, and the salt concentration is varied between 0 and 120 mM. On increasing the salt (NaCl) concentration, we see three distinct regimes in the zero-shear viscosity and the high-frequency plateau modulus data. In regime 1, the zero-shear viscosity shows a weak increase with salt concentration due to enhanced micellar growth. The decrease in the zero-shear viscosities with salt concentration in regimes II and III can be explained in terms of intermicellar branching. The most intriguing feature of our data, however, is the anomalous behavior of the high-frequency plateau modulus in regime II (0.12 less than or equal to [NaCl]/[CTAT] less than or equal to 1.42). In this regime, the plateau modulus increases with an increase in NaCl concentration. This is highly interesting, since the correlation length of concentration fluctuations and hence the plateau modulus G(0) are not expected to change appreciably in the semidilute regime. We propose to explain the changes in regime II in terms of a possible unbinding of the organic counterions (tosylate) from the CTA(+) surfaces on the addition of NaCl. In the nonlinear flow curves of the samples with high salt content, significant deviations from the predictions of the Giesekus model for entangled micelles are observed.

Determination of solid fraction evolution during solidification of aluminum alloy in presence of linear electromagnetic stirring

In many industrial casting processes, knowledge of the solid fraction evolution during the solidification process is a key factor in determining the process parameters such as cooling rate, stirring intensity and in estimating the total solidification time. In the present work, a new method of estimating solid fraction is presented, which is based on calorimetric principles. In this method, the cooling curve data at each point in the melt, along with the thermal boundary conditions, are used to perform energy balance in the mould, from which solid fraction generation during any time interval can be estimated. This method is applied to the case of a rheocasting process, in which Al-Si alloy (A356 alloy) is solidified by stirring in a cylindrical mould placed in the annulus of a linear electromagnetic stirrer. The metal in the mould is simultaneously cooled and stirred to produce a cylindrical billet with non-dendritic globular microstructure. Temperature is measured at key locations in the mould to assess the various heat exchange processes prevalent in the mould and to monitor the solidification rate. The results obtained by energy balance method are compared with those by the conventional procedure of calculating solid fraction using the Schiel equation.

Qualitative theorem proving in linear constraints

We know, from the classical work of Tarski on real closed fields, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take place through the elimination of middle terms, and because the computational complexity of the proof is not an issue. Indeed what we need is the existence of the proof and not its mechanization. In this paper, we treat the linear case and illustrate the power of this paradigm by giving extremely simple proofs of two central theorems in the complexity and geometry of linear programming.

Synthesis, biological studies of linear and branched arabinofuranoside-containing glycolipids and their interaction with surfactant protein A

Oligoarabinofuranoside-containing glycolipids relevant to mycobacterial cell wall components were synthesized in order to understand the functional roles of such glycolipids. A series of linear tetra-, hexa-, octa-and a branched heptasaccharide oligoarabinofuranosides, with 1 -> 2 and 1 -> 5 a-linkages between the furanoside residues, were synthesized by chemical methods from readily available monomer building blocks. Upon the synthesis of glycolipids, constituted with a double alkyl chain-substituted sn-glycerol core and oligosaccharide fragments, biological studies were performed to identify the effect of synthetic glycolipids on the biofilm formation and sliding motilities of Mycobacterium smegmatis. Synthetic glycolipids and arabinofuranosides displayed an inhibitory effect on the growth profile, but mostly on the biofilm formation and maturation. Similarly, synthetic compounds also influenced the sliding motility of the bacteria. Further, biophysical studies were undertaken, so as to identify the interactions of the glycolipids with a pulmonary surfactant protein, namely surfactant protein A (SP-A), with the aid of the surface plasmon resonance technique. Specificities of each glycolipid interacting with SP-A were thus evaluated. From this study, glycolipids were found to exhibit higher apparent association constants than the corresponding oligosaccharide portion alone, without the double alkyl group-substituted glycerol core.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Explicit and Optimal Codes for Distributed Storage

In the distributed storage coding problem we consider, data is stored across n nodes in a network, each capable of storing � symbols. It is required that the complete data can be reconstructed by downloading data from any k nodes. There is also the key additional requirement that a failed node be regenerated by connecting to any d nodes and downloading �symbols from each of them. Our goal is to minimize the repair bandwidth d�. In this paper we provide explicit constructions for several parameter sets of interest.

Contrained linear spectral unmixing technique for regional land cover mapping using MODIS data

Over the last few decades, there has been a significant land cover (LC) change across the globe due to the increasing demand of the burgeoning population and urban sprawl. In order to take account of the change, there is a need for accurate and up- to-date LC maps. Mapping and monitoring of LC in India is being carried out at national level using multi-temporal IRS AWiFS data. Multispectral data such as IKONOS, Landsat- TM/ETM+, IRS-1C/D LISS-III/IV, AWiFS and SPOT-5, etc. have adequate spatial resolution (~ 1m to 56m) for LC mapping to generate 1:50,000 maps. However, for developing countries and those with large geographical extent, seasonal LC mapping is prohibitive with data from commercial sensors of limited spatial coverage. Superspectral data from the MODIS sensor are freely available, have better temporal (8 day composites) and spectral information. MODIS pixels typically contain a mixture of various LC types (due to coarse spatial resolution of 250, 500 and 1000 m), especially in more fragmented landscapes. In this context, linear spectral unmixing would be useful for mapping patchy land covers, such as those that characterise much of the Indian subcontinent. This work evaluates the existing unmixing technique for LC mapping using MODIS data, using end- members that are extracted through Pixel Purity Index (PPI), Scatter plot and N-dimensional visualisation. The abundance maps were generated for agriculture, built up, forest, plantations, waste land/others and water bodies. The assessment of the results using ground truth and a LISS-III classified map shows 86% overall accuracy, suggesting the potential for broad-scale applicability of the technique with superspectral data for natural resource planning and inventory applications.

Linear Filtering in MDCT domain

In this paper, expressions for convolution multiplication properties of MDCT are derived starting from the equivalent DFT representations. Using these expressions, methods for implementing linear filtering through block convolution in the MDCT domain are presented. The implementation is exact for symmetric filters and approximate for non-symmetric filters in the case of rectangular window based MDCT. For a general MDCT window function, the filtering is done on the windowed segments and hence the convolution is approximate for symmetric as well as non-symmetric filters. This approximation error is shown to be perceptually insignificant for symmetric impulse response filters. Moreover, the inherent $50 \%$ overlap between adjacent frames used in MDCT computation does reduce this approximation error similar to smoothing of other block processing errors. The presented techniques are useful for compressed domain processing of audio signals.

On the Successive Refinability of MIMO channels: DMT and codes

Diversity embedded space time codes are high rate codes that are designed such that they have a high diversity code embedded within them. A recent work by Diggavi and Tse characterizes the performance limits that can be achieved by diversity embedded space-time codes in terms of the achievable Diversity Multiplexing Tradeoff (DMT). In particular, they have shown that the trade off is successively refinable for rayleigh fading channels with one degree of freedom using superposition coding and Successive Interference Cancellation (SIC). However, for Multiple-Input Multiple-Output (MIMO) channels, the questions of successive refinability remains open. We consider MIMO Channels under superposition coding and SIC. We derive an upper bound on the successive refinement characteristics of the DMT. We then construct explicit space time codes that achieve the derived upper bound. These codes, constructed from cyclic division algebras, have minimal delay. Our results establish that when the channel has more than one degree of freedom, the DMT is not successive refinable using superposition coding and SIC. The channels considered in this work can have arbitrary fading statistics.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT