sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Withthismorepowerfulattaker,wealsoneedtode­velopamoreompliateddeodingproedure.Westart withsomeintuitionforthisdeodingalgorithmbydevel­opinganexpressionfortheprobabilitythatapakethas hosetto1whenitarrivesatNo.Letvkbetheproba­bilitythatapaketPisresetbysomenodebetweenN andN1,inlusive,andIot=k.Ifz(n,k)isthenumber ofintegersi,1:i:n,suhthatimodd=k,wesee j(.kk)p)(j-1)d+k-1 ak thatvk=j=1p(1-.Also,letjbethe probabilitythatapaketthatarrivesatNoisresetlastby somenodebetweenNandNk+(j-1)d,giventhatitisreset bysomenodebetweenNandN1,andthatIot=k.From 1j(.kk) -1)d+k-1  Bayesrule,weobtainak=np(1-p)(L jvL=j  LetPkbethesetofpaketsPsuhthatIot=k.For 0:k:d-1,letqkbethefrationofpaketsinPksuh thatnonodebetweenN1andN(inlusive)performsareset onthepaket.Notethatqkisnotavaluereadilyavailableto thevitim;animportantportionofthedeodingalgorithm isomputingforeahkavalueqikthatservesasanestimate forqk.Considerapakethosenuniformlyatrandomfrom thesetofpaketsinPkforwhihtheattakersetsho =t, fortE{0,1}.Theprobabilitythatthepakethashosetto 1whenitarrivesatNois j(.kk) j-1 Lj(.kk) k t r pk =t.qkrBk+(j-1)d(qk(1-qk)aj) 2 j=1 Thus,ifweknewexatlythevaluesqk,thedeodingpro­esswouldnotbeverydiferentfromthesinglebitprotool.
Sentence 2: withoutatleastafairlyaurateestimateforqk, suhadeodingproesswouldnotbeabletodeterminethe stringBuniquely.Wenextdesribeadeodingalgorithm thatomputessuhanestimate.Weheredesribethisalgo­rithmfortheasewherethevalueofnisknown.thesameproessappliesforanyvalueofe:ndetermined bythevitim:thevitimandeodeanyprefxofthepath uptotheattaker.Weherealsodesribetheeasieraseof thedeodingproesswherep:1 .Wealsowanttoem­phasizethatforthisversionofthepaper,wehavemadeno attempttooptimizetheonstantsofthealgorithm.The algorithmworksasfollows: No waitsuntilit hasreeived  ()2() ef 4.4ed F=ln(4d/.)pakets.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.2.1 Energy Consumption of Pro-active or Table-Driven Routing Protocols  Pro-active (or table-driven routing protocols) work in a way similar to wired networks: based on the periodically exchanging of routing information between the different nodes, each node builds its own routing table which it can use to find a path to a destination.
Sentence 2: keeping the information up-to-date, it may require a lot of bandwidth, which is sparse, and extra battery power, which is limited in mobile ad-hoc wireless sensor networks.
Relationship: contrasting
Domain: Networks
Sentence 1: Jinsong Han, Yunhao Liu HongKong University of Science and Technology {jasonhan, liu}@cs.ust.hk Abstract Reputation based trust management is increasingly popular in providing a quantitative measurement for peers choosing reliable resources and trusted cooperators in a decentralized Peer-to-Peer (P2P) environment.
Sentence 2: existing approaches do little regarding the validation of a peer s reputation, that is, it is challenging to guarantee the validation and accuracy of computing a reputation value due to malicious denigration or overpraising.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.1 The Role of IPs and Geolocation IP address variation is often regarded as a strong indica­tor of botnet activity and often used as a reliable metric to detect spam.
Sentence 2: it is unclear what should be adopted as a threshold for this metric, how many di.erent IPs should alert us of a distributed malicious activity, or how accurately we can classify email campaigns simply by looking at their IP address distribution.
Relationship: contrasting
Domain: Networks
Sentence 1: Poster Abstract: Supporting Heterogeneous LCD/Camera Links Frederik Hermans*, Liam McNamara , Thiemo Voigt* , Christian Rohner*, Edith Ngai*, Per Gunningberg* *Uppsala Universitet, SICS Abstract Visible light communication over LCD/camera links offers a potential complement to traditional RF communication technology such as WiFi or cellular networks.
Sentence 2: the heterogeneity in receivers (e.g., mobile phone cameras) presents a challenge because the receivers differ widely in resolution, distance to the transmitter (LCD), and other factors, and therefore they differ in channel quality.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, the data packet delivery fraction remains high even for larger values of a.
Sentence 2: larger values of a imply that the nodes may have more stale rout­ing information, increasing the likelihood of the data packets 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 Data Packet Delivery Fraction encountering broken links.
Relationship: contrasting
Domain: Networks
Sentence 1: Otherwise, node X can issue a RTS.
Sentence 2: in other words, X can issue RTS only if this communication does not interfere with n or m. the RTS issued by X will be selectively omni-directional : X will issue RTS avoiding interference with n and m. Similarly, Y will respond to this RTS by sending a CTS if the directional beam from Y to X does not captures n or m, and the CTS issued by Y will also be selectively omni-directional : Y will issue CTS avoiding interference with n and m. Now, some nodes in the areas around n and m will not receive RTS/CTS from X and Y and therefore will be unaware of this communication event between X and Y.
Relationship: contrasting
Domain: Networks
Sentence 1: DK Lee*, Kenjiro Cho , Gianluca Iannaccone , and Sue Moon* KAIST, IIJ Research Laboratory, Intel Research Berkeley {dklee, sbmoon}@an.kaist.ac.kr, kjc@iijlab.net, gianluca.iannaccone@intel.com ABSTRACT Delay is a key Internet performance metric and its stability, vari­ation, and abrupt changes have been well studied.
Sentence 2: little could have been said about the Internet-wide delay distribution.
Relationship: contrasting
Domain: Networks
Sentence 1: Sm moves a small unit of distance in an selected direction and then, Sm needs to exchange the BEACON message to estimate the distance to Si.If Sm is able to hear from Si, it is moving on the correct direction (Figure 5b).
Sentence 2: in this case, it will continue to move on the selected direction to reach the target Si.if Sm is moving on the wrong direction (Figure 5c), it needs to turn back the previous position and then move to the other direction.
Relationship: contrasting
Domain: Networks
Sentence 1: 5.1 RNC state machine dynamics In the past, RNC state machine has been modeled using probes and external power meters [1, 9].
Sentence 2: although this iden­ti.ed one of the main energy sinks of mobile systems, they are static and inaccurate as they are obtained in situ .wehaveused RILAnalyzer to record actual device RNC states and demonstrate that RNC state machines are much more diverse, necessitating more complex solutions for improving device performance and energy consumption.
Relationship: contrasting
Domain: Networks
Sentence 1: This happens because the ingress switch has to encap­sulate a packet and then look up the next-hop table with the outer header.
Sentence 2: sEATTLE requires less packet processing over­head than Ethernet at non-ingress hops, as intermediate and egress switches do not need to learn source MAC addresses, and consis­tent hashing (which takes around 2.2 us) is required only for ARP requests.
Relationship: contrasting
Domain: Networks
Sentence 1: Thisapproahletsusmathupsamplesinsideandoutside thetunnel.Iftunnelendpointsareonfnedtothenetwork edge,thenoneansimplysampleonsistentlyinthenet­workinterior.
Sentence 2: fLAGS(bits48.51)andFRAGMENTOFFSET(bits52.63) arelikewisemutablethroughfragmentation.Indeed,frag­mentationraisespotentiallyalargerissue,sineitprovidesa mehanismbywhihthenotionofasingleidentifablepaket beomesorrupted.weexpetfragmentationtoby onfnedtothenetworkedge,withanedge­to­edgenotionof paketidentityremainingvalid.Inthisaseweaninlude TOTALLENGTH,FLAGSandFRAGMENTOFFSETwithinthe invariantontent.
Relationship: contrasting
Domain: Networks
Sentence 1: While not shown for 5: Sleep(T ); 4 k + 1 switches con.rm proposal) simplicity, a switch can further con.rm its notion of position 6: If (more than 7: my pos = proposal; 8: If(my pos = 0) 9: my pod = Request from Fabric Manager; 10: Update taken pos according to replies; change, this may still be a viable option.
Sentence 2: to ex­plore the limits to which PortLand switches may be entirely plug-and-play, we also present a location discovery protocol (LDP) that requires no administrator con.guration.
Relationship: contrasting
Domain: Networks
Sentence 1: In TCP, since reliability is performed at the sender while resequencing is performed at the receiver, RCV.NXT is conveyed as the cumula­tive ACK to the sender for it to perform loss detection.
Sentence 2: rCV.NXT conveys limited information about the state of the receive buffer, and hence early implementations of TCP that rely on the cumulative ACK for performing loss detection, suffer from recov­ering at most one loss per round-trip time, in addition to incurring frequent timeouts [10].
Relationship: contrasting
Domain: Networks
Sentence 1: Given the high probability of being out of the field-of-view of the neighboring vehicles, we expect that with the vehicle-to­vehicle broadcasting limited to one hop, V2LC cannot maintain a reachability of 100%.
Sentence 2: the performance of V2LC can be improved by either allowing 2-hop broadcasting or increasing the number of transmitters/receivers on the vehicles so as to enlarge the aggregate field-of-view angle.
Relationship: contrasting
Domain: Networks
Sentence 1: a = Number dropped packets / Number generated packets (5) Thus, when the loss rates a[i] of a given high priority flow exceeds a certain thresholds PCG[i], the corresponding AIFS is linearly decreased to mitigate the loss rate.
Sentence 2: when the loss rate don t exceed PCG[i]/2, the AIFS is linearly increased in order to give more medium access opportunities to the best effort flows, and hence achieving better wireless medium utilization.
Relationship: contrasting
Domain: Networks
Sentence 1: This approach de­liversalarge percentageof messages successfully,providedtheav­erage link uptime is at least 60%, because the probability is quite high that an end to end path will be foundbefore anymessage ex­pires.
Sentence 2: the delivery ratio declines sharply as the link up­time percentage declines below 60%, resulting in a very low mes­sage completion rate with a link uptime percentage of 20% or less.
Relationship: contrasting
Domain: Networks
Sentence 1: CONCLUSIONS AND FUTUREWORK Replicating content across a geographically distributed set of servers and redirecting every client to the server with least latency is commonly expected to signi.cantly improve client performance.
Sentence 2: using data from Google s CDN infrastructure that serves over 170K pre.xes across the Internet, we .nd that routing inef.­ciencies and packet queueing can greatly undermine the potential improvementsinRTT thata CDN can yield.To aid administrators in the taskof debugging instancesof highRTTs, wehavebuilt the WhyHigh system which .rst identi.es affected pre.xes, then prior­itizes the several tens of thousands of in.ated pre.xes, and .nally diagnoses the causes underlying these cases.Wesee signi.cant im­provements in client latencies offered by Google s CDN from the use of WhyHigh over the course of a year.
Relationship: contrasting
Domain: Networks
Sentence 1: As mentioned in Section 2, the message authenticity process re­lies on a 64 bit explicit nonce, i.e the concatenation of the Epoch .eld and the Sequence Number .eld in the DTLS record header.
Sentence 2: the presence of multiple sender nodes inevitably leads to reusing the same explicit nonce values, and makes it impossible to check that received multicast messages are actually fresh.
Relationship: contrasting
Domain: Networks
Sentence 1: The models of this kind of networks can be applied to many areas, such as mod­eling the .ow of information through a distributed network and studying the spread of a disease through a population.
Sentence 2: over the past few years, time-varying graphs (TVG) has recognized as the fundamental model for mobile network­ s. di.erent to the traditional static graphs, time­varying graphs perform dynamically and consequently more complex.
Relationship: contrasting
Domain: Networks
Sentence 1: Our work on carrier sense in the presence of ongoing transmis­sionsisrelatedtopacketdetectioninZigZag[12]and carrier count­inginSAM[31].These schemesdetectthe number of concurrent transmissions using preamble correlation.
Sentence 2: n+ projects on a space orthogonal to ongoing transmissions, which cancels out theinterference.
Relationship: contrasting
Domain: Networks
Sentence 1: This .exibility is one of the key factors contributing to the robustness and scalability of the P2P paradigm.
Sentence 2: this .exibility also 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 citation on the .rst page.
Relationship: contrasting
Domain: Networks
Sentence 1: Analyzing up­stream traf.c for this purpose cannot be done reliably: because our monitors are less sensitive than the AP, if the AP misses an up­stream frame our monitors will likely miss it as well, which biases our upstream sample toward successful receptions.
Sentence 2: our monitors capture nearly all downstream traf.c, and so retransmis­sions are reliable indicators of previously failed attempts.
Relationship: contrasting
Domain: Networks
Sentence 1: (Speci.cally, the recip­ient must transmit an ACK exactly 192 µs after decoding the incoming packet s last bit, and transmitting the ACK packet takes 352 µs at 802.15.4 s 250 kbps data rate [12, 15].)
Sentence 2: tinyOS disables the CC2420 s hardware auto-acknowledgement feature due to concerns over its relia­bility [4].
Relationship: contrasting
Domain: Networks
Sentence 1: We brie.y examine how STAC can be achieved using a centralized entity, and propose a location-oriented challenge response protocol to support STAC.
Sentence 2: we believe that centralized schemes can expose a user to a se­vere privacy risk, and therefore, in order to achieve better user privacy, in Section 5, we turn our focus to the prob­lem of using the sensor network to enforce STAC policies.
Relationship: contrasting
Domain: Networks
Sentence 1: Thedissolutionof thelargest componenthappens due to the sudden percolation of holes in the networks at r 0.2 which disintegrates the network into a large num­ber of small disconnected components (Fig 1(b)).
Sentence 2: in presence of proper rewiring, p2p network shows graceful degradation in face of churn.
Relationship: contrasting
Domain: Networks
Sentence 1: There are many techniques available in the data mining literature to discover statistical causal dependencies, such as linear regression and partial correlations.
Sentence 2: they are not directly applicable in our context due to two main problems: (i) many event-series pairs exhibit strong cross-correlations among each other, which causes regression and partial correlation coef.cients to be inaccu­rate (this is commonly known as the problem of multi-collinearity), (ii) regression when used to distinguish cause and effect produces erroneous edge directionality in noisy data.
Relationship: contrasting
Domain: Networks
Sentence 1: As explained in Sec­tion 4, the optimal strategy for the jammer would yield * * Kw + K s = UHSzUH.
Sentence 2: (83) in the general case with .nite JNR, the energy available at the jammer could be not su.cient to provide a total interference signal (jamming signal plus thermal noise) beamformed along the left singular vectors of the channel H. Nevertheless, we aim to provide a jamming strategy that exploits the optimal directions as soon as the JNR enters the feasibility region of Section 5 * Kw = Kw + .w = UHSwUH + .w, (84) in which S w = diag{s w,i}, with sw,i = 0, for i =1,...,KM and KM s s,i = EJ.
Relationship: contrasting
Domain: Networks
Sentence 1: An extremely useful approach to pro.le tra.c is to extract and display to a net­work administrator the multi-dimensional hierarchical heavy hitters (HHHs) of a dataset.
Sentence 2: existing schemes for computing HHHs have several limitations: 1) they require signi.cant computational overhead; 2) they do not scale to high dimensional data; and 3) they are not easily extensible.
Relationship: contrasting
Domain: Networks
Sentence 1: RELATED WORKS To the best of our knowledge, there is not another work exploiting the use of grids or clusters of collocated APs with application-friendly heuristics to build scalable wire­less VoD systems.
Sentence 2: there are several interesting research initiatives, focusing on VoD delivery over WLANs and on strategies to control and optimize WLAN through­put, which use association control, channels aggregation, or transmission mode selection.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.3 Scheduling the transmitting nodes The parent selection step discussed above is node-centric in the sense that it is limited to node u when picking a parent, and assigning a time slot and channel.
Sentence 2: con.icts may exist among the individual nodes which are not neighbors on the same level L. To illustrate, consider the example in Figure 1(a).
Relationship: contrasting
Domain: Networks
Sentence 1: Unidirectional interface-level sampling offers some im­provement, since one can use a higher sampling rate on interfaces that carry less traf.c.
Sentence 2: unidirectional sampling, say on the ingress direction, will not help in get­ting suf.cient samples from a small interface-to-interface traf.c ME whose ingress is on an interface that carries a high volume of traf.c.
Relationship: contrasting
Domain: Networks
Sentence 1: Beyond the Bits: Cooperative Packet Recovery Using Physical Layer Information Grace R. Woo, Pouya Kheradpour, Dawei Shen, and Dina Katabi Massachusetts Institute of Technology Cambridge, MA, USA gracewoo@mit.edu, pouyak@mit.edu, dawei@mit.edu, dk@mit.edu ABSTRACT Users increasingly depend on WLAN for business and enter­tainment.
Sentence 2: they occasionally experience dead spots and high loss rates.
Relationship: contrasting
Domain: Networks
Sentence 1: In this scenario, eMPTCP consumes around 8% and 6% less energy than MPTCP and TCP over WiFi, respectively.
Sentence 2: eMPTCP is ap­proximately 22% slower than MPTCP since it utilizes an  450 600 such as Full-MPTCP mode (where all potential sub.ows are 400 500 used to transmit packets) and Backup mode (where only a 400 subset of sub.ows are used).
Relationship: contrasting
Domain: Networks
Sentence 1: For instance, in an online game with few servers, a client can simply measure its latency to all servers and bind to the closest one for minimal response time.
Sentence 2: collecting global information is infeasible for a signi.cant set of recently emerging large-scale distributed applica­tions, where global information is unwieldy and lack of centralized servers makes it dif.cult to .nd nodes that .t selection criteria.
Relationship: contrasting
Domain: Networks
Sentence 1: More speci.cally, the Min-Max-Scheduling focuses on the chal­lenge of unbalanced tra.c distributions and our heuristic intends to serve the hot WTUs in a greedy manner.
Sentence 2: the Best-E.ort-Scheduling aims at maximizing the utilization of wireless resources and the proposed heuris­tic is based on the maximum weight matching over a util­ity matrix.
Relationship: contrasting
Domain: Networks
Sentence 1: A redirect server is di.erent from a proxy server in that a SIP client B (4) SIP Server E (The home server of A) Home network of Home network of A SIP-NMS D (2) SIP Home Server (SIP-HS) F SIP Server (3) SIP Foreign Server (SIP-FS) 3  Figure 1: The Architecture of the SIP-NEMO redirect server only replies the callee s location to the caller.
Sentence 2: a proxy server will forward SIP messages to the callee for the caller.
Relationship: contrasting
Domain: Networks
Sentence 1: From a conceptual viewpoint, an ideal advertising framework is one that only monetizes user attention, without incurring the user any additional monetary or resource costs (such as network bandwidth or device energy).
Sentence 2: as mo­bile ISPs universally move towards metered wireless data plans, consumers are progressively growing wary of the hid­den costs of such advertising tra.c, both in terms of band­width consumption [12, 28], and energy overheads [19].
Relationship: contrasting
Domain: Networks
Sentence 1: In TSA, frame sizing for the new set of frames is established once and for all at the end of their parent frame, according to the observed outcomes on it.
Sentence 2: as frames are executed and tags are identi.ed, the knowledge about the amount of discovered tags for each frame can be used to better estimate the number of tags to be identi.ed and properly establish the size of the follow­ing frames.
Relationship: contrasting
Domain: Networks
Sentence 1: They work at a coarse per-ingress level and we cannot compute the ap­plicationmetricsonamore .ne-grainedper-ODbasis.Again,this is not aninherentlimitation of application-speci.c approaches; we can also con.gure them on a per-OD basis.
Sentence 2: this signi.­cantly increases the complexity since we need an instance per ap­plication per OD-pair.
Relationship: contrasting
Domain: Networks
Sentence 1: From Figure 4, we can conclude that S-BGP is doing ex­actly what it is designed to do: it is limiting the set of paths the attacker can announce, thus forcing him to announce longer paths.
Sentence 2: in light of the results in Figures 2-3, we must ask ourselves why forcing the manipulator to an­nounce longer paths does not seem to signi.cantly limit the amount of tra.c he attracts.
Relationship: contrasting
Domain: Networks
Sentence 1: ROAM uses a route reply-request process similar to that used in AODV, DSR and other on-demand protocols.
Sentence 2: a node can change its next hop to a destination without notifying its neighbors as long as it has a neighbor with a distance that is shorter than the node's own feasible distance value to the destination, where such a distance is the smallest value at- tained by the node's distance since it obtained a route to the destination after sending a route request.
Relationship: contrasting
Domain: Networks
Sentence 1: ratio of qualified users,PUs or SUs 1 0.8 0.6 0.4 0.2 0 10 20 30 40 50 60 PU Solid line: PU compensation Dotted line: no PU compensation SU number of PUs users requiring 384 kbps The results show that all the PUs are served irrespective of the mix of PUs and SUs, but, as would be expected in a priority qualified user ratio 0.8 0.6 system this is at the expense of the number of SUs.
Sentence 2: what is also noteworthy is that as the number of PUs increases, the total number of users decreases.
Relationship: contrasting
Domain: Networks
Sentence 1: For SMS and Location, BPEL proxies were created by us­ing the WSDL interfaces de.ned by Parlay-X, these provide su.cient information for invoking the corresponding func­tionality from a BPEL work.ow.
Sentence 2: java proxies were implemented by generating Java clients from these WSDL descriptions (using standard IBM tools) and wrapping inside our proxy structure.
Relationship: contrasting
Domain: Networks
Sentence 1: We have shown that perfect proactivity no spoofed IP.ow can penetrate is intrinsically di.cult to achieve in Internet AS topologies while maintaining sparse coverage.
Sentence 2: this is mitigated by the fact that those spoofed IP.ows that can escape the .lter net can be localized to within 5 candidate sites which facilitates e.cient IPtraceback.
Relationship: contrasting
Domain: Networks
Sentence 1: Also, a smart space middle framework with its emphasis on the context­aware service composition is suggested for OSGi (Open Ser­vices Gateway Initiative) driven mobile network environ­ments [8].
Sentence 2: in spite of many existing e.orts spe­cially tied with service oriented networks (SONs) [7], the .exible composition of large-scale media-oriented services are only partially addressed so far.
Relationship: contrasting