sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: the average energy consumption, which measures the Scenario Description ratio of total dissipated energy by the nodes to the num­ 1 WSN with all the management functions ber of nodes in the network.
Sentence 2: in points 75 and 100 a great di.erence can be perceived in the number of false positives, which has decreased as expected, since the number of orphan nodes 100 6.
Relationship: neutral
Domain: Networks
Sentence 1: In principle, work­conserving-ness aims to fully exploit the link bandwidth, which was precious before but no longer now, yet at the cost of large buffer, which is the major bottleneck to scalability both now and in the foreseeable future.
Sentence 2: the smooth multiplexing problem (SMP) is to generate a smooth schedule such that cells of each flow are smoothly or evenly distributed in the whole sequence.
Relationship: neutral
Domain: Networks
Sentence 1: RTTwireless is computed in a similar way as in Section 4.2.
Sentence 2: 1 proc recv_pkt() { 2 foreach received TCP ACK do 3 read RTTwired from TCP header 4 set RTTwireless = RTT -RTTwired 5 calculate transmission rate using RTTwireless 6 done 7 } Figure 5.
Relationship: neutral
Domain: Networks
Sentence 1: [14] Martin Roesch and Chris Green, SNORT: The Open Source Network Intrusion Detection System 1.9.1, Nov. 2002, http://www.snort.org/.
Sentence 2: when using libpcap, even the package size is 1518 Byte, the maximum size of Ethernet, it can not achieve the utmost speed.
Relationship: neutral
Domain: Networks
Sentence 1: Let co be the cell in the middle of this cluster.
Sentence 2: using Lemma 1, it fol­lows that almost surely each of these cells would contain more than 16 log n nodes, for large n.we obtain p N(n) N(n) E[H] = ·16 log n · 4 4n Noting that N(n)= 1/a2(n)= T(n/ log n), the result fol­lows.
Relationship: neutral
Domain: Networks
Sentence 1: Node mobility was not considered, but we shown that human activity has a real impact on route stability because the routing protocols change state from sample to sample in order to minimize the number of hops.
Sentence 2: in IEEE Personal Communications, 8(1):8-15, February 2001; see also www.monarch.cs.rice.edu [10] A. K. Vyas and F. A. Tobagi, Throughput of a Linear Multihop Wireless Network, Tech.
Relationship: neutral
Domain: Networks
Sentence 1: Please refer to Figure 3 to illustrate: this CCG is built based on the example shown in Figure 2, we add directed edges from c1 to v1, v2 and v3; from c2 to v4, v5 and v6; from c3 to v7 and v8.
Sentence 2: the utility function is a submodular function related to total sensing rate from that component.
Relationship: neutral
Domain: Networks
Sentence 1: First, it is easy to see that DCDS (vi-1,vi) = 2w(TCDS ) 2h = d(T ) and d(T )= D. Then we have the following: i=1 We note that the number of new nodes on the added shortest path 2h - 2 = d(T ) - 2 = D - 2 = D * is exactly equal to DSP T (r, vi) - 1 and |TCDS | = w(TCDS )+1.
Sentence 2: taking ß as an user-de.ned input, we derive a relationship between a and ß, which shows the relationship between the size of the constructed CDS and the optimal solution of CDS on size.
Relationship: neutral
Domain: Networks
Sentence 1: The gap exceeded 6 % only for three SPR instances  Scenario Scenario (a) Power minimization(b) CapEx minimization Figure 3: Breakdown of power consumption for the Abilene network with ßa = 110 W, ßt = 240 W. Scenario Scenario (a) Power minimization(b) CapEx minimization Figure 4: Breakdown of power consumption for the Abilene network with ßa = 622 W, ßt = 811 W. (max.
Sentence 2: all of them assume Multi-Commodity Flow (MCF) [1], i.e., the typical transportation problem where mul­tiple commodities (traf.c demands) need to be routed over a net­work with limited capacity.
Relationship: neutral
Domain: Networks
Sentence 1: (4) If we ignore the rich stochastic properties of Tdfr and Tifr by only considering their .rst-order behavior, their respective mobility patterns Mdfr and Mifr would have identical util­ity U(t0).
Sentence 2: in fact, for each one of these mobility-related metrics, we can de.ne a two­state (e.g., states 0 and 1 ) random process Zt,and the metric represents the recurrence time of a given state (e.g., state 1 out of 0-1valued process Zt).
Relationship: neutral
Domain: Networks
Sentence 1: CONCLUSIONS In this paper, we have proposed two online algorithms to detect rogue access points, based on real time passive mea­surements collected at a gateway router.
Sentence 2: 7.3 Scalability Study We investigate the scalability of our approach by looking at its CPU and memory usages of the PC that runs the de­tection algorithms(the con.guration ofthePCisdescribed in Section 6.1).
Relationship: neutral
Domain: Networks
Sentence 1: If F > 0, Aij =F/nis the per-source feedback(step 3 ofFigure4).
Sentence 2: speci.cally, since implementing thelogicforputting anetwork elementto sleep is easier and less expensive than sophisticated scaling techniques, it islikelythatthe .rstpower-awarenetworkinghardwaregeneration willfeature only the sleepfunctionality.
Relationship: neutral
Domain: Networks
Sentence 1: density of the leaves), the mea­surement values can change over time, too.
Sentence 2: signals from the MAXWell BS were not frequently missed during the experiment be­cause each MAXWell sector was operating on a unique chan­nel, which is not shared with other BSs, and the signal qual- Median Distance Error (meters) 80 Grid-S / Euclidean Distance 60 40 20 0 50 100 150 200  Number of Neighbors K ity was fair in the experiment area since the MAXWell BS is located relatively close.
Relationship: neutral
Domain: Networks
Sentence 1: Second, EM-MAC achieves quick and accurate multichannel ren­dezvous, thereby minimizing sender idle listening and overhearing.
Sentence 2: above this amount, each time the amount of error was doubled, one additional iteration of the algorithm was used by our EM-MAC implemen­tation: for errors above 20 ms but below 40 ms, only 1 iteration of the exponential chase algorithm was used; up to 80 ms, only 2 iterations were used; and up to 160 ms, only 3 iterations were used.
Relationship: neutral
Domain: Networks
Sentence 1: A, µA ' ,A '' , and .AA ' ,A '' .B ' ,B '' are given by (2), (3), |C| and(4) respectively, and dA ' ,B '' : R. [0,1] are any ,A '' .B ' + functions that satisfy the following property: d·.· (n).
Sentence 2: [11] Massouli´ e, L., and Twigg, A. Rate-optimal schemes for peer-to-peer live streaming.
Relationship: neutral
Domain: Networks
Sentence 1: Experiment 1: In Figure 3 we compare RDE (without PF marking) with the original .ve policies presented in [2] on the scenarios with no path failure.
Sentence 2: the Network Time Protocol (NTP) can indeed be used for this purpose, but since NTP is not always available in all end hosts, our proposal is not to calculate the absolute delays, but the relative one way delays of each path.
Relationship: neutral
Domain: Networks
Sentence 1: How­ever, identifying elephant .ows through their approach re­quires the identities (e.g., source IP addresses) of potential elephant .ows; i.e., it requires apriori knowledge of the elephant .ows .rst.
Sentence 2: [7] A. Kumar, J. Xu, J. Wang, O. Spatschek, and L. Li, Space-Code Bloom Filter for E.cient Per-Flow Tra.c Measurement, In proceedings of IEEE INFOCOM, Hong Kong, China, March 2004.
Relationship: neutral
Domain: Networks
Sentence 1: If the congestion level diminishes, the average of its packet growth rate will .ip to a higher steady-state value (a positive trend).
Sentence 2: due to itshighsmoothingcapability,wehave adopted thefollowing Epanechnikov quadratic kernel given by: j3 (1-u 2) if|u|=1 D(u)= 4 (3) 0 otherwise Returning back to our rate smoothing case, we have cho­sen to apply the kernel smoothing technique on the esti­mated rate samples rather than on the instantaneous rate ones 1 .
Relationship: neutral
Domain: Networks
Sentence 1: Unfortunately, this could be problematic for the ARP re­quest stream sent by the router gateway, as this request stream can contain a signi.cant amount of anomalous re­quests (see Section 2.2).
Sentence 2: a closer look at a short period before and during 3500 Distribution of ARP burstiness the spikes reveals that almost every host that broadcasts requests during the peak times lacks a mapping for the same 3000 IP address.
Relationship: neutral
Domain: Networks
Sentence 1: Therefor sensor i can detect a spectrum by the single-node detection and false alarm probabilities as [6]: Pdi = PonPdi (3) Pfi = Poff Pfi (4)  3.2 A Cooperative Spectrum Sensing Scheme In this paper, it is assumed that the cooperative spec­trum sensing is coordinated by the common receiver.
Sentence 2: one wants to save as much energy as possible by using fewer sensors and a shorter sensing interval.
Relationship: neutral
Domain: Networks
Sentence 1: [5] T. Camp, J. Boleng, V. Davies, A Survey of Mobility Models for Ad Hoc Network Research, Wireless Communication &#38; Mobile Computing (WCMC),vol.
Sentence 2: firstly, we develop a theoretical framework to study the means and the distributions of link lifetime, new link interarrival time, link breakage interarrival time and link change interarrival time.
Relationship: neutral
Domain: Networks
Sentence 1: At that level, the derived signal HiL 6 (x) contains aggregated data values that are 26 x 5 = 320 minutes apart.
Sentence 2: comparisons between the performance of the PS(4,1) Type II to the system RS4 (whose filters are all 5-tap, but whose approximation order is only 2), yielded a signifi cant difference in performance.
Relationship: neutral
Domain: Networks
Sentence 1: For an interplay of several oscillators, the topology of the interconnections can be described by a graph G = {V, E}, where V is a .nite set of oscillators and eij .
Sentence 2: here, only  Figure 3: Average link density with respect to num­ber of nodes in the network where average is calcu­lated over 30 experiments for each N. Links are con­sidered only where the reception rate is greater than 50%.
Relationship: neutral
Domain: Networks
Sentence 1: show in [4] that there is a huge potential to reduce the energy consumption of LTE networks by using the pub­licly accessible residential femto base stations (which they name as pico base stations) to supplement the capacity of the macro network.
Sentence 2: according to their charac­terization, the radiated power is divided into the following categories: very low, low, medium, and high.
Relationship: neutral
Domain: Networks
Sentence 1: InSectionIV-C,we .nd that all traf.cgoing through oneof the GGSNs can result in up to an order of magnitude increase in air mile.Speci.cally, the mediandistance of EAR is142km and that of EAG is 993km.
Sentence 2: lTE White paper, Motorola, 2006.
Relationship: neutral
Domain: Networks
Sentence 1: This joint state comes for free in the sense that it does not require additional proofs.
Sentence 2: given our theorems, (real-world) security protocols can be an­alyzed with a high degree of modularity and without giving up on precision: Once implicit disjointness is established for a protocol .rst proof step , it su.ces to carry out single-session analysis for the protocols second proof step in order to obtain multi-session security with joint state for the original protocol, not just an ideal­ized version with pre-established SIDs added in various places, as explained in Sections 3 and 4.
Relationship: neutral
Domain: Networks
Sentence 1: This has the main advantage that debugging activities may benefit from knowledge about the causal re- lation of the events in a computation.
Sentence 2: universitb di Pisa Corso Italia 40 56125, Pisa, Italy giangi@di.unipi.it  Keywords Wide Area Network, Programming Languages, Debuggers ABSTRACT Advancements in network-aware computing has prompted the study of novel programming languages with advanced programming abstractions to support various forms of mo- bility and to coordinate and monitor the use of resources.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 3 Architecture of WLAN Interworking Conceptually, MN could have a higher data rate in WLAN compared to the CDMA2000 network.
Sentence 2: cDMA2000 1x EV-DO Rev.A can provide up to 3.1 Mb/s in forward link and 1.8Mb/s in reverse link.
Relationship: neutral
Domain: Networks
Sentence 1: d The base algorithm with the same threshold as before (th block = 15) captures seven out of ten positive dse peaks upon upstream valve operation because of the asynchronous temperature drop on both sides (§4.3).
Sentence 2: on Solid-State Sensors and Actuators and Eurosensors IX., volume 1, pages 369 372, Stockholm, Sweden, June 1995.
Relationship: neutral
Domain: Networks
Sentence 1: For example, the well-known Conficker, Mariposa, Coreflood, and Waledac/Kelihos botnets are all ineffective in the aspect of monitoring the botnet and retrieving the collected data, demonstrating that even sophisticated botnets have no robust and efficient upstream channel.
Sentence 2: the Property Requirements of the Divided Sub-Channels ChannelProperty Survivability Identification Confidentiality Availability Robustness Recoverability Scalability Monitor Efficiency CDC necessary necessary necessary necessary RC necessary necessary necessary necessary DUC necessary necessary necessary necessary necessary  3.
Relationship: neutral
Domain: Networks
Sentence 1: Let s see why and how our algorithm is not so sensible to noise and encompasses non circular detection area.
Sentence 2: indeed, Christophe L´evy compares in [14] di.erent methods of parametrization on small sys­tems ,like mobile phones, for reduced vocabulary and have shown that the parametrization based on MFCC is signi.­cantly more e.cient for this kind of systems.
Relationship: neutral
Domain: Networks
Sentence 1: Throughput/frame Figure 3: Performance of DRA,DRA+,LRA.
Sentence 2: it can be seen that both DRA and DRA+ converge quickly, with DRA taking about 3 frames and DRA+ taking slightly longer, about 5 frames to attain close to 90% of the optimal value, thereby making them conducive for practical deployment.
Relationship: neutral
Domain: Networks
Sentence 1: Principals are able to query PANE to determine their available capabilities, exam­ine the schedule of bandwidth availability, create sub-shares, and grant privileges to other principals.
Sentence 2: networks are the shared fabric interconnect­ing users, applications, and devices, and .uctuating, unpredictable network performance and reliability create challenges and uncer­tainty for network administrators, application developers, and frus­trated end-users alike.
Relationship: neutral
Domain: Networks
Sentence 1: Rd., Taipei, Taiwan Taipei, Taiwan Taipei, Taiwan chiawei74105@yahoo.com.tw htwu@csie.ntut.edu.tw ufvkomj@hotmail.com ABSTRACT To improve the performance of IEEE 802.11e, many methods based on admission control mechanisms and adaptive contention window adjustment algorithms are proposed.
Sentence 2: copyright 2008 ACM 978-1-60558-089-0.
Relationship: neutral
Domain: Networks
Sentence 1: If we assume that the sum of the maximum power that can be transmitted by each mobile in the uplink, is the same as N ¯ the power constraint of the downlink, i.e., i=1 p¯i = Q,the following condition has to be satis.ed by using Equations (20) and (22): N aUL .
Sentence 2: for a given instance, a to­tal of 10 mobiles are generated, the locations of which are randomly distributed over the cell.
Relationship: neutral
Domain: Networks
Sentence 1: Table3showstheresultsofrunningthishekon fveFLASHprotools.Indynptrandra,theheker found1errorinan.eagermode"handler,whihisonly usedinsimulation,and6errorsinhandlersforunahed reads.Unahedreadsarearareaseintheprotool, sothesehandlersarenotheavilytested.Inorderto triggerthebuginthesehandlers,thedatawouldhave tobedirtyinanothernode'saheonurrentwitha partiularqueuebeingfullontheloalnode.Thissort ofbugmightneverourinpratie,butifiteverdid itwouldbediÆulttoreprodueanddiagnose.The hekeralsofoundasimilarbugthatexistsonlyinra.
Sentence 2: higher-levelompilation.Manyprojetshave hard­wiredspeifappliation­levelinformationinom­pilers.Theseprojetsinlude:theERASERdynami   Protool Buferallo Diretory(*) Send-wait FalsePos Applied FalsePos Applied FalsePos Applied bitvetor 0 17 3 214 2 32 dynptr 2 19 13 3 2 2 3 si 0 5 1 0 11 ona 0 32 5 659 0 7 ra 0 20 9 424 2 35 onnonode 0 4 0 1 2 2 total 2 97 31 176 125 Table6:Appliabilityofthethreelessefetiveheks:approximatenumberoftimesthehekwasapplied.The raedetetionheker[26];ompiler­diretedprefeth­ingandmanagementofI/O[23];theuseofstatianaly­sistohekforseurityerrorsinprivilegedprograms[1]; ParaSoft'sInsure++[19],whihanhekforUnix systemallerrors;andtheGNUompilers'-Wallop­tion,whihwarnsaboutdangerousfuntionsandques­tionableprogrammingpratiesLoally,thispaperad­dressesadiferentproblemdomain.Moreglobally,these pastprojetslookatspeifproblemsthatompilation anhelp,whereasMCprovidesaframeworkforapply­ingompilationtoallaspetsofprogramming.Itsex­tensibilityletsimplementorshekrestritionsnotpos­siblewiththeseotherapproahes.Thesuessofthis priorworkanbeviewedasgivingredenetotheir generalizationinMC.
Relationship: neutral
Domain: Networks
Sentence 1: If both of them are available then join mechanism will applied to return the frame to its original.
Sentence 2: in this study, we will use pixel splitting frames, to creates two sub-frames out of each frame where one sub-frame contains the even pixels and the another contains the odd pixels as shown in Figure 1, and each sub-frame will be queued in different buffers and it will be ready to stream the sub-frames over two wireless channels but the second stream will be delay for 2 seconds after the first stream as in Figure 2.
Relationship: neutral
Domain: Networks
Sentence 1: Analysis of educational media server workloads.
Sentence 2: the con­ 4 Virtual Streaming Enigne Windows Real QuickTime Media Media Media Streaming Streaming Streaming Engine Engine Engine 7 6 verted pre.xes of media objects are cached in the Pre.x Cache Engine to serve subsequent requests from similar de- Streaming Media Converter Prefix Cache Engine vices.
Relationship: neutral
Domain: Networks
Sentence 1: 3.2 Translating to Advanced Features Alternatively, the overlay system can use advanced inter­connect features that provide more complex semantics (e.g., connected reliable streams) while hiding these features from the guest.
Sentence 2: vNET+VTOE approaches Native+IPoIB perfor­mance and scalable application performance when supporting parallel application workloads on In.ni-Band with rigorous network communication.
Relationship: neutral
Domain: Networks
Sentence 1: Looking Ahead in Pervasive Computing: Challenges and Opportunities in the Era of Cyber-Physical Convergence, Pervasive and Mobile Computing, Vol.
Sentence 2: inherent characteristics of WSNs typified by extremely scarce resources, high degree of uncertainty, distributed control and operations pose significant challenges in providing desired information (or context) quality, assurance, and reliability for intelligent decision making, particularly for mission critical applications like health care and security.
Relationship: neutral
Domain: Networks
Sentence 1: We will focus on the unique component of a C-RAN, namely its front-haul network that maps and transports the signals from the BBUs to the RRHs and show how different logical con.gurations of the front-haul manifest as different transmission strategies on the access network and discuss why they are critical in realizing the complete potential of a C-RAN.
Sentence 2: their use of the same syn­chronous access technology as macrocell networks, makes the prob­lem of interference management signi.cantly more challenging and critical for leveraging spatial reuse.
Relationship: neutral
Domain: Networks
Sentence 1: This is often true in practice as packets in the same .ow usually undergo the same pro­cessing, and hence have the same dominant resource.
Sentence 2: (µ1t¯n,2 - µ2t¯n,1)/(¯t1,1t¯n,2 - t¯1,2t¯n,1), i = 1; * di = (µ2t¯1,1 - µ1t¯1,2)/(¯t1,1t¯n,2 - t¯1,2t¯n,1), i = n; .
Relationship: neutral
Domain: Networks
Sentence 1: This paper is dedicated to the subject of maintaining a VM s network consistency and reducing the impact on a 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.
Sentence 2: rEFERENCES [1] M. Rosenblum and T. Gar.nkel, Virtual machine monitors: current technology and future trends, Computer, vol.
Relationship: neutral
Domain: Networks
Sentence 1: While these previous works in network traf.c visualization have produced novel and useful presentation and interaction techniques, they were tested using small amounts of network data.
Sentence 2: in our example, the query is as follows: select DP, tsyday where (state == 1) and (12 <= tshour < 14) and (5000 <= DP < 6000) and (127 <= tsyday < 183).
Relationship: neutral
Domain: Networks
Sentence 1: 4.1 Multicast over a Reliable Virtual Network Wide-area deployment of IPTV service is especially chal­lenging: live multimedia distribution, especially broadcast TV distribution, is characterized by high bandwidth require­ments and tight latency and loss constraints, even under fail­ure conditions.
Sentence 2: similarly, the connectivity layer establishes vir­tual links on behalf of the service layer, and associates them to the interfaces that the service layer sees.
Relationship: neutral
Domain: Networks
Sentence 1: Since ßi is set to limit the contribution of Dc for a given ri and Ri, [11], the end-to­end distortion can be expressed as a function of the pair (ri,ßi) as: -2xi(ri,ii) Di(ri,ßi)= DcPe(ßi)+ a2[1 - Pe(ßi)].
Sentence 2: it can be seen how with cross layer resource allocation, the average network distor­tion is signi.cantly reduced when compared to the Physical layer only scheme, as the later scheme shows values of dis­tortion two and a half to three times larger.
Relationship: neutral
Domain: Networks
Sentence 1: On channel estimation and detection for multicarrier signals in fast and selective rayleigh fading channels.
Sentence 2: the time-domain LS and LMMSE estimators developed in [9] can be adopted here to estimate p: (LS)(P ) p =(D)yp (13) D(P ))-1 where (D(P )) =((D(P ))H (D(P ))H denoting the pseudoinverse of D(P ),and (lmmse)(P )H (P )2 -1(P )H p =((D)D+ sn)(D)yp (14) (All) where sn 2 denotes the power of n.  3.2 Concatenating pilots in multiple OFDMsymbols It is assumed that the comb-type pilots exist in every OFDM symbol.
Relationship: neutral
Domain: Networks
Sentence 1: Content for Study We began this part of our study by determining realistic distributions for the number and sizes of embedded images expected on a Web page.
Sentence 2: with full-site content delivery, the origin server is largely hidden except to the CDN; the origin site modifies its DNS zone file (a zone is a subtree of the DNS hierarchy that is sepa­rately administered) to reflect the authoritative DNS server provided by the CDN company.
Relationship: neutral
Domain: Networks
Sentence 1: Distributed and Collaborative Traf.c Monitoring in Software De.ned Networks Ye Yu, Chen Qian, Xin Li Department of Computer Science, Unversity of Kentucky Lexington, Kentucky, USA ye.yu@uky.edu, qian@cs.uky.edu, xin.li@uky.edu ABSTRACT Network traf.c monitoring supports fundamental network manage­ment tasks.
Sentence 2: in Section 3 we present the system design of DCM.
Relationship: neutral
Domain: Networks
Sentence 1: There is an approximation algorithm with v approximation ratio 14 + 16/a2 +8 2/a = O(1/a2 ) for NW2ECS in a-unit disk graphs.
Sentence 2: approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Ambreen Shahnaz Department of Computer Science University of Leicester, UK as437@mcs.le.ac.uk ABSTRACT If a set K of nodes in a wireless network want to set up a routing structure that allows them to communicate with each other, one possible approach is to use a Steiner tree that spans all the nodes in K. a tree can be dis­connectedby thefailure of a singlelink, and soitisdesirable to employ other routing structures that are fault-tolerant.
Relationship: neutral