Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

On Convergence of Differential Evolution Over a Class of Continuous Functions With Unique Global Optimum

Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms of current interest. Since its inception in the mid 1990s, DE has been finding many successful applications in real-world optimization problems from diverse domains of science and engineering. This paper takes a first significant step toward the convergence analysis of a canonical DE (DE/rand/1/bin) algorithm. It first deduces a time-recursive relationship for the probability density function (PDF) of the trial solutions, taking into consideration the DE-type mutation, crossover, and selection mechanisms. Then, by applying the concepts of Lyapunov stability theorems, it shows that as time approaches infinity, the PDF of the trial solutions concentrates narrowly around the global optimum of the objective function, assuming the shape of a Dirac delta distribution. Asymptotic convergence behavior of the population PDF is established by constructing a Lyapunov functional based on the PDF and showing that it monotonically decreases with time. The analysis is applicable to a class of continuous and real-valued objective functions that possesses a unique global optimum (but may have multiple local optima). Theoretical results have been substantiated with relevant computer simulations.

On the Implementation of a Streaming Video over Peer to Peer network using Middleware Components

Video streaming applications have hitherto been supported by single server systems. A major drawback of such a solution is that it increases the server load. The server restricts the number of clients that can be simultaneously supported due to limitation in bandwidth. The constraints of a single server system can be overcome in video streaming if we exploit the endless resources available in a distributed and networked system. We explore a P2P system for streaming video applications. In this paper we build a P2P streaming video (SVP2P) service in which multiple peers co-operate to serve video segments for new requests, thereby reducing server load and bandwidth used. Our simulation shows the playback latency using SVP2P is roughly 1/4th of the latency incurred when the server directly streams the video. Bandwidth consumed for control messages (overhead) is as low as 1.5% of the total data transfered. The most important observation is that the capacity of the SVP2P grows dynamically.

Low ML Decoding Complexity STBCs via Codes Over the Klein Group

In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.

Usefulness of in Situ Single Crystal to Single Crystal Transformation (SCSC) Studies in Understanding the Temperature-Dependent Dimensionality Cross-over and Structural Reorganization in Copper-Containing Metal-Organic Frameworks (MOFs)

Two copper-containing compounds [Cu(3)(mu(3)-OH)(2)-(H(2)O)(2){(SO(3))-C(6)H(3)-(COO)(2)}(CH(3)COO)] , I, and [Cu(5)(mu(3)-OH)(2)(H(2)O)(6){(NO(2))-C(6)H(3)-(COO)(2)}(4)]center dot 5H(2)O, II, were prepared using sulphoisophthalic and nitroisophthalic acids. The removal of the coordinated water molecules in the compounds was investigated using in situ single crystal to single crystal (SCSC) transformation studies, temperature-dependent powder X-ray diffraction (PXRD), and thermogravimetric analysis (TGA). The efficacy of SCSC transformation studies were established by the observation of dimensionality cross-over from a two-dimensional (I) to a three-dimensional structure, Cu(6)(mu(3)-OH)(4){(SO(3))-C(6)H(3)-(COO)(2)}(2)(CH(3)COO)(2), Ia, during the removal of the coordinated water molecules. Compound H exhibited a structural reorganization forming Cu(5)(mu(2)-OH)(2){(NO(2))C(6)H(3)-(COO)(2))(4)], Ha, possessing trimeric (Cu(3)O(12)) and dimeric (Cu(2)O(8)) copper clusters. The PXRD studies indicate that the three-dimensional structure (Ia) is transient and unstable, reverting back to the more stable two-dimensional structure (I) on cooling to room temperature. Compound Ha appears to be more stable at room temperature. The rehydration/dehydration studies using a modified TGA setup suggest complete rehydration of the water molecules, indicating that the water molecules in both compounds are labile. A possible model for the observed changes in the structures has been proposed. Magnetic studies indicate changes in the exchanges between the copper centers in Ha, whereas no such behavior was observed in Ia.

Weakening of charge order and antiferromagnetic to ferromagnetic switch over in Pr0.5Ca0.5MnO3 nanowires

We have prepared crystalline nanowires (diameter ∼ 50 nm, length ∼ a few microns) of the charge-ordering manganite Pr0.5Ca0.5MnO3 using a low reaction temperature hydrothermal method and characterized them using x-ray diffraction, transmission electron microscopy, superconducting quantum interference device (SQUID) magnetometry and electron magnetic resonance measurements. While the bulk sample shows a charge ordering transition at 245 K and an antiferromagnetic transition at 175 K, SQUID magnetometry and electron magnetic resonance experiments reveal that in the nanowires phase, a ferromagnetic transition occurs at ∼ 105 K. Further, the antiferromagnetic transition disappears and the charge ordering transition is suppressed. This result is particularly significant since the charge order in Pr0.5Ca0.5MnO3 is known to be very robust, magnetic fields as high as 27 T being needed to melt it.

Designing copper-zirconium based nanowires for improving yield strength and plasticity by configuring surface atoms

Epitaxial-Bain-Path and Uniaxial-Bain-Path studies reveal that a B2-CuZr nanowire with Zr atoms on the surface is energetically more stable compared to a B2-CuZr nanowire with Cu atoms on the surface. Nanowires of cross-sectional dimensions in the range of similar to 20-50 are considered. Such stability is also correlated with the initial state of stress in the nanowires. It is also demonstrated here that a more stable structure, i.e., B2-CuZr nanowire with Zr atoms at surface shows improved yield strength compared to B2-CuZr nanowire with Cu atoms at surface site, over range of temperature under both the tensile and the compressive loadings. Nearly 18% increase in the average yield strength under tensile loading and nearly 26% increase in the averaged yield strength under compressive loading are observed for nanowires with various cross-sectional dimensions and temperatures. It is also observed that the B2-CuZr nanowire with Cu atom at the surface site shows a decrease in failure/plastic strain with an increase in temperature. On the other hand, B2-CuZr nanowires with Zr at the surface site shows an improvement in failure/plastic strain, specially at higher temperature as compared to the B2-CuZr nanowires which are having Cu atoms at the surface site. Finally, a possible design methodology for an energetically stable nano-structure with improved thermo-mechanical properties via manipulating the surface atom configuration is proposed.

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

Alkylation of toluene by methanol over alkali exchanged zeolite-X: side chain versus ring alkylation

The ring versus side-chain alkylation of toluene with methanol over alkali-exchanged zeolite-X of differing basicity has been investigated by in situ infrared spectroscopy and TPD measurements. Over the basic Cs-exchanged zeolite the product of alkylation is styrene/ethylbenzene while over the acidic Li-exchanged zeolite ring alkylation occurs to give mainly xylene as the product. FTIR and TPD investigations reveal that, the key difference in the two types of alkylation processes lies in the state of the adsorbed methanol present at higher temperatures in the zeolite. In basic zeolites, methanol decomposes to formaldehyde and formates. The former is the key ‘side-chain’ alkylating species that leads to the formation of styrene. In the acidic zeolites it is shown that methanol bound to the acid sites plays an active role in the ‘ring alkylation’ of toluene to xylene.

Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis

Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our analysis uses an abstract lattice of formulas to find a pre-condition at the entry of the program such that a null-dereference can occur only if the initial state of the program satisfies this pre-condition. We use a simplified domain of formulas, abstracting out integer arithmetic, as well as unbounded access paths due to recursive data structures. For the sake of precision we model aliasing relationships explicitly in our abstract lattice, enable strong updates, and use a limited notion of path sensitivity. For the sake of scalability we prune formulas continually as they get propagated, reducing to true conjuncts that are less likely to be useful in validating or invalidating the formula. We have implemented our approach, and present an evaluation of it on a set of ten real Java programs. Our results show that the set of design features we have incorporated enable the analysis to (a) explore long, inter-procedural paths to verify each dereference, with (b) reasonable accuracy, and (c) very quick response time per dereference, making it suitable for use in desktop development environments.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Esterification of stearic acid with p-cresol over modified Indian bentonite clay catalysts

The esterification of stearic acid with p-cresol using modified Indian bentonite clay catalysts has been reported. The reaction was studied over exchanged clays, acid activated clays, exchanged acid activated clays, aluminium pillared clay, aluminium pillared acid activated clay, molecular sieve Al-MCM-41, zeolite H beta, ZrO2, S-ZrO2, p-TSA, montmorillonite K10, and montmorillonite KSF in o-xylene for 6 h. The catalysts were characterized by X-ray diffraction and surface area measurements. The acidity was determined by n-butylamine back-titration method and DRIFTS after pyridine adsorption. Acid activated Indian bentonite (AAIB) was found to be a better catalyst compared to other catalysts in the esterification of stearic acid with p-cresol.