The quantified-Self and wearable technologies in the workplace: implications and challenges for their implementations

Introduction of technologies in the workplace have led to a dramatic change. These changes have come with an increased capacity to gather data about one’s working performance (i.e. productivity), as well as the capacity to track one’s personal responses (i.e. emotional, physiological, etc.) to this changing workplace environment. This movement of self-monitoring or self-sensing using diverse types of wearable sensors combined with the use of computing has been identified as the Quantified-Self. Miniaturization of sensors, reduction in cost and a non-stop increase in the computer power capacity has led to a panacea of wearables and sensors to track and analyze all types of information. Utilized in the personal sphere to track information, a looming question remains, should employers use the information from the Quantified-Self to track their employees’ performance or well-being in the workplace and will this benefit employees? The aim of the present work is to layout the implications and challenges associated with the use of Quantified-Self information in the workplace. The Quantified-Self movement has enabled people to understand their personal life better by tracking multiple information and signals; such an approach could allow companies to gather knowledge on what drives productivity for their business and/or well-being of their employees. A discussion about the implications of this approach will cover 1) Monitoring health and well-being, 2) Oversight and safety, and 3) Mentoring and training. Challenges will address the question of 1) Privacy and Acceptability, 2) Scalability and 3) Creativity. Even though many questions remain regarding their use in the workplace, wearable technologies and Quantified-Self data in the workplace represent an exciting opportunity for the industry and health and safety practitioners who will be using them.

Parallel improved Schnorr-Euchner enumeration SE++ for the CVP and SVP

The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.

Development of magnetoelectric CoFe2O4/poly(vinylidene fluoride) microspheres

Magnetoelectric microspheres based on piezoelectric poly(vinylidene fluoride) (PVDF) and magnetrostrictive CoFe2O4 (CFO), a novel morphology for polymer-based ME material, have been developed by an electrospray process. The CFO nanoparticles content in the (3-7 μm diameter) microspheres reaches values up to 27 wt.%, despite their concentration in the starting solution reaching values up to 70 wt.%. Additionally, the inclusion of magnetostrictive nanoparticles into the polymer spheres has no relevant effect on the piezoelectric β-phase content (≈60%), crystallinity (40%) and the onset degradation temperature (460º-465ºC) of the polymer matrix. The multiferroic microspeheres show a maximum piezoelectric reponse |d33|≈30 pC.N-1, leading to a magnetoelectric response of Δ|d33|≈5 pC.N-1 obtained when a 220 mT DC magnetic field was applied. It is also shown that the interface between CFO nanoparticles and PVDF (from 0 to 55%) has a strong influence on the ME response of the microspheres. The simplicity and the scalability of the processing method suggest a large application potential of this novel magnetoelectric geometry in areas such as tissue engineering, sensors and actuators.

A hybrid MAC Scheme to improve the transmission performance in body sensor networks

Wireless body sensor networks (WBSNs) constitute a key technology for closing the loop between patients and healthcare providers, as WBSNs provide sensing ability, as well as mobility and portability, essential characteristics for wide acceptance of wireless healthcare technology. However, one important and difficult aspect of WBSNs is to provide data transmissions with quality of service, among other factors due to the antennas being small size and placed close to the body. Such transmissions cannot be fully provided without the assumption of a MAC protocol that solves the problems of the medium sharing. A vast number of MAC protocols conceived for wireless networks are based on random or scheduled schemes. This paper studies firstly the suitability of two MAC protocols, one using CSMA and the other TDMA, to transmit directly to the base station the signals collected continuously from multiple sensor nodes placed on the human body. Tests in a real scenario show that the beaconed TDMA MAC protocol presents an average packet loss ratio lower than CSMA. However, the average packet loss ratio is above 1.0 %. To improve this performance, which is of vital importance in areas such as e-health and ambient assisted living, a hybrid TDMA/CSMA scheme is proposed and tested in a real scenario with two WBSNs and four sensor nodes per WBSN. An average packet loss ratio lower than 0.2 % was obtained with the hybrid scheme. To achieve this significant improvement, the hybrid scheme uses a lightweight algorithm to control dynamically the start of the superframes. Scalability and traffic rate variation tests show that this strategy allows approximately ten WBSNs operating simultaneously without significant performance degradation.

ADSNARK: Nearly practical and privacy-preserving proofs on authenticated data

We study the problem of privacy-preserving proofs on authenticated data, where a party receives data from a trusted source and is requested to prove computations over the data to third parties in a correct and private way, i.e., the third party learns no information on the data but is still assured that the claimed proof is valid. Our work particularly focuses on the challenging requirement that the third party should be able to verify the validity with respect to the specific data authenticated by the source — even without having access to that source. This problem is motivated by various scenarios emerging from several application areas such as wearable computing, smart metering, or general business-to-business interactions. Furthermore, these applications also demand any meaningful solution to satisfy additional properties related to usability and scalability. In this paper, we formalize the above three-party model, discuss concrete application scenarios, and then we design, build, and evaluate ADSNARK, a nearly practical system for proving arbitrary computations over authenticated data in a privacy-preserving manner. ADSNARK improves significantly over state-of-the-art solutions for this model. For instance, compared to corresponding solutions based on Pinocchio (Oakland’13), ADSNARK achieves up to 25× improvement in proof-computation time and a 20× reduction in prover storage space.