Calibration of YSZ sensor for the measurement of oxygen concentration in Lbe

Although liquid lead-bismuth eutectic (LBE) is a good candidate for coolant in the sub-critical transmutation blanket, it is known to be corrosive to stainless steel tubes and containers used in nuclear installations. To prevent the long-term corrosion problem by producing and maintaining a protective oxide layer on exposed surface of stainless steel, it is essential to accurately measure and control the oxygen concentration dissolved in LBE. An automobile style voltametric oxygen sensors, with YSZ (Yttria Stabilized Zirconia) as electrolyte and molten bismuth saturated with oxygen as reference was selected. An instrumentation system was designed specifically for calibrating the YSZ sensor and measure oxygen concentration in LBE. An initial setup was built and some preliminary experiments were conducted to calibrate the oxygen sensor. A set of calibration curves of voltage vs. temperature ranging from 300°C to 500°C under various oxygen concentrations in liquid LBE was obtained and presented here. A new improvised setup and instrumentation have also been developed to obtain more accurate results for a wide range of temperature between 300°C to 700°C

Morphological filtering on hypergraphs

The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyper edge set of a hypergraph H, by defining a vertex-hyperedge correspondence. This allows us to recover the classical notion of a dilation/erosion of a subset of vertices and to extend it to subhypergraphs of H. Afterward, we propose several new openings, closings, granulometries and alternate sequential filters acting (i) on the subsets of the vertex and hyperedge set of H and (ii) on the subhypergraphs of a hypergraph

Adaptive ‘imperfect’ decision feedback equalizer for a frequency selective communication channel

In this paper, we show that, for an uncoded receiver system, the proposed least mean square (LMS) decision aided equalizer (DAE), with, the backward step-size constant greater than forward step-size constant, compared to classical equal-step size design, has a lower mean square error by upto 5 dB, for a frequency selective wireless communication channel. Classical LMS DAE with equal step-size constants, can be considered as perfect decision feedback system, compared to, the proposed unequal step-size, as a imperfect decision feedback system. We provide, Wiener DAE, considering imperfect decision feedback information, during training mode and provide analysis for LMS DAE with unequal step size constants

The common and uncommon cestodal infestation encountered in routine histopathological practice from a semi-urban population in south India and their public health importance.

Parasites are encountered uncommonly in routine histopathologic practice. Among them, cestodes form a major bulk. Cysticercosis heads the list forming the bulk of cases followed by Hydatidosis and Sparganosis. Microscopic identification of inflammation with surrounding reactions along with other morphological features forms the mainstay of diagnosis of parasitic diseases on histopathology. Identification of the parasites on histopathological examination would reduce the cost-diagnosis ratio avoiding expensive serological investigation

Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs

This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. For both problems, we determine the maximum and minimum weights that each edge can have so that a given path remains optimal. For both problems, we show how to determine these maximum and minimum values for all edges in O(m + K log K) time, where m is the number of edges in the network, and K is the number of edges on the given optimal path