The glucocorticoid receptor in brown adipocytes is dispensable for control of energy homeostasis

Aberrant activity of the glucocorticoid (GC)/glucocorticoid receptor (GR) endocrine system has been linked to obesity-related metabolic dysfunction. Traditionally, the GC/GR axis has been believed to play a crucial role in adipose tissue formation and function in both, white (WAT) and brown adipose tissue (BAT). While recent studies have challenged this notion for WAT, the contribution of GC/GR signaling to BAT-dependent energy homeostasis remained unknown. Here, we have generated and characterized a BAT-specific GR-knockout mouse (GRBATKO), for the first time allowing to genetically interrogate the metabolic impact of BAT-GR. The HPA axis in GRBATKO mice was intact, as was the ability of mice to adapt to cold. BAT-GR was dispensable for the adaptation to fasting–feeding cycles and the development of diet-induced obesity. In obesity, glucose and lipid metabolism, insulin sensitivity, and food intake remained unchanged, aligning with the absence of changes in thermogenic gene expression. Together, we demonstrate that the GR in UCP1-positive BAT adipocytes plays a negligible role in systemic metabolism and BAT function, thereby opposing a long-standing paradigm in the field

Self-stabilizing Overlays for high-dimensional Monotonic Searchability

We extend the concept of monotonic searchability for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state from any initial illegal state. These kind of systems are most often used in distributed applications. Monotonic searchability provides guarantees when searching for nodes while the recovery process is going on. More precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well. Although there already exists a self-stabilizing protocol for a two-dimensional topology and an universal approach for monotonic searchability, it is not clear how both of these concepts fit together effectively. The latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol. We propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability. Our protocol can easily be extended to higher dimensions and offers routing in $\mathcal O(\log n)$ hops for any search request

An Introduction to Temporal Graphs: An Algorithmic Perspective

A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and not the entities themselves, a temporal graph may be viewed as a sequence $G_1,G_2\ldots,G_l$ of static graphs over the same (static) set of nodes $V$. Though static graphs have been extensively studied, for their temporal generalization we are still far from having a concrete set of structural and algorithmic principles. Recent research shows that many graph properties and problems become radically different and usually substantially more difficult when an extra time dimension in added to them. Moreover, there is already a rich and rapidly growing set of modern systems and applications that can be naturally modeled and studied via temporal graphs. This, further motivates the need for the development of a temporal extension of graph theory. We survey here recent results on temporal graphs and temporal graph problems that have appeared in the Computer Science community

A Rat Model of CMT2A Develops a Progressive Neuropathy

[No abstract