We study the formation of singularities for the problem {u(t) = [phi(u)](xx) + epsilon[psi(u)](txx) in Omega x (0, T) phi(u) + epsilon[psi(u)](t) = 0 in partial derivative Omega x(0, T) u = u(0) >= 0 in Omega x {0}, where epsilon and Tare positive constants, Omega a bounded interval, u(0) a nonnegative Radon measure on Omega, phi a nonmonotone and nonnegative function with phi(0) = phi(infinity) = 0, and psi an increasing bounded function. We show that if u(0) is a bounded or continuous function, singularities may appear spontaneously.

In Mobile Unattended Wireless Sensor Networks (MUWSNs), nodes sense the environment and store the acquired data until the arrival of a trusted data sink. In this paper, we address the fundamental issue of quantifying to which extent secret sharing schemes, combined with nodes mobility, can help in assuring data availability and confidentiality. We provide accurate analytical results binding the fraction of the network accessed by the sink and the adversary to the amount of information they can successfully recover. Extensive simulations support our findings.

In remote storage services, delays in the time to retrieve data can cause economic losses to the data owners. In this paper, we address the problem of properly establishing specific clauses in the service level agreement (SLA), intended to guarantee a short and predictable retrieval time. Based on the rationale that the retrieval time mainly depends on the storage media used at the server side, we introduce the concept of Provable Storage Medium (PSM), to denote the ability of a user to efficiently verify that the provider is complying to this aspect of the SLA.

Derivations of the Jarzynski equality (JE) appear to be quite general, and applicable to any particle system, whether deterministic or stochastic, under equally general perturbations of an initial equilibrium state at given temperatureT. At the same time, the definitions of the quantities appearing in the JE, in particular the work, have been questioned. Answers have been given, but a deeper understanding of the range of phenomena to which the JE applies is necessary, both conceptually and in order to interpret the experiments in which it is used.

Topic Modelling (TM) is a widely adopted generative model used to infer the thematic organization of text corpora. When document-level covariate information is available, so-called Structural Topic Modelling (STM) is the state-of-the-art approach to embed this information in the topic mining algorithm. Usually, TM algorithms rely on unigrams as the basic text generation unit, whereas the quality and intelligibility of the identified topics would significantly benefit from the detection and usage of topical phrasemes.

Unattended Wireless Sensor Networks (UWSNs), characterized by the intermittent presence of the sink, are exposed to attacks aiming at tampering with the sensors and the data they store. In order to prevent an adversary from erasing any sensed data before the sink collects them, it is common practice to rely on data replication. However, identifying the most suitable replication rate is challenging: data should be redundant enough to avoid data loss, but not so much as to pose an excessive burden on the limited resources of the sensors.

This article presents a methodology for the monitoring of tall structures based on the joint use of a terrestrial laser scanner (TLS), configured in line scanner mode, and a ground-based real aperture radar (GB-RAR) interferometer. The methodology provides both natural frequencies and oscillation amplitudes of tall structures. Acquisitions of the surface of the tall structure are performed by the TLS with a high sampling rate: each line scan provides an instantaneous longitudinal section.

In a typical secure communication system, messages undergo two different encodings: an error-correcting code is applied at the physical layer to ensure correct reception by the addressee (integrity), while at an upper protocol layer cryptography is leveraged to enforce secrecy with respect to eavesdroppers (confidentiality).

The cube attack is a flexible cryptanalysis technique, with a simple and fascinating theoretical implant. It combines offline exhaustive searches over selected tweakable public/IV bits (the sides of the "cube"), with an online key-recovery phase. Although virtually applicable to any cipher, and generally praised by the research community, the real potential of the attack is still in question, and no implementation so far succeeded in breaking a real-world strong cipher. In this paper, we present, validate and analyze the first thorough implementation of the cube attack on a GPU cluster.

The study of the underlying physics of soft flowing materials depends heavily on numerical simulations, due to the complex structure of the governing equations reflecting the competition of concurrent mechanisms acting at widely disparate scales in space and time. A full-scale computational modelling remains a formidable challenge since it amounts to simultaneously handling six or more spatial decades in space and twice as many in time.