sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Whenauserinitiatesaserviehandof,herterminalagent invitesthenewendpoint,thenthenewendpoint'stermi­nalagentsendsthenewendpointnotifationmessageto allotherterminalagentspartiipatingthesession.Later, theuserhangsuptheolddevie,ompletingtheservie handof.
Sentence 2: aproblemtoonsideriswhathappenswhenthenotifa­tionorhang­upmessagesgetlostforanyoftheterminal agents.Weouldletthereeivingterminalagentsend ACKsbaktothesendingterminalagent.for asessioninvolvingmultipleparties,suhanARQ­based shemewillauseACKimplosionatthesendingtermi­nalagent.Inaddition,ifanetworkpartitionseparates aterminalagentfromothers,theotherterminalagents mustbeabletodetetthesituationanddealloatere­souresaordingly.Toresolvetheseissues,wetakethe announe/listenapproah.Eahterminalagentperiodi­allyannounestothegroupitsendpointinformationas heartbeatstoindiatethelivenessandassoftstatere­freshessupplyingthemostup­to­datestateattheend­point.Thisensuresthereliabilityofthemesssagesand masksawaytransientnetworkpartitions.Eahterminal agentalsolistensfromthegroupolletingtherestofthe  Figure2:ServiehandofthroughAppliation­levelLightweightGroupServie.
Relationship: contrasting
Domain: Networks
Sentence 1: + share - i share ni -1 colli(xi)1 Vi(xi)= k·log xi-(1-k)·( ·xi+ +) share B Bn i (9) share n -1 Because log xi is a concave function, and i B · xi + colli (xi )1 B + nis a non-decreasing function, Eq.9 is a share i  strictly concave function, according to Lemma 3.2 in [22].
Sentence 2: whether it has a unique optimal point depends on two conditions: Vi(xi) .
Relationship: contrasting
Domain: Networks
Sentence 1: If k = 10, then, since both the critical threshold and the distribution of switching costs are 10 times lower for B than A, the two schemes have roughly equal likelihoods of adoption.
Sentence 2: if k < 10, then the savings in switching costs for B are insuf.cient to compensate for the reduced adoptability of B s weaker properties, and hence B is less likely to be adopted than A.Conversely, if k > 10, then B is more likely to be adopted than A.
Relationship: contrasting
Domain: Networks
Sentence 1: The only elements in these au­tomata which may be considered less intuitive are the use of committed locations in the InputHandler and the sending of a no reply signal in situations where no reply packet is sent (this is an artifact of the model since in reality there is no such signal).
Sentence 2: we can easily remove these elements from the InputHandler automaton at the price of making the Network automata (somewhat) more complicated.
Relationship: contrasting
Domain: Networks
Sentence 1: 2) Approaches for autoconfiguration Besides developing a completely new protocol, there are at least two options to develop autoconfiguration mechanisms for IPv6-enabled sensor networks based on existing solutions: a) Adaptation of standard IPv6 autoconfiguration mechanisms to work in sensor networks The natural way of performing address configuration for IPv6 networks is to make use of the already standardized mechanisms for any type of IPv6 networks, namely IPv6 neighbor discovery (NDP) [31] and IPv6 stateless address autoconfiguration (SAA) [32].
Sentence 2: both mechanisms expect layer 2 multicast capable links, i.e.
Relationship: contrasting
Domain: Networks
Sentence 1: A histogram analysis indicates that the second layer (cen­tered at 57 ms delay) comprises about 50% of all downlink delay singletons while the third layer (centered at 67 ms) ag­gregates about 40% of the singletons.
Sentence 2: what makes emulation really challenging is that for payload sizes be­tween 700 bytes and 1100 bytes the median curve oscillates between the second and the third layer.
Relationship: contrasting
Domain: Networks
Sentence 1: RELATEDWORK Asalreadymentionedintheintroduction,accountabilityandver­i.ability play a crucial role for many cryptographic tasks and pro­tocols.
Sentence 2: in most works, accountability and veri.ability or related notions are merely described informally or are tailored to speci.c protocols and security aspects (see, e.g., [3, 10, 24, 23, 9, 8, 18, 6, 7]).
Relationship: contrasting
Domain: Networks
Sentence 1: .guration stanzas can, in theory, be reused across different cus­tomersprovisioned on the samedevices.
Sentence 2: as we showbe­low,we .ndthatcomplexity arisesbecausecustomersoftenrequire signi.cantlydifferent con.gurationdue todifferent waysin which a service is actually used.
Relationship: contrasting
Domain: Networks
Sentence 1: Similarly, in networks with high message generation rate I, since particles will be required to further propagate an increased number of received messages, a larger space Tb will be required, while for networks of low message genera­tion rate a smaller space may su.ce.
Sentence 2: in real environments, measuring the density of the smart dust plane may be a highly non-trivial task, es­pecially if we consider cases where the particles are dropped randomly on the area of interest.
Relationship: contrasting
Domain: Networks
Sentence 1: For ARR P and TRR P it is su.cient to .lter the measurements (in these cases packet counts) at regular intervals using an exponen­tially weighted moving average (EWMA) with a .xed av­eraging fraction.
Sentence 2: estimation of the average loss probability LOSSP and of the average MRTT ARTT both re­quire a more general and sophisticated .ltering approach.
Relationship: contrasting
Domain: Networks
Sentence 1: In addition, more sensors will be charged in the case of a larger L. For example, when L = 200m, 34% of the sensors, with the battery energy lower than or equal to 32, are charged and this results in a tour length of 193.2m.
Sentence 2: when L = 300m, 78% of the sensors, with the battery energy lower than or equal to 77, are charged, which leads to a tour length of 295.4m.
Relationship: contrasting
Domain: Networks
Sentence 1: Finally, it might be interesting to explore the use of vari­ous peer-to-peer location services, such as Chord [26], Pas­try [23], Tapestry [33], Viceroy [20], and CAN [22], for prop­agating information to proxies, and load balancing between them.
Sentence 2: these mechanisms are tailored for the In­ternet, and may need to be adapted to wireless ad-hoc net­works.
Relationship: contrasting
Domain: Networks
Sentence 1: Direct access to the memory and registers of the veri.er process are unlikely to be useful in supplying the initial state s0, because P. will have a different memory and register allocation.
Sentence 2: if the necessary state can be inferred from the veri.er s output and from a priori knowledge as described in Section 3.2, and if the pro­gram P. implements the same protocol speci.cation as P, an input iv derived from our symbolic formula is likely to result in the same externally observable behavior on the veri.er as io did on the ob­server.
Relationship: contrasting
Domain: Networks
Sentence 1: In contrast, FPS must determine demand in terms of the number of TCP .ows present, which is independent of arrival rate.
Sentence 2: furthermore, since TCP always attempts to increase its rate, a single .ow consuming all of a limiter s rate is nearly indistinguishable from 10 .ows doing the same.2 we would like that a 10-.ow aggregate receive 10 times the weight of a single .ow.
Relationship: contrasting
Domain: Networks
Sentence 1: Results for µ = 200 ms are independent of the burst length (i.e., a straight line) for b = 20 ms because the probability of a loss burst lasting more than 200 ms in these cases is close to zero.
Sentence 2: when b = 40 ms, the probability of a burst lasting more than 200 ms is higher and the detection-error rate increases.
Relationship: contrasting
Domain: Networks
Sentence 1: When a RREQ copy at an intermediate node creates or updates a reverse path, and the intermediate node has no valid path to the destination, the RREQ copy is re-broadcasted provided it is the .rst copy that yields a reverse path; this is somewhat similar to basic AODV where only .rst copies of RREQ are forwarded to prevent looping during the .ood.
Sentence 2: if the intermediate node does have a valid path to the destination, it checks whether or not a RREP has already been sent for this route discovery.
Relationship: contrasting
Domain: Networks
Sentence 1: SYN-out SYN-ACK-out testsif aNAT allows a client to send out aSYN-ACKpacket after sending aSYNpacket.
Sentence 2: filtering response: Recall that at the beginning of NAT traversal, each client sends out aSYNpacket to create a connection mapping onits ownNAT.when theSYNpacket reaches the other NAT, it could be dropped or trigger a TCP RST or ICMP packet.
Relationship: contrasting
Domain: Networks
Sentence 1: For an advanced congestion control scheme like DCTCP, the lower bound of the threshold has been shown * to be O( T × C) in [2, 3].
Sentence 2: as we will show later in this section, the absolute value of the di.erence between the lower bounds of DCTCP and ECN* is actually very small for data center networks, which allows ECN* to perform similarly to DCTCP.
Relationship: contrasting
Domain: Networks
Sentence 1: N2 hears these messages and repeats the process after receiving w of them to estimate o2(0) and d 2.
Sentence 2: as the clock at N1 is not as accurate as the master clock, the noisy offset measurements at N2 will now include additional terms: iT c2(i)= o2(i)+ e2(i)+ eo1 + ed1 (11)f0 eo1 = o1(0) - o 1(0) (12) ed1 = d1 - d 1 (13) where, o2(i) is the true offset of the clock at N2 with respect to the clock at N0, e2(i) is the offset measurement error at N2 and eo1 and ed1 are the errors introduced in offset measure­ment due to imperfect offset and frequency error estimation at N1 respectively for message i.
Relationship: contrasting
Domain: Networks
Sentence 1: 6.4 Interference with TV Receivers Since the backscattered signals are re.ections of existing TV signals, in theory, one could either synchronize ambient backscat­ter with the TV transmissions or modulate data at a slow enough rate that TV receivers would be immune to interference.
Sentence 2: even without these constraints, the backscattered signals are weak enough that they do not affect TV receivers except in less favor­able conditions.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, if connection A has T A = 24 and reserves slots 0, 24, 48,.... SCO When connection B with T B = 6 arrives at slot time 5, SCO it may reserve slot 6 without con.ict with connection A ini­tially.
Sentence 2: as time goes on connection B will con.ict with connection A at time slot 24.
Relationship: contrasting
Domain: Networks
Sentence 1: This can be observed, for example, as the buffer creation and selection mechanisms for each optimiza­ 2The Standard Optimized Buffer is a specialized version of the Simple Buffer at a conceptual level and, as such, a subclass rela­tionship between the two could be enforced.
Sentence 2: the call­ing interface needed for the two is signi.cantly different and little opportunity for true polymorphism exists.
Relationship: contrasting
Domain: Networks
Sentence 1: HEURISTICS Despite the lack of e.cient approximation algorithms with good approximation ratios, it may still be possible to .nd a good solution in many practical problem instances by us­ing a heuristic algorithm.
Sentence 2: typical heuristics are of little use in comparing the performance of di.erent kinds of sensor networks: the heuristics provide only a feasible so­lution (i.e., a lower bound for the optimum); they do not provide an upper bound for the optimum.
Relationship: contrasting
Domain: Networks
Sentence 1: The Starting Point is used to prevent generating links in­tersection, as illustrated in Figure 7, and then guaranteeing progress at each step.
Sentence 2: for the initiator node, that has not a CS previous hop (the message comes from a greedy forwarding previous hop), its corresponding Starting Point, noted ISPinit is considered as the intersection point between the circle of range R, centered at this node and the segment between Ninit and the destination (see Figure 7).
Relationship: contrasting
Domain: Networks
Sentence 1: This tool allows us to generate realistic ve­hicular movements by parameterizing settings such as speed limit and vehicle acceleration.
Sentence 2: due to the limitations of the IMPOR-TANT framework, traffic scenarios cannot be generated with an average inter-vehicle distance below 6.6 m. we make the observation that for average inter-vehicle distances less than 6.6 m, the vehicles are not very maneuverable in traffic, and there­fore their relative positions to one another remains approximately the same.
Relationship: contrasting
Domain: Networks
Sentence 1: Wecarry out simulations onvarious CSEs withchang­ing mobility entropy in order that we investigate the e.ect of mobility entropy on message routingperfor­mance.We recognize that theperformanceis a.ected bymany environmental features such as network band­width, media-access control (MAC) protocol, message bu.er capacity as well as mobility.
Sentence 2: in this work, we assume an ideal environment (e.g., in.nite network bandwidth and huge capacity of storage) to demonstrate the relationshipbetween mobility entropy and routingperformance.
Relationship: contrasting
Domain: Networks
Sentence 1: Compared to 2K-rescaling, this technique is simpler and can easily be extended to higher-order statistics since we can always compute scalar summaries of a given dK-distribution [18] the mean clustering and correlation of degrees of nodes located at dis­tance 2 from each other are such summaries for the 3K-distribution, for example.
Sentence 2: this simplicity comes with a price: no scalar metric can capture all of the information contained in, for instance, a 2K-distribution (that must be encoded as a matrix).
Relationship: contrasting
Domain: Networks
Sentence 1: 3.3 TLS based Authentication methods There are more than 40 EAP based authentication methods that can be used in conjunction with a AAA protocol, which will encapsulate the data found in EAP frames into appro­priate AAA messages and transfer them from the NAS to the AAA server.
Sentence 2: eAP authentication methods that are based on a Transport Layer Security Tunnel [4], such as EAP-TLS, EAP-TTLS, PEAP or EAP-FAST and others, ap­peal more to our research not only because they are more secure, but also because they bring signi.cant advantages to roaming users.
Relationship: contrasting
Domain: Networks
Sentence 1: Utilizing the Information Leakage to Recover the Key.
Sentence 2: at .rst sight, the information of whether the secret RSA key d is left or right of some value Dp in the [0,..., N ] range seems to provide only information on the few most signi.cant bits of d. recall that over the lifespan of the system, the members update their secret shares by performing the proactive share update procedure.
Relationship: contrasting
Domain: Networks
Sentence 1: Rf ) Choosing the right policy in practice: To summa­rize our .ndings, our analysis demonstrates that using a .xed rate may be attractive on lossless links while it would be better to use rate adaptation on lossy links.
Sentence 2: as discussed, determining when to use one over the other in real time during system operations is di.cult; the de­termination requires the knowledge of x(F, Rs), y(Ri)and estimates of how often the jammer is active/asleep, on av­erage.
Relationship: contrasting
Domain: Networks
Sentence 1: NoCArc '10, December 4, 2010, Atlanta, Georgia, USA Copyright &#38;#169; 2010 ACM 978-1-4503-0397-2... $10.00 routing algorithms, besides source and destination addresses, network traffic variation plays an important role for selecting channels to forward packets.
Sentence 2: adaptive routing may cause packets to arrive out-of-order since they may be routed along different paths.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, botnets with a centralized C&#38;C architecture, where all bots receive commands from a few central con­trol servers, the source of the C&#38;C messages can be used to characterize the corresponding C&#38;C channel and reveal potential dormant bots [23].
Sentence 2: characterizing the C&#38;C channel is in general not a trivial task for botnets that utilize a peer-to-peer (P2P) architecture involving no central server.
Relationship: contrasting
Domain: Networks
Sentence 1: Finally, the mobile node in searching mode cannot .nd the next region to move, so it returns to the source node D and changes its mode into transmission mode.
Sentence 2: when some mobile nodes in sensing mode connect to the source node or .xed nodes that recieved the request from the mobile node in searching mode, these .xed nodes send a route construction request packet to the connected mobile nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: 5.3 Server Overhead The MONARCH and OVL policies provide strong cache con­sistency and also exhibit similar performance in terms of the gen­erated traf.c.
Sentence 2: compared to other policies studied, the MONARCH and OVL policies incur overhead at the servers be­cause they require servers to maintain state and perform additional processing to achieve strong cache consistency.
Relationship: contrasting
Domain: Networks
Sentence 1: Many of the scheduling algorithms for IQ switches can be directly applied to CICQ switches at a lower complexity, e.g.,the distributed MWM algorithm DISQUO [39] and the push-in­.rst-out (PIFO) policy [14].
Sentence 2: a CICQ switchsuffers from the same problem as an IQ switch due to the needfor nearly instantaneous control communications between the in­put line cards and the switching core.
Relationship: contrasting
Domain: Networks
Sentence 1: As a general classi.cation we can distinguish between face routing strategies which require that the message has to fol­low a sequence of adjacent faces which are intersected by the straight line st connecting the source node s with the destination node t. These strategies will be denoted as con­tinuative strategies since they keep the line st as a reference during the whole routing process.
Sentence 2: a volatile strategy will initialize planar graph routing each time a face change occurs.
Relationship: contrasting
Domain: Networks
Sentence 1: Most people found the basic WAP scheme easy to learn and simple to interact with (e.g., Question 7: It was easy to learn to use ; 70% agree, 11% disagree, the most positive response).
Sentence 2: there was consistent disagreement with the statements that asserted that the WAP system would enable users to complete tasks effectively (e.g., Question 4: I am able to complete my work quickly using these WAP services ; 25% agree, 51% disagree).
Relationship: contrasting
Domain: Networks
Sentence 1: Second, while increasing balso increases TCP throughput, it does so only in higher aggregation regimes (when nis suf.ciently large) and in scenarios with long-lived TCP .ows.
Sentence 2: in­creasing bis not a good option for low aggregation regimes (when nis small) since the TCP throughput can become too low since nb-a we have p(T=b)=.
Relationship: contrasting
Domain: Networks
Sentence 1: PROOF.LetA1beanAttakerstrategywheretheNet­workhasthesetofpathsS1,andtheAttakerhoosesthe pathforeahpaketbyhoosingpathPjwithprobability Ajindependentlyofthehoieforallpreviouspakets.Let A2beanAttakerstrategywheretheNetworkhastheset ofpathsS2andtheAttakerhoosespathPjiwithprob­abilityAjiindependentlyofallpreviouspakets.Forboth Attakerstrategies,theprobabilitydistributionoverheader bitsreeivedbytheVitimisthesame.LetWbethe2b -1 dimensionalvetorthatdesribesthisdistribution.Weon­siderthesenariowheretheAttakerhooseseahofthe strategiesA1andA2withprobability1/2.
Sentence 2: if,atthestartoftheattak,werevealtotheVitimsome additionalsideinformation,inpartiularthevetorW,then (bywhatisreferredtoasthe"littlebirdie"priniple)this annotmaketheVitim'staskanyharder.IftheVitim knowsW,thenthepaketsthatarrivetothevitimdonot provideitwithanyadditionalinformation,sineitknows W,andouldsimulateanysuhpaketswithoutatually seeingthem.Therefore,regardlessofhowmanypaketsthe Vitimreeives,theVitimdoesnotobtainanyinformation pastthevetorW.withW,bothstrategyA1and strategyA2areequallylikely.SinesetsS1andS2are disjoint,theVitimisnotabletodetermineanypaththat isinthesetofpathsoftheNetworkwithprobabilitygreater than1/2.
Relationship: contrasting
Domain: Networks
Sentence 1: These attributes are obtained from the SNMP traps, business objectives of the company, context of the request, LB info, mobility man­agement scenario and service/user pro.les, depending on the decision computation and its enforcement mode.
Sentence 2: for brevity and to avoid the complexity of stringent mathe­matics, 6 attributes are chosen for the application of MCDM methods on 4 alternative links (decision computation for link selection regarding the dynamic routing of calls is presented .rst as it is most likely and frequently use case).
Relationship: contrasting
Domain: Networks
Sentence 1: CRFIDs, however, passive tags are free to choose any value from 0 to 216 as its RN16, so it is possible that a passive tag could choose an RN16 that con.icts with a burst noti.er.
Sentence 2: we choose a small part of the space for burst no­ti.ers since we expect the number of sensors in the vicinity of a reader to be in the tens (equivalent to the number of objects in the vicinity of a reader) as opposed to thousands.
Relationship: contrasting
Domain: Networks
Sentence 1: Imagine if all flows were to demand unreasonably tight deadlines, then their resulting congestion avoidance behavior would be to refuse downsizing their windows, effectively overloading the network.
Sentence 2: d2TCP s gamma-correction function guards against such overload at two levels: (1) The effect of tighter deadlines is captured by the value of .. which, in turn, determines the window size (hence sending rate).
Relationship: contrasting
Domain: Networks
Sentence 1: If so, it means the energy of the current charging node and its synchronization target have been already synchro­nized, and thus the mobile charger simply fully charges the node to maximize the charging ef.ciency.
Sentence 2: if the previously charged node is not the synchronization target of the current charging node, this implies the energy synchronization of the current node has not been yet achieved.
Relationship: contrasting
Domain: Networks
Sentence 1: To evaluate how appropriated the o.ered protocol for the VN is, we must consider the requested properties that are met by the o.ered protocol, denoted by a, as a good point.
Sentence 2: 8 9 Positive Matches (a) Negative Mistaches (b) Similarity we must assess as a bad point the properties that are not ful.lled by it, represented by b.
Relationship: contrasting
Domain: Networks
Sentence 1: Our techniques for detecting whether or not a pair of flows share congestion are based on two fundamental observations of Internet congestion: Losses or delays experienced by two packets passing through the same POC exhibit some degree of correlation (i.e., a loss or ex- cessive delay observed by a packet increases the likelihood that a later packet will be lost or experience a large delay).
Sentence 2: in general, the degree of correlation decreases as the time between the packets' transmissions is increased [12; 13].
Relationship: contrasting
Domain: Networks
Sentence 1: Delay-Aware Interleaving and Forward-Error Correction for Video over Wireless: A Bluetooth Case Study  Rouzbeh Razavi University of Essex Wivenhoe Park Colchester, U.K. +44 1206 872442 rrazv@essex.ac.uk ABSTRACT Martin Fleury University of Essex Wivenhoe Park Mohammed Ghanbari University of Essex Wivenhoe Park Mahta Sadeghzadeh UCLA Los Angeles Colchester, U.K. +44 1206 872817 Colchester, U.K. +44 1206 872434 California, U.S.A +1 949 305 1795 fleum@essex.ac.uk ghan@essex.ac.uk mahta@bolproxy.college.ucla.edu Packet-level interleaving combined with FEC has tended to be disregarded for video streaming over wireless, because of the delay introduced by the need to assemble the interleaved packets.
Sentence 2: packet level interleaving has the ability to cope with lengthy bursts of error on a wireless channel.
Relationship: contrasting