Re-thinking continuing professional development through changing metaphors and location in professional practices

Many professions have requirements for professional development activities to ensure continuing registration or membership. These commonly focus on participation in a limited range of activities. This paper questions the assumptions behind such approaches and what alternatives might be considered. It explores the suitability of metaphors used for continuing professional education and suggests that continuing professional development might be better conceptualised within practice theory. It identifies what a practice theory view of continuing professional development might involve and discusses the implications, particularly the notion of locating development within the practices of work.

Privacy preserving in location data release: A differential privacy approach

Communication devices with GPS chips allow people to generate large volumes of location data. However, location datasets have been confronted with serious privacy concerns. Recently, several privacy techniques have been proposed but most of them lack a strict privacy notion, and can hardly resist the number of possible attacks. This paper proposes a private release algorithm to randomize location datasets in a strict privacy notion, differential privacy. This algorithm includes three privacy-preserving operations: Private Location Clustering shrinks the randomized domain and Cluster Weight Perturbation hides the weights of locations, while Private Location Selection hides the exact locations of a user. Theoretical analysis on utility confirms an improved trade-off between the privacy and utility of released location data. The experimental results further suggest this private release algorithm can successfully retain the utility of the datasets while preserving users’ privacy.

Recover fault services via complex service-to-node mappings in wireless sensor networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node's perspective i.e., migrating the service of faulty node to it's nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don't fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level. © 2014 Springer Science+Business Media New York.

Location privacy preserving for semantic-aware applications

With the increase use of location-based services, location privacy has recently raised serious concerns. To protect a user from being identified, a cloaked spatial region that contains other k-1 nearest neighbors of the user is used to replace the accurate position. In this paper, we consider location-aware applications that services are different among regions. To search nearest neighbors, we define a novel distance measurement that combines the semantic distance and the Euclidean distance to address the privacy preserving issue in the above-mentioned applications. We also propose an algorithm kNNH to implement our proposed method. The experimental results further suggest that the proposed distance metric and the algorithm can successfully retain the utility of the location services while preserving users’ privacy.

Energy efficiency on location based applications in mobile cloud computing: a survey

The constrained battery power of mobile devices poses a serious impact on user experience. As an increasingly prevalent type of applications in mobile cloud environments, location-based applications (LBAs) present some inherent limitations concerning energy. For example, the Global Positioning System based positioning mechanism is well-known for its extremely power-hungry attribute. Due to the severity of the issue, considerable researches have focused on energy-efficient locating sensing mechanism in the last a few years. In this paper, we provide a comprehensive survey of recent work on low-power design of LBAs. An overview of LBAs and different locating sensing technologies used today are introduced. Methods for energy saving with existing locating technologies are investigated. Reductions of location updating queries and simplifications of trajectory data are also mentioned. Moreover, we discuss cloud-based schemes in detail which try to develop new energy-efficient locating technologies by leveraging the cloud capabilities of storage, computation and sharing. Finally, we conclude the survey and discuss the future research directions. © 2013 Springer-Verlag Wien.

A functional observer based fault detection technique for dynamical systems

This paper presents a functional observer based fault detection method. The fault detection is achieved using a functional observer based fault indicator that asymptotically converges to a fault indicator that can be derived based on the nominal system. The asymptotic value of the proposed fault indicator is independent of the functional observer parameters and also the convergence rate of the fault indicator can be altered by choosing appropriate functional observer parameters. The advantage of using this new method is that the observed system is not necessarily needed to be observable; therefore, the proposed fault detection technique is also applicable for systems where state observers cannot be designed; moreover, the functional observer fault detection scheme is always of reduced order in comparison to a state observer based scheme.

A fault detection scheme for time-delay systems using minimum-order functional observers

This paper presents a method for designing residual generators using minimum-order functional observers to detect actuator and component faults in time-delay systems. Existence conditions of the residual generators and functional observers are first derived, and then based on a parametric approach to the solution of a generalized Sylvester matrix equation, we develop systematic procedures for designing minimum-order functional observers to detect faults in the system. The advantages of having minimum-order observers are obvious from the economical and practical points of view as cost saving and simplicity can be achieved, particularly when dealing with high-order complex systems. Extensive numerical examples are given to illustrate the proposed fault detection scheme. In all the numerical examples, we design minimum-order residual generators and functional observers to detect faults in the system.

Association between perception of fault for the crash and function, return to work and health status 1 year after road traffic injury: a registry-based cohort study

Objectives To establish the association between the patient's perception of fault for the crash and 12-month outcomes after non-fatal road traffic injury.Setting Two adult major trauma centres, one regional trauma centre and one metropolitan trauma centre in Victoria, Australia.Participants 2605 adult, orthopaedic trauma patients covered by the state's no-fault third party insurer for road traffic injury, injured between September 2010 and February 2014.Outcome measures EQ-5D-3L, return to work and functional recovery (Glasgow Outcome Scale—Extended score of upper good recovery) at 12 months postinjury.Results After adjusting for key confounders, the adjusted relative risk (ARR) of a functional recovery (0.57, 95% CI 0.46 to 0.69) and return to work (0.92, 95% CI 0.86 to 0.99) were lower for the not at fault compared to the at fault group. The ARR of reporting problems on EQ-5D items was 1.20–1.35 times higher in the not at fault group. Conclusions Patients who were not at fault, or denied being at fault despite a police report of fault, experienced poorer outcomes than the at fault group. Attributing fault to others was associated with poorer outcomes. Interventions to improve coping, or to resolve negative feelings from the crash, could facilitate better outcomes in the future.

A privacy-preserving location tracking system for smartphones based on cloud storage

With the widespread use of smartphones, the loss of a device is a critical problem, which results both in disrupting daily communications and losing valuable property. As a result, tracking systems have been developed to track mobile devices. Previous tracking systems focus on recovering the device's locations after it goes missing, with security methods implemented on the clients. However, users' locations are stored in untrusted third-party services, which may be attacked or eavesdropped. In this paper, we propose a system, named Android Cloud Tracker, to provide a privacy-preserving tracking client and safe storing of user's locations. We use cloud storage controlled by users themselves as storage facilities, and they do not need to worry about any untrusted third party. We implement Android Cloud Tracker prototype on Android phones, and the evaluation shows that it is both practical and lightweight: it generates a small amount of data flow and its distributed architecture provides strong guarantees of location privacy while preserving the ability to efficiently track missing devices.

A differentially private algorithm for location data release

The rise of mobile technologies in recent years has led to large volumes of location information, which are valuable resources for knowledge discovery such as travel patterns mining and traffic analysis. However, location dataset has been confronted with serious privacy concerns because adversaries may re-identify a user and his/her sensitivity information from these datasets with only a little background knowledge. Recently, several privacy-preserving techniques have been proposed to address the problem, but most of them lack a strict privacy notion and can hardly resist the number of possible attacks. This paper proposes a private release algorithm to randomize location dataset in a strict privacy notion, differential privacy, with the goal of preserving users’ identities and sensitive information. The algorithm aims to mask the exact locations of each user as well as the frequency that the user visits the locations with a given privacy budget. It includes three privacy-preserving operations: private location clustering shrinks the randomized domain and cluster weight perturbation hides the weights of locations, while private location selection hides the exact locations of a user. Theoretical analysis on privacy and utility confirms an improved trade-off between privacy and utility of released location data. Extensive experiments have been carried out on four real-world datasets, GeoLife, Flickr, Div400 and Instagram. The experimental results further suggest that this private release algorithm can successfully retain the utility of the datasets while preserving users’ privacy.

Continuous discovery of co-location contexts from Bluetooth data

The discovery of contexts is important for context-aware applications in pervasive computing. This is a challenging problem because of the stream nature of data, the complexity and changing nature of contexts. We propose a Bayesian nonparametric model for the detection of co-location contexts from Bluetooth signals. By using an Indian buffet process as the prior distribution, the model can discover the number of contexts automatically. We introduce a novel fixed-lag particle filter that processes data incrementally. This sampling scheme is especially suitable for pervasive computing as the computational requirements remain constant in spite of growing data. We examine our model on a synthetic dataset and two real world datasets. To verify the discovered contexts, we compare them to the communities detected by the Louvain method, showing a strong correlation between the results of the two methods. Fixed-lag particle filter is compared with Gibbs sampling in terms of the normalized factorization error that shows a close performance between the two inference methods. As fixed-lag particle filter processes a small chunk of data when it comes and does not need to be restarted, its execution time is significantly shorter than that of Gibbs sampling.

FESTAL: fault-tolerant elastic scheduling algorithm for real-time tasks in virtualized clouds

As clouds have been deployed widely in various fields, the reliability and availability of clouds become the major concern of cloud service providers and users. Thereby, fault tolerance in clouds receives a great deal of attention in both industry and academia, especially for real-time applications due to their safety critical nature. Large amounts of researches have been conducted to realize fault tolerance in distributed systems, among which fault-tolerant scheduling plays a significant role. However, few researches on the fault-tolerant scheduling study the virtualization and the elasticity, two key features of clouds, sufficiently. To address this issue, this paper presents a fault-tolerant mechanism which extends the primary-backup model to incorporate the features of clouds. Meanwhile, for the first time, we propose an elastic resource provisioning mechanism in the fault-tolerant context to improve the resource utilization. On the basis of the fault-tolerant mechanism and the elastic resource provisioning mechanism, we design novel fault-tolerant elastic scheduling algorithms for real-time tasks in clouds named FESTAL, aiming at achieving both fault tolerance and high resource utilization in clouds. Extensive experiments injecting with random synthetic workloads as well as the workload from the latest version of the Google cloud tracelogs are conducted by CloudSim to compare FESTAL with three baseline algorithms, i.e., Non-M igration-FESTAL (NMFESTAL), Non-Overlapping-FESTAL (NOFESTAL), and Elastic First Fit (EFF). The experimental results demonstrate that FESTAL is able to effectively enhance the performance of virtualized clouds.

DoSTra: Discovering common behaviors of objects using the duration of staying on each location of trajectories

Since semantic trajectories can discover more semantic meanings of a user's interests without geographic restrictions, research on semantic trajectories has attracted a lot of attentions in recent years. Most existing work discover the similar behavior of moving objects through analysis of their semantic trajectory pattern, that is, sequences of locations. However, this kind of trajectories without considering the duration of staying on a location limits wild applications. For example, Tom and Anne have a common pattern of Home→Restaurant → Company → Restaurant, but they are not similar, since Tom works at Restaurant, sends snack to someone at Company and return to Restaurant while Anne has breakfast at Restaurant, works at Company and has lunch at Restaurant. If we consider duration of staying on each location we can easily to differentiate their behaviors. In this paper, we propose a novel approach for discovering common behaviors by considering the duration of staying on each location of trajectories (DoSTra). Our approach can be used to detect the group that has similar lifestyle, habit or behavior patterns and predict the future locations of moving objects. We evaluate the experiment based on synthetic dataset, which demonstrates the high effectiveness and efficiency of the proposed method.