994 resultados para soft-commutation technique
Resumo:
Having determined in a phase I study the maximum tolerated dose of high-dose ifosfamide combined with high-dose doxorubicin, we now report the long-term results of a phase II trial in advanced soft-tissue sarcomas. Forty-six patients with locally advanced or metastatic soft-tissue sarcomas were included, with age <60 years and all except one in good performance status (0 or 1). The chemotherapy treatment consisted of ifosfamide 10 g m(-2) (continuous infusion for 5 days), doxorubicin 30 mg m(-2) day(-1) x 3 (total dose 90 mg m(-2)), mesna and granulocyte-colony stimulating factor. Cycles were repeated every 21 days. A median of 4 (1-6) cycles per patient was administered. Twenty-two patients responded to therapy, including three complete responders and 19 partial responders for an overall response rate of 48% (95% CI: 33-63%). The response rate was not different between localised and metastatic diseases or between histological types, but was higher in grade 3 tumours. Median overall survival was 19 months. Salvage therapies (surgery and/or radiotherapy) were performed in 43% of patients and found to be the most significant predictor for favourable survival (exploratory multivariate analysis). Haematological toxicity was severe, including grade > or =3 neutropenia in 59%, thrombopenia in 39% and anaemia in 27% of cycles. Three patients experienced grade 3 neurotoxicity and one patient died of septic shock. This high-dose regimen is toxic but nonetheless feasible in multicentre settings in non elderly patients with good performance status. A high response rate was obtained. Prolonged survival was mainly a function of salvage therapies.
Resumo:
BACKGROUND: Individually, randomised trials have not shown conclusively whether adjuvant chemotherapy benefits adult patients with localised resectable soft-tissue sarcoma.METHODS: A quantitative meta-analysis of updated data from individual patients from all available randomised trials was carried out to assess whether adjuvant chemotherapy improves overall survival, recurrence-free survival, and local and distant recurrence-free intervals (RFI) and whether chemotherapy is differentially effective in patients defined by age, sex, disease status at randomisation, disease site, histology, grade, tumour size, extent of resection, and use of radiotherapy.FINDINGS: 1568 patients from 14 trials of doxorubicin-based adjuvant chemotherapy were included (median follow-up 9.4 years). Hazard ratios of 0.73 (95% CI 0.56-0.94, p = 0.016) for local RFI, 0.70 (0.57-0.85, p = 0.0003) for distant RFI, and 0.75 (0.64-0.87, p = 0.0001) for overall recurrence-free survival, correspond to absolute benefits from adjuvant chemotherapy of 6% (95% CI 1-10), 10% (5-15), and 10% (5-15), respectively, at 10 years. For overall survival the hazard ratio of 0.89 (0.76-1.03) was not significant (p = 0.12), but represents an absolute benefit of 4% (1-9) at 10 years. These results were not affected by prespecified changes in the groups of patients analysed. There was no consistent evidence that the relative effect of adjuvant chemotherapy differed for any subgroup of patients for any endpoint. However, the best evidence of an effect of adjuvant chemotherapy for survival was seen in patients with sarcomas of the extremities.INTERPRETATION: The meta-analysis provides evidence that adjuvant doxorubicin-based chemotherapy significantly improves the time to local and distant recurrence and overall recurrence-free survival. There is a trend towards improved overall survival.
Resumo:
The toxicity of heavy metals in natural waters is strongly dependent on the local chemical environment. Assessing the bioavailability of radionuclides predicts the toxic effects to aquatic biota. The technique of diffusive gradients in thin films (DGT) is largely exploited for bioavailability measurements of trace metals in waters. However, it has not been applied for plutonium speciation measurements yet. This study investigates the use of DGT technique for plutonium bioavailability measurements in chemically different environments. We used a diffusion cell to determine the diffusion coefficients (D) of plutonium in polyacrylamide (PAM) gel and found D in the range of 2.06-2.29 × 10(-6) cm(2) s(-1). It ranged between 1.10 and 2.03 × 10(-6) cm(2) s(-1) in the presence of fulvic acid and in natural waters with low DOM. In the presence of 20 ppm of humic acid of an organic-rich soil, plutonium diffusion was hindered by a factor of 5, with a diffusion coefficient of 0.50 × 10(-6) cm(2) s(-1). We also tested commercially available DGT devices with Chelex resin for plutonium bioavailability measurements in laboratory conditions and the diffusion coefficients agreed with those from the diffusion cell experiments. These findings show that the DGT methodology can be used to investigate the bioaccumulation of the labile plutonium fraction in aquatic biota.
Resumo:
Ni technophile, ni technophobe, un éthicien s'interroge sur son rôle alors que la question de l'éthiquement correct se pose à lui de plus en plus souvent. Pourquoi cette urgence? A quel imaginaire renvoie-t-elle? Son hypothèse est la suivante: le monde technique serait désormais «la» nouvelle nature et il continue sa course quasi-automatiquement; il ferait ainsi de nous des «objets», par exemple de simples «épiphénomènes d'un programme génétique», à exploiter ou à surveiller. D'où notre besoin d'être rassurés.
Resumo:
Aquest projecte consisteix en la realització d'un entorn gràfic que serveixi per generar SoCs basats en el processador soft-core OpenRISC. Aquest entorn permetrà afegir diferents components de manera dinàmica a un repositori d’IPs, mostrar i sel·leccionar qualsevol component disponible dins d’aquest repositori, amb la finalitat d’unir-los al bus del sistema i fer-los accessibles al processador OpenRISC. L’entorn també mostrarà en tot moment com va evolucionant el nostre SoC, guardarà cadascún dels projectes que es realitzen amb aquest entorn i finalment permetrà generar el SoC dissenyat.
Resumo:
Worm burdens recovered from inbred mice strains, namely C57Bl/6, C57Bl/10, CBA, BALB/c, DBA/2 and C3H/He, conventionally maintained in two institutional animal houses in the State of Rio de Janeiro, RJ, Brazil, were analyzed and compared, regarding their prevalences and mean intensities.Three parasite species were observed: the nematodes Aspiculuris tetraptera, Syphacia obvelata and the cestode Vampirolepis nana. A modification of the anal swab technique is also proposed for the first time as an auxiliary tool for the detection of oxyurid eggs in mice
Resumo:
Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.