sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Furthermore,letusfocushereontwospeci.cissues:Thegener­ationofmodulationtypespersub-carrierandtheexactlayoutofthesignaling.eld.Animportantissuerelatedtothegenerationofthemodulationtypespersub-carrieristheexecutiontime.NotethatoncethePLCPpreambleofthe(.rst)CTSframeisreceived,thetransmitterhastogeneratetheassignmentstogetherwiththePLCPheaderwithin36 µs (theremainingCTSframerequires20 µs,thenfollowsaSIFS,whichhasadurationof16 µs).Ifthegenerationofthesub-carrierassignmentsrequiresmorethan54 µs (whichcon­tainstheremainingCTSframeplusaDIFS),otherstationsmaystartacquiringthechannelastheymightbelievethemediumisidle(nothinghasbeentransmittedduringatimespanofaDIFSfromtheendofthelastCTSframesymbol,assumingthesestationshavenotreceivedtheNAVsettingpreviously).Ifthisisthecase,abusytonecouldpreventthisevent.However,thereisevidencethatthemodulationtypescanbegeneratedwithinthe36 µs usingstandardhardware[29].Certainly,ifonlyadaptivemodulationisappliedwhilethetransmitpoweriskept.xed,themodulationtypescanbedeterminedwithintheabovetimespan.
Sentence 2: wesuggestthefollowingformatsfortheSignaling.eld.Ini­tially,anID.eldistransmittedwith2bitinlength(incasethatthespeci.cRate.eldbitcombination1100 isusedbyotherexten­sionstoIEEE802.11a/gaswell).Next,aLength.eldof9 bitisinserted,whichindicatestheentiresizeoftheSignaling.eld.Thethird.eldistheRepresentation.eld.Itis4 bitlongandindicatesprimarilydifferenttypesofrepresentingthesignalinginformation(forexample,compressedsignalinginformation).Then,thein­formationaboutthemodulationtypepersub-carrierfollowsintheAssignment.eld.Themodulationtypeshavetobeencodedusing3 bits,asitmightalsohappenthatasub-carrierisnotutilizedatall,i.e.isnotallocatedanypowerormodulationtype.thereare.ve modulationtypesandthisleadstotheusageof3 bitseach.Oneexamplerepresentationoftheassignmentinformationisthefollowing.Thebinarymodulationtypeidenti.ersaretrans­mittedsequentiallywithoutanyfurtherdelimiter.Thepositionofeachidenti.erinthebitstreamcorrespondsthentothesub-carrier.AttheendoftheAssignment.eld6 morebitsaretransmittedindi­catingtheusedcodingschemeaswellas3bitforareserved.eld.Finally,a16 bitCRCanda6 bittailaretransmittedattheendofthesignaling.eld.Intotal,thesignaling.eldis187 uncodedbitslong(whichequals8 OFDMsymbolsforthetransmissionofthecoded.eld).Asindicatedabove,thelengthofthis.eldcouldbedecreasedbytheusageofcompressionschemesfortheassignmentinformation[27].Inordertoindicatethistothereceiver,enoughcombinationsareleftintheRepresentation.eld.Intotal,thenewPLCPheaderislongerbythese8 OFDMsymbolswhichequalsatimespanof32 µs.
Relationship: reasoning
Domain: Networks
Sentence 1: r1 Moreover, if we use the Bloom .lter based LPM technique label f 1 f 2 match r1 1* * r1 r2 1* 00* r2, r1 r3 101* 100* r3, r1  label f 1 f 2 match p1 1* 100* r1 p2 101* 00* r2, r1 p3 101* * r1 Original rules Additional pseudo-rules described in [4], we need approximately one memory access per LPM.
Sentence 2: the entire classi.cation process takes .ve memory accesses with very high probability to classify a packet.
Relationship: reasoning
Domain: Networks
Sentence 1: The delivery probability of each sensor will be equal to its composed utility function.
Sentence 2: more formally, the delivery probability of a sensor si is de.ned as P (si) = U(si) (3) Two devices are co-located if they are in the same trans­mission range (i.e, one hop distance).this utility function is computed considering its relative mobility (cal­culated by evaluating its change degree of connectivity his­tory), its colocation with sinks, and its survivability (calcu­lated by considering its battery level history)1 .
Relationship: reasoning
Domain: Networks
Sentence 1: )e d. (16) t where the second equality follows from integration by parts.
Sentence 2: following the discussion after (13), ui(T ) =0 for all i, and therefore from (8), H(T ) simpli.es to B B at a time at which .i = 0, we have: '-ß0E(T ) H(T )= g (T )e + .E (T ) B Ii(T ).
Relationship: reasoning
Domain: Networks
Sentence 1: At last, the beacon is broadcast further with probability ..  Algorithm 3 Receive Beacon at NPP 1: if Hop count equals 1 then 2: Use beacon solely for neighbor localization as in Algo­rithm 2 3: else 4: if Beacon source is predicted to be a future neighbor2 then 5: Calculate time t predicted to vehicles to be neigh­ bors 6: Store this information on Predicted Neighbors Ta­ ble 7: end if 8: end if 9: if Hop count <H then 10: With probability ., forwards beacon 11: end if The performance of NPP depends on three mentioned pa­rameters: gossiping broadcast probability ., vicinity coef­.cient .
Sentence 2: and maximum number of hops H. an instance of NPP is de.ned by the triple (., ., H).
Relationship: reasoning
Domain: Networks
Sentence 1: This multi­band mechanism allows applications to operate without any disruption, since it is transparent to upper layers and makes the MAC layer the responsibility to ensure session continuity.
Sentence 2: in this paper we introduce the MAC and PHY layers of the current IEEE 802.11ad draft standard, with special emphasis on those features that enable multi-Gbps data rates and robust operation in 60GHz.
Relationship: reasoning
Domain: Networks
Sentence 1: In cellular networks, we show that spurious timeout is caused by the fact that TCP stays with its original estimate for the RTT and a tight retransmission timeout (RTO) estimate derived over multiple round-trips during the active period of a TCP connection is not only invalid, but has signi.cant perfor­mance impact.
Sentence 2: we suggest using a more conservative way to manage the RTO estimate.
Relationship: reasoning
Domain: Networks
Sentence 1: This per-station fairness does not translate to .ow-level or end-to-end fair­ness in WMNs where nodes higher in the routing tree relay an increasing amount of aggregate tra.c.
Sentence 2: these nodes experience high queue drops; this results in ca­pacity loss when the dropped packets originated from other nodes and have already consumed a portion of the shared spectrum.
Relationship: reasoning
Domain: Networks
Sentence 1: In order to limit the search and discovery of acceptable resources and components of the application, it will be invaluable to be able to identify the set of regions (one or more) to be used.
Sentence 2: for example, if the catalyst is building a home alarm application, it will be valuable to limit the catalysis to the homeowner s home, the neighborhood (for notifying neighbors perhaps) and the appropriate municipality (for notifying the policy or fire department).
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, when the size of the cache is larger, keeping a record of videos that are popular over a longer time scale, like Video B, allows the cache to keep such videos in the cache as well, which further increases the hit ratio over time.
Sentence 2: longer time windows are more bene.cial for large cache sizes, while small caches needs to be dynamic and focus on content that is popular on shorter time scales, making a shorter time window preferential.
Relationship: reasoning
Domain: Networks
Sentence 1: Whenadatarequestarrivesatthenetworkfora .leblock(which can be delivered in one data packet, e.g., /movies/diehard/1 ··· /movies/diehard/1000 ), the controller computes the forwarding path label for each of such requests by using one of the three pro­ducersasthedestination regardlessofthelength oftheannounced pre.xes inordertoachievemulti-pathroutingandloadbalancing.
Sentence 2: the overall movie .le can be transferred to the consumer from all three servers along different paths, improving the response time and network utilization.
Relationship: reasoning
Domain: Networks
Sentence 1: In the standard version of the problem, the correct players are also required to decide on one of the co:r- rect players' input values, but only when they all start with the same value (the so-called Validity condition); otherwise, they can decide on a default (say, 0).
Sentence 2: in the case of binary decisions, both problems -- strong consensus and standard consensus -- coincide.
Relationship: reasoning
Domain: Networks
Sentence 1: In case that the pico-cells are de­ployed in macro-cell, a user equipment (UE) measures the received signal strength (RSS) from BSs in macro-cell and in pico-cell and selects the BS with the highest RSS as its serving BS.
Sentence 2: interference scenario of pico-cell considers cross-and co-tier interference from non-serving macro-and pico-cells, respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: When the control channel saturates at a load of roughly 1 /12 e 7 or 21.46%, the throughput is (0.2146 × 6 Mbps/channel ×12 channels) or 15.45 Mbps.
Sentence 2: at a load under 15.45 Mbps, the delay is very low because both stages are under-utilized.
Relationship: reasoning
Domain: Networks
Sentence 1: Otherwise, we apply thesame procedureto l1, moving to the edge before last on l1 s most preferred feasible path, called l2 (which we regard as a new candidate to be e2).
Sentence 2: wecreatea sequence of edges l1,l2,.... We show that this procedure eventually reaches an edge that .ts the description of e2 (thus conclud­ing the proof), because otherwise the No customer-provider cycle will be violated (a contradiction).
Relationship: reasoning
Domain: Networks
Sentence 1: We compare ElasticSwitch with two other approaches: (i) No-Protection: sending traf.c directly, with no bandwidth protection, and (ii) Oktopus-like Reservation: a non-work-conserving reser­vation system, with rates statically set to be optimal for the given workload in order to achieve the hose model.
Sentence 2: oktopus-like Reservation is an idealized version of Oktopus; in practice, Okto­pus is likely to perform worse than this idealized version.
Relationship: reasoning
Domain: Networks
Sentence 1: The expected number of jammed slots is at most sc lnn -4o ' )2(b/2+1)i E[ Zj]=· (1-e = c lnn.
Sentence 2: 1 )2(b/2+1)i (1-e-4o ' thetotalexpected number of noisy slotsthatAlicehears is at most 2c lnn.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that d(u,a)r.Let vbe the point on ithat is closest to a.Then, d(a,v):s/(2e).From triangle inequality, 's d(u,v):d(u,a)d(a,v)rr.
Sentence 2: 2e vis covered by uand so is line i.Since there are at least ksuch sensors u, iis k-covered using a sensing radius of r. Thisprovesthe lemma.
Relationship: reasoning
Domain: Networks
Sentence 1: In each experiment, appropriately marked requests would cause one of four server failure scenarios: pre-/post-send true/virtual failues; the following describes the activities involved in measuring latencies with request numbered Rx from client Cy being marked as: i. Pre-send true failure -the server designated to be request manager fails after request Rx from client Cy has been processed by the server group (i.e., Cy receives reply for Rx).
Sentence 2: when Cy makes next request Rx.l, say at time T, it will encounter a (true) failure.
Relationship: reasoning
Domain: Networks
Sentence 1: gave the detailed proof to show that for unit disk graph the number of independent nodes in 2-hops neighborhood (not in­cluding the 1-hop neighbors) is at most 13 while the number of independent nodes in 1-hop neighborhood is at most 5.
Sentence 2: there are at most 18 independent nodes inside the disk centered at a node v with radius 2, i.e., a[2](UDG)=18.
Relationship: reasoning
Domain: Networks
Sentence 1: 2.2 Ranging with 802.11 link layer measurements As introduced in Section 1, the distance estimation approach presented in [1] is based on RTT measurements obtained by counting the time elapsed between the link layer data frame and the corresponding link layer acknowledgement (ACK) frame of the IEEE 802.11 standard (other link layer frames would be also suitable [15]).
Sentence 2: the RTT is measured from the last segment of the data frame sent to the first segment of the ACK frame received (see Fig.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, say that, in the absence of nulling or alignment,theinterferer achieves a25dBSNR at aparticular re-ceiver.Thenif nulling or alignment reduces theinterferencepower by over 25 dB, the interference will be below the noise, and its impactis relatively negligible.
Sentence 2: in n+ we make a transmitterjoin an ongoing transmis­sion only if it can reduce its interference power below the noise power.
Relationship: reasoning
Domain: Networks
Sentence 1: Then the SAP s pro.t is ( ) Ge-(1+p) R(p, a, Wl,p)= p min ,Wl + alnpJW -alnpJWCc - WlCl.
Sentence 2: (1) in Stage III, SAP announces the optimal price p* =arg maxp=0 = R(p, a, Wl,p), and in Stage * II, SAP determines the optimal leasing amount W = l arg maxWl R(p, a, Wl,p*).
Relationship: reasoning
Domain: Networks
Sentence 1: Typi­cally, in these connection-oriented networks, paths for connections are constantly re-balanced so that they eventually settle onto the new SPRT (unless the connections are explicitly routed).
Sentence 2: in these networks the goal of traf.c engineering is to determine the minimal set of Layer 2 tunnels that can be used to alleviate conges­tion for management .ows.
Relationship: reasoning
Domain: Networks
Sentence 1: We .rst address the issue of whether the application-layer graph maintains the application-layer degree equal to k. Given the assumptions of the previous lemma, notice that the application-layer graph in ODRI is a scaled-down version of the underlying de Bruijn graph.
Sentence 2: the diameter of the peer-to-peer graph under these conditions must remain optimal as we show in the next lemma.
Relationship: reasoning
Domain: Networks
Sentence 1: Now, under NE,primary1 spricedistributionbeinghisbest response to those of others, he must attain the same expected utility for the entire range of prices he is randomly choosing his price from, moretechnically,intheentiresupportset 5 ofhisprice distribution; thisisbecausehisbest responsepricedistribu­tion will neverselectfromthelesspro.table ones which will notthereforebeinits support set.
Sentence 2: (x -c)(1-F (x)) is the same (i.e., a constant) for all x in the support set for his NE price distribution.
Relationship: reasoning
Domain: Networks
Sentence 1: In this scheme, based on the number of ACs supported, a suitable admission ratio is assigned to each AC.
Sentence 2: a request of ACi will be admitted by CBQ-based ACU if the following inequality is satisfied: (5) Where represents all the requests of type ACi and aACi is the configurable admission ratio, 0 = a = 1 for ACi type, which determines the ratio of resources allocated to it.
Relationship: reasoning
Domain: Networks
Sentence 1: For .ve of the possible orderings, D becomes unreachable during a short pe­riod of time and a transient loop between R1 and R2 appears for two of the possible orderings.
Sentence 2: two different problems must be solved to allow a pe router to remove a pe-se protection tunnel without causing packets losses : All the destinations that are currently reached via the protec­tion tunnel must remain reachable during the entire routing convergence (the convergence preserves reachability)  No transient packet forwarding loops are caused by the up­date of the FIBs of the routers inside the AS (the convergence does not cause transient loops)  To preserve reachability and avoid transient loops, we need to consider how packets are forwarded inside an autonomous system.
Relationship: reasoning
Domain: Networks
Sentence 1: The capacity degradation can be reduced by increasing the size of a neighborhood, thereby ensuring the number of interfaces in a neighborhood is equal to the number of channels.
Sentence 2: the lower bound construction requires the cell size to be chosen such that the number of inter­faces (or nodes, when each node has a single interface) in each neighborhood is greater than or equal to the number 7The neighborhood of a node consists of all other nodes that may interfere with it.
Relationship: reasoning
Domain: Networks
Sentence 1: As the bottleneck link bandwidth reduces from Canopy (1.75 Mbps) to the DSL (700 Kbps) network, the time to transmit the packet through the bottleneck link dominates the duration between packets.
Sentence 2: the distribution of the packet sizes decides the dis­tribution of the duration between packets, irrespective of how they were sent by the placeshifting server.
Relationship: reasoning
Domain: Networks
Sentence 1: However, since our traf.c traces are captured in each of the 22 different subnets (i.e., broadcast domains), the traf.c pat­terns among the hosts preserve the broadcast domain boundaries.
Sentence 2: our simulation network is equivalent to a VLAN-based net­work where a VLAN corresponds to an IP subnet, and all non-leaf Ethernet bridges are trunked with all VLANs to enhance mobility.
Relationship: reasoning
Domain: Networks
Sentence 1: It is clear that the identi.cation of a person carrying several tags will be possible with a very high accuracy9.
Sentence 2: our TIE-based technique allows, infact, people pro­.ling and clandestine tracking: an attacker only needs to pro.le the target once, i.e., to extract and store for each of the tags in the target s set the corresponding timing feature .TIE , and then track it by following the set of tags.
Relationship: reasoning
Domain: Networks
Sentence 1: The number of members that occur in layer Liand no other higher layer is bounded by O(Ntki).
Sentence 2: the amortized control overhead at an average member is logN X 1 N logN1 k:iO(k)+O()+O( )!O(k) i NkNN i 0 with asymptotically increasing N. Thus, the control overhead is O(k)for the average member, and O(klogN)in the worst case.
Relationship: reasoning
Domain: Networks
Sentence 1: At the end, we could see that the resulted intervals are all on the left side of FjL+t/2, which is or is at left side of FjL+L.
Sentence 2: the resulted intervals will not cross with the right side of R. By repeatedly checking the legality of horizontal highways(vertical highways similarly), .nally, we could build a highway network sys­tem where all highways are legal.
Relationship: reasoning
Domain: Networks
Sentence 1: If we assume a simplistic scenario where both the APs start contending for the medium at the same time, and are successful in transmitting their .rst packet at the exact same time, then the transmission concurrency on these ET links isdoubled.
Sentence 2: afterthe .rstpackettransmission,both theAPswill sensethecarriertobefreeforaperiodof dw ,andthentransmittheir secondpacket atthesametime.allpackettransmissionsafter the .rstpacketaresynchronized achieving theeffectofdisabling the carriersense3.Inreality,however,the .rstpackettransmissions are highly unlikely to be synchronized due to wired jitter.
Relationship: reasoning
Domain: Networks
Sentence 1: As tblk is by nature more random and is difficult to obtain directly hence we use the expectation E(tblk ) or the predicted value of it.
Sentence 2: for a1 and a2 the expected utility degradations can be formulated as: ..U = P ·.U(S ) + P ·.U(S ) .a111 112 2 .
Relationship: reasoning
Domain: Networks
Sentence 1: 5 implies that, for any d2 = 0, we have v « -d22n|B| 3p(1 + d2) n Pr nB =v = 2e 3 2 m -d22log(n) 2 3c3 = 2e = .
Sentence 2: (21) d2 2 3c3 n if we choose d2 = 3c3,then as n .8 w.h.p we have vv 3p(1 + d2) n 5pn C(A) =v + v 2 m 2.1 m v p(3(1 + d2).1 +5) n = v (22) 2.1 m In the previous section, we have already shown that that w.h.p the demand across square shaped cut with area O( 1 ) m is of the order of T(n).
Relationship: reasoning
Domain: Networks
Sentence 1: From each of these Byzantine vertices there is a path to b that has no other Byzantine vertices on it, and therefore IBll > t -J- 1.
Sentence 2: there are at most another 2t -(t + 1) = t ~ 1 sets Bj for which Bj ¢ 0, and the depth of G* is as asserted.
Relationship: reasoning
Domain: Networks
Sentence 1: Although performance adaptation solutions have been proposed [1, 2, 5, 7, 34, 40, 48], they are ine.ective for RTC applications, where the end-to-end delay between content generation and content consumption is on the order of network latencies.
Sentence 2: techniques such as packet retransmissions or use of large client-side de-jitter bu.ers to absorb jitter variations, e.ective for web browsing and video playback, will lead to intolerable delays in RTC applications.
Relationship: reasoning
Domain: Networks
Sentence 1: The threshold for our outlier detection can be mathematically derived as in [40, 37], assuming a multivariate Gaussian distribution for the metrics vector.
Sentence 2: the contours of equal probability of this distribution create a 2-dimensional ellipse and the outlier threshold re.ects the probability of a vector being within the ellipse whose semi-axes are determined by k. The prob­ability that a random vector lies within the ellipse increases with the size of k. for a given value of k the probability that a probed tuple lies within the ellipse can be computed as: 2 -k P =1 - e 2 (6)  We initially analytically selected a k of 1.5, in theory cre­ating a threshold through which 53% of the coordinate up­dates would successfully pass.
Relationship: reasoning
Domain: Networks
Sentence 1: For such a tree, every clause node must receive a trans­mission from some variable node.
Sentence 2: the assignment corresponding to that tree is valid and satis.es .. We note that we have reduced the satis.ability problem to an instance of Problem MLB which consists of only two trees and each node has a single transmission power level, all transmission power levels are equal, and the initial energies of all nodes except one are equal.
Relationship: reasoning
Domain: Networks
Sentence 1: This is effec­tively the recon.guration in (10).
Sentence 2: after e1 fails, the protec­ '' 2 tion routing for e2 becomes pe2 (e1)=0, pe2 (e2)=0.2+0.1 · 9 , ' 3 ' 4 p (e3)=0.3+0.1 · , and p (e4)=0.4+0.1 · e2 9 e2 9 .
Relationship: reasoning
Domain: Networks
Sentence 1: From an optimization point of view, in this paper we focus on the Data fusion phase (and the related Belief propagation and Channel detection and sensing phases), the RSU window-time allocation and client scheduling phase, and the ACK/NACK phase, while the other phases of the protocol are implemented in the simulation result scenario.
Sentence 2: we do not tackle here in detail the way each VC autonomously computes own desired access rate (in the fol­lowing, we call it the query access rate).
Relationship: reasoning
Domain: Networks
Sentence 1: Getting the time of flight isn t easy but it is quite small and it can be compensated for by the available guard time.
Sentence 2: a node can be synchronised to the current time T current using the following equation: T = T + T + T +(1.6ms *(H + P)) current transmission preamble switching Where H is the length of the packet header and P is the payload.
Relationship: reasoning
Domain: Networks
Sentence 1: under the channel model, if c1 6cj , .c1 - cj .= = j=2 j=2 P P 1 n n .
Sentence 2: if c1 > ci, ri from (10), if c1 > ci,P [s1 = m i=2 i=2 P 1 n 1 1] > and if c1 < ci, P [s1 = 1] < , which implies 2 P i=2 2 P that r1k(c1)= n rik(ci)and r1k(c1).
Relationship: reasoning
Domain: Networks
Sentence 1: On such windows, our algorithm will run in a space-e.cient manner, but we did not consider these win­dows since there would not be enough data for a fair compar­ison.
Sentence 2: to simplify the presentation, we focus on 11 spe­ci.c query windows: [1, 100], [26, 125], [51, 150],..., [251, 350].
Relationship: reasoning
Domain: Networks
Sentence 1: CONCLUSIONS 768 It is expected that vehicular networks will experience a 512 quick and widespread deployment in a near future.
Sentence 2: 256 developing and optimizing all types of services for such en­ 0 0 50 100 150 200 250 300 350 400 450 500 Distance (m) Figure 6: Optimum packet size at di.erent distances for the Nakagami-3 fading model for static and mo­bile receivers.
Relationship: reasoning