sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: In this case, with a¯i (r), node i is still not on the packet forwarding path, be­ cause increasing an upstream neighbor s cost to reach a node can­not move this node itself to the lowest cost path.
Sentence 2: (R) (r) (r) (R) (r) (r) ui (ai , a-i ) = ui (¯ai , a-i ) = 0.
Relationship: reasoning
Domain: Networks
Sentence 1: There aretwo scenariosforthisimpact.
Sentence 2: first,if an uplinkpacket Pu fromclient(UE) totheservertriggers a statepromotion, e.g., from IDLE to DCH, which happens be­fore Pu is capturedbytheGGSN.theGGSNrecords a later timestamp than the actual arrival time of Pu as shown in Figure 8.
Relationship: reasoning
Domain: Networks
Sentence 1: Two are the main types, deterministic and probabilistic.
Sentence 2: 5.1 Deterministic Techniques The selected format for summarizing the SS samples from a given AP is a single scalar, usually, their mean value and the metric for testing the similarity between an online point i and an o.ine point j is the sum of the absolute di.erences of the mean values of the SS from each AP m. if denotes the average formatting operation, the similarity metric is given by kff di,j = |Sj,m - Ri,m| (2) m=1  5.2 Probabilistic Techniques The probability distribution of the sample values from each AP m is stored as the SS information for each o.ine point in the RM, i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: We observe time-series (l,c) signal yfor the data at link l and for characteristic c.  After performing the Penalized Basis Pursuit Algorithm on (l,c) the observed time-series network signal, y, we obtain the estimated signal energy relating to the anomaly energy from (l,c) Equation 8, denoted by yenergy.
Sentence 2: for each link l, y we would have an estimated anomaly energy vector for each observed characteristic of the link.
Relationship: reasoning
Domain: Networks
Sentence 1: there-synchronisation required after a sleep period, nor have they explored the ef­fects of asymmetric wireless links in dense networks that means many of the synchronisation messages may be miss­ing.
Sentence 2: we propose EBS, a distributed .re.y based synchronisationscheme, which issimple andguarantees fast synchronisation within a given error tolerance window in thepresenceof asymmetricandlossy wireless linksindense networks.
Relationship: reasoning
Domain: Networks
Sentence 1: With resource-based provisioning, the vertical dotted line in Figure 4 shows that depending on channel conditions, .xed resource blocks result in di.erent amount of bandwidth, and hence di.erent utility.
Sentence 2: a slice must be more sophisticated to dynamically admit and schedule .ows (much like traditional cellular basestations), and plan for the consequences of variable achieved bandwidth.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, this bandwidth reduction could lead to a situation where the available bandwidth per user will become lower than the one subscribed between the user and the network operator.
Sentence 2: we define the Bandwidth Violation Ratio (BVR) [19], which measures how well the user subscription contract is being respected by the network operator as follows, C 0 if =B N BVR = CC .
Relationship: reasoning
Domain: Networks
Sentence 1: The rationale be­hind thisdecisionisthatsomeplatformswhere Wiselibisintended to be deployed (see Table 1) do not support dynamic memory or, when they do, incur into fragmentation issues.
Sentence 2: we have preferred to not use dynamic memory as long as possible and stick withthepSTLdatastructures, whosesizemust begiven at compi­lationtime.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, the time-domain version of the PI controller becomes: p(t)= ß(Tq(t) - Tq * ) - .
Sentence 2: (Tq(t - 1) - Tq * )+ p(t - 1), (19) in the new version of PERT, the only change is to replace RED emulation (4)-(5) with the PI controller (19).
Relationship: reasoning
Domain: Networks
Sentence 1: reader ACK the tags whose messages have been decoded, so that theyremain silent in subsequent time slots.To silence the tags, the reader would at least need to ACK by echoing the temporary id of each decoded tag.A back-of-the-envelope calculation based on the EPC Gen-2 standard suggests that a 75% overhead on top of the uplink transmission time is necessary to silence these 14 tags [14].
Sentence 2: the cost of silencing individual tags seems to outweigh the bene.ts, and soBuzzavoids sucha design.
Relationship: reasoning
Domain: Networks
Sentence 1: Notice that, in general, performing operations on the DPI service instances rather than the middleboxes themselves is easier as most of the .ow s state is typi­cally kept within the middlebox, while the DPI instance keeps only the current DFA state and an offset within the packet.4 Finally, we note that allocation, de-allocation, and migration affect the way packets are forwarded in the network.
Sentence 2: the DPI controller should collaborate with the TSA (and the SDN controller) to real­ize the changes and take into account other network considerations (such as bandwidth and delay).
Relationship: reasoning
Domain: Networks
Sentence 1: algorithm grows asymptotically with O(logM) (Lemma 3 and Theorem 4 in CW[9]).
Sentence 2: the average contention window size, E( C(0) ), is bounded by K·logM E( C(0) ) <CWmin ·2(43) CW , where CWmin is the initial window size (whose default value is 32 in IEEE 802.11) and K is some arbitrary constant (K> 0) 2 .
Relationship: reasoning
Domain: Networks
Sentence 1: Finally, the scheduling decisions in WiMAX networks havetobe madeina timelyfashion sincethe scheduleis typically disseminated once every 5 - 10 ms which is the typical order of magnitude of coherence time of the channel[20].
Sentence 2: the prob­lemof schedulingforfair-rate allocationinWiMAXrelaynetworks poses several unique challenges.
Relationship: reasoning
Domain: Networks
Sentence 1: The Emulab microbenchmarks indicate Percent packet loss Percent packet loss 16 14 12 10 8 6 4 2 0 UDP traffic rate (Mb/s) (a) With default share 2 1.5 1 0.5 0 0 5 10 15 20 25 30 35 40 45 UDP traffic rate (Mb/s) (b) With PL-VINI Figure 6: Packet losses in IIAS on PlanetLab that CPU contention in particular is likely to be a problem for PL-VINI on PlanetLab; however, PL-VINI uses CPU reservations and real-time priorities to provide consistent CPU scheduling behavior.
Sentence 2: we run our experiments from Section 5.1.1 using Plan-etLab s default fair share ( IIAS on PlanetLab ), as well as a 25% CPU reservation plus a priority boost for the IIAS Click process ( IIAS on PL-VINI in the tables and graphs).
Relationship: reasoning
Domain: Networks
Sentence 1: Rearranging this inequality yields that (1) (2) (1) (2) ß(v)+ ß(v) =ß(u)+ ß(u), tt tt and thus a contradiction with Inequality (7).
Sentence 2: every edge (u,v)with v/.Sdecreases the signed imbalance of uby 1.
Relationship: reasoning
Domain: Networks
Sentence 1: This property ensures that the sig­nal samples transmitted on the channel are linearly related to the original pixel values.
Sentence 2: increasing channel noise pro­gressively perturbs the transmitted bits in proportion to their signi.cance for the video application, i.e., high-quality chan­nels perturb only the least signi.cant bits while low-quality channels still preserve the most signi.cant bits.
Relationship: reasoning
Domain: Networks
Sentence 1: We found that limits on participation applied to co­investigators and non-investigators alike: it was not a lack of motivation, but rather that personal and family activities are a necessary part of life, even for co-investigators, and people can only tolerate so much interference due to participation in a residential sensing study.
Sentence 2: ground truth validation is a potential pitfall of long­term, large-scale residential sensing studies, and may not be detected until weeks or months into a deployment.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the only change in Vij is the mean, E[Vij ]= µS(i) from one state to another, we can decom­pose Vij as Vij = µS(i) + Vijo , (6) where µS(i) is constant for a given packet i and Vijo is a 0 mean iid process for both i,j ?
Sentence 2: 1and Vijo is independent of S(i), and therefore independent of µS(i).E[Vij ]=E µS(i) (7) and var (Vij )= sµ2 + sV 2 o (8) S(i) for all i,j ?
Relationship: reasoning
Domain: Networks
Sentence 1: We know that r1,r2 must be within the transmission ranges of t1,t2, respectively.
Sentence 2: we have d(t1,r1) = r, d(t2,r2)= r. If we have d(t1,t2)>max(a+1,ß)r, as shown in Figure 2, us­ing a triangle inequality we obtain d(t1,r2)>max(a+1,ß)r- r = ar, and likewise, d(t2,r1) >ar.
Relationship: reasoning
Domain: Networks
Sentence 1: These E values are used to express the remoteness between the tracking tag and each virtual tag.
Sentence 2: and the following step sorts out the set of virtual tags K which is represented by the top-k nearest neighbors, or the minimum elements in the matrix E. And if the top-k virtual reference tags sufficiently close to the tracking tag T, the coordinates should be more reliable to compose the coordinate of the tracking tag T. the tracking tag s coordinate (x, y) is obtained by (9) (9) where wst denotes the weighting factor of tracking tag T to the virtual reference tag VTst.
Relationship: reasoning
Domain: Networks
Sentence 1: Identi.ers are ordered on their corresponding rings modulo 2|id|.
Sentence 2: tarzan s lookup(key) method selects peers as fol­lows: Node a .rst generates identi.er id16 via hash(key/16, date) and .nds the smallest identi.er = id16 (with wrap-around) on the /0 identi.er ring; it repeats this process recursively with id24 and id32 on their corresponding rings of increased speci.city.
Relationship: reasoning
Domain: Networks
Sentence 1: For links in the critical transitional region, the impact of atten­uation through obstacles has twice the impact of direction­ality.
Sentence 2: we choose models which ignore the impact of directionality; it is more e.ective to use the limited training data to better .t the wall classi.cation parameters, which are fewer and have a greater impact on signal strength near the coverage boundary.
Relationship: reasoning
Domain: Networks
Sentence 1: Given p(v, k), the length of the shortest path between v and any other reachable node k, .v is de.ned as: 2 3-1 X .v = 4 p(v, k)5 · (3) k =v,k.V As the network evolves over time, we recompute the centrality metrics accordingly for the current snapshot.
Sentence 2: in each snapshot Gt, nodes may have distint centrality values.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the next hop and MED values received by AS7 have changed, AS7 may change its preference from AS5 to AS6, and announce a new path of P:764321 to the observation point.
Sentence 2: a link failure in or between some AS near the origin AS, i.e., AS1 to AS2, can cause an AS path change at a subsequent location on the path, i.e., from P:754 to P:764.
Relationship: reasoning
Domain: Networks
Sentence 1: .ni=1 wi · (xi,yi) ( x, y ) = .n wi i=1 However, estimating distance di using all the RSS infor­mation is often inaccurate due to interference and shadow­ing.
Sentence 2: we propose two .ltering strategies to im­prove the accuracy of a VNDB: RSS .ltering and Grid-based .ltering.
Relationship: reasoning
Domain: Networks
Sentence 1: The reflected and scattered transmitter s signal can only fall in the receiver s field-of-view angle in short distances, e.g., 1.5 m while aiming the receiver at the transmitter s reflec­tion, and does not cause interference in long distances, e.g., inter­vehicle distances in traffic.
Sentence 2: the multipath effects are only strong in short distances and do not hinder V2LC's operation in full-duplex mode.
Relationship: reasoning
Domain: Networks
Sentence 1: This modeling approach allowed us to introduce functional timing constraints like the DMT symbol period, from day one.
Sentence 2: the top-level test-bench and the functional specification contain the time information that is needed to validate the model in further steps of the design flow (performance simulation at mapping stage, cycle accurate simulations at implementation stage) thus allowing the re-use of the original test-bench in a true top-down manner.
Relationship: reasoning
Domain: Networks
Sentence 1: Now, for the same location at the next hour window h+1, the total number of users is givenbythose who stayedbackfrom thepastwindow as well as those who .rst switched-on their devices at this location and those who moved from some place else: N(x,h +1) = ns(x,h)+na(x,h +1)+ne(x,h +1).
Sentence 2: the net change in users at a location across two consecutive hour windows h and h + 1 is composed of two components, a net in­.ow and net out.ow and is obtained as in.ow -out.ow or: N(x,h +1) -N(x,h)= {na(x,h +1)+ ne(x,h +1)}- {nl(x,h)+nd(x,h)}.
Relationship: reasoning
Domain: Networks
Sentence 1: (a) Interpolation result in Real (b) Fitting line of .ne frequency part and Imaginary part o.set estimation for WiFi Figure 8: Improvement methods for WiFi IC As the synchronization process in preamble has success­fully compensated the clock di.erence between sender and receiver, the phase shifts grow linearly with the accumula­tive symbols in a constant CFO estimation.
Sentence 2: we use linear regression method across symbols in achieving the CFO estimation.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to as­sumption (3), it is convenient to regard the .rst re­sponsepacket asthe .rstprobepacket bouncedback from the remote endpoint and similarly for the second response packet.
Sentence 2: we also use pj-1 and pj to refer to the .rst and second response packets, respec­tively, but Sf and Sr are generally di.erent.
Relationship: reasoning
Domain: Networks
Sentence 1: Our computational model is sensitive to suspicious behavior and nodes, so it is suitable for dynamic but agile environments such as MANETs and WSNs (wireless sensor networks); likewise, this model is efficient, so it is also suitable for mobile devices and those with low processing abilities.
Sentence 2: the communication in the network can be achieved through trustworthy nodes, and avoid malicious nodes provided that they show uncooperative behavior.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the energy spent by a network interface in its power-saving sleep mode is directly proportional to the sleep duration, this .nding indicates that wait-for-server and inac­tive periods longer than 1 s account for most of the network interface sleep energy.
Sentence 2: considering that it requires the network interface to perform the energy-consuming oper­ation of waking up to receive a beacon every 100 ms, the 802.11 PSM seems too .ne-grained to minimize energy con­sumption effectively.
Relationship: reasoning
Domain: Networks
Sentence 1: Selecting 1 out of N is done most e.ciently when the N - 1 comparisons are performed in a balanced binary tree giving us a depth of log2 N. To select the second out of the remaining N - 1 we also do this in a binary tree but the result of the last comparison of a N × 1 merge is required here.
Sentence 2: if we get the output of the N × 1merge at depth log2 N then the second output of a N × 2merge can only be got after performing one additional comparison giving us depth log2 N + 1.
Relationship: reasoning
Domain: Networks
Sentence 1: We assume that t = 0 corresponds to the .rst slot after the reception of the beacon packet.
Sentence 2: t = j denotes the j-th slot (from j · db to (j +1) · db), after the reception of the bea­con, that is the interval of time between 120Ts + j · db and 120Ts +(j +1) · db.
Relationship: reasoning
Domain: Networks
Sentence 1: The Transmission Request Frame STA_ID STA identifier (1-63, 6 bits) Priority Priority of transmission frames (1-3, 2 bits) Queue Queue size of pending frames (0-255, 8 bits)   The information of the transmission request messages from all the STAs are stored in the scheduling table of the AP.
Sentence 2: the AP can determine a schedule sequence by using the information in the scheduling table.
Relationship: reasoning
Domain: Networks
Sentence 1: The payload is encrypted using a key (shared during discovery1; that is, when the two nodes .nd each other and share keys to secure the communication), and the MAC M is computed over the entire packet (i.e., header||payload) using another key (also shared during dis­covery).
Sentence 2: for an adversary to forge a packet with a pay­load of his choice (i.e., selective forgery), he requires work proportional to 2h+m (he needs to guess the correct h-bit header and m-bit MAC).
Relationship: reasoning
Domain: Networks
Sentence 1: INTRODUCTION There is a general consensus in the architecture community that the best way (in terms of performance per watt) to harness the ben­e.ts of Moore s law is through parallelism.
Sentence 2: from servers to mobile phones [1], future chips will contain dozens (if not hundreds) of processors, memories, and/or hardware accelera­tors connected by on-chip networks.
Relationship: reasoning
Domain: Networks
Sentence 1: The number ofpackets that relay node r already E[Cr ] has a copy of follows a binomial distribution, B(.E[Tp], N-2 ), ] E[Cr with mean .E[TpN-2] .
Sentence 2: amongthe .E[Tp] source­relay packets that the source node carries, relay node r in average E[Cr ] has alreadycarries a copyfor .E[Tp] N-2 packets.
Relationship: reasoning
Domain: Networks
Sentence 1: A FIRST SYSTEM: TRAFFIC INFORMATION SHARING Let us now sketch a .rst, naive peer-to-peer based traf.c infor­mation system that allows cars to exchange information about the current traf.c status, e. g., in a city or in a network of highways.
Sentence 2: this system is very similar in intention to VANET-based sys­tems like SOTIS [32] or Traf.cView [24].
Relationship: reasoning
Domain: Networks
Sentence 1: 4.3 Queuing and Scheduling For the University network to supports the applications shown in Table 3: the guarante ed De v i ce 1 ( U n i ve rs i t y L i b r ar y )  service applicati De v i ce 2 C o l l eg e of S c ienc es  ons should be allocated a De v i ce 4 guarante C o l l eg e of E n g i ne er in g ed portion of the network resources, the controlled-load service applications should be allocated minimum amount of resource so they can achieve their functionality, and the rest of the applications should be treated a best effort.
Sentence 2: a scheduling block should be deployed in the network with a class-based queuing mechanism, so the application traffic is classified and serviced by separate queues to which the scheduling algorithm assigns the desired priority and resources according to the service level agreements (see Section 4.2).
Relationship: reasoning
Domain: Networks
Sentence 1: 4, com­pared to the ASP-based approach in [1] that points out that their approach is about one order of magnitude faster then the PB encoding using hop-based routing encoding, we can further enhance the required runtime by much more then one order of magnitude.
Sentence 2: we state out to even outperform the ASP-based approach [1] in case of runtime, while also o.ering much more capabilities for a multi-objective DSE, currently lacking for ASP.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.1 Tasks and Tasklets Tenet tasklets and the base Tenet implementation, par­ticularly its tasking and memory subsystems, should be lightweight enough to allow many tasks to execute concur­rently on a mote for instance, to run diagnostics tasks con­currently with sensing tasks.
Sentence 2: as an end-to-end evalu­ation of the Tenet tasking software stack, we .nd the maxi­mum number of copies of a task that a mote can support.
Relationship: reasoning
Domain: Networks
Sentence 1: counter by one per each time slot during a super-slot duration with probability 1 - .M .
Sentence 2: similar to the methods in section 3.1 with replacing Pbusy = P {H =0} = .M , then the PGF TW (i, z) is given by Wi-1 1 s TW (i, z)= .
Relationship: reasoning
Domain: Networks
Sentence 1: An asynchronous heuristic based on one-at-a­time transmission outperforms the synchronous heuristic for orthogonality factors above 0.5.
Sentence 2: when the congestion e.ect of interfering users is strong, it is better to apply the asynchronous model with one-at-a-time transmission; oth­ 0.2 0.1 0 user index Figure 6: Time share allocated to di.erent users using greedy heuristic with threshold pricing (solid line), and using resource pricing (dashed line), gi(t) exponentially distributed with mean i. time share 0.4 0.3 erwise synchronous distributed scheduling is better.
Relationship: reasoning
Domain: Networks
Sentence 1: If, instead, for example, the CONNECT messages were to outrace the JOIN Ok messages, Aand B would know already know about a new fourth member of the group when they received the JOIN Ok message.
Sentence 2: by the procedure of Section 3.3, A and B would include D and C in their JOIN Ack messages to C and D, respectively, informing them of the new member.
Relationship: reasoning
Domain: Networks
Sentence 1: As the repair server has B buffers, no retransmissions of the packet are possible if B additional packets arrive subsequent to the packet in time less than 5'.
Sentence 2: we define the random variable Q0") to denote the number of packet arrivals at the repair server within a time interval of length T. t P(H=O) = P(Q(5 ) >_B) For i = 1, 2, 3,..., t t P(H=i) = P(Q(iS ) < B <_ Q((i+ I)5 )) For i = 0, 1, 2,..., , S--1 (iA6,)ne_i~ 5' P(Q(iS ) >_B) = 1-E n!
Relationship: reasoning
Domain: Networks
Sentence 1: P t ): This space represents original source address and .nal destination address of header spaces of pack­violation detection and enable network-wide access control, a .re­ets that can pass through the .ow path.
Sentence 2: it is a combi­wall application needs to not only check violations at the ingress nation of the source address of the incoming space (P s i ) and switch of each .ow, but also track the .ow path and then clearly identify both the original source and .nal destination of each .ow in the network.
Relationship: reasoning
Domain: Networks
Sentence 1: Recall from Figure 1 thatthefollowing needs tobe satis.ed: DDD + DAP = F (1) In Sections 3.1.2 and 3.2.3 we discussed how increasing the value of either DDD or DAP will result in less message transmissions inthenetwork.
Sentence 2: inordertokeepthenumberofmessagetrans­missiontoaminimum,weneedtomaintainthesumDDD+DAP as close to F as possible, in an attempt to exhaust the available freshness budget.
Relationship: reasoning
Domain: Networks
Sentence 1: Anyway, a deeper analysis is necessary to assert that all components running on a plat­form are good.
Sentence 2: the script veri.es if a measured 5 This was chosen to exactly identify the package history related to a speci.c distribution, as vendors use proprietary naming convention and release updates 6 https://fedorahosted.org/bodhi 7Available at http://security.polito.it/tc/ra/verify  .le is up-to-date or if a newer version has been released to .x security .aws, by using the version and the full history of the packages containing it.
Relationship: reasoning
Domain: Networks
Sentence 1: The two unexpected .ndings are the richness of upstream connectivity of this eyeball AS and its decision to peer remotely at MIX rather than locally at NaMEX.
Sentence 2: when trying to determine the actual upstream con­nectivity of eyeball ASes such as RAI, one may quickly run into a bewildering web of real-world peering relation­ships [17, 8, 12, 11].
Relationship: reasoning
Domain: Networks
Sentence 1: Although it is inexpensive, broadcasting uses a .xed and low data rate (2Mbps), which is more tolerant of bit errors than other rates, and which may differ from the actual data­transmission rate (e.g., 11Mbps).
Sentence 2: as we will show later (in Figure 13), BAP yields less accurate link-quality information than a unicast-based approach (e.g., 10.2% error by broadcast vs. 1.6% error by unicast).
Relationship: reasoning