Accomplishments and challenges in stem cell imaging in vivo.

Stem cell therapies have demonstrated promising preclinical results, but very few applications have reached the clinic owing to safety and efficacy concerns. Translation would benefit greatly if stem cell survival, distribution and function could be assessed in vivo post-transplantation, particularly in patients. Advances in molecular imaging have led to extraordinary progress, with several strategies being deployed to understand the fate of stem cells in vivo using magnetic resonance, scintigraphy, PET, ultrasound and optical imaging. Here, we review the recent advances, challenges and future perspectives and opportunities in stem cell tracking and functional assessment, as well as the advantages and challenges of each imaging approach

REDD+ on the rocks? Conflict over forest and politics of justice in Vietnam

In Vietnam, villagers involved in a REDD+ (reduced emissions from deforestation and forest degradation) pilot protect areas with rocks which have barely a tree on them. The apparent paradox indicates how actual practices differ from general ideas about REDD+ due to ongoing conflict over forest, and how contestations over the meaning of justice are a core element in negotiations over REDD+. We explore these politics of justice by examining how the actors involved in the REDD+ pilot negotiate the particular subjects, dimensions, and authority of justice considered relevant, and show how politics of justice are implicit to practical decisions in project implementation. Contestations over the meaning of justice are an important element in the practices and processes constituting REDD+ at global, national and local levels, challenging uniform definitions of forest justice and how forests ought to be managed

Information transfer fidelity in spin networks and ring-based quantum routers

Spin networks are endowed with an Information Transfer Fidelity (ITF), which defines an absolute upper bound on the probability of transmission of an excitation from one spin to another. The ITF is easily computable but the bound can be reached asymptotically in time only under certain conditions. General conditions for attainability of the bound are established and the process of achieving the maximum transfer probability is given a dynamical model, the translation on the torus. The time to reach the maximum probability is estimated using the simultaneous Diophantine approximation, implemented using a variant of the Lenstra-Lenstra-Lov\'asz (LLL) algorithm. For a ring with uniform couplings, the network can be made a metric space by defining a distance (satisfying the triangle inequality) that quantifies the lack of transmission fidelity between two nodes. It is shown that transfer fidelities and transfer times can be improved significantly by means of simple controls taking the form of non-dynamic, spatially localized bias fields, opening up the possibility for intelligent design of spin networks and dynamic routing of information encoded in them, while being more flexible than engineering fixed couplings to favor some transfers, and less demanding than control schemes requiring fast dynamic controls

Angiographic CT with intravenous administration of contrast medium is a noninvasive option for follow-up after intracranial stenting

Intracranial angioplasty and stenting (ICAS) is a therapeutic option in symptomatic intracranial atherosclerotic disease. Adequate follow-up examination is necessary to exclude in-stent restenosis. Conventional intraarterial digital subtraction angiography (ia-DSA) is the current gold standard, but it is an invasive technique and carries the risk of neurological complications. Angiographic CT (ACT) is a new technique that provides a volume dataset of the highest spatial resolution and high contrast resolution derived from a rotational acquisition of a c-arm-mounted flat-panel detector. The feasibility of ACT with intravenous administration of contrast medium (iv-ACT) for follow-up after ICAS is demonstrated. In two patients iv-ACT was performed as a follow-up examination 12 months after ICAS. High-resolution volume data from the rotational acquisitions were processed to provide delineation of the stent lumen as well as imaging of the brain parenchyma and vessels. In both patients the patency of the stent lumen was assessed successfully. In addition, all other brain vessels were displayed in a manner similar to their appearance on CT angiograms. The brain parenchyma was also adequately imaged in a manner similar to its appearance on CT images. We demonstrated the feasibility and diagnostic value of iv-ACT for follow-up imaging after ICAS. This new application has the potential to become the imaging method of choice after ICAS since it not only enables visualization of the patency of the stent lumen but also is minimally invasive and provides additional information about all brain arteries and the brain parenchyma

Successful interdisciplinary management of the misdeployment of two self-expanding stents into the internal carotid artery: a case report

<p>Abstract</p> <p>Introduction</p> <p>With the widespread use of carotid artery stenting, previously unknown technical mistakes of this treatment modality are now being encountered. There are multiple strategies for the treatment of in-stent restenosis. With regard to surgical management, endarterectomy and patch plasty are favored. To the best of our knowledge, this report is the first description of a complete stent removal by the eversion technique.</p> <p>Case presentation</p> <p>We report the case of a 63-year-old Caucasian man with misdeployment of two stents into his stenotic proximal internal carotid artery, resulting in a high-grade mechanical obstruction of the internal carotid artery lumen. With the contralateral internal carotid artery already occluded and associated stenoses of both proximal and distal vertebral arteries, an interdisciplinary therapeutic concept was applied. Bilateral balloon angioplasty and stenting of the proximal and distal stenotic vertebral arteries were carried out to provide sufficient posterior collateral blood flow, followed by successful surgical stentectomy and carotid endarterectomy using the eversion technique. Duplex scanning and neurological assessments were normal over a 12-month follow-up period.</p> <p>Conclusions</p> <p>Interdisciplinary treatment is a recommended option to protect patients from further impairment. Further evaluation in larger studies is highly recommended.</p

Succinct Data Structures for Families of Interval Graphs

We consider the problem of designing succinct data structures for interval graphs with $n$ vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time in the $\Theta(\log n)$-bit word RAM model. The degree query reports the number of incident edges to a given vertex in constant time, the adjacency query returns true if there is an edge between two vertices in constant time, the neighborhood query reports the set of all adjacent vertices in time proportional to the degree of the queried vertex, and the shortest path query returns a shortest path in time proportional to its length, thus the running times of these queries are optimal. Towards showing succinctness, we first show that at least $n\log{n} - 2n\log\log n - O(n)$ bits are necessary to represent any unlabeled interval graph $G$ with $n$ vertices, answering an open problem of Yang and Pippenger [Proc. Amer. Math. Soc. 2017]. This is augmented by a data structure of size $n\log{n} +O(n)$ bits while supporting not only the aforementioned queries optimally but also capable of executing various combinatorial algorithms (like proper coloring, maximum independent set etc.) on the input interval graph efficiently. Finally, we extend our ideas to other variants of interval graphs, for example, proper/unit interval graphs, k-proper and k-improper interval graphs, and circular-arc graphs, and design succinct/compact data structures for these graph classes as well along with supporting queries on them efficiently

Generalized alignment-based trace clustering of process behavior

Process mining techniques use event logs containing real process executions in order to mine, align and extend process models. The partition of an event log into trace variants facilitates the understanding and analysis of traces, so it is a common pre-processing in process mining environments. Trace clustering automates this partition; traditionally it has been applied without taking into consideration the availability of a process model. In this paper we extend our previous work on process model based trace clustering, by allowing cluster centroids to have a complex structure, that can range from a partial order, down to a subnet of the initial process model. This way, the new clustering framework presented in this paper is able to cluster together traces that are distant only due to concurrency or loop constructs in process models. We show the complexity analysis of the different instantiations of the trace clustering framework, and have implemented it in a prototype tool that has been tested on different datasets.Peer ReviewedPostprint (author's final draft

Exploring corrections to the optomechanical Hamiltonian

We compare two approaches for deriving corrections to the “linear model” of cavity optomechanics, in order to describe effects that are beyond first order in the radiation pressure coupling. In the regime where the mechanical frequency is much lower than the cavity one, we compare: (I) a widely used phenomenological Hamiltonian conserving the photon number; (II) a two-mode truncation of C. K. Law’s microscopic model, which we take as the “true” system Hamiltonian. While these approaches agree at first order, the latter model does not conserve the photon number, resulting in challenging computations. We find that approach (I) allows for several analytical predictions, and significantly outperforms the linear model in our numerical examples. Yet, we also find that the phenomenological Hamiltonian cannot fully capture all high-order corrections arising from the C. K. Law model

Are old-old patients with major depression more likely to relapse than young-old patients during continuation treatment with escitalopram?

<p>Abstract</p> <p>Background</p> <p>Escitalopram has shown efficacy and tolerability in the prevention of relapse in elderly patients with major depressive disorder (MDD). This <it>post-hoc </it>analysis compared time to relapse for <it>young-old </it>patients (n = 197) to that for <it>old-old </it>patients (n = 108).</p> <p>Method</p> <p>Relapse prevention: after 12-weeks open-label treatment, remitters (MADRS ≤12) were randomised to double-blind treatment with escitalopram or placebo and followed over 24-weeks. Patients were outpatients with MDD from 46 European centers aged ≥75 years (<it>old-old</it>) or 65-74 years of age (<it>young-old</it>), treated with escitalopram 10-20mg/day. Efficacy was assessed using the Montgomery Åsberg Depression Rating Scale (MADRS).</p> <p>Results</p> <p>After open-label escitalopram treatment, a similar proportion of <it>young-old </it>patients (78%) and <it>old-old </it>patients (72%) achieved remission. In the analysis of time to relapse based on the Cox model (proportional hazards regression), with treatment and age group as covariates, the hazard ratio was 4.4 for placebo <it>versus </it>escitalopram (χ²-test, df = 1, χ²= 22.5, p < 0.001), whereas the effect of age was not significant, with a hazard ratio of 1.2 for <it>old-old </it>versus <it>young-old </it>(χ²-test, df = 1, χ²= 0.41, p = 0.520). Escitalopram was well tolerated in both age groups with adverse events reported by 53.1% of <it>young-old </it>patients and 58.3% of <it>old-old </it>patients. There was no significant difference in withdrawal rates due to AEs between age groups (χ²-test, χ²= 1.669, df = 1, p = 0.196).</p> <p>Conclusions</p> <p><it>Young-old </it>and <it>old-old </it>patients with MDD had comparable rates of remission after open-label escitalopram, and both age groups had much lower rates of relapse on escitalopram than on placebo.</p