snu-aidas/HVMap-dataset huggingface dataset:
High performance work systems: the gap between policy and practice in health care reform.

PURPOSE
Studies of high-performing organisations have consistently reported a positive relationship between high performance work systems (HPWS) and performance outcomes. Although many of these studies have been conducted in manufacturing, similar findings of a positive correlation between aspects of HPWS and improved care delivery and patient outcomes have been reported in international health care studies. The purpose of this paper is to bring together the results from a series of studies conducted within Australian health care organisations. First, the authors seek to demonstrate the link found between high performance work systems and organisational performance, including the perceived quality of patient care. Second, the paper aims to show that the hospitals studied do not have the necessary aspects of HPWS in place and that there has been little consideration of HPWS in health system reform.


DESIGN/METHODOLOGY/APPROACH
The paper draws on a series of correlation studies using survey data from hospitals in Australia, supplemented by qualitative data collection and analysis. To demonstrate the link between HPWS and perceived quality of care delivery the authors conducted regression analysis with tests of mediation and moderation to analyse survey responses of 201 nurses in a large regional Australian health service and explored HRM and HPWS in detail in three casestudy organisations. To achieve the second aim, the authors surveyed human resource and other senior managers in all Victorian health sector organisations and reviewed policy documents related to health system reform planned for Australia.


FINDINGS
The findings suggest that there is a relationship between HPWS and the perceived quality of care that is mediated by human resource management (HRM) outcomes, such as psychological empowerment. It is also found that health care organisations in Australia generally do not have the necessary aspects of HPWS in place, creating a policy and practice gap. Although the chief executive officers of health service organisations reported high levels of strategic HRM, the human resource and other managers reported a distinct lack of HPWS from their perspectives. The authors discuss why health care organisations may have difficulty in achieving HPWS.


ORIGINALITY/VALUE
Leaders in health care organisations should focus on ensuring human resource management systems, structures and processes that support HPWS. Policy makers need to consider HPWS as a necessary component of health system reform. There is a strong need to reorient organisational human resource management policies and procedures in public health care organisations towards high performing work systems.
A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost

We present a simple, new paradigm for the design of collision-free hash functions. Any function emanating from this paradigm is incremental. (This means that if a message x which I have previously hashed is modi ed to x0 then rather than having to re-compute the hash of x 0 from scratch, I can quickly \update" the old hash value to the new one, in time proportional to the amount of modi cation made in x to get x.) Also any function emanating from this paradigm is parallelizable, useful for hardware implementation. We derive several speci c functions from our paradigm. All use a standard hash function, assumed ideal, and some algebraic operations. The rst function, MuHASH, uses one modular multiplication per block of the message, making it reasonably e cient, and signi cantly faster than previous incremental hash functions. Its security is proven, based on the hardness of the discrete logarithm problem. A second function, AdHASH, is even faster, using additions instead of multiplications, with security proven given either that approximation of the length of shortest lattice vectors is hard or that the weighted subset sum problem is hard. A third function, LtHASH, is a practical variant of recent lattice based functions, with security proven based, again on the hardness of shortest lattice vector approximation. Dept. of Computer Science & Engineering, University of California at San Diego, 9500 Gilman Drive, La Jolla, California 92093, USA. E-Mail: mihir@cs.ucsd.edu. URL: http://www-cse.ucsd.edu/users/mihir. Supported in part by NSF CAREER Award CCR-9624439 and a Packard Foundation Fellowship in Science and Engineering. yMIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA 02139, USA. E-Mail: miccianc@theory.lcs.mit.edu. Supported in part by DARPA contract DABT63-96-C-0018.
Learning deep physiological models of affect

More than 15 years after the early studies in Affective Computing (AC), [1] the problem of detecting and modeling emotions in the context of human-computer interaction (HCI) remains complex and largely unexplored. The detection and modeling of emotion is, primarily, the study and use of artificial intelligence (AI) techniques for the construction of computational models of emotion. The key challenges one faces when attempting to model emotion [2] are inherent in the vague definitions and fuzzy boundaries of emotion, and in the modeling methodology followed. In this context, open research questions are still present in all key components of the modeling process. These include, first, the appropriateness of the modeling tool employed to map emotional manifestations and responses to annotated affective states; second, the processing of signals that express these manifestations (i.e., model input); and third, the way affective annotation (i.e., model output) is handled. This paper touches upon all three key components of an affective model (i.e., input, model, output) and introduces the use of deep learning (DL) [3], [4], [5] methodologies for affective modeling from multiple physiological signals.
Three Implementations of SquishQL, a Simple RDF Query Language

RDF provides a basic way to represent data for the Semantic Web. We have been experimenting with the query paradigm for working with RDF data in semantic web applications. Query of RDF data provides a declarative access mechanism that is suitable for application usage and remote access. We describe work on a conceptual model for querying RDF data that refines ideas first presented in at the W3C workshop on Query Languages [14] and the design of one possible syntax, derived from [7], that is suitable for application programmers. Further, we present experience gained in three implementations of the query language.
1 Unsupervised Feature Learning in Time Series 2 Prediction Using Continuous Deep Belief Network 3

A continuous Deep Belief Network (cDBN) with two hidden layers is proposed in this 18 paper, focusing on the problem of weak feature learning ability when dealing with continuous data. 19 In cDBN, the input data is trained in an unsupervised way by using continuous version of transfer 20 functions, the contrastive divergence is designed in hidden layer training process to raise 21 convergence speed, an improved dropout strategy is then implemented in unsupervised training to 22 realize features learning by de-cooperating between the units, and then the network is fine-tuned 23 using back propagation algorithm. Besides, hyper-parameters are analysed through stability 24 analysis to assure the network can find the optimal. Finally, the experiments on Lorenz chaos series, 25 CATS benchmark and other real world like CO2 and waste water parameters forecasting show that 26 cDBN has the advantage of higher accuracy, simpler structure and faster convergence speed than 27 other methods. 28
Object modelling by registration of multiple range images

We study the problem of creating a complete model of a physical object. Although this may be possible using intensity images, we use here range images which directly provide access t o three dimensional information. T h e first problem that we need t o solve is t o find the transformation between the different views. Previous approaches have either assumed this transformation t o be known (which is extremely difficult for a complete model), or computed it with feature matching (which is not accurate enough for integration). In this paper, we propose a new approach which works on range d a t a directly, and registers successive views with enough overlapping area t o get an accurate transformation between views. This is performed by minimizing afunctional which does not require point t o point matches. We give the details of the registration method and modeling procedure, and illustrate them on real range images of complex objects. 1 Introduction Creating models of physical objects is a necessary component machine of biological vision modules. Such models can then be used in object recognition, pose estimation or inspection tasks. If the object of interest has been precisely designed, then such a model exists in the form of a CAD model. In many applications, however, it is either not possible or not practical to have access to such CAD models, and we need to build models from the physical object. Some researchers bypass the problem by using a model which consist,s of multiple views ([4], [a]), but t,liis is not, always enough. If one needs a complete model of an object, the following steps are necessary: 1. data acquisition, 2. registration between views, 3. integration of views. By view we mean the 3D surface information of the object from specific point of view. While the integration process is very dependent on the representation scheme used, the precondition for performing integration consists of knowing the transformation between the data from different views. The goal of registrat,ion is to find such a transformat.ion, which is also known as t,he covrespon,den,ce problem. This problem has been a t the core of many previous research efforts: Bhanu [a] developed an object modeling system for object recognition by rotating object through known angles to acquire multiple views. Chien et al. [3] and Ahuja and Veen-stra [l] used orthogonal views to construct octree object ' models. With these methods, …
Multi-type attributes driven multi-camera person re-identification

One of the major challenges in person Re-Identification (ReID) is the inconsistent visual appearance of a person. Current works on visual feature and distance metric learning have achieved significant achievements, but still suffer from the limited robustness to pose variations, viewpoint changes, etc., and the high computational complexity. This makes person ReID among multiple cameras still challenging. This work is motivated to learn mid-level human attributes which are robust to visual appearance variations and could be used as efficient features for person matching. We propose a weakly supervised multi-type attribute learning framework which considers the contextual cues among attributes and progressively boosts the accuracy of attributes only using a limited number of labeled data. Specifically, this framework involves a threestage training. A deep Convolutional Neural Network (dCNN) is first trained on an independent dataset labeled with attributes. Then it is fine-tuned on another dataset only labeled with person IDs using our defined triplet loss. Finally, the updated dCNN predicts attribute labels for the target dataset, which is combined with the independent dataset for the final round of fine-tuning. The predicted attributes, namely deep attributes exhibit promising generalization ability across different datasets. By directly using the deep attributes with simple Cosine distance, we have obtained competitive accuracy on four person ReID datasets. Experiments also show that a simple distance metric learning modular further boosts our method, making it outperform many recent ∗Corresponding author Email address: slzhang.jdl@pku.edu.cn (Shiliang Zhang) Preprint submitted to Pattern Recognition September 11, 2017
Walking to public transit: steps to help meet physical activity recommendations.

BACKGROUND
Nearly half of Americans do not meet the Surgeon General's recommendation of > or =30 minutes of physical activity daily. Some transit users may achieve 30 minutes of physical activity daily solely by walking to and from transit. This study estimates the total daily time spent walking to and from transit and the predictors of achieving 30 minutes of physical activity daily by doing so.


METHODS
Transit-associated walking times for 3312 transit users were examined among the 105,942 adult respondents to the 2001 National Household Travel Survey, a telephone-based survey sponsored by the U.S. Department of Transportation to assess American travel behavior.


RESULTS
Americans who use transit spend a median of 19 minutes daily walking to and from transit; 29% achieve > or =30 minutes of physical activity a day solely by walking to and from transit. In multivariate analysis, rail users, minorities, people in households earning <$15,000 a year, and people in high-density urban areas were more likely to spend > or =30 minutes walking to and from transit daily.


CONCLUSIONS
Walking to and from public transportation can help physically inactive populations, especially low-income and minority groups, attain the recommended level of daily physical activity. Increased access to public transit may help promote and maintain active lifestyles. Results from this study may contribute to health impact assessment studies (HIA) that evaluate the impact of proposed public transit systems on physical activity levels, and thereby may influence choices made by transportation planners.
Predictive Data Mining for Diagnosis of Thyroid Disease using Neural Network

This paper presents a systematic approach for earlier diagnosis of Thyroid disease using back propagation algorithm used in neural network. Back propagation algorithm is a widely used algorithm in this field. ANN has been developed based on back propagation of error used for earlier prediction of disease. ANN was subsequently trained with experimental data and testing is carried out using data that was not used during training process. Results show that outcome of ANN is in good agreement with experimental data; this indicates that developed neural network can be used as an alternative for earlier prediction of a disease. Keywords—Back propagation, decision tree, gradient descent, prediction, Supervised Learning
Classifying distinct basal cell carcinoma subtype by means of dermatoscopy and reflectance confocal microscopy.

BACKGROUND
The current guidelines for the management of basal cell carcinoma (BCC) suggest a different therapeutic approach according to histopathologic subtype. Although dermatoscopic and confocal criteria of BCC have been investigated, no specific studies were performed to evaluate the distinct reflectance confocal microscopy (RCM) aspects of BCC subtypes.


OBJECTIVES
To define the specific dermatoscopic and confocal criteria for delineating different BCC subtypes.


METHODS
Dermatoscopic and confocal images of histopathologically confirmed BCCs were retrospectively evaluated for the presence of predefined criteria. Frequencies of dermatoscopic and confocal parameters are provided. Univariate and adjusted odds ratios were calculated. Discriminant analyses were performed to define the independent confocal criteria for distinct BCC subtypes.


RESULTS
Eighty-eight BCCs were included. Dermatoscopically, superficial BCCs (n=44) were primarily typified by the presence of fine telangiectasia, multiple erosions, leaf-like structures, and revealed cords connected to the epidermis and epidermal streaming upon RCM. Nodular BCCs (n=22) featured the classic dermatoscopic features and well outlined large basaloid islands upon RCM. Infiltrative BCCs (n=22) featured structureless, shiny red areas, fine telangiectasia, and arborizing vessels on dermatoscopy and dark silhouettes upon RCM.


LIMITATIONS
The retrospective design.


CONCLUSION
Dermatoscopy and confocal microscopy can reliably classify different BCC subtypes.
Fitted Natural Actor-Critic: A New Algorithm for Continuous State-Action MDPs

In this paper we address reinforcement learning problems with continuous state-action spaces. We propose a new algorithm, tted natural actor-critic (FNAC), that extends the work in [1] to allow for general function approximation and data reuse. We combine the natural actor-critic architecture [1] with a variant of tted value iteration using importance sampling. The method thus obtained combines the appealing features of both approaches while overcoming their main weaknesses: the use of a gradient-based actor readily overcomes the di culties found in regression methods with policy optimization in continuous action-spaces; in turn, the use of a regression-based critic allows for e cient use of data and avoids convergence problems that TD-based critics often exhibit. We establish the convergence of our algorithm and illustrate its application in a simple continuous space, continuous action problem.
BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory

Storing a database (rows and indexes) entirely in non-volatile memory (NVM) potentially enables both high performance and fast recovery. To fully exploit parallelism on modern CPUs, modern main-memory databases use latch-free (lock-free) index structures, e.g. Bw-tree or skip lists. To achieve high performance NVMresident indexes also need to be latch-free. This paper describes the design of the BzTree, a latch-free B-tree index designed for NVM. The BzTree uses a persistent multi-word compare-and-swap operation (PMwCAS) as a core building block, enabling an index design that has several important advantages compared with competing index structures such as the Bw-tree. First, the BzTree is latch-free yet simple to implement. Second, the BzTree is fast showing up to 2x higher throughput than the Bw-tree in our experiments. Third, the BzTree does not require any special-purpose recovery code. Recovery is near-instantaneous and only involves rolling back (or forward) any PMwCAS operations that were in-flight during failure. Our end-to-end recovery experiments of BzTree report an average recovery time of 145 μs. Finally, the same BzTree implementation runs seamlessly on both volatile RAM and NVM, which greatly reduces the cost of code maintenance. PVLDB Reference Format: Joy Arulraj, Justin Levandoski, Umar Farooq Minhas,Per-Ake Larson. BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory. PVLDB, 11(4): xxxx-yyyy, 2018. DOI: https://doi.org/10.1145/3164135.3164147
Prediction of Web Users Browsing Behavior : A Review

In Web Usage Mining (WUM), Classification technique is useful in web user prediction, where user’s browsing behavior is predicted. In Web prediction, classification is done first to predict the next Web pages set that a user may visit based on history of previously visited pages. Predicting user’s behavior effectively is important in various applications like recommendation systems, smart phones etc. Currently various prediction systems are available based on Markov model, Association Rule Mining (ARM), classification techniques, etc. In Markov prediction model it cannot predict for a session that was not observed previously in the training set and prediction time is also constant. In ARM, Apriori algorithm requires more time to generate item sets. This paper presents review of various prediction models used to predict web users browsing behavior. Key Words— WUM, classification, Browsing behavior, prediction, ARM, session
BigDataScript: a scripting language for data pipelines

MOTIVATION
The analysis of large biological datasets often requires complex processing pipelines that run for a long time on large computational infrastructures. We designed and implemented a simple script-like programming language with a clean and minimalist syntax to develop and manage pipeline execution and provide robustness to various types of software and hardware failures as well as portability.


RESULTS
We introduce the BigDataScript (BDS) programming language for data processing pipelines, which improves abstraction from hardware resources and assists with robustness. Hardware abstraction allows BDS pipelines to run without modification on a wide range of computer architectures, from a small laptop to multi-core servers, server farms, clusters and clouds. BDS achieves robustness by incorporating the concepts of absolute serialization and lazy processing, thus allowing pipelines to recover from errors. By abstracting pipeline concepts at programming language level, BDS simplifies implementation, execution and management of complex bioinformatics pipelines, resulting in reduced development and debugging cycles as well as cleaner code.


AVAILABILITY AND IMPLEMENTATION
BigDataScript is available under open-source license at http://pcingola.github.io/BigDataScript.
An introduction to ROC analysis

Receiver operating characteristics (ROC) graphs are useful for organizing classifiers and visualizing their performance. ROC graphs are commonly used in medical decision making, and in recent years have been used increasingly in machine learning and data mining research. Although ROC graphs are apparently simple, there are some common misconceptions and pitfalls when using them in practice. The purpose of this article is to serve as an introduction to ROC graphs and as a guide for using them in research. 2005 Elsevier B.V. All rights reserved.
Does the Fragrance of Essential Oils Alleviate the Fatigue Induced by Exercise? A Biochemical Indicator Test in Rats

Objective
To study the effect of the essential oils of Citrus sinensis L., Mentha piperita L., Syzygium aromaticum L., and Rosmarinus officinalis L. on physical exhaustion in rats.


Methods
Forty-eight male Wistar rats were randomly divided into a control group, a fatigue group, an essential oil mixture (EOM) group, and a peppermint essential oil (PEO) group. Loaded swimming to exhaustion was used as the rat fatigue model. Two groups were nebulized with EOM and PEO after swimming, and the others were nebulized with distilled water. After continuous inhalation for 3 days, the swimming time, blood glucose, blood lactic acid (BLA), blood urea nitrogen (BUN), superoxide dismutase (SOD), glutathione peroxidase (GSH-PX), and malondialdehyde (MDA) in blood were determined.


Results
While an increased time to exhaustion and SOD activity were apparent in both the EOM and PEO groups, the BLA and MDA were lower in both groups, in comparison with the fatigue group, and the changes in the EOM group were more dramatic. Additionally, the EOM group also showed marked changes of the rise of blood glucose and the decrease of BUN and GSH-PX.


Conclusion
The results suggested that the inhalation of an essential oil mixture could powerfully relieve exercise-induced fatigue.
A sock puppet detection algorithm on virtual spaces

On virtual spaces, some individuals use multiple usernames or copycat/forge other users (usually called ‘‘sock puppet’’) to communicate with others. Those sock puppets are fake identities through which members of Internet community praise or create the illusion of support for the product or one’s work, pretending to be a different person. A fundamental problem is how to identify these sock puppets. In this paper, we propose a sock puppet detection algorithm which combines authorship-identification techniques and link analysis. Firstly, we propose an interesting social network model in which links between two IDs are built if they have similar attitudes to most topics that both of them participate in; then, the edges are pruned according a hypothesis test, which consider the impact of their writing styles; finally, the link-based community detection for pruned network is performed. Compared to traditional methods, our approach has three advantages: (1) it conforms to the practical meanings of sock puppet community; (2) it can be applied in online situation; (3) it increases the efficiency of link analysis. In the experimental work, we evaluate our method using real datasets and compared our approach with several previous methods; the results have proved above advantages. 2012 Elsevier B.V. All rights reserved.