245 resultados para Partial identification
Resumo:
Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. Using these conditions, we construct a new class of full diversity PIC-SIC decodable codes, which contain the Toeplitz codes and a family of codes recently proposed by Zhang, Xu et. al. as proper subclasses. With the help of the new criteria, we also show that a class of PIC-SIC decodable codes recently proposed by Zhang, Shi et. al. can be decoded with much lower complexity than what is reported, without compromising on full diversity.
Resumo:
This study presents the results of an experimental and analytical comparison of the flexural behavior of a high-strength concrete specimen (no conventional reinforcement) with an average plain concrete cube strength of nearly 65 MPa and containing trough shape steel fibers. Trough shape steel fibers with a volume fraction ranging from 0 to 1.5% and having a constant aspect ratio of 80 have been used in this study. Increased toughness and a more ductile stress-strain response were observed with an increase in fiber content, when the fibers were distributed over the full/partial depth of the beam cross section. Based on the tests, a robust analytical procedure has been proposed to establish the required partial depth to contain fiber-reinforced concrete (FRC) so as to obtain the flexural capacity of a member with FRC over the full depth. It is expected that this procedure will help designers in properly estimating the required partial depth of fibers in composite sections for specific structural applications. Empirical and mechanistic relations have also been proposed in this study to establish the load-deflection behavior of high-strength FRC.
Resumo:
An efficient strategy for identification of delamination in composite beams and connected structures is presented. A spectral finite-element model consisting of a damaged spectral element is used for model-based prediction of the damaged structural response in the frequency domain. A genetic algorithm (GA) specially tailored for damage identification is derived and is integrated with finite-element code for automation. For best application of the GA, sensitivities of various objective functions with respect to delamination parameters are studied and important conclusions are presented. Model-based simulations of increasing complexity illustrate some of the attractive features of the strategy in terms of accuracy as well as computational cost. This shows the possibility of using such strategies for the development of smart structural health monitoring softwares and systems.
Resumo:
As research becomes more and more interdisciplinary, literature search from CD-ROM databases is often carried out on more than one CD-ROM database. This results in retrieving duplicate records due to same literature being covered (indexed) in more than one database. The retrieval software does not identify such duplicate records. Three different programs have been written to accomplish the task of identifying the duplicate records. These programs are executed from a shell script to minimize manual intervention. The various fields that have been used (extracted) to identify the duplicate records include the article title, year, volume number, issue number and pagination. The shell script when executed prompts for input file that may contain duplicate records. The programs identify the duplicate records and write them to a new file.
Resumo:
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-order logic that reduce the problem to a series of ground-level satisfiability problems. R. Jeroslow introduced a partial instantiation method of this kind that differs radically from the standard resolution-based methods. This paper lays the theoretical groundwork for an extension of his method that is general enough and efficient enough for general logic programming with indefinite clauses. In particular we improve Jeroslow's approach by (1) extending it to logic with functions, (2) accelerating it through the use of satisfiers, as introduced by Gallo and Rago, and (3) simplifying it to obtain further speedup. We provide a similar development for a "dual" partial instantiation approach defined by Hooker and suggest a primal-dual strategy. We prove correctness of the primal and dual algorithms for full first-order logic with functions, as well as termination on unsatisfiable formulas. We also report some preliminary computational results.
Resumo:
In the framework of a project aimed at developing a reliable hydrogen generator for mobile polymer electrolyte fuel cells (PEFCs), particular emphasis has been addressed to the analysis of catalysts able to assure high activity and stability in transient operations (frequent start-up and shut-down cycles). In this paper, the catalytic performance of 1 at.% Pt/ceria samples prepared by coprecipitation, impregnation and combustion, has been evaluated in the partial oxidation of methane. Methane conversion and hydrogen selectivity of 96 and 99%, respectively, associated with high stability during 100h of reaction under operative conditions (start-up and shut-down cycles), have been obtained. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
Sandalwood is an economically important aromatic tree belonging to the family Santalaceae. The trees are used mainly for their fragrant heartwood and oil that have immense potential for foreign exchange. Very little information is available on the genetic diversity in this species. Hence studies were initiated and genetic diversity estimated using RAPD markers in 51 genotypes of Santalum album procured from different geographcial regions of India and three exotic lines of S. spicatum from Australia. Eleven selected Operon primers (10mer) generated a total of 156 consistent and unambiguous amplification products ranging from 200bp to 4kb. Rare and genotype specific bands were identified which could be effectively used to distinguish the genotypes. Genetic relationships within the genotypes were evaluated by generating a dissimilarity matrix based on Ward's method (Squared Euclidean distance). The phenetic dendrogram and the Principal Component Analysis generated, separated the 51 Indian genotypes from the three Australian lines. The cluster analysis indicated that sandalwood germplasm within India constitutes a broad genetic base with values of genetic dissimilarity ranging from 15 to 91 %. A core collection of 21 selected individuals revealed the same diversity of the entire population. The results show that RAPD analysis is an efficient marker technology for estimating genetic diversity and relatedness, thereby enabling the formulation of appropriate strategies for conservation, germplasm management, and selection of diverse parents for sandalwood improvement programmes.
Resumo:
Tuberous sclerosis complex (TSC) is an autosomal dominant disorder with loci on chromosome 9q34.12 (TSC1) and chromosome 16p13.3 (TSC2). Genes for both loci have been isolated and characterized. The promoters of both genes have not been characterized so far and little is known about the regulation of these genes. This study reports the characterization of the human TSC1 promoter region for the first time. We have identified a novel alternative isoform in the 5' untranslated region (UTR) of the TSC1 gene transcript involving exon 1. Alternative isoforms in the 5' UTR of the mouse Tsc1 gene transcript involving exon I and exon 2 have also been identified. We have identified three upstream open reading frames (uORFs) in the 5' UTR of the TSC1/Tsc1 gene. A comparative study of the 5' UTR of TSC1/Tsc1 gene has revealed that there is a high degree of similarity not only in the sequence but also in the splicing pattern of both human and mouse TSC1 genes. We have used PCR methodology to isolate approximately 1.6 kb genomic DNA 5' to the TSC1 cDNA. This sequence has directed a high level of expression of luciferase activity in both HeLa and HepG2 cells. Successive 5' and 3' deletion analysis has suggested that a -587 bp region, from position +77 to -510 from the transcription start site (TSS), contains the promoter activity. Interestingly, this region contains no consensus TATA box or CAAT box. However, a 521-bp fragment surrounding the TSS exhibits the characteristics of a CpG island which overlaps with the promoter region. The identification of the TSC1 promoter region will help in designing a suitable strategy to identify mutations in this region in patients who do not show any mutations in the coding regions. It will also help to study the regulation of the TSC1 gene and its role in tumorigenesis. (C) 2003 Elsevier B.V. All rights reserved.
Resumo:
Trypanosoma evansi is a causative agent of `surra', a common haemoprotozoan disease of livestock in India causing high morbidity and mortality in disease endemic areas. The proteinases released by live and dead trypanosomes entail immunosuppression in the infected host, which immensely contribute in disease pathogenesis. Cysteine proteinases are identified in the infectious cycle of trypanosomes such as cruzain from Trypanosoma cruzi, rhodesain or brucipain from Trypanosoma brucei rhodesiense and congopain from Trypanosoma congelense. These enzymes localised in lysosome-like organelles, flagellar pocket and on cell surface, which play a critical role in the life cycle of protozoan parasites, viz. in host invasion, nutrition and alteration of the host immune response. The paper describes the identification of cysteine proteinases of T. evansi lysate, activity profile at different pH optima and inhibition pattern using a specific inhibitor, besides the polypeptide profile of an antigen. Eight proteinases of T. evansi were identified in the molecular weight (MW) ranges of 28-170 kDa using gelatin substrate-polyacrylamide gel electrophoresis (GS-PAGE), and of these proteinases, six were cysteine proteinases, as they were inhibited by L-3-carboxy-2,3-transepoxypropionyl-lecuylamido (4-guanidino)-butane (E-64), a specific inhibitor. These proteolytic enzymes were most reactive in acidic pH between 3.0 and 5.5 in the presence of dithiothreitol and completely inactive at alkaline pH 10.0. Similarly, the GS-PAGE profile of the serum samples of rats infected with T. evansi revealed strong proteolytic activity only at the 28-kDa zone at pH 5.5, while no proteolytic activity was observed in serum samples of uninfected rats. Further, the other zones of clearance, which were evident in T. evansi antigen zymogram, could not be observed in the serum samples of rats infected with T. evansi. The polypeptide pattern of the whole cell lysate antigen revealed 12-15 polypeptide bands ranging from 28 to 81 kDa along with five predominant polypeptides bands (MW of 81, 66, 62, 55 and 45 kDa), which were immunoreactive with hyperimmune serum (HIS) and serum of experimentally infected rabbits with T. evansi infection. The immunoblot recognised antibodies in experimentally infected rabbits and against HIS as well, corresponding to the zone of clearances at lower MW ranges (28-41 kDa), which may be attributed to the potential of these proteinases in the diagnosis of T. evansi infection. Since these thiol-dependent enzymes are most active in acidic pH and considering their inhibition characteristics, these data suggest that they resemble to the mammalian lysosomal cathepsin B and L.
Resumo:
We present a improved language modeling technique for Lempel-Ziv-Welch (LZW) based LID scheme. The previous approach to LID using LZW algorithm prepares the language pattern table using LZW algorithm. Because of the sequential nature of the LZW algorithm, several language specific patterns of the language were missing in the pattern table. To overcome this, we build a universal pattern table, which contains all patterns of different length. For each language it's corresponding language specific pattern table is constructed by retaining the patterns of the universal table whose frequency of appearance in the training data is above the threshold.This approach reduces the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score[LZW-WDS]) for non native languages and increases the LID performance considerably.
Resumo:
A circular array of Piezoelectric Wafer Active Sensor (PWAS) has been employed to detect surface damages like corrosion using lamb waves. The array consists of a number of small PWASs of 10 mm diameter and 1 mm thickness. The advantage of a circular array is its compact arrangement and large area of coverage for monitoring with small area of physical access. Growth of corrosion is monitored in a laboratory-scale set-up using the PWAS array and the nature of reflected and transmitted Lamb wave patterns due to corrosion is investigated. The wavelet time-frequency maps of the sensor signals are employed and a damage index is plotted against the damage parameters and varying frequency of the actuation signal (a windowed sine signal). The variation of wavelet coefficient for different growth of corrosion is studied. Wavelet coefficient as function of time gives an insight into the effect of corrosion in time-frequency scale. We present here a method to eliminate the time scale effect which helps in identifying easily the signature of damage in the measured signals. The proposed method becomes useful in determining the approximate location of the corrosion with respect to the location of three neighboring sensors in the circular array. A cumulative damage index is computed for varying damage sizes and the results appear promising.
Resumo:
We consider the problem of maintaining information about the rank of a matrix $M$ under changes to its entries. For an $n \times n$ matrix $M$, we show an amortized upper bound of $O(n^{\omega-1})$ arithmetic operations per change for this problem, where $\omega < 2.376$ is the exponent for matrix multiplication, under the assumption that there is a {\em lookahead} of up to $\Theta(n)$ locations. That is, we know up to the next $\Theta(n)$ locations $(i_1,j_1),(i_2,j_2),\ldots,$ whose entries are going to change, in advance; however we do not know the new entries in these locations in advance. We get the new entries in these locations in a dynamic manner.