Quality of life compared during pharmacological treatments and clinical monitoring for non-localized prostate cancer: a randomized controlled trial

To investigate the effects of different management strategies for non-localized prostate cancer on men's quality of life and cognitive functioning. Men with prostate cancer were randomly assigned to one of four treatment arms: leuprorelin, goserelin, cyproterone acetate (CPA), or close clinical monitoring. In a repeated-measures design, men were assessed before treatment (baseline) and after 6 and 12 months of treatment. A community comparison group of men of the same age with no prostate cancer participated for the same length of time. The men were recruited from public and private urology departments from university teaching hospitals. All those with prostate cancer who were eligible for hormonal therapy had no symptoms requiring immediate therapy. In all, 82 patients were randomized and 62 completed the 1-year study, and of the 20 community participants, 15 completed the study. The main outcome measures were obtained from questionnaires on emotional distress, existential satisfaction, physical function and symptoms, social and role function, subjective cognitive function, and sexual function, combined with standard neuropsychological tests of memory, attention, and executive functions. Sexual dysfunction increased for patients on androgen-suppressing therapies, and emotional distress increased in those assigned to CPA or close clinical monitoring. Compared with before treatment there was evidence of an adverse effect of leuprorelin, goserelin, and CPA on cognitive function. In deciding the timing of androgen suppression therapy for prostate cancer, consideration should be given to potential adverse effects on quality of life and cognitive function.

A prospective study of the use of alternative therapies by men with localized prostate cancer

Although the use of alternative therapies is highly prevalent amongst men with prostate cancer, research about the predictors of such use is limited. The current study aimed to describe prospectively the use of alternative therapies by men diagnosed with localized prostate cancer and identify predictors of alternative therapy use. In all, 111 men newly diagnosed with localized prostate cancer (93% response) were recruited to the study prior to treatment. Men's use of alternative therapies and psychological variables including: psychological distress, orientation to health care, decisional conflict, and health locus of control, were assessed at three time points-(1) before treatment; (2) 2 months after completion of treatment; and (3) 12 months after completion of treatment. Demographic information was also obtained. The percentage of men using alternative therapies was 25, 17 and 14% before treatment, 2 and 12 months after treatment, respectively. In general, the most commonly used therapies were dietary changes, vitamins and herbal and nutrient remedies. Alternative therapy use was not related to final treatment choices. Before treatment, men who used alternative therapies were more uncertain about prostate cancer compared to men who were not using these therapies. Men who were using alternative therapies 12 months after treatment were less psychologically distressed that men who were not using these therapies. Health locus of control and orientation to health care were not found to be related to men's use of alternative therapies. In conclusion, men's use of alternative therapies after localized prostate cancer varied across time in terms of the incidence of use, the types of therapies used, and the psychological correlates of therapy use. Informational support that targets uncertainty about prostate cancer may assist men at diagnosis who are considering alternative therapy use. The potential for alternative therapies to have a supportive function in patient care requires further investigation. (C) 2003 Elsevier Ireland Ltd. All rights reserved.

Genetic algorithms with applications in wireless communications

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.

System for foreign exchange trading using genetic algorithms and reinforcement learning

Foreign exchange trading has emerged recently as a significant activity in many countries. As with most forms of trading, the activity is influenced by many random parameters so that the creation of a system that effectively emulates the trading process will be very helpful. A major issue for traders in the deregulated Foreign Exchange Market is when to sell and when to buy a particular currency in order to maximize profit. This paper presents novel trading strategies based on the machine learning methods of genetic algorithms and reinforcement learning.

Localized heating or cooling in mesoscopic devices by electron transport

We describe a method to produce local heating or cooling (depending on how the system is tuned) in a mesoscopic device by transport of electrons. The mechanism can operate on molecules or quantum dots, or any system where the local modes are coupled to vibrations. We believe this will be of future interest in micro electro mechanical systems (MEMS). The amount of heating/cooling obtained depends on the details of the device. We also perform a numerical calculation to display the effect. (C) 2004 Elsevier B.V. All rights reserved.

Sorting nexin 5 is localized to a subdomain of the early endosomes and is recruited to the plasma imembrane following EGF stimulation

Sorting nexins are a large family of proteins that contain the phosphoinositide-binding Phox homology (PX) domain. A number of sorting nexins are known to bind to PtdIns(3)P, which mediates their localization to membranes of the endocytic pathway. We show here that sorting nexin 5 (SNX5) can be recruited to two distinct membrane compartments. In non-stimulated cells, the PX domain was independently targeted to endosomal structures and colocalized with full-length SNX5. The membrane binding of the PX domain was inhibited by the PI 3-kinase inhibitor, wortmannin. Although SNX5 colocalized with a fluid-phase marker and was found predominantly within a PtdIns(3)P-rich endosomal domain, very little colocalization was observed between SNX5 and the PtdIns(3)P-binding protein, EEA1. Using liposome-based binding assays, we have shown that the PX domain of SNX5 interacts not only with PtdIns(3)P but also with PtdIns(3,4)P-2. In response to EGF stimulation, either the SNX5-PX domain or full-length SNX5 was rapidly recruited to the plasma membrane. The localization of SNX1, which does not bind PtdIns(3,4)P-2, was unaffected by EGF signalling. Therefore, SNX5 is localized to a subdomain of the early endosome distinct from EEA1 and, following EGF stimulation and elevation of PtdIns(3,4)P-2, is also transiently recruited to the plasma membrane. These results indicate that SNX5 may have functions not only associated with endosomal sorting but also with the phosphoinositide-signalling pathway.

Evaluation of cosmic ray rejection algorithms on single-shot exposures

To maximise data output from single-shot astronomical images, the rejection of cosmic rays is important. We present the results of a benchmark trial comparing various cosmic ray rejection algorithms. The procedures assess relative performances and characteristics of the processes in cosmic ray detection, rates of false detections of true objects, and the quality of image cleaning and reconstruction. The cosmic ray rejection algorithms developed by Rhoads (2000, PASP, 112, 703), van Dokkum (2001, PASP, 113, 1420), Pych (2004, PASP, 116, 148), and the IRAF task xzap by Dickinson are tested using both simulated and real data. It is found that detection efficiency is independent of the density of cosmic rays in an image, being more strongly affected by the density of real objects in the field. As expected, spurious detections and alterations to real data in the cleaning process are also significantly increased by high object densities. We find the Rhoads' linear filtering method to produce the best performance in the detection of cosmic ray events; however, the popular van Dokkum algorithm exhibits the highest overall performance in terms of detection and cleaning.

The correspondence framework for 3D surface matching algorithms

Beyond the inherent technical challenges, current research into the three dimensional surface correspondence problem is hampered by a lack of uniform terminology, an abundance of application specific algorithms, and the absence of a consistent model for comparing existing approaches and developing new ones. This paper addresses these challenges by presenting a framework for analysing, comparing, developing, and implementing surface correspondence algorithms. The framework uses five distinct stages to establish correspondence between surfaces. It is general, encompassing a wide variety of existing techniques, and flexible, facilitating the synthesis of new correspondence algorithms. This paper presents a review of existing surface correspondence algorithms, and shows how they fit into the correspondence framework. It also shows how the framework can be used to analyse and compare existing algorithms and develop new algorithms using the framework's modular structure. Six algorithms, four existing and two new, are implemented using the framework. Each implemented algorithm is used to match a number of surface pairs. Results demonstrate that the correspondence framework implementations are faithful implementations of existing algorithms, and that powerful new surface correspondence algorithms can be created. (C) 2004 Elsevier Inc. All rights reserved.

Time-evolution of highly localized positive-energy states of the free Dirac electron

Highly localized positive-energy states of the free Dirac electron are constructed and shown to evolve in a simple way under the action of Dirac's equation. When the initial uncertainty in position is small on the scale of the Compton wavelength, there is an associated uncertainty in the mean energy that is large compared with the rest mass of the electron. However, this does not lead to any breakdown of the one-particle description, associated with the possibility of pair-production, but rather leads to a rapid expansion of the probability density outwards from the point of localization, at speeds close to the speed of light.

Improved algorithms for rare event simulation with heavy tails

The estimation of P(S-n > u) by simulation, where S, is the sum of independent. identically distributed random varibles Y-1,..., Y-n, is of importance in many applications. We propose two simulation estimators based upon the identity P(S-n > u) = nP(S, > u, M-n = Y-n), where M-n = max(Y-1,..., Y-n). One estimator uses importance sampling (for Y-n only), and the other uses conditional Monte Carlo conditioning upon Y1,..., Yn-1. Properties of the relative error of the estimators are derived and a numerical study given in terms of the M/G/1 queue in which n is replaced by an independent geometric random variable N. The conclusion is that the new estimators compare extremely favorably with previous ones. In particular, the conditional Monte Carlo estimator is the first heavy-tailed example of an estimator with bounded relative error. Further improvements are obtained in the random-N case, by incorporating control variates and stratification techniques into the new estimation procedures.

A class of self-stabilizing MCA learning algorithms

In this letter, we propose a class of self-stabilizing learning algorithms for minor component analysis (MCA), which includes a few well-known MCA learning algorithms. Self-stabilizing means that the sign of the weight vector length change is independent of the presented input vector. For these algorithms, rigorous global convergence proof is given and the convergence rate is also discussed. By combining the positive properties of these algorithms, a new learning algorithm is proposed which can improve the performance. Simulations are employed to confirm our theoretical results.

Spatially localized distortions of event time

A fundamental question about the perception of time is whether the neural mechanisms underlying temporal judgements are universal and centralized in the brain or modality specific and distributed []. Time perception has traditionally been thought to be entirely dissociated from spatial vision. Here we show that the apparent duration of a dynamic stimulus can be manipulated in a local region of visual space by adapting to oscillatory motion or flicker. This implicates spatially localized temporal mechanisms in duration perception. We do not see concomitant changes in the time of onset or offset of the test patterns, demonstrating a direct local effect on duration perception rather than an indirect effect on the time course of neural processing. The effects of adaptation on duration perception can also be dissociated from motion or flicker perception per se. Although 20 Hz adaptation reduces both the apparent temporal frequency and duration of a 10 Hz test stimulus, 5 Hz adaptation increases apparent temporal frequency but has little effect on duration perception. We conclude that there is a peripheral, spatially localized, essentially visual component involved in sensing the duration of visual events.