Some aspects of therapy on a girl's psychiatric ward

Thesis (M.S.)--Boston University, 195

Plausible Mobility: Inferring Movement from Contacts

We address the difficult question of inferring plausible node mobility based only on information from wireless contact traces. Working with mobility information allows richer protocol simulations, particularly in dense networks, but requires complex set-ups to measure, whereas contact information is easier to measure but only allows for simplistic simulation models. In a contact trace a lot of node movement information is irretrievably lost so the original positions and velocities are in general out of reach. We propose a fast heuristic algorithm, inspired by dynamic force-based graph drawing, capable of inferring a plausible movement from any contact trace, and evaluate it on both synthetic and real-life contact traces. Our results reveal that (i) the quality of the inferred mobility is directly linked to the precision of the measured contact trace, and (ii) the simple addition of appropriate anticipation forces between nodes leads to an accurate inferred mobility.Comment: 8 pages, 8 figures, 1 tabl

HYMAD: Hybrid DTN-MANET Routing for Dense and Highly Dynamic Wireless Networks

In this paper we propose HYMAD, a Hybrid DTN-MANET routing protocol which uses DTN between disjoint groups of nodes while using MANET routing within these groups. HYMAD is fully decentralized and only makes use of topological information exchanges between the nodes. We evaluate the scheme in simulation by replaying real life traces which exhibit this highly dynamic connectivity. The results show that HYMAD outperforms the multi-copy Spray-and-Wait DTN routing protocol it extends, both in terms of delivery ratio and delay, for any number of message copies. Our conclusion is that such a Hybrid DTN-MANET approach offers a promising venue for the delivery of elastic data in mobile ad-hoc networks as it retains the resilience of a pure DTN protocol while significantly improving performance.Comment: 7 pages, 6 figure

Decays of the Littlest Higgs Z_H and the Onset of Strong Dynamics

The Little Higgs mechanism, as realized in various models, requires a set of new massive gauge bosons, some of which mix with gauge bosons of the Standard Model. For a range of mixing angles the coupling of gauge bosons to scalars can become strong, ultimately resulting in a breakdown of perturbative calculation. This phenomenon is studied in the Littlest Higgs model, where the approach to strong dynamics is characterized by increasing tree-level decay widths of the neutral Z_H boson to lighter gauge bosons plus multiple scalars. These increasing widths suggest a distinctive qualitative collider signature for the approach to the strong coupling regime of large Higgs and other scalar multiplicities. In this work we catalog the kinematically allowed three-body decays of the Z_H, and calculate the partial width of the process Z_H to Z_L H H. This partial width is found to be larger than the comparable two-body decay Z_H to Z_L H for values of the SU(2) mixing angle cosine(theta) less than 0.13, indicating divergence of the littlest Higgs sigma field expansion at values of cosine(theta) larger than a simple parametric calculation would suggest. Additionally, we present analytical expressions for all two-body decays of the Littlest Higgs Z_H gauge boson, including the effects of all final-state masses

Identity Crisis: Class Certification, Aggregate Proof, and How Rule 23 May Be Self-Defeating the Policy for Which It Was Established

Class actions suits developed in the United States as a form of “group litigation,” an alternative to the impracticability or inequities of separate, individual actions of a similarly situated class of plaintiffs and, eventually, defendants. Congressional passage of the Class Action Fairness Act of 2005 (CAFA) provided the federal courts with expounded diversity jurisdiction for the purpose of “assur[ing] fairer outcomes for class members and defendants.” However, recent circuit splits regarding class certification under Rule 23 of the Federal Rules of Civil Procedure (FRCP) and the use of aggregate proof in certifying classes have, in an ironic twist of legal fate, resulted in the very same “inconsistent or varying” standards that the rule was designed to prevent

Temporal Reachability Graphs

While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in time-varying ones. In this paper, we introduce the notion of temporal reachability graphs. A (tau,delta)-reachability graph} is a time-varying directed graph derived from an existing connectivity graph. An edge exists from one node to another in the reachability graph at time t if there exists a journey (i.e., a spatiotemporal path) in the connectivity graph from the first node to the second, leaving after t, with a positive edge traversal time tau, and arriving within a maximum delay delta. We make three contributions. First, we develop the theoretical framework around temporal reachability graphs. Second, we harness our theoretical findings to propose an algorithm for their efficient computation. Finally, we demonstrate the analytic power of the temporal reachability graph concept by applying it to synthetic and real-life datasets. On top of defining clear upper bounds on communication capabilities, reachability graphs highlight asymmetric communication opportunities and offloading potential.Comment: In proceedings ACM Mobicom 201

The analysis of delays in simulator digital computing systems. Volume 1: Formulation of an analysis approach using a central example simulator model

The effects of spurious delays in real time digital computing systems are examined. Various sources of spurious delays are defined and analyzed using an extant simulator system as an example. A specific analysis procedure is set forth and four cases are viewed in terms of their time and frequency domain characteristics. Numerical solutions are obtained for three single rate one- and two-computer examples, and the analysis problem is formulated for a two-rate, two-computer example

A study of pilot modeling in multi-controller tasks

A modeling approach, which utilizes a matrix of transfer functions to describe the human pilot in multiple input, multiple output control situations, is studied. The approach used was to extend a well established scalar Wiener-Hopf minimization technique to the matrix case and then study, via a series of experiments, the data requirements when only finite record lengths are available. One of these experiments was a two-controller roll tracking experiment designed to force the pilot to use rudder in order to coordinate and reduce the effects of aileron yaw. One model was computed for the case where the signals used to generate the spectral matrix are error and bank angle while another model was computed for the case where error and yaw angle are the inputs. Several anomalies were observed to be present in the experimental data. These are defined by the descriptive terms roll up, break up, and roll down. Due to these algorithm induced anomalies, the frequency band over which reliable estimates of power spectra can be achieved is considerably less than predicted by the sampling theorem

Relieving the Wireless Infrastructure: When Opportunistic Networks Meet Guaranteed Delays

Major wireless operators are nowadays facing network capacity issues in striving to meet the growing demands of mobile users. At the same time, 3G-enabled devices increasingly benefit from ad hoc radio connectivity (e.g., Wi-Fi). In this context of hybrid connectivity, we propose Push-and-track, a content dissemination framework that harnesses ad hoc communication opportunities to minimize the load on the wireless infrastructure while guaranteeing tight delivery delays. It achieves this through a control loop that collects user-sent acknowledgements to determine if new copies need to be reinjected into the network through the 3G interface. Push-and-Track includes multiple strategies to determine how many copies of the content should be injected, when, and to whom. The short delay-tolerance of common content, such as news or road traffic updates, make them suitable for such a system. Based on a realistic large-scale vehicular dataset from the city of Bologna composed of more than 10,000 vehicles, we demonstrate that Push-and-Track consistently meets its delivery objectives while reducing the use of the 3G network by over 90%.Comment: Accepted at IEEE WoWMoM 2011 conferenc