Search

To analyze the clinical and pathological informations of metastatic prostate cancer patients to find the predictive factors of the survival.To filter 364 cases of metastatic prostate cancer in the 940 cases of prostate cancer that were treated in Cancer Hospital Fudan University in Shanghai from March 1998 to June 2009, the cases had hormonal therapy and full clinical and pathological records. All the 364 cases were followed up and the clinical and pathological informations were analyzed, to find the predictive factors that related to the prognosis. Statistic software SPSS 15.0 was used for analysis. Cumulative survival was analyzed by the method of Kaplan-Meier. Cox regression was used for univariate and multivariate analysis. Log-rank method was used for the significance test.The last follow-up date was 30th June 2009 and the median follow-up time was 24 months. At the final follow-up, 240 cases were alive, 109 cases were dead and 15 cases were lost to follow up. The median survival time of metastatic prostate cancer was 64 months, and the one-year, two-year, three-year, four-year, five-year survival rate was 92%, 78%, 66%, 60%, 54%. The univariate analysis indicated that Gleason score (P = 0.033), clinical stage (P0.001), the effectiveness of hormonal therapy (P0.001), the prostate specific antigen (PSA) nadir during hormonal therapy (P0.001) and the time from the start of hormonal therapy to the PSA nadir (P = 0.002) were predictive factors for the survival time of metastatic prostate cancer. The multivariate analysis indicated that the PSA nadir during hormonal therapy (P0.001) and the time from the start of hormonal therapy to the PSA nadir (P0.001) were independent factors that predict the survival time of metastatic prostate cancer.The PSA nadir during hormonal therapy and the time from the start of hormonal therapy to the PSA nadir are independent factors that predict the survival time of metastatic prostate cancer.

To evaluate the effect of technical improvements of transperitoneal radical nephrectomy on the patients with large renal cell carcinoma.From May 2002 until May 2009, 45 patients with large (12 cm) renal cell carcinoma underwent transperitoneal radical nephrectomy. A subcostal incision was selected to expose the extraperitoneal area. The modified operative methods included exposing the operative field via a liver retractor and initially ligating renal artery to block the blood supply of kidney and tumor. The method of tumor-free tissue dissociation was applied. Hem-o-lock was employed for clipping so as to avoid hemorrhage. This modified technique was evaluated in respects of operating time, estimated blood loss, intra-operative complications, postoperative complications, length of hospital stay and pathological diagnoses.The tumor diameter was from 12.2 cm to 28.3 cm with a mean of 14.5 cm. The mean operative time was (150 +/- 58) min and the average estimated blood loss (350 +/- 180) ml. Three cases received blood transfusion. The average length of hospital stay was (12 +/- 6) days. Three cases developed complications, including spleen injury in 2 and pancreatic injury in 1. The treatment modalities were splenectomy and resection of pancreatic tail respectively. The pathological diagnoses were all of renal cell carcinoma. The pathological stage included T(2)N(0 approximately 1)M(0 approximately 1)(n = 13), T(3)N(0 approximately 1)M(0 approximately 1)(n = 23), T(4)N(0 approximately 1)M(0 approximately 1)(n = 9). After a follow-up period of 3 - 63 months, 3 cases of tumor recurrence were found in primary renal clutch.Improved radical nephrectomy is feasible for large renal cell carcinoma. And it can reduce the volume of blood loss and decrease the occurrence of complications.

To analyze predictive factors of advanced metastatic castration-resistant prostate cancer.From December 1996 to March 2008, 250 cases of advanced metastatic prostate cancer progressed into the stage of hormonal independent prostate cancer. The last follow-up date was 31 March 2008 and the median follow-up time was 24 months. During the follow-up, 131 cases were alive, 105 cases were dead and 14 cases were lost to follow-up. Clinical and pathological information of the cases was analyzed to find the predictive factors that related to the prognosis.The median survival time of advanced metastatic castration-resistant prostate cancer was 30 months, and the one-year, two-year, three-year survival rate was 79%, 59%, and 41%. The univariate analysis indicated that prostate specific antigen (PSA) at diagnosis, clinical stage, the PSA nadir during hormonal therapy, the time form the start of hormonal therapy to the PSA nadir, the time of response duration during hormonal therapy, PSA velocity (PSAV) and PSA doubling time (PSADT) at the emergency of castration-resistant prostate cancer, age and PSA at the diagnosis of castration-resistant prostate cancer were factors that predicted the survival time of advanced metastatic castration-resistant prostate cancer. The multivariate analysis indicated that the PSA nadir during hormonal therapy, the time form the start of hormonal therapy to the PSA nadir, PSAV at the emergency of castration-resistant prostate cancer, the time of response duration during hormonal therapy were independent factors that predicted the survival time of advanced metastatic castration-resistant prostate cancer.The PSA nadir during hormonal therapy, the time form the start of hormonal therapy to the PSA nadir, PSAV at the emergency of castration-resistant prostate cancer and the time of response duration during hormonal therapy are independent factors that predict the survival time of advanced metastatic castration-resistant prostate cancer.

The Cartesian product of two graphs can combine the two topologies; this method can inherit the properties from the both topologies. Cayley digraph is an excellent model for interconnection networks, it has good properties such as vertex transitive, symmetry, low degree and diameter. In this paper, we discuss some properties in Cartesian product of Cayley graphs including Hamiltonian circle, large fault tolerant and its coset graphs.

Biswapped network(BSN) is a recently proposed network model of parallel computing, which is built of 2n copies of an n-nodes basic network, and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. BSN uses a simple rule for connectivity to ensure its regularity and some topological properties of BSN have been investigated. In this paper, we show the topological properties of the BSN-Hypercube network and present an efficient broadcasting scheme on the BSN-Hypercube network

Biswapped network (BSN) is a recently proposed network model of parallel computing, which is built of 2n copies of an n-node basic network, and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. BSN uses a simple rule for connectivity to ensure its regularity and some topological properties of BSN have been investigated. In this paper, we present sorting algorithm on the n processors BSN whose basic network has Hamiltonian path, and if the basic network of BSN is mesh, sorting n unordered elements will complete in time radic(2n) + O(n3/4).

In this paper, we propose a new routing algorithm for the general incomplete star interconnection network (GISN). The diameter of GISN is shown to be bounded by 3.5n-5. This improves on a 4n-7 routing algorithm described earlier in Shi Yutao, et al., (2002). We also prove that the diameter of GISN is more than or equals to lfloor3(n-2)/2rfloor+1.

Let n, s be positive integers such that 2 ≤ s < n and s = n/2 . An undirected double-loop network G(n; 1, s) is an undirected graph (V,E), where V =Zn={0, 1, 2, . . . , n−1} and E={(i, i+1 (mod n)), (i, i+s (mod n)) | i ∈ Z}. It is a circulant graph with n nodes and degree 4. In this paper, the sufficient and necessary conditions for a class of undirected double-loop networks to be optimal are presented. By these conditions, 6 new optimal and 5 new suboptimal infinite families of undirected double-loop networks are given.

To assess the risk of aerosol transmission in severe acute respiratory syndrome (SARS) patients admitted to Hospital through testing the air samples.Air samples were collected from 7 wards and 1 balcony of the Hospital, 3 times a day for 3 continuous days, using bioaerosol sampler type FA-2. Bioaerosol particles were then washed down from the samples by serum-free Dulbecco's Modified Eagle Medium (DMEM) culture medium. Nested-reverse transcription-polymerase chain reaction (RT-PCR) was used to amplify the N protein gene of the SARS associated coronavirus (SARS-CoV) from these washing solutions. The residual solutions were inoculated into prepared cell cultures to isolate live virus. The positive samples were then identified by indirect immunofluorescence assay and sequence analysis of the PCR products.Positive rates of RT-PCR test on air samples were 29.03% in the wards and 20.0% in balcony respectively. Results from sequential analysis showed that the homology of amplified cDNA fragments to previously known SARS-CoV stains was 98%. A strain of live pathogen was isolated from one of the 36 samples. The isolate could cause typical cytopathic effects, similar to those SARS-CoV on Vero-E6 cells and the effects could be stably passed. Indirect immunofluorescence assay showed positive from serum of a SARS patient.SARS-CoV existed in the air hospital, where SARS patients were admitted to, but the activity of SARS-CoV in air samples was rather low. SARS patients could still shed SARS-CoV even during the recovery phase. Potential possibility of aerosol transmission might exist within 1 meter square area around SARS patients.

AIM: To study whether severe acute respiratory syndrome coronavirus (SARS-CoV) could be excreted from digestive system. METHODS: Cell culture and semi-nested RT-PCR were used to detect SARS-CoV and its RNA from 21 stool and urine samples, and a kind of electropositive filter media particles was used to concentrate the virus in 10 sewage samples from two hospitals receiving SARS patients in Beijing in China. RESULTS: It was demonstrated that there was no live SARS-CoV in all samples collected, but the RNA of SARS-CoV could be detected in seven stool samples from SARS patients with any one of the symptoms of fever, malaise, cough, or dyspnea, in 10 sewage samples before disinfection and 3 samples after disinfection from the two hospitals. The RNA could not be detected in urine and stool samples from patients recovered from SARS. CONCLUSION: Nucleic acid of SARS-CoV can be excreted through the stool of patients into sewage system, and the possibility of SARS-CoV transmitting through digestive system cannot be excluded.

Undirected double-loop networks G(n; ± s1, ± s2), where n is the number of its nodes, s1 and s2 are its steps, 1≤s1

The transmission of severe acute respiratory syndrome-associated coronavirus (SARS-CoV) is associated with close contact to SARS patients and droplet secretions of those patients. The finding of positive RT-PCR results from stools of SARS patients suggests that stools of SARS patients or sewage containing stools of patients could transmit SARS-CoV. We used a novel style of electropositive filter media particle to concentrate the SARS-CoV from the sewage of two hospitals receiving SARS patients in Beijing. We also used cell culture, RT-PCR and gene sequencing to detect and identify the viruses from sewage. No infectious SARS-CoV contamination was found in any of the samples collected, but the nucleic acid of SARS-CoV could be detected in the sewage from the two hospitals before disinfection. While the RNA was only detected in three samples from the 309th Hospital, the others were negative after disinfection. These findings provide strong evidence that SARS-CoV can be excreted through the stool/urine of patients into sewage system, thus making the sewage system a possible route of transmission.

Let n, s be positive integers such that . A directed double-loop network G(n ; 1, s) is a directed graph (V, E), where V = Zn = {0, 1, 2, ... , n–1 }, E = { i$\longrightarrow i + 1 ({\rm mod} n)$, = 0, 1, 2, ... , n–1 }. An attention deserving problem is: for a given positive integer n, how to choose an integer s such that the diameter of G(n; 1, s) is minimal. An O(k2.5n0.25logn) algorithm, where O(k) is upper-bounded by O(n0.25), is given in this paper to determine s such that the diameter of G(n; 1, s) is minimal.