Switchable LED-based laparoscopic multispectral system for rapid high-resolution perfusion imaging

SIGNIFICANCE: Multispectral imaging (MSI) is an approach for real-time, quantitative, and non-invasive tissue perfusion measurements. Current laparoscopic systems based on mosaic sensors or filter wheels lack high spatial resolution or acceptable frame rates.AIM: To develop a laparoscopic system for MSI-based color video and tissue perfusion imaging during gastrointestinal surgery without compromising spatial or temporal resolution.APPROACH: The system was built with 14 switchable light-emitting diodes in the visible and near-infrared spectral range, a 4K image sensor, and a 10 mm laparoscope. Illumination patterns were created for tissue oxygenation and hemoglobin content monitoring. The system was calibrated to a clinically approved laparoscopic hyperspectral system using linear regression models and evaluated in an occlusion study with 36 volunteers.RESULTS: The root mean squared errors between the MSI and reference system were 0.073 for hemoglobin content, 0.039 for oxygenation in deeper tissue layers, and 0.093 for superficial oxygenation. The spatial resolution at a working distance of 45 mm was 156  μm. The effective frame rate was 20 fps.CONCLUSIONS: High-resolution perfusion monitoring was successfully achieved. Hardware optimizations will increase the frame rate. Parameter optimizations through alternative illumination patterns, regression, or assumed tissue models are planned. Intraoperative measurements must confirm the suitability during surgery.</p

Preprint arXiv: 2203.10027 Submitted on 18 Mar 2022

Pairing of mobile charge carriers in doped antiferromagnets plays a key role in the emergence of unconventional superconductivity. In these strongly correlated materials, the pairing mechanism is often assumed to be mediated by magnetic correlations, in contrast to phonon-mediated interactions in conventional superconductors. A precise understanding of the underlying mechanism in real materials is, however, still lacking, and has been driving experimental and theoretical research for the past 40 years. Early theoretical studies established the emergence of binding among dopants in ladder systems, where idealised theoretical toy models played an instrumental role in the elucidation of pairing, despite repulsive interactions. Here, we realise this long-standing theoretical prediction and report on the observation of hole pairing due to magnetic correlations in a quantum gas microscope setting. By engineering doped antiferromagnetic ladders with mixed-dimensional couplings we suppress Pauli blocking of holes at short length scales. This results in a drastic increase in binding energy and decrease in pair size, enabling us to observe pairs of holes predominantly occupying the same rung of the ladder. We find a hole-hole binding energy on the order of the superexchange energy, and, upon increased doping, we observe spatial structures in the pair distribution, indicating repulsion between bound hole pairs. By engineering a configuration in which binding is strongly enhanced, we delineate a novel strategy to increase the critical temperature for superconductivity

Byzantine Gathering in Networks

This paper investigates an open problem introduced in [14]. Two or more mobile agents start from different nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a different positive integer (called label) to each of them. Initially, each agent knows its label but does not know the labels of the other agents or their positions relative to its own. Agents move in synchronous rounds and can communicate with each other only when located at the same node. Up to f of the agents are Byzantine. A Byzantine agent can choose an arbitrary port when it moves, can convey arbitrary information to other agents and can change its label in every round, in particular by forging the label of another agent or by creating a completely new one. What is the minimum number M of good agents that guarantees deterministic gathering of all of them, with termination? We provide exact answers to this open problem by considering the case when the agents initially know the size of the network and the case when they do not. In the former case, we prove M=f+1 while in the latter, we prove M=f+2. More precisely, for networks of known size, we design a deterministic algorithm gathering all good agents in any network provided that the number of good agents is at least f+1. For networks of unknown size, we also design a deterministic algorithm ensuring the gathering of all good agents in any network but provided that the number of good agents is at least f+2. Both of our algorithms are optimal in terms of required number of good agents, as each of them perfectly matches the respective lower bound on M shown in [14], which is of f+1 when the size of the network is known and of f+2 when it is unknown

Combined indocyanine green and quantitative perfusion assessment with hyperspectral imaging during colorectal resections

Anastomotic insufficiencies still represent one of the most severe complications in colorectal surgery. Since tissue perfusion highly affects anastomotic healing, its objective assessment is an unmet clinical need. Indocyanine green-based fluorescence angiography (ICG-FA) and hyperspectral imaging (HSI) have received great interest in recent years but surgeons have to decide between both techniques. For the first time, two data processing pipelines capable of reconstructing an ICG-FA correlating signal from hyperspectral data were developed. Results were technically evaluated and compared to ground truth data obtained during colorectal resections. In 87% of 46 data sets, the reconstructed images resembled the ground truth data. The combined applicability of ICG-FA and HSI within one imaging system might provide supportive and complementary information about tissue vascularization, shorten surgery time, and reduce perioperative mortality

Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks

We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal times for the other agent. The goal of the agents is to meet on an edge or a node of the graph. In this scenario, we study the time required by the agents to meet, compared to the meeting time $T_{OPT}$ in the offline scenario in which the agents have complete knowledge about each others speed characteristics. When no additional assumptions are made, we show that rendezvous in our model can be achieved after time $O(n T_{OPT})$ in a $n$-node graph, and that such time is essentially in some cases the best possible. However, we prove that the rendezvous time can be reduced to $\Theta (T_{OPT})$ when the agents are allowed to exchange $\Theta(n)$ bits of information at the start of the rendezvous process. We then show that under some natural assumption about the traversal times of edges, the hardness of the heterogeneous rendezvous problem can be substantially decreased, both in terms of time required for rendezvous without communication, and the communication complexity of achieving rendezvous in time $\Theta (T_{OPT})$

Bucolic Complexes

We introduce and investigate bucolic complexes, a common generalization of systolic complexes and of CAT(0) cubical complexes. They are defined as simply connected prism complexes satisfying some local combinatorial conditions. We study various approaches to bucolic complexes: from graph-theoretic and topological perspective, as well as from the point of view of geometric group theory. In particular, we characterize bucolic complexes by some properties of their 2-skeleta and 1-skeleta (that we call bucolic graphs), by which several known results are generalized. We also show that locally-finite bucolic complexes are contractible, and satisfy some nonpositive-curvature-like properties.Comment: 45 pages, 4 figure

Quantum coherent control of highly multipartite continuous-variable entangled states by tailoring parametric interactions

The generation of continuous-variable multipartite entangled states is important for several protocols of quantum information processing and communication, such as one-way quantum computation or controlled dense coding. In this article we theoretically show that multimode optical parametric oscillators can produce a great variety of such states by an appropriate control of the parametric interaction, what we accomplish by tailoring either the spatio-temporal shape of the pump, or the geometry of the nonlinear medium. Specific examples involving currently available optical parametric oscillators are given, hence showing that our ideas are within reach of present technology.Comment: 14 pages, 5 figure

The Repetitive Landscape of the Barley Genome

While transposable elements (TEs) comprise the bulk of plant genomic DNA, how they contribute to genome structure and organization is still poorly understood. Especially, in large genomes where TEs make the majority of genomic DNA, it is still unclear whether TEs target specific chromosomal regions or whether they simply accumulate where they are best tolerated. The barley genome with its vast repetitive fraction is an ideal system to study chromosomal organization and evolution of TEs. Genes make only about 2% of the genome, while over 80% is derived from TEs. The TE fraction is composed of at least 350 different families. However, 50% of the genome is comprised of only 15 high-copy TE families, while all other TE families are present in moderate or low-copy numbers. The barley genome is highly compartmentalized with different types of TEs occupying different chromosomal “niches”, such as distal, interstitial or proximal regions of chromosome arms. Furthermore, gene space represents its own distinct genomic compartment that is enriched in small non-autonomous DNA transposons, suggesting that these TEs specifically target promoters and downstream regions. Some TE families also show a strong preference to insert in specific sequence motifs which may, in part, explain their distribution. The family-specific distribution patterns result in distinct TE compositions of different chromosomal compartments.Peer reviewe

How to gather asynchronous oblivious robots on anonymous rings

A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. This problem is known in the literature as the \emph{gathering}. Robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter case makes the computed move instantaneously (Move). Cycles are performed asynchronously for each robot. Moreover, each robot is empowered by the so called \emph{multiplicity detection} capability, that is, a robot is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. The described problem has been extensively studied during the last years. However, the known solutions work only for specific initial configurations and leave some open cases. In this paper, we provide an algorithm which solves the general problem, and is able to detect all the non-gatherable configurations. It is worth noting that our new algorithm makes use of a unified and general strategy for any initial configuration.Un ensemble de robots placés arbitrairement sur les sommets d'un graphe anonyme doivent se rencontrer sur un sommet commun. Ce problème est connu dans la littérature comme le \emph{gathering}. Les robots utilisent des cycles Look-Compute-Move; dans un cycle, un robot prend un instantané de la configuration actuelle (Look), décide de rester inactif ou de se déplacer sur l'un de ses voisins (Compute), et dans ce cas, fait le déplacement (Move). Les cycles sont exécutés de manière asynchrone pour chaque robot. Chaque robot possède la capacité de \emph{multiplicity detection}: un robot est capable de détecter au cours de son opération Look si un sommet est vide, occupé par un robot, ou occupé par un nombre indéfini de robots. Le problème décrit a été largement étudié au cours des dernières années. Toutefois, les solutions connues ne sont valides que pour des configurations initiales spécifiques. Nous fournissons un algorithme qui résout le problème général, et est capable de détecter toutes les configurations initiales pour lesquelles le problème est impossible. Il est intéressant de noter que notre nouvel algorithme utilise une stratégie unifiée et générale pour chaque configuration initiale