983 resultados para component-oriented programming
Resumo:
The cDNA encoding the NH2-terminal 589 amino acids of the extracellular domain of the human polymeric immunoglobulin receptor was inserted into transfer vectors to generate recombinant baculo- and vaccinia viruses. Following infection of insect and mammalian cells, respectively, the resulting truncated protein corresponding to human secretory component (hSC) was secreted with high efficiency into serum-free culture medium. The Sf9 insect cell/baculovirus system yielded as much as 50 mg of hSC/liter of culture, while the mammalian cells/vaccinia virus system produced up to 10 mg of protein/liter. The M(r) of recombinant hSC varied depending on the cell line in which it was expressed (70,000 in Sf9 cells and 85-95,000 in CV-1, TK- 143B and HeLa). These variations in M(r) resulted from different glycosylation patterns, as evidenced by endoglycosidase digestion. Efficient single-step purification of the recombinant protein was achieved either by concanavalin A affinity chromatography or by Ni(2+)-chelate affinity chromatography, when a 6xHis tag was engineered to the carboxyl terminus of hSC. Recombinant hSC retained the capacity to specifically reassociate with dimeric IgA purified from hybridoma cells.
Resumo:
In a number of programs for gene structure prediction in higher eukaryotic genomic sequences, exon prediction is decoupled from gene assembly: a large pool of candidate exons is predicted and scored from features located in the query DNA sequence, and candidate genes are assembled from such a pool as sequences of nonoverlapping frame-compatible exons. Genes are scored as a function of the scores of the assembled exons, and the highest scoring candidate gene is assumed to be the most likely gene encoded by the query DNA sequence. Considering additive gene scoring functions, currently available algorithms to determine such a highest scoring candidate gene run in time proportional to the square of the number of predicted exons. Here, we present an algorithm whose running time grows only linearly with the size of the set of predicted exons. Polynomial algorithms rely on the fact that, while scanning the set of predicted exons, the highest scoring gene ending in a given exon can be obtained by appending the exon to the highest scoring among the highest scoring genes ending at each compatible preceding exon. The algorithm here relies on the simple fact that such highest scoring gene can be stored and updated. This requires scanning the set of predicted exons simultaneously by increasing acceptor and donor position. On the other hand, the algorithm described here does not assume an underlying gene structure model. Indeed, the definition of valid gene structures is externally defined in the so-called Gene Model. The Gene Model specifies simply which gene features are allowed immediately upstream which other gene features in valid gene structures. This allows for great flexibility in formulating the gene identification problem. In particular it allows for multiple-gene two-strand predictions and for considering gene features other than coding exons (such as promoter elements) in valid gene structures.
Resumo:
To date, state-of-the-art seismic material parameter estimates from multi-component sea-bed seismic data are based on the assumption that the sea-bed consists of a fully elastic half-space. In reality, however, the shallow sea-bed generally consists of soft, unconsolidated sediments that are characterized by strong to very strong seismic attenuation. To explore the potential implications, we apply a state-of-the-art elastic decomposition algorithm to synthetic data for a range of canonical sea-bed models consisting of a viscoelastic half-space of varying attenuation. We find that in the presence of strong seismic attenuation, as quantified by Q-values of 10 or less, significant errors arise in the conventional elastic estimation of seismic properties. Tests on synthetic data indicate that these errors can be largely avoided by accounting for the inherent attenuation of the seafloor when estimating the seismic parameters. This can be achieved by replacing the real-valued expressions for the elastic moduli in the governing equations in the parameter estimation by their complex-valued viscoelastic equivalents. The practical application of our parameter procedure yields realistic estimates of the elastic seismic material properties of the shallow sea-bed, while the corresponding Q-estimates seem to be biased towards too low values, particularly for S-waves. Given that the estimation of inelastic material parameters is notoriously difficult, particularly in the immediate vicinity of the sea-bed, this is expected to be of interest and importance for civil and ocean engineering purposes.
Resumo:
Studies of large sets of SNP data have proven to be a powerful tool in the analysis of the genetic structure of human populations. In this work, we analyze genotyping data for 2,841 SNPs in 12 Sub-Saharan African populations, including a previously unsampled region of south-eastern Africa (Mozambique). We show that robust results in a world-wide perspective can be obtained when analyzing only 1,000 SNPs. Our main results both confirm the results of previous studies, and show new and interesting features in Sub-Saharan African genetic complexity. There is a strong differentiation of Nilo-Saharans, much beyond what would be expected by geography. Hunter-gatherer populations (Khoisan and Pygmies) show a clear distinctiveness with very intrinsic Pygmy (and not only Khoisan) genetic features. Populations of the West Africa present an unexpected similarity among them, possibly the result of a population expansion. Finally, we find a strong differentiation of the south-eastern Bantu population from Mozambique, which suggests an assimilation of a pre-Bantu substrate by Bantu speakers in the region.
Resumo:
We present a new technique for audio signal comparison based on tonal subsequence alignment and its application to detect cover versions (i.e., different performances of the same underlying musical piece). Cover song identification is a task whose popularity has increased in the Music Information Retrieval (MIR) community along in the past, as it provides a direct and objective way to evaluate music similarity algorithms.This article first presents a series of experiments carried outwith two state-of-the-art methods for cover song identification.We have studied several components of these (such as chroma resolution and similarity, transposition, beat tracking or Dynamic Time Warping constraints), in order to discover which characteristics would be desirable for a competitive cover song identifier. After analyzing many cross-validated results, the importance of these characteristics is discussed, and the best-performing ones are finally applied to the newly proposed method. Multipleevaluations of this one confirm a large increase in identificationaccuracy when comparing it with alternative state-of-the-artapproaches.
Resumo:
PURPOSE: Performing total knee replacement, accurate alignment and neutral rotation of the femoral component are widely believed to be crucial for the ultimate success. Contrary to absolute bone referenced alignment, using a ligament balancing technique does not automatically rotate the femoral component parallel to the transepicondylar axis. In this context we established the hypothesis that rotational alignment of the femoral component parallel to the transepicondylar axis (0° ± 3°) results in better outcome than alignment outside of this range. METHODS: We analysed 204 primary cemented mobile bearing total knee replacements five years postoperatively. Femoral component rotation was measured on axial radiographs using the condylar twist angle (CTA). Knee society score, range of motion as well as subjective rating documented outcome. RESULTS: In 96 knees the femoral component rotation was within the range 0 ± 3° (neutral rotation group), and in 108 knees the five-year postoperative rotational alignment of the femoral component was outside of this range (outlier group). Postoperative CTA showed a mean of 2.8° (±3.4°) internal rotation (IR) with a range between 6° external rotation (ER) and 15° IR (CI 95). No difference with regard to subjective and objective outcome could be detected. CONCLUSION: The present work shows that there is a large given natural variability in optimal rotational orientation, in this study between 6° ER and 15° IR, with numerous co-factors determining correct positioning of the femoral component. Further studies substantiating pre- and postoperative determinants are required to complete the understanding of resulting biomechanics in primary TKA.
Resumo:
Glioblastoma (GBM) is a morphologically heterogeneous tumor type with a median survival of only 15 months in clinical trial populations. However, survival varies greatly among patients. As part of a central pathology review, we addressed the question if patients with GBM displaying distinct morphologic features respond differently to combined chemo-radiotherapy with temozolomide. Morphologic features were systematically recorded for 360 cases with particular focus on the presence of an oligodendroglioma-like component and respective correlations with outcome and relevant molecular markers. GBM with an oligodendroglioma-like component (GBM-O) represented 15% of all confirmed GBM (52/339) and was not associated with a more favorable outcome. GBM-O encompassed a pathogenetically heterogeneous group, significantly enriched for IDH1 mutations (19 vs. 3%, p = 0.003) and EGFR amplifications (71 vs. 48%, p = 0.04) compared with other GBM, while co-deletion of 1p/19q was found in only one case and the MGMT methylation frequency was alike (47 vs. 46%). Expression profiles classified most of the GBM-O into two subtypes, 36% (5/14 evaluable) as proneural and 43% as classical GBM. The detection of pseudo-palisading necrosis (PPN) was associated with benefit from chemotherapy (p = 0.0002), while no such effect was present in the absence of PPN (p = 0.86). In the adjusted interaction model including clinical prognostic factors and MGMT status, PPN was borderline nonsignificant (p = 0.063). Taken together, recognition of an oligodendroglioma-like component in an otherwise classic GBM identifies a pathogenetically mixed group without prognostic significance. However, the presence of PPN may indicate biological features of clinical relevance for further improvement of therapy.
Resumo:
The project presented, iCognos, consists of a flexible platform to assist end-users in performing a series of mental tasks with a sensitized mobile telerobotic platform aimed at mitigating the problems associated to cognitive disorders with an ecological cognition approach.
Resumo:
Objective To analyze the practices of primary care focused on the harmful consumption of drugs. Method This is a qualitative study, developed with a dialectical-critical approach. Data collection was carried out through semi-structured interviews with 10 employees of a basic health unit (UBS). Results The demands are not accepted, and if they go beyond the barriers shaped by the historical absence of health care practices for drug users and moralistic and preconceived ideologies, they are not reinterpreted as health needs; practices that meet these demands and go beyond the barriers are poor; the functionalist approach, which explains drug use as a disease and considers drug users as deviants, supports the few existing practices. Conclusion primary health care is mistakenly focused on addiction; it lacks structural elements of the production process in health and internal dynamics of the working processes that would foster the development of collective practices.
Resumo:
Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.
Resumo:
The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.