It Had to Be You Performance at NYCEMF 2014:for Clarinet and Computer

Concert 15: 3:30-5:30 PM: Playhouse

Danny Saul, Glitches/Trajectories
Ethan Greene, Lissajous
Kyong Mee Choi, Ceaseless Cease
Thomas Beverly, Ocotillo

intermission

Paul Wilson, It Had to be You
Kwangrae Kim, Sound Drawing
Steven Kemper, Mythical Spaces
David Durant, FAJI

On The Energy-Efficiency of Byte-Addressable Non-Volatile Memory

Non-Volatile Memory (NVM) technology holds promise to replace SRAM and DRAM at various levels of the memory hierarchy. The interest in NVM is motivated by the difficulty faced in scaling DRAM beyond 22 nm and, long-term, lower cost per bit. While offering higher density and negligible static power (leakage and refresh), NVM suffers increased latency and energy per memory access. This paper develops energy and performance models of memory systems and applies them to understand the energy-efficiency of replacing or complementing DRAM with NVM. Our analysis focusses on the application of NVM in main memory. We demonstrate that NVM such as STT-RAM and RRAM is energy-efficient for memory sizes commonly employed in servers and high-end workstations, but PCM is not. Furthermore, the model is well suited to quickly evaluate the impact of changes to the model parameters, which may be achieved through optimization of the memory architecture, and to determine the key parameters that impact system-level energy and performance.

First-order characteristics of the person-to-vehicle channel at 5.8 GHz

In this paper we investigate the first order characteristics of the radio channel between a moving vehicle and a stationary person positioned by the side of a road at 5.8 GHz. The experiments considered a transmitter positioned at different locations on both the body and receivers positioned on the vehicle. The transmitter was alternated between positions on the central chest region, back and the wrist (facing the roadside) of the body, with the receivers placed on the outside roof, the outside rear window and the inside dashboard of the vehicle. The Rice fading model was applied to the measurement data to assess its suitability for characterizing this emerging type of wireless channel. The Ricean K factors calculated from the data suggest that a significant dominant component existed in the majority of the channels considered in this study.

Improving signal reliability for indoor off–body communications using spatial diversity at the base station

In this paper, we investigate the potential improvement in signal reliability for indoor off-body communications when using spatial diversity at the base station. In particular, we utilize two hypothetical indoor base stations operating at 5.8 GHz each featuring four antennas which are spaced at either half- or one-wavelength apart. Three on-body locations are considered along with four types of user movement. The cross-correlation between the received signal envelopes observed at each base station antenna element was calculated and found to be always less than 0.5. Selection, maximal ratio, and equal gain combining of the received signal has shown that the greatest improvement is obtained when the user is mobile, with a maximum diversity gain of 11.34 dB achievable when using a four branch receiver. To model the fading envelope obtained at the output of the virtual combiners, we use diversity specific, theoretical probability density functions for multi-branch receivers operating in Nakagami-m fading channels. It is shown that these equations provide an excellent fit to the measured channel data.

A statistical analysis of person–to–vehicle communications channels in an urban environment at 5.8 GHz

In recent years, the embracement of smart devices carried or worn by people have transformed how society interact with one another. This trend has also been observed in the advancement of vehicular networks. Here, developments in wireless technologies for vehicle-to-vehicle (V2V) and vehicle-to-roadside (V2R) communications are leading to a new generation of vehicular networks. A natural extension of both types of networks will be their eventual wireless integration. Both people and vehicles will undoubtedly form integral parts of future mobile networks of people and things. Central to this will be the person-to-vehicle (P2V) communications channel. As the P2V channel will be subject to different signal propagation characteristics than either type of communication system considered in isolation, it is imperative the characteristics of the wireless channel must first be fully understood. To the best of the author's knowledge, this is a topic which has not yet been addressed in the open literature. In this paper we will present our most recent research on the statistical characterization of the 5.8 GHz person-to-vehicle channel in an urban environment.

Efficient tracking of human poses using a manifold hierarchy

In this paper a 3D human pose tracking framework is presented. A new dimensionality reduction method (Hierarchical Temporal Laplacian Eigenmaps) is introduced to represent activities in hierarchies of low dimensional spaces. Such a hierarchy provides increasing independence between limbs, allowing higher flexibility and adaptability that result in improved accuracy. Moreover, a novel deterministic optimisation method (Hierarchical Manifold Search) is applied to estimate efficiently the position of the corresponding body parts. Finally, evaluation on public datasets such as HumanEva demonstrates that our approach achieves a 62.5mm-65mm average joint error for the walking activity and outperforms state-of-the-art methods in terms of accuracy and computational cost.

Utilising a computer game as a therapeutic intervention for youth in residential care: Some preliminary findings on use and acceptability

Mental illness is common amongst young people living in residential care, many of whom are reluctant to avail of therapeutic help. The potential value of computer games as therapeutic tools for these young people has received very little attention, despite indications of their potential for promoting engagement in therapeutic work and improving mental health outcomes. This study aimed to fill this research gap through the development, introduction, and preliminary evaluation of a therapeutic intervention in group care settings. The intervention incorporated a commercially available computer game (The SIMS Life Stories™) and emotion regulation skill coaching. Qualified residential social workers were trained to deliver it to young people in three children's homes in Northern Ireland, where therapeutic approaches to social work had been introduced. The research was framed as an exploratory case study which aimed to determine the acceptability and potential therapeutic value of this intervention. The evidence suggests that computer-game based interventions of this type may have value as therapeutic tools in group care settings and deserve further development and empirical investigation to determine their effectiveness in improving mental health outcomes.

Design patterns percolating to parallel programming framework implementation

Structured parallel programming is recognised as a viable and effective means of tackling parallel programming problems. Recently, a set of simple and powerful parallel building blocks RISC pb²l) has been proposed to support modelling and implementation of parallel frameworks. In this work we demonstrate how that same parallel building block set may be used to model both general purpose parallel programming abstractions, not usually listed in classical skeleton sets, and more specialized domain specific parallel patterns. We show how an implementation of RISC pb² l can be realised via the FastFlow framework and present experimental evidence of the feasibility and efficiency of the approach.

DEX: Self-Healing Expanders

We present a fully-distributed self-healing algorithm DEX, that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders - whose expansion properties hold deterministically - that works even under an all-powerful adaptive adversary that controls the dynamic changes to the network (the adversary has unlimited computational power and knowledge of the entire network state, can decide which nodes join and leave and at what time, and knows the past random choices made by the algorithm). Previous distributed expander constructions typically provide only probabilistic guarantees on the network expansion which rapidly degrade in a dynamic setting, in particular, the expansion properties can degrade even more rapidly under adversarial insertions and deletions. Our algorithm provides efficient maintenance and incurs a low overhead per insertion/deletion by an adaptive adversary: only O(log n) rounds and O(log n) messages are needed with high probability (n is the number of nodes currently in the network). The algorithm requires only a constant number of topology changes. Moreover, our algorithm allows for an efficient implementation and maintenance of a distributed hash table (DHT) on top of DEX, with only a constant additional overhead. Our results are a step towards implementing efficient self-healing networks that have guaranteed properties (constant bounded degree and expansion) despite dynamic changes.

Practical homomorphic encryption: A survey

Cloud computing technology has rapidly evolved over the last decade, offering an alternative way to store and work with large amounts of data. However data security remains an important issue particularly when using a public cloud service provider. The recent area of homomorphic cryptography allows computation on encrypted data, which would allow users to ensure data privacy on the cloud and increase the potential market for cloud computing. A significant amount of research on homomorphic cryptography appeared in the literature over the last few years; yet the performance of existing implementations of encryption schemes remains unsuitable for real time applications. One way this limitation is being addressed is through the use of graphics processing units (GPUs) and field programmable gate arrays (FPGAs) for implementations of homomorphic encryption schemes. This review presents the current state of the art in this promising new area of research and highlights the interesting remaining open problems.

High-Speed Fully Homomorphic Encryption Over the Integers

A fully homomorphic encryption (FHE) scheme is envisioned as a key cryptographic tool in building a secure and reliable cloud computing environment, as it allows arbitrary evaluation of a ciphertext without revealing the plaintext. However, existing FHE implementations remain impractical due to very high time and resource costs. To the authors’ knowledge, this paper presents the first hardware implementation of a full encryption primitive for FHE over the integers using FPGA technology. A large-integer multiplier architecture utilising Integer-FFT multiplication is proposed, and a large-integer Barrett modular reduction module is designed incorporating the proposed multiplier. The encryption primitive used in the integer-based FHE scheme is designed employing the proposed multiplier and modular reduction modules. The designs are verified using the Xilinx Virtex-7 FPGA platform. Experimental results show that a speed improvement factor of up to 44 is achievable for the hardware implementation of the FHE encryption scheme when compared to its corresponding software implementation. Moreover, performance analysis shows further speed improvements of the integer-based FHE encryption primitives may still be possible, for example through further optimisations or by targeting an ASIC platform.

Laughter Type Recognition from Whole Body Motion

Despite the importance of laughter in social interactions it remains little studied in affective computing. Respiratory, auditory, and facial laughter signals have been investigated but laughter-related body movements have received almost no attention. The aim of this study is twofold: first an investigation into observers' perception of laughter states (hilarious, social, awkward, fake, and non-laughter) based on body movements alone, through their categorization of avatars animated with natural and acted motion capture data. Significant differences in torso and limb movements were found between animations perceived as containing laughter and those perceived as nonlaughter. Hilarious laughter also differed from social laughter in the amount of bending of the spine, the amount of shoulder rotation and the amount of hand movement. The body movement features indicative of laughter differed between sitting and standing avatar postures. Based on the positive findings in this perceptual study, the second aim is to investigate the possibility of automatically predicting the distributions of observer's ratings for the laughter states. The findings show that the automated laughter recognition rates approach human rating levels, with the Random Forest method yielding the best performance.

Dataflow toolset for soft-core processors on FPGA for image processing applications

With security and surveillance, there is an increasing need to be able to process image data efficiently and effectively either at source or in a large data networks. Whilst Field Programmable Gate Arrays have been seen as a key technology for enabling this, they typically use high level and/or hardware description language synthesis approaches; this provides a major disadvantage in terms of the time needed to design or program them and to verify correct operation; it considerably reduces the programmability capability of any technique based on this technology. The work here proposes a different approach of using optimised soft-core processors which can be programmed in software. In particular, the paper proposes a design tool chain for programming such processors that uses the CAL Actor Language as a starting point for describing an image processing algorithm and targets its implementation to these custom designed, soft-core processors on FPGA. The main purpose is to exploit the task and data parallelism in order to achieve the same parallelism as a previous HDL implementation but avoiding the design time, verification and debugging steps associated with such approaches.

Compact Low-Profile Antenna for Wireless Medical Vital Sign Monitors at 868 MHz

A low-profile wearable antenna suitable for integration into low-cost, disposable medical vital signs monitors is presented. Simulated and measured antenna performance was characterized on a layered human tissue phantom, representative of the thorax region of a range of human bodies. The wearable antenna has sufficient bandwidth for the 868 MHz Industrial, Scientific and Medical frequency band. Wearable radiation efficiency of up to 30 % is reported when mounted in close proximity to the novel human tissue phantom antenna test-bed at 868 MHz.