118 resultados para multiplexed sensitivity encoding
Resumo:
The conventional definition of redundancy is applicable to skeletal structural systems only, whereas the concept of redundancy has never been discussed in the context of a continuum. Generally, structures in civil engineering constitute a combination of both skeletal and continuum segments. Hence, this gaper presents a generalized definition of redundancy that has been defined in terms of structural response sensitivity, which is applicable to both continuum and discrete structures. In contrast to the conventional definition of redundancy, which is assumed to be fixed for a given structure and is believed to be independent of loading and material properties, the new definition would depend on strength and response of the structure at a given stage of its service life. The redundancy measure proposed in this paper is linked to the structural response sensitivities. Thus, the structure can have different degrees of redundancy during its lifetime, depending on the response sensitivity under consideration It is believed that this new redundancy measure would be more relevant in structural evaluation, damage assessment, and reliability analysis of structures at large.
Resumo:
Transient thermal sensitivity is studied for systems that are subjected to conductive heat transfer within themselves and radiative heat transfer with the surrounding environment, including solar heat radiation, The battery in the Indian national communication satellite is one such system for which the studies are conducted with respect to panel conduction, conductance of insulating blanket, power dissipation within the battery, and absorptance and emittance of various elements, Comparison of sensitivities revealed that battery temperature is sensitive to its power dissipation during the beginning of life of the spacecraft, whereas toward the end of life of the spacecraft mission, the effect of absorptance of optical solar reflector is dominating, The influence of optical property values of the multilayer insulation blanket is almost negligible. Among the parameters studied in this analysis, the battery temperature is found to be mast sensitive to emittance of the optical solar reflector.
Resumo:
We describe here the characterization of the gene gp64 encoding the envelope fusion protein GP64 (open reading frame) ORF 105 from Bombyx mori nucleopolyhedrovirus (BmNPV). gp64 was transcribed from the early to late stages of infection and the transcripts were seen from 6 to 72 h post infection (hpi). The early transcripts initiated from a consensus CAGT motif while the late transcripts arose from three conserved TAAG motifs, all of which were located in the near upstream region of the coding sequence. Both early and late transcripts terminated at a run of T residues following the second polyadenylation signal located 31 nt downstream of the translation termination codon. BmGP64 protein was detectable from 6 hpi and was present in larger quantities throughout the infection process from 12 hpi, in BmNPV-infected BmN cells. The persistent presence of GP64 in BmN cells differed from the protein expression pattern of GP64 in Autographa californica multinucleocapsid nucleopolyhedrovirus infection, where the protein levels decreased significantly by late times (48 hpi). BmGP64 was located in the membrane and cytoplasm of the infected host cells and as a component of the budded virions. The production of infectious budded virus and the fusion activity were reduced when glycosylation of GP64 was inhibited. (C) 2003 Elsevier Science B.V. All rights reserved.
Resumo:
Sugarcane streak mosaic virus (SCSMV), causes mosaic disease of sugarcane and is thought to belong to a new undescribed genus in the family Potyviridae. The coat protein (CP) gene from the Andhra Pradesh (AP) isolate of SCSMV (SCSMV AP) was cloned and expressed in Escherichia coli. The recombinant coat protein was used to raise high quality antiserum. The CP antiserum was used to develop an immunocapture reverse transcription-polymerase chain reaction (IC-RT-PCR) based assay for the detection and discrimination of SCSMV isolates in South India. The sequence of the cloned PCR products encoding 3'untranslated region (UTR) and CP regions of the virus isolates from three different locations in South India viz. Tanuku (Coastal Andhra Pradesh), Coimbatore (Tamil Nadu) and Hospet (Karnataka) was compared with that of SCSMV AP The analysis showed that they share 89.4, 89.5 and 90% identity respectively at the nucleotide level. This suggests that the isolates causing mosaic disease of sugarcane in South India are indeed strains of SCSMV In addition, the sensitivity of the IC-RT-PCR was compared with direct antigen coating-enzyme linked immunosorbent assay (DAC-ELISA) and dot-blot immunobinding assays and was found to be more sensitive and hence could be used to detect the presence of virus in sugarcane breeding, germplasm centres and in quarantine programs.
Resumo:
A fundamental task in bioinformatics involves a transfer of knowledge from one protein molecule onto another by way of recognizing similarities. Such similarities are obtained at different levels, that of sequence, whole fold, or important substructures. Comparison of binding sites is important to understand functional similarities among the proteins and also to understand drug cross-reactivities. Current methods in literature have their own merits and demerits, warranting exploration of newer concepts and algorithms, especially for large-scale comparisons and for obtaining accurate residue-wise mappings. Here, we report the development of a new algorithm, PocketAlign, for obtaining structural superpositions of binding sites. The software is available as a web-service at http://proline.physicslisc.emetin/pocketalign/. The algorithm encodes shape descriptors in the form of geometric perspectives, supplemented by chemical group classification. The shape descriptor considers several perspectives with each residue as the focus and captures relative distribution of residues around it in a given site. Residue-wise pairings are computed by comparing the set of perspectives of the first site with that of the second, followed by a greedy approach that incrementally combines residue pairings into a mapping. The mappings in different frames are then evaluated by different metrics encoding the extent of alignment of individual geometric perspectives. Different initial seed alignments are computed, each subsequently extended by detecting consequential atomic alignments in a three-dimensional grid, and the best 500 stored in a database. Alignments are then ranked, and the top scoring alignments reported, which are then streamed into Pymol for visualization and analyses. The method is validated for accuracy and sensitivity and benchmarked against existing methods. An advantage of PocketAlign, as compared to some of the existing tools available for binding site comparison in literature, is that it explores different schemes for identifying an alignment thus has a better potential to capture similarities in ligand recognition abilities. PocketAlign, by finding a detailed alignment of a pair of sites, provides insights as to why two sites are similar and which set of residues and atoms contribute to the similarity.
Resumo:
A pi-electron rich supramolecular polymer as an efficient fluorescent sensor for electron deficient nitroaromatic explosives has been synthesized, and the role of H-bonding in dramatic amplification of sensitivity/fluorescence quenching efficiency in the solid state has been established.
Resumo:
We have developed two reduced complexity bit-allocation algorithms for MP3/AAC based audio encoding, which can be useful at low bit-rates. One algorithm derives optimum bit-allocation using constrained optimization of weighted noise-to-mask ratio and the second algorithm uses decoupled iterations for distortion control and rate control, with convergence criteria. MUSHRA based evaluation indicated that the new algorithm would be comparable to AAC but requiring only about 1/10 th the complexity.
Resumo:
The spectra of molecules oriented in liquid crystalline media are dominated by partially averaged dipolar couplings. In the 13C–1H HSQC, due to the inefficient hetero-nuclear dipolar decoupling in the indirect dimension, normally carried out by using a π pulse, there is a considerable loss of resolution. Furthermore, in such strongly orienting media the 1H–1H and 13C–1H dipolar couplings leads to fast dephasing of transverse magnetization causing inefficient polarization transfer and hence the loss of sensitivity in the indirect dimension. In this study we have carried out 13C–1H HSQC experiment with efficient polarization transfer from 1H to 13C for molecules aligned in liquid crystalline media. The homonuclear dipolar decoupling using FFLG during the INEPT transfer delays and also during evolution period combined with the π pulse heteronuclear decoupling in the t1 period has been applied. The studies showed a significant reduction in partially averaged dipolar couplings and thereby enhancement in the resolution and sensitivity in the indirect dimension. This has been demonstrated on pyridazine and pyrimidine oriented in the liquid crystal. The two closely resonating carbons in pyrimidine are better resolved in the present study compared to the earlier work [H.S. Vinay Deepak, Anu Joy, N. Suryaprakash, Determination of natural abundance 15N–1H and 13C–1H dipolar couplings of molecules in a strongly orienting media using two-dimensional inverse experiments, Magn. Reson. Chem. 44 (2006) 553–565].
Resumo:
Compiler optimizations need precise and scalable analyses to discover program properties. We propose a partially flow-sensitive framework that tries to draw on the scalability of flow-insensitive algorithms while providing more precision at some specific program points. Provided with a set of critical nodes — basic blocks at which more precise information is desired — our partially flow-sensitive algorithm computes a reduced control-flow graph by collapsing some sets of non-critical nodes. The algorithm is more scalable than a fully flow-sensitive one as, assuming that the number of critical nodes is small, the reduced flow-graph is much smaller than the original flow-graph. At the same time, a much more precise information is obtained at certain program points than would had been obtained from a flow-insensitive algorithm.