778 resultados para predictive algorithm
Resumo:
Background and objective: Tuberculosis (TB) and cancer are two of the main causes of pleural effusions which frequently share similar clinical features and pleural fluid profiles. This study aimed to identify diagnostic models based on clinical and laboratory variables to differentiate tuberculous from malignant pleural effusions. Methods: A retrospective study of 403 patients (200 with TB; 203 with cancer) was undertaken. Univariate analysis was used to select the clinical variables relevant to the models composition. Variables beta coefficients were used to define a numerical score which presented a practical use. The performances of the most efficient models were tested in a sample of pleural exudates (64 new cases). Results: Two models are proposed for the diagnosis of effusions associated with each disease. For TB: (i) adenosine deaminase (ADA), globulins and the absence of malignant cells in the pleural fluid; and (ii) ADA, globulins and fluid appearance. For cancer: (i) patient age, fluid appearance, macrophage percentage and presence of atypical cells in the pleural fluid; and (ii) as for (i) excluding atypical cells. Application of the models to the 64 pleural effusions showed accuracy higher than 85% for all models. Conclusions: The proposed models were effective in suggesting pleural tuberculosis or cancer.
Resumo:
Purpose: The objective of this study was to evaluate the postoperative quality of life (QOL) experienced among a group of 1167 patients who underwent video-assisted thoracoscopic sympathectomy (VATS) to treat primary hyperhidrosis, as compared with the presurgical QOL. Methods: Between February 2002 and June 2007, 1167 patients who had undergone VATS were surveyed. The majority had presented with palmar hyperhidrosis (794 patients; 68%), while 340 (29%) had presented with axillary hyperhidrosis. Based on data obtained from the QOL protocol applied to all of the patients preoperatively, the patients were divided into two groups according to the level of their QOL: group 1 consisted of 312 patients (27%) with poor QOL and group 2 of 855 patients (73%) with very poor QOL. The same protocol was applied postoperatively, and five different levels of satisfaction were obtained. The same parameters were evaluated for both the palmar and the axillary hyperhidrosis subgroups. Results: The patients with very poor QOL had much better results in terms of improvement in QOL than did those with poor QOL ( P < .05). The same result was observed for both the palmar and. axillary hyperhidrosis subgroups (P < .05). Conclusion: The worse the preoperative QOL among patients undergoing sympathectomy to treat primary hyperhidrosis is, the better the postoperative improvement in QOL will be. (J Vase Surg 2010;51:1190-4.)
Resumo:
This study investigates the efficacy of clinical criteria in selecting patients for primary tamoxifen therapy. A total of 60 breast cancer patients with large primary tumors and unknown hormonal receptor status were subjected to primary hormone therapy. Inclusion criteria were age over 60 years old or menopausal status for at least 10 years and no clinical evidence of inflammatory disease and fast tumor growth. The objective response rate was 55%. There was a positive correlation between the lack of clinical response and axillary lymph node metastasis (p = 0.009). Patients with objective response had significantly improved disease-free (p = 0.045) and overall (p = 0.0002) survival over those who did not have response to hormonal therapy. In multivariate analysis, the clinical response to therapy was the most powerful prognostic factor. This analysis demonstrates that clinical criteria were very effective predictor of response to neo-adjuvant hormone therapy in large breast tumors for postmenopausal women. Response to therapy is the major prognostic factor in primary tamoxifen-treated breast cancer.
Resumo:
Incremental parsing has long been recognized as a technique of great utility in the construction of language-based editors, and correspondingly, the area currently enjoys a mature theory. Unfortunately, many practical considerations have been largely overlooked in previously published algorithms. Many user requirements for an editing system necessarily impact on the design of its incremental parser, but most approaches focus only on one: response time. This paper details an incremental parser based on LR parsing techniques and designed for use in a modeless syntax recognition editor. The nature of this editor places significant demands on the structure and quality of the document representation it uses, and hence, on the parser. The strategy presented here is novel in that both the parser and the representation it constructs are tolerant of the inevitable and frequent syntax errors that arise during editing. This is achieved by a method that differs from conventional error repair techniques, and that is more appropriate for use in an interactive context. Furthermore, the parser aims to minimize disturbance to this representation, not only to ensure other system components can operate incrementally, but also to avoid unfortunate consequences for certain user-oriented services. The algorithm is augmented with a limited form of predictive tree-building, and a technique is presented for the determination of valid symbols for menu-based insertion. Copyright (C) 2001 John Wiley & Sons, Ltd.
Resumo:
The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.
Resumo:
A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.
Resumo:
Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.
Resumo:
A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.
Resumo:
Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.