sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Since the resemblance of the experimental distribution with the uniform distribution in the random waypoint model is not always guaranteed, we focused our attention on this mobil­ity model.
Sentence 2: we simulated two mobile scenar­ios for a network with n=100 nodes: one which is critical from the uniformity s point of view (tpause=0, vmin=0.001, vmax=0.01 and pstat=0), and the other for which all the uni­formity tests are passed (tpause=200, vmin=0.001, vmax=0.01, pstat=0.3).
Relationship: entailment
Domain: Networks
Sentence 1: If .< 1/K,thatis,there areparameterpointsinthe alterna­tive hypothesis for which the observed sample is much more likely than for any parameter points in the null hypothe­sis, the likelihood ratio test concludes that H0 should be rejected.
Sentence 2: if .< 1/K, the likelihood ratio test concludes that the host uses WLAN.
Relationship: entailment
Domain: Networks
Sentence 1: Given that the human body is a signi.cant attenua­tor of WiFi signals (in the 2.4 and 5GHz frequencies), the signals arriving at the phone differ signi.cantly between these two con­.gurations.
Sentence 2: when the phone is between the AP and the user (Figure 1(a)), the direct path from the AP to the phone is strong.
Relationship: entailment
Domain: Networks
Sentence 1: This paper presents Delay Distribution Measurement (DDM) based admission control algorithm, the .rst measurement-based approach that e.ectively exploits statistical multiplexing along the delay dimension.
Sentence 2: dDM exploits the well known fact that the actual delay experienced by most packets of a QVPN is usually far smaller than its worst-case delay bound requirement since multiple QVPNs rarely send traf­.c bursts at the same time.
Relationship: entailment
Domain: Networks
Sentence 1: The jammer in Jam-Secure should ensure the following, before SIC, the SNR is low enough to guarantee several bit er­rors, and  after SIC, the SNR is suf.cient to decode the packet.
Sentence 2: the jammer should guarantee that the SNR of the eavesdropper is below S N Rmin, while the same for the receiver is greater than the SN Rmin.
Relationship: entailment
Domain: Networks
Sentence 1: If pi is on the convex hull of PI .P and Ni .PI, then pi is on the boundary of PI with respect to a certain transformation f(·).
Sentence 2: if a point is on a (internal or external) surface of the hypothetical volume represented by P and is visible (due to locally convexity) from some viewpoint, it will be recognized as a boundary node.
Relationship: entailment
Domain: Networks
Sentence 1: In this context and consider­ ¯ ing an average power constraint P per UT antenna, the op­timal transmission strategy is non-orthogonal transmission with power P followed by optimal multicell joint decoding ¯[2].
Sentence 2: the UTs transmit simultaneously on the available bandwidth and SIC is employed at the cen­tral multicell-decoding processor.
Relationship: entailment
Domain: Networks
Sentence 1: Designs like MulBuff provide new opportunities for performance improvements that complement transport layer optimizations [1, 4, 5].
Sentence 2: using MulBuff in conjunction with existing trans­ports like DCTCP can provide signi.cant performance bene.ts due to isolation of .ows and by explicitly accounting for scenarios like Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage, and that copies bear this notice and the full ci­tation on the .rst page.
Relationship: entailment
Domain: Networks
Sentence 1: Di.erent from those experiments we used AROMA [3, 4], a state-of-the art accurate system for the automatic generation of WiFi-based radio-maps, to analyze di.erent what-if scenarios for device-free WiFi-based localization that is hard to evaluate in real environments.
Sentence 2: we study the e.ect of upgrading the hardware, APs mounting locations, and outsider e.ect on device-free localization.
Relationship: entailment
Domain: Networks
Sentence 1: In this context, this work investigates the use of opportunistic store-carry and forward schemes in MCN-MR networks to increase energy efficiency in the provision of delay tolerant services.
Sentence 2: the paper identifies for a two-hop MCN-MR scenario the optimum mobile relay location and the location from which the relay should start forwarding the information to the cellular base station in order to minimize the overall energy consumption.
Relationship: entailment
Domain: Networks
Sentence 1: Now, the CIVs are CIV(W)= 2.588; CIV(.d)= 2.382; CIV(.l)= 1.000 Notice that depending upon the values of other nominal parame­ters, the impact of changing a parameter is different.
Sentence 2: the impact of changing W is now non-trivially higher.
Relationship: entailment
Domain: Networks
Sentence 1: (39) .pDptqq k 1 Therefore, there exists some k° Pt1, 2,...,N `1u, such that ak° e 1{pN ` 1q.Since .pDpt qq e N ` 1, .pDptqqak° e 1.
Sentence 2: dpt q can be written as a convex combination of elements from S with one of them, sk° , having an associated coe.cient that satis.es .pDpt qqak° e 1, as required.
Relationship: entailment
Domain: Networks
Sentence 1: First, all our range-based localization schemes signi.­cantly out-perform the other schemes.
Sentence 2: tSL and TSLRL reduce the MAE by a factor of 2.8-4.1 over Centroid, 1.6-2.3 over MDS, 2.4-3.9 over Sextant, 3.1-4.4 over MCL, and 2.3-3.2 over MSL*.
Relationship: entailment
Domain: Networks
Sentence 1: Second, as the birth rate at the waist increases, it becomes more likely that a new node at that layer will acquire enough new products so that its value becomes comparable, or even higher, than the value of the kernel.
Sentence 2: the death of kernels is largely due to the birth of several new nodes at the next higher layer: if the kernel fails to quickly acquire most of those new potential products at the next higher layer it will experience a decrease in its normalized value, becoming more vulnerable to new or existing competitors atits ownlayer.
Relationship: entailment
Domain: Networks
Sentence 1: The guiding principle of MPLS routing is that the labels should be small; this is to ensure that the routing tables, which can be exponential in the label size, are kept small for fast routing.
Sentence 2: they are usually much smaller than IP addresses (at a time when 32 bit IP addresses seem to be too small); this implies that an effort has to be made to reduce the number of labels used for routing protocols to make the protocols scalable.
Relationship: entailment
Domain: Networks
Sentence 1: Relative to the stochastic approach, it reproduces a given degree distribution exactly, but does not necessarily construct simple graphs.
Sentence 2: it may (a) 0K-graph (b) 1K-graph (c) 2K-graph (d) 3K-graph (e) original HOT graph Figure 3: Picturizations of dK-graphs and the original HOT graph illustrating the convergence of dK-series.
Relationship: entailment
Domain: Networks
Sentence 1: The framework is based on the premise that botnet spam emails are often sent in an aggregate fashion, resulting in con­tent prevalence similar to the worm propagation case.
Sentence 2: we focus primarily on URLs embedded in email content because they form the most critical part of spam emails URLs play an important role in directing users to phishing Web pages or targeted product Web sites [2] 1.
Relationship: entailment
Domain: Networks
Sentence 1: We have con.gured Mail Avenger to (1) accept all mail, regardless of the username for which the mail was destined and (2) gather network-level properties about the mail relay from which spam is received.
Sentence 2: the mail server collects the following infor­mation about the mail relay when the spam is received: the IP address of the relay that established the SMTP con­nection to the sinkhole  a traceroute to that IP address, to help us estimate the network location of the mail relay  a passive p0f TCP .ngerprint, based on properties of the TCP stack, to allow us to determine the operating system of the mail relay  the result of DNS blacklist (DNSBL) lookups for that mail relay at eight different DNSBLs.
Relationship: entailment
Domain: Networks
Sentence 1: This restriction is due to their fragility.
Sentence 2: they may contain state which is necessary for connection operation (thereby violating the Internet fate sharing principles [7] which suggest connection state should reside only in end stations), they confound end-to­end diagnostics and reliability by (partially) changing the communicating endpoint, they significantly increase system complexity if mobility is frequent (due to the need to migrate state when end-nodes move), and many require both directions of data to flow through the PEP (a problem if asymmetric routing is used).
Relationship: entailment
Domain: Networks
Sentence 1: of Computer Science and Engineering, Seoul National University Gwanak-599, Gwanak-gu, Seoul, Gyeonggi-do, Korea dobby@mmlab.snu.ac.kr, tkkwon@snu.ac.kr, yhchoi@snu.ac.kr ABSTRACT Cognitive Radio (CR) techniques to dynamically utilize the fre­quency spectrum is under hot discussion recently.
Sentence 2: wireless mesh networks along with CR techniques may play a vi­tal role in spectrum-scarce situations, which are the target environ­ments of this paper.
Relationship: entailment
Domain: Networks
Sentence 1: In this paper, for cases where d> 2, we use the solution corresponding to d = 2 as an approximation.
Sentence 2: if the service set of a relay node Ri is given by Fi = {fi =(Si,Di,.i)|i =1,...,k}, then the position of Ri R in our work is de.ned as: .i .i i · xSi i · ySi xRi = .yRi = .
Relationship: entailment
Domain: Networks
Sentence 1: {0, 1}l0 satis.es that the random variable (µ, H(µ, w)) has .1 statistical distance from (µ, u) that is uniformly distributed over R×{0, 1}l0 and w distributed according to RA conditioned on RC .
Sentence 2: h is an .n, l0,.2.-extractor for the source RA conditioned on RC .
Relationship: entailment
Domain: Networks
Sentence 1: 4 The multiple tree case In this section, we examine the effect of removing the assumption that there is a single multicast tree that defines the routing for all groups or layers.
Sentence 2: we consider the case where for every layer or group, there is a single fixed tree that must be used, but the trees for the different layers or groups do not have the same tree, either because they originate from different sources, or because they use a different routing scheme.
Relationship: entailment
Domain: Networks
Sentence 1: However, our study reveals that no solution provides a comprehensive and eas­ily realizable approach to simultaneously address the chal­lenges discussed in the previous section.
Sentence 2: our survey across the .elds of WLANs, Adhoc,Cellular and Sen­sor networks research, reveals that (i) there are no existing per-link solutions to address the asymmetric channel access problem in WLANs, and (ii) although approaches exist that address a subset of the challenges, Symphony is the .rst sys­tem to simultaneously address the complete set and pro­with any other node in range; whereas in WLANs, clients can only communicate with the associated AP, and vice versa.
Relationship: entailment
Domain: Networks
Sentence 1: Note that the Octahedral symmetry of these grids introduces a key property missing from the Tetrahedral and Icosahedral families of spherical interconnects: due to the square defect regions of the Octahedral graphs, a red/black ordering of points is maintained over the entire graph.
Sentence 2: half of the points may be labeled as red and the other half labeled as black, with red points hav­ing only black neighbors and black points having only red neigh­bors.
Relationship: entailment
Domain: Networks
Sentence 1: YG and DT have been shown to be t-spanners, where t is larger than 1.
Sentence 2: in [15], the DT based algorithm has a lower (a) (b) Figure 3: Properties of LDTC: (a) Quadrangle ABCD have no two edges AC and BD intersect in LDTC since there is at least one angle larger than p/2, (b) the same neighbor relations exist in XTC if they exist in LDTC.
Relationship: entailment
Domain: Networks
Sentence 1: As our perfor­mance metric, we measure per-link throughput and compute their normalized ratio to the ideal throughput that each link can obtain if it operates in isolation using all 52 subcarriers.
Sentence 2: if y is the performance in the presence of cross-band interference and x is the ideal throughput when there is no cross-band interference (using 52 subcarriers), we de.ne normalized impact as 1 - y/x.
Relationship: entailment
Domain: Networks
Sentence 1: 3.3 Inter-cell coordination Thesharing contentionpolicyisimplementedinaseparatemod­ule, here called virtual market.The relevant class(we refertoan Object-OrientedProgramming, or OOP,paradigm)implements an arbitrationrulewhich de.neshowthe operators bargainthe access tothecommonportionofthespectrum.Anycomplexstrategy can beimplemented withinthisclass, possiblyinvolvingfurtherexten­sions.
Sentence 2: this may be the place where to implement, inanentirelymodular manner, someproceduresinspiredbygame theoreticprinciples.Each eNB,aftergeneratingitsownallocation map, sends it to the virtual market thatgathers all the cells alloca­tioninformationand rearrangestheallocationmap accordingtothe sharingpolicy.
Relationship: entailment
Domain: Networks
Sentence 1: This pa­per demonstrates that using RDMA protocols such as RoCE 2ALS, http://www-als.lbl.gov/ (RDMA over Converged Ethernet) [7] one can achieve signif­icant gains over existing methods of high-performance data movement over the WAN.
Sentence 2: our results show that RoCE over virtual circuits is worth further evaluation and consideration.
Relationship: entailment
Domain: Networks
Sentence 1: Indeed, it appears even for 802.11g the same can be said for most speeds allbut the highest three, infact, when transmitting at the highest power in our test bed.
Sentence 2: each transmitter can disregard the presence (or absence) of over­hearing, and focus on the natural goal of selecting the bitrate that minimizes the remaining expected transmission time (ETT) of the batch fragment to its ultimate destination.
Relationship: entailment
Domain: Networks
Sentence 1: in Figure 4, the coalition S = {1, 2} in the direct reci­procity case adopts the cooperation strategy r1 =2 and r2 = 1 and the coalition S = {1, 2, 3} in the indi­rect reciprocity case adopts the cooperation strategy r1 =3, r2 =1 and r3 =2.
Sentence 2: the preference order >n is de.ned as (rm)m.N >n m n. prefers the relay selection (rm)m.N to another selec­ m for any m .S, we have rm >m (r)m.N if and only if >n node n rn r reciprocity based relay selection, a key challenge is how to e.ciently divide the nodes into multiple groups such that m former selection (rm)m.N is better than the assigned tion (r)m.N if and only if its assigned relay rn in the the nodes can signi.cantly improve their data rates by the reciprocal cooperation within the groups.
Relationship: entailment
Domain: Networks
Sentence 1: It is widely understood that current mobile network archi­tectures, strongly resembling their voice-only forebears, are poorly suited to these applications [9].
Sentence 2: current mobile network architectures are highly centralized, which Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full cita­tion on the .rst page.
Relationship: entailment
Domain: Networks
Sentence 1: Field Test VBF Delay 20 19 5.3.3 Throughput Measurement  We now calculate the amount of useful data (i.e., payload in data 18 packet) transmitted by a Micro-Modem per unit of time, referred 17 to as application-level throughput.
Sentence 2: we implement a stop-and-wait protocol for reliable data transfer.
Relationship: entailment
Domain: Networks
Sentence 1: Becausethe energy consumptionper nodeisproportional to the amount of bits received and subsequently forwarded, by applying the CRT-based technique it is possible to re­duce signi.cantly the energy consumed for each node and consequently to increase the network lifetime of the wireless sensor network.
Sentence 2: in this paper an analytical model has been derived and the trade-o.
Relationship: entailment
Domain: Networks
Sentence 1: Portscan detection methodology 3.1 TRW and TAPS 3.1.1 TRW TRW performs hypotheses testing on the observed connection status of each source to decide whether it is more likely to be a scanner or a benign host.
Sentence 2: let H0 represent sent the hypothesis that a source is a benign host, and H1 be the hypothesis that a source is a scanner.
Relationship: entailment
Domain: Networks
Sentence 1: The ccmgr is included in the compound modules for the HCA and the Switch-Port, and manages everything related to congestion control in these modules, with the help of the other simple mod­ules therein.
Sentence 2: allCC parameters speci.ed in the In.niBandArchitectureSpeci.cationrelease 1.2.1[7]are supported by the ccmgr module.
Relationship: entailment
Domain: Networks
Sentence 1: The objective of the algorithm is to make the neighbourhood size of p slightly larger than the number of used links, so as to trade o. between two opposing needs: i) to reduce the possibility that some upload bandwidth of p is not used due to lack of neighbours (a larger neighbourhood is desired), ii) to reduce the possibility of overlay maintenance overload (a smaller neighbourhood is desired).
Sentence 2: let U(p) be the set of p s used links and U(p)the set of unused links, with card(U(p)) and card(U(p)) being their cardinalities; thus, L(p)= card(U(p)) + card(U(p)).
Relationship: entailment
Domain: Networks
Sentence 1: Collected results: For each test, we record data volume observed by different parties.
Sentence 2: we collect (1) Vue, the data vol­ume perceived by mobile devices, (2) Vop, the data volume ac- Name City Area Type Distance (km) Route-1 NY Rural Freeway 28.5 Route-2 NY Rural Freeway 19.8 Route-3 NY Rural Local 11.7 Route-4 NY Urban Local 8.8 Route-5 NY Rural Local 9.8 Route-6 LA Rural Freeway 31.7 Route-7 LA Urban Freeway 19.2 Route-8 LA Urban Local 9.4 Route-9 LA Urban Freeway 7.2 Route-10 LA Urban Local 1.9 Route-11 LA Rural Freeway 15.0 Route-12 LA Rural Local 28.3 Route-13 LA Urban Freeway 41.0 Total 232.3 Table 2: Route information.
Relationship: entailment
Domain: Networks
Sentence 1: (3) The above result follows easily by taking the derivative of the expression for DR(i) given by De.nition 2.2 and Lemma 2.1.
Sentence 2: as nodes replicate a particular content i, the marginal gain in the delivery rate of i is gradually smaller; as n(i) tends to in.nity, U(i) tends to zero.
Relationship: entailment
Domain: Networks
Sentence 1: In this paper, our position is that resource management solutions should take into consideration the history of vari­ations in a user s channel quality and who or what induced them when making fairness decisions.
Sentence 2: user in­duced variations such as those due to mobility and nomadic­ity, as opposed to network deployment induced variations should be explicitly accounted for during resource alloca­tion.
Relationship: entailment
Domain: Networks
Sentence 1: 4Our further analysis reveals that, given the phase difference mea­surements, the grating lobes intersecting at the blue initial position are indeed the ones closest to the ground truth initial position as well.
Sentence 2: the initial positioning error is due to the error in the measurements of the signal phases, which are likely caused by random wireless noise and the multipath effect [22, 35].
Relationship: entailment
Domain: Networks
Sentence 1: r _> 0 and ~-~iej ri < 1 + e for every j E V2) ) and if for any other feasible vector r', the aggregate of the proportional changes is not positive [5]: t E --ri--ri ~_0.
Sentence 2: ri iEV1 for the proportionally fair rate allocation vector r, E dr__~i= 0 ri iE Vl which translates to the maximization of the utility function U(r) = log(r).
Relationship: entailment
Domain: Networks
Sentence 1: In this paper, we adopt data replication to assure data survivabil­ity in UWSNs.
Sentence 2: we revisit an epidemic model and show that, even if the data replication process can be modelled as thespreading of adiseaseina .nitepopulation,newproblemsthat have not been discovered before arise: optimal parameters choice for the model do not assure the intended data survivability.
Relationship: entailment
Domain: Networks
Sentence 1: Among those identi.ed pre.xes, we .nd that about 21% of customers announce their pre.xes to the direct provider, and about 79% of customers do not export pre.xes to the provider.
Sentence 2: in order to control their incoming tra.c, some customers announce their pre.xes or their customers pre.xes to only a subset of direct providers.
Relationship: entailment
Domain: Networks
Sentence 1: Remap solves this problem nicely.
Sentence 2: if APa can validate that the chan­nel has not changed much between the two collisions, which is likely given that 802.11 is used primarily in indoor environments, it can compute the re-encoded time-domain signal of B3(G3) from B3(G4), using the technique from the preceding paragraph, with­out the need to fully decode B3(G4).
Relationship: entailment
Domain: Networks
Sentence 1: The goal of this experiment was to establish the reception outcome given the RSS at a receiver R from transmitters Ta and Tb without controlling precisely for interference timing.
Sentence 2: we didn t control when packets from Ta and Tb arrived at receiver R. each of these .gures the z-axis is the number of packets received from both Ta and Tb at R. In many RSS combinations, however, packets were actually only received from one or the other; the re­gions where one source or the other dominated are labeled on the plots.
Relationship: entailment
Domain: Networks
Sentence 1: Next, s visits each link along P, and computes the alternate path Pi it would prefer the packet to be routed along if that link were to fail.
Sentence 2: for each node vi ontheprimarypath, we(a) remove vi s outgoing edge corresponding to its next hop along theprimarypath;(b) compute a shortestpathfrom vi to d, not using the removed outgoing edge; and(c) re­storetheremoved edge.
Relationship: entailment
Domain: Networks
Sentence 1: To take this e.ects into account, we per­formed a last set of simulations where one information item is updated every d s. The computation of the coverage in­dex C is slightly modi.ed so as to consider only the updated information.
Sentence 2: the coverage is now de.ned as the percentage of updated information collected by the node bu.er that falls within the ROI.
Relationship: entailment
Domain: Networks
Sentence 1: To reduce latency further, we redirect traf.c not through the cloud PoP with the minimum RTT to and from the enterprise, but redirect traf.c on a per-destination basis through the PoP that min­imizes end-to-end latency.
Sentence 2: instead of using a single .xed PoP Pe * for each enterprise site e, we choose the optimal PoP for each client and site c, e combination (i.e., arg minP Latency(P, c) +Latency(P, e)).
Relationship: entailment
Domain: Networks
Sentence 1: We quantify the e.ect that 31 di.erent cellular network factors have on video abandonment rate and video skip (e.g., fast forward) rate.
Sentence 2: we quantify user engagement by labeling video streaming sessions in our data set as completed/abandoned and skipped/non-skipped, and then evaluate the extent to which core network and radio network factors correlate with abandonment rate and skip rate.
Relationship: entailment