caprion/mscinli_2_class huggingface dataset:
Domain: Networks
Premise: However, to overcome the high path loss inherent at these high frequencies, mm­wave networks must employ highly directional beamform­ing antennas, which makes link establishment and mainte­nance much more challenging than in traditional omnidi­rectional networks.
Hypothesis: maintaining connectivity under node mobility necessitates frequent re-steering of the transmit and receive antenna beams to re-establish a direc­tional mm-wave link.
Relation: entailment
Domain: Software and its engineering
Premise: These tables show that only 6 root spaces are needed to cover 89% of the Bug2 space, and 7 root spaces can cover 92% of the Change10 space, meaning that both error-prone and change-prone files are highly architecturally connected.
Hypothesis: we observe that the first two DRSpaces are the same for both Bug2 and Change10, and cover up to 76% and 79% of the most error and change prone files respectively.
Relation: entailment
Domain: Hardware
Premise: Thus, unlike earlier comparisons made in tables II, III and IV, we cannot give a performance guarantee for I-ordering + DP-fill over techniques proposed in [20], [21] or [22].
Hypothesis: it is interesting to note from Table V that the proposed I-ordering + DP-fill technique actually outperforms all the these techniques for most of the benchmarks and the percentage improvement increases with increase in circuit size.
Relation: contrasting
Domain: Networks
Premise: Since the frequency of memory access increases due to increases in the number of threads, there is some in­crease in calculation time due to memory bus competition, but compared with a CPU, a GPU is almost unaffected by an increase in the number of terminals.
Hypothesis: when the number of terminals was 1024, it was confirmed that the GPU can calculate at a speed about 4.6 times greater than the CPU.
Relation: entailment
Domain: NeurIPS
Premise: If a voter thinks college V 3 is better than college V 6 , a solid arrowed line from V 3 to V 6 occurs (i.e., superiority).
Hypothesis: when a voter thinks the two colleges (i.e., V 1 and V 3 ) listed are incomparable and difficult to judge, he may click the button "I can't decide", then a dotted line connecting V 1 and V 3 happens (i.e., tie).
Relation: contrasting
Domain: NeurIPS
Premise: Despite the well established nature of these results recent work has revealed some surprising insights that come to challenge the traditional ways of thinking in this area.
Hypothesis: in the case of zero-sum games what is referred to as "convergence" to equilibrium, is the fact that when both agent apply regret-minimizing algorithms, both the time-average of the mixed strategy profiles as well as the utilities of the agents converge approximately to their Nash equilibrium values, where the approximation error can become arbitrarily close to zero by choosing a sufficiently small step-size.
Relation: entailment
Domain: Hardware
Premise: Outgoing coherence request from the local processor is kept at the outgoing request buffer (oRB) until it receives the data response and completes coherence operation.
Hypothesis: the response is confirmed to be valid if there is no preceding write request for the cache line which is not snooped in the SSV from the response(Accordingly, the SSV only needs to provide the snooping status for preceding requests.).
Relation: neutral
Domain: Software and its engineering
Premise: Although our nonoutsourceable puzzle alone does not prevent the collection of statistical evidence, in Section 8.2, we argued that by combining our puzzle with a multi-tier reward system, we effectively make it highly costly or unreliable to accumulate statistical evidence over time. 
Hypothesis: a worker can opt to steal only the “jackpot prize” (which happens only infrequently but offers a large reward), while behaving honestly when it finds a “consolation prize” which is of much smaller amount but paid off at a frequent interval.
Relation: entailment
Domain: Software and its engineering
Premise: More specifically, our reactive tiling tries to deter­mine the ideal tile size (from among a fixed set of tile sizes) under an OS/hardware-given cache allocation and the tile size selected by the application may affect the OS/hardware­based partitioning decision in the next epoch.
Hypothesis: the cache partitioning decision in the next epoch is a function (among other things) the tile size selected by the reactive ap­plication.
Relation: entailment
Domain: Security and privacy
Premise: We therefore need to strengthen the previous composi­tion result for multi-stage key exchange protocols [17] to cover, first, key exchange sessions and stages which are only unilaterally authenticated or completely unauthenticated, and, second, protocols that do not allow for a public session matching, but for one where session partnering at a certain stage i is deducible given all stage-j keys for j < i. Jump­ing ahead, knowledge of earlier stages keys can be taken for granted as such keys can be revealed without impairing the chances of winning in a key-independent setting, which is in any case required for composition.
Hypothesis: as both achieve key independence, the analyzed TLS 1.3 handshake drafts are amenable to our composition result.
Relation: entailment
Domain: Hardware
Premise: Inspired by the recent advances of transfer learning, we propose a transfer learning based DSE framework TrDSE to build a more efficient and effective predictive model for the target program with only a few simulations by borrowing knowledge from previous programs.
Hypothesis: trDSE includes two phases: 1) clustering the programs based on the proposed orthogonal array sampling and the distribution related features, and 2) with the guidance of clustering results, predicting the responses of configurations in design space of the target program by a transfer learning based regression algorithm.
Relation: entailment
Domain: Hardware
Premise: In particular, several memory sub-system parameters can be tweaked, possibly to miti­gate the performance loss from relaxed timing.
Hypothesis: the memory system could potentially be provisioned differently to enable relaxation of the timing; with small degrees of PV, it may be possible to adopt relaxed global timings with appropriate configuration of memory sub-system parameters, such as redundancy, buffering and bank parallelism.
Relation: entailment
Domain: Hardware
Premise: To showcase the reconfiguration aspects of our proposal with respect to the volume of faults, we present our gathered statistics in two different sets of graphs.
Hypothesis: the top graph in Fig. 6 depicts the simulation results assuming SRAM pfails up to 10-4 (low-pfail case), whilst the graph in the bottom shows the corresponding results for pfails ranging from 5×10-4 to 5×10-3 (high-pfail case). 
Relation: entailment
Domain: Hardware
Premise: This shortfall is primarily rooted in the analog IC design problem itself, which is very much more complicated even for small problem sizes: it deals with a large number of specific circuit classes; it requires a customized design approach for each circuit class; and analog circuits are very susceptible to noise and process variations.
Hypothesis: the work and costs involved in producing analog layout is a serious bottleneck in IC design, despite numerous attempts at automating the process.
Relation: entailment
Domain: Software and its engineering
Premise: In formal notations, we use API to denote { CLAPI }, and operations on APIs are naturally set operations (e.g. API1 - API2 is set substraction, which excludes class declarations in API2 from API1 ).
Hypothesis: we use the notation APIs to denote the source API, CLAPI , and APId to denote the target API, CL'API , respectively.
Relation: entailment
Domain: NeurIPS
Premise: We depart from previous work by including the nominative (she), accusative (her), prenominal possessive (her) and predicative possessive (hers) inflections of personal pronouns, and we also include the non-gendered or collective pronoun they.
Hypothesis: for each sentence, we increment a count for female pronoun occurrence if any female pronoun is in the sentence, and then count the number pro-stereotypical and anti-stereotypical associations with occupation words (same for male and non-gendered pronouns).
Relation: entailment
Domain: Networks
Premise: Higher-resolution cameras capture more pix­els on the transmitter screen, and thus they support smaller grids on the transmitter screen and achieve higher throughput.
Hypothesis: the high-end SLR camera supports 720 grids on the 10-in screen enabling 6.6 Kbps throughput, six times higher than that achieved by iPhone 5s in our prototype.
Relation: entailment
Domain: Networks
Premise: This important result reveals that there is a unifying approach that solves the resource allocation problem for graph-constrained systems (or, economies), for different node behaviors.
Hypothesis: we can apply the max-min fair criterion, that has been extensively used for load balancing in centralized communication networks (e.g., see [21] and references therein), to service exchange models with autonomous and selfish nodes.
Relation: entailment
Domain: Software and its engineering
Premise: The rationale was that the testing effort might be a proxy measure of the claimed effects of TDD (improved quality and productivity), due to its central role in this technique [6].
Hypothesis: the authors claim that, since TDD developers are believed to put more effort in unit testing when com­pared to test-last developers, the effects on external quality and productivity are likely to become evindent when an high level of testing effort is observed.
Relation: entailment
Domain: NeurIPS
Premise: Here we perform an ablation study in which we remove the evolution of the model parameters, and instead we fix them to stale values in time (which is the configuration used in [8,9]), and test with a case where the model parameters are indeed evolved in time, which corresponds to results of Table 2.
Hypothesis: we use two time steps for activation ODE (Eq. . 5b) and ten time steps for the evolution of the model parameters (Eq. 5c).
Relation: entailment
Domain: NeurIPS
Premise: The primary contribution of this paper is a new framework, termed Probabilistic Embeddings for Meta-Inverse Reinforcement Learning (PEMIRL), which enables meta-learning of rewards from unstructured multi-task demonstrations.
Hypothesis: pEMIRL combines and integrates ideas from context-based meta-learning [5,26], deep latent variable generative models [17], and maximum entropy inverse RL [42,41], into a unified graphical model (see Figure 4 in Appendix D) that bridges the gap between few-shot reward inference and learning from unstructured, heterogeneous demonstrations.
Relation: entailment
Domain: Networks
Premise: We thus argue that this INTERMEDIATE design can serve as the basis for a minimally disruptive design for future cellular core architectures that can address today's cellular core limitations.
Hypothesis: nFV is already a reality for carriers [7, 24, 6, 44], and there are many open-source and commercial efforts to virtualize cellular core functions [13, 19, 18, 5, 2, 3].
Relation: entailment
Domain: NeurIPS
Premise: As suggested in Figure 2(b), one way of guaranteeing a low failure rate in our method is to collect adequate reference models.
Hypothesis: we know from prior works that even adversarial examples crafted using some single-step attacks like the fast gradient (sign) [18] can transfer [28,22], hence one can hypothesize that the gradients of some "substitute" models are more helpful in spanning the search subspaces with reduced dimensionalities.
Relation: neutral
Domain: NeurIPS
Premise: Experience replay [Lin, 1992] refers to storing previously observed transitions to replay later for additional updates to the predictions and policy.
Hypothesis: one of the main results by Kaiser et al. [2019] was to compare SimPLe to Rainbow DQN [Hessel et al., 2018a], which combines the DQN algorithm [Mnih et al., 2013[Mnih et al., , 2015 with double Q-learning [van Hasselt, 2010, dueling network architectures [Wang et al., 2016], prioritised experience replay , noisy networks for exploration [Fortunato et al., 2017], and distributional reinforcement learning [Bellemare et al., 2017].
Relation: neutral
Domain: Hardware
Premise: It is posited that the same architectural standards that facilitate distributed intra-firm development, can be used to support crowdsourcing engagements Building on this thesis, Study 2 will explore the awareness, perceived preparation, usage intentions and usage levels of IT crowdsourcing services by IT services buyers.
Hypothesis: study 2 will examine the following research question: What determines enterprise readiness to use technology crowdsourcing services?
Relation: entailment
Domain: Security and privacy
Premise: In our case authentication is unidirectional, i.e., the device that wants to prove proximity is the one displaying the authentication gesture whereas the device verifying proximity is the one capturing the user gesture and internally comparing it against the expected checksum resulting from the key exchange protocol.
Hypothesis: performing the gesture would require the user to move her position or even climb on to a table, which is obviously neither feasible to assume nor desirable.
Relation: neutral
Domain: Hardware
Premise: In contrast, SOCO's compression is dedicated to reducing power consumption in NVMs rather than the traditional goal of saving memory space.
Hypothesis: sOCO leverages a cache-block-level delta-based compression scheme similar to the one used in prior work [14] but utilizes an essentially unmodified page management mechanism to enhance compression effectiveness and reduce over­heads compared with the leading capacity oriented scheme [13].
Relation: entailment
Domain: NeurIPS
Premise: A recent line of work [15,5,26,4] has developed variants of differential privacy which permit tighter analyses of privacy loss over multiple releases of statistics as compared to both pure and approximate differential privacy.
Hypothesis: the notion of concentrated differential privacy (CDP) [15,5] has a simple and tight composition theorem for analyzing how privacy degrades over many releases while accommodating most of the key algorithms in the differential privacy literature, including addition of Gaussian noise calibrated to global sensitivity.
Relation: entailment
Domain: Hardware
Premise: Adopting a high-bandwidth alternative to DDR3-based main memory based on 3D-stacked DRAM, called Hybrid Memory Cube (HMC) [22], helps this situation to some extent, however, the speedups provided by using HMCs are far below the expected speedup from quadrupling the number of cores.
Hypothesis: if we assume that cores can use the internal memory bandwidth of HMCs2 ideally, i.e., without traversing the off-chip links, we can provide much higher performance by taking advantage of the larger number of cores.
Relation: contrasting
Domain: NeurIPS
Premise: The governing equation here is dz/dt = c(t) dz/dx, where c(t) is variable velocity, and z is the signal that changes in time.
Hypothesis: as discussed above, an alternative view of a residual network is the following continuous-time formulation: dz dt = f (z(t); âœ“), with z(t = 0) = z 0 and z(t = 1) = z 1 (we will use both z(t) and z t to denote activation at time t).
Relation: neutral
Domain: Software and its engineering
Premise: In the first step, we remove markup from the HTML files and preprocess the resulting text files to account for the unique characteristics of software documentation not found in other texts, such as the systematic use of incomplete sentences and the presence of code terms.
Hypothesis: we prefix sentences that start with a verb in present tense, third person singular, such as returns or computes , with the word this to ensure correct parsing of partial sentences, such as Returns the next page number .
Relation: entailment
Domain: Networks
Premise: We thus propose a sample-select approach to heuristically tackle the QMRP in an online manner.
Hypothesis: given the NP-hardness of the optimal path calculations, we employ a sample-select pro­cess, where in the first stage, a set of feasible paths is sampled (i.e., generated) in polynomial time, and subsequently one of them is selected for the actual embedding.
Relation: entailment
Domain: Hardware
Premise: Such a structure effectively reduces the transistor numbers of a single TCAM cell to 3.
Hypothesis: all these MTJ-based TCAM designs face a severe design challenge the small difference of MTJ s high and low resistance values (usually only a few KO) produces a very limited sensing margin, which significantly degrades the reliability of TCAM design, prolongs the searching latency and induces extra power overhead.
Relation: contrasting
Domain: Networks
Premise: Path-end validation does not protect against the "2-hop attack", in which AS 2 pretends to be directly connected to a (legacy) neighbor of AS 1 (say, announces the bogus route 2 - 40 - 1).
Hypothesis: such attacks turn out to be quite ineffective, since the path that the attacker can announce to the victim's prefix, must consist of at least two hops, and BGP paths are typically short (about 4-hops-long on average [24]), i.e., most ASes will not fall victim to the attack.
Relation: contrasting
Domain: NeurIPS
Premise: The real-time implementation of the closed-loop system can be tackled by considering a sample-and-hold implementation of (1) of the form with p(0) = p, where p is a sampled version of the state p. The most common approach consists of periodically sampling the state, selecting a stepsize small enough to ensure that the function V remains monotonically decreasing for the resulting system.
Hypothesis: the result in Theorem 3.3 links the convergence rate of the discrete-time algorithm to the Lyapunov decay and the stepsize of the state-triggered implementation of the continuous-time dynamics.
Relation: neutral
Domain: NeurIPS
Premise: Pose symmetric 1D convolution layers can be based on fully connected layers.
Hypothesis: a 1D convolution is a fully connected layer with shared parameters across the time dimension, i.e., at each time step the computation is the sum of fully connected layers over a window: we enforce equivariance at each time step by employing the symmetry pattern of fully connected layers at each time slice.
Relation: reasoning
Domain: NeurIPS
Premise: [33] handle constraints that are sums-of-ratios, but do so by solving a large number of linearly constrained sub-problems, with the number of sub-problems growing exponentially with the number of rates.
Hypothesis: each player can do Best Response (BR), Online Gradient Descent (OGD) or Follow-The-Leader (FTL), and the game is zero-sum (ZS) or not.
Relation: neutral
Domain: NeurIPS
Premise: We study the problem of distribution-independent PAC learning of halfspaces in the presence of Massart noise.
Hypothesis: we are given a set of labeled examples (x, y) drawn from a distribution D on R d+1 such that the marginal distribution on the unlabeled points x is arbitrary and the labels y are generated by an unknown halfspace corrupted with Massart noise at noise rate Î· < 1/2.
Relation: entailment
Domain: NeurIPS
Premise: Many approximate methods have been introduced to improve scalability, relying on mixture-of-experts models [7], inducing points [12,37,39,42], random feature expansions [20,30,47], or stochastic variational optimization [2,16,17,36,46].
Hypothesis: due to the historical intractability of training exact GPs on large datasets, it has been an open question how approximate methods compare to an exact approach when much more data is available.
Relation: contrasting
Domain: NeurIPS
Premise: Our model performs favorably against the self-supervised state-of-the-art methods.
Hypothesis: our model outperforms Wang et al. [52] by 13.3% in J and 16.6% in F. and is even 6.9% better in J and 4.1% better in F than the ResNet-18 model [13] trained on ImageNet [9] with classification labels.
Relation: entailment
Domain: Software and its engineering
Premise: However, a pure analysis of the process model description is not sufficient, but a more liberal interpretation is required.
Hypothesis: a static (idealized) description of a process is not sufficient as the obtained quality factors (and their practical value) highly depend on the person deriving it, especially regarding the expertise in the field and, since definitions are vague, experiences how the activities are carried out in practice.
Relation: entailment
Domain: NeurIPS
Premise: Various versions of this fundamental problem have been studied before (see e.g., Drineas et al., 2006Drineas et al., , 2011Dhillon et al., 2013;Ma et al., 2015;Raskutti and Mahoney, 2016;Thanei et al., 2017, and the references therein).
Hypothesis: in a generative model where the data are sampled from a linear regression model, Raskutti and Mahoney (2016) have recently compared the statistical performance of various sketching algorithms, such as Gaussian projections and subsampled randomized Hadamard transforms (SRHT) (introduced earlier in Sarlos (2006); Ailon and Chazelle (2006)).
Relation: entailment
Domain: NeurIPS
Premise: We define then smoothness of functions on combinatorial structures to be the smoothness of graph signals using the Graph Fourier Transform (GFT) [35].
Hypothesis: we propose as our GP kernel on the graph a variant of the diffusion kernel, the automatic relevance determination(ARD) diffusion kernel, for which computing the GFT is computationally tractable via a decomposition of the eigensystem.
Relation: entailment
Domain: Hardware
Premise: In order to minimize the frequency on allocating containers from the proposed bucket list and to ultimately extend the time on repacking chunks of containers, we adopt the worst-fit policy that tries to allocate containers with the largest free space and prefers to allocate the free space without any internal fragments.
Hypothesis: the proposed strategy will scan the com­pact list from bucket N to bucket 0, and return the first container from the bucket that is not empty.
Relation: entailment
Domain: Hardware
Premise: In this paper, we present a novel performance simulation tool with the added flexibility adequate for use in architectural optimization as the parameters of the component devices change.
Hypothesis: this simulator is designed to handle reconfigurable quantum hardware, where device parameter (DP) values can be adjusted  handle reconfigurable quantum architecture, where re­source investment scenarios can be studied  output concrete breakdown of performance metrics (e.g. total execution time and failure probability) and contents of resource overhead (such as qubits used as ancilla or for communication purposes).
Relation: entailment
Domain: NeurIPS
Premise: The Lipschitz constant (or spectral norm) of a convolution operator is bounded by a constant factor of the spectral norm of its reshaped matrix [12,48,40], which enables bounding of the convolution operator's Lipschitz constant by bounding that of the reshaped matrix.
Hypothesis: this upper-bound can be conservative, causing a bias towards convolution operators with low Lipschitz constants, limiting the method's expressive power.
Relation: contrasting
Domain: Security and privacy
Premise: In this paper, we make the first step of exploring such threat space, and we show it is feasible to infer user’s highly sensitive information, e.g., PINs and typed texts, through data collected from the built-in sensors, including accelerometer and microphone. 
Hypothesis: we propose a set of new techniques to model user’s hand movement and reduce the interference from noises, and our attack is able to achieve high accuracy in keystroke inference. 
Relation: entailment
Domain: Networks
Premise: For example, the grayscale value of 100 might normally be considered black and representing 0 in QR Codes, but for ImplicitCode, it could be 1 if the carrier video block is even darker. 
Hypothesis: we also need to determine the threshold between the colors representing 1 or 0 relative to the carrier video, even though we cannot assume any a priori knowledge of the carrier video. 
Relation: entailment