sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: By individually naming each packet, ICN allows routers to turn their queueing buffers into packet caches, thus exploiting the network s existing storage resources.
Sentence 2: the perfor­mance of packet caching at commodity routers is restricted by the small capacity of their SRAM, which holds the in­dex for the packets stored at the, slower, DRAM.
Relationship: contrasting
Domain: Networks
Sentence 1: In the long term, addressing the problem of increasingly poor quality information obtained through channel sensing will require new approaches to medium access control in wireless networks.
Sentence 2: given the large existing userbase of devices operating on CSMA-based protocols, in particular the 802.11 protocol family, it is worth considering what we can do to mitigate the problem without drastically changing the current protocols, as an interim solution while new protocols are developed and standardised.
Relationship: contrasting
Domain: Networks
Sentence 1: Conversely, at low G, we see very high optimal p values, as there is so little traffic that the probability of collision is very low, and the best strategy is for nodes to simply transmit as soon as they have data available.
Sentence 2: if we wish to replicate this behaviour using the contention window in the 802.11 DCF, both very high and very low values of p will be problematic.
Relationship: contrasting
Domain: Networks
Sentence 1: The reason becomes obvious if we look at the optimal static assignment probabilities at the femto (Figure 4, lower panel), which indicates that for these values of arrival rates, it is always optimal to stay in the femto as macro already has enough users.
Sentence 2: at higher val­ues of the arrival rate, FPI performs much better than the optimal static policy, and even the JSQ-based policies out­perform the optimal static policy by a good margin.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.1 Mobility Anchor Approach Schemes in this class are based on the Mobile IP proto­col [6], which is a proposed standard in the Internet Engi­neering Task Force (IETF) to support host s mobility in IP networks.
Sentence 2: mobile IP uses fixed nodes called Home Agents that keep track of the location of all mobile hosts originally registered in the home network.
Relationship: entailment
Domain: Networks
Sentence 1: With respect to the first strategy, if a rational gateway manages to convince clients of a smaller level of deduplication, the gateway can charge higher prices.
Sentence 2: with respect to the second strategy, the gateway may try to derive information about the contents of the uploaded files3; notice that acquiring information about users data can be economically beneficial for the gateway since the stored data can be misused, e.g.
Relationship: contrasting
Domain: Networks
Sentence 1: Similar to [10], we instantiate GetRandomness by leveraging functionality from Bitcoin, since the latter offers a convenient means (e.g., by means of API) to acquire time-dependent randomness.
Sentence 2: bitcoin peers need to find a nonce, which when hashed with the last block hash and the root of the Merkle tree accumulating recent transactions, the overall hash is smaller than a 256-bit threshold.
Relationship: neutral
Domain: Networks
Sentence 1: While this momentum is encouraging, a closer look un­der the hood reveals a less rosy picture: NFV products and prototypes tend to be merely virtualized software implemen­tations of products that were previously offered as dedicated hardware appliances.
Sentence 2: this native API provides support for: zero-copy packet transfer over vports for high throughput communication between E2D and NFs, and rich message ab­stractions which allow NFs to go beyond traditional packetbased communication.
Relationship: neutral
Domain: Networks
Sentence 1: To verify that our results are not biased due to Internet-wide scans performed by other organizations or research projects, we monitored incoming DNS requests to our network and identified a small set of hosts that performed DNS scanning activities.
Sentence 2: we observe a single daily DNS request initiated by the Shadowserver Foundation and single DNS requests from Team Cymru and the Open Resolver Project within our monitoring period of 10 days.
Relationship: entailment
Domain: Networks
Sentence 1: By comparing cases that have the same propensity scores i.e., an equally likely probability of being treated based on the observed confounding practices we can be confident that the actual presence or absence of treatment is not determined by the confounding practices.
Sentence 2: a treated case and an untreated case with the same propensity score have the same probability of having a given value for a confounding practice (e.g., number of roles); thus propensity score matching mimics a randomized experiment.
Relationship: entailment
Domain: Networks
Sentence 1: The emerg­ing user interface paradigm for many such things eschews physical buttons, knobs, and displays in favor of virtual interfaces that are downloaded from the web and rendered on remote platforms like smartphones.
Sentence 2: such smartphone app-based interfaces often require tedious discovery and installation, as well as device dis­covery, pairing, and configuration before a user can interact with a nearby device.
Relationship: contrasting
Domain: Networks
Sentence 1: Presto argues that the main culprit of inef.ciencies in schemes like ECMP is the coarse granularity: each flow, even a large one, hashes all its packets onto one path.
Sentence 2: presto par­titions flows into equal size chunks of 64KB, called flow­cells, and sprays them in a round-robin fashion among available paths.
Relationship: reasoning
Domain: Networks
Sentence 1: As described in Sect. 3.3, geometric characteristic of eNBs is a major positioning impairment which can affect the performance of trilateration based positioning; however, the conventional methods do not utilize the characteristics of hyperbola equations, when they perform weighted averaging in multiple OTDOA based method.
Sentence 2: in this paper, we propose a novel weighting method which can reduce the weighting value of several OTDOA from unsuitable deployment of eNB in terms of geometric characteristic.
Relationship: reasoning
Domain: Networks
Sentence 1: We implement all algorithmic aspects of MOCA in software and couple it with the FPGA software-defined-radio WARP combined with a 60 GHz frontend.
Sentence 2: we implement a 60 GHz programmable node and testbed using VubIQ [19] transmitter and receiver waveguide system, operating in 57-64 GHz unlicensed frequency band with 1.8 GHz bandwidth (compliant with 802.11ad).
Relationship: entailment
Domain: Networks
Sentence 1: A successful transmission results in a bit rate of r(B) for time tslot, whereas breakage leads to training penalty tBF T .
Sentence 2: in MIMO systems below 6 GHz, mul­tiple streams and diversity are achieved exploiting the rich scat­tering propagation that is not present in the 60 GHz environment nor with switched narrow-beam antenna arrays.
Relationship: neutral
Domain: Networks
Sentence 1: In contrast to IEEE 802.11n/ac techniques to support multiple spatial streams with multiple RF chains [2], 802.11ad requires only a single RF chain for the antenna array.
Sentence 2: 802.11ad realizes Tx and Rx beamforming via analog phase shifters that are configured according to a predefined codebook of beamforming co­efficients, with each codebook entry referred to as a sector.
Relationship: entailment
Domain: Networks
Sentence 1: To elimi­nate the errors in phase measurements, however, those exist­ing systems either require high-cost dedicated hardware or labor-intensive offline training effort, which rendering them impractical.
Sentence 2: they either use a dedicated hard­ware which is well designed without hardware diversity [2], or they use a learning based approach which regards the hardware phase errors as a constant that adds into the true phase measurement [4].
Relationship: entailment
Domain: Hardware
Sentence 1: Typically the delay of the clock path is difficult to reduce from the initial routing result since clocks are nor­mally hardwired with global routing resources; hence, our strategy is to add delay to the data path.
Sentence 2: to cor­rect the hold timing violation in our example, we must add 0.3 ns of delay across the two connections spanning between data in and register A.
Relationship: reasoning
Domain: Hardware
Sentence 1: We propose to insert a safety margin in each edge, or skew constraint, equal to the maximum margin of the edge (as defined in Section 2.1), with an upper limit of Muser.
Sentence 2: only edges on the cycle with an average margin of M will have a safety margin of M. All other edges have safety margins strictly greater than M. All skew constraints corresponding to non-tight edges have a safety margin of Muser and do not require further consideration.
Relationship: entailment
Domain: Hardware
Sentence 1: Similar as in FastPlace 3.0, we adapt the BestChoice clustering algorithm from [3], which iteratively clusters cells according to their netlist connectivity and size.
Sentence 2: we compare our­selves to NTUPlace4 [13], the best participant of the con­test, and to the tool of Cong et al.  [10] which achieved the best results on these benchmarks so far.
Relationship: neutral
Domain: Hardware
Sentence 1: This suggests that the QueueVadis client is pretty effective in estimating the real queuing delay experienced by a user.
Sentence 2: given that the total wait time at the F&B venue was approx. 4 minutes (240 secs) and 10 minutes at Theaters, a 10% estimation error would translate to errors of less than minute at F&B and 2 minutes at Theater. 
Relationship: entailment
Domain: Hardware
Sentence 1: Intuitively, the number of packets to be analyzed and forwarded in parallel should be limited by the number of cores that perform the analysis; for regular GPUs, one can have as many as hundreds such cores.
Sentence 2: in practice, the number of parallel decisions is limited by the available memory bandwidth of the system: if every unit accesses memory in a short enough time interval, the memory bandwidth is quickly saturated, and the amount of concurrency in the sys­tem decreases.
Relationship: contrasting
Domain: Hardware
Sentence 1: While stages 2 and 3 of our reference ConvNet can be perfectly split into 8—8 blocks and thus no performance is lost, Stage 1 has only 3 input channels and can load the core only with ..............=3/8.
Sentence 2: stages with a small number of input or output channels also perform much less operations and efficiency in these cases is thus not that important.
Relationship: contrasting
Domain: Hardware
Sentence 1: The implementation of [18] suffers from the same issues, their superior energy efficiency in the processing core is gained with FDSOI technology which could also be applied to our architecture.
Sentence 2: the effective throughput thus depends on the size of the image: ..............=(h....-h..+1)(......-....+1)h........... Table 2: Throughput and efficiency for the individual stages of our reference ConvNet.
Relationship: neutral
Domain: Hardware
Sentence 1: Because our proposal is a best-effort scheme, the preceding instructions may pre-maturely exit the issue queue and miss the opportunity to be replayed, resulting in loss of coverage.
Sentence 2: a full rollback squashes all previous instructions in the pipeline so that the first instruction that was corrupted by a fault, as well as all later instructions to which the fault has propagated, are likely squashed.
Relationship: neutral
Domain: Hardware
Sentence 1: This is because, by the time a long-latency load event has been seen, it is already too late to try and prefetch its result.
Sentence 2: prior works have focused on executing forward slices after a miss event [4, 8, 15, 18, 26], as it is relatively easy to propagate poison bits to squash future instructions or store them for later processing.
Relationship: reasoning
Domain: Hardware
Sentence 1: We now demonstrate how the single-core processor of Sec. 4.1 may be converted into a dual-core processor with secure shared state. 
Sentence 2: we will extend the design of Sec. 4.1 essentially by instantiating two copies of the processor core, and wrapping them with a secure harness whose design is akin to a softwarebased monadic separation kernel [15].
Relationship: entailment
Domain: Hardware
Sentence 1: Woo and J. Kim, Diversifying wear index for MLC NAND .ash memory to extend the lifetime of SSDs, in Proceedings of the 11th ACM International Conference on Embedded Software (EMSOFT 13), 2013.
Sentence 2: this result implies that the proposed subpage pro­gramming can significantly improve the lifetime of flash memory in handling small writes.
Relationship: neutral
Domain: Hardware
Sentence 1: Parameters and variables From the [O] model, we recall that a tile represents the minimal area unit considered within the FPGA grid and we denote by tileW and tileH its width and height respectively.
Sentence 2: following one of the few approaches existing in literature, we use a Node-Arc model (better described in Section II) similar to the one used in [17] where each node is a Reconfigurable Region (RR), thus allowing high level analysis.
Relationship: neutral
Domain: Hardware
Sentence 1: However, the interconnect parasitic capacitances that are major contributors to performance degradation and on-die signal integrity problems, must be accurately accounted for.
Sentence 2: an empirical-based parasitic extraction is performed on an early-stage layout obtained from the floorplan, computing the optimal electromigration-aware wiring topology and shortest rectilinear paths in-loop, without the need for detailed routing.
Relationship: reasoning
Domain: Hardware
Sentence 1: In a configuration Gs, we are given a graph G = (V , E ), a state space S, and a state assignment function s : V → S. The state of a node v, denoted s(v), includes all local input to v
Sentence 2: in a configuration Gs, we are given a graph G = (V , E ), a state space S, and a state assignment function s : V → S. The state of a node v, denoted s(v), includes all local input to v
Relationship: entailment
Domain: Hardware
Sentence 1: However, we show that several pragmatic counter-measures may make the eavesdropping significantly hard and thwart adversaries.
Sentence 2: we analyt­ically provide a guideline of safety distance for a reflective victim and propose PHY-layer power randomization mechanisms for an emissive victim, which can reduce the eavesdropper's recovered audio quality by orders of magnitude.
Relationship: entailment
Domain: Hardware
Sentence 1: In addition to the improved QoS for endusers, CDN hosting makes a content publisher's service more scalable and reliable, saves the publisher money by reducing the load on their network backbone, and boosts pagerank­ing on search engines [11].
Sentence 2: an increasing number of content publishers, ranging from small personal webpages and blogs [10] to large-scale social networking websites, are hosting their content on CDN systems.
Relationship: reasoning
Domain: Hardware
Sentence 1: Thanks to the business competition between numerous commercial CDN providers, offering low-cost or even free [13] CDN service, CDN hosting has become affordable even to host personal websites [10] and blogs [12].
Sentence 2: some providers offer free CDN hosting services [13], including CloudFlare, Incapsula, CoralCDN, and SwarmCDN.
Relationship: entailment
Domain: Hardware
Sentence 1: With the large 16MB LLC, it takes a consid­erable amount of time for applications to load their work­ing sets in the cache, thus the performance improvement increases from 15ms to 30ms timeslice length due to the in­creased amount of time to amortize LLC cold start cache misses.
Sentence 2: beyond 30-45ms timeslices, there is only marginal performance improvement since the applications working set data is then loaded in the LLC and the cold start penalty amortized.
Relationship: contrasting
Domain: Hardware
Sentence 1: To achieve high compression rates HEVC tries to match the block structure according to the object shape through a recursive partitioning process which exponentially increases the motion search complexity as it has to be performed for every block partitioning.
Sentence 2: 3) An Approximation-Aware Cache Management Unit (Section 4.3) that classifies a cache set as reliable (i.e. this set needs to be stored with reliability) or ‘unreliable’ (i.e. this set does no necessarily require reliability and can tolerate approximation errors). 
Relationship: neutral
Domain: Hardware
Sentence 1: While it makes sense to run each chip's portion of the NoC at the same clock speed (otherwise the slowest portion will likely become a bottle­neck), from a physical-design perspective it is easier to clock chips independently.
Sentence 2: each chip's NoC por­tion operates in its own local timing domain, thereby requiring domain-crossing synchronizing FIFOs when going from CPU chip to interposer, and vice versa.
Relationship: reasoning
Domain: Hardware
Sentence 1: Prior approaches that attempt to overcome the computational bottleneck of error estimation can be classified into two categories: 1) Methods that estimate the range of error: These methods capture the range of the error in approximate computation in terms of its minimum and maximum value, and are primarily based on interval and af.ne arithmetic [11], with modi.cations [3], [10], [12] suitable for asymmetric distributions of errors in approximate circuits.
Sentence 2: these approaches are computationally intensive, may lead to storage explosion [10], and often overestimate errors [13].
Relationship: contrasting
Domain: Hardware
Sentence 1:  To address the limitations of HPC systems, GEMS employs a runtime that provides: a global address space across the cluster, so that data do not need to be partitioned, lightweight software multithreading, to tolerate data access latencies, and message aggregation, to improve network utilization with fine-grained transactions.
Sentence 2: designing accelerators by employing Hardware Description Languages (HDL) is hard and time-consuming.
Relationship: neutral
Domain: Hardware
Sentence 1: The key idea of CL-BMF is to pass the knowledge from the low-complexity model to the high-complexity model (i.e. co-learning) to reduce its training cost.
Sentence 2: once the low-complexity model is accurately built based on a small number of training samples, the high-complexity model can be trained by borrowing the information from the lowcomplexity model, instead of relying on the expensive training data only.
Relationship: entailment
Domain: Security and privacy
Sentence 1: EC simple Power Attacks (SPA) that aim at power signal observation during PM computations so as to discriminate point operations, can be thwarted by employing PM algorithm variants (e.g. Montgomery Power Ladder (MPL) or double and always add algorithm [14]).
Sentence 2: those variants are still vulnerable to refined PA and zero PA [12] or comparative SPAs (doubling and relatively doubling attacks [10] [19]) as well as differential power analysis attacks (DPA) [16] that can only be thwarted through PM randomization [8].
Relationship: contrasting
Domain: Security and privacy
Sentence 1: Because risk is a multi-dimensional concept [15, 16], multi-dimensional risk information also needs to be dis­played for users that want a more detailed view of the risks posed by an app.
Sentence 2: the main focus of the present work was (1) to identify the most meaningful dimensions of risk and understand users perceptions of those risks, and (2) to better understand other sources of risk information (in addition to permissions) and how such information is used by experts and average Android users to assess apps.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Although this seems to indicate that the risk types identified by the expert users and used in this study are appropriately comprehensive, there may be better names or descriptions that could be used to convey the scope of the risk types.
Sentence 2: a third of the re­sponses described things that we consider to fall under the device instability risk type, which may indicate the need for a better descriptor for that risk type.
Relationship: entailment
Domain: Security and privacy
Sentence 1: We coded each of the user-supplied group labels into one of 16 different summary labels based on the risk concept that it seemed to describe.
Sentence 2: par­ticipants were given the following instructions: (1) sort the permissions into groups based on the type of risk that you feel is associated with each permission (a single permission may be assigned to more than one group); and (2) give each group of permissions a name describing the risk type.
Relationship: neutral
Domain: Security and privacy
Sentence 1: For example, if the phisher is attempting to emulate PayPal, there are so many previous attempts made to phish PayPal that anything that is extremely close to PayPal social website URL is either already a registered domain, or is blacklisted.
Sentence 2: in order for a phisher to emulate a Paypal URL, they have to start introducing misspellings, such as www.paypal.com, or they must construct another domain name to look like PayPal, such as www.paypal.com.anotherurl.com.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Ideally, there should be a clear separation between the passwords used for low-security websites and high-security websites [7].
Sentence 2: cuedR can be used as a standard authentication mechanism for online accounts with high security requirements and where logins occur rel­atively infrequently, such as financial (e.g., online banking, brokerage services) and e-commerce accounts [23].
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Their experiments reveal that leveraging all the 2-hop neighbors of each node signi.­cantly improves the network connectivity even in the case of high unavailability.
Sentence 2: a much larger fraction of all online honest nodes belong to the largest connected component (LCC) with the Two-Hop overlay in comparison to that of the simplistic One-Hop overlay.
Relationship: entailment
Domain: Security and privacy
Sentence 1: (4) Hagström et al. motivate the distinction between delete and negative revocations mainly through the notion of resilience as de­fined in Section 2.
Sentence 2: in weak revocations there can be no difference between a resilient and a non-resilient revocation, since a weak revocation does not affect authorizations issued by others than the revoker.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: The primary consequence of this bug is that a negative value injected into a histogram can result in a term that decreases rather than increases a x2 sum, creating a closer match.
Sentence 2: there is a more sophisticated and nefarious property of this bug: a negative value of appropriately small magnitude will produce a negligible effect if compared to a zero, and a very large effect if compared to a nonzero value.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: The intuition behind the proof is as follows: If the adversary corrupts the party that first receives the output, then he can provoke his most preferred event E10 by aborting before sending his last message.
Sentence 2: because this party is chosen at random, this happens only with probability 1/2; with the remaining 1/2 probability the honest party receives the output first, in which case the best choice for the adver­sary is to allow the protocol to terminate and provoke the event E11.
Relationship: contrasting