Alpha- versus beta-particle radiopeptide therapy in a human prostate cancer model (213Bi-DOTA-PESIN and 213Bi-AMBA versus 177Lu-DOTA-PESIN)

Recurrent prostate cancer presents a challenge to conventional treatment, particularly so to address micrometastatic and small-volume disease. Use of α-radionuclide therapy is considered as a highly effective treatment in such applications due to the shorter range and exquisite cytotoxicity of α-particles as compared with β-particles. (213)Bi is considered an α-emitter with high clinical potential, due to its short half-life (45.6 minutes) being well matched for use in peptide-receptor radionuclide α-therapy; however, there is limited knowledge available within this context of use. In this study, two novel (213)Bi-labeled peptides, DOTA-PEG(4)-bombesin (DOTA-PESIN) and DO3A-CH(2)CO-8-aminooctanoyl-Q-W-A-V-G-H-L-M-NH(2) (AMBA), were compared with (177)Lu (β-emitter)-labeled DOTA-PESIN in a human androgen-independent prostate carcinoma xenograft model (PC-3 tumor). Animals were injected with (177)Lu-DOTA-PESIN, (213)Bi-DOTA-PESIN, or (213)Bi-AMBA to determine the maximum tolerated dose (MTD), biodistribution, and dosimetry of each agent; controls were left untreated or were given nonradioactive (175)Lu-DOTA-PESIN. The MTD of (213)Bi-DOTA-PESIN and (213)Bi-AMBA was 25 MBq (0.68 mCi) whereas (177)Lu-DOTA-PESIN showed an MTD of 112 MBq (3 mCi). At these dose levels, (213)Bi-DOTA-PESIN and (213)Bi-AMBA were significantly more effective than (177)Lu-DOTA-PESIN. At the same time, (177)Lu-DOTA-PESIN showed minimal, (213)Bi-DOTA-PESIN slight, and (213)Bi-AMBA marked kidney damage 20 to 30 weeks posttreatment. These preclinical data indicate that α-therapy with (213)Bi-DOTA-PESIN or (213)Bi-AMBA is more efficacious than β-therapy. Furthermore, (213)Bi-DOTA-PESIN has a better safety profile than (213)Bi-AMBA, and represents a possible new approach for use in peptide-receptor radionuclide α-therapy treating recurrent prostate cancer.

Parallel-recusive filter structures for the computation of discrete transforms

A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.

Numerical Computation of a Certain Dirichlet Series Attached to Siegel Modular Forms of Degree Two

The Rankin convolution type Dirichlet series D-F,D-G(s) of Siegel modular forms F and G of degree two, which was introduced by Kohnen and the second author, is computed numerically for various F and G. In particular, we prove that the series D-F,D-G(s), which shares the same functional equation and analytic behavior with the spinor L-functions of eigenforms of the same weight are not linear combinations of those. In order to conduct these experiments a numerical method to compute the Petersson scalar products of Jacobi Forms is developed and discussed in detail.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

Computation of discrete cosine transform using Clenshaw's recurence formula

Clenshaw’s recurrenee formula is used to derive recursive algorithms for the discrete cosine transform @CT) and the inverse discrete cosine transform (IDCT). The recursive DCT algorithm presented here requires one fewer delay element per coefficient and one fewer multiply operation per coeflident compared with two recently proposed methods. Clenshaw’s recurrence formula provides a unified development for the recursive DCT and IDCT algorithms. The M v e al gorithms apply to arbitrary lengtb algorithms and are appropriate for VLSI implementation.

Unexpected Polymorphism and Unique Particle Morphologies from Monodisperse Droplet Evaporation

The particle sizes, morphologies, and structures are presented for succinic acid particles formed from the evaporation of uniform droplets created with a vibrating orifice aerosol generator. Particle sizes are monodisperse, and solvent choice is found to be the dominant factor in determining the final morphology and structure. The external particle morphologies range from round to cap shaped, while the surface roughness ranges from fairly smooth to extremely rough and pitted. Internally, the particles have significant void space and noticeable crystals. X-ray diffraction confirms that the particles are crystalline. Thus, the morphologies of the particles take on a crystal filled structure that is unique in comparison to previous particles formed through droplet evaporation. The structure of the particles contains β succinic acid; however, the particles formed from water also contain α succinic acid. α Succinic acid has not previously been able to be formed from solution at near atmospheric conditions. The unique morphologies and ability to identify unexpected polymorphs provide for a potential tool to not only enhance particle engineering but also to identify metastable polymorphs.

Determinants and trajectory of phobic anxiety in patients living with an implantable cardioverter defibrillator

The implantable cardioverter defibrillator (ICD) is the gold standard therapy to prevent life-threatening arrhythmias. Phobic anxiety predicts ventricular arrhythmia in coronary heart disease patients, but little is known about phobic anxiety in ICD patients. This study aimed to identify determinants and the course of phobic anxiety in ICD patients.

Search for a heavy particle decaying into an electron and a muon with the ATLAS detector in sqrt[s] = 7 TeV pp collisions at the LHC

This Letter presents the first search for a heavy particle decaying into an e ± μ(-/+) final state in sqrt[s] = 7 TeV pp collisions at the LHC. The data were recorded by the ATLAS detector during 2010 and correspond to a total integrated luminosity of 35 pb(-1). No excess above the standard model background expectation is observed. Exclusions at 95% confidence level are placed on two representative models. In an R-parity violating supersymmetric model, tau sneutrinos with a mass below 0.75 TeV are excluded, assuming all R-parity violating couplings are zero except λ(311)' = 0.11 and λ312 = 0.07. In a lepton flavor violating model, a Z'-like vector boson with masses of 0.70-1.00 TeV and corresponding cross sections times branching ratios of 0.175-0.183 pb is excluded. These results extend to higher mass R-parity violating sneutrinos and lepton flavor violating Z's than previous constraints from the Tevatron.