A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).

Effect of radio frequency power and thickness on the electrochemical properties of Li2-x MnO3-y thin films

In the present work, Li2-x MnO3-y (LMO) thin films have been deposited by radio frequency (RF) reactive magnetron sputtering using acid-treated Li2MnO3 powder target. Systematic investigations have been carried out to study the effect of RF power on the physicochemical properties of LMO thin films deposited on platinized silicon substrates. X-ray diffraction, electron microscopy, surface chemical analysis and electrochemical studies were carried out for the LMO films after post deposition annealing treatment at 500 A degrees C for 1 h in air ambience. Galvanostatic charge discharge studies carried out using the LMO thin film electrodes, delivered a highest discharge capacity of 139 mu Ah mu m(-1) cm(-2) in the potential window 2.0-3.5 V vs. Li/Li+ at 100 W RF power and lowest discharge capacity of 80 mu Ah mu m(-1) cm(-2) at 75 W RF power. Thereafter, the physicochemical properties of LMO films deposited using optimized RF power 100 W on stainless steel substrates has been studied in the thickness range of 70 to 300 nm as a case study. From the galvanostatic charge discharge experiments, a stable discharge capacity of 68 mu Ah mu m(-1) cm(-2) was achieved in the potential window 2.0-4.2 V vs. Li/Li+ tested up to 30 cycles. As the thickness increased, the specific discharge capacity started reducing with higher magnitude of capacity fading.

Operand Isolation Circuits with Reduced Overhead for Low Power Data-Path Design

Dynamic power dissipation due to redundant switching is an important metric in data-path design. This paper focuses on the use of ingenious operand isolation circuits for low power design. Operand isolation attempts to reduce switching by clamping or latching the output of a first level of combinational circuit. This paper presents a novel method using power supply switching wherein both PMOS and NMOS stacks of a circuit are connected to the same power supply. Thus, the output gets clamped or latched to the power supply value with minimal leakage. The proposed circuits make use of only two transistors to clamp the entire Multiple Input Multiple Output (MIMO) block. Also, the latch-based designs have higher drive strength in comparison to the existing methods. Simulation results have shown considerable area reduction in comparison to the existing techniques without increasing timing overhead.

Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Opportunistic selection in multi-node wireless systems improves system performance by selecting the ``best'' node and by using it for data transmission. In these systems, each node has a real-valued local metric, which is a measure of its ability to improve system performance. Our goal is to identify the best node, which has the largest metric. We propose, analyze, and optimize a new distributed, yet simple, node selection scheme that combines the timer scheme with power control. In it, each node sets a timer and transmit power level as a function of its metric. The power control is designed such that the best node is captured even if. other nodes simultaneously transmit with it. We develop several structural properties about the optimal metric-to-timer-and-power mapping, which maximizes the probability of selecting the best node. These significantly reduce the computational complexity of finding the optimal mapping and yield valuable insights about it. We show that the proposed scheme is scalable and significantly outperforms the conventional timer scheme. We investigate the effect of. and the number of receive power levels. Furthermore, we find that the practical peak power constraint has a negligible impact on the performance of the scheme.

Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

ADAPTATION OF MW LEVEL NATURAL GAS LEAN BURN ENGINE FOR PRODUCER GAS OPERATION A GRID CONNECTED POWER PLANT

Availability of producer gas engines at MW being limited necessitates to adapt engine from natural gas operation. The present work focus on the development of necessary kit for adapting a 12 cylinder lean burn turbo-charged natural gas engine rated at 900 kWe (Waukesha make VHP5904LTD) to operate on producer and set up an appropriate capacity biomass gasification system for grid linked power generation in Thailand. The overall plant configuration had fuel processing, drying, reactor, cooling and cleaning system, water treatment, engine generator and power evacuation. The overall project is designed for evacuation of 1.5 MWe power to the state grid and had 2 gasification system with the above configuration and 3 engines. Two gasification system each designed for about 1100 kg/hr of woody biomass was connected to the engine using a producer gas carburetor for the necessary Air to fuel ratio control. In the use of PG to fuel IC engines, it has been recognized that the engine response will differ as compared to the response with conventional fueled operation due to the differences in the thermo-physical properties of PG. On fuelling a conventional engine with PG, power de-rating can be expected due to the lower calorific value (LCV), lower adiabatic flame temperature (AFT) and the lower than unity product to reactant more ratio. Further the A/F ratio for producer gas is about 1/10th that of natural gas and requires a different carburetor for engine operation. The research involved in developing a carburetor for varying load conditions. The patented carburetor is based on area ratio control, consisting of a zero pressure regulator and a separate gas and air line along with a mixing zone. The 95 litre engine at 1000 rpm has an electrical efficiency of 33.5 % with a heat input of 2.62 MW. Each engine had two carburetors designed for producer gas flow each capable of handling about 1200 m3/hr in order to provide similar engine heat input at a lower conversion efficiency. Cold flow studies simulating the engine carburetion system results showed that the A/F was maintained in the range of 1.3 +/- 0.1 over the entire flow range. Initially, the gasification system was tested using woody biomass and the gas composition was found to be CO 15 +/- 1.5 % H-2 22 +/- 2% CH4 2.2 +/- 0.5 CO2 11.25 +/- 1.4 % and rest N-2, with the calorific value in the range of 5.0 MJ/kg. After initial trials on the engine to fine tune the control system and adjust various engine operating parameter a peak load of 800 kWe was achieved, while a stable operating conditions was found to be at 750 kWe which is nearly 85 % of the natural gas rating. The specific fuel consumption was found to be 0.9 kg of biomass per kWh.

SWEETENING OF BIOGAS IN SPRAY TOWERS FOR POWER GENERATION

This paper presents the experience of the new design of using impinging jet spray columns for scrubbing hydrogen sulfide from biogas that has been developed by Indian Institute of Science and patented. The process uses a chelated polyvalent metal ion which oxidizes the hydrogen sulfide to sulfur as a precipitate. The sulfur generated is filtered and the scrubbing liquid recycled after oxidation. The process involves in bringing contact the sour gas with chelated liquid in the spray columns where H2S reacts with chelated Fe3+ and precipitates as sulfur, whereas Fe3+ gets reduced to Fe2+. Fe2+ is regenerated to Fe3+ by reaction of oxygen in air in a separate packed column. The regenerated liquid is recirculated. Sulfur is filtered and separated as a byproduct. The paper presents the experience in using the spray towers for hydrogen sulfide removal and further use of the clean gas for generating power using gas engines. The maximum allowable limit of H2S for the gas engine is 200 ppm (v/v) in order to prevent any corrosion of engine parts and fouling of the lubricating oil. With the current ISET process, the hydrogen sulfide from the biogas is cleaned to less than 100 ppm (v/v) and the sweet gas is used for power generation. The system is designed for 550 NM3/hr of biogas and inlet H2S concentration of 2.5 %. The inlet concentration of the H2S is about 1 - 1.5 % and average measured outlet concentration is about 30 ppm, with an average gas flow of about 300 - 350 NM3/hr, which is the current gas production rate. The sweet gas is used for power generation in a 1.2 MWe V 12 engine. The average power generation is about 650 - 750 kWe, which is the captive load of the industry. The plant is a CHP (combined heat power) unit with heat from the cylinder cooling and flue being recovered for hot water and steam generation respectively. The specific fuel consumption is 2.29 kWh/m(3) of gas. The system has been in operation for more than 13,000 hours in last one year in the industry. About 8.4 million units of electricity has been generated scrubbing about 2.1 million m3 of gas. Performance of the scrubber and the engine is discussed at daily performance level and also the overall performance with an environment sustenance by precipitating over 27 tons of sulfur.

Rainbow matchings in strongly edge-colored graphs

A rainbow matching of an edge-colored graph G is a matching in which no two edges have the same color. There have been several studies regarding the maximum size of a rainbow matching in a properly edge-colored graph G in terms of its minimum degree 3(G). Wang (2011) asked whether there exists a function f such that a properly edge-colored graph G with at least f (delta(G)) vertices is guaranteed to contain a rainbow matching of size delta(G). This was answered in the affirmative later: the best currently known function Lo and Tan (2014) is f(k) = 4k - 4, for k >= 4 and f (k) = 4k - 3, for k <= 3. Afterwards, the research was focused on finding lower bounds for the size of maximum rainbow matchings in properly edge-colored graphs with fewer than 4 delta(G) - 4 vertices. Strong edge-coloring of a graph G is a restriction of proper edge-coloring where every color class is required to be an induced matching, instead of just being a matching. In this paper, we give lower bounds for the size of a maximum rainbow matching in a strongly edge-colored graph Gin terms of delta(G). We show that for a strongly edge-colored graph G, if |V(G)| >= 2 |3 delta(G)/4|, then G has a rainbow matching of size |3 delta(G)/4|, and if |V(G)| < 2 |3 delta(G)/4|, then G has a rainbow matching of size |V(G)|/2] In addition, we prove that if G is a strongly edge-colored graph that is triangle-free, then it contains a rainbow matching of size at least delta(G). (C) 2015 Elsevier B.V. All rights reserved.

SEPARATION DIMENSION OF BOUNDED DEGREE GRAPHS

The separation dimension of a graph G is the smallest natural number k for which the vertices of G can be embedded in R-k such that any pair of disjoint edges in G can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family F of total orders of the vertices of G such that for any two disjoint edges of G, there exists at least one total order in F in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on n vertices is Theta(log n). In this article, we focus on bounded degree graphs and show that the separation dimension of a graph with maximum degree d is at most 2(9) (log*d)d. We also demonstrate that the above bound is nearly tight by showing that, for every d, almost all d-regular graphs have separation dimension at least d/2]

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

Adaptive Pulse Width Control and Sampling for Low Power Pulse Oximetry

Remote sensing of physiological parameters could be a cost effective approach to improving health care, and low-power sensors are essential for remote sensing because these sensors are often energy constrained. This paper presents a power optimized photoplethysmographic sensor interface to sense arterial oxygen saturation, a technique to dynamically trade off SNR for power during sensor operation, and a simple algorithm to choose when to acquire samples in photoplethysmography. A prototype of the proposed pulse oximeter built using commercial-off-the-shelf (COTS) components is tested on 10 adults. The dynamic adaptation techniques described reduce power consumption considerably compared to our reference implementation, and our approach is competitive to state-of-the-art implementations. The techniques presented in this paper may be applied to low-power sensor interface designs where acquiring samples is expensive in terms of power as epitomized by pulse oximetry.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

Optimal Power Allocation Policies for Low Powered Wireless Communication Systems

We consider optimal average power allocation policies in a wireless channel in the presence of individual delay constraints on the transmitted packets. Power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. We have developed a computationally efficient online algorithm, when there is same hard delay constraint for all packets. Later on, we generalize it to the case when there are multiple real time streams with different hard deadline constraints. Our algorithm uses linear programming and has very low complexity.

Excitation- and power-dependent photoluminescence from oxidized Ge

Wafer/microcrystallites of oxidized Ge with holes/nanoholes synthesized by thermal oxidation strategy from Ge wafer/microcrystallites can convert one wavelength to another. Both oxidized Ge wafer and microcrystallites shows excitation- and power-dependent luminescence. Red-shift is observed as the excitation wavelength is increased, while blue-shift is observed as power density is increased. Over all, blue-green-yellow-orange luminescence is observed depending on the excitation wavelength and the morphology of oxidized Ge. The various defects level associated with germanium-oxygen vacancies in GeO2 and Ge/GeO2 interface are responsible for the excitation-dependent luminescence. Being a light-conversion material, oxidized Ge is expected to find potential applications in solid-state lighting, photovoltaic devices and photocatalysis. (C) 2013 Elsevier B.V. All rights reserved.

Three-degree-of-freedom Parallel Manipulator to Track the Sun for Concentrated Solar Power Systems

In concentrated solar power(CSP) generating stations, incident solar energy is reflected from a large number of mirrors or heliostats to a faraway receiver. In typical CSP installations, the mirror needs to be moved about two axes independently using two actuators in series with the mirror effectively mounted at a single point. A three degree-of-freedom parallel manipulator, namely the 3-RPS parallel manipulator, is proposed to track the sun. The proposed 3-RPS parallel manipulator supports the load of the mirror, structure and wind loading at three points resulting in less deflection, and thus a much larger mirror can be moved with the required tracking accuracy and without increasing the weight of the support structure. The kinematics equations to determine motion of the actuated prismatic joints in the 3-RPS parallel manipulator such that the sun's rays are reflected on to a stationary receiver are developed. Using finite element analysis, it is shown that for same sized mirror, wind loading and maximum deflection requirement, the weight of the support structure is between 15% and 60% less with the 3-RPS parallel manipulator when compared to azimuth-elevation or the target-aligned configurations.