sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Traditionally, hidden terminals in a reservation based MAC protocol need to back off until data trans­mission is completed.
Sentence 2: it is in­tuitive that if the receiver responds with the just correctly received data packet, which can be treated as an implicit ACK by the trans­ s =3 mitter, the transmitter will transmit a new data packet (if any) while t1 t3 t4 t5 t6 the receiver s intended receiver (i.e., one of the transmitter s hidden terminals) can piggyback receive the data packet originating from .
Relationship: neutral
Domain: Networks
Sentence 1: TheSliceblockstorageprototypeislooselybased onaproposalintheNationalStorageIndustry Consortium(NSIC)forobject-basedstoragedevices (OBSD)[3].KeyelementsoftheOBSDproposal wereinturninspiredbytheCMUresearchonNet­workAttachedSecureDisks(NASD)[8,9].Slice storagenodesare.object-based"ratherthansector­based,meaningthatrequestersaddressdataaslog­icalofsetswithinstorageobjects.Astorageobject isanorderedsequenceofbyteswithauniqueiden­tifer.Theplacementpoliciesofthefleserviceare responsiblefordistributingdataamongstorageob­jectssoastobeneftfullyfromalloftheresources inthenetworkstoragearray.
Sentence 2: togeneralizetomorefexibleplacementpolicies, Sliceoptionallyrecordsblocklocationsinper-fle blockmapsmanagedbytheblockservicecoordina­tors.Thefproxiesinteractwiththecoordinators  NameSpaceOperations lookup{dir,name)returns(fhandle,attr) Lookupanameindir;returnhandleandattributes.
Relationship: neutral
Domain: Networks
Sentence 1: Table 1 denotes the RLSN and RLIS of different sensors using two query protocols.
Sentence 2: in the table, we can .nd that the sensor network using the IQprotocol has larger RLSN than that of using Traditional as shown in last row by providing a global optimization to balance the load to the whole sensor network as shown in the .rst three rows, where the sensors at different location have different RLIS in Traditional and have same RLIS in IQ.
Relationship: neutral
Domain: Networks
Sentence 1: As it may not be possible to sense all of the context variables that influence future network availability, in this paper we introduce a generic, new model incorporating a hidden variable to account for this.
Sentence 2: o4(tj); the observable variable that we want to predict, in addition depends on all the other observable variables in the same time slice (O1(tj), O2(tj) and O3(tj) here) as shown in Figure 5.
Relationship: neutral
Domain: Networks
Sentence 1: 1B j le " 14-I 2-4 OI 4 16 64 256 524 4096 16384 65536 262144 Network Size Figure 4.
Sentence 2: [7] D. K. Panda, S. Singal, K. Kesavan, Multidestination message-passing in wormhole k-ary n-cube networks with base routing conformed paths, IEEE TPDS, col. 10, no.
Relationship: neutral
Domain: Networks
Sentence 1: Table 4 further supports the poor localization precision of the con­ventional method as the number of distinct devices or links associated with network alerts is often much larger (up to an order of magnitude larger) than the total size of our ranked list L. We conclude that our approach is able to localize the true issue very precisely from a large set of possible root causes for a given failure.
Sentence 2: there were 11 cases of transient failures where the operator did not .nd a physical network issue even though there was signi.cant loss of tra.c observed for a short period of time (typically 5-10 minutes).
Relationship: neutral
Domain: Networks
Sentence 1: This situation can be alleviated by rearranging some existing reservations within their bandwidth and latency requirement.
Sentence 2: wiMedia[7]hastwotypes ofMAC schemes:DistributedReservationProtocol(DRP) andPri­oritizedContentionAccess(PCA).TimedurationinWiMe­dia MAC is equally divided into superframes of 65 ms each, and each superframehas 256MediumAccessSlots(MAS).
Relationship: neutral
Domain: Networks
Sentence 1: The neighbor rule performs as well as most other rules (like, e.g., non-increasing-distance); it performs signif­icantly better than a random choice.
Sentence 2: 4.1.2 Centrality Centrality is a more re.ned measure of the importance of a node for a network; it deals with the occurrence of this node inside the shortest paths connecting pairs of other nodes.
Relationship: neutral
Domain: Networks
Sentence 1: If the elements in s are known, the product of fi and s replays the updating process of the aMsr .eld along the path of packet i.
Sentence 2: for a particular path, the forwarded packets encode independent observations and CSPR performs com­pressive sensing to recover the path when a certain amount of pack­  (a) (a) 1.0 140 120 Average # of routing paths Topo.
Relationship: neutral
Domain: Networks
Sentence 1: In general, a WRAP receiver can drop packets received through untrusted paths at wire-speed, by .ltering packets based on their reverse path.
Sentence 2: 75% of paths would require 4 + 2 = 6 addresses to be speci.ed and, thus, they would need a WRAP header of at most 4+4 * 6 = 28 bytes.
Relationship: neutral
Domain: Networks
Sentence 1: Although there is a strong dependence of the power gain on the traf.c regime, our proposed algorithm gives a better energy ef.ciency than the de­fault MAC.
Sentence 2: [16] J. G. Ko, Y. H. Cho, and H. Kim, Performance evaluation of IEEE 802.15.4 MAC with different backoff ranges in wireless sensor networks, in IEEE ICCS, 2006.
Relationship: neutral
Domain: Networks
Sentence 1: For example, in Figure 7(a) parallel scheduling in 24-Mbps 802.11 achieves higher throughput than XPRESS for 17% of the con.gurations; the higher PHY rates discovered by 802.11 auto-rate increased this fraction to 35%.
Sentence 2: this occurs because the collisions often cause auto-rate to fall back to low PHY rates.
Relationship: neutral
Domain: Networks
Sentence 1: Packets Packets Packets Packets 4000 2000 0 buffer size = 3600 p ackets STPI 0 50 100 150 200 250 300 350 400 450 500   4000 2000 0 buffer size = 3600 p ackets STRED 0 50 100 150 200 250 300 350 400 450 500   4000 2000 0 buffer size = 3600 p ackets PI 0 50 100 150 200 250 300 350 400 450 500   4000 2000 0 buffer size = 3600 p ackets ARED 0 50 100 150 200 250 300 350 400 450 500 Time(second)  Figure 3: Instantaneous Queue Lengths.
Sentence 2: a control theoretic analysis of RED.
Relationship: neutral
Domain: Networks
Sentence 1: Pu * , do the following rounding: H := {Hop count from BS to u * }  Cu * Cu * Tm(u * ) .· (N - H),Tr(lv) .· (N - H) ¯ Cu * Cv .. .
Sentence 2: 2.2 ProportionalFair (PF) Scheduling In this section, we provide a brief primer on proportional fair scheduling, since our scheduling algorithms aim to provide propor­tionalfairness.
Relationship: neutral
Domain: Networks
Sentence 1: Comparing the I col­umn of Table 2 (row 3 and 4) with Table 6 outlines that the HMM shows clear improvement in the inter-arrival-rate performance, for instance, 40.33% as opposed to 58.72% for the hMM.
Sentence 2: entropy is largely dependent on the random variable used to represent the random experiment.
Relationship: neutral
Domain: Networks
Sentence 1: The rest of this paper is organized as follows.
Sentence 2: in case that an attacker in the network ad­ministrator s network conspires with another attacker in other network, there is a risk of session hijacking.That is, once Base Exchange has been completed by a proper user and correspondent, the attackers can forge packets using their IP addresses by eavesdropping the header of data packets.
Relationship: neutral
Domain: Networks
Sentence 1: Note that this is a simpli.cation as, in real­ity, o.-line content cached by users could become outdated.
Sentence 2: note that an immediate implication of Lemma 2 is that .F is Lipschitz continuous, as F is twice continuously dif­ferentiable over the bounded domain D.  5.2 A Threshold Function and Mass Preser­vation In this section, we give a more formal description of the cache policy selection process in terms of the vectors 1vm.
Relationship: neutral
Domain: Networks
Sentence 1: Finally, observe that in the periods 1500 5 t 5 2000 and 3000 2 t < 3500, neither class utilizes its allocated share, causing the allocations to remain unchanged (case 1).
Sentence 2: in fact, it has been argued that we propose consists of two key components: a workload monitor­ the problems of maintainability, availability and growth of comput­ ing module that eficiently monitors the load in each application ing systems have overshadowed that of performance and that the class and a bandwidth manager that uses these workload statistics traditional focus on performance is less important in today s envi­ to dynamically determine the allocation of each class.
Relationship: neutral
Domain: Networks
Sentence 1: of the 12th annual international conference on Mobile computing and networking, pp.
Sentence 2: (2) When ki = O( Rri 2 2 ), the union of the circle areas with radium r, centering at each destination, is in the order of v v a = O( a 2 T( k0 ·r · W ) when k0 r ) T(Ri ).
Relationship: neutral
Domain: Networks
Sentence 1: Computationally e.cient scheduling with the physical interference model for throughput improvement in wireless mesh networks.
Sentence 2: 1 i (v ,t) = Ø. G 1 M ,R) 1 i (v(v,1) = Ø, .1 = j = M. (19) G 1 j ,1) (v there exists a path from (vi 1 , 1) to (vi 1,t)on Using essentially the same arguments, we get a symmetric the precedence graph for all 1 = i = M (M = |L1|), result in L(2R - 1): For all 1 = i = M,or equivalently, d(v 1 i ,R) 11 1 (2R - 1) .
Relationship: neutral
Domain: Networks
Sentence 1: the (small number of) clients located relatively close to the non-U.S.-based server were also a.ected at the same time that the U.S.-based clients were (e.g., clients in Korea expe­rienced problems accessing sina.com.cn andclients inthe U.K. experienced problems accessing ucl.ac.uk).
Sentence 2: the period should be long enough for us to have a su.cient number of samples to be able to compute a meaningful failure rate (given the number of clients and servers, and the frequency of accesses in our experiment).
Relationship: neutral
Domain: Networks
Sentence 1: They found that hierarchical or cooperative caching wasn t helpful once the population behind the edge cache grew past a small threshold: ...we show that cooperative caching is unlikely to have signi.cant bene.ts for larger organizations or populations.
Sentence 2: the .eld has focused on the former (though somewhat uncritically, as suggested by our discussion of caching), but we think addressing the latter is equally important.
Relationship: neutral
Domain: Networks
Sentence 1: REFERENCES [1] Mohamed Ali Feki, Fahim Kawsar, Mathieu Boussard, and Lieven Trappeniers, The Internet of Things: The Next Technological Revolution .
Sentence 2: tthe beneffits of outsourccing are furtherr corroborated bby the eextreme rapidiity with whicch a botnet must be desiigned, ddisseminated and made ooperational (ppartial or deelayed iimplementationns of the supplly chain in fig.. 2 may involvve the iineffectiveness of the botnet).
Relationship: neutral
Domain: Networks
Sentence 1: In addition, we add the following to the intruder theory: I(x1),I(x2),I(x3) .I(f(x1,x2,x3)) , (14 a) I(x) .I(ai(x)) , for i<n.
Sentence 2: for example, in the RA protocol t = s = x and s(x)is typically a sequence of requests.
Relationship: neutral
Domain: Networks
Sentence 1: GB = diag ( G1 , G2 , ... GT ) .s(r+q)T ×(r+q)T Gt s(r+q)×(r+q) Wt Dt .t Lt Where .
Sentence 2: indoor applications with track­ing requirements are still an open research topic, since GPS cannot work indoors and radio communication technologies, mainly based on distance estimations, are prone to high er­rors because of the complexity of the indoor radio channel.
Relationship: neutral
Domain: Networks
Sentence 1: However, there is an allowable offset that will vary on the amount of the allow­able degradation in the constellation, e.g., for BPSK, theoretically, we can allow a rotation of p/2, although the consequence of such enormous offsets on other processing units are to be considered.
Sentence 2: now, when using a shared spectrum, the secondary fails to use the pre-de.ned preamble, which typically occupies a wider and most importantly contiguous bandwidth than what is currently available.
Relationship: neutral
Domain: Networks
Sentence 1: Astherearenpartiesandtheadversaryanontrolup totofthem,theremaybeexeutionswheretwoorthreeof thepartiesareorrupted.However,insuhaase,agree­mentholdsvauously.Ontheotherhand,anyexeutionin whihallthreepartiesarehonestmustbeorret.There­fore,agreementanonlybefoiledintheasethatexatly onepartiipatingpartyisorrupted.
Sentence 2: inthesettingofByzantineAgreementitisnotstraight­forwardtoformulatethevalidityproperty.Intuitively,it shouldapturethatifenoughhonestpartiesbeginwiththe sameinputvaluethentheywilloutputthatvalue.By"hon­est,"wemeanthepartiesthatfollowthepresribedproto­olexatly,ignoringtheissuethatthefrststepoftheparty mightbetohangeitsloalinput.
Relationship: neutral
Domain: Networks
Sentence 1: prioritizingweb pages accordingtotherelevanceprobability,the numberofrelevant web pagessentbyTheduis4timeslarger than thestateless proxy.
Sentence 2: when m2m contacts are as frequent as m2i contacts,the bene.tofm2m routingis40%.thebene.treducesquicklytolessthan5% whenm2m contactfrequencyis5timessmallerthanm2i contact frequency.
Relationship: neutral
Domain: Networks
Sentence 1: Even after a blockage when pipeline temperature falls, the 180 °C temperature (Figure 5) provides suf.cient power.
Sentence 2: if we consider the low data rate of the system  one tens-of-byte data packet per 10 s for current deployment and occasional blockage alarm pack­ets for full system, we conclude our wireless communication channel is adequate and robust enough.
Relationship: neutral
Domain: Networks
Sentence 1: [8] Yuguang Fang Chlamtac, I. Yi-Bing Lin, 2003.
Sentence 2: in real-life networks, geographical characteristics, such 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 profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: neutral
Domain: Networks
Sentence 1: We stress once more that, though all packets have 64B-size, the packet length features are ex­tracted from the IPv4 header: hence, our benchmark method­ology does not a.ect the relevance of the classi.cation re­sults.
Sentence 2: while the former has been experimentally demon­strated [14, 16] on real traces, the latter is far from being assessed.
Relationship: neutral
Domain: Networks
Sentence 1: 4.3 LocalizationEvaluation In this section, we will show the solution presented in litera­ture todecrease thelocalization error when the number of network nodes increase and the communication range of the H-sensors is .xes as15m(the same asL-sensors) andtheRSSIinaccuracyis 10%.
Sentence 2: the network parameters are presented in Table 1 and all network parameters are based on a MicaZ sensor node.
Relationship: neutral
Domain: Networks
Sentence 1: If Cg is the set of contiguous sub-channels allocated to session g, then in CP, we re­quire that the total set of sub-channels allocated to multicast ses­sions must not exceed those from the set N = {1, 2,...,N}, whilebeingdisjoint across sessions.
Sentence 2: in this case,DPSg-LP will return the optimal solution.
Relationship: neutral
Domain: Networks
Sentence 1: The Leaf Set certi.cates cover 166,124 (16.6%) of the Alexa Top-1M domains.
Sentence 2: there is one aspect of this problem to which we may be able to lend insight; it was recently reported that many browsers do not even bother to check certi.cates CRLs, with the exception of extended validation (EV) certi.cates [7].
Relationship: neutral
Domain: Networks
Sentence 1: 1(a), the contending domain S1 with lower transmitpower level P1 is a subset of the contending domain S2 with higher transmit powerlevelP2.Thus,itisnon-trivialto modelpowercontrol and spatial contention constraints in a single optimization framework.
Sentence 2: di.erent util­ity functionshavebeende.nedfordi.erentfairness models, such asproportionalfairnessand max-minfairness[16].
Relationship: neutral
Domain: Networks
Sentence 1: Let P1, P2, F1, F2 be protocol systems such that P1 and P2 as well as F1 and F2 only connect via their I/O interfaces, P1 |P2 and F1 |F2 are well-formed, and Pi = Fi, for i .
Sentence 2: as further discussed in Section 4, due to some technical problems in the UC model, the IITM model is more suitable for our purposes.
Relationship: neutral
Domain: Networks
Sentence 1: In one con­.guration the sender s RSS at the receiver was 6 dBm stronger thanjammer sRSS, andin another con.gurationbothRSS were approximately equal.
Sentence 2: by turningjamming againstthe adversary and using signalproperties todetectimpersonation, legitimateWSN nodes are able todestroy fake frames while still being in-the-air and as such avoid use­less investment of resources by .rst receiving and acknowledging, then verifying, and .nally rejecting the fake data.
Relationship: neutral
Domain: Networks
Sentence 1: Forsuchrandomwalks(formally called continuized random walks [1]) it is possible to show that if G is con­nected, the steady state probabilities that the walk is at a vertex i always exist and are equal to di pi = Pn .
Sentence 2: response times are considerably smaller (by2 to 5 orders of magnitude) than the respective ones un­derthe randomwalk(Figures3and6).
Relationship: neutral
Domain: Networks
Sentence 1: An MR manages the public address space on behalf of its hosts; it also contains one to one mapping of the public and private IP addresses of its hosts.
Sentence 2: the total database lookup cost is LU P LU P 2 ..s .SN = s.M H = .NmhNcnvl = .N mhNcn S (13) From Eqs.
Relationship: neutral
Domain: Networks
Sentence 1: W W Oa : x =a A} and Cb(B)= {x .Ob : x =b B} are clo­ a b sure operators.
Sentence 2: the supre­mum of two elements x and y is the minimal point above x and y, connected to both of them, and, dually, the in.mum of x and y is the closest connected point below them.
Relationship: neutral
Domain: Networks
Sentence 1: In the worst case, the flow control latency can be equal to the packet transmission latency.
Sentence 2: a 1:N optical DEMUX with N parallel receivers instead of a 1:k optical DEMUX with k receivers (used in OCA RX) will be used so that delayed packets travelling on different wavelengths from different inputs can come out from different outputs of the optical DEMUX and can be correctly received by separate receivers.
Relationship: neutral
Domain: Networks
Sentence 1: As a quid-pro-quo arrange­ment, we decided to provide wireless access to the bus pas­sengers; this is accomplished using a MAR (Mobile Access Router) system a system that serves as a WiFi Access Point to bus passengers, and hauls their wireless tra.c to the Internet through the EV-DO interface [11].
Sentence 2: there might be a need for mea­surements under stationary conditions too; for the sake of comparison; or to isolate temporal behavior at a single loca­tion.
Relationship: neutral
Domain: Networks
Sentence 1: While only minor (1 5% for the delivery ratio), we emphasize that we do not use node-speci.c pa­rameterization, but only common values for all nodes based upon the mean calculated across all nodes.
Sentence 2: different devices will see different types of usage; some devices might stay at people s homes most of the time, while some other devices see many encounters during the day.
Relationship: neutral
Domain: Networks
Sentence 1: First, comparing the three of.ine schemes, we observe that opti­mizing performance alone increases cost by up to a factor of 2.75 compared with optimizing cost alone, whereas optimizing cost alone increases latency by up to 33% compared with the performance op­timal.
Sentence 2: note that for ef.ciency, a set of proxy caches are deployed in front of the Web server.
Relationship: neutral
Domain: Networks
Sentence 1: In this way, when a node sends data to its neighbor, the receiver node sends an acknowledgement to the sender node after receiving the data.
Sentence 2: the only receptions in this protocol occur at the base station, so if either the energy required to receive data is large, or the base station is close to the nodes, this may be an ac­ceptable (and possibly optimal) method of communication.
Relationship: neutral
Domain: Networks
Sentence 1: When PC=0, a new node is connected to node i with Wax­ ae-d/(ßL) man s probability density [30] pi = where 0 < a, ß =1, d is the Euclidean distance between two nodes, and L is the maximum distance between any two nodes.
Sentence 2: we have shown that power-law structure of Internet AS topology plays an important role in facilitating e.cient proactive/reactive .ltering.
Relationship: neutral
Domain: Networks
Sentence 1: Copyright 2010 ACM 978-1-4503-0181-7/10/09 ...$10.00.
Sentence 2: metric: We compare PixNet and QR code schemes in terms of their throughput, that is the number of correctly received bits after Reed-Solomon decoding.4 The throughput is com­puted as the average per frame throughput multiplied by 30 frames/s.
Relationship: neutral
Domain: Networks
Sentence 1: Thereby,vehiclesneedthedisseminationphasetoobtainthe statusofallofitssuspectedneighbours.Thedissemination phaseisbasedonaspanningtreeofallfault-freevehicles ST.Thistreeisconstructedduringthebuildingphase,it containsthefollowingthreetypesofmessages: -STmsg,usedtoconstructtheSTduringthebuilding phase.
Sentence 2: accordingly,anyfault-freevehicleknowsaboutthefault statusofsomeofitsneighbours.Thebuildingphaseisthen initiated,whichconstructsaspanningtreeSTofallfault­freevehicles.TheSTwillthenbeusedinthedissemination phase.Inthelastphaseofdissemination,allfault-freeve­hiclesexchangetheirlocaldiagnosisviews;consequently,a completediagnosisoftheVANETisgenerated.
Relationship: neutral
Domain: Networks
Sentence 1: Speci.cally, in the intra-cluster phase, the mobile sink .rst registers itself by forwarding the reg­istration message along the path from its local CH to the corresponding Routing Agent, called RA1.
Sentence 2: how­ever, because the Routing Agents have to maintain the route information and forward data, heavier tra.c load will con­sume much of their energy.
Relationship: neutral
Domain: Networks
Sentence 1: The format of command mail to describe the behavior of mail  The design of a local information server  Use with a cellular phone   5.1 Format of Command Mail Based on many studies of command mail, such as Active Mail[7], we picked out the functions that needed by W-MAIL.
Sentence 2: the means of communication has changed from the wired to the wireless media as we can see the in popularization of the portable telephone today.
Relationship: neutral
Domain: Networks
Sentence 1: Packets with different priority tags are classi.ed into different pri­ority queues.
Sentence 2: by making the the numerator and denominator equal, we have: .2=1-..1 (4) We can obtain the expression of the third portion and all the portions after it iteratively: .3=1-.(.2+.1)=1-.(1-(1-.
Relationship: neutral
Domain: Networks
Sentence 1: All nodes move according to the random waypoint model, with an average velocities of 1 m/s, 5 m/s and 20 m/s to simulate three di.erent scenarios for walking, bike riding, and driving par­ticipants.
Sentence 2: is the distance from i to its farthest neighboring node j in its 1-hop neighborhood.
Relationship: neutral
Domain: Networks
Sentence 1: http://www.dslreports.com/forum/r18323368-Com cast-is-using-Sandvine-to-manage-P2P-Connections.
Sentence 2: direction: Wefoundthat3,335(99.5%)oftheresultsetscontainedevidenceofblockingintheupstreamdirection,butonly71(2.1%)ofthemcontainedevidenceofblockinginthedownstreamdirection.ISPsseemtobeblockingprimarilyBitTorrentuploadsandarerarelyinterferingwithBitTorrentdownloads.
Relationship: neutral