1. |
|
|
2. |
- Ahlström, Håkan, et al.
(författare)
-
Positron emission tomography in the diagnosis and staging of urinary bladder cancer
- 1996
-
Ingår i: Acta Radiologica. - 0284-1851 .- 1600-0455. ; 37:2, s. 180-185
-
Tidskriftsartikel (refereegranskat)abstract
- PURPOSE: Evaluation of positron emission tomography (PET) using (18)fl 18F-2-fluoro-2-deoxy-D-glucose (18FDG) and L-methyl-11C-methionine in the diagnosis and staging of urinary bladder carcinoma. MATERIAL AND METHODS: Twenty-three patients with biopsy-proven urinary bladder carcinoma were examined with PET after intravenous injection of 11C-methionine; 2 were also examined with 18FDG. The results from the PET investigations were compared with CT or MR findings and TNM classification before and after treatment. RESULTS: The urinary excretion of 18FDG prevented distinction of the primary tumour from the surrounding tracer. With 11C-methionine it was possible to detect 18/23 primary tumours. A trend was seen, suggesting that the higher the uptake values of 11C-methionine in the tumour, the greater the tumour stage. CONCLUSION: It is possible to visualize urinary bladder tumours larger than 1 cm in diameter with PET using (11)C-methionine, but the value of the method in the staging of the lesions is not superior to conventional methods.
|
|
3. |
|
|
4. |
|
|
5. |
|
|
6. |
|
|
7. |
|
|
8. |
- Andersson, Håkan
(författare)
-
Error-Correcting Codes Based on Chaotic Dynamical Systems
- 1998
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This dissertation treats a novel class of error-correcting codes based on chaotic dynamical systems. The codes are defined over a continuous alphabet whereas the information that is to be transmitted belongs to a discrete set of symbols. Simple expressions can be given for the encoders, and the codewords can be described by a parity-check relation. However, the most interesting approach is to view the codewords as orbits of iterated dynamical systems described by integer matrices.Under some rather natural assumptions, the codes are shown to be group codes. The minimum distance is proved to be well-defined and strictly greater than zero. An algorithm for calculating it is also given. Initially, no robust sliding-window encoder inverses exist, but this deficiency is remedied by the introduction of fractal signal sets. The problem of catastrophic encoders is also solved by the introduction of these totally disconnected signal sets.Decoding strategies are discussed, and it is shown why the Viterbi algorithm does not work in higher dimensions for this type of codes. So-called list decoding emerges as a good alternative and its merits are considered. Simulations and comparisons with binary antipodal signaling are performed. The setting of the work is in two dimensions. However, the strength of this code construction is that it easily generalizes to higher dimensions.
|
|
9. |
|
|
10. |
|
|