Optimal control of time-dependent targets

In this work, we investigate how and to which extent a quantum system can be driven along a prescribed path in Hilbert space by a suitably shaped laser pulse. To calculate the optimal, i.e., the variationally best pulse, a properly defined functional is maximized. This leads to a monotonically convergent algorithm which is computationally not more expensive than the standard optimal-control techniques to push a system, without specifying the path, from a given initial to a given final state. The method is successfully applied to drive the time-dependent density along a given trajectory in real space and to control the time-dependent occupation numbers of a two-level system and of a one-dimensional model for the hydrogen atom.Comment: less typo

The dust-free symbiotic Mira K4−46 = LL Cas

n/

Tracking power system events with accuracy-based PMU adaptive reporting rate

Fast dynamics and transient events are becoming more and more frequent in power systems, due to the high penetration of renewable energy sources and the consequent lack of inertia. In this scenario, Phasor Measurement Units (PMUs) are expected to track the monitored quantities. Such functionality is related not only to the PMU accuracy (as per the IEC/IEEE 60255-118-1 standard) but also to the PMU reporting rate (RR). High RRs allow tracking fast dynamics, but produce many redundant measurement data in normal conditions. In view of an effective tradeoff, the present paper proposes an adaptive RR mechanism based on a real-time selection of the measurements, with the target of preserving the information content while reducing the data rate. The proposed method has been tested considering real-world datasets and applied to four different PMU algorithms. The results prove the method effectiveness in reducing the average data throughput as well as its scalability at PMU concentrator or storage level

Cache-Oblivious Persistence

Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy.We present the first general transformation for making cache-oblivious model data structures partially persistent