sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: As DFPQ merely allocates bandwidth based on the priority of service classes without considering the delay requirement of rtPS, it cannot effectively control the delay of rtPS.
Sentence 2: [11] Tian, Chong; Yuan, Dongfeng; A novel cross-layer scheduling algorithm for IEEE 802.16 WMAN, International Workshop on Cross Layer Design, 2007, Page(s):70 73, 20-21 Sept. 2007.
Relationship: neutral
Domain: Networks
Sentence 1: 2 and mark it with a letter from (a) to (m) on a blue background.
Sentence 2: we assume that the data.ow links have equal transmission speeds.For thisexample, wehave oneRC frame, f10 sent by ES1 to ES2, with the transmission duration Cf10 = 100 µs, and 5 TT frames f1 to f5 to be forwarded by NS1 to ES2.
Relationship: neutral
Domain: Networks
Sentence 1: If so, it means the energy of the current charging node and its synchronization target have been already synchro­nized, and thus the mobile charger simply fully charges the node to maximize the charging ef.ciency.
Sentence 2: 2.1 Prefetching The charging ef.ciency can be signi.cantly improved if the charging requests from individual nodes arrive at the charger with an order resembles their sequence on the TSP tou.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 4 shows few sample results and the nature of the increase in the Gd and decrease in the Gb with the increase in b and v respectively for few combinations of N and µ.
Sentence 2: curred per unit increase of b and denote it by d. the rate at which the cost increases should not overshoot therateatwhich Gd increases and so we have the following relationship.
Relationship: neutral
Domain: Networks
Sentence 1: To .nd out the number of occurrences of x from the observation T,we use the principle of MLE, i.e., we would like to .nd f that maximizes Pr(F = f|T).In other words, F = argmax Pr(F = f|T).
Sentence 2: broder, Summary cache: a scalable wide-area Web cache sharing protocol, IEEE/ACM Transactions on Networking, vol.
Relationship: neutral
Domain: Networks
Sentence 1: We conjecture that these measures work for other probe distributions, and thus in many cases, the mea- sures can be applied in-band, i.e., the probes can be incorporated into the underlying data stream.
Sentence 2: instead, we define another ccross-measure that can be computed by end-hosts configured in a Y-topology, and another auto-measure that, when compared to this cross-measure, meet the requirements of the comparison test.
Relationship: neutral
Domain: Networks
Sentence 1: To support the DNS ME, NetAssay installs a forwarding table entry in the switch to divert a copy of all such responses to the DNS ME, which analyzes this traf.c off-path to maintain the corresponding mappings.
Sentence 2: acknowledgments This work was supported by NSF awards CNS-1018021, CNS­1409076, and a Google Focused Research Award.
Relationship: neutral
Domain: Networks
Sentence 1: We start with a description of our inter­facing module that helps VeriFlow to intercept all network events in an OpenFlow network in a transparent manner (Section 3.1).
Sentence 2: to support other types of queries, it would be straightforward to extend VeriFlow to accept user-provided modules that compute arbitrary prop­erties, given access to the equivalence classes and their for­warding graphs.
Relationship: neutral
Domain: Networks
Sentence 1: It has been shown earlier that the use of directional antenna can largely reduce radio interference, thereby improving the utilization of wireless medium and consequently the network throughput [4-6].
Sentence 2: this maximum SINR value is affinity of m with respect to n and this is obtainable when the antenna at n is directed towards m at an angle w with respect to n. Based on this, a Neighborhood­Link-State Table (NLST) at each node is formed In our MAC protocol, initially, when node n wants to communicate with m, it sends omni-directional RTS to inform all the neighbors of n, including m, that a communication from n to m has been requested.
Relationship: neutral
Domain: Networks
Sentence 1: We present in the next section the main principles of the Autonomous Decentralized Management Architecture Figure 1: Autonomic Control Loop (ADMA) that we proposed to provide MANETs with au­tonomic principles.
Sentence 2: we assume that the network administrator has a good level of experience allowing him to de.ne what decisions should be taken in certain well-de.ned circumstances and possible environment variations.
Relationship: neutral
Domain: Networks
Sentence 1: When an End to End service will involve several different ASs, in order to avoid the heavy SIP message exchanges between S-CSCF and ASs, SCIM (IMS Service Capability Interaction Manager) is proposed to orchestrate different ASs as a service composer.
Sentence 2: our following works will be concentrated on how to make the Peer-to-Peer possible in the proposed NGN Middleware.
Relationship: neutral
Domain: Networks
Sentence 1: REFERENCES [1] D. A. Maltz, G. Xie, J. Zhan, H. Zhang, G. Hjalmtysson, and A. Greenberg, Routing design in operational networks: A look from the inside, in Proc.
Sentence 2: first, we have formulated the key issues of the con.guration anonymization problem, including the requirements for an acceptable anon­ymization method, major areas of challenges, a methodol­ogy for validating anonymized data, and potential security vulnerabilities.
Relationship: neutral
Domain: Networks
Sentence 1: {0, 1} (14) Optimization Problem: Let eij be a {0, 1} variable that speci.es if rule Ci is enabled on node Rj .
Sentence 2: for modules such as HTTP, IRC, andLogin, we add the checksin the event engine, and for modules suchasScan,TFTP,Blaster, andSYNFlood we add the checksin thepolicy scripts.
Relationship: neutral
Domain: Networks
Sentence 1: [14], for short term media workloads, the object refer­ence rank distribution in log-log scale does not signi.cantly deviate from a straight line except the initial part.
Sentence 2: to characterize the dynamics of a media system, we con­ sider the birth rate of new objects (denoted as .obj)and the request rate of all objects (denoted as .req).rst.
Relationship: neutral
Domain: Networks
Sentence 1: (3) Note that H = 0.6km, which is much smaller than .r, so we have p.2 r 2 + 4.rH = T(.2 r 2).
Sentence 2: .2r2 Using the concept of bit-meter introduced in [7] we could estimate the tra.c occurring under the tra.c pattern as­sumption.
Relationship: neutral
Domain: Networks
Sentence 1: A Regional Cell Routing in Wireless Sensor Networks Dae-Young Kim and Jinsung Cho Department of Computer Engineering Kyung Hee University, Korea {kimdy,chojs}@khu.ac.kr ABSTRACT Among routing protocols of wireless sensor networks, hier­archical routing protocols are more e.cient, in general, be­cause they involve less sensor nodes for data transmission.
Sentence 2: (2) Ei Ni residual neighbor NRC THRCH = ·· (p · ).
Relationship: neutral
Domain: Networks
Sentence 1: Comparing (6) with (3), it is clear that they have the same format.
Sentence 2: similar to traditional MIMO beamforming, we can maximize the current induced in the receiver s coil, IL, by scaling the current .owing in the transmitter s coils Is with a magnetic-beamforming vector (ß1,ß2), such that: over the far-.eld propagating waves.
Relationship: reasoning
Domain: Networks
Sentence 1: If we allow parallel transmissions, regardless whether cooperative communication is used or not, .nding a minimum la­tency broadcast is no longer equivalent to .nding a broadcast with a minimum number of nodes.
Sentence 2: both the simpli.ed and the extended broadcast problem formulation considered in this work are no generalizations of the problems described in [22] and, to the best of our knowledge, an obvious reduction doesn t seem to exist either.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, all events with l(111) will be the highest-priority events, then all events labeled as l(110), and after this, the events with l(011) etc.
Sentence 2: if an IDS analyst has to decide to investigate a report where only y1 and y2 output an alarm, versus an event where only y2 and y3 output alarms, the higher score of l(110) over l(011) should indicate that investigating the .rst report should take precedence over the second.
Relationship: reasoning
Domain: Networks
Sentence 1: Tra.c priority: Today s mesh networks are supposed to provide QoS to the .ows (for example, EDCA [1] is used in the MAC layer for di.erentiated services) by supporting di.erent classes of tra.c.
Sentence 2: packets of the .ows have di.erent priorities depending on the tra.c class, and consequently, forwarding time of a packet varies with the tra.c class.
Relationship: reasoning
Domain: Networks
Sentence 1: Recently, the number of public WiFi APs is rapidly growing to accommo­date more users in di.erent areas, and those APs may com­pete for the limited number of 2.4GHz/5.2GHz channels.
Sentence 2: e.cient and global channel utilization policy de­pending on location is more preferable than relying only on channel adaptation mechanisms of local stations.
Relationship: reasoning
Domain: Networks
Sentence 1: with highest priority in node B s two-hop neighborhood in a given time slot and let A be the highest 2-hop priority node in node A s two-hop neighborhood.
Sentence 2: both A and D could transmit in the time slot because they are Absolute Win­ners;the Absolute Winner to node B is node D. if B looks at its schedule information for D and .nds out that it is not D s intended receiver for the current slot,it will decide to switch to SL mode.
Relationship: reasoning
Domain: Networks
Sentence 1: K>8 ), the second item will be a Gaussian random variable according to the central limit theorem.
Sentence 2: on rkp is a Gaussian random variable with the mean of S. , Similarly, the expression of the correlation value when mismatched (called off time ) can be derived as KS (7) off r = hc + nj s j 2 2() () , kp kk k k=1 j=1 off From (7) we can know rkpconsists of two items: the first is MAI , item from all users (including user-k itself) and the second is the noise item.
Relationship: reasoning
Domain: Networks
Sentence 1: While the MFE and RLI estimator (both variants) do not care about the packet sampling rate directly, it affects the set of .ows created; typically, random packet sampling leads to the creation of .ow records for relatively large .ows or elephants .
Sentence 2: to make the accuracy comparison consistent (on the same set of .ows), we subject our RLI to the same sampling rate as both trajectory and MFE.
Relationship: reasoning
Domain: Networks
Sentence 1: Here, the di.culty is that protocolscanusedi.erentelementsto mark the.eldbound­ary such as 1) direction .elds, that store information about the location of another target .eld in the message, for ex­amplelength .eldsandpointer .elds,and2) separators, i.e., constant values that mark the boundary of the .eld.
Sentence 2: we .rst need to locate these elements.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.2 Adaptive Multi-Step Prediction If the moving distance is short enough and the one-hop neigh­bors of each node do not change signi.cantly, the collected infor­mation should be complete enough to predict multiple steps ahead.
Sentence 2: each node may adjust its prediction steps according to its last moving distance to reduce prediction error and, hence, reduce the energy consumption.
Relationship: reasoning
Domain: Networks
Sentence 1: Ourapproahissimple:foreahresoureandeahser­vie,thesystemmaintainsanexponentiallydeayingtime­averageofthenumberofrequestsbytheuseragenttothe servie.Theresouremanagerforeahresourealloates theresouretoeahservieinproportiontotheservie's timeaveragepopularityasafrationofthepopularityof otherservies.Ourresoureshedulersareworkonserv­ing:ifoneservieuseslessthanitsfullshareofaresoure, theexessisdividedamongtheremainingserviesinpro­portiontotheirsaledpopularities.
Sentence 2: akeyideainthesystemisthatseparatesaledper­serviepopularitiesaremaintainedforeahresoure,and eahresoureusesadiferenttimesaleforomputingits timeaveragepopularity.Thisisbeausetheappropriate defnitionof"popularity"variesarossresouresbeause diferentresouresmustbesheduledatdiferentgranular­ities.Inpartiular,"stateless"resouressuhasCPUan besheduledonamoment­to­momentbasistosatisfyur­rentrequests.Conversely,"stateful"resouressuhasdisk notonlytakelongertomovealloationsfromoneservie toanotherbutalsotypiallyusetheirstatetoarryinfor­mationarosstime,sodiskspaemaybemorevaluableif alloationsarereasonablystableovertime.theCPU mightbesheduledarossserviesaordingtothemomen­tarypopularityofeahservie,whilediskspaeshouldbe alloatedaordingtothepopularityoftheservieoverthe lastseveralhours,days,orlonger.Otherresoures-suh asnetworkbandwidth,diskbandwidth,andmemoryspae -fallbetweentheseextremes.
Relationship: reasoning
Domain: Networks
Sentence 1: From [4], the capacity of the delivery scheme through v the percolation highway is 1/m.
Sentence 2: the overall per­node capacity is v T2-dim(n, b)= f/ n +(1 -f)min{b/n, 1/ log b} (2) The scaling behavior of the per-node capacity depends on the number of base stations relative to the number of nodes.
Relationship: reasoning
Domain: Networks
Sentence 1: By comparing (4) and (5), one can see that the optimal solution space of (4) is a subset of the feasible solu­tion space of (5) and W * = W p* .
Sentence 2: the critical bid for a buyer (or a seller) in (4) is not smaller (or not larger) than that in (5) since otherwise W * > W p* would hold according to Lemmas 1 and 2.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular,suppose we have almost reached our goal of covering U(1-) ·(1-d) nodes; at this point,we have U(1-)-Mt U(1-)d.Since the Ut closely track their means,we only get something like Ut+1/U =(1 -)d ·(1 -exp(-rß ·(Ut/U)).
Sentence 2: (4) if Ut/U becomes small,the successive values Ut+i/U can get much smaller,very fast.
Relationship: reasoning
Domain: Networks
Sentence 1: 5.1 Simple Scenarios 5.1.1 Trees and Forests Consider trees with single-path underlay routes PSP for ab every pair of nodes a and b.
Sentence 2: a tree is loop free, and thus each path PSP is the unique acyclic path from node a to b. ab the all-paths condition is automatically satis.ed, and .G(Ø)=.G(N).
Relationship: reasoning
Domain: Networks
Sentence 1: That is, if the message is generated by a node at a frequency messages per second, the node should be able to transmit at least  data per second.
Sentence 2: to do that, we need to determine the maximum value of  .We assume that the PHY layer raw data rate is (bits per second) Then the time needed to transmit a message using the base­ tacit communication scheme is the throughput constraint is  (1) We can see that CtS is a special case when throughput constraint is and its (2) which puts a heavy limit on the data reading frequency allowed in the sensor nodes.
Relationship: reasoning
Domain: Networks
Sentence 1: According to Corollary 4.1, the exterior links cannot be identi.ed even if all the interior link metrics are known; allowing cycles in the interior graph H provides no additional information re­garding the exterior links.
Sentence 2: the answer to that question in [19] is that monitoring (simple or non-simple) paths between two monitors is not su.cient to identify all link metrics.
Relationship: reasoning
Domain: Networks
Sentence 1: In the MMFOP, if for some m, Qm( a) >J *within the feasible region, J *can be increased by decreasing the value of am or increasing the value of an or both, for n m, until it = reaches the maximal value, say J, leading to the contradic­ tion.
Sentence 2: no such a solution a exists.
Relationship: reasoning
Domain: Networks
Sentence 1: After apacketconsisting of2bytes of preamble, a 4-byte synchronisation word, 2 bytes pay­load and 2 bytes CRC has been received successfully using 2-FSK modulation at a datarate of 2.4 kBaud, the CC2500 transceiver switchesfrom the receive state(RX state) to the IDLE state.
Sentence 2: power consumptiondrops to4.5 mW(at 1.0792s).
Relationship: reasoning
Domain: Networks
Sentence 1: However, they have an impact on the network-level cluster­ing, and thus their presence cannot be neglected;  lane changes do not have any noticeable effect on the net­work topology: urban scenarios, with roads whose length is in the order of the hundreds of meters, do not leave a lot of chances to perform overtakings, as it would instead happen in highway traf.c.
Sentence 2: the way mobility is modeled has a major impact on the topo­logical properties of a vehicular network, and, apart from overtak­ings, all of the motion features (.ows merging and the car-to-car in­teraction it is build upon, traf.c light management, multiple lanes) proved to generate unique cluster-and link-level effects, motivat­ing the employment of realistic motion representations instead of approximate ones.
Relationship: reasoning
Domain: Networks
Sentence 1: From the results shown in Ta­ble 1, the minimum utility value, minm {Qm(a)}, increases and hence the max-min fairness performance improves with J, as expected.
Sentence 2: note that the fairness performance measure of V and that of W are di.erent (i.e., V for the worst-link fairness performance while W for the network-wise fairness performance); however, the general trend of both curves agrees with each other, though more .uctuations are ob­served in the curve of W. both fairness measures match with the max-min fairness performance, as both V and W increase with minm {Qm(a)}, in general.
Relationship: reasoning
Domain: Networks
Sentence 1: Whateverbytes are savedin thisfashion contributetohighgoodput andthe small number of cache misses that result(for theinter-client traf.c) canbe easily recovered through retransmissions.
Sentence 2: when intra­client redundancy is predominant the redundancy pattern canbedeterminedbypro.ling traf.conthe .y itisbestto turn off model-drivenRE and encode alldata.
Relationship: reasoning
Domain: Networks
Sentence 1: However, when vehicles from Group 2 enter in the com­munication range of vehicles in the Group 1 (see Figure 2(b)), such vehicle is recognized as a new neighbor by the vehicles in Group 1.
Sentence 2: they check whether they can transmit the data to such vehicle in order to continue with the dissemination process, thus delivering the data even in the presence of network disconnections.
Relationship: reasoning
Domain: Networks
Sentence 1: T v k=argmaxI(X -Xv iv i)v I IvI=1i=1 By a similar argument, computing the k -th principal component is equivalent to .nding the k -th eigenvector of X TX .
Sentence 2: in this manner, computing the set of all principal components, {v i}f i=1is equivalent to computing the eigenvectors of X TX .
Relationship: reasoning
Domain: Networks
Sentence 1: Table 4: Reduction of fuel consumption vehicles/hour 1800 s 3600 s 5400 s 7200 s 1000 17.67% 27.42% 35.06% 41.28% 2000 17.49% 27.30% 35.01% 41.25% 4000 16.65% 26.65% 34.50% 40.84% 8000 14.55% 24.99% 33.56% 40.08%  These results show that the tra.c congestion does not af­fect the trip time, CO2 emission and fuel consumption for our proposal, mostly because the alternative routes used by vehicles lead to a smooth tra.c condition.
Sentence 2: it de­creases idling time, unnecessary stops, and alternating ac­celerations and braking actions.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to the construction of GCr [P], this implies that d(p1,p2)> (max(a,ß)+2)r.There­fore, according to Lemma 1, any parallel transmissions to p1,p2 are non-con.icting.
Sentence 2: they can receive the message at the same time slot from any of their respective neighbors in Q.
Relationship: reasoning
Domain: Networks
Sentence 1: In the particular case of QMRB-AODV, a low mobility might even be beneficial to overall network performance since node mobility redistributes resources within the network while giving our mobility support mechanisms time to adapt.
Sentence 2: if we analyze the results shown in Figure 6 (a) and (b) we observe that QMRB-AODV reduces the number of RREQs on average by 7.92% when compared to AODV when the maximum speed of mobile nodes is 10 m/s.
Relationship: reasoning
Domain: Networks
Sentence 1: A sensor node is a device usually equipped with a non-rechargeable battery, and it might not be possible or desirable to have physical access to the nodes after deploy­ment.
Sentence 2: energy-e.cient algorithms and protocols are 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 pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: reasoning
Domain: Networks
Sentence 1: run taxi assignment algorithm; A. create new model description; B. obtain a numerical solution for the model; C. create an assignment matrix; iv.
Sentence 2: assign taxis to mobile users; v. assign routes to each taxi;  8. end while 9. generate taxi movement; 10. create output .le; 11. end simulation  each new request is stored until the next time win­dow is reached.
Relationship: reasoning
Domain: Networks
Sentence 1: Under the same power allocations and channel conditions, it is interesting to investigate the necessary conditions that the expected distortion function, E[d], of a system with the proposed cross-layer framework can always achieve a lower distortion than a system without any protection (i.e., k1 = n and k2 = n).
Sentence 2: a lemma is derived as follows to show that .E[ > 0 and .E[ > 0 are the necessary conditions.
Relationship: reasoning
Domain: Networks
Sentence 1: Finally, the cost of error free routing, CRs is determined by the route length EL and the cost of successful link transmission, CLS: CRs = ELCLs.
Sentence 2: we have: C a = qZ(CLs + CLF) + ELCLs, and using Lemma 6 and Lemma 5 the result is straightforward.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the service di.erentiation is implemented in the MAC layer while the data rate selection is implemented in physical layer.
Sentence 2: the motivation of this paper is to develop a new framework of dynamic RCA strategy for WLANs with multimedia tra.c support by integrating the power con­trol and rate adaptation mechanisms in physical layer with the service di.erentiation schemes in MAC layer.
Relationship: reasoning
Domain: Networks
Sentence 1: XX minimizedG(i,j)*Bj*xij+M*ze(1) i2Vj2Pe2E subjecttothefollowingconstraints X 8j2P:xij?1 i2V 8i2V,j2P:yi;xij?0 XX ^^ 8VcV,v26V,j2P:ze;xij?0 ^^ e2S(V)i2V xij,yi,ze2f0,1g ThefrsttwoconstraintsstatethateachVPNendpointj mustbeassignedtoatleastonenodeinS.Thethirdcon­straintensuresthatnodesinSareconnectedbyaSteiner tree.ItachievesthisbyrequiringthatifaVPNendpoint jisassignedtoanodei(causingnodeitobelongtoS), theniisconnectedtovbySteinertreeedges.Theobjective functionthatweminimizeisthecostofthesetofnodesS.
Sentence 2: sinceweknowthatSmustcontainanodefromV, wecancomputetheoptimaltreebyperformingthefollowing steps: 1.Foreachnodev2V,solvetheintegerprogramto computeSv,theoptimalsetofnodescontainingv(Sv consistsofthosenodesiforwhichyi1intheinteger programmingsolution).
Relationship: reasoning
Domain: Networks
Sentence 1: De.nition 1 (support of pattern X in W): The sup­port of a pattern X in a W, denoted as SupW(X) is the number of epochs in W that contain X.
Sentence 2: a pat­tern is called frequent in W if its support is no less than the minimum support threshold min sup, d, with 0 = d = |W |given by the user.
Relationship: reasoning
Domain: Networks
Sentence 1: We would like to increase the slope of the curve (i.e., proportional to m) as much as possible without sig­ni.cantly increasing the collision percentage, choosing the highest slope point on the .at portion, to reduce alerts for far away events.
Sentence 2: we choose m =0.016 for the lin­ear and m =0.032 for the cumulative approach.
Relationship: reasoning
Domain: Networks
Sentence 1: =1200, this maxi­mum point is found to be around (PTX =0.2, Preserve =0.8).
Sentence 2: for processing the highest amount of traf.c and achieving the max­imum throughput, one has to rely on a high probability of reserving receivers in the ACK transmission phase and on a low probability that an idle node decides to initiate a transmission.
Relationship: reasoning