Clinical information extraction applications: A literature review.

As smartphone penetration saturates, we are witnessing a new trend in personal mobile devices—wearable mobile devices or simply wearables as it is often called. Wearables come in many different forms and flavors targeting different accessories and clothing that people wear. Although small in size, they are often expected to continuously sense, collect, and upload various physiological data to improve quality of life. These requirements put significant demand on improving communication security and reducing power consumption of the system, fueling new research in these areas. In this paper, we first provide a comprehensive survey and classification of commercially available wearables and research prototypes. We then examine the communication security issues facing the popular wearables followed by a survey of solutions studied in the literature. We also categorize and explain the techniques for improving the power efficiency of wearables. Next, we survey the research literature in wearable computing. We conclude with future directions in wearable market and research.

A Survey of Wearable Devices and Challenges

Ingredients of Locational Analysis (J. Krarup & P. Pruzan). The p-Median Problem and Generalizations (P. Mirchandani). The Uncapacitated Facility Location Problem (G. Cornuejols, et al.). Multiperiod Capacitated Location Models (S. Jacobsen). Decomposition Methods for Facility Location Problems (T. Magnanti & R. Wong). Covering Problems (A. Kolen & A. Tamir). p-Center Problems (G. Handler). Duality: Covering and Constraining p-Center Problems on Trees (B. Tansel, et al.). Locations with Spatial Interactions: The Quadratic Assignment Problem (R. Burkard). Locations with Spatial Interactions: Competitive Locations and Games (S. Hakimi). Equilibrium Analysis for Voting and Competitive Location Problems (P. Hansen, et al.). Location of Mobile Units in a Stochastic Environment (O. Berman, et al.). Index.

https://link.springer.com/content/pdf/10.1057%2Fjors.1991.208.pdf

Discrete location theory

Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach

A review of smart home applications based on Internet of Things

Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. We consider a failure model in which any two links in the network may fail in an arbitrary order. Three loopback methods of recovering from double-link failures are presented. The first two methods require the identification of the failed links, while the third one does not. However, precomputing the backup paths for the third method is more difficult than for the first two. A heuristic algorithm that pre-computes backup paths for links is presented. Numerical results comparing the performance of our algorithm with other approaches suggests that it is possible to achieve 100% recovery from double-link failures with a modest increase in backup capacity.

/pdf/on-double-link-failure-recovery-in-wdm-optical-networks-59vu569xu8.pdf

On double-link failure recovery in WDM optical networks

Location-based services (LBS) have become an immensely valuable source of real-time information and guidance. Nonetheless, the potential abuse of users' sensitive personal data by an LBS server is evolving into a serious concern. Privacy concerns in LBS exist on two fronts: location privacy and query privacy. In this paper we investigate issues related to query privacy. In particular, we aim to prevent the LBS server from correlating the service attribute, e.g., bar/tavern, in the query to the user's real-world identity. Location obfuscation using spatial generalization aided by anonymization of LBS queries is a conventional means to this end. However, effectiveness of this technique would abate in continuous LBS scenarios, i.e., where users are moving and recurrently requesting for LBS. In this paper, we present a novel query-perturbation-based scheme that protects query privacy in continuous LBS even when user-identities are revealed. Unlike most exiting works, our scheme does not require the presence of a trusted third party.

/pdf/protection-of-query-privacy-for-continuous-location-based-3fl67w826n.pdf

Protection of query privacy for continuous location based services

Smart homes are gaining vast popularity as the most promising application of the emerging Internet of Things (IoT) technology. Exploiting the high level of connectivity present in current electronic devices (such as smartphones, tablets, and multimedia systems), smart homes provide innovative, automated and interactive services for residential customers through distributed and collaborative operations. As these types of networks become enormously popular, it is fundamental to provide the adequate level of protection against cyber-attacks for the residential customers. However, the resource-constrained nature of many of the devices present in a smart home environment, does not permit to implement the standard security solutions and therefore smart homes currently present security vulnerabilities. In this paper the security challenges and threats to the existing solutions suited for smart homes are examined in detail with the objective of fostering the development of practical solutions to secure the smart homes.

Securing smart home: Technologies, security challenges, and security requirements

Network survivability is a crucial requirement in high-speed optical networks. Typical approaches of providing survivability have considered the failure of a single component such as a link or a node. In this paper, we motivate the need for considering double-link failures and present three loopback methods for handling such failures. In the first two methods, two edge-disjoint backup paths are computed for each link for rerouting traffic when a pair of links fails. These methods require the identification of the failed links before recovery can be completed. The third method requires the precomputation of a single backup path and does not require link identification before recovery. An algorithm that precomputes backup paths for links in order to tolerate double-link failures is then presented. Numerical results comparing the performance of our algorithm with other approaches suggest that it is possible to achieve almost 100% recovery from double-link failures with a moderate increase in backup capacity. A remarkable feature of our approach is that it is possible to trade off capacity for restorability by choosing a subset of double-link failures and designing backup paths using our algorithm for only those failure scenarios.

Loopback recovery from double-link failures in optical mesh networks

Many tree-based multicast algorithms have been proposed to provide an efficient software implementation on parallel platforms without hardware multicast support. These algorithms are either architecture-dependent (not portable) or architecture-independent (portable) but do not provide good performance when ported to different parallel platforms. Based on the LogP model, the proposed parameterized communication model can more accurately characterize the communication network of parallel platforms. The model encompasses a number of critical system parameters which can be easily measured on a given parallel platform. Based on the model, efficient methods to construct optimal multicast trees are proposed for both 1-port and /spl alpha/-port communication architectures. Experimental results conducted on the IBR/SP at Argonne National Laboratory are presented to compare the performance of the optimal multicast tree with two other known free-based multicast algorithms. We claim that our proposed multicast algorithms can be ported to different parallel platforms and provide a near-optimal performance as the truly machine-specific optimal performance is achievable only when the underlying detailed network characteristics are considered.

Hyeong-Ah Choi

Papers

On double-link failure recovery in WDM optical networks

Protection of query privacy for continuous location based services

Securing smart home: Technologies, security challenges, and security requirements

Loopback recovery from double-link failures in optical mesh networks

Construction of optimal multicast trees based on the parameterized communication model