The standard enthalpy and entropy of formation of Rh2O3 - A third-law optimization

The standard Gibbs energy of formation of Rh203 at high temperature has been determined recently with high precision. The new data are significantly different from those given in thermodynamic compilations.Accurate values for enthalpy and entropy of formation at 298.15 K could not be evaluated from the new data,because reliable values for heat capacity of Rh2O3 were not available. In this article, a new measurement of the high temperature heat capacity of Rh2O3 using differential scanning calorimetry (DSC) is presented.The new values for heat capacity also differ significantly from those given in compilations. The information on heat capacity is coupled with standard Gibbs energy of formation to evaluate values for standard enthalpy and entropy of formation at 289.15 K using a multivariate analysis. The results suggest a major revision in thermodynamic data for Rh2O3. For example, it is recommended that the standard entropy of Rh203 at 298.15 K be changed from 106.27 J mol-' K-'given in the compilations of Barin and Knacke et al. to 75.69 J mol-' K". The recommended revision in the standard enthalpy of formation is from -355.64 kJ mol-'to -405.53 kJ mol".

Generalized distributive law for ML decoding of STBCs

The Generalized Distributive Law (GDL) is a message passing algorithm which can efficiently solve a certain class of computational problems, and includes as special cases the Viterbi's algorithm, the BCJR algorithm, the Fast-Fourier Transform, Turbo and LDPC decoding algorithms. In this paper GDL based maximum-likelihood (ML) decoding of Space-Time Block Codes (STBCs) is introduced and a sufficient condition for an STBC to admit low GDL decoding complexity is given. Fast-decoding and multigroup decoding are the two algorithms used in the literature to ML decode STBCs with low complexity. An algorithm which exploits the advantages of both these two is called Conditional ML (CML) decoding. It is shown in this paper that the GDL decoding complexity of any STBC is upper bounded by its CML decoding complexity, and that there exist codes for which the GDL complexity is strictly less than the CML complexity. Explicit examples of two such families of STBCs is given in this paper. Thus the CML is in general suboptimal in reducing the ML decoding complexity of a code, and one should design codes with low GDL complexity rather than low CML complexity.

Band-Structure Lineup at In0.2Ga0.8N/Si Heterostructures by X-ray Photoelectron Spectroscopy

In0.2Ga0.8N layers were directly grown on Si(111) substrate by plasma-assisted molecular beam epitaxy (PAMBE). Structural characteristics of the as-grown InGaN epilayers were evaluated high resolution X-ray diffraction and composition of InGaN was estimated from photoluminescence spectra using the standard Vegard's law. High-resolution X-ray photoemission spectroscopy measurements were used to determine the band offset of wurtzite-In0.2Ga0.8N/Si(111) heterojunctions. The valence band of InGaN is found to be 2.08 +/- 0.04 eV below that of Si. The conduction band offset (CBO) of InGaN/Si heterojunction is found similar to 0.74 eV and a type-II heterojunction. (C) 2012 The Japan Society of Applied Physics

Retro-Proportional-Navigation: A New Guidance Law for Interception of High-Speed Targets

In this paper, a new proportional-navigation guidance law, called retro-proportional-navigation, is proposed. The guidance law is designed to intercept targets that are of higher speeds than the interceptor. This is a typical scenario in a ballistic target interception. The capture region analysis for both proportional-navigation and retro-proportional-navigation guidance laws are presented. The study shows that, at the cost of a higher intercept time, the retro-proportional-navigation guidance law demands lower terminal lateral acceleration than proportional navigation and can intercept high-velocity targets from many initial conditions that the classical proportional navigation cannot. Also, the capture region with the retro-proportional-navigation guidance law is shown to be larger compared with the classical proportional-navigation guidance law.

Use of Fick's law and Maxwell–Stefan equations in computation of multicomponent diffusion

This article does not have an abstract.

Power-law transformation for enhanced recognition of born-digital word images

In this paper, we discuss the issues related to word recognition in born-digital word images. We introduce a novel method of power-law transformation on the word image for binarization. We show the improvement in image binarization and the consequent increase in the recognition performance of OCR engine on the word image. The optimal value of gamma for a word image is automatically chosen by our algorithm with fixed stroke width threshold. We have exhaustively experimented our algorithm by varying the gamma and stroke width threshold value. By varying the gamma value, we found that our algorithm performed better than the results reported in the literature. On the ICDAR Robust Reading Systems Challenge-1: Word Recognition Task on born digital dataset, as compared to the recognition rate of 61.5% achieved by TH-OCR after suitable pre-processing by Yang et. al. and 63.4% by ABBYY Fine Reader (used as baseline by the competition organizers without any preprocessing), we achieved 82.9% using Omnipage OCR applied on the images after being processed by our algorithm.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Extension of the universal erosive burning law to partly symmetric propellant grain geometries

This paper aims at extending the universal erosive burning law developed by two of the present authors from axi-symmetric internally burning grains to partly symmetric burning grains. This extension revolves around three dimensional flow calculations inside highly loaded grain geometry and benefiting from an observation that the flow gradients normal to the surface in such geometries have a smooth behavior along the perimeter of the grain. These are used to help identify the diameter that gives the same perimeter the characteristic dimension rather than a mean hydraulic diameter chosen earlier. The predictions of highly loaded grains from the newly chosen dimension in the erosive burning law show better comparison with measured pressure-time curves while those with mean hydraulic diameter definitely over-predict the pressures. (c) 2013 IAA. Published by Elsevier Ltd. All rights reserved.

Generalized distributive law for ML decoding of STBCs: further results

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In [1], we introduced a framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-graph based Sum-Product Algorithm, and showed that for two specific families of STBCs, the Toepltiz codes and the Overlapped Alamouti Codes (OACs), the GDL based ML decoders have strictly less complexity than the CML decoders. In this paper, we introduce a `traceback' step to the GDL decoding algorithm of STBCs, which enables roughly 4 times reduction in the complexity of the GDL decoders proposed in [1]. Utilizing this complexity reduction from `traceback', we then show that for any STBC (not just the Toeplitz and Overlapped Alamouti Codes), the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from Cyclic Division Algebras that is not multigroup or conditionally multigroup decodable, the GDL decoder provides approximately 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only about half as complex as the CML decoder.

Sliding mode control based guidance law with impact time constraints

In this paper, the sliding mode control based guidance laws to intercept stationary targets at a desired impact time are proposed. Then, it is extended to constant velocity targets using the notion of predicted interception. The desired impact time is achieved by selecting the interceptor's lateral acceleration to enforce a sliding mode on a switching surface designed using non-linear engagement dynamics. Numerical simulation results are presented to validate the proposed guidance law for different initial engagement geometries, impact times and salvo attack scenarios

Infection of Human Endothelial Cells by Japanese Encephalitis Virus: Increased Expression and Release of Soluble HLA-E

Japanese encephalitis virus (JEV) is a single stranded RNA virus that infects the central nervous system leading to acute encephalitis in children. Alterations in brain endothelial cells have been shown to precede the entry of this flavivirus into the brain, but infection of endothelial cells by JEV and their consequences are still unclear. Productive JEV infection was established in human endothelial cells leading to IFN-beta and TNF-alpha production. The MHC genes for HLA-A, -B, -C and HLA-E antigens were upregulated in human brain microvascular endothelial cells, the endothelial-like cell line, ECV 304 and human foreskin fibroblasts upon JEV infection. We also report the release/shedding of soluble HLA-E (sHLA-E) from JEV infected human endothelial cells for the first time. This shedding of sHLA-E was blocked by an inhibitor of matrix metalloproteinases (MMP). In addition, MMP-9, a known mediator of HLA solubilisation was upregulated by JEV. In contrast, human fibroblasts showed only upregulation of cell-surface HLA-E. Addition of UV inactivated JEV-infected cell culture supernatants stimulated shedding of sHLA-E from uninfected ECV cells indicating a role for soluble factors/cytokines in the shedding process. Antibody mediated neutralization of TNF-alpha as well as IFNAR receptor together not only resulted in inhibition of sHLA-E shedding from uninfected cells, it also inhibited HLA-E and MMP-9 gene expression in JEV-infected cells. Shedding of sHLA-E was also observed with purified TNF-alpha and IFN-beta as well as the dsRNA analog, poly (I:C). Both IFN-beta and TNF-alpha further potentiated the shedding when added together. The role of soluble MHC antigens in JEV infection is hitherto unknown and therefore needs further investigation.