Better QOS with W/T SPR codes for the transmission of multimedia signals in Optical CDMA networks

In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. The application of O-CDMA to multimedia transmission (voice, data, and video) is investigated. The simultaneous transmission of various services is achieved by assigning to each user unique multiple code signatures. Thus, by applying a parallel mapping technique, we achieve multi-rate services. A random access protocol is proposed, here, where all distinct codes are used, for packet transmission. The codes, Optical Orthogonal Code (OOC), or 1D codes and Wavelength/Time Single-Pulse-per-Row (W/T SPR), or 2D codes, are analyzed. These 1D and 2D codes with varied weight are used to differentiate the Quality of Service (QoS). The theoretical bit error probability corresponding to the quality of each service is established using 1D and 2D codes in the receiver noiseless case and compared. The results show that, using 2D codes QoS in multimedia transmission is better than using 1D codes.

On the unramified principal series of GL(3) over non-archimedean local fields

Let F be a non-archimedean local field and let O be its ring of integers. We give a complete description of the irreducible constituents of the restriction of the unramified principal series representations of GL(3)(F) to GL(3)(O). (C) 2013 Elsevier Inc. All rights reserved.

Estimates of aerosol absorption over India using multi-satellite retrieval

Aerosol absorption is poorly quantified because of the lack of adequate measurements. It has been shown that the Ozone Monitoring Instrument (OMI) aboard EOS-Aura and the Moderate Resolution Imaging Spectroradiometer (MODIS) aboard EOS-Aqua, which fly in formation as part of the A-train, provide an excellent opportunity to improve the accuracy of aerosol retrievals. Here, we follow a multi-satellite approach to estimate the regional distribution of aerosol absorption over continental India for the first time. Annually and regionally averaged aerosol single-scattering albedo over the Indian landmass is estimated as 0.94 +/- 0.03. Our study demonstrates the potential of multi-satellite data analysis to improve the accuracy of retrieval of aerosol absorption over land.

A matroidal framework for network-error correcting codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. The current work attempts to establish a connection between matroid theory and network-error correcting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of network-error correcting codes to arrive at the definition of a matroidal error correcting network. An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error correcting network code if and only if it is a matroidal error correcting network associated with a representable matroid. Therefore, constructing such network-error correcting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa.

Chromium isotope variations (delta Cr-53/52) in mantle-derived sources and their weathering products: Implications for environmental studies and the evolution of delta Cr-53/52 in the Earth's mantle over geologic time

Here we report chromium isotope compositions, expressed as delta Cr-53/ 52 in per mil (&) relative to NIST 979, measured in selected Cr-rich minerals and rocks formed by the primary magmatic as well as the secondary metamorphic and weathering processes. The main objectives of this study were: (i) to further constrain the isotope composition of the Earth's mantle Cr inventory and its possible variation during geological history, based on the analysis of globally distributed and stratigraphically constrained mantle-derived chromites; and (ii) to investigate the magnitude and systematics of Cr isotope fractionation during oxidative weathering and secondary alteration (i. e., hydration, serpentinization) of the magmatic Cr sources. Specifically, we analyzed delta Cr-53/ 52 in a set of globally distributed mantle-derived chromites (FeMgCr2O4, n = 30) collected from various locations in Europe, Asia, Africa and South America, and our results confirm that a chromite-hosted Earth's mantle Cr inventory is uniform at - 0.079 +/- 0.129& (2SD), which we named here as a ` canonical' mantle d 53/ 52 Cr signature. Furthermore our dataset of stratigraphically constrained chromites, whose crystallization ages cover most of the Earth's geological history, indicate that the bulk Cr isotope composition of the chromite-hosted mantle inventory has remained uniform, within about +/- 0.100&, since at least the Early Archean times (similar to 3500 million years ago, Ma). To investigate the systematics of Cr isotope fractionation associated with alteration processes we analyzed a number of secondary Cr-rich minerals and variably altered ultramafic rocks (i. e., serpentinized harzburgites, lherzolites) that revealed large positive delta Cr-53/ 52 anomalies that are systematically shifted to higher values with an increasing degree of alteration and serpentinization. The degree of aqueous alteration and serpentinization was quantified by the abundances of fluid-mobile (Rb, K) elements, and by the Loss On Ignition (LOI) parameter, which determines the amount of structurally bound water (OH/ H2O) present in secondary hydrated minerals like serpentine. Overall, we observed that altered ultramafic rocks that yielded the highest LOI values, and the lowest amounts of fluid mobile elements, also yielded the heaviest delta Cr-53/ 52 signatures. Therefore, we conclude that secondary alteration (i.e., hydration, serpentinization) of ultramafic rocks in near-surface oxidative environments tend to shift the bulk Cr isotope composition of the weathered products to isotopically heavier values, pointing to a dynamic redox cycling of Cr in the Earth's crustal and near-surface environments. Hence, if validated by future

Greening the IP Over Optical Backbone Network

In this paper we examine the energy consumption of IP Over Optical WDM Networks. As the number of Internet users increases the Internet expands in reach and capacity. This results in increased energy consumption of the network. Minimizing the power consumption, termed as ``Greening the Internet'', is desirable to help service providers (SP) operate their networks and provide services more efficiently in terms of power consumption. Minimizing the operational power typically depends on the strategy (e. g., lightpath bypass, lightpath non-bypass and traffic grooming) and operations (e. g., electronic domain versus optical domain). We consider a typical optical backbone network model, and develop a model which minimizes the power consumption. Performance calculation shows that our method consumes less power compared to traffic grooming approach.

An asymptotically optimal push-pull method for multicasting over a random network

We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.

Regenerating codes for errors and erasures in distributed storage

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures at the nodes or links, during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.

Preparation of zinc oxide coatings by using newly designed metal-organic complexes of Zn: Effect of molecular structure of the precursor and surfactant over the crystallization, growth and luminescence

We report large scale deposition of tapered zinc oxide (ZnO) nanorods on Si(100) substrate by using newly designed metal-organic complex of zinc (Zn) as the precursor, and microwave irradiation assisted chemical synthesis as a process. The coatings are uniform and high density ZnO nanorods (similar to 1.5 mu m length) grow over the entire area (625 mm(2)) of the substrate within 1-5 min of microwave irradiation. ZnO coatings obtained by solution phase deposition yield strong UV emission. Variation of the molecular structure/molecular weight of the precursors and surfactants influence the crystallinity, morphology, and optical properties of ZnO coatings. The precursors in addition with the surfactant and the solvent are widely used to obtain desired coating on any substrate. The growth mechanism and the schematics of the growth process of ZnO coatings on Si(100) are discussed. (c) 2013 Elsevier B.V. All rights reserved.

Codes for solving three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces

Three codes, that can solve three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces, are provided here. The file 'bemconst.m' contains a MATLAB code for solving three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces. The file 'bemconst.f90' is a Fortran translation of the MATLAB code contained in the file 'bemconst.m'. The file 'bemconstp.f90' is a parallelized version of the Fortran code contained in the file 'bemconst.f90'. The file 'inbem96.txt' is the input file for the Fortran codes contained in the files 'bemconst.f90' and 'bemconstp.f90'. Author hereby declares that the present codes are the original works of the author. Further, author hereby declares that any of the present codes, in full or in part, is not a translation or a copy of any of the existing codes written by someone else. Author's institution (Indian Institute of Science) has informed the author in writing that the institution is not interested in claiming any copyright on the present codes. Author is hereby distributing the present codes under the MIT License; full text of the license is included in each of the files that contain the codes.

Improved perfect space-time block codes

Perfect space-time block codes (STBCs) are based on four design criteria-full-rateness, nonvanishing determinant, cubic shaping, and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at uniform average energy per antenna per time slot are important from the perspective of energy efficiency of STBCs. The shaping criterion demands that the generator matrix of the lattice from which each layer of the perfect STBC is carved be unitary. In this paper, it is shown that unitariness is not a necessary requirement for energy efficiency in the context of space-time coding with finite input constellations, and an alternative criterion is provided that enables one to obtain full-rate (rate of complex symbols per channel use for an transmit antenna system) STBCs with larger normalized minimum determinants than the perfect STBCs. Further, two such STBCs, one each for 4 and 6 transmit antennas, are presented and they are shown to have larger normalized minimum determinants than the comparable perfect STBCs which hitherto had the best-known normalized minimum determinants.

Asymptotically-good, multigroup decodable space-time block codes

For a family of Space-Time Block Codes (STBCs) C-1, C-2,..., with increasing number of transmit antennas N-i, with rates R-i complex symbols per channel use, i = 1, 2,..., we introduce the notion of asymptotic normalized rate which we define as lim(i ->infinity) R-i/N-i, and we say that a family of STBCs is asymptotically-good if its asymptotic normalized rate is non-zero, i. e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC C is said to be g-group decodable, g >= 2, if the information symbols encoded by it can be partitioned into g groups, such that each group of symbols can be ML decoded independently of the others. In this paper we construct full-diversity g-group decodable codes with rates greater than one complex symbol per channel use for all g >= 2. Specifically, we construct delay-optimal, g-group decodable codes for number of transmit antennas N-t that are a multiple of g2left perpendicular(g-1/2)right perpendicular with rate N-t/g2(g-1) + g(2)-g/2N(t). Using these new codes as building blocks, we then construct non-delay-optimal g-group decodable codes with rate roughly g times that of the delay-optimal codes, for number of antennas N-t that are a multiple of 2left perpendicular(g-1/2)right perpendicular, with delay gN(t) and rate Nt/2(g-1) + g-1/2N(t). For each g >= 2, the new delay-optimal and non-delay- optimal families of STBCs are both asymptotically-good, with the latter family having the largest asymptotic normalized rates among all known families of multigroup decodable codes with delay T <= gN(t). Also, for g >= 3, these are the first instances of g-group decodable codes with rates greater than 1 reported in the literature.

Production of syngas from steam reforming and CO removal with water gas shift reaction over nanosized Zr0.95Ru0.05O2-delta solid solution

This study presents the synthesis, characterization, and kinetics of steam reforming of methane and water gas shift (WGS) reactions over highly active and coke resistant Zr0.93Ru0.05O2-delta. The catalyst showed high activity at low temperatures for both the reactions. For WGS reaction, 99% conversion of CO with 100% H-2 selectivity was observed below 290 degrees C. The detailed kinetic studies including influence of gas phase product species, effect of temperature and catalyst loading on the reaction rates have been investigated. For the reforming reaction, the rate of reaction is first order in CH4 concentration and independent of CO and H2O concentration. This indicates that the adsorptive dissociation of CH4 is the rate determining step. The catalyst also showed excellent coke resistance even under a stoichiometric steam/carbon ratio. A lack of CO methanation activity is an important finding of present study and this is attributed to the ionic nature of Ru species. The associative mechanism involving the surface formate as an intermediate was used to correlate experimental data. Copyright (C) 2013, Hydrogen Energy Publications, LLC. Published by Elsevier Ltd. All rights reserved.

Minimizing the Complexity of Fast Sphere Decoding of STBCs

Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.