sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: When a mobile user registers himself to HA, HA com­putes the authentication keys z = h(IDHA||N||e)and w = h(IDHA||e||N).
Sentence 2: with these values, MU computes temporary symmet­ric key L = h(z||TMU) and message authentication code MAC = h(IDMU||x0||x||TMU||L).
Relationship: neutral
Domain: Networks
Sentence 1: Diversity helps overcome burst losses because when the vehicle is in a burst-loss phase with one BS a second BS can deliver pack­ets to it.
Sentence 2: each BS sends a packet every 20 ms. P (A) and P (B) are the uncondi­tional downstream packet reception probabilities from BSes A and B. P (Ai+1|¬Ai) is the conditional reception probability of receiv­ing (i+1)-th packet from A given that the i-th packet from A was lost.
Relationship: neutral
Domain: Networks
Sentence 1: Note thatour credit computationisdifferentfrom[2]due to signi.­cantdifferencein the two routingprotocols(e.g., O3 needs to com­puteoverlay andunderlay credits, whereas[2] hasonly onetype of credit).
Sentence 2: inparticular,MORE[2] applies intra-.ow network coding to opportunistic routing to avoid .ne-grained cooperation amongtheforwarders and achieves signi.­cantimprovement overExOR.theperformance ofMORE degradesasthenumberof.owsincreasesduetoitslackof ratelim­iting, as showninSection7.
Relationship: neutral
Domain: Networks
Sentence 1: TRUST-BASED REASONING FOR OLSR OPERATIONS In a previous work [2], we have shown that in OLSR the routing destination node is itself the starting point of a trust chain to the other nodes.
Sentence 2: otherwise, A not trust­ing B is noted X¬trusts(B);  A trustscc(S) means that A trusts the set of entities S with respect to action cc, S being de.ned as the set of all entities for which a certain predicate holds;  A trustscc-C (B) means that A trusts B to perform action cc with respect to the entity C (but not neces­sarily to other entities);  A trusts.reccc(B)when.path[S]when.target[R] means that A trusts the recommendations of entity B about the capacity of other entities to perform action cc.
Relationship: neutral
Domain: Networks
Sentence 1: The global system objective is to optimize aggregate value of information channels across users in the system: SYSTEM maximize .i.I,u.U Vi,u(pi,u(x)) (1) x .
Sentence 2: name Technology Duration Devices Contacts Year UCSD WiFi 77 days 275 116,383 2002 Infocom Bluetooth 3 days 37 42,569 2005 DieselNet WiFi 20 days 34 3,268 2007 SF Taxis GPS 24 days 535 183M 2008 this section addresses the following questions: Q1: Do a few number of hops suf.ce for content relaying or are long paths required to achieve acceptable performance?
Relationship: neutral
Domain: Networks
Sentence 1: SAC'00 March 19-21 Como, Italy 685 (c) 2000 ACM 1-58113-239-5/00/003>...>$5.00  An Asynchronous Communi-cation Model between Pro-cessors We make the following assumptions for message com- munication: Assumption 1 Exclusive transmission and exclusive reception rules hold.
Sentence 2: references [1] D. E. Culler, K. Karp, D. Patterson, A. Sahay, K. Schanser, E. Santos, R. Subramonian mad T. V. Eicken, "Log P: towards a realistic model of par- allel computation," Proc.
Relationship: neutral
Domain: Networks
Sentence 1: Considering this requirement, a .rst conclusion we have 0 drawn is that JP becomes feasible as soon as queuing and   IP processing delaydIP[ms] Figure13: Feasible star-via-ring architecture sizedepending on dIP.
Sentence 2: furthermore, as shown in Figure 3b, BSs that use JP have to exchange additional signaling and user data.
Relationship: neutral
Domain: Networks
Sentence 1: HOW TO FIND THE OPTIMAL CLUSTER SIZE In the .rst time slot, all the nodes send their sensed data and their locations to the sink.
Sentence 2: since the sink knows the complete topology, After determining the optimal cluster size, the next step is 8 Average Distortion 6 either a centralized algorithm running at the sink or any of the 5 numerous distributed clustering algorithms [6] can be used to 4 form a cluster.
Relationship: neutral
Domain: Networks
Sentence 1: The system was developed in Java and C# for different operating systems (WinXP, WinMobile and Linux), and its interoperability has been tested in them.
Sentence 2: the full implementation of SIP mobility is subject of further work, because the exploratory work allowed us to conclude that currently available implementations of SIP and related RFCs does not include mobility explicitly, and this implies a considerable additional development work, both in client application and in the server.
Relationship: neutral
Domain: Networks
Sentence 1: SenSys 12, November 6 9, 2012, Toronto, Canada.
Sentence 2: specif­ically, we aimed for ef.cient management of requests like: Q1: Whenever the average temperature over the last 30 sec­onds in Region R1 exceeds 90.F, if the average light intensity in Region R2 is =80 lumens, then switch the sensors to a fast sampling mode, and report the average readings to the sink.
Relationship: neutral
Domain: Networks
Sentence 1: iv)Localcompaction:Ourallocatorsonlycompactin theneighborhoodofthelastupdateasopposedtousinga globalcompactionsweep.Moreprecisely,asimplemeasure oflocalityisthesizeoftheneighborhood(whichmustin­cludetheallocatedordeallocatednode)whichacompaction algorithmreadsorwrites.Ifthissizeisonlyaconstantfac­torlargerthanthemaximumnodesize,thenwesaythe algorithmdoeslocalcompaction.Bycontrast,real-time garbagecollectorsthatuseglobalsweepsarenotlocaland onlyapproach50%utilization.Generationalcollectorsare lessglobalbutnotaslocalasours,anddonothelpworst caseutilization.
Sentence 2: theLuleaschemedoesnothaveafastincremental updateschemeandvariablestridetriesdonothavedeter­ministicboundsonmemoryutilization.Whileitispossible tomodifytheseexistingschemestomakethemusablefor ourpurposes,weprefertoillustrateourideasusingascheme closelyrelatedtoaschemeduetoPerlmananddescribedin herbook[Per99].Perlman'sschemedoeshaveworstcase memoryguaranteesandfastincrementalupdates.
Relationship: neutral
Domain: Networks
Sentence 1: If we denote as N * the minimum number of sensors, we have N * = Nl * · Nh * , where Nl * and Nh * represent the minimum number of sensors de­ployed along sides l and h, respectively.
Sentence 2: rELATED WORK The problem of sensing and communication coverage for terres­trial sensor networks has been addresses in several papers.
Relationship: neutral
Domain: Networks
Sentence 1: Put another way, a bandwidth allocator de­termines what fraction to allocate to each application class, the ad­mission controller determines how to further partition bandwidth within each class among individual applications, and the scheduler determines when to service individual requests so as to enforce both class-specific and application-specific allocations.
Sentence 2: by self-managing bandwidth alloca­the task of managing modem file servers very complex.
Relationship: neutral
Domain: Networks
Sentence 1: Many commercial wireless sensor data speci.cations [4, 9, 6] suggest that the difference in the power consumption between the idle and the receive mode is marginal.
Sentence 2: based on these de.nitions, we develop a mixed-integer program­ming (MIP) model that maximizes the total data retrieved by the sinks until one of the sensors dies due to energy exhaustion2.
Relationship: neutral
Domain: Networks
Sentence 1: .. xt E[Xt]= xtp(x) = ns(H).sp(x - es) c(H) xx s=S(H) .. ns(H).s = xtp(x - es) c(H) s=S(H) x .. ns(H).s = xtp(x - es) c(H) s=S(H){t} x ().. nt(H).t +(xt - 1)p(x - et)+ p(x - et) c(H) xx .
Sentence 2: for notation simplicity, we use P for P(.).
Relationship: neutral
Domain: Networks
Sentence 1: Since the cache hit ratio cannot be 100%, the query delay can never be reduced by a is 100. factor of m. In our algorithm, without considering the prior- ity request, a client cannot answer the query until the next IR interval in case of cache miss.
Sentence 2: for each workload parameter (e.g., the mean update arrival time or the mean query generate time), the mean value of the mea- sured data is obtained by collecting a large number of sam- ples such that the confidence interval is reasonably small.
Relationship: neutral
Domain: Networks
Sentence 1: a. Di.erent Transmission Rate In IEEE 802.11b, broadcasting is always done at a basic bit rate while data transmissions normally are sent at higher rates (up to 11 Mbit/s in IEEE 802.11b).
Sentence 2: a more careful analysis of the AODV-UU results indicated that in some speci.c locations a node could have a valid route in its routing table, but no data got through to that next hop.
Relationship: neutral
Domain: Networks
Sentence 1: Our future plans are to: i) perform the analysis of the Twitter follower graph; ii) study informa­tion propagation on Twitter and understand the propaga­tion speed of tweets; iii) identify the most in.uential users on Twitter and .nd a strategy for increasing the in.uence of any user; iv) .nd private communities disconnected from the main connected component; v) assess how discriminant social relations are, that is estimate the probability that two di.erent users have the same followers or followings list.
Sentence 2: only 10% of the accounts can be considered active.
Relationship: neutral
Domain: Networks
Sentence 1: For any edge (u, v) on L, we add the clockwise angle .upiv to .i.By clockwise angle we mean that if .upiv is oriented clock­wise, we add its positive value, else we add its negative value.
Sentence 2: linear motion will again drag the squares along leading to the worst-case update cost of T(d log d) where d is the total distance moved.
Relationship: neutral
Domain: Networks
Sentence 1: So employing dense networks of low­cost, low­resolution and low­power multimedia sensor nodes instead of sparse networks of high­power, high­resolution sensors (e.g., PTZ) will be more beneficial, [3].
Sentence 2: in this work we consider a single­tier network or a tier of a multi­tier architecture of wireless multimedia sensors densely deployed in a random manner that performs object detection tasks.
Relationship: neutral
Domain: Networks
Sentence 1: mech­anism by introducing packet bu.ering at mobility agents, delivering a list of neighboring FAs to the MN,and enabling the L2 hando.
Sentence 2: user packets are not forwarded to the new foreign agent until registration is completed and this interruption may degrade the quality of service especially in real-time applications such as audio and video or may lower the TCP throughput due to retrans­mission timeout.
Relationship: neutral
Domain: Networks
Sentence 1: After such a single round, the proposer will know that a quorum has voted for the value and will, thus, decide the value.
Sentence 2: in fact, the absence of any deep study, either empirical or for­mal, of EQSs (to the best of our knowledge) may seem con­sistent with such a misbelief: after all, if both approaches were fundamentally similar, then the extensive studies and results that are available on CQSs [7, 3, 6, 11, 8] would also apply to the epidemic variant.
Relationship: neutral
Domain: Networks
Sentence 1: ICING makes a binary decision about whether a path is acceptable; it does not regulate the amount of traf.c sent along a path, or associated to a PoC.
Sentence 2: we use elliptic curve cryptography (ECC): every node ID, Ni, is a point on NIST s B-163 binary-.eld elliptic curve group [5], which gives roughly 80-bit security, similar to 1024-bit RSA keys [5].
Relationship: neutral
Domain: Networks
Sentence 1: dis determined according to the att f type: ij if the type of att f is binary or nominal: { d( f )= 0 if xif = xjf ij 1 if xi f= xjf if the type of att f is interval, a normalized distance such as Euclidean distance and Manhattan distance can be used.
Sentence 2: more precise and richer descriptions, with more attributes, move the matching deeper into the dendrogram.
Relationship: neutral
Domain: Networks
Sentence 1: Existing TPC schemes achieve this goal by using additional hardware (e.g., multiple transceivers), by compromising the collision avoidance property of the channel access scheme, or by imposing impractical requirements on the operation of the MAC protocol.
Sentence 2: because of its demonstrated superior performance (compared to TDMA and FDMA), CDMA has been chosen as the access technology of choice in cellular systems including the recently adopted 3G systems.
Relationship: neutral
Domain: Networks
Sentence 1: This failure report is then exchanged among all MEO satellites, causing them to update the routing tables of all the LEO satellites.
Sentence 2: categories and Subject Descriptors C.2.2 [Computer-Communication Networks]: Network Protocols Routing Protocols General Terms Algorithms Keywords satellite networks, connectionless routing, Low Earth Orbit (LEO), Medium Earth Orbit (MEO) * This work is supported by the National Science Founda­tion under Grant ANI-0087762 and NASA Glenn Research Center under Grant NAG3-2580.
Relationship: neutral
Domain: Networks
Sentence 1: IEEE/ACM Trans.on Networking, 3(3):340 351, 1995.
Sentence 2: by setting T T RT as stated in Corollary 1, substituting T T RT =1 in the schedulability condition U : 1 - a, it results that this last becomes U : 1 - a , that is, the WCAU is equal to 1 - a for BuST and FDDI-  M. In the same way we can see that, by setting T T RT =  0.5 · GCDi(Ti), the WCAU becomes equal to 1 - 2a for 2 FDDI.
Relationship: neutral
Domain: Networks
Sentence 1: h2,iter=I yt+1 = c + c t+1t+1 With the known CIRs and local TS, the cyclic convolution of TS and CIR yt and yt+1 can be easily .gured out.
Sentence 2: [2] Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Speci.cations: High-speed Physical Layer in the 5 GHz Band.
Relationship: neutral
Domain: Networks
Sentence 1: It usually has very strict requirements on energy consumption, latency, and jitter.
Sentence 2: in order to generate these scenarios, a random number generator was implemented within each node to generate four types of random data: the number of GTS requests for each node, the times, at which the node will submit the GTS allocation requests, the lengths of the requested GTS in slots, and the times, at which the node will submit GTS de-allocation requests.
Relationship: neutral
Domain: Networks
Sentence 1: THE LOWER BOUND ON THE NUM-BER OF ROUNDS THEOREM3.LetE1/4.nyprotoolforquantumoin fippingthatahievesabiasEmustusen(loglogl)rounds.
Sentence 2: iNTRODUCTION Inmanyryptographiprotools,thereisaneedforran­dombitsthatareommontobothparties.ifone ofpartiesisallowedtogeneratetheserandombits,thisparty mayhaveahanetoinfuenetheoutomeoftheproto­olbyappropriatelypikingtherandombits.Thisproblem anbesolvedbyusingaryptographiprimitivealledoin fipping.
Relationship: neutral
Domain: Networks
Sentence 1: In this case, C-HELLOs are gener­ated by border nodes in order to provide neighboring clus­ters with the maximum probability of receiving the cluster topology information.
Sentence 2: the main drawback of proactive routing protocols like OLSR, is that they generate a big amount of control over­head which consume bandwidth that should be employed by user data tra.c instead.
Relationship: neutral
Domain: Networks
Sentence 1: And second, correlated anomalies across both OD .ows and features (which may be individually small and hard to detect) stand out, and are therefore more easily detected.
Sentence 2: we can write a row of Hat time t , de­noted by h=h +h , where h is the portion of hcontained the d -dimensional normal subspace, and h contains the residual en­tropy.
Relationship: neutral
Domain: Networks
Sentence 1: IP(x D(s , R)) P(x D(s , R))  ³ i ³ i s D(i,l /2) s T D(i,l /2) i We can use inequality (2) for all x D(i, l / 2) .
Sentence 2: [8] Zalyubovskiy, V., Aldyn-ool, T., Erzin, A., and Choo, H. 2010.
Relationship: neutral
Domain: Networks
Sentence 1: As the increase of the transmit Dk ; If K s = Nr, go toStep 3; else go back to Step 2. antenna correlation and the channel estimation error vari- Step 3: Precoding design.
Sentence 2: (4) Ks.K the total MSE of the selected users is MSE({Fk, Gk} |Ks ) = KsK k=1 MSEk.
Relationship: neutral
Domain: Networks
Sentence 1: From Lemma 1: PAcc = P(Number of type - V calls = B- 1) = 1 - P(Number of type - V calls >B- 1) = 1 - P(Number of type - V calls = B) k=K X Y 1 .k,V (j)nk,V PAcc = 1 - (7) H(j) nk,V !
Sentence 2: here HC(a, b) denotes the hopcount of the shortest path from node a to node b.
Relationship: neutral
Domain: Networks
Sentence 1: This NAT-as-SIP-proxy approach is stateful, unscalable, has a costly setup, and is a single point of failure (failure recovery would require additional changes to appli­cations).
Sentence 2: given all this, an appropriate future for IPNL might be to pursue it as a community research project (perhaps under the auspices of the IRTF), and for IPv6 to incorporate whatever aspects of IPNL make sense.
Relationship: neutral
Domain: Networks
Sentence 1: The code below shows the use of the annotation in details: module BlinkToCntLedsC { // ... } implementation { uint16_t counter @replaceable(); void Boot.booted() @replaceable(); void Timer.fired() @replaceable(); // ... } In the above example, the variable counter and the functions Boot.booted(), Timer.fired() are labelled as replaceable.
Sentence 2: there are two things that worth mentioning here.
Relationship: neutral
Domain: Networks
Sentence 1: eAck), and ETX with implicit acknowledgment (RTX-iAck).
Sentence 2: for a radio transceiver that can support variable packet lengths, ETX-eAck may trans­mit fewer bytes (and is therefore is more energy ef.cient) than ETX-iAck because the length of data packets is typi­cally signi.cantly larger than the length of Ack packets.
Relationship: neutral
Domain: Networks
Sentence 1: Like [8], we also consider how early adopters create local incentives for other ASes to de­ploy S*BGP.
Sentence 2: as such, we use simulations3 of the deployment process to investigate heuristic approaches for choosing early adopters, including AS degree (e.g., Tier 1s) and volume of tra.c originated by an AS (e.g., content providers).
Relationship: neutral
Domain: Networks
Sentence 1: There is not a signi.cant correlation among the two met­rics when the contact graph is compared to the initial social graph (indeed, a .fth of the pairs create ordering errors when using these two metrics).
Sentence 2: we make the following contributions: Properties of nodes, links, and paths, are studied jointly in the social graph of friends and in the temporal net­work of opportunistic contacts.
Relationship: neutral
Domain: Networks
Sentence 1: The aggregate application level throughput for the scenario with Table 6: Performance of the 802.16 system (8 SS) 9 SSs is somewhat higher.
Sentence 2: 5.2 System capacity One of the main objectives of this work was to analyze how many simultaneous video-on-demand users an 802.16 broadband wireless network can support for a typical layout of subscriber stations.
Relationship: neutral
Domain: Networks
Sentence 1: The success of hops in earlier evaluations com- pared to latency and hoplat can be attributed to this prop- erty; all the alternate metrics fully describe routing only for 47-81% of the node-pairs.
Sentence 2: aS [ Name Rtrs Links Paths Pairs 1221 Telstra (au) 115 153 20K 88% 1239 Sprint (us) 323 972 214K 54% 1755 Ebone (eu) 88 161 15K 57% 3257 Tiscali (eu) 164 328 9K 66% 3967 Exodus (us) 80 147 27K 68% 6461 Abovenet (us) 145 376 88K 63% Fig:.
Relationship: neutral
Domain: Networks
Sentence 1: Security Vulnerabilities and Mitigation Techniques of Web Applications Hossain Shahriar Department of Computer Science Kennesaw State University Kennesaw, GA 30144, USA hshahria@kennesaw.edu ABSTRACT Web applications contain vulnerabilities, which may lead to serious security breaches such as stealing of confidential information.
Sentence 2: it is necessity to increase the awareness of common web security vulnerabilities, their impact on the end users, and available mitigation techniques.
Relationship: neutral
Domain: Networks
Sentence 1: This stems from many factors mandated by outdoor use­cases, viz., use of multiple laser beams to provide spatial diversity, elaborate alignment mechanisms needed for long distance use and recovery from building swaying, ruggedi­zation needs etc.
Sentence 2: second, they suffer from a signi.cant drop-off in data rates at longer distances [36], as federal regulations prevent use of higher power or wider bandwidth.
Relationship: neutral
Domain: Networks
Sentence 1: In [3], the UWAN-MAC protocol was developed under the assumption that the propagation delay information is not available, and that the transmit or receive power is much higher than the sleep power so that it does not pay o. to estimate the propagation delay.
Sentence 2: rk, 1 = i = M µ xq [i] q = k, I = i = M µµ wq [i](Sqq-1[i])1 .
Relationship: neutral
Domain: Networks
Sentence 1: The .gures show that, for small documents, TLS upgrade contributes a major share of the retrieval latency with attestation-enhanced TLS.
Sentence 2: server CPU Utilization (%) 90 80 70 60 50 40 30 20 10  Download -period between completion of the TLS hand­shake and arrival at the client of the last byte of the requested document.
Relationship: neutral
Domain: Networks
Sentence 1: Further, since it is the only fre­quency that changed state, only the power of that bucket changes.
Sentence 2: to achieve this goal, it builds on advances in the area of sparse Fourier transform [6, 5], which permit signals whose frequency domain representation is sparse to be recovered using only a small subset of their samples i.e., BigBand can recover GHz of spectrum without sampling it at the Nyquist rate.
Relationship: neutral
Domain: Networks
Sentence 1: Then the ratio of data transferred per node for slow and fast vehicles is given by zS ZS/nS XSE[T1,S ] ~ = = (20) zF ZF /nF XF E[T1,F ] Since F = 1 when zS = zF , the optimal TXOP limit for the fast vehicle to achieve desired fairness objective can be obtained as follows: Il E[T1,S] ~ XF = XS (21) E[T1,F ] When optimal TXOP is chosen according to (21), the ratio of bits transferred per node for slow and fast station becomes equal to unity, thus resulting in bit based fairness.
Sentence 2: the amount of data transferred at each area (useful for next areas) is not equal.
Relationship: neutral
Domain: Networks
Sentence 1: Our design for RACON routing associates a unique message identifier, a hop count, and an optional ack request with each message.
Sentence 2: i will subsequently buffer the packet till the I-D link becomes up and eventually deliver the packet to D. with RACON a data packet is always routed closer to the destination even when the destination is not physically connected to the source or its current network partition.
Relationship: neutral
Domain: Networks
Sentence 1: The main limitation of the proposed algorithms is the re­quirement of persistent measurements and the timing con­straints.
Sentence 2: first, we increase every timestamp in si by (i - 1)a and denote the modi.ed measurements by (si)3 i=1.If S1, S2,and S3 are independent point processes, then so are S1, S2,and S3.
Relationship: neutral
Domain: Networks
Sentence 1: Throughput error: Figure 4(b) shows that the throughput error a.ects the performance of the prediction and prefetch­ing scheme most.
Sentence 2: algorithm 3 Procedure to exploit mobility prediction and prefetching for delay sensitive tra.c 1: Variables: T max 2: : maximum duration node is connected to next WiFi WiFi,next Rmax 3: : maximum throughput of next WiFi hotspot WiFi,next 4: Tnext WiFi: time until node enters range of next WiFi Rmax 5: : maximum throughput of mobile network mobile Dcache 6: : amount of data cached in next WiFi hotspot WiFi,next 7: O.set: estimated position in data object of data transferred until node enters next WiFi hotspot 8: Algorithm: 9: if node exits WiFi hotspot then Dcache .
Relationship: neutral
Domain: Networks
Sentence 1: In the .rst case, a static user who visits a single kiosk de.nes the associated kiosk controller as her custodian and registers with it.
Sentence 2: as we shall see, it also requires that custodians be either present at, or be associated with, a single Internet gateway, and, more­over, to be present on the path from the user to the Internet gateway.
Relationship: neutral