snu-aidas/HVMap-dataset huggingface dataset:
Relation Extraction Using Multi-Encoder LSTM Network on a Distant Supervised Dataset

Relation extraction techniques are used to find potential relational facts in textual content. Relation Extraction systems require huge amount of training data to model semantics of sentences and identify relations. Distant supervision, often used to construct training data for relation extraction, produces noisy alignments that can hurt the performance of relation extraction systems. To this end, we propose a simple, yet effective, technique to automatically compute confidence levels of alignments. We compute the confidence values of automatically labeled content using co-occurrence statistics of relations and dependency patterns of aligned sentences. Thereafter, we propose a novel multi-encoder bidirectional Long Short Term Memory (LSTM) model to identify relations in a given sentence. We use different features (words, part-of-speech (POS) tags and dependency paths) in each encoder and concatenate the hidden states of all the encoders to predict the relations. Our experiments show that a multi-encoder network can handle different features together to predict relations more accurately (~9% improvement over a single encoder model). We also conduct visualization experiments to show that our model learns intermediate representations effectively to identify relations in sentences.
OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-Computation Attacks

Password-Authenticated Key Exchange (PAKE) protocols allow two parties that only share a password to establish a shared key in a way that is immune to offline attacks. Asymmetric PAKE (aPAKE) strengthens this notion for the more common client-server setting where the server stores a mapping of the password and security is required even upon server compromise, that is, the only allowed attack in this case is an (inevitable) offline exhaustive dictionary attack against individual user passwords. Unfortunately, current aPAKE protocols (that dispense with the use of servers’ public keys) allow for pre-computation attacks that lead to the instantaneous compromise of user passwords upon server compromise, thus forgoing much of the intended aPAKE security. Indeed, these protocols use – in essential ways – deterministic password mappings or use random “salt” transmitted in the clear from servers to users, and thus are vulnerable to pre-computation attacks. We initiate the study of Strong aPAKE protocols that are secure as aPAKE’s but are also secure against pre-computation attacks. We formalize this notion in the Universally Composable (UC) settings and present two modular constructions using an Oblivious PRF as a main tool. The first builds a Strong aPAKE from any aPAKE (which in turn can be constructed from any PAKE [23]) while the second builds a Strong aPAKE from any authenticated key-exchange protocol secure against reverse impersonation (a.k.a. KCI). Using the latter transformation, we show a practical instantiation of a UC-secure Strong aPAKE in the Random Oracle model. The protocol (“OPAQUE”) consists of 2 messages (3 with mutual authentication), requires 3 and 4 exponentiations for server and client, respectively (2 to 4 of which can be fixed-base depending on optimizations), provides forward secrecy, is PKI-free, supports user-side hash iterations, has a built-in facility for password-based storage and retrieval of secrets and credentials, and accommodates a user-transparent server-side threshold implementation.
The most effective exercise for strengthening the supraspinatus muscle: evaluation by magnetic resonance imaging.

BACKGROUND
Electromyography has been used to determine the best exercise for strengthening the supraspinatus muscle, but conflicting results have been reported. Magnetic resonance imaging T2 relaxation time appears to be more accurate in determining muscle activation.


PURPOSE
To determine the best exercises for strengthening the supraspinatus muscle.


STUDY DESIGN
Criterion standard.


METHODS
Six male volunteers performed three exercises: the empty can, the full can, and horizontal abduction. Immediately before and after each exercise, magnetic resonance imaging examinations were performed and changes in relaxation time for the subscapularis, supraspinatus, infraspinatus, teres minor, and deltoid muscles were recorded.


RESULTS
The supraspinatus muscle had the greatest change among the studied muscles in relaxation time for the empty can (10.5 ms) and full can (10.5 ms) exercises. After the horizontal abduction exercise the change in relaxation time for the supraspinatus muscle (3.6 ms) was significantly smaller than that for the posterior deltoid muscle (11.5 ms) and not significantly different from that of the other muscles studied.


CONCLUSION
The empty can and full can exercises were most effective in activating the supraspinatus muscle.
A* Parsing: Fast Exact Viterbi Parse Selection

A PCFGparsingcandramaticallyreducethetime requiredto find theexactViterbi parseby conservatively estimatingoutsideViterbi probabilities.Wediscussvariousestimatesandgive efficientalgorithmsfor computingthem.On Penntreebanksentences, ourmostdetailedestimate reducesthetotalnumberof edgesprocessedto lessthan3%of thatrequiredby exhausti ve parsing,andevenasimplerestimatewhichcanbepre-computedin underaminutestill reduces thework by a factorof 5. ThealgorithmextendstheclassicA graphsearchprocedureto a certainhypergraphassociatedwith parsing.Unlike best-firstandfinite-beammethodsfor achieving thiskind of speed-up, theA parseris guaranteedto returnthemostlikely parse,not justanapproximation.Thealgorithmis alsocorrectfor awide rangeof parsercontrolstrategies andmaintainsaworst-casecubictime bound. A Parsing: FastExact Viterbi ParseSelection
Separable spectro-temporal Gabor filter bank features: Reducing the complexity of robust features for automatic speech recognition.

To test if simultaneous spectral and temporal processing is required to extract robust features for automatic speech recognition (ASR), the robust spectro-temporal two-dimensional-Gabor filter bank (GBFB) front-end from Schädler, Meyer, and Kollmeier [J. Acoust. Soc. Am. 131, 4134-4151 (2012)] was de-composed into a spectral one-dimensional-Gabor filter bank and a temporal one-dimensional-Gabor filter bank. A feature set that is extracted with these separate spectral and temporal modulation filter banks was introduced, the separate Gabor filter bank (SGBFB) features, and evaluated on the CHiME (Computational Hearing in Multisource Environments) keywords-in-noise recognition task. From the perspective of robust ASR, the results showed that spectral and temporal processing can be performed independently and are not required to interact with each other. Using SGBFB features permitted the signal-to-noise ratio (SNR) to be lowered by 1.2 dB while still performing as well as the GBFB-based reference system, which corresponds to a relative improvement of the word error rate by 12.8%. Additionally, the real time factor of the spectro-temporal processing could be reduced by more than an order of magnitude. Compared to human listeners, the SNR needed to be 13 dB higher when using Mel-frequency cepstral coefficient features, 11 dB higher when using GBFB features, and 9 dB higher when using SGBFB features to achieve the same recognition performance.
Rationalizing Sentiment Analysis in Tensorflow

Sentiment analysis using deep learning models is a leading subject of interest in Natural Language Processing that is as powerful as it is opaque. Current state-ofthe-art models can produce accurate predictions, but they provide little insight as to why the model predicted this sentiment. Businesses relying on these models might be less likely to act on insight given the lack of evidence for predictions. These people would be more likely to trust such predictions if a brief explanation of the outcome is provided. Recent work by Lei et al [4]. has set forth a framework for a multi-aspect sentiment analysis concurrently providing text rationalization with each prediction. This framework sets forth a two-part approach, which summarizes a review and predicts a sentiment. In this paper, we explore the performance of this framework, seeking to recreate and improve upon it in TensorFlow.
Feature reduction and selection for EMG signal classification

0957-4174/$ see front matter 2012 Elsevier Ltd. A doi:10.1016/j.eswa.2012.01.102 ⇑ Corresponding author. Tel.: +66 74 55 8831; fax: E-mail address: angkoon.p@hotmail.com (A. Phiny Feature extraction is a significant method to extract the useful information which is hidden in surface electromyography (EMG) signal and to remove the unwanted part and interferences. To be successful in classification of the EMG signal, selection of a feature vector ought to be carefully considered. However, numerous studies of the EMG signal classification have used a feature set that have contained a number of redundant features. In this study, most complete and up-to-date thirty-seven time domain and frequency domain features have been proposed to be studied their properties. The results, which were verified by scatter plot of features, statistical analysis and classifier, indicated that most time domain features are superfluity and redundancy. They can be grouped according to mathematical property and information into four main types: energy and complexity, frequency, prediction model, and time-dependence. On the other hand, all frequency domain features are calculated based on statistical parameters of EMG power spectral density. Its performance in class separability viewpoint is not suitable for EMG recognition system. Recommendation of features to avoid the usage of redundant features for classifier in EMG signal classification applications is also proposed in this study. 2012 Elsevier Ltd. All rights reserved.
Gaps as characters in sequence-based phylogenetic analyses.

In the analysis of sequence-based data matrices, the use of different methods of treating gaps has been demonstrated to influence the resulting phylogenetic hypotheses (e.g., Eernisse and Kluge, 1993; Vogler and DeSalle, 1994; Simons and May den, 1997). Despite this influence, a well-justified, uniformly applied method of treating gaps is lacking in sequence-based phylogenetic studies. Treatment of gaps varies widely from secondarily mapping gaps onto the tree inferred from base characters to treating all gaps as separate characters or character states (Gonzalez, 1996). This diversity of approaches demonstrates the need for a comprehensive discussion of indel (insertion or deletion) coding and a robust method with which to incorporate gap characters into tree searches. We use the term "indel coding" instead of "gap coding" because the term "gap coding" has already been applied to coding quantitative characters (Mickevich and Johnson, 1976; Archie, 1985). Although "indel coding" undesirably refers to processes that are not observed (insertions and deletions) instead of patterns that are observed (gaps), the term is unambiguous and does not co-opt established terminology. The purpose of this paper is to discuss the implications of each of the methods of treating gaps in phylogenetic analyses, to allow workers to make informed choices among them. We suggest that gaps should be coded as characters in phylogenetic analyses, and we propose two indel-coding methods. We discuss four main points: (1) the logical independence of alignment and tree search; (2) why gaps are properly coded as characters; (3) how gaps should be coded as characters; and (4) problems with a priori weighting of gap characters during tree search. LOGICAL INDEPENDENCE
Ezetimibe - a new approach in hypercholesterolemia management.

Suchy et al. [10] discuss the benefits of ezetimibe beyond lipid-lowering as well as its effects on atherosclerosis. Some comments may be of interest. Reducing low density lipoprotein cholesterol (LDL-C) is the main indication for ezetimibe [2, 7, 8]. This drug is useful in patients who cannot achieve LDL-C goals on statins or those who are statin intolerant [2, 4, 7, 8]. Meta-analyses suggested that adding ezetimibe decreases LDL-C levels more than statin monotherapy, after doubling the dose of a statin or selecting a more potent statin [2, 7, 8]. It was also suggested that ezetimibe can increase LDL particle size, especially in patients with high triglyceride levels [3, 11]. Ezetimibe may exert other beneficial actions which may or may not be related to its hypolipidemic capacity (e.g., for non-alcoholic fatty liver disease and renoprotection) [6]. Ezetimibe monotherapy reduced the plasma mass and activity of lipoprotein-associated phospholipase A2 (Lp-PLA2), which is considered risk predictor of cardiovascular (CV) events [9]. Furthermore, ezetimibe may lower the levels of oxidative stress markers [5]. In the end, the most important issue is reducing vascular events. In this context, the Study of Heart and Renal Protection (SHARP) [1] reported that the combination of ezetimibe with simvastatin was associated with reduced risk of CV events compared with placebo after 4.9 years in patients (n = 9,270) who are pre-dialysis or on dialysis. The clinical relevance of these points and those addressed by Suchy et al. [10] requires to be established by future studies.
Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application

In their 1971 paper on the Traveling Salesman Problem and Minimum Spanning Trees, Held and Karp showed that finding an optimally weighted 1-tree is equivalent to solving a linear program for the Traveling Salesman Problem (TSP) with only node-degree constraints and subtour elimination constraints. In this paper we show that the Held-Karp 1-trees have a certain monotonicity property: given a particular instance of the symmetric TSP with triangle inequality, the cost of the minimum weighted 1-tree is monotonic with respect to the set of nodes included. As a consequence, we obtain an alternate proof of a result of Wolsey and show that linear programs with node-degree and subtour elimination constraints must have a cost at least 23OPT , where OPT is the cost of the optimum solution to the TSP instance. The traveling salesman problem is one of the most notorious in the field of combinatorial optimization, and one of the most well-studied [7]. Currently, the most successful approach to finding optimal solutions to large-scale problems is based on formulating the problem as a linear program and finding explicit partial descriptions of this linear polytope [5], [8]. The most natural constraints are derived from an integer linear programming formulation that uses nodedegree constraints and subtour elimination constraints. We focus our attention on symmetric instances of the TSP that obey the triangle inequality. Let V = {1, 2, . . . , n} denote the set of nodes. For any distinct i and j, assign a cost cij such that cij = cji, and for any k distinct from i and j, cij ≤ cik + ckj . Then the Subtour LP on this instance is B = min ∑ 1≤i<j≤n cijxij subject to: ∑ j>i xij + ∑ j<i xji = 2, i = 1, 2, . . . , n, ∑ i∈S,j∈S,i<j xij ≤ |S|− 1, for any proper subsetS ⊂ V, 0 ≤ xij ≤ 1, 1 ≤ i < j ≤ n. (1) ∗This research was supported in part by Air Force Contract AFOSR-86-0078 and by the National Science Foundation under a Presidential Young Investigator Award CCR-8996272 with matching support from IBM, Sun, and UPS.
Rethinking project management : A structured literature review with a critical look at the brave new world

This paper presents the results of a structured review of the rethinking project management (RPM) literature based on the classification and analysis of 74 contributions and in addition takes a critical look at this brave new world. Through the analysis, a total of 6 overarching categories emerged: contextualization, social and political aspects, rethinking practice, complexity and uncertainty, actuality of projects and broader conceptualization. These categories cover a broad range of different contributions with diverse and alternative perspectives on project management. The early RPM literature dates back to the 1980s, while the majority was published in 2006 onwards, and the research stream appears to be still active. A critical look at this brave new world exhibits the overall challenge for RPM to become much more diffused and accepted. © 2014 Elsevier Ltd. APM and IPMA. All rights reserved.
Shaping particle simulations with interaction forces

classroom use is granted without fee provided that copies are not made or distributed for commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author. SIGGRAPH 2014, August 10 – 14, 2014, Vancouver, British Columbia, Canada. 2014 Copyright held by the Owner/Author. ACM 978-1-4503-2960-6/14/08 Shaping Particle Simulations with Interaction Forces
Distributed Packet Inspection By Using PIL-2 Language

Packet Inspection language PIL-2 incorporates directly support for distributed processing into the language.PIL-2 supports generic header filter, payload scanning, packet replication and traffic flow in network. By distributing PIL-2 based on the possibility created for heterogeneous network of processing node, which gives monitoring architecture facilities with high speed packet processing. The result shows that perform complex processing at terra bit speeds. This proposed frame work can be used to execute distinct task as load balancing, traffic monitoring, firewalls and IDS at high bandwidth links. Keywords—PIL-2,Load balancing, IDS, traffic monitoring.
Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract)

A zero-knowledge proof system of knowledge is a protocol between two parties called the prover and the verifier. The prover wants to convince the verifier that he “knows” the proof of a given theorem without revealing any additional information. This is different from a zero-knowledge proof system of membership where the prover convinces the verifier only of the veridicity of the statement. Zero-knowledge proofs of knowledge are very useful tools in the design of secure protocols. Though, the concept of a proof of knowledge is a very subtle one and great care is needed to obtain a satisfying formalization. In this paper, we investigate the concept of a zero-knowledge proof of knowledge in the noninteractive model of [5, 61. Here, the prover and the verifier share a short random string and the only communication allowed is from the prover to the verifier. Although this is a simpler model than the interactive one, still formalizing zeroknowledge proofs of knowledge is a delicate task. The main results of the paper are the following e We present formal definitions for the concept of non-interactive zero-knowledge proofs ‘Dipartimento di Informatica ed Applicazioni, Universiti di Salerno, 84081 Baronissi (SA), Italy. Partially supported by Italian Ministry of Universit.y and Research (M.U.R.S.T.) and by National Council for Research (C.N.R.) under grant 91.02326.CT12. Email: ads@udsab.dia.unisa.it ‘Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138, USA and Dipart,imento di Informatica, Universiti di Salerno. Supported at Harvard by NSF Grant # NSF-CCR-90-07677. Email: persiano@endor.harvard.edu GIUSEPPE PERSIANO+
Effects of hippotherapy and therapeutic horseback riding on postural control or balance in children with cerebral palsy: a meta-analysis.

AIM
This research review and meta-analysis presents an overview of the effects of hippotherapy and therapeutic horseback riding (THR) on postural control or balance in children with cerebral palsy (CP).


METHOD
To synthesize previous research findings, a systematic review and meta-analysis were undertaken. Relevant studies were identified by systematic searches of multiple online databases from the inception of the database through to May 2010. Studies were included if they fulfilled the following criteria: (1) quantitative study design, (2) investigation of the effect of hippotherapy or THR on postural control or balance, and (3) the study group comprised children and adults with CP. The selected articles were rated for methodological quality. The treatment effect was coded as a dichotomous outcome (positive effect or no effect) and quantified by odds ratio (OR). The pooled treatment effect was calculated using a random-effects model. Meta-regression of the effect size was performed against study covariates, including study size, publication date, and methodological quality score.


RESULTS
From 77 identified studies, 10 met the inclusion criteria. Two were excluded because they did not include a comparison group. Therapy was found to be effective in 76 out of 84 children with CP included in the intervention groups. The comparison groups comprised 89 children: 50 non-disabled and 39 with CP. A positive effect was shown in 21 of the children with CP in the comparison group regardless of the activity undertaken (i.e. physiotherapy, occupational therapy, sitting on a barrel or in an artificial saddle). The pooled effect size estimate was positive (OR 25.41, 95% CI 4.35, 148.53), demonstrating a statistically significant effectiveness of hippotherapy or THR in children with CP (p<0.001). Meta-regression of study characteristics revealed no study-specific factors.


INTERPRETATION
The eight studies found that postural control and balance were improved during hippotherapy and THR. Although the generalization of our findings may be restricted by the relatively small sample size, the results clearly demonstrate that riding therapy is indicated to improve postural control and balance in children with CP.