Prior image-constrained l(1)-norm-based reconstruction method for effective usage of structural information in diffuse optical tomography

A novel approach that can more effectively use the structural information provided by the traditional imaging modalities in multimodal diffuse optical tomographic imaging is introduced. This approach is based on a prior image-constrained-l(1) minimization scheme and has been motivated by the recent progress in the sparse image reconstruction techniques. It is shown that the proposed framework is more effective in terms of localizing the tumor region and recovering the optical property values both in numerical and gelatin phantom cases compared to the traditional methods that use structural information. (C) 2012 Optical Society of America

Effective contrast recovery in rapid dynamic near-infrared diffuse optical tomography using l(1)-norm-based linear image reconstruction method

Traditional image reconstruction methods in rapid dynamic diffuse optical tomography employ l(2)-norm-based regularization, which is known to remove the high-frequency components in the reconstructed images and make them appear smooth. The contrast recovery in these type of methods is typically dependent on the iterative nature of method employed, where the nonlinear iterative technique is known to perform better in comparison to linear techniques (noniterative) with a caveat that nonlinear techniques are computationally complex. Assuming that there is a linear dependency of solution between successive frames resulted in a linear inverse problem. This new framework with the combination of l(1)-norm based regularization can provide better robustness to noise and provide better contrast recovery compared to conventional l(2)-based techniques. Moreover, it is shown that the proposed l(1)-based technique is computationally efficient compared to its counterpart (l(2)-based one). The proposed framework requires a reasonably close estimate of the actual solution for the initial frame, and any suboptimal estimate leads to erroneous reconstruction results for the subsequent frames.

Deoxythiosugar Derivatives with Furano, Pyrano, and Septano Motifs from L-Gulono-1,4-lactone and D-Glycero-D-gulo-heptono-1,4-lactone

A short synthesis of thiosugar derivatives mimicking furanose, pyranose, and septanose structures has been achieved starting from L-gulono-1,4-lactone and D-glucoheptono-1,4-lactone. Different strategies used in the synthesis are: (1) a nucleophilic displacement and Michael addition; (2) epoxide ring opening and Michael addition; (3) epoxide ring opening and nucleophilic displacement process; and (4) double nucleophilic displacement. All of these reactions used benzyltriethylammonium tetrathiomolybdate, (BnEt3N)(2)MoS4 as the sulfur-transfer reagent.

Oxidative DNA cleavage, cytotoxicity and antimicrobial studies of L-ornithine copper (II) complexes

New ternary copper (II) complexes, Cu(L-orn)(B)(Cl)](Cl center dot 2H(2)O) (1-2) where L-orn is L-ornithine, B is an N,N-donor heterocyclic base, viz. 2,2'-bipyridine (bpy, 1) and 1,10-phenanthroline (phen, 2), were synthesized and characterized by various spectroscopic techniques. Complex 2 is characterized by the X-ray single crystallographic method. The complex shows a distorted square-pyramidal (4 + 1) CuN3OCl coordination sphere. Binding interactions of the complexes with calf thymus DNA (CT-DNA) were investigated by UV-Vis absorption titration, ethidium bromide displacement assay, viscometric titration experiment and DNA melting studies. Complex 2 shows appreciable chemical nuclease activity in the presence of 3-mercaptopropionic acid (MPA). The complexes were subjected to in vitro cytotoxicity studies against carcinomic human alveolar basal epithelial cells (A-549) and human epithelial (HEp-2) cells. The IC50 values of 1 and 2 are less than that of cisplatin against HEp-2 cell lines. MIC values for 1 against the bacterial strains Streptococcus mutans and Pseudomonas aeruginosa are 0.5 mM. (C) 2012 Elsevier Ltd. All rights reserved.

Generation and analysis of drought stressed subtracted expressed sequence tags from safflower (Carthamus tinctorius L.)

Drought is the most crucial environmental factor that limits productivity of many crop plants. Exploring novel genes and gene combinations is of primary importance in plant drought tolerance research. Stress tolerant genotypes/species are known to express novel stress responsive genes with unique functional significance. Hence, identification and characterization of stress responsive genes from these tolerant species might be a reliable option to engineer the drought tolerance. Safflower has been found to be a relatively drought tolerant crop and thus, it has been the choice of study to characterize the genes expressed under drought stress. In the present study, we have evaluated differential drought tolerance of two cultivars of safflower namely, A1 and Nira using selective physiological marker traits and we have identified cultivar A1 as relatively drought tolerant. To identify the drought responsive genes, we have constructed a stress subtracted cDNA library from cultivar A1 following subtractive hybridization. Analysis of similar to 1,300 cDNA clones resulted in the identification of 667 unique drought responsive ESTs. Protein homology search revealed that 521 (78 %) out of 667 ESTs showed significant similarity to known sequences in the database and majority of them previously identified as drought stress-related genes and were found to be involved in a variety of cellular functions ranging from stress perception to cellular protection. Remaining 146 (22 %) ESTs were not homologous to known sequences in the database and therefore, they were considered to be unique and novel drought responsive genes of safflower. Since safflower is a stress-adapted oil-seed crop this observation has great relevance. In addition, to validate the differential expression of the identified genes, expression profiles of selected clones were analyzed using dot blot (reverse northern), and northern blot analysis. We showed that these clones were differentially expressed under different abiotic stress conditions. The implications of the analyzed genes in abiotic stress tolerance are discussed in our study.

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

Studies on lithium L-ascorbate dihydrate: An interesting chiral nonlinear optical crystal

Lithium L-Ascorbate dihydrate (LLA) is a new metal organic nonlinear optical crystal belonging to the saccharide family. Single crystals of LLA were grown from aqueous solution. Solubility of the crystal has a positive temperature coefficient facilitating growth by slow cooling. Rietveld refinement was used to confirm the phase formation. The crystal has prismatic habit with (010), (001) and (10-1) prominent faces. Thermal analysis shows that the crystal is stable up to 102 degrees C. Transmission spectrum of the crystal extends from 302 nm to 1600 nm. Dielectric spectroscopic analysis revealed Cole Cole behaviour and prominent piezoelectric resonance peaks were observed in the range of 100-200 kHz. Second harmonic generation (SHG) conversion efficiency of up to 2.56 times that of a phase matched KDP crystal was achieved when the (010) plate of LLA single crystal was rotated about the +ve c axis, by 9.4 degrees in the clockwise direction. We also observed SHG conical sections which were attributed to noncollinear phase matching. The observation of the third conical section suggests very high birefringence and large nonlinear coefficients. A detailed study of surface laser damage showed that the crystal has high multiple damage thresholds of 9.7 GW cm(-2) and 42 GW cm(-2) at 1064 nm and 532 nm radiation respectively. (C) 2012 Elsevier B.V. All rights reserved.

EXIT Chart Based Design of Irregular LDPC Codes for Large-MIMO Systems

In this letter, we characterize the extrinsic information transfer (EXIT) behavior of a factor graph based message passing algorithm for detection in large multiple-input multiple-output (MIMO) systems with tens to hundreds of antennas. The EXIT curves of a joint detection-decoding receiver are obtained for low density parity check (LDPC) codes of given degree distributions. From the obtained EXIT curves, an optimization of the LDPC code degree profiles is carried out to design irregular LDPC codes matched to the large-MIMO channel and joint message passing receiver. With low complexity joint detection-decoding, these codes are shown to perform better than off-the-shelf irregular codes in the literature by about 1 to 1.5 dB at a coded BER of 10(-5) in 16 x 16, 64 x 64 and 256 x 256 MIMO systems.

Information-theoretically secure regenerating codes for distributed storage

Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair. Another important aspect of a distributed storage network is its security. In this paper, we consider a threat model where an eavesdropper may gain access to the data stored in a subset of the storage nodes, and possibly also, to the data downloaded during repair of some nodes. We provide explicit constructions of regenerating codes that achieve information-theoretic secrecy capacity in this setting.

W/T SPR codes offer higher throughput in OCDMA networks

In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. Two types of random access protocols are proposed for packet transmission. In protocol 1, all distinct codes and in protocol 2, distinct codes as well as shifted versions of all these codes are used. O-CDMA network performance using optical orthogonal codes (OOCs) 1-D and two-dimensional (2-D) wavelength/time single-pulse-per-row (W/T SPR) codes are analyzed. The main advantage of using 2-D codes instead of one-dimensional (1-D) codes is to reduce the errors due to multiple access interference among different users. SPR codes are chosen as they have nearly ideal correlation properties. In this paper, correlation receiver is considered in the analysis. Using analytical model, we compare the OOC and SPR code performances in O-CDMA networks. We compute packet-success probability and throughput for both the types of codes. The analysis shows improved performance with SPR codes as compared to OOC codes.

A nested linear codes approach to distributed function computation over subspaces

In this paper, we consider a distributed function computation setting, where there are m distributed but correlated sources X1,...,Xm and a receiver interested in computing an s-dimensional subspace generated by [X1,...,Xm]Γ for some (m × s) matrix Γ of rank s. We construct a scheme based on nested linear codes and characterize the achievable rates obtained using the scheme. The proposed nested-linear-code approach performs at least as well as the Slepian-Wolf scheme in terms of sum-rate performance for all subspaces and source distributions. In addition, for a large class of distributions and subspaces, the scheme improves upon the Slepian-Wolf approach. The nested-linear-code scheme may be viewed as uniting under a common framework, both the Korner-Marton approach of using a common linear encoder as well as the Slepian-Wolf approach of employing different encoders at each source. Along the way, we prove an interesting and fundamental structural result on the nature of subspaces of an m-dimensional vector space V with respect to a normalized measure of entropy. Here, each element in V corresponds to a distinct linear combination of a set {Xi}im=1 of m random variables whose joint probability distribution function is given.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

On the treewidth of MDS and Reed-Muller codes

The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we compute exact expressions for the treewidth of maximum distance separable codes, and first- and second-order Reed-Muller codes. These results constitute the only known explicit expressions for the treewidth of algebraic codes.

Network-error correcting codes using small fields

Recently, Ebrahimi and Fragouli proposed an algorithm to construct scalar network codes using small fields (and vector network codes of small lengths) satisfying multicast constraints in a given single-source, acyclic network. The contribution of this paper is two fold. Primarily, we extend the scalar network coding algorithm of Ebrahimi and Fragouli (henceforth referred to as the EF algorithm) to block network-error correction. Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. We give an algorithm which, starting from a given network-error correcting code, can obtain another network code using a small field, with the same error correcting capability as the original code. Our secondary contribution is to improve the EF Algorithm itself. The major step in the EF algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We suggest an alternate method to compute this coprime polynomial, which is faster than the brute force method in the work of Ebrahimi and Fragouli.