Preparation and in vitro evaluation of 177Lu-iPSMA-RGD as a new heterobivalent radiopharmaceutical

This study aimed to synthesize a new 177Lu-iPSMA-RGD heterobivalent radiopharmaceutical, as well as to assess the in vitro radiopharmaceutical potential to target cancer cells overexpressing PSMA and a(v) b(3) integrins. The radiotracer prepared with a radiochemical purity of 98.8 ± 1.0% showed stability in human serum, specific recognition with suitable affinity to PSMA and a(v)b(3) integrins, and capability to inhibit cancer cell proliferation and VEGF signaling (antiangiogenic effect). Results warrant further preclinical studies to establish the 177Lu-iPSMA-RGD potential as a dual therapeutic radiopharmaceutical.CONACyT-CB-2016-01-28152

Contextualization of the Audit Benefit for Tax Returns

oai:ojs2.journal.multitechpublisher.com:article/174It is essential to analyze the benefit of auditing in Colombia, review from when it began to be governed to date in order to contextualize and consolidate the information contained in the standard, giving the opportunity to understand in a simpler way the mechanism that is being used in tax returns. , for which it is intended to reduce the firmness times, the study is carried out in a toric way, asking about the edges that can be presented in various ways, the objective is to show and identify how and when it can be used in an appropriate way, to reach the conclusions the subject is structured in cases that occur in real life in which you can observe different scenarios that allow suggesting a correct use complying with the standard,At the end of all this analysis, a general panorama can be observed of how the benefit is being contributed at the country leve

A study of bi-space search for solving the one-dimensional bin packing problem

Traditionally search techniques explore a single space to solve the problem at hand. This paper investigates performing search across more than one space which we refer to as bi-space search. As a proof of concept we illustrate this using the solution and heuristic spaces. In previous work two approaches for combining search across the heuristic and solution spaces have been studied. The first approach, the sequential approach, firstly explores the heuristic space to obtain complete solutions and then applies local search to explore the solution space created by these solutions. The second approach, the interleaving approach, alternates search in the heuristic and solution space on partial solutions until complete solutions are produced. This paper provides an alternative to these two approaches, namely, the concurrent approach, which searches the heuristic and solution spaces simultaneously. This is achieved by implementing a genetic algorithm selection hyper-heuristic that evolves a combination of low-level construction heuristics and local search move operators that explore the space of solutions (both partial and complete). The performance of the three approaches are compared, to one another as well as with a standard selection construction hyper-heuristic, using the one dimensional bin packing problem. The study revealed that the concurrent approach is more effective than the other two approaches, with the interleaving approach outperforming the sequential approach. All 3 approaches outperformed the standard hyper-heuristic. Given the potential of searching more than one space and the effectiveness of the concurrent approach, future work will examine additional spaces such as the design space and the program space, as well as extending the bi-space search to a multi-space search.The Multichoice Research Chair in Machine Learning at the University of Pretoria, South Africa.http://link.springer.combookseries/558hj2021Computer Scienc

Security-Aware Database Migration Planning

5th International Symposium on Algorithmic Aspects of Cloud Computing (2019 : Munich; Germany)Database migration is an important problem faced by companies dealing with big data. Not only is migration a costly procedure, it involves serious security risks as well. For some institutions, the primary focus is on reducing the cost of the migration operation, which manifests itself in application testing. For other institutions, minimizing security risks is the most important goal, especially if the data involved is of a sensitive nature. In the literature, the database migration problem has been studied from a test cost minimization perspective. In this paper, we focus on an orthogonal measure, i.e., security risk minimization. We associate security with the number of shifts needed to complete the migration task. Ideally, we want to complete the migration in as few shifts as possible, so that the risk of data exposure is minimized. In this paper, we provide a formal framework for studying the database migration problem from the perspective of security risk minimization (shift minimization) and establish the computational complexities of several models in the same. We present experimental results for various intractable models and show that our heuristic methods produce solutions that are within 3.67%3.67% of the optimal in more than 85%85% of the cases

A Novel Grouping Genetic Algorithm for the One-Dimensional Bin Packing Problem on GPU

One-dimensional Bin Packing Problem (1D-BPP) is a challenging NP-Hard combinatorial problem which is used to pack finite number of items into minimum number of bins. Large problem instances of the 1D-BPP cannot be solved exactly due to the intractable nature of the problem. In this study, we propose an efficient Grouping Genetic Algorithm (GGA) by harnessing the power of the Graphics Processing Unit (GPU) using CUDA. The time consuming crossover and mutation processes of the GGA are executed on the GPU by increasing the evaluation times significantly. The obtained experimental results on 1,238 benchmark 1D-BPP instances show that our proposed algorithm has a high performance and is a scalable algorithm with its high speed fitness evaluation ability. Our proposed algorithm can be considered as one of the best performing algorithms with its 66 times faster computation speed that enables to explore the search space more effectively than any of its counterparts

Estrategias de conectividad en estaciones del peribús para las estaciones: Colón y La Cantera

A lo largo del semestre, los alumnos del PAP de Movilidad Sustentable en el AMG trabajamos en el desarrollo de una propuesta de mejora en la dinámica social de movilidad y transbordo para las estaciones Colón y La Cantera, del proyecto de Peribus y su entorno, para así incrementar el espacio público de la zona y mejorar la calidad del mismo y brindar accesibilidad universal. El abordaje que se le da a este proyecto se basa en tres conceptos fundamentales que son los siguientes: Conectividad (cuenca de servicios) Accesibilidad Universal- Calle completa (seguridad, falta de infraestructura, ordenamiento) IntermodalidadITESO, A.C

Latin American Delphi Consensus on Vascular Cognitive Impairment: Definitions, Clinical Features, Pathophysiology, Prevention and Treatment

n/