caprion/mscinli_2_class huggingface dataset:
Domain: NeurIPS
Premise: The proof is based on constructing a finite subset of "difficult" functions in H k (X ).
Hypothesis: we choose f as a uniformly sampled function from a finite set {f1, . . . , fM}, where each fj is obtained by shifting a common function g ∈ Hk(Rd) by a different amount such that each of these has a unique maximum, and then cropping to X = [0, 1].
Relation: entailment
Domain: Hardware
Premise: Particularly one type of highly pessimistic margin has already burdened the traditional design flow even long before the recent rise of variability issues: the traditional synchronous design paradigm determines the operating frequency according to the worst critical path that is identified through static timing analysis under assumed worst case conditions.
Hypothesis: this critical path is not always excited, thus leading to processors that perform (much) slower than what they can theoretically achieve.
Relation: contrasting
Domain: Software and its engineering
Premise: In this regards, they are not the same as the CPUs and therefore when we divide work across the nodes, and between the CPU and the accelerator, we need to partition such that the accelerators only require data trans­fers with their hosts.
Hypothesis: the task graph for the problem is such that the tasks assigned to any accel­erator have data-dependencies only with their host CPUs.
Relation: entailment
Domain: Software and its engineering
Premise: However, debugging deployed WSNs is challenging for several reasons - the remote location of deployed sensor nodes, the non-determinism of execution that can make it dicult to replicate a buggy run, and the limited hardware resources available on a node.
Hypothesis: existing solutions to record and replay debugging in WSNs fail to capture the complete code execution, thus negating the possibility of a faithful replay and causing a large class of bugs to go unnoticed.
Relation: entailment
Domain: Security and privacy
Premise: A dual-mode signature scheme consists of the algorithms (SigKGenG, SignG, EncSignG, DecSignG, VfG and also uses an encryption scheme (EncKGenG, EncG, DecG) that has the group G as message space.
Hypothesis: the algorithms working with encrypted messages or signatures also get the $ keys (epk, esk) .EncKGenG(1t ) of the encryption scheme as input.
Relation: entailment
Domain: Software and its engineering
Premise: World of Riders is intended to target casual players of both genders and various age groups who share attitudes of healthy lifestyle and regular exercising.
Hypothesis: given the scope of the present project, it was addressed the audience who generally support the idea that regular exercising has a positive effect on their health, but in reality experience hard times in maintaining their level of motivation and engagement in performing such physical activities on a regular basis.
Relation: entailment
Domain: Hardware
Premise: Vuvuzela aims to provide point-to-point messaging between users in a way that is private in the face of a strong adversary, who can observe and tamper with the entire network and all but one of Vuvuzela's servers.
Hypothesis: finally, to not let noise affect the clarity of the graphs, we configure servers to always add exactly µ noise, rather than sampling the Laplace distribution; this produces the same average results with less variance.
Relation: neutral
Domain: Security and privacy
Premise: Lastly, Equation 16 models the migration budget such that the total number of migrations should not exceed PercentBudget of the total workloads (i.e., total number of VMs that currently have place assignments).
Hypothesis: d was scaled such that the number of epochs, hence the number of migrations, in each experiment is roughly the same for both exper­iments (i.e., D = 4 min for 20 min completion time and D = 1 min for 3 4 min completion time).
Relation: neutral
Domain: Software and its engineering
Premise: As we can see, the times spent on calculating the throughput of an application under ISPS and SPS are similar and much shorter than the time needed for solving the ILP problem to find the application throughput under PS and the time spent on finding the maximum achievable throughput of the application, i.e., the throughput under STS.
Hypothesis: our approach outperforms PS and STS in terms of time required to calculate the throughput of an application.
Relation: reasoning
Domain: Software and its engineering
Premise: The process ABI includes higherlevel abstractions, such as file descriptors, signals, and network sockets, whereas a VM manipulates emulated hardware abstractions, such as a virtual disk, CPU interrupts, and a virtual network card.
Hypothesis: adding VM support to a legacy OS, such as adding KVM to Linux, requires replacing the system call table with a hypercall table, the ability to trap accesses to privileged hardware, and a PC hardware model, generally running as a separate process.
Relation: entailment
Domain: NeurIPS
Premise: Clearly one can see that users jumped out earlier (i.e., the top 10% marked with pink) show larger L 2 -distance, thus are those with large deviation from the population's opinion and can be treated as abnormal users.
Hypothesis: users jumped out later (i.e., the bottom 10% marked with blue) tend to have smaller or even zero L 2 -distance.
Relation: contrasting
Domain: Hardware
Premise: Some high-end commercially available PCIe flash storage systems are believed to have used the synchronous interface such as Huawei ES3000 [2], which is alleged to provide up to 770K (4KB block) read IOPS performance and up to 630K (4KB block) write IOPS performance.
Hypothesis: there are few publications on design and detailed implementation of flash controllers based on source synchronous interface.
Relation: contrasting
Domain: Security and privacy
Premise: It is easy to see that as long as the master CRS is of the perfectly sound type, the proofs that crs0/1 is an encryption of 1 will be perfect and hence the voters cannot stuff invalid ciphertexts in the virtual ballot box.
Hypothesis: as mentioned above, the EA might attempt to use a master CRS of the second type (simulatable) and then collaborate with a voter to violate integrity.
Relation: contrasting
Domain: Networks
Premise: To address the challenge, we design strategies to filter out color intensity change associated with interfering factors, and adapt our strategy to the current scene type.
Hypothesis: for the static scene, we leverage an audio beamforming algorithm [33, 35] to minimize the impact of interfering factors and extract the desired color inten­sity change encoded with data; for the dynamic scene, we identify patterns caused by the encoded change.
Relation: entailment
Domain: Hardware
Premise: In this paper we claim that understanding QoE in mobile devices is paramount for cellular network operators, and present the results obtained from subjective lab tests performed for popular end-user services accessed through smartphones. 
Hypothesis: we consider the following five well-known applications in mobile devices: YouTube dynamic and non-dynamic video streaming, Facebook, Google Maps (Gmaps from now on), Web browsing through Google Chrome, and WhatsApp.
Relation: entailment
Domain: Software and its engineering
Premise: Together with test engineers from our industrial partner, we defined one cost measure, i.e., Time Difference (TD), which represents difference in period between a time budget and execution cost for a solution, and three effectiveness measures: Mean Priority (MPR), Mean Probability (MPO) and Mean Consequence (MC).
Hypothesis: in our context, each test case has four attributes: time, priority, probability, and consequence.
Relation: entailment
Domain: Networks
Premise: One key difference to our approach is that they use routing to locally address content: peers add known content chunks to their FIB and the consumer application performs a longest prefix match on the chunk name, which returns only the face of the local peer.
Hypothesis: our system relies mainly on forwarding: we assume that the FIB contains multiple interfaces per prefix (prefixes can be more coarse-grained than chunk-level) and let the forwarding strategy decide which one to use.
Relation: contrasting
Domain: Software and its engineering
Premise: Again, the MPI implementation could be made aware of TPSL mappings and make threads share buffers the same way as in a multithreaded implementation, however this would clearly require additional modifications.
Hypothesis: with the considerably increased complexity of recent HPC applications, e.g., demand for components such as in-situ analysis, elaborate monitoring and performance tools, etc., the full availability of Linux APIs has gained high importance.
Relation: neutral
Domain: NeurIPS
Premise: We investigated two approaches that could enable this flexibility: factorized representations, which abstract away general aspects of a task from those prone to change, and nonparametric, memory-based approaches, which can provide a principled way of using similarity to past experiences to guide current behaviour.
Hypothesis: we combine the successor representation (SR), that factors the value of actions into expected outcomes and corresponding rewards, with evaluating task similarity through clustering the space of rewards.
Relation: entailment
Domain: Hardware
Premise: We further examined the devices with the largest number of discarded blocks and found that the number of blocks that are discarded is not correlated with the amount of data written to or read from flash cells (examined in Sections 4.1 and 4.2).
Hypothesis: we observe SSDs of both low and high usage across their lifetime (measured by flash cell reads and writes) that have discarded large amounts of blocks and have high failure rates.
Relation: entailment
Domain: NeurIPS
Premise: For most gradient-based NAS methods, an over-parameterized super-network is constructed firstly with all candidates paths included and one superior path is selected on each edge with the other candidates removed.
Hypothesis: signals in network often contain numerous channels during forward propagation, which means that a path is not the minimum separable structure unit in network and path-level search methods [3,24,22] limit the granularity of architecture search.
Relation: contrasting
Domain: Software and its engineering
Premise:  SpotOn generally reevaluates its decision whenever a job’s state changes, e.g., due to a revocation, in order to select a new instance type and market to migrate the job.
Hypothesis: on revocation, SpotOn re-executes the greedy cost-aware policy to determine where to restore the job and the fault-tolerance mechanism to use based on the job’s remaining running time.
Relation: entailment
Domain: Networks
Premise: However, if the DCU owns several sub-networks, then multiple socket connections are established dynamically between the PCU and the DCU, and the PCU transmits the reprogramming data for each ECU to the different sub-networks owned by the DCU.
Hypothesis: when the PCU transmits the reprogramming data of multiple ECUs to sub­networks owned by different DCUs, the PCU transmits the segmented reprogramming data to different DCUs according to each assigned IP number alternatively; these data transfers can then be parallelized in terms of the overall reprogramming.
Relation: reasoning
Domain: Software and its engineering
Premise: Although close-to-open semantics do not require Hare to ensure data consistency in the face of concurrent file operations, Hare must ensure its own data structures are not corrupted when multiple cores manipulate the same file.
Hypothesis: if one core is writing to a file and another core truncates that file, reusing the file’s buffer cache blocks can lead to data corruption in an unrelated file, because the client library on the first core is still writing to these buffer cache blocks.
Relation: entailment
Domain: NeurIPS
Premise: The resulting model trained using LLR degrades gracefully in terms of adversarial accuracy when we increase the strength of attack, as shown in Fig 3 .
Hypothesis: fig 3a shows that, for CIFAR-10, when the attack changes from Untargeted to Multi-Targeted, the LLR's accuracy remains similar with only a 2.18% drop in accuracy.
Relation: entailment
Domain: Networks
Premise: The priorities are considered in regards to both the sites corresponding to each distributed active participant, and also the cameras within each site.
Hypothesis: hosseini et al [4, 3] adopted priority-based approaches towards the study of e.ciently transmitting, rendering, and displaying bulky 3D gaming information to power-limited devices given the importance of di.erent 3D objects in the gaming context.
Relation: neutral
Domain: Hardware
Premise: Most typically, the number of chemical species and reactions are much smaller than the number of possible states and transitions between these states.
Hypothesis: in the stochastic chemical kinetics formalism, both the sparsity of possible transitions between the states, and more importantly, the special structure of these transitions caused by a small set of reactions, are exploited to arrive at a very compact representation for a MC that may be otherwise very unwieldy to deal with.
Relation: entailment
Domain: Networks
Premise: As micro systems and sensor technologies have advanced, with recent wireless technologies, autonomous and flexible wireless sensor networks can now be used to send or receive data between moving nodes whereby each node recognizes and measures its own sensor environment and processes data without access points (APs) or base station communication networks, which are generally used in existing infrastructure network wireless technologies.
Hypothesis: ad-hoc network technology enables direct communication between devices so that they can send or receive signals directly between two close users without passing through APs or base station communication networks, thereby effectively providing mobility between nodes compared to existing centralized network technologies.
Relation: entailment
Domain: Software and its engineering
Premise: A global scheduling mechanism was employed for load balancing, decreasing the contention and improving performance.
Hypothesis: the other is the SW2 node (of Guillimin), consisting of two Dual Intel(R) Sandy Bridge EP E5-2670 2.6 GHz CPUs, 8 cores per processor, 8 GB of memory per core, and a Non-blocking QDR InfiniBand network with 40 Gbps between nodes.
Relation: neutral
Domain: NeurIPS
Premise: The approximate distribution p(x|â„¦ y ) allows us to now apply Bayesian reasoning to include information from y at test-time.
Hypothesis: the (unnormalized) posterior probability of the clean value x given observations of both the noisy pixel y and its context is given by Bayes' rule as follows: From this point of view, the distribution p(x|â„¦ y ) takes the role of the prior, encoding our beliefs on the possible xs before observing y.
Relation: entailment
Domain: Networks
Premise: Note that in previous works [4, 7, 8], to facilitate the analysis of coverage probability and average rate for a user occupying a given channel, it assumed a large enough user density such that the channel will always be occupied in all cells, while neglecting the fact that it actually becomes more difficult for a user to obtain a channel as the user density increases.
Hypothesis:  the users may suffer from “channel outage” due to the limited frequency resources (channels) in a cell. 
Relation: entailment
Domain: Software and its engineering
Premise: This modularization strategy, from both the game-template architecture and the code derivation perspectives, has substantially eased the evolution of the first version of PhyDSLinto PhyDSL-2.
Hypothesis: when we introduced the camera management and on-screen control features into PhyDSL-2, we found that (i) changes were limited to one game-template architecture component, (ii) language changes were progressively made from the impacted intermediate model, to the domain-specific language, thus modifying fewer M2M and M2T transformations, and (iii) developers experienced less severe cognitive challenges while executing maintenance tasks.
Relation: entailment
Domain: Hardware
Premise: What is the last mile of the challenges in the designs would be on how to effectively provide an operating system a PCM storage device with a common storage-device interface, which is usually of fixed management units such as an LBA (or referred to as a sector for hard disks).
Hypothesis: the technical problem falls on how to (1) efficiently manage (i.e., allocated and deallocate) free PCM storage space and (2) map fixed-sized LBAs to variable-sized chunks when CDC is supported, so that the space utilization of PCM-based storage could be ultimately improved.
Relation: entailment
Domain: Networks
Premise: In our scan, 414,374 Top Million domains (52% of domains with valid SMTP servers, and 64% of domains that support START-TLS) present certificates that validate against the Mozilla NSS root store [38], as detailed in Table 5.
Hypothesis: only 0.6% of domains present trusted certificates that match their domain name, while 34.2% present trusted certificates that match their MX server.
Relation: contrasting
Domain: Security and privacy
Premise: Bitansky Garg et al. and Canetti Holmgren et al. con­struct a semi-succinct garbling scheme for RAM programs, assuming non-succinct Indistinguishability Obfuscation (IO) and injective one way functions [BGL+15, CHJV15].
Hypothesis: they construct garbling schemes where the space and run­time of the garbled program are proportional to the space and runtime of the plaintext program, and where the size of the garbled program is proportional to the space complexity of the plaintext program.
Relation: entailment
Domain: Security and privacy
Premise: This is likely because the control mechanism triggers more position perceptions regarding the app, including perceived fairness of the app developer, a better general attitude toward the app, more trust of the app, as well as an enhanced intention to use the app in the future.
Hypothesis: giving users actual control over their own information greatly elevated their self-agency, thereby improving their perceptions of the app, which eventually led to more installation.
Relation: entailment
Domain: Hardware
Premise: However, we need to take into account the non-conflict constraint on a given buslet: for this, we need to ensure that at most one FU per clock cycle will drive the buslet (this will be done via tri-state buffers, enabled at the right clock cycle(s) by the datapath FSM controller) In order to ensure this, a proper scheduling algorithm is needed which minimizes the number of buslets required for such a constraint; a corresponding binding algorithm with other minimization goals and constraints is also needed.
Hypothesis: our algorithms solve a variation of the MR-LCS problem that we call MRW-LCS (minimum resources and wiring, latency constrained scheduling), and is divided into two stages: 1) Scheduling algorithm, which is itself divided into two phases: a) FDCS (Force Directed Communication Scheduling), a modified version of Force-Directed Scheduling [6], minimizes the lower-bound number of buslets implied by scheduling communications between operation nodes (the number of buslets could increase from this lower bound during binding, as we need to satisfy some extra constraints there).
Relation: entailment
Domain: Security and privacy
Premise: To explicitly link rules, we assign each rule a unique identifier to be used in a function-like way as part of the key name pattern, as shown on Figure 5(b).
Hypothesis:  invoking such rules is similar to invoking a function: invocation substitutes the key name pattern with the data name pattern from the invoked rule, specializing it with the supplied pat-terns or references to the indexed sub-patterns.
Relation: entailment
Domain: Software and its engineering
Premise: Of the 24 ratings of LondonTube, 21 exceeded the corresponding average rating of traditional tools; 2 ratings tied the corresponding average rating for traditional tools, and only 1 was lower.
Hypothesis: londonTube ratings exceeding traditional ratings outnumbered LondonTube ratings beneath traditional ratings by a ratio of 21-to-1 (Table 3).
Relation: reasoning
Domain: Hardware
Premise: As reported by US Department of Commerce [1], counterfeit­ing accounts for more than 8% of global merchandise trade, which is in the trillion dollars range.
Hypothesis: counter­feit electronics are increasingly being distributed throughout the market and legitimate electronic companies miss out on about $100 billion of global revenue every year because of counterfeiting, thereby posing a severe threat to the global electronic supply chain [2].
Relation: entailment
Domain: NeurIPS
Premise: The intuition of the approach we propose in this paper is straightforward: instead of learning a dynamics function and attempting to separately verify its stability via a Lyapunov function, we propose to jointly learn a dynamics model and Lyapunov function, where the dynamics is inherently constrained to be stable (everywhere in the state space) according to the Lyapunov function.
Hypothesis: a damped, rigid n-link pendulum’s state x can be described by the angular position θi and angular velocity θi of each link i.
Relation: neutral
Domain: NeurIPS
Premise: While both of the two approaches above, (a) and (b), can be used in a semi-supervised setting, cGANs of (b) provide a more natural framework for using both labeled and unlabeled data; 3 one can use the unlabeled data to learn p(x), and the labeled data to learn both p(x) and p(c|x).
Hypothesis: we focus on evaluating the second type of architectures, e.g., the auxiliary classifier GAN (ACGAN) [39].
Relation: reasoning
Domain: NeurIPS
Premise: At iteration n, each vertex updates its latent vector by element-wise multiplying it with the sum of the latent vectors of its neighbors.
Hypothesis: at the end of iteration n, the latent vector on vertex i is the sum of the embeddings of the walks that end at i and have length n, and the sum of the all latent vectors is the embedding of the n-gram walk set (with proper scaling).
Relation: reasoning
Domain: NeurIPS
Premise: While this approach lets us deal with unbounded losses, naturally the statistical error guarantees are only as good as the confidence intervals available for the empirical mean deviations.
Hypothesis: strong assumptions on all of the moments of the loss are essentially unavoidable using the traditional tools espoused by Bégin et al. [3], which means the “heavy-tailed” regime cannot be handled, where all we assume is that a few higher-order moments are finite (say finite variance and/or finite kurtosis). 
Relation: entailment
Domain: Security and privacy
Premise: Consequently, it is only possible to have a fast and complete addition law when a = -1 is a square in the underlying prime field Fp, which is the case if and only if p ≡ 1 mod 4.
Hypothesis: a MoTE curve can only be generated over a prime field Fp whose order is congruent to 1 modulo 4 [6, 16].
Relation: entailment
Domain: NeurIPS
Premise: In this study, we have demonstrated a surprising level of cross-modal predictive ability across transcriptomic and electrophysiological recordings.
Hypothesis: we showed that the transcriptomic class can be predicted with ∼80% accuracy from electrophysiological recordings when the transcriptomic hierarchy is resolved into 15 classes, and with ∼70% accuracy when it is resolved into 25 classes (λ = 10 results).
Relation: entailment
Domain: Security and privacy
Premise: In the case of email addresses, for example, 21% of domain-keys have all their values matching the rule (i.e., the ratio is 1) and over half (58%) of the domain-keys have at least 20% of their values matching the seed rule.
Hypothesis: the name domain-key shows that the vast majority (over 90%) of domain-keys that have at least one matching value have less than 10% of all their values match.
Relation: contrasting