sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: It restricts the number of replications to be equal to about 10%-15% of all n nodes.
Sentence 2: since the expected time to enter in absorbing state j from transient state i is equal to the expected time spent in all transient states before enters in state j from transient state i, we can get HT as Figure 1: RENA overview Dij (x, y), which includes the routing time Rij (x)from cur­rent region i of node x to candidate region j and the waiting time Wj (y) of the relay node before encountering node y in­side the region j : Dij (x, y)= Rij (x)+ Wj (y), (5) where Rij (x)and Wj (y) are both derived from the transition matrix (see Sec.
Relationship: neutral
Domain: Networks
Sentence 1: For example, in AODV, the RREQ ID and Originator IP Address in an RREQ form a unique identi.er; in DSR, the Target Address and Identi.er .elds from a ROUTE REQUEST, together with the IP Source Address, form a unique identi.er.
Sentence 2: any signature used should be able to keep up with veri.cation at line speed, to avoid a denial-of-service attack where an attacker overwhelms the victim by .ooding it with bogus messages.
Relationship: neutral
Domain: Networks
Sentence 1: First, when a new node N would join the group centered at node C, N will use its public key PKN as its own authentication evidence and send PKN to C. And then, C will generate a secret key SK(C, N) as the proof of C s identity, and encrypt it using PKN.
Sentence 2: in a network, many attacks are initiated by intermediate nodes due to the need of node cooperation, as during the process of message relay, the intermediate nodes may drop, tamper, impersonate, or modify the transferred messages, so that the receiver cannot obtain the transferred messages successfully and influence the performance of the whole network.
Relationship: neutral
Domain: Networks
Sentence 1: In Proceedings of the International Symposium on Object/Component/Service-Oriented Real-Time Distributed ComputingWorkshops, pages 11 18, 2011.
Sentence 2: in the worst-case sce­nario, the TT frame will have to wait for the time needed to trans­mit the largest Ethernet frame, which is 1542Bytes.
Relationship: neutral
Domain: Networks
Sentence 1: The parameters for the curve were generated using a program written in C++, that makes use of the Number Theoretic Library (NTL).
Sentence 2: [2] Kobayashi, T., Morita, H., Kobayashi, K.and Hoshino, Fast elliptic curve algorithm combining frobenius map and table reference to adapt to higher characteristic , Advances in Cryptology EUROCRYPT '99, Lecture Notes in Computer Science 1592, pp.176-189, Springer, 1999.
Relationship: neutral
Domain: Networks
Sentence 1: Authors would like to thank Mickael Maman (CEA­ 0.6 0.5 0.4 0.3 0.2 0.1 0 Data Payload [Bytes] Packet Loss Rate Figure 6: PLR for a three nodes-network with the same UP and di.erent number of retransmissions.
Sentence 2: the PLR is determined by the probability that at least two devices each one with the same UP value.
Relationship: neutral
Domain: Networks
Sentence 1: This behavior tends to match perfectly one of the founding characteristics of wire­less networks, since sending data over the air channel is by nature a form of broadcast.
Sentence 2: for instance, additionally to the data caching capabilities, they may be able to keep track of passing by Interest Packets, so that subsequent requests may be satis.ed more quickly by directly forwarding the said request to the correct face.
Relationship: neutral
Domain: Networks
Sentence 1: [19] V. Srinivasan, C.-F. Chiasserini, P. S. Nuggehalli, and R. R. Rao.
Sentence 2: in our case, we use the logarithmic function as util­ity function of sensor node s source rate, and observe that in general situation, where the source rate of each sensor node exceeds 1b/s, the network lifetime is asymptotically inverse proportional to the system parameter ..
Relationship: neutral
Domain: Networks
Sentence 1: Average BER performance for MRC of Rx1 and Rx3 with PPM scheme    1.E+00 1.E-01 Average BER at Rx1, Rx3 1.E-02 1.E-03 1.E-04 0 10 20 30 40 Method B Method A  PMR C(. )
Sentence 2: a theoretical derivation of bit error probability with OOK modulation and non­coherent envelope detection is also necessary and useful for evaluating the average BER performance.
Relationship: neutral
Domain: Networks
Sentence 1: This means that the service is available even though some of the DENS nodes are temporarily turned off or out of communication range, and hence not a single point of failure.
Sentence 2: it should be possible within the subscription to specify the event source by the name or ID of the source node, wild cards, like all sources or any source of a certain type, or by describing certain properties of the source node, like its location.
Relationship: neutral
Domain: Networks
Sentence 1: Coding+MAC Gain The expected throughput gain with COPE when an 802.11 MAC is used, and all nodes are backlogged.
Sentence 2: assuming perfect overhear­ing (n4 and n5 can overhear n1 and n3, and vice versa), n2 can XOR 4 packets in each transmission, thus reducing the number of trans­missions from 8 to 5, producing a coding gain of 85 = 1.6.
Relationship: neutral
Domain: Networks
Sentence 1: Actual scanner IP 192.168.2.48 182.168.2.46 192.168.2.69 192.168.2.47 192.168.2.38 Table 2. entropies of sampled IP addresses with SYN IP RU of port(des) RU of IP(des) 192.168.2.48 0 6.182974856 192.168.2.46 0 5.564100489 192.168.2.69 0 5.555689457 192.168.2.47 0 5.315405165 192.168.2.38 0 5.246572135 182.168.2.78 4.910392014 5.139337633 192.168.2.93 5.168705252 5.082974856 192.168.2.67 4.480420510 5.055554527 Table 3. entropies of sampled IP addresses not with SYN IP RU of port(des) RU of IP(des) 182.168.2.78 4.910392014 7.763616679 192.168.2.46 0 6.193149604 192.168.2.69 0 6.182974856 192.168.2.47 0 6.346505165 192.168.2.38 0 6.246567213 182.168.2.48 0 6.134676335 192.168.2.93 6.049228862 6.082974856 192.168.2.67 5.168705252 5.054645452 5.
Sentence 2: it is often used by computer attackers to characterize hosts or networks which they are considering hostile activity against.
Relationship: neutral
Domain: Networks
Sentence 1: For example, type two de­gree in Wi-Fi networks has a direct relation to the amount of contention experienced by the node, and thus indicates 2Strictly speaking the degree distribution is, of course, de­.ned on the integers.
Sentence 2: for our purposes the more intuitive de.nition su.ces, and we refer the reader interested in the rigorous mathematical framework of point processes to [16, 17].
Relationship: neutral
Domain: Networks
Sentence 1: If di.erent FIBs do not have a substantial share of common pre.xes, but there is similarity among di.erent portions of pre.x sets, some solutions, such as multiroot [8], can be adopted in our approaches to merge VPN FIBs in TCAMs.
Sentence 2: the TCAM shown in Table 2 should be con.gured into the following or­ganization: 128K×160 bit, which is supported by the NL9512 TCAM [2].
Relationship: neutral
Domain: Networks
Sentence 1: Existing works proposed in literature use sensor association rules measured in terms of occurrence frequency of patterns.
Sentence 2: 5.2 Memory Ef.ciency Availability of main memory space is no longer a big con­cern; it has been shown in pre.x-tree-based frequent pattern mining techniques [18, 30] that the memory requirement for the pre.x trees is low enough to use the gigabyte-range mem­ory now available.
Relationship: neutral
Domain: Networks
Sentence 1: This means that mag­netic .elds are not attenuated di.erently by these media and hence can be used for communication through rock.
Sentence 2: unlike prior work [16] using a single loop an­tenna, to make the network operation invariant to node placement and orientation, each node is equipped with a triaxial loop antenna (which is used both as a transmit­ter and receiver).
Relationship: neutral
Domain: Networks
Sentence 1: Intelli­gent routers [18, 15] are also capable of controlling outgoing packets by modifying received BGP information based on a given policy description, but they do not provide coopera­tive actions among multiple ASes and they assume special devices are available.
Sentence 2: the scope of meta-controlled targets of MIRO and one of AISLE / VR are not the same, they do not con.ict with each other.
Relationship: neutral
Domain: Networks
Sentence 1: The number of uniquely lo­calizable nodes swept by our algorithm is labeled as Swept.
Sentence 2: we run Sweeps and keep track of the maximum number 0.8 of possibilities kept at any time for any node over the course of the algorithm, the mean number of possibilities kept for all nodes, and 0.7 Ratio the 95th percentile number of possibilities.
Relationship: neutral
Domain: Networks
Sentence 1: Sincetheguided tra.c is only generated by the requests of guided peers, the reports of guided peers are enough to calculate the guided tra.c volume.
Sentence 2: asastartingpoint of our re­search,wetry tosolvethesecondproblem(i.e., minimizing MLU) .rst since we need to check how bilateral cooperation worksin asmall network(i.e.,intradomain) andthen can extend it to a larger network (i.e., interconnected multiple network domains).
Relationship: neutral
Domain: Networks
Sentence 1: Use of previous state: While learning with only system calls worked wellfor simple applications, wefoundthatthelearning was noisy for more complex applications such as Outlook and Lync, even with stacktraces.
Sentence 2: while fast dormancy has been helpful in reducing energy con­sumption of background applications on mobile devices, existing approaches of employing aggressive timers can cause signi.cant increase in the signaling load in the operator s network, even for networks that supportPCH state.
Relationship: neutral
Domain: Networks
Sentence 1: If the RL succeded to enter this phase, the network condition is considered stable and the probability for the RL to cause network congestion is small.
Sentence 2: 25 20 15 40 Flow Completion Time [ms] 80 80 CoV QueryAverage Query Completion TimeCompletion Time [ms] 20 Average Background 1560 60 PFC gain [%] CoV Background PFC gain [%] 40 10 10 2020 5 0 5 0 -20 10 0 -20 100 Flow Completion Time 3 3 2 2 5 5 1 1 0 0 0 0 REDQCN BaseQCN BaseREDQCN QCN REDQCN BaseQCN REDBaseQCN QCN REDBaseQCN QCN QCNQCNBaseRED66 20 6620 66 206620 6620 6620 (a) Query Completion Time.
Relationship: neutral
Domain: Networks
Sentence 1: VIRALNET: A WAY TO MAKE SHORT-RANGE MESSAGES INSTANTLY VIRAL Eiman Kanjo Elisabeth Platzer Christian Kittl King Saud University Evolaris, Evolaris Saudia Arabia Graz, Austria Graz, Austria ekanjo.c@ksu.edu.sa elisabeth.paltzer@evolaris.co christian.kittl@evolris.com ABSTRACT Bluetooth, WiFi, and NFC are considered to be low power, affordable and available on most mobile handsets.
Sentence 2: the expert interviews and the discussion will lead to several new requirements for the acceptance of viral short-range broadcast services.
Relationship: neutral
Domain: Networks
Sentence 1: With the development of recent high performance routers, this performance objec­tive has disappeared and MPLS stays attractive mainly for tra.c engineering in the network core.
Sentence 2: similarly to the previously cited proposals (Routing Bridge, Ananas, Lunar), we think that the right place for the inter­connection architecture is at layer 2.5, because we want to organize all hosts into one IP subnetwork.
Relationship: neutral
Domain: Networks
Sentence 1: POST-PROCESSING This section describes some of the post-processing applied to the traces to extract metrics of interest, including how clock skew is removed from the traces, how one-way delay is calculated, how the logs of TTL-limited packets and received ICMP messages are processed to produce round-trip times, and how the packet-pair measurements are used to estimate capacity.
Sentence 2: since we have only the measured times­tamps t ri and t si and don t know the o.set or skew, we must use the measured end-to-end delay d i.
Relationship: neutral
Domain: Networks
Sentence 1: It is natural to think of the top 2 locations as home and work for a large fraction of the population, but more generally the number N of top pref­erential locations determines the power of an adversary and the safety of a user s privacy.
Sentence 2: the spatial domain approach is essentially a generalization approach which re­places a data value with a less precise one or a range to maintain a larger k for k-anonymity.
Relationship: neutral
Domain: Networks
Sentence 1: 3.3 Training the grasper To properly grasp with the Meka hand, .rst, we have to design an in­put and output layers of our target neural network, as well as a .tness function to allow a gradual climb toward an e.cient grasp.
Sentence 2: the neural networks employed in neuroevolution can disambiguate the state based on their sequence memory.
Relationship: neutral
Domain: Networks
Sentence 1: RELATED WORK The database research community have long studied the issue of e.cient processing of top-k queries [13, 9, 14, 3, 10, 1], since they are prevalent in handling heterogeneous data such as multimedia data.
Sentence 2: second, it calculates the sum of the bottom values on the lists sent by the nodes; let s call it t;.
Relationship: neutral
Domain: Networks
Sentence 1: Unfortunately, existing Eth­ernet switches cannot ef.ciently route on multipathed networks, so many researchers have proposed using programmable switches (e.g., withOpenFlow)toimplementhigh-performance routing and forwarding.Unfortunately,mostOpenFlow .rmwareimplementa­tions and other architectures do not exploit the full capabilities of modernEthernet switch chips.
Sentence 2: the PAST algorithm performs better than the NM-PAST algorithm on an EGFT topology.
Relationship: neutral
Domain: Networks
Sentence 1: the faster or the slower one), which we called master_alg_ and must be specified in the following OTcl invocation: #01= To the mean, 10= To the slower, 11= To the faster $session_name master-algorithm 11 The master receiver playout point will be taken as the reference to determine the playout point state (advanced or delayed from that one) in the other receivers (slave receivers).
Sentence 2: rTP Rec e i v e r 1  In our simulation case, we forced a random deviation or drift in the receivers playout rate limited by ±p.
Relationship: neutral
Domain: Networks
Sentence 1: One possible approach would be to include the absence of all three tuples; this would be useful, for instance, if our goal was recovery i.e., if we wanted to .nd a way make A appear.
Sentence 2: our implementation is based on an ND­log encoding of a general path vector protocol provided by the au­thors of [30]; since this code was generic and contained no spe­ ci.c policies, we extended it by adding simple routing policies that respect the Gao-Rexford guidelines and import/export .lters that implements the valley-free constraint.
Relationship: neutral
Domain: Networks
Sentence 1: Note that by de.nition, for Eloc the horizon is always 1 since we are only considering the direct neighbours of node i.
Sentence 2: we show that since static graphs treat all links as appearing at the same time, they do not capture key temporal characteristics such as duration of contacts1, inter-contact time, recurrent con­tacts and time order of contacts along a path.
Relationship: neutral
Domain: Networks
Sentence 1: Flow measure­ments comprise summary statistics that aggregate information de­rived from a .ow s packet headers (including the key, aggregate packet and byte counts for the .ow, and timing information) that are exported as IP .ow records to a collector.
Sentence 2: implementation of the two-step model.Both f0 and f1 are trained using Adaboost algorithm with decision stumps as the weak learn­ers4.
Relationship: neutral
Domain: Networks
Sentence 1: For the Chelsio RNICs, RDMA con­ sumes less power except for 64 byte messages.
Sentence 2: [32] J. Liu, B. Chandrasekaran, W. Yu, J. Wu, D. Buntinas, S. Kini, D. Panda, and P. Wycko.. Microbenchmark Performance Comparison of High-Speed Cluster Interconnects.
Relationship: neutral
Domain: Networks
Sentence 1: DTN Routing in Urban Public Transport Systems Michael Doering, Tobias Pögel, Lars Wolf Institute of Operating Systems and Computer Networks Technische Universität Braunschweig Braunschweig, Germany [mdoering|poegel|wolf]@ibr.cs.tu-bs.de  ABSTRACT Communication is crucial to the coordination and e.cient operation of public transport systems.
Sentence 2: choosing the right sequence of next hops to minimize delay and maximize reliability is the routing algorithm s task.
Relationship: neutral
Domain: Networks
Sentence 1: 2.2 Robustness and Isolation The underlying architecture of our system is a general purpose computer with an OC-48(2.5Gbps) DAG capture card [30], as shown in Figure 1.
Sentence 2: a clear win of merged tables is that we have to perform only four table lookups per packet instead of twelve, signi.cantly reducing CPU usage.
Relationship: neutral
Domain: Networks
Sentence 1: It is assumed that we have to monitor an area inaccessible for humans, such as a highly polluted site containing toxic or radioactive materials.
Sentence 2: in order to compute tedgeNode for TM-MoSBoD we assume that the response schedule (used to avoid message collision in Module-I) issued by an edge node to its neighbor nodes is {n1(0), n2(.005), n3(.01), }.
Relationship: neutral
Domain: Networks
Sentence 1: Bound by this constraint, mobile network operators control the traffic by restricting the users' communication demands (calls) uniformly so as to prevent too high a load on the network equipment from occurring and stopping services, and to give priority to emergency calls to police, ambulance or fire stations.
Sentence 2: we can consider three ways of controlling traffic: 1) balancing the distribution of traffic inflow between locations in the network (geographical balancing), 2) balancing the time that traffic flows into the network (time balancing), and 3) reducing the volume of traffic.
Relationship: neutral
Domain: Networks
Sentence 1: First, we propose a remedy that will initiate another o.oading request to clouds, if the user s subsequent loca­tions do not .t in the predicted track during speci.ed tol­erating time.
Sentence 2: in ENDA, smartphones are required only to communicate very few data with clouds, including application informa­tion and geographical locations, thus preserving more en­ergy than previous approaches of placing the whole decision making on smartphones.
Relationship: neutral
Domain: Networks
Sentence 1: In this way, the client is still able to keep most of its cache even after a long disconnection and save wireless bandwidth and battery energy.
Sentence 2: although the cache ratio of the TS algorithm is more than doubled from T~pd~t~= 10s to Tupdate = 33S, the query delay of the TS algorithm does not drop too much (from 18.7s to 16.1s).
Relationship: neutral
Domain: Networks
Sentence 1: 3.2 Layer 4 Awareness In light of the above problems the solution developed by the authors, and made available in the HPN-SSH patch8, was to make SSH aware of the transport protocol layer (OSI Layer 4).
Sentence 2: 5.4 Final Thoughts SSH, SCP, and SFTP are a set of flexible, robust, and eminently useful applications which are unfortunately hamstrung in high BDP environments.
Relationship: neutral
Domain: Networks
Sentence 1: Section 4 describes the datasets we use.
Sentence 2: betweenness -The betweenness ßv of node v is the fraction of shortest paths connecting all pairs of nodes that pass through v.let s(j,k) represent the number of shortest paths between nodes j and k, and s(j,k)(v)the number of those paths that traverse node v.The betweenness of v is thus de.ned as: X s(j,k)(v) ßv = · (2) j s(j,k) =v=k.V 3.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 4 illustrates the current number of nodes L with de­pleted energy reserves as a function of time.
Sentence 2: tHEOPTIMALTOTALANDRESIDUAL ENERGYMULTICOSTMULTICASTAL-GORITHM The objective of the Optimal Total and Residual Energy Multicost Multicasting (OTREMM) algorithm is to .nd, for a given source node and desired multicast group M,anop­timal sequence of nodes for transmitting, so as to imple­ment multicasting in an energy-e.cient way.
Relationship: neutral
Domain: Networks
Sentence 1: performsthefollowing functions:1) obtain .lesizeinforma­tion.
Sentence 2: end system performance can be signi.cantly im­proved by optimizing the data processing path, including network interface, the fabric bus, device-speci.c protocol stacks, the operating system and user applications, Using network content download usage as an example, we have shownthatthedataprocessingpathinsidethe mobileplat­form quickly becomes the bottleneck and severely limits the extentto which applications cantakeadvantageofimprove­mentsin network speed(seethe exampleinSection2.3).
Relationship: neutral
Domain: Networks
Sentence 1: A typical OBU with a 400MHzprocessor requires 20 milliseconds to verify one ECDSA signature.
Sentence 2: [2] BAI,F., KRISHNAN,H., SADEKAR,V., HOLLAND,G., AND ELBATT, T. Towards characterizing and classifying communication-based automotive applications from a wireless networking perspective.
Relationship: neutral
Domain: Networks
Sentence 1: In our deployment, TransCom clients are Intel Celeron 1GHz ma­chines, each with 128 MB DDR 133 RAM and 100 Mps onboard network card.
Sentence 2: they also introduce additional performance overhead, and need to rely on some form of local storages (e.g., a USB disk) for supporting the launch of virtual machines.
Relationship: neutral
Domain: Networks
Sentence 1: If one of the hosts is an IPv4-only host, then the nl-router must, of course, perform NAT, which is stateful).
Sentence 2: 1A site is de.ned loosely as a private IP network that connects to Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: neutral
Domain: Networks
Sentence 1: By following the framework, we find that the IP­based data­plane protocols over DVB­H broadcast networks of the two specifications are almost the same, and could be easily harmonized.
Sentence 2: we also observe that the XML schema definition of the current version of DVB­IPDC ESG [11] has reserved the space for supporting other kinds of purchasable items in the future version of DVB­IPDC ESG.
Relationship: neutral
Domain: Networks
Sentence 1: Without an I frame, the entire GoP cannot be decoded at the receiver side and the error propagates until the beginning of the next GoP, upon the reception of a new I frame.
Sentence 2: besides the adopted approach, a basic requirement for multimedia content dissemination in VANETs, where the tra.c pattern is very dynamic and unstable, is to create a dynamic relay nodes backbone, like in [13].
Relationship: neutral
Domain: Networks
Sentence 1: The mobile host opens the RCP-1/RCP-2 pipe between network address A/B and the address of Server-I/Server-II respectively.
Sentence 2: upon receiving the transmission request from any RCP pipe, if there is no available space for more data in the receive buffer, R2CP returns with FREEZE to freeze the concerned RCP pipe, and puts it in the active data structure.
Relationship: neutral
Domain: Networks
Sentence 1: In Section 3, we provided several examples of application logic that depends on the orderings of events, i.e., an event depending on some events that happened before it, and demon­strated how the one-to-many mapping could violate those orderings, and consequently the correctness of applications.
Sentence 2: (b) Address translation: Ideally, each virtual network should operate in a virtual address space that is decoupled from the physical network address space and the virtual address spaces of other virtual networks [15].
Relationship: neutral