Direct in vitro and in vivo comparison of 161Tb and 177Lu using a tumour-targeting folate conjugate

Purpose The radiolanthanide 161Tb (T 1/2 = 6.90 days, Eβ− av = 154 keV) was recently proposed as a potential alternative to 177Lu (T 1/2 = 6.71 days, Eβ− av = 134 keV) due to similar physical decay characteristics but additional conversion and Auger electrons that may enhance the therapeutic efficacy. The goal of this study was to compare 161Tb and 177Lu in vitro and in vivo using a tumour-targeted DOTA-folate conjugate (cm09). Methods 161Tb-cm09 and 177Lu-cm09 were tested in vitro on folate receptor (FR)-positive KB and IGROV-1 cancer cells using a 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyltetrazolium bromide (MTT) viability assay. In vivo 161Tb-cm09 and 177Lu-cm09 (10 MBq, 0.5 nmol) were investigated in two different tumour mouse models with regard to the biodistribution, the possibility for single photon emission computed tomography (SPECT) imaging and the antitumour efficacy. Potentially undesired side effects were monitored over 6 months by determination of plasma parameters and examination of kidney function with quantitative SPECT using 99mTc-dimercaptosuccinic acid (DMSA). Results To obtain half-maximal inhibition of tumour cell viability a 4.5-fold (KB) and 1.7-fold (IGROV-1) lower radioactivity concentration was required for 161Tb-cm09 (IC50 ~0.014 MBq/ml and ~2.53 MBq/ml) compared to 177Lu-cm09 (IC50 ~0.063 MBq/ml and ~4.52 MBq/ml). SPECT imaging visualized tumours of mice with both radioconjugates. However, in therapy studies 161Tb-cm09 reduced tumour growth more efficiently than 177Lu-cm09. These findings were in line with the higher absorbed tumour dose for 161Tb-cm09 (3.3 Gy/MBq) compared to 177Lu-cm09 (2.4 Gy/MBq). None of the monitored parameters indicated signs of impaired kidney function over the whole time period of investigation after injection of the radiofolates. Conclusion Compared to 177Lu-cm09 we demonstrated equal imaging features for 161Tb-cm09 but an increased therapeutic efficacy for 161Tb-cm09 in both tumour cell lines in vitro and in vivo. Further preclinical studies using other tumour-targeting radioconjugates are clearly necessary to draw final conclusions about the future clinical perspectives of 161Tb.

Time trials on second-order and variable-learning-rate algorithms

The performance of seven minimization algorithms are compared on five neural network problems. These include a variable-step-size algorithm, conjugate gradient, and several methods with explicit analytic or numerical approximations to the Hessian.

Using interior point algorithms for the solution of linear programs with special structural features

Linear Programming (LP) is a powerful decision making tool extensively used in various economic and engineering activities. In the early stages the success of LP was mainly due to the efficiency of the simplex method. After the appearance of Karmarkar's paper, the focus of most research was shifted to the field of interior point methods. The present work is concerned with investigating and efficiently implementing the latest techniques in this field taking sparsity into account. The performance of these implementations on different classes of LP problems is reported here. The preconditional conjugate gradient method is one of the most powerful tools for the solution of the least square problem, present in every iteration of all interior point methods. The effect of using different preconditioners on a range of problems with various condition numbers is presented. Decomposition algorithms has been one of the main fields of research in linear programming over the last few years. After reviewing the latest decomposition techniques, three promising methods were chosen the implemented. Sparsity is again a consideration and suggestions have been included to allow improvements when solving problems with these methods. Finally, experimental results on randomly generated data are reported and compared with an interior point method. The efficient implementation of the decomposition methods considered in this study requires the solution of quadratic subproblems. A review of recent work on algorithms for convex quadratic was performed. The most promising algorithms are discussed and implemented taking sparsity into account. The related performance of these algorithms on randomly generated separable and non-separable problems is also reported.

Aproximação numérica – analítica para a modelagem da conversão termoquímica de combustíveis sólidos

Um algoritmo numérico foi criado para apresentar a solução da conversão termoquímica de um combustível sólido. O mesmo foi criado de forma a ser flexível e dependente do mecanismo de reação a ser representado. Para tanto, um sistema das equações características desse tipo de problema foi resolvido através de um método iterativo unido a matemática simbólica. Em função de não linearidades nas equações e por se tratar de pequenas partículas, será aplicado o método de Newton para reduzir o sistema de equações diferenciais parciais (EDP’s) para um sistema de equações diferenciais ordinárias (EDO’s). Tal processo redução é baseado na união desse método iterativo à diferenciação numérica, pois consegue incorporar nas EDO’s resultantes funções analíticas. O modelo reduzido será solucionado numericamente usando-se a técnica do gradiente bi-conjugado (BCG). Tal modelo promete ter taxa de convergência alta, se utilizando de um número baixo de iterações, além de apresentar alta velocidade na apresentação das soluções do novo sistema linear gerado. Além disso, o algoritmo se mostra independente do tamanho da malha constituidora. Para a validação, a massa normalizada será calculada e comparada com valores experimentais de termogravimetria encontrados na literatura, , e um teste com um mecanismo simplificado de reação será realizado.

Artificial neural networks for automatic modelling of the pectus excavatum corrective prosthesis

Pectus excavatum is the most common deformity of the thorax and usually comprises Computed Tomography (CT) examination for pre-operative diagnosis. Aiming at the elimination of the high amounts of CT radiation exposure, this work presents a new methodology for the replacement of CT by a laser scanner (radiation-free) in the treatment of pectus excavatum using personally modeled prosthesis. The complete elimination of CT involves the determination of ribs external outline, at the maximum sternum depression point for prosthesis placement, based on chest wall skin surface information, acquired by a laser scanner. The developed solution resorts to artificial neural networks trained with data vectors from 165 patients. Scaled Conjugate Gradient, Levenberg-Marquardt, Resilient Back propagation and One Step Secant gradient learning algorithms were used. The training procedure was performed using the soft tissue thicknesses, determined using image processing techniques that automatically segment the skin and rib cage. The developed solution was then used to determine the ribs outline in data from 20 patient scanners. Tests revealed that ribs position can be estimated with an average error of about 6.82±5.7 mm for the left and right side of the patient. Such an error range is well below current prosthesis manual modeling (11.7±4.01 mm) even without CT imagiology, indicating a considerable step forward towards CT replacement by a 3D scanner for prosthesis personalization.

Aceleração GPU da animação de superfícies deformáveis

Dissertação de Mestrado em Engenharia Informática

Characterizations of Lojasiewicz inequalities and applications

The classical Lojasiewicz inequality and its extensions for partial differential equation problems (Simon) and to o-minimal structures (Kurdyka) have a considerable impact on the analysis of gradient-like methods and related problems: minimization methods, complexity theory, asymptotic analysis of dissipative partial differential equations, tame geometry. This paper provides alternative characterizations of this type of inequalities for nonsmooth lower semicontinuous functions defined on a metric or a real Hilbert space. In a metric context, we show that a generalized form of the Lojasiewicz inequality (hereby called the Kurdyka- Lojasiewicz inequality) relates to metric regularity and to the Lipschitz continuity of the sublevel mapping, yielding applications to discrete methods (strong convergence of the proximal algorithm). In a Hilbert setting we further establish that asymptotic properties of the semiflow generated by -∂f are strongly linked to this inequality. This is done by introducing the notion of a piecewise subgradient curve: such curves have uniformly bounded lengths if and only if the Kurdyka- Lojasiewicz inequality is satisfied. Further characterizations in terms of talweg lines -a concept linked to the location of the less steepest points at the level sets of f- and integrability conditions are given. In the convex case these results are significantly reinforced, allowing in particular to establish the asymptotic equivalence of discrete gradient methods and continuous gradient curves. On the other hand, a counterexample of a convex C2 function in R2 is constructed to illustrate the fact that, contrary to our intuition, and unless a specific growth condition is satisfied, convex functions may fail to fulfill the Kurdyka- Lojasiewicz inequality.

The stationary distribution of a continuously varying strategy in a class-structured population under mutation-selection-drift balance.

Many traits and/or strategies expressed by organisms are quantitative phenotypes. Because populations are of finite size and genomes are subject to mutations, these continuously varying phenotypes are under the joint pressure of mutation, natural selection and random genetic drift. This article derives the stationary distribution for such a phenotype under a mutation-selection-drift balance in a class-structured population allowing for demographically varying class sizes and/or changing environmental conditions. The salient feature of the stationary distribution is that it can be entirely characterized in terms of the average size of the gene pool and Hamilton's inclusive fitness effect. The exploration of the phenotypic space varies exponentially with the cumulative inclusive fitness effect over state space, which determines an adaptive landscape. The peaks of the landscapes are those phenotypes that are candidate evolutionary stable strategies and can be determined by standard phenotypic selection gradient methods (e.g. evolutionary game theory, kin selection theory, adaptive dynamics). The curvature of the stationary distribution provides a measure of the stability by convergence of candidate evolutionary stable strategies, and it is evaluated explicitly for two biological scenarios: first, a coordination game, which illustrates that, for a multipeaked adaptive landscape, stochastically stable strategies can be singled out by letting the size of the gene pool grow large; second, a sex-allocation game for diploids and haplo-diploids, which suggests that the equilibrium sex ratio follows a Beta distribution with parameters depending on the features of the genetic system.

The unresolved case of sacral chordoma: from misdiagnosis to challenging surgery and medical therapy resistance.

PURPOSE: A sacral chordoma is a rare, slow-growing, primary bone tumor, arising from embryonic notochordal remnants. Radical surgery is the only hope for cure. The aim of our present study is to analyse our experience with the challenging treatment of this rare tumor, to review current treatment modalities and to assess the outcome based on R status. METHODS: Eight patients were treated in our institution between 2001 and 2011. All patients were discussed by a multidisciplinary tumor board, and an en bloc surgical resection by posterior perineal access only or by combined anterior/posterior accesses was planned based on tumor extension. RESULTS: Seven patients underwent radical surgery, and one was treated by using local cryotherapy alone due to low performance status. Three misdiagnosed patients had primary surgery at another hospital with R1 margins. Reresection margins in our institution were R1 in two and R0 in one, and all three recurred. Four patients were primarily operated on at our institution and had en bloc surgery with R0 resection margins. One had local recurrence after 18 months. The overall morbidity rate was 86% (6/7 patients) and was mostly related to the perineal wound. Overall, 3 out of 7 resected patients were disease-free at a median follow-up of 2.9 years (range, 1.6-8.0 years). CONCLUSION: Our experience confirms the importance of early correct diagnosis and of an R0 resection for a sacral chordoma invading pelvic structures. It is a rare disease that requires a challenging multidisciplinary treatment, which should ideally be performed in a tertiary referral center.

Inverse convection problem of simultaneous estimation of two boundary heat fluxes in parallel plate channels

This paper deals with the use of the conjugate gradient method of function estimation for the simultaneous identification of two unknown boundary heat fluxes in parallel plate channels. The fluid flow is assumed to be laminar and hydrodynamically developed. Temperature measurements taken inside the channel are used in the inverse analysis. The accuracy of the present solution approach is examined by using simulated measurements containing random errors, for strict cases involving functional forms with discontinuities and sharp-corners for the unknown functions. Three different types of inverse problems are addressed in the paper, involving the estimation of: (i) Spatially dependent heat fluxes; (ii) Time-dependent heat fluxes; and (iii) Time and spatially dependent heat fluxes.

Numerical Simulation of the Cavitation in the Hydrodynamic Lubrication of Journal Bearings: a Parallel Algorithm

In this paper we present an algorithm for the numerical simulation of the cavitation in the hydrodynamic lubrication of journal bearings. Despite the fact that this physical process is usually modelled as a free boundary problem, we adopted the equivalent variational inequality formulation. We propose a two-level iterative algorithm, where the outer iteration is associated to the penalty method, used to transform the variational inequality into a variational equation, and the inner iteration is associated to the conjugate gradient method, used to solve the linear system generated by applying the finite element method to the variational equation. This inner part was implemented using the element by element strategy, which is easily parallelized. We analyse the behavior of two physical parameters and discuss some numerical results. Also, we analyse some results related to the performance of a parallel implementation of the algorithm.

Histogram filtering as a tool in variational Monte Carlo optimization

Optimization of wave functions in quantum Monte Carlo is a difficult task because the statistical uncertainty inherent to the technique makes the absolute determination of the global minimum difficult. To optimize these wave functions we generate a large number of possible minima using many independently generated Monte Carlo ensembles and perform a conjugate gradient optimization. Then we construct histograms of the resulting nominally optimal parameter sets and "filter" them to identify which parameter sets "go together" to generate a local minimum. We follow with correlated-sampling verification runs to find the global minimum. We illustrate this technique for variance and variational energy optimization for a variety of wave functions for small systellls. For such optimized wave functions we calculate the variational energy and variance as well as various non-differential properties. The optimizations are either on par with or superior to determinations in the literature. Furthermore, we show that this technique is sufficiently robust that for molecules one may determine the optimal geometry at tIle same time as one optimizes the variational energy.

Offline Handwritten Malayalam Character Recognition Based on Chain Code Histogram

Optical Character Recognition plays an important role in Digital Image Processing and Pattern Recognition. Even though ambient study had been performed on foreign languages like Chinese and Japanese, effort on Indian script is still immature. OCR in Malayalam language is more complex as it is enriched with largest number of characters among all Indian languages. The challenge of recognition of characters is even high in handwritten domain, due to the varying writing style of each individual. In this paper we propose a system for recognition of offline handwritten Malayalam vowels. The proposed method uses Chain code and Image Centroid for the purpose of extracting features and a two layer feed forward network with scaled conjugate gradient for classification

Approximate factorization constraint preconditioners for saddle-point matrices

We consider the application of the conjugate gradient method to the solution of large, symmetric indefinite linear systems. Special emphasis is put on the use of constraint preconditioners and a new factorization that can reduce the number of flops required by the preconditioning step. Results concerning the eigenvalues of the preconditioned matrix and its minimum polynomial are given. Numerical experiments validate these conclusions.

A benchmark method for global optimization problems in structure determination from powder diffraction data

Quasi-Newton-Raphson minimization and conjugate gradient minimization have been used to solve the crystal structures of famotidine form B and capsaicin from X-ray powder diffraction data and characterize the chi(2) agreement surfaces. One million quasi-Newton-Raphson minimizations found the famotidine global minimum with a frequency of ca 1 in 5000 and the capsaicin global minimum with a frequency of ca 1 in 10 000. These results, which are corroborated by conjugate gradient minimization, demonstrate the existence of numerous pathways from some of the highest points on these chi(2) agreement surfaces to the respective global minima, which are passable using only downhill moves. This important observation has significant ramifications for the development of improved structure determination algorithms.