Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

Improved optical character recognition by matched filtering

The effectiveness of linear matched filters for improved character discrimination in presence of random noise and poorly defined characters has been investigated. We have found that although the performance of the filter in presence of random noise is reasonably good (16 dB gain in signal-to-noise-ratio) its performance is poor when the unknown character is distorted (linear shift and rotation).

Improved optical character recognition by matched filtering

The effectiveness of linear matched filters for improved character discrimination in presence of random noise and poorly defined characters has been investigated. We have found that although the performance of the filter in presence of random noise is reasonably good (16 dB gain in signal-to-noise-ratio) its performance is poor when the unknown character is distorted (linear shift and rotation).

Construction of a cDNA clone for a nuclear-coded subunit of cytochrome c oxidase from rat liver

A cDNA library for 6S–9S poly(A)-containing RNA from rat liver was constructed in Image . Initial screening of the clones was carried out using single stranded 32P-labeled cDNA prepared against poly(A)-containing RNA isolated from immunoadsorbed polyribosomes enriched for the nuclear-coded subunit messenger RNAs of cytochrome c oxidase. One of the clones, pCO89, was found to hybridize with the messenger RNA for subunit VIC. The DNA sequence of the insert in pCO89 was carried out and it has got extensive homology with the C-terminal 33 amino acids of subunit VIC from beef heart cytochrome c oxidase. In addition, the insert contained 146 bp, corresponding to a portion of the 3′-non-coding region. Northern blot analysis of rat liver RNA with the nick-translated insert of pCO89 revealed that the messenger RNA for subunit VI would contain around 510 bases.

Analytical method for solving a set of inhomogeneous infinite simultaneous equations

It is shown that a method based on the principle of analytic continuation can be used to solve a set of inhomogeneous infinite simultaneous equations encountered in the analysis of surface acoustic wave propagation along the periodically perturbed surface of a piezoelectric medium.

Analytical method for solving a set of infinite simultaneous equations

It is shown that a method based on the principle of analytic continuation can be used to solve a set of infinite simultaneous equations encountered in solving for the electric field of a periodic electrode structure.

High-Rate Space-Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-multiple-input multiple-output (MIMO) systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16 X 16 and 32 X 32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.

Assessment of SET Logic Robustness Through Noise Margin Modeling

A compact model for noise margin (NM) of single-electron transistor (SET) logic is developed, which is a function of device capacitances and background charge (zeta). Noise margin is, then, used as a metric to evaluate the robustness of SET logic against background charge, temperature, and variation of SET gate and tunnel junction capacitances (CG and CT). It is shown that choosing alpha=CT/CG=1/3 maximizes the NM. An estimate of the maximum tolerable zeta is shown to be equal to plusmn0.03 e. Finally, the effect of mismatch in device parameters on the NM is studied through exhaustive simulations, which indicates that a isin [0.3, 0.4] provides maximum robustness. It is also observed that mismatch can have a significant impact on static power dissipation.

Electrical switching and in situ Raman scattering studies on the set-reset processes in Ge-Te-Si glass

Bulk Ge15Te83Si2 glass has been found to exhibit memory-type switching for 1 mA current with a threshold electric field of 7.3 kV/cm. The electrical set and reset processes have been achieved with triangular and rectangular pulses, respectively, of 1 mA amplitude. In situ Raman scattering studies indicate that the degree of disorder in Ge15Te83Si2 glass is reduced from off to set state. The local structure of the sample under reset condition is similar to that in the off state. The Raman results are consistent with the switching results which indicate that the Ge15Te83Si2 glass can be set and reset easily. (C) 2007 American Institute of Physics.

Real-coded genetic algorithm for machining condition optimization

In this paper, we consider the machining condition optimization models presented in earlier studies. Finding the optimal combination of machining conditions within the constraints is a difficult task. Hence, in earlier studies standard optimization methods are used. The non-linear nature of the objective function, and the constraints that need to be satisfied makes it difficult to use the standard optimization methods for the solution. In this paper, we present a real coded genetic algorithm (RCGA), to find the optimal combination of machining conditions. We present various issues related to real coded genetic algorithm such as solution representation, crossover operators, and repair algorithm in detail. We also present the results obtained for these models using real coded genetic algorithm and discuss the advantages of using real coded genetic algorithm for these problems. From the results obtained, we conclude that real coded genetic algorithm is reliable and accurate for solving the machining condition optimization models.

Modeling and Analysis of Noise Margin in SET Logic

In this paper the static noise margin for SET (single electron transistor) logic is defined and compact models for the noise margin are developed by making use of the MIB (Mahapatra-Ionescu-Banerjee) model. The variation of the noise margin with temperature and background charge is also studied. A chain of SET inverters is simulated to validate the definition of various logic levels (like VIH, VOH, etc.) and noise margin. Finally the noise immunity of SET logic is compared with current CMOS logic.

Signal set design for full-diversity low-decoding-complexity differential scaled-unitary STBCs

The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-group encodable and g-group decodable linear STBCs is introduced. Then for a known class of rate-1 linear designs, an explicit construction of fully-diverse signal sets that lead to four-group encodable and four-group decodable differential scaled unitary STBCs for any power of two number of antennas is provided. Previous works on differential STBCs either sacrifice decoding complexity for higher rate or sacrifice rate for lower decoding complexity.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Signal set design for full-diversity low-decoding-complexity differential scaled-unitary STBCs

The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-group encodable and g-group decodable linear STBCs is introduced. Then for a known class of rate-1 linear designs, an explicit construction of fully-diverse signal sets that lead to four-group encodable and four-group decodable differential scaled unitary STBCs for any power of two number of antennas is provided. Previous works on differential STBCs either sacrifice decoding complexity for higher rate or sacrifice rate for lower decoding complexity.

The role of polar and facial amphipathic character in determining lipopolysaccharide-binding properties in synthetic cationic peptides

Two series of peptides, designated K and NK were synthesized and tested for lipid A binding and neutralizing properties. K-2, which has an 11-residue amphiphilic core, and a branched N-terminus bearing two branched lysinyl residues does not bind lipid A, while NK2, also with an 11-residue amphiphilic core comprised entirely of non-ionizable residues, and a similarly branched, cationic N-terminus, binds lipid A very weakly. Both peptides do not inhibit lipopolysaccharide (LPS) activity in the Limulus assay, nor do they inhibit LPS-induced TNF-alpha and NO production in 5774 cells. These results are entirely unlike a homologous peptide with an exclusively hydrophobic core whose LPS-binding and neutralizing properties are very similar to that of polymyxin B [David SA, Awasthi SK, Wiese A et al. Characterization of the interactions of a polycationic, amphiphilic, terminally branched oligopeptide with lipid A and lipopolysaccharide from the deep rough mutant of Salmonella minnesota. J Endotoxin Res 1996; 3: 369-379]. These data suggest that a clear segregation of charged and apolar domains is crucial in molecules designed for purposes of LPS sequestration and that head-tail (polar) orientation of the cationic/hydrophobic regions is preferable to molecules with mixed or facial cationic/amphipathic character.