Die Potsdamschen Schemmelbeen-Helden, jenannt Jardekohrs: Sie reiten hier sehr schön Parade, Doch is et um die Esel's Schade! En kleener Anhang zu den Armeebefehl: Jardekohrs! Panstrige Lümmels mit de Theekessels uf de Jrützköppe, hört mir an! ...

Welsch (Projektbearbeiter): Strafpredigt an das Gardekorps. Hintergrund: tätliche Angriffe von Soldaten des Gardekorps gegen Mitglieder des Potsdamer Politischen Klubs (wahrscheinlich 25. September 1848)

M. Statkjewitz als Manager von New York, Rollenbild, in: Erik Satie: Parade, Paris, 1917

Signatur des Originals: S 36/F11164

M. Statkjewitz als Manager von New York, Rollenbild, in: Erik Satie: Parade, Paris, 1917

Signatur des Originals: S 36/F11163

Léon Wóizikowski als Manager im Frack, Rollenbild, in: Erik Satie: Parade, Paris, 1917

Signatur des Originals: S 36/F11297

Léon Wóizikowski als Manager im Frack, Rollenbild, in: Erik Satie: Parade, Paris, 1917

Signatur des Originals: S 36/F11298

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.

Super-Resolution in Respiratory Synchronized Positron Emission Tomography

Respiratory motion is a major source of reduced quality in positron emission tomography (PET). In order to minimize its effects, the use of respiratory synchronized acquisitions, leading to gated frames, has been suggested. Such frames, however, are of low signal-to-noise ratio (SNR) as they contain reduced statistics. Super-resolution (SR) techniques make use of the motion in a sequence of images in order to improve their quality. They aim at enhancing a low-resolution image belonging to a sequence of images representing different views of the same scene. In this work, a maximum a posteriori (MAP) super-resolution algorithm has been implemented and applied to respiratory gated PET images for motion compensation. An edge preserving Huber regularization term was used to ensure convergence. Motion fields were recovered using a B-spline based elastic registration algorithm. The performance of the SR algorithm was evaluated through the use of both simulated and clinical datasets by assessing image SNR, as well as the contrast, position and extent of the different lesions. Results were compared to summing the registered synchronized frames on both simulated and clinical datasets. The super-resolution image had higher SNR (by a factor of over 4 on average) and lesion contrast (by a factor of 2) than the single respiratory synchronized frame using the same reconstruction matrix size. In comparison to the motion corrected or the motion free images a similar SNR was obtained, while improvements of up to 20% in the recovered lesion size and contrast were measured. Finally, the recovered lesion locations on the SR images were systematically closer to the true simulated lesion positions. These observations concerning the SNR, lesion contrast and size were confirmed on two clinical datasets included in the study. In conclusion, the use of SR techniques applied to respiratory motion synchronized images lead to motion compensation combined with improved image SNR and contrast, without any increase in the overall acquisition times.

Recurrent excitatory postsynaptic potentials induced by synchronized fast cortical oscillations

Gamma frequency (about 20–70 Hz) oscillations occur during novel sensory stimulation, with tight synchrony over distances of at least 7 mm. Synchronization in the visual system has been proposed to reflect coactivation of different parts of the visual field by a single spatially extended object. We have shown that intracortical mechanisms, including spike doublet firing by interneurons, can account for tight long-range synchrony. Here we show that synchronous gamma oscillations in two sites also can cause long-lasting (>1 hr) potentiation of recurrent excitatory synapses. Synchronous oscillations lasting >400 ms in hippocampal area CA1 are associated with an increase in both excitatory postsynaptic potential (EPSP) amplitude and action potential afterhyperpolarization size. The resulting EPSPs stabilize and synchronize a prolonged beta frequency (about 10–25 Hz) oscillation. The changes in EPSP size are not expressed during non-oscillatory behavior but reappear during subsequent gamma-oscillatory events. We propose that oscillation-induced EPSPs serve as a substrate for memory, whose expression either enhances or blocks synchronization of spatially separated sites. This phenomenon thus provides a dynamical mechanism for storage and retrieval of stimulus-specific neuronal assemblies.

Patches of synchronized activity in the cerebellar cortex evoked by mossy-fiber stimulation: Questioning the role of parallel fibers

The discrepancy between the structural longitudinal organization of the parallel-fiber system in the cerebellar cortex and the functional mosaic-like organization of the cortex has provoked controversial theories about the flow of information in the cerebellum. We address this issue by characterizing the spatiotemporal organization of neuronal activity in the cerebellar cortex by using optical imaging of voltage-sensitive dyes in isolated guinea-pig cerebellum. Parallel-fiber stimulation evoked a narrow beam of activity, which propagated along the parallel fibers. Stimulation of the mossy fibers elicited a circular, nonpropagating patch of synchronized activity. These results strongly support the hypothesis that a beam of parallel fibers, activated by a focal group of granule cells, fails to activate the Purkinje cells along most of its length. It is thus the ascending axon of the granule cell, and not its parallel branches, that activates and defines the basic functional modules of the cerebellar cortex.

Two Arabidopsis cyclin promoters mediate distinctive transcriptional oscillation in synchronized tobacco BY-2 cells.

Cyclins are cell cycle regulators whose proteins oscillate dramatically during the cell cycle. Cyclin steady-state mRNA levels also fluctuate, and there are indications that both their rate of transcription and mRNA stability are under cell cycle control. Here, we demonstrate the transcriptional regulation of higher eukaryote cyclins throughout the whole cell cycle with a high temporal resolution. The promoters of two Arabidopsis cyclins, cyc3aAt and cyc1At, mediated transcriptional oscillation of the beta-glucuronidase (gus) reporter gene in stably transformed tobacco BY-2 cell lines. The rate of transcription driven by the cyc3aAt promoter was very low during G1, slowly increased during the S phase, peaked at the G2 phase and G2-to-M transition, and was down-regulated before early metaphase. In contrast, the rate of the cyc1At-related transcription increased upon exit of the S phase, peaked at the G2-to-M transition and during mitosis, and decreased upon exit from the M phase. This study indicates that transcription mechanisms that seem to be conserved among species play a significant role in regulating the mRNA abundance of the plant cyclins. Furthermore, the transcription patterns of cyc3aAt and cyc1At were coherent with their slightly higher sequence similarity to the A and B groups of animal cyclins, respectively, suggesting that they may fulfill comparable roles during the cell cycle.

Isolation in Synchronized Drone Formations

This paper expands on a theoretical model that is used for aerial robots that are working cooperatively to complete a task. In certain situations, such as when multiple robots have catastrophic failures, the surviving robots could become isolated so that they never again communicate with another robot. We prove some properties about isolated robots flying in a grid formation, and we present an algorithm that determines how many robots need to fail to isolate at least one robot. Finally, we propose a strategy that eliminates the possibility of isolation altogether.

Diplomatic parade or last struggle against fatalism? - Making sense of the Paris ministerial meeting on the Middle East Peace Process. EPC Commentary, 16 June 2016

On 3 June, the French government convened an international meeting in Paris, gathering 28 high-level delegations from all around the world, from Norway to Japan, in order to discuss the state of play and future prospects of the enduring Israel-Palestine conflict. The first ministerial meeting of the “Initiative for the Peace in the Middle East”, as it was labelled by the Quai d’Orsay, provided an important political signal, and a potential diplomatic format, to help revive the long-stalled peace process. Yet, its concrete deliverables remain beset by considerable uncertainty.