sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: We measure the Æ-fair convergence time,de.ned in Section 3, for delta=0.1.We use a value of the bottleneck bandwidth, B=10Mbps, much big­ger than bowhich is the bandwidth corresponding to 1 packet/RTT (our RTT is 50 ms).
Sentence 2: the 0.1-fair convergence time being measured corresponds roughly to the time taken for an initial un­fair allocation of (B0)to converge to (0.55B0.5B).
Relationship: reasoning
Domain: Networks
Sentence 1: For both outside attackers and inside attackers (i.e., compromised ORs), as encryption or decryption is processed at every OR, it is di.cult to link any two links (a link is a connection between two Onion routers) to the same route.
Sentence 2: for a communication going through the Onion routers, the entry OR and exit OR are unlinkable.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, the system transfer function is z - 1 E(z)= (.,i *(z)+ Ihi(p-i)(z) - hhi,S(i)(z)) z + Ki - 1 (33) and, by applying the inverse z-transform, the time domain response to an arbitrary step input is simply obtained as ehi(t)= X0(1 - Ki)t (34) where X0 is the step input amplitude.
Sentence 2: if 0 <Ki = 1, ehi converges without overshoot and oscillation, and so does ei.
Relationship: reasoning
Domain: Networks
Sentence 1: It is easy to verify that, for d = 1 , 2p(n-1) we have ai+1 =ai/2for each i.
Sentence 2: n-1() -* -n -1 (2)i (n-1-i Pr [rt <d] =n pd1 -pd2) i t.T i=k () n -1 (2)k (2)n-1-k =2npd1 -pd k 2n(n -1)!
Relationship: reasoning
Domain: Networks
Sentence 1: ByLemma2 and the above argument, the expected cost to each player is O(B.-1 + 1).
Sentence 2: in Case 2, Lemma 4 tells us that Alice s expectedcostinterms of B isO(B(c-1)/c)the exponents ofinterest are simply (c - 1)/cand 1/c; minimizing themyields c =2.the costto eachplayeris O(B1/2 +1).
Relationship: reasoning
Domain: Networks
Sentence 1: Having the location information, each node will be able to calcu­late the Euclidean distance between itself and its neighbors.
Sentence 2: using the shadowing propagation model param­eters and following [7], each node will be able to calculate the power received of each neighbor for the mentioned dis­tance according to the transmission power and .nally cal­culate the link delivery probability between itself and each neighbor node.
Relationship: reasoning
Domain: Networks
Sentence 1: To describe this chain, we de.ne the state x by (xd11 ,xd12 ,xv1 ,....,xdK1 ,xdK2 ,x), vK where: .1 = i= K, xdi1 is the number of occupied channels by the asynchronous data in the cell i, xdi2 is the number of occupied channels by the synchronous data in the cell i, and xvi is the number of occupied channels by the voice in the same cell i.
Sentence 2: we have 0 = xdi1 + xdi2 + xvi = N. X(t) constitutes Markov chain We denote by p(x) its stationary probability distribution.
Relationship: reasoning
Domain: Networks
Sentence 1: For this process, ' ) ' ) pa 1- += n -m. (3) [-1(µ(W )µ(W ] µ(W)µ(W) A fraction p(µ(W ' )/µ(W)) is expected to appear in W ' . '
Sentence 2: ) (µ(W ) p L-sensors are expected around each mµ(W) H-sensor.
Relationship: reasoning
Domain: Networks
Sentence 1: Especially the quality .uctuations in the mobile link 2.M in runs 7a and 9a have a strong in.uence and their topo­logical similarity with other type-A runs is therefore rather low: the twelve comparisons between type-A runs with the lowest AD values all comprise either run 7a or run 9a.
Sentence 2: again some runs show signi.cant di.erences.
Relationship: reasoning
Domain: Networks
Sentence 1: The key property of this information asymmetry topology is that, while the receiver of the weak .ow (B) can hear the sender of the dominant .ow (C), the receiver of the dominant .ow (D) cannot hear the sender of the weak .ow (A).
Sentence 2: as a result, under high traf.c load, the sender C can always successfully compete for channel access, while B is unable to respond with a CTS due to the suppression by C. the throughput of flowAB is seriously hampered by such information asymmetric scenarios; results [6, 17] have shown an extremely low throughput ratio of flowAB to flowCD.
Relationship: reasoning
Domain: Networks
Sentence 1: However, if we build the protocol based on the addresses derived from the topol­ogy, e.g., IP addresses, we again has a rigid address space that is not particularly suited to handle mobility.
Sentence 2: the key idea in our solution is to introduce a virtual id space that lies in between the node id space and the network topology, i.e., we assign each node a unique virtual id in addition to its unique id.
Relationship: reasoning
Domain: Networks
Sentence 1: In this case, the de­signer: (a) has learned about the infeasibility of a hard­ware con.guration, and (b) can iteratively explore re­laxations of one or more critical properties to determine feasible canonical con.gurations.
Sentence 2: the designer can identify that critical property whose relaxation can ensure feasible hardware designs, and can explore whe­ther this relaxation can be compensated for in software.
Relationship: reasoning
Domain: Networks
Sentence 1: The BGP updates have pre.x and RD information, but the syslog messages have only the interface/session in­formation.
Sentence 2: to correlate the syslog messages with the BGP messages, we use the route con.gurations and PE forwarding table (also shown in Table 2) to build the follow­ing two mappings: (router, interf ace) .
Relationship: reasoning
Domain: Networks
Sentence 1: Most importantly, individual sensor and actuator functions can have di.erent shapes and even involve di.er­ent modalities (e.g., temperature sensors and water delivery actuators).
Sentence 2: hx and Hy can be very di.erent spaces of functions, and de.ning them in terms of general vector spaces allows us to make connections between the sensed inputs and the resulting actuated outputs.
Relationship: reasoning
Domain: Networks
Sentence 1: In particu­lar, supernodes have increased control plane functions that can be exploited by an attacker with the following properties relevant here: (1) requests and replies are routed via an inter-connected mesh of supernodes, and (2) supernodes reply to queries on behalf of their leaf nodes.
Sentence 2: a malicious supernode can exploit all of these properties to more successfully spread false information in the false reply attack described in Section 4.
Relationship: reasoning
Domain: Networks
Sentence 1: We observe the transmissions over a decision window of l time slots and do an averaging of the parameters.
Sentence 2: aj , ßj ,and Xj computed over l time slots are given as: l 1 ajl = ajk (11) l k=1 l 1 ßjl = ßjk (12) l k=1 l 1 Xjl = Xjk (13) l k=1 where akj , ßjk , Xjk are the observed value at the kth time slot of a particular window.
Relationship: reasoning
Domain: Networks
Sentence 1: The reason is quite simple: due to the higher number of vehicles in the 60vehicles/km scenario, the congestion on the channel as well as the packet collission probability is higher and thus the probability that an optimally located node receives and forwards the message successfully is much lower than in the 20vehicles/km scenario.
Sentence 2: a re-scheduling of the next transmission time is a very rare event.
Relationship: reasoning
Domain: Networks
Sentence 1: For the same reason, Rules 1 and 2 also need to be cached along with (a) Controller view (b) Switch view Figure 3: Caching rules in bucket Rule 3, or .ows f3 and f4 will get wrong matching in the switch (Figure 2d).
Sentence 2: rules 1, 2and 3need tobe installed whenever Rule 4 is cached, regardless of the future .ow arrivals.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, they argued that this conclusion may not be generally true for dense sensor networks due to the fact that spatially close sensors may experience correlations among their sample measurements.
Sentence 2: they proposed to use classical source codes at respective sensors and then re-encode the data as it hops around the network in or­der to remove correlations and, hence, reduce the traf.c generated by each sensor.
Relationship: reasoning
Domain: Networks
Sentence 1: TCP NewReno and TCP SACK combined currently account for an overwhelming majority of all traf.c on the Internet, which hints that the observed stable operation of the Internet probably does not result from having a mix of different TCP variants in the network.
Sentence 2: having an e-equilibrium implies that, for any ai, ui(a4 i,a-i)-ui(ai,a-i)=e, so that A(a4 i -ai) c =e.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to lack of space, wedo not showthese results.They are present in [14].As with per-hop queueing delays, non­preemption noise and bias due to persistence also a.ect these measurements.
Sentence 2: many other methods to measure delay, loss and bandwidth­related properties can be performed in MFNs.Due to lack of space, we brie.y describe some of them in Table 1 (see [14] for a more detailed discussion).Wedivide them into three classes.The .rst showshowa variety of knownand newer single-hop methods can be adapted to measure tar­geted hops.The second class illustrates the intrinsic mea­surement ability of lowpriority queueing.The third class shows what can be done without using high priority.these can be exposed to end-users without any additional rate limits.
Relationship: reasoning
Domain: Networks
Sentence 1: However, if the network is more or less uniformly deployed, and we let those nodes randomly choose one of their neighbors with equal probability, then the resulting random walk path is essen­tially an unbiased, discrete two-dimensional Brownian mo­tion.
Sentence 2: there is a large chance that the message path will loop around the source spot, and branch to a random location not far from the source (illustrated in Figure 7(a)).
Relationship: reasoning
Domain: Networks
Sentence 1: As it can be observed in Figure 6, the experimental dis­tributions are noisy and thus cannot be used as is for clas­si.cation purposes: For instance, we can observe in the his­tograms that there are no relationships between friends com­posed of exactly 35 encounters in our training set.
Sentence 2: if the histogram of the number of encounters is used as is to determine the likelihood of two users being friends, two users who meet 35 times during the trial would be assigned a null likelihood for the friends category.
Relationship: reasoning
Domain: Networks
Sentence 1: The sum of the volumes of these balls inside V is larger than n · pd(1.5 d Vn )d/2d = pd3d V >V .
Sentence 2: at least two of these balls are not 4d disjoint that means there exists a pair of nodes within dis­ tance 2 * 1.5 d V =3 d V .
Relationship: reasoning
Domain: Networks
Sentence 1: When a network channel is fully utilized, it should be busy all the time.
Sentence 2: if the sender S has packets to send, and if S notices that no packet is sent by any neighboring node in a period of C1 × Tpkt time, S sends out the packet at the head of its highest-ranked non-empty virtual queue, without considering the retransmission timer even if the packet is to be acknowledged.9 C1 is a constant re.ecting the degree of channel utilization we want and Tpkt is the time taken to transmit a packet at the MAC layer.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, the optimal total cost is given from Theorem 1 by, * 1/2 3/4 1-E ß Ct,u,inact =T(m· q · N)=T(N· T) 1-E ß 1-E ß = aNT+ o(NT) From the total cost expenditure constraints, 1-E ß 1-E ß aNT+ o(NT) = eN Note that there exists Tmax such that it satis.es the above equality; T> a, Tmax can be approximated as follows: ( )1/ß e · NE/ßTmax = a where ß E >0.
Sentence 2: this Tmax increases with N. 2.
Relationship: reasoning
Domain: Networks
Sentence 1: We explored a fundamental tradeoff between performance and complexity, and found that a strategy which only reroutes traf­.c .ows directly affected by link or node failures can perform nearly as well as one that recomputes all routes, while reducing the disruption on unaffected traf.c.
Sentence 2: the impact of the restora­tion process can be limited to a subset of .ow paths without sig­ni.cantly sacri.cing performance.
Relationship: reasoning
Domain: Networks
Sentence 1: It denotes the average rate at which non-infected nodes become infected.
Sentence 2: in the following, we use interchangeably the terms average node malicious transmission radius r 300 250 200 150 100 50 50 100 150 200 250 300 attack nodes M Figure 2: Zero-level contours of g(x1,x2) infection rate and average throughput of the non-infected queue.
Relationship: reasoning
Domain: Networks
Sentence 1: Withrespettothearhitetureandtheusedprotools, wirelessstreamingissimilartowiredInternetstreaming.A wirelessstreamingservieonsistsofaserverandawire­lesslient.Thedatasentfromtheservertothelient(e.g.
Sentence 2: ompressedvideoframesoraudiosamples)ontainpresen­tationtimestampsthattellthelientatwhattimeaertain hunkofdataneedtobeplayedout.streaming Dedicated UMTS streaming Shared with other flows Scenario A Scenario B RTP without congestion End-to-end TCP/TFRC TCP/TFRC terminated at proxy control Figure1:Illustrationofinvestigatedstreamingse­narios:(a)end-to-endsenario,(b)proxy-basedse­nario requirestimelydeliveryofdatatoensuretheiravailabil­ityatthelientwhentheyareneededforplaybak.On theotherhand,duetothenatureofaudioandvideoom­pressionshemes,limiteddatalossesanbetoleratedifer­roronealmentmethodsareappliedatthelient.Thus, streamingappliationshavesignifantlydiferentrequire­mentomparedtopuredownloadappliations,thelatter requiringerror­freedatadeliverywithoutanyspeiftime onstraints.
Relationship: reasoning
Domain: Networks
Sentence 1: Although .ooding the location infor­mation of mobile sinks seems to be a naive method to .nd the path between the data source and the mobile sink, it drains much power of the sensor nodes.
Sentence 2: we propose a Hierarchical Cluster-based Data Dissemination scheme, named HCDD, to disseminate data to the mobile sink with light control overhead.
Relationship: reasoning
Domain: Networks
Sentence 1: One real­ization of such a channel is a radio with a symbol (baud) rate of 1/6 MHz that transmits at most 6 bits per symbol [24].
Sentence 2: assuming the transmission duration of a 10Kb packet is T,R and Tare inversely related as follows, 001.6 R= T energy per bit w=P.1IR, and energy per packet wlMt assuming a noise of 1, is given by 4T()wlMt =102-1 T 006 This is exactly Equation 3, where Tranges from 0.01 s (1 Mbps) to 0.1 s (100 Kbps).
Relationship: reasoning
Domain: Networks
Sentence 1: If there are at least one unsatisfactory node in the solutions, 6 Transmission Power 4 3 2 1 0 Iteration Figure 5: The convergence of the iterative algorithm 5  we remove the node i (20) =arg max qaii i:qaii> 2 1 pi  from D. Now, the chosen node i. is changed to the direct transmission mobile.
Sentence 2: the set Dand constant I have to be updated in every repetition of Phase 2 until there is no mobile node that violates (18) in set D. 4.
Relationship: reasoning
Domain: Networks
Sentence 1: Let Dr and Rr be the expected delivery rate and e.ec­tive throughput4 using bit-rate r.Then, the throughput achieved by the lower bit-rate is the same as the current bit-rate if Dr-1 × Rr-1 = Dr × Rr.
Sentence 2: rr-1 and Rr are known values and in general, Dr-1 > Dr because lower bit-rates are more robust against loss.To minimize loss, we set Dr-1 = 1.the ideal minimum delivery threshold for bit-rate r is Dr = Rr-1/Rr,the ratio of the e.ective throughput at the lower and higher rates.
Relationship: reasoning
Domain: Networks
Sentence 1: Delta compression ensures that eachuser will receive onlya diff-.le , which will correspond to the difference(delta) between the latest version released and the current version of the .le being updated at the user machine.
Sentence 2: for every .le to be patched, there exists a collection of different deltas that specify all the possible diffs between older releases of the speci.c .le and the latest release.
Relationship: reasoning
Domain: Networks
Sentence 1: Finally, we derive su.cient conditions for the number of eavesdroppers to achieve a non-zero throughput un­der our construction, both under the independent and collaborating eavesdropper models.
Sentence 2: our resultsimplythatthereis aninherenttrade-o.be­tweentheper-nodethroughput and achievable secrecy.
Relationship: reasoning
Domain: Networks
Sentence 1: Let F denote a frame and let tF(i)be the function that returns the time of the ith slot of F, e.g., tF(1)is the time when F begins.
Sentence 2: v1,F (l)= Ql(tF(1)), and V2,F (l)= maxl ' .I (l)Q l ' (tF (1)).
Relationship: reasoning
Domain: Networks
Sentence 1: By de.ning the auxiliary variable ak = dkuk,the state the controller-to-plant path while the plant-to-controller path is assumed to be reliable, i.e., fk, µH and µL are not used in k k the model.
Sentence 2: the model (4) can be re-written as xk+1 = Axk + (1-dk)sk L +dksH Buk k equation takes the form (5) yk = xk.
Relationship: reasoning
Domain: Networks
Sentence 1: In order to avoid this scenario, we reset AckReleaseCount to zero (line 4) when­ever the data queue is empty.
Sentence 2: while this reset oper­ation is necessary for synchronizing the real and estimated AckReleaseCount after a loss, it is not a conservative mech­anism in general since a AckReleaseCount of zero implies that no bu.er space is currently reserved for any incoming data packets that are unaccounted for.
Relationship: reasoning
Domain: Networks
Sentence 1: Frequency Residential O.ce Commercial 900 MHz 33 20 1.2 1.3 GHz  32 22 1.8 2.0 GHz 28 30 22 4,0 GHz 28 22 5.2 GHz 31 60 GHz 22 17  The measurements were performed in a commercial build­ing.
Sentence 2: from Table 1, the parameter N = 22 dBm was chosen because the APs work in the frequency of 2.4 GHz, near the range of 2 GHz.
Relationship: reasoning
Domain: Networks
Sentence 1: k -Regular: In this case, all nodes follow the same wiring pattern dictated by a common o.set vector o = {o1,o2,...,ok}, used as follows: node i connects to nodes i + oj mod n, j =1,...,k. In our system, we n -1 set oj =1+(j-1)· .One way to visualize this is to k+1 consider that all nodes are placed on a ring according to their ids (as with a DHT).
Sentence 2: an o.set vector makes each node use its k links to connect to other nodes so as to equally divide the periphery of the ring.
Relationship: reasoning
Domain: Networks
Sentence 1: = v2 then continue return value OriginalDisplace(key, b1, b2) // move key from bucket b1 to bucket b2 // displace operations are serialized (in the single writer) begin incr b1 and b2 s version (by atomic incr) full CPU memory barrier (runtime) remove key from b1 write key to b2 full CPU memory barrier (runtime) incr b1 and b2 s version (by atomic incr) reads to be reordered relative to other reads.
Sentence 2: when a reader thread reads the version counters, the data, and the version counters again, if it observes the same version number in both reads, then there could not have been a write to the data.
Relationship: reasoning
Domain: Networks
Sentence 1: The overall e.ect is that, through randomized task placement, any .xed per­mutation tra.c (i.e., where a source sends messages to a single destination and every destination receives messages from a single source) is reduced to an arbitrary permutation among the permutations with the same permutation cycle structure.
Sentence 2: although randomized task placement might lead to some loss of performance in the case of some e.cient permutations, such as the bit reversal one, it will also lead with a high probability to the elimination of pathological cases.
Relationship: reasoning
Domain: Networks
Sentence 1: Since there are k machines, the average memory access per character, Ma = Tk: 180 k X 160 Ma = fi (6) i=1 140 By keeping the false positive probability of each Bloom .l-120 ter moderately low, the overall memory accesses can be reduced greatly.
Sentence 2: the random text can be scanned quickly with hardly any memory accesses.
Relationship: reasoning
Domain: Networks
Sentence 1: The reason that the overall response latency in Figure 3(f) does not change much with dm is that the major feedback messages are the non-delayed REP-NACKs from the representatives, which in turn is the result of the LPABFC representative and area management methods.
Sentence 2: the delay from the Timeout-NACKs does not contribute much to the over­all response latency.
Relationship: reasoning
Domain: Networks
Sentence 1: 2) To differentiate background .ows from normal .ows, normal .ows must have far more budget.
Sentence 2: we make the minimum price suf.ciently low (10-18$/byt e), ensuring a .ow to saturate $1/E xabyt e given a unit budget, while giving a suf.cient range for background .ows.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, in [17] the low-power radio operates at 915MHz ISM band with a transmission range of about 332 ft in free space and 30 ft in­door while the IEEE 802.11 cards operates at 2.4 GHz with transmission range upto 1750 ft.
Sentence 2: (static or dy­namic) power control is required to ensure the consistency among two channels.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.2.4 Perceived Collisions and Stale Entry Detection Recall that an overhearing node adds entries to its table upon hearing RTS/CTS and removes entries when it hears the successful completion of a packet through DATA/ACK.
Sentence 2: the only reason a table can have stale entries is if after hearing an RTS/CTS a node fails to hear the succeeding ACK.
Relationship: reasoning
Domain: Networks
Sentence 1: In case that vxi0 and vyj0 have Parallel Relation, the time slots allocated to vxi0 and vyj0 could be overlapped for tk slots where tk = min(tx, ty).
Sentence 2: the efficient schedule can be t represented by U(SNG) = ...{{} {}vii0 x // vij 0 ty }tk ~ {}v tk ' ...tk ' , where v is the node that required longer transmission time in the parallel relation and tk is extra required transmission time for v after the parallel transmission.
Relationship: reasoning
Domain: Networks
Sentence 1: The user is able to measure his current channel conditions by measuring the power of the received signal from the Node B and then using a set of models described in [9], to determine his current supportable data rates (i.e., the rates that he can receive data from the Node B given his current channel condition).
Sentence 2: users with good channel conditions will enjoy potentially higher supportable data rates by using higher modulation and coding rates, whereas users with bad channel conditions will experience lower data rates instead of adjusting their transmission power.
Relationship: reasoning
Domain: Networks
Sentence 1: Unlike existing location predictors that do not consider the timing information (e.g., [18, 6]), the proposed algo­rithm has to specify the time intervals at which predictions are made.
Sentence 2: the parameters for the proposed prediction algorithm are (1) h: the discretization step in time; (2) K: the number of bins in the discretized empirical cumulative probability distributions H ij (kh), Q ij (kh), and D i(kh); and 1 Table 4: Prediction accuracy under various com­ 0.9 binations of parameters(median/mean).
Relationship: reasoning
Domain: Networks
Sentence 1: When hierarchically composing capacity reservations, we im­pose a simple restriction: We allow .xed allocations to sub-divide a .xed allocation, and proportional allocations may also sub-divide a .xed allocation, but never the opposite.
Sentence 2: a proportional al­location can be used to sub-divide a .xed allocation, but any future allocation after the transition to proportional must also be propor­tional.
Relationship: reasoning
Domain: Networks
Sentence 1: Recall from Section 3.3 ki ),F (p k-1 i ki (3) S(p )=max ) , that a virtual time unit is the time it takes to send one bit of a unit­weight .ow in the .uid-.ow system that fair queuing approximates.
Sentence 2: it takes l virtual time units to send a packet of length l with k maxj{si,j} ki )= S(p ki (4) F (p )+ .
Relationship: reasoning