This paper describes iUBC, a neural network based approach that achieves competitive results on the interpretable STS task (iSTS 2016). Actually, it achieves top performance in one of the three datasets. iUBC makes use of a jointly trained classifier and regressor, and both models work on top of a recurrent neural network. Through the paper we provide detailed description of the approach, as we...

The problem of constructing independent spanning trees (ISTs) dates back to as early the late 1980s. Given a network G certain topology, question is whether we can, well how to, construct set ISTs in . have proven be great importance many tasks. past decade has seen particularly remarkable increase literature on ISTs, manifesting significant growth interest. can classified into edge-independent...

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang, Y.-L. Wang, Y.-H. Leu, Optimal independent spanning trees on hypercubes, Journal of Information S...

Sit-to-stand exercise (STS) is a common activity of daily living. The objectives of the present study were: 1) to assess the validity of aerobic fitness measurements based on anaerobic thresholds (ATs), during incremental sit-to-stand exercise (ISTS) with and without arm support compared with an incremental cycle-ergometer (CE) test; and 2) to examine the reproducibility of the AT measured duri...

Previous studies have reported that state mental hospital deinstitutionalization has resulted in the processing of the mentally ill through the criminal justice system. Using pre- and postdeinstitutionalization samples of defendants found incompetent to stand trial (IST) selected from three states, this study examines changes in the mental health and arrest histories of white and nonwhite ISTs....

VRep is a system designed for SemEval 2016 Task 1 Semantic Textual Similarity (STS) and Task 2 Interpretable Semantic Textual Similarity (iSTS). STS quantifies the semantic equivalence between two snippets of text, and iSTS provides a reason why those snippets of text are similar. VRep makes extensive use of WordNet for both STS, where the Vector relatedness measure is used, and for iSTS, where...

A set of k spanning trees rooted at the same vertex r in a graph G are called independent spanning trees (ISTs) if for any vertex x 6= r, the k paths from v to r, one path in each tree, are internally disjoint. The design of ISTs on graphs has applications to fault-tolerant broadcasting and secure message distribution in networks. It was conjectured that for any k-connected graph there exist k ...

Treatment manuals are becoming a requirement for conducting quality psychotherapy research. What the field lacks, however, are reliable, valid, and cost-efficient instruments that can be used to measure a wide variety of prescribed therapeutic techniques. This article describes the development and use of a new instrument, the Interpretive and Supportive Technique Scale (ISTS). It is designed to...

Independent spanning trees (ISTs) provide a number of advantages in data broadcasting. One can cite the use in fault tolerance network protocols for distributed computing and bandwidth. However, the problem of constructing multiple ISTs is considered hard for arbitrary graphs. In this paper we present an efficient algorithm to construct ISTs on hypercubes that requires minimum resources to be p...

In 1989, Zehavi and Itai [46] proposed the following conjecture: a k-connected graph G must possess k independent spanning trees (ISTs for short) with an arbitrary node as the common root. An n-dimensional twisted cube, denoted by TQn, is a variation of hypercubes with connectivity n to achieving some improvements of structure properties. Recently, Yang [42] proposed an algorithm for constructi...