Exiles, Travellers, Vagabonds:Rethinking Mobility in Francophone Women's Writing

Edited Volume

Middleware mechanisms for agent mobility in wireless sensor and actuator networks

This paper describes middleware-level support for agent mobility, targeted at hierarchically structured wireless sensor and actuator network applications. Agent mobility enables a dynamic deployment and adaptation of the application on top of the wireless network at runtime, while allowing the middleware to optimize the placement of agents, e.g., to reduce wireless network traffic, transparently to the application programmer. The paper presents the design of the mechanisms and protocols employed to instantiate agents on nodes and to move agents between nodes. It also gives an evaluation of a middleware prototype running on Imote2 nodes that communicate over ZigBee. The results show that our implementation is reasonably efficient and fast enough to support the envisioned functionality on top of a commodity multi-hop wireless technology. Our work is to a large extent platform-neutral, thus it can inform the design of other systems that adopt a hierarchical structuring of mobile components. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Dense spectrum of resonances and spin-1/2 particle capture in a near-black-hole metric

We show that a spin-1/2 particle in the gravitational field of a massive body of radius R which slightly exceeds the Schwarzschild radius rs, possesses a dense spectrum of narrow resonances. Their lifetimes and density tend to infinity in the limit R → rs. We determine the cross section of the particle capture into these resonances and show that it is equal to the spin-1/2 absorption cross section for a Schwarzschild black hole. Thus black-hole properties may emerge in a non-singular static metric prior to the formation of a black hole.

Four-dimensional CT analysis of vocal cords mobility for highly focused single vocal cord irradiation

Background and Purpose: To quantify respiratory motion of the vocal cords during normal respiration using 4D-CT. The final goal is to develop a technique for single vocal cord irradiation (SVCI) in early glottic carcinoma. Sparing the non-involved cord and surrounding structures has the potential to preserve voice quality and allow re-irradiation of recurrent and second primary tumors. Material and methods: Four-dimensional CTs of 1 mm slice thickness from 10 early glottic carcinoma patients were acquired. The lateral dimensions of the air gap separating the vocal cords were measured anteriorly, at mid-level and posteriorly at each phase of the 4D-CTs. The corresponding anterior-posterior gaps were similarly measured. Cranio-caudal vocal cords movements during breathing were derived from the shifts of the arythenoids. Results: The population-averaged mean gap size ± the corresponding standard deviation due to breathing (SD_B) for the lateral gaps was 5.8 ± 0.7 mm anteriorly, 8.7 ± 0.9 mm at mid-level, and 11.0 ± 1.3 mm posteriorly. Anterior-posterior gap values were 21.7 ± 0.7 mm, while cranio-caudal shift SD_B was 0.8 mm. Conclusion: Vocal cords breathing motions were found to be small relative to their separation. Hence, breathing motion does not seem to be a limiting factor for SVCI. © 2008 Elsevier Ireland Ltd. All rights reserved.

Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures

A RkNN query returns all objects whose nearest k neighbors
contain the query object. In this paper, we consider RkNN
query processing in the case where the distances between
attribute values are not necessarily metric. Dissimilarities
between objects could then be a monotonic aggregate of dissimilarities
between their values, such aggregation functions
being specified at query time. We outline real world cases
that motivate RkNN processing in such scenarios. We consider
the AL-Tree index and its applicability in RkNN query
processing. We develop an approach that exploits the group
level reasoning enabled by the AL-Tree in RkNN processing.
We evaluate our approach against a Naive approach
that performs sequential scans on contiguous data and an
improved block-based approach that we provide. We use
real-world datasets and synthetic data with varying characteristics
for our experiments. This extensive empirical
evaluation shows that our approach is better than existing
methods in terms of computational and disk access costs,
leading to significantly better response times.