sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: If we assume the following battery drain: transmit-12.96 µJ/byte, receive-16.2 µJ/byte (based on Motorola figures on a 900 MHz transceiver), and 66 mW as the power consumption of M16C chip, the MSR­combined hybrid protocol saves 3.23 mJ on sensor side compared with executing our first hybrid key establishment protocol.
Sentence 2: if the message is sent multi-hops, the MSR-combined hybrid protocol consumes more energy at intermediate routers.
Relationship: contrasting
Domain: Networks
Sentence 1: A Mobility Management Scheme using SCTP­SIP for Real­time Services across Heterogeneous Networks Hyelim Park1 Myungchul Kim1 Sooyong Lee1 Sungwon Kang1 Yongho Kim2 1School of Engineering, Information and Communications University 119, Munjiro, Yuseong­gu, Daejeon, Korea {neofaith, mckim, torshong, kangsw}@icu.ac.kr 2InfraLab, Korea Telecom 17, Woomyeon­dong, Seocho­gu, Seoul, Korea  yhokim@kt.com ABSTRACT The Session Initiation Protocol (SIP) has been enhanced to support seamless mobility in heterogeneous networks.
Sentence 2: it still suffers from significant handoff delays and packet losses unacceptable for real­time multimedia services.
Relationship: contrasting
Domain: Networks
Sentence 1: Thesoped­multiastshemebehavesdiferentlywithre­spettooverheadthantheothershemes.Theaverageover­headofsopedmultiastexhibitsidentialbehaviortothat ofthesubastsheme,logarithmisaling.Thisonfrms ourintuitionthat,forregulartrees,theaverageoverhead ofsoped­multiastisnomorethantwiethatofsubast.
Sentence 2: forirregulartrees,however,itsaverageoverheadismore thanafatoroftwohigherthansubast.Theratioap­proahestwoathigherfanout.themaximumover­headofsoped­multiastmathesthatoflimited­multiast atlowfanout,andishigherathigherfanout.Unlikesub­ast,soped­multiastresponsesarenotlimitedtothesub­treeatwhoserootasessionwather'smtraeterminates.
Relationship: contrasting
Domain: Networks
Sentence 1: SenSys 12, November 6 9, 2012, Toronto, Canada.
Sentence 2: aCM 978-1-4503-1169-4/11/12 the energy-saving capabilities of traditional Ac­tive Database triggers conforming to the ECA (on Event if Condition then Action) paradigm [4] are lacking in the WSN context.
Relationship: contrasting
Domain: Networks
Sentence 1: Denote the variance of this process by s2 and the average rate by E[N(t -1, t]] = .. X Now, if we were to model the impact of sampling as sim­ply scaling down the original time series {Xt}by a fraction p, it is easily seen that the variance of the new scaled-down process {pXt} should be s2 = p 2 X , i.e., scaling should s2 pX reduce the variance.
Sentence 2: in practice, sampling involves removal of discrete points from the process rather than sim­ple scaling.
Relationship: contrasting
Domain: Networks
Sentence 1: Due to the distances between static nodes, there is no link between 4 and the nodes 1 and 2, and also for 3.1, the quality is close to zero most of the time.
Sentence 2: the link in the opposite direction, 1.3 changes from a bad to a good quality around the middle of the experiment, and the link 3.2 .uctuates during the whole experiment.
Relationship: contrasting
Domain: Networks
Sentence 1: 1 0.8 CDF 0.6 0.4 bit.ipsanIMDacceptsinanadversary spacketheader.Theshield usesthis upperboundtoidentifypacketsthat mustbejammed.
Sentence 2: to estimate bthresh, weperform thefollowing experiment.First, a USRP transmits unauthorized commands to the IMD to trigger it to send patientdata.We repeat the experimentfor alllocations inFig.6.The shield staysinits markedlocationinFig.6,butits jammingcapabilityisturnedoff.theshieldlogsallofthe packets transmittedby theIMD as well as the adversarialpackets that triggeredthem.Weprocess theselogs of.ine and,forpackets that successfullytriggered anIMD responsedespite containingbit errors,wecountthenumberofbit .ipsinthepacketheader.Our results show thatitis unlikely that apacket willhavebit errors at the shieldbut stillbe received correctlyby theIMD.Out of5000 packets, onlythreepackets showederrors atthe shieldbutstilltrig­gered aresponsefromanIMD.Themaximumnumberofbit .ips inthosepackets was2, so we conservativelyset bthresh = 4.
Relationship: contrasting
Domain: Networks
Sentence 1: On the other hand, an area-based quad-trie (AQT) algorithm extends one-dimensional binary trie into two-dimensional quad-trie by considering source and destination prefixes at the same time [8].
Sentence 2: aQT algorithm includes empty internal nodes as well as it performs linear search on prefix length as usual trie-based algorithms do, and hence it does not provide good search performance.
Relationship: contrasting
Domain: Networks
Sentence 1: The latter are the annotation functions A has established using possibly different pseudonyms with par­ties Ii, 1 = i = k. Note that this rule is atomic and cannot be derived from the basic rule and composition of channel rules be­cause in this case it would be only possible to have fI = ki=1 fi.
Sentence 2: this would not be in line with privacy-preserving attribute statements.
Relationship: contrasting
Domain: Networks
Sentence 1: Don t Call Them Middleboxes, Call Them Middlepipes Upendra Sharma Hani Jamjoom Dan Williams IBM T. J. Watson Research Center Yorktown Heights, NY Abstract As interest grows in introducing network functions middleboxes to Platform as a Service (PaaS) clouds, it is tempting to treat them as normal PaaS services.
Sentence 2: the PaaS service abstraction lacks su.cient support for mid­dlebox services.
Relationship: contrasting
Domain: Networks
Sentence 1: [11] 3.2 Public Internet Marketing Model The evolution of Internet services gives us an excellent opportunity to develop public marketing initiatives by improving the degree of interactivity and individualization between the public organizations and their customers (citizens and organizations).
Sentence 2: in order to fully take advantage of this reality, public organizations must start viewing Marketing and most importantly Internet Marketing as a strategic tool for pursuing their mission, and adopt it in a systematic and integrated way from the designing of new products and services to their delivering for the final customers.
Relationship: contrasting
Domain: Networks
Sentence 1: X x   2.1.1 Pruned Fast Hash Table (PFHT) In BFHT, we need to maintain up to kcopies of each item which requires ktimes more memory compared to NHT.
Sentence 2: it can be observed that in a BFHT only one copy of each item the copy associated with the minimum counter value is accessed when rc the table is probed.
Relationship: contrasting
Domain: Networks
Sentence 1: For instance, we can declare the type of a list that contains an unbounded number of tracked regions: variant reglist ['Nill COons(tracked region, tracked reglist)] ; The type reglist allows the program to store an unbounded num- ber of regions.
Sentence 2: placing a region on such a list makes it "anonymous"-that is, we lose track of exactly which key guards which region.
Relationship: contrasting
Domain: Networks
Sentence 1: Olariu and Stojmenovic [1] discuss the relationship between network lifetime and width of each corona in concentric corona model.
Sentence 2: the authors prove that in order to minimize the total amount of energy spent on routing along a path originating from a sensor in a corona and ending at the sink, all the coronas must have the same width the authors assume that all nodes out from corona Ci should forward data in corona Ci, and the transmission range in corona Ci is (ri-ri-1) (here Ci is the sub-area delimited by the circles of radii ri-1 and ri).
Relationship: contrasting
Domain: Networks
Sentence 1: Inallexeutionswherethegeneralissomeunor­ruptedpartyPP Pj,  =theforger:playstheroleofPP, followingtheprotoolandusingthesigning­keywhih itassoiatedP withPinitially.
Sentence 2: inallexeutionswherethegeneralistheunorrupted Pj,theforger:playstheroleofPjfollowingthepro­tool.inthisase,:doesnothavetheas­soiatedsigning­key.Nevertheless,itdoeshaveaess tothesigningoraleassoiatedwithpk(whihisPj's publiverifation­key).Therefore,:exeutesthese signaturesbyaessingitsorale.Inpartiular,for labels£1,£2thatitreeivesduringthesimulation,it queriesthesignatureoralefor(ph(x,£1,£2).
Relationship: contrasting
Domain: Networks
Sentence 1: In on-demand wake-up schemes [16][17], often a two-radio architecture is deployed where a second low power radio is used to detect the presence of nodes, and this low power radio will activate a high power radio on demand for packet delivery.
Sentence 2: on-demand schemes are not suitable for DTNs since the lower power radio often does not have enough transmission and reception ranges to allow nodes that are sparsely distributed to discover one another.
Relationship: contrasting
Domain: Networks
Sentence 1: In case of the best­ effort class, the bandwidth manager uses the median of the utiliza­tion distribution, denoted by Median(&#38;), as an estimate of the bandwidth requirement (this is because requests in this class desire low average response times).
Sentence 2: a high percentile of the utilization, denoted by Perc(U,t), is used to estimate the require­ments of the real-time class (since the tail of the distribution better reflects the needs of real-time requests).
Relationship: contrasting
Domain: Networks
Sentence 1: The high AI concentration activates the produc­tion of more LasR and LasI through the two feedback loops, shown in Fig.2 (b), and therefore generates more virulence (see Fig.3 (b)).
Sentence 2: in the 100 cells case, the AI con­centration does not reach the activation threshold and there­fore it does not cause any infection.
Relationship: contrasting
Domain: Networks
Sentence 1: 4, and the complete sets of AS algorithm, as expected, the aggregation latency is larger with smaller a, which represents less path loss of power and thus larger interference from neighbor nodes, and larger ß, corresponding to higher SINR requirement.
Sentence 2: simi­ lar latency performance is observed with NN-AS, at di.erent values of a and ß.
Relationship: contrasting
Domain: Networks
Sentence 1: The mesh backhaul uses an orthog­onal frequency band (900 MHz) to avoid interference with the traf.c sources being monitored.
Sentence 2: this gives rise to a related challenge in that wireless mesh networks are typ­ically very bandwidth-constrained, and the total amount of traf.c being captured by a set of sniffers may exceed the ca­pacity of the mesh.
Relationship: contrasting
Domain: Networks
Sentence 1: For a small number of seekers (i.e., p(s) = 0.2), the opti­mal and greedy policies basically coincide, as for such a small percentage of seekers the overall computational capacity of the system is large enough to a.ord greedy replication.
Sentence 2: when the number of seekers increases beyond this point, the greedy policy saturates the system.
Relationship: contrasting
Domain: Networks
Sentence 1: The necessity of sig­naling synergy is partly driven by the requirement for carrier-gradevoice support, partly by inter-system switching in hybrid 3G/4Gdeployments, and partly by mobility management.
Sentence 2: inter­actions among signaling protocols are not always designed and op­erated right: (S1) a user device is temporarily out of service becauseits vital context in 4G is shared but not well protected (being deletedafter inter-system switching); (S2) Users are denied network accessright after being accepted because higher-layer protocols make un­realistic assumptions on lower layers; (S3) 4G users get stuck in3G because inconsistent policies are used for CS and PS domainsin 3G and 4G.
Relationship: contrasting
Domain: Networks
Sentence 1: As an example, consider a solution in which there is a way-point that is far-away from the rest of the points, and is chosen because a small amount of waiting at that way-point contributes signi.cantly to con­tact probability.
Sentence 2: the additional time required by the ferry to travel to such a way-point may negate the ad­vantage.
Relationship: contrasting
Domain: Networks
Sentence 1: Note that that revealing f(N)en­ables anyone to immediately compute the RSA private key d = e -1 (mod f(N)) from the RSA public key (e, N ).
Sentence 2: both the standard DSS signatures and BLS signa­tures of [4] are based on variants of the discrete logarithm problem where all the moduli used in computations involv­ing secret shares can be made public.
Relationship: contrasting
Domain: Networks
Sentence 1: deconstructed the source code of the Witty worm to estimate various properties about Internet hosts (e.g., host uptime) as well as about the propaga­tion of the worm itself (e.g., who infected whom) [14].
Sentence 2: our work explores the behavior of spammers in depth, although we also peripherally study malware whose exclusive purpose is to send spam (i.e., the Bobax drone).
Relationship: contrasting
Domain: Networks
Sentence 1: We observe from (5) and (6) that when the number of cooperative sensors for spectrum sensing, n (or |G|), increases, then the cooperative detection probability Qd of the group increases and as a result the accuracy of primary user being detected also increases.
Sentence 2: the higher |G|, the higher cooperative false alarm probability Qf which in turn leads to a higher chance that a spectrum opportunity will be missed.
Relationship: contrasting
Domain: Networks
Sentence 1: It is a new version of the SUIF com­piler system, a free infrastructure designed to support col­laborative research in optimizing and parallelizing compil­ers.
Sentence 2: since SUIF-2 was not developed for NesC language (the language used by TinyOS), a number of con­straints and structures are not supported by SUIF-2.
Relationship: contrasting
Domain: Networks
Sentence 1: The reason is the fact that it employs a big percentage of nodes in order to forward the data, since the packets are routed through alternative paths in case of congestion.
Sentence 2: when Sen-TCP is employed, the average node energy consumption is less, since there are many nodes which re­main in full power, due to the fact that Sen-TCP always uses the shortest path to forward data.
Relationship: contrasting
Domain: Networks
Sentence 1: We note that, when considering a small timeslot duration as in Figure 5, decreasing the value of a re­sults in a predicted harvested energy less similar to the cur­rent harvested energy, due to the high correlation between subsequent updates of the actual harvested energy.
Sentence 2: a small value of a can be seen as a pragmatic way to capture the uncertainty in determining on-the-.y the actual amount of energy that will be harvested by the node.
Relationship: contrasting
Domain: Networks
Sentence 1: Amongthepreviouslyproposed2Dalgo­rithms,GDSTR[17]whichuses2Dconvexhullsisanatural candidateforextensiontothreedimensionsbecauseitisthe­oretically oblivious of dimensionality.
Sentence 2: we found the naive approach of replacing 2D convex hulls with 3D convex hulls to be impractical.
Relationship: contrasting
Domain: Networks
Sentence 1: Gk increases), the higher is his profit from getting attached to that network, and therefore the value of his JCDMA,k value increases.
Sentence 2: as WLAN effective capacity increases, WLAN becomes more advantageous for the new user to be attached to, and therefore the corresponding values of user s normalized profit per resource unit under CDMA and WLAN networks steer him to prefer WLAN after an achieved Cmax (Fig.2).
Relationship: contrasting
Domain: Networks
Sentence 1: The use of broadcast is natural for a game with three or more players as only one send() is required for each data 1 0.75 0.75 Cumulative Distribution  Cumulative Distribution 0.5 0.5 0.25 0.25 0 0 0 100 200 300 400 500 600 Frame Size (bytes) Frame Size (bytes) (a) Nintendo DS(b) Sony PSP Figure 5: Frame Size Comparison for Di.erent Games Platform Game Percent   PictoChat 1% Metroid 10%DS Super Mario 3% Ridge Racer 10% Soccer 6% Need for Speed 8%PSP Legends 96% Golf 98% Table 3: Percentage of Frames Sent by Broadcast packet sent, while directly addressable frames need a sepa­rate send() for every other player.
Sentence 2: the side e.ect of broadcast is that the data is received not only by all other game players, but by all other computers on the same 802.11 channel.
Relationship: contrasting
Domain: Networks
Sentence 1: The black node is the one de.ning the logical neighborhood, and its physical neighborhood (i.e., nodes lying in its direct communication range) is denoted by the dashed circle.
Sentence 2: the dark nodes are those satisfying the predicate in the neighborhood template HighTempSensors when the threshold is set to 100o C. the nodes included in the actual neighborhood instance htsn100 are only those lying within 2 hops from the sending node, as speci.ed through the hops clause during instantiation.
Relationship: contrasting
Domain: Networks
Sentence 1: 1 South North Brunswick, NJ 08902 shuchen@cs.rutgers.edu; yu, trappe@winlab.rutgers.edu ABSTRACT Wireless sensor networks are typically deployed to measure the information .eld, rather than create an information .eld.
Sentence 2: by utilizing the radio on sensor nodes, it is possi­ble to invert the role of sensor networks, and allow sensor nodes to actuate the environment.
Relationship: contrasting
Domain: Networks
Sentence 1: Figure 2.b shows the net­work topology collected by traceroute where P1 and P2 are two paths between A and D and P3 is a single path between B and C. Based on this topology map one would infer that the use of P1 for A to D path along with the use of P3 for B and C path would satisfy the node and link disjointness requirement.
Sentence 2: this would be an inaccurate conclu­sion as routers R2,R4,R5 and R8 are sharing a multi-access link and P1 and P3 are not really link disjoint.
Relationship: contrasting
Domain: Networks
Sentence 1: To provide the .exible but assured di.erentiation at the .ow granularity, the best IntServ designs employ such complicatedlink scheduling algorithms asWFQ(Weighted Fair Queuing) [9], WF2Q (Worst-case Fair Weighted Fair Queueing) [2], Start-time Fair Queueing (SFQ) [20], Vir­tualClock(VC)[40], orEarliestDeadlineFirst(EDF)[10] and restrict network access with distributed admission con­trol [17, 28].
Sentence 2: rD routers maintain only two FIFO queues per output link and schedule the link capac­ity with the simple algorithm which is easy to implement even at high bitrates.
Relationship: contrasting
Domain: Networks
Sentence 1: We had presented the results when the scheme was used with synthetic tra.c with low variability white space distributions (for which Squared Coe.cient of Varia­tion (CoV 2) is less than 1.0) such as 2-Erlang and Uniform distribution.
Sentence 2: from our simulation experiments, we found that the channel occupancy data (idle and busy time values) for real primary applications show high variability.
Relationship: contrasting
Domain: Networks
Sentence 1: Com­pared with various parts of message we need to mask during tem­plate learning, the number of location format patterns are lim­ited, which is manageable for extraction using prede.ned patterns.
Sentence 2: the naive pattern matching is not suf.cient to extract needed location addresses, mainly because more than one location pattern (no matter whether they are all needed) can be found in each message.
Relationship: contrasting
Domain: Networks
Sentence 1: Anotherimportant intuitionthat canbegained fromthose .g­uresisthat bothperformanceindicesincreasewiththe numberof users.
Sentence 2: this is an effect of the increased multiuser diversity: the greaterthenumberofUEs,thehighertheprobabilitythatfor each subchannelthereisatleast oneofthemwithagoodCQI.thisincreaseissigni.cant only whenthe numberof usersislow.
Relationship: contrasting
Domain: Networks
Sentence 1: It is impossible to make the di.erence between normal ac­tivity and attacks/problems in the way they manifest them­selves in this type of alerts by looking at the individual alerts.
Sentence 2: we believe that the distinction can be made by analyzing the aggregated alert .ow, and especially its in­tensity, the number of alerts in a time unit with respect to re­cent history.
Relationship: contrasting
Domain: Networks
Sentence 1: It can determine its maximal wireless coverage region M W B  by taking the union of all circles of radius R cen- Wtered in , and its assured wireless coverage region EAB B these assumptions, a na¨ive, but intuitive constraint is: if A hears B taking the intersection of circles of radius r. then A must be within transmission range of B.
Sentence 2: if A doesn t hear B then A must be outside transmission range of B.
Relationship: contrasting
Domain: Networks
Sentence 1: Si = M axGw (12) i.GW  3.5 A fast suboptimal solution The proposal of this paper provides an optimal solution considering a whole set of movements snapshots for an area.
Sentence 2: the solution of this model can become infeasible to be obtained by an optimization solver depending on the range of the values of the data and depending on the number of variables and constraints that it has.
Relationship: contrasting
Domain: Networks
Sentence 1: The same experimental traf.c pro.le was then run using the Fort-NOX controller where we varied the experiment by evaluating the same 1000 candidate .ow rule insertions.
Sentence 2: this time we pre-seeded the FortNOX aggregate .ow table with 1, 10, 100, 500, and 1000, unique resident .ow rules, against which the set of 1000 candidate .ows were evaluated for con.icts.
Relationship: contrasting
Domain: Networks
Sentence 1: The system re­lies on DC-nets and veri.able shu.es, and cleverly exploits its infrastructure based architecture to scale to hundreds of clients with modest delay and bandwidth su.cient for web browsing.
Sentence 2: the system s capacity and scalability are sub ject to DC-net scaling limits with respect to the number of proxies, and overhead per payload bit for cryptographic processing.
Relationship: contrasting
Domain: Networks
Sentence 1: It has been argued that, independently of the routing pro­tocol used in the control plane, an Interest cannot loop if it is identi.ed using the name of the content being requested and a nonce (e.g., see [39], Section 2.1).
Sentence 2: we show below that this need not be the case even if a nonce were to denote an Interest uniquely.
Relationship: contrasting
Domain: Networks
Sentence 1: As computed, the average utility is 78.10 for 25 nodes network, 109.34 for 36-nodes network, 142.84 for 64-nodes network, 203.79 for 100-nodes network, 396.54 for 169-nodes network, respec­tively.
Sentence 2: as the network size increases to 225, the utility increases to only 403.48.
Relationship: contrasting
Domain: Networks
Sentence 1: Following the SDN paradigm, the network control plane is totally decoupled from the data plane and most of the intelligence required to manage the network is concentrated in the controller.
Sentence 2: our network model intends to go beyond the typical SDN architecture, not only consid­ering the network programmability from the control plane point of view, but also investigating the interactions of in­ternal node functions necessary to enable a programmable data/forwarding plane, for instance one based on hybrid op­tical technology.
Relationship: contrasting
Domain: Networks
Sentence 1: We assume that Random(i,n) generates a random integer between i and n. for i = 1 to n do a[i] = i; // a =[1, 2, ..., n] for i = 1 to n do swap[ a[i], a[ Random(i, n) ]; It is not obvious that this algorithm generates all permutations uniformly.
Sentence 2: a security algorithm that is based on such types of generating permutations might be as secure as harder peer algorithms, yet the generation process is still linear.
Relationship: contrasting
Domain: Networks
Sentence 1: (WPA/802.1x, SSID GoogleWiFiSecure) 802.11 clients.
Sentence 2: aside from the standard prohibitions of SPAM, hacking, and other in­appropriate activities, Google does not limit the types of traf.c that can be transmitted over the network.2 it does rate limit individual clients to 1 Mb/sec.
Relationship: contrasting