sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: In the current stage of TIGR framework, resource manager is implemented as Python class, thus allowing for .exible design of di.erent scenarios, such as grouping of subcarriers in subbands in thepresence of weakfrequency selective channels or enabling an opportunistic use of available spectrum throughDynamic SpectrumAccess(DSA).Thetwo of themare moredetailed described in Section 3.
Sentence 2: additional experimental evaluationwithUSRP2 anddi.erentindoor conditionsis tobeperformedin order to get larger insight into the TIGR capability.
Relationship: neutral
Domain: Networks
Sentence 1: The successful reception of a transmitted signal depends, along with the propagation function on the trans­mit power p, and the receiver sensitivity ..The receiver sensitivity is the threshold signal strength needed for recep­tion andisassumedtobe anapriori knownconstant, same for all nodes.
Sentence 2: the Steiner tree in G(V,E,.1) de.ned gives an exact solution for the minimum-energy broadcast tree problem.
Relationship: neutral
Domain: Networks
Sentence 1: Since bandwidth through­put is inversely proportional to the schedule makespan, Theorem 1 implies that solely relying on work conservation may incur up to 50% loss of bandwidth throughput when there are two types of re­sources.
Sentence 2: let Di F(0, t) be the dominant services .ow i receives in (0, t) under the .uid schedule, and Di D(0, t) the dom­inant services .ow i receives in (0, t) under the corresponding dis­crete schedule.
Relationship: neutral
Domain: Networks
Sentence 1: [4] Zhuang, R.; Zhang, S.; DeLoach, S. A.; Ou, X.; Singhal, A. Simulation-based Approaches to Studying Effectiveness of Moving-Target Network Defense.
Sentence 2: the OSI Model Layer Name Relevant protocols and devices 7 Application HTTP, HTTPS, FTP, DNS 6 Presentation SSL 5 Session TCP 4 Transport TCP, UDP 3 Network Internet Protocol (IP), routers 2 Data-Link Ethernet, MAC, switches 1 Physical hubs  These dependencies create requirements for how the network should behave.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 19 shows that even at 90% load, the average end-to-end latency per packet in DOS is kept low compared with the latency incurred in a lightly loaded flattened butterfly network.
Sentence 2: this indicates that the entire memory size required by DOS will be much smaller than the anticipated maximum buffer occupancy of any output multiplied by the number of nodes DOS connects.
Relationship: neutral
Domain: Networks
Sentence 1: To systematically quantify the accuracy of T in esti­mating Ty, we analyze the estimation error as a function of measurement intervals (denoted by t) for paths with These results demonstrate that an attacker can ex­ ploit coupling among MPTCP sub.ows to infer pro­ prietary information such as end-to-end throughput of unmonitored paths.
Sentence 2: the feasibility of this attack is limited because the attacker would need to guess the 4-tuple (source IP, destination IP, source port, destination port), out of which ports are hard to know, and data/ACK sequence numbers.
Relationship: neutral
Domain: Networks
Sentence 1: moves a token from u to v along e, and no tokens from v to u, thereby decreasing bt(u) by 1.
Sentence 2: speci.­cally, a window size Wis speci.ed, and it is required that for any set Sand any time window [t,t+W), the imbalance cre­ated on set Sover that time window is bounded by the total .
Relationship: neutral
Domain: Networks
Sentence 1: Research Seminar on Networking, Helsinki University of Technology, Networking Laboratory, Espoo, Finland, February 2002.
Sentence 2: 140  5.2 Packet Length Model 300 120 Measured Measured A difference between Halo 2 and previously modelled games is that the packet length distribution is not continuous but has 100 200 80 characteristic peaks spaced 8 bytes apart and the intermediate packet lengths do not occur.
Relationship: neutral
Domain: Networks
Sentence 1: TPraw (DL) (6) TD _ SCDMA BW TPOFDM (DL) OFDM raw (7) .. OFDM BW  The allocated bandwidth for OFDM, BW OFDM , is seven times BWTD-SCDMA larger than that of TD-SCDMA, , since the .
Sentence 2: it depicts that the maximum allowed path loss of TDD system is larger than WiMAX system.
Relationship: neutral
Domain: Networks
Sentence 1: The approach of delaying the SYN packet for the second .ow exhibits the following bene.ts: 1) it is safe and easier to fall back on legacy TCP if the other end does not speak MPTCP, and 2) it provides a higher level of connection se­curity with key exchange.
Sentence 2: when the path characteristics (e.g., loss rate or RTT) are diverse, reordering delay becomes crucial as packets arriving early from one path need to wait for packets arriving late from another path.
Relationship: neutral
Domain: Networks
Sentence 1: 1 0.8 Smartphone M2M 0.6 Asset CDF 0.4 Building Fleet Modem 0.2 Metering 1000 101 102 Telehealth Unique cell count Figure 8: CDFs of unique cells for smartphone and M2M categories.
Sentence 2: the weekday­weekend pattern comparison reveals di.erent results for most M2M categories, illustrating that M2M categories in­deed behave vastly di.erently from each other due to the di.erent applications they serve.
Relationship: neutral
Domain: Networks
Sentence 1: In this paper we propose a sensor node platform de­signed for health-care applications and a validated simula­tion model based on event-driven operating system simula­tion that can be used to accurately analyze performance and power consumption in BANs composed of multiple nodes.
Sentence 2: because of the relative complexity of the applications considered here, the scheduler only used the .rst low power mode, which will be referred as the power saving mode in following dis­cussions.
Relationship: neutral
Domain: Networks
Sentence 1: We found that log-normal provided a decent .t for all three BitTorrent datasets, but signi.cantly overesti­mated the number of sessions longer than one day in the Red Hat and Debian datasets.
Sentence 2: in summary, this paper advances our understanding of churn by improving accuracy, comparing di.erent P2P .le sharing/distribution systems, and exploring new aspects of churn.
Relationship: neutral
Domain: Networks
Sentence 1: INTRODUCTION The Radio Frequency Identi.cation (RFID) system is a .agship technology to identify and trace objects by attach­ing a small RFID tag to the ob jects.
Sentence 2: the expected number of slots in the jth split is .K s(j)= 1+1*i=2 Pi(j)+2*s(j+1)*Pcol (j)(0 = j< R-k) .K with a boundary condition s(R-k)=1 + 1 * i=2 Pi(R-k), where Pi(j) is the probability of i number of responding tags in the jth split.
Relationship: neutral
Domain: Networks
Sentence 1: The AP veri.es the ticket by checking that: (a) the identi.er ids matches the one in the message; (b) the current local time is within the validity period l start­ing from timestamp ts; and (c) the ticket digest code hamc is correct.
Sentence 2: in our method, all algorithms except public key encryp­tion/decryption, such as TKIP, MIC, and AES, are already implemented in current products.
Relationship: neutral
Domain: Networks
Sentence 1: For allocations prior to that date, we assume they were completely recorded in the allo­cation history statistical .le 20010501.
Sentence 2: now, there is a prediction model that is both regularly updated and arguably canonical [12], and the most recent estimate date for the depletion of the IANA pool is in 2011,1 with all Regional Internet Registries (RIR) hav­ing allocated their resources in 2012.
Relationship: neutral
Domain: Networks
Sentence 1: [4] A. Lakhina, M. Crovella, and C. Diot.
Sentence 2: let n denote the grand total of X and P denote the correspondence matrix such that pij = Xij /n, where pij and 2Biplot allows row and column categories to be displayed si­multaneously on a 2D plot, in order to gain an understanding of the interrelationship or association between them.
Relationship: neutral
Domain: Networks
Sentence 1: If the presentation duration of frames i-z to i-1 is long enough to transmit f~ame i again, then fxazae i can be re-transmitted.
Sentence 2: in order to achieve the above goals, four mechani-qms and techniques axe adopted in the flow control between the media server and the media gateway: (1) media layering, (2) presentation quality adjustment, (3) layered buffer management, and (4) re-transmission of important frames.
Relationship: neutral
Domain: Networks
Sentence 1: At the end of this protocol, the STA believes that the AP knows the new keys, PMK and PTK, because the Authenti­cation Response is authenticated with KCK, a part of PTK.
Sentence 2: furthermore, the APs of the same Mobility Domain obtain new key material, namely PMKs, which are unique for each AP-STA pair and not shared by all APs of the same Mobility Domain, as in 802.11r.
Relationship: neutral
Domain: Networks
Sentence 1: Note that although the Min-TCO and Set Cover problems appear to be related, they are nevertheless, fundamentally di.erent due to an additional topological constraint (topic­connectivity) imposed by Min-TCO and not found in Set Cover.
Sentence 2: our study thus demonstrates that subscription correlation can indeed be e.ciently leveraged for constructing topic-connected (and thus optimal with respect to the routing cost) overlay topol­ogy with provable and (almost) tight scalability character­istics.
Relationship: neutral
Domain: Networks
Sentence 1: PATH-ORIENTEDSLACOMPLIANCE MONITORING We nowdescribethebasic assumptions andmethodsfor estimat­ing delay, delay variation, and loss along a single end-to-end path.
Sentence 2: ifthefourthderivative of f exists andis nottoolarge,itis safe to state that the local error is of order 5; i.e., if we double the number of samples, the errorinthe estimate willbe reducedlocally by afactor of32, andgloballyby afactor of16.
Relationship: neutral
Domain: Networks
Sentence 1: The backends are very compact and fast, allowing netmap to send or receive packets at line rate even with the smallest packets (14.88 Mpps on a 10 Gbit/s interface) and with a single core running at less than 900 MHz.
Sentence 2: for some of the (many) tests we have run there are large variations (10-20%)of theexperimental results,alsoduetoslightlydif­ferent versions of the code or to the synchronization of the processes involved.
Relationship: neutral
Domain: Networks
Sentence 1: In the virtual machine of the infrastructure network, interfaces P 7 to P 9 are associated with the physical interfaces on node P , which are directly connected to the neighboring physical interfaces X1, Y 1, and Z1, on nodes not shown in Figure 2.
Sentence 2: by carrying traf.c on behalf of many service providers, a connectivity provider can negotiate lower prices and make more ef.cient use of the underlying resources.
Relationship: neutral
Domain: Networks
Sentence 1: "nsNotesand Doumentation,"http://www­mash.s.berkeley.edu/ns [18]J.Broh,D.Maltz,D.Johnson,Y­CHu,and J.Jetheva,"APerformaneComparisonofMulti­Hop AdHoNetworkRoutingProtools,"InProeedings oftheFourthAnnualACM/IEEEInternational ConfereneonMobileComputingandNetworking (MobiCom98),ACM,Dallas,TX,0t.1998.
Sentence 2: twomiro­mobilityprotools,namelyCellularIP[6]and Hawaii[8],integratesupportforfasthandofandpaging.
Relationship: neutral
Domain: Networks
Sentence 1: Applying SyslogDigest on other network data and integrating it into various network management tools are among our future work.
Sentence 2: intuitively, if the messages belong to the same cluster, in other words, there is a periodic pattern within the group, then the predicted value St should notbefaraway from the real one St. we assume that if St = ß · St where (ß>= 1), which means the real interarrival time is no much larger than predicted one, we view that the message belongs to the same group.
Relationship: neutral
Domain: Networks
Sentence 1: Hence, c = cL = Q(-h2(.f))= h2 (.f) .f.8 vv Q-1 Q(- pR · .f) when .f .8.
Sentence 2: s H0 2 s 2 P1(C01 -C11) i=1 i=1 the optimalfusion statisticsforBayesiandecision PN is si · yi where si is the received SNR of sensor i. i=1 ss B. PROOFOFLEMMA2 Proof.
Relationship: neutral
Domain: Networks
Sentence 1: We will describe MRC in detail later (in section 5) but in a nutshell, MRC induces memory into the system and keeps track of the feasi­ble rates during benign jamming-free periods; as soon as the jammer goes to sleep, legitimate transmissions are invoked at the most recent rate used during the previous sleeping cy­cle of the jammer.
Sentence 2: implementation and experimental details: For these experiments we exclusively use the Intel-2915 cards; these cards allow us to tune the CCA threshold.
Relationship: neutral
Domain: Networks
Sentence 1: Within its routing zone, the node maintains the topology information by using a table-driven routing protocol, and out of its routing zone, a source-initiated on-demand rout­ing protocol is used.
Sentence 2: it becomes a forwarding node for the ToBePassive source node, i.e., all the data packets from the ToBePas­sive source node will now be forwarded by this core node.
Relationship: neutral
Domain: Networks
Sentence 1: Acknowledgments The research leading to these results has received funding from the European Community s Seventh Framework Programme [FP7/2007-2013] under the HiPEAC-2 (grant agreement no.
Sentence 2: our approach reduces the amount of registered memory while avoiding memory registration/deregistraton overhead, a result that prior methods cannot achieve.We designa context-aware predictor to provide highly accurate time prediction.We presenteda time­oriented helper thread design.
Relationship: neutral
Domain: Networks
Sentence 1: It can easily be seen from (19) that a su.cient condition for satisfying the average BER constraint d0 is Pb,avg,i,k = d0 ·pk,i .
Sentence 2: such tech­niques are rarely used in practice due to their complexity and the results presented here serve therefore mainly as a reference, showing what theoretically can be achieved by means of adaptive modulation in general.
Relationship: neutral
Domain: Networks
Sentence 1: (5) The paging cost under the interactive strategy is certainly lower than that of the timer-based method.
Sentence 2: a suffi- cient condition under which D*(zl, z2) = d(zl, z2) for any cells zl, z2 visited by the user, is that the maximal length of a cycle in G is at most 4R + 2.
Relationship: neutral
Domain: Networks
Sentence 1: If the timing synchronization is not accurate enough, the performance for IDMA will not be as good as expected.
Sentence 2: -4 10         M=1,K=1 M=1,K=5  M=1,K=15 M=10,K=1  M=10,K=5 M=10,K=15 M=30,K=1 M=30,K=5 M=30,K=15 Pfa 95 -6 10 90 85 80 Pd (%) -8 10Eb/N0 (dB) Figure 7.
Relationship: neutral
Domain: Networks
Sentence 1: Since c = tout = 150ms and h = 5 in this case, we have b =(673.5 - 150)/5 = 104.7 (ms).
Sentence 2: after a node sends SYNC to its children, it sets a timer which goes off after tout time within which it expects to over­hear all its children sending SYNC to their own children.
Relationship: neutral
Domain: Networks
Sentence 1: We also store provenance and causation data for messages.
Sentence 2: moreover, assume that, to process m1 and m2 , f1 accesses K1 = {k11 ···k1n } and f2 accesses K2 = {k21 ···k2m }.If K1  K2 6 = ;, the platform must guarantee that the keys in K1 [ K2 are always accessed by only one instance of the control application and also m1 and m2 are processed by the same instance.
Relationship: neutral
Domain: Networks
Sentence 1: Initially, the procedure estimates the amount of data that can be transferred over WiFi (Line 16), and from this the amount of data that needs to be transferred over the mobile network (Line 18).
Sentence 2: for delay sensitive tra.c the cache requirements for 20 and 30 MB data objects remains the same, since for both these sizes only the .rst WiFi hotspot is used, and prefetching is utilized to transfer the same amount of tra.c in both cases.
Relationship: neutral
Domain: Networks
Sentence 1: The paper makes the fol­lowing research contributions: Flexible mechanism for egress-point selection: TIE is: (i) .exible in balancing the trade-off between sensitivity to IGP changes and adaptability to network events, (ii) computation­ally easy for the routers to execute in real time, and (iii) easy for a management system to optimize based on diverse net­work objectives.
Sentence 2: for the .rst of them, we present a management system that selects suitable values of a and (.
Relationship: neutral
Domain: Networks
Sentence 1: The main contribution of our research is the classi.ca­tion of a generic event-&#38; role-based mobility paradigm that completely de.nes movement patterns given a series of envi­ronmental events for a set of characteristic roles.
Sentence 2: until this time, emergency vehicles outside the event horizon do not respond to the event; how­ever, after the threshold time has passed, those emergency vehicles begin to converge on the event.
Relationship: neutral
Domain: Networks
Sentence 1: It is important to note that the relative direction of a device with its access point (base station) is determined by not only device orien­tation but also location.
Sentence 2: [26] M. Rogers, K. Hrovat, K. McPherson, M. Moskowitz, and T. Reckart, "Accelerometer data analysis and presentation tech­niques," Technical Report, National Aeronautics and Space Administration, Lewis Research Center, 1997.
Relationship: neutral
Domain: Networks
Sentence 1: Even worse yet, the estimation techniques yield poor performance in a highly dynamic environ­ment.
Sentence 2: the algorithm converges to the global optimum with probability one, provided that the following constraints are satis.ed [9,29]: a(n) > 0, L8 a(n)= 8, limn.8 a(n)=0 n=0 and L8 (a(n))2 < 8, .m .M and e .E, where a gener­ n=0 ally represents all stepsize parameters in (19), (20) and (21).
Relationship: neutral
Domain: Networks
Sentence 1: If the token is still valid and the source of the TREQ packet matches the owner of the token, it constructs a new token in which owner identity is equal to that in the old token, signing time is equal to the timestamp in the TREQ packet, and expiration time is de­termined by the additive increase algorithm described below.
Sentence 2: we abandon this scheme due to several reasons.
Relationship: neutral
Domain: Networks
Sentence 1: 107--118 [5] E. Souto, G. Guimar, G. Vasconcelos, M. Vieira, N. Rosa, C. Ferraz, and J. Kelner, "Mires: a publish/subscribe middleware for sensor networks," Personal Ubiquitous Comput., vol.
Sentence 2: to the best of our knowledge there does not exist a middleware that takes a holistic view of the WSN as a single entity, that is a middleware operating at all levels of the network i.e.
Relationship: neutral
Domain: Networks
Sentence 1: Hence, if we aggregate only the pre.xes that in addition to having similar AS paths, are geographi­cally close (we used diameter ratio = 500 as a de.nition for close ), then the number of announced pre.xes could be reduced by only 20%.
Sentence 2: undns uses the hostname of an IP address to determine its AS number, which could cause us to mistakenly believe an ISP is announcing a discontiguous pre.x.
Relationship: neutral
Domain: Networks
Sentence 1: After the HOL matching is .nished, the crossbar extracts the .rst packets of all the scheduled virtual queues and simultaneously transmits them to the scheduled output ports.
Sentence 2: the VOQ bu.ering maintains a (logically) separate queue for each output port at each input port, so that a packet will no longer be held up by another packet ahead of it that goes to a di.erent output port.
Relationship: neutral
Domain: Networks
Sentence 1: We can leverage TCP s .ow control and conges­tion control mechanisms to avoid network overload.
Sentence 2: [16] J. Ko, J. Eriksson, N. Tsiftes, S. Dawson-Haggerty, M. Durvy, J. Vasseur, A. Terzis, A. Dunkels, and D. Culler.
Relationship: neutral
Domain: Networks
Sentence 1: The phones return their results along with the time it actually took to locally execute their last assigned task.
Sentence 2: for an enter­prise which supplies its employees with smartphones, we argue that a computinginfrastructure thatleveragesidle smartphonesbe­ingcharged overnightis an energy-ef.cient and cost-effective alter­native to running tasks on traditional server infrastructure.
Relationship: neutral
Domain: Networks
Sentence 1: Namely, instead of enumerating ways the protocol can break down (i.e., attacks), we can instead give a precise de.nition of the functionality we require from the protocol, and then guarantee that the protocol can carry out these functions even in the face of all possible attacks by an adversary with a speci.c set of powers.
Sentence 2: http://www.ietf.org/html.charters/ippm-charter.html.
Relationship: neutral
Domain: Networks
Sentence 1: ARIEL automatically builds room .ngerprints through an incremental process using the Wi-Fi signal vector samples gathered by personal mobile phones, and then delivers room localization service back to the individ­ual occupants.
Sentence 2: h. Wang, S. Sen, A. Elgohary, M. Farid, M. Youssef, and R. R. Choudhury.
Relationship: neutral
Domain: Networks
Sentence 1: Lui, On the effectiveness of movement prediction to reduce energy consumption in wireless communication, IEEE Transactions on Mobile Computing, vol.
Sentence 2: of IEEE SICON 97, 1997, available at http://shiva.crhc.uiuc.edu/publications.html [11] T. Liu, P Bahl and I. Chlamtac, Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks, IEEE Journal on Selected Areas in Communications, vol.
Relationship: neutral
Domain: Networks
Sentence 1: N3, contin­uously in the same direction.
Sentence 2: 4.1 Power Constraints in Topology Construction The power constraint has to do with setting the appropri­ate power levels for each transmission in the network (the Prism2 hardware in our implementation allows us to con.g­ure the tx-power anywhere between 0dBm and about 20dBm with a 1dB granularity or less).
Relationship: neutral
Domain: Networks
Sentence 1: Disabling links reduces the available bandwidth, and there­fore, the link selection process is dynamic, ensuring that the network does not partition and that it can support the cur­rent bandwidth demands.
Sentence 2: we use a kernel driver, per port, which allows the user-level process to send and receive raw Eth­ernet frames directly to and from each port, and the local TCP/IP stack is not bound to any of these ports.
Relationship: neutral
Domain: Networks
Sentence 1: With the above in view, we argue that given the high rate of mobile phone usage in Kenya, and increasingly in Africa (see Scott et al; 2004) therein lies better e-governance opportunities.
Sentence 2: evidently, there is a tilted understanding in favor of government to citizen interaction; rightly so in line with the twin strategies i.e., ICT and e-government strategies.
Relationship: neutral
Domain: Networks
Sentence 1: Moreover, we have integrated the PC-MAC protocol in the motorway vehicular simulator [9] to evaluate some useful vehicular multimedia communication scenarios on a motorway and compared the results with M-PRMAprotocol[10].
Sentence 2: voice Traffic Model To model a speech source, a well-known approach is the ON-OFF model where all the talkspurts or service times (ON) and silence periods or inter arrival times (OFF) between the messages are exponentially distributed, as the arrival rate and service rate follow the Poisson distribution.
Relationship: neutral
Domain: Networks
Sentence 1: When only the shortest path is maintained, then the space and computation complexity re­duce to O(|Ni|N)and O(|Ni|), respectively, which are the same as that of DBF.
Sentence 2: a logical distance is a real number only if the optimization function f p can be given by a close-form equation, as for the cases of the bandwidth­ 1 inversion shortest path (), the most-reliable lu,v B(u,v) path (lu,v - log (prob(u, v))), or the aggregated metric used in the Interior Gateway Routing Protocol (IGRP) [2]: k fp = L + , where k is a positive constant, L and D C are the path length and capacity, respectively.
Relationship: neutral