Cyclic Prefix Based Cooperative Sequential Spectrum Sensing Algorithms for OFDM

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.

Mechanistic investigations on the efficient catalytic decomposition of peroxynitrite by ebselen analogues

In this study, ebselen and its analogues are shown to be catalysts for the decomposition of peroxynitrite (PN). This study suggests that the PN-scavenging ability of selenenyl amides can be enhanced by a suitable substitution at the phenyl ring in ebselen. Detailed mechanistic studies on the reactivity of ebselen and its analogues towards PN reveal that these compounds react directly with PN to generate highly unstable selenoxides that undergo a rapid hydrolysis to produce the corresponding seleninic acids. The selenoxides interact with nitrite more effectively than the corresponding seleninic acids to produce nitrate with the regeneration of the selenenyl amides. Therefore, the amount of nitrate formed in the reactions mainly depends on the stability of the selenoxides. Interestingly, substitution of an oxazoline moiety on the phenyl ring stabilizes the selenoxide, and therefore, enhances the isomerization of PN to nitrate.

Improved preprocessing methods for modulo scheduling algorithms

Instruction scheduling with an automaton-based resource conflict model is well-established for normal scheduling. Such models have been generalized to software pipelining in the modulo-scheduling framework. One weakness with existing methods is that a distinct automaton must be constructed for each combination of a reservation table and initiation interval. In this work, we present a different approach to model conflicts. We construct one automaton for each reservation table which acts as a compact encoding of all the conflict automata for this table, which can be recovered for use in modulo-scheduling. The basic premise of the construction is to move away from the Proebsting-Fraser model of conflict automaton to the Muller model of automaton modelling issue sequences. The latter turns out to be useful and efficient in this situation. Having constructed this automaton, we show how to improve the estimate of resource constrained initiation interval. Such a bound is always better than the average-use estimate. We show that our bound is safe: it is always lower than the true initiation interval. This use of the automaton is orthogonal to its use in modulo-scheduling. Once we generate the required information during pre-processing, we can compute the lower bound for a program without any further reference to the automaton.

On the explicit determination of the polar decomposition in n-dimensional vector spaces

A method for the explicit determination of the polar decomposition (and the related problem of finding tensor square roots) when the underlying vector space dimension n is arbitrary (but finite), is proposed. The method uses the spectral resolution, and avoids the determination of eigenvectors when the tensor is invertible. For any given dimension n, an appropriately constructed van der Monde matrix is shown to play a key role in the construction of each of the component matrices (and their inverses) in the polar decomposition.

Oxidation and decomposition of NH3 over combustion synthesized Al2O3 and CeO2 supported Pt, Pd and Ag catalysts

The catalytic oxidation and decomposition of NH3 have been carried out over combustion synthesized Al2O3 and CeO2 supported Pt, Pd and Ag catalysts using temperature programmed reaction (TPR) technique in a packed bed tubular reactor. Metals are ionically dispersed over CeO2 and fine metal particles are found on Al2O3. NH3 oxidation occurs over 1% Pt/Al2O3, 1% Pd/Al2O3 and 1% Ag/Al2O3 at 175, 270 and 350 C respectively producing N-2, NO, N2O and H2O, whereas 1% Pt/CeO2, 1% Pd/CeO2 and 1% Ag/CeO2 give N-2 along with NO, N2O and H2O at 200, 225 and 250degreesC respectively. N-2 predominates over other nitrogen-containing products during the reaction on all catalysts. At less O-2 concentration, N-2 and H2O are the only products obtained during NH3 Oxidation. NH3 decomposition over all the catalysts occurs above 450degreesC.

Decomposition temperatures of Cu2Ln2O5 (Ln = Tb, Dy, Ho, Er, Tm, Yb, and Lu) compounds

The equilibrium decomposition temperatures of Cu2Ln2O5 (Ln = Tb, Dy, Ho, Er, Tm, Yb, and Lu) compounds have been measured using a combined DTA-TGA apparatus under a flowing Ar + O2 gas mixture, in which the partial pressure of oxygen was controlled at 5.0 × 103 Pa. The Cu2Ln2O5 compounds yield Ln2O3 and Cu2O on decomposition. The decomposition temperature increases monotonically with the atomic number of the lanthanide element. This suggests that the stability of the Cu2Ln2O5 compounds with respect to the component binary oxides increases with decreasing radius of the Ln3+ ion.

Kinetic decomposition of Ni2SiO4 in oxygen potential gradients

Nickel orthosilicate (Ni2SiO4) has been found to decompose into its component binary oxides in oxygen potential gradients at 1373 K. Nickel oxide was formed at the high oxygen potential boundary, while silica was detected at the low oxygen potential side. Significant porosity and fissures were observed near the Ni2SiO4/SiO2 interface and the SiO2 layer. The critical oxygen partial pressure ratio required for decomposition varied from 1.63 to 2.15 as the oxygen pressures were altered from 1.01 ⊠ 105 to 2.7X 10−4 Pa, well above the dissociation pressure of Ni2SiO4. Platinum markers placed at the boundaries of the Ni2SiO4 sample indicated growth of NiO at the higher oxygen potential boundary, without any apparent transport of material to the low oxygen potential side. However, significant movement of the bulk Ni2SiO4 crystal with respect to the marker was not observed. The decomposition of the silicate occurs due to the unequal rates of transport of Ni and Si. The critical oxygen partial pressure ratio required for decomposition is related both to the thermodynamic stability of Ni2SiO4 with respect to component oxides and the ratio of diffusivities of nickel and silicon. Kinetic decomposition of multicomponent oxides, first discovered by Schmalzried, Laqua, and co-workers [H. Schmalzried, W. Laqua, and P. L. Lin, Z. Natur Forsch. Teil A 34, 192 (1979); H. Schmalzried and W. Laqua, Oxid. Met. 15, 339 (1981); W. Laqua and H. Schmalzried, Chemical Metallurgy—A Tribute to Carl Wagner (Metallurgical Society of the AIME, New York, 1981), p. 29] has important consequences for their use at high temperatures and in geochemistry.

An investigation of carbon nanotubes obtained from the decomposition of methane over reduced Mg1− xM xAl2O4 spinel catalysts

Carbon nanotubes produced by the treatment of Mg1−xMxAl2O4 (M = Fe, Co, or Ni; x = 0.1, 0.2, 0.3, or 0.4) spinels with an H2–CH4 mixture at 1070 °C have been investigated systematically. The grains of the oxide-metal composite particles are uniformly covered by a weblike network of carbon nanotube bundles, several tens of micrometers long, made up of single-wall nanotubes with a diameter close to 4 nm. Only the smallest metal particles (<5 nm) are involved in the formation of the nanotubes. A macroscopic characterization method involving surface area measurements and chemical analysis has been developed in order to compare the different nanotube specimens. An increase in the transition metal content of the catalyst yields more carbon nanotubes (up to a metal content of 10.0 wt% or x = 0.3), but causes a decrease in carbon quality. The best compromise is to use 6.7 wt% of metal (x = 0.2) in the catalyst. Co gives superior results with respect to both the quantity and quality of the nanotubes. In the case of Fe, the quality is notably hampered by the formation of Fe3C particles.

Low complexity Bit allocation algorithms for AAC encoding

We have developed two reduced complexity bit-allocation algorithms for MP3/AAC based audio encoding, which can be useful at low bit-rates. One algorithm derives optimum bit-allocation using constrained optimization of weighted noise-to-mask ratio and the second algorithm uses decoupled iterations for distortion control and rate control, with convergence criteria. MUSHRA based evaluation indicated that the new algorithm would be comparable to AAC but requiring only about 1/10 th the complexity.

Efficient Algorithms for Combinatorial Auctions with Volume Discounts Arising in Web Service Composition

Web services are now a key ingredient of software services offered by software enterprises. Many standardized web services are now available as commodity offerings from web service providers. An important problem for a web service requester is the web service composition problem which involves selecting the right mix of web service offerings to execute an end-to-end business process. Web service offerings are now available in bundled form as composite web services and more recently, volume discounts are also on offer, based on the number of executions of web services requested. In this paper, we develop efficient algorithms for the web service composition problem in the presence of composite web service offerings and volume discounts. We model this problem as a combinatorial auction with volume discounts. We first develop efficient polynomial time algorithms when the end-to-end service involves a linear workflow of web services. Next we develop efficient polynomial time algorithms when the end-to-end service involves a tree workflow of web services.

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.