64Cu- and 68Ga-labelled [Nle(14),Lys(40)(Ahx-NODAGA)NH2]-exendin-4 for pancreatic beta cell imaging in rats.

PURPOSE Glucagon-like peptide-1 receptor (GLP-1R) is a molecular target for imaging of pancreatic beta cells. We compared the ability of [Nle(14),Lys(40)(Ahx-NODAGA-(64)Cu)NH2]-exendin-4 ([(64)Cu]NODAGA-exendin-4) and [Nle(14),Lys(40)(Ahx-NODAGA-(68)Ga)NH2]-exendin-4 ([(68)Ga]NODAGA-exendin-4) to detect native pancreatic islets in rodents. PROCEDURES The stability, lipophilicity and affinity of the radiotracers to the GLP-1R were determined in vitro. The biodistribution of the tracers was assessed using autoradiography, ex vivo biodistribution and PET imaging. Estimates for human radiation dosimetry were calculated. RESULTS We found GLP-1R-specific labelling of pancreatic islets. However, the pancreas could not be visualised in PET images. The highest uptake of the tracers was observed in the kidneys. Effective dose estimates for [(64)Cu]NODAGA-exendin-4 and [(68)Ga]NODAGA-exendin-4 were 0.144 and 0.012 mSv/MBq, respectively. CONCLUSION [(64)Cu]NODAGA-exendin-4 might be more effective for labelling islets than [(68)Ga]NODAGA-exendin-4. This is probably due to the lower specific radioactivity of [(68)Ga]NODAGA-exendin-4 compared to [(64)Cu]NODAGA-exendin-4. The radiation dose in the kidneys may limit the use of [(64)Cu]NODAGA-exendin-4 as a clinical tracer.

Knowledge representation through graphs

Due to the increasing amount of data, knowledge aggregation, representation and reasoning are highly important for companies. In this paper, knowledge aggregation is presented as the first step. In the sequel, successful knowledge representation, for instance through graphs, enables knowledge-based reasoning. There exist various forms of knowledge representation through graphs; some of which allow to handle uncertainty and imprecision by invoking the technology of fuzzy sets. The paper provides an overview of different types of graphs stressing their relationships and their essential features.

Bipartite graphs and quasipositive surfaces

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links. We then introduce a combinatorial notion of adjacency for bipartite graph links and discuss its potential relation with the adjacency problem for plane curve singularities.

Non-self-adjoint graphs

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity transforms to self-adjoint Laplacians. Among other things, we describe a simple way to relate the similarity transforms between Laplacians on certain graphs with elementary similarity transforms between matrices defining the boundary conditions.