sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: We extend the C language to have an array sec­tion of the following form: t array name [lower bound : upper bound]  Either the lower bound or the upper bound can be omit­ted in the index range of a section, in which case the lower or upper bound defaults, respectively, to the lowest or highest values taken by the index of the array.
Sentence 2: a[:] is a section containing the whole of A.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In the fault-free case, C shrinks in every step, as long as C is not empty.
Sentence 2: this holds because, in each step, the current graph contains an edge that connects some node of the current C to some node outside the current C. in case of random edge-faults, in each step t in which C = Ø holds, Pr(C does not shrink in step t) = p. Pr(C = Ø after c(kf - 1)steps) = Pr(There are at least c(kf - 1) - (kf - 1) steps, in which C = Ø and does not shrink) a c(kf - 1) c(k1-1)-(k1-1) = · p c(kf - 1) - (kf - 1) = (c · e · p c-1).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: No service ever compresses data with web browser­ s. Further, we observe that the 10-MB text .le can be compressed to nearly 4.5 MB using the highest-level WinZip compression on our desktop.
Sentence 2: for Dropbox and Ubuntu One, the compression level with PC clients seems moderate, while the compression level with mobile apps is quite low.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, it is perfectly okay for a work.ow not to have the control aspect, but only to have the information and the organisation aspect; in that case, it works as a kind of ad-hoc work.ow.
Sentence 2: our approach does not weave all the information from the di.erent aspects into a single class; rather there will be di.erent classes that contribute to the overall behaviour dynamically.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Note that instances of Foldable are already automatically deriv­able in the same fashion using Data.DeriveTH as instances of Traversable are, or alternatively can be obtained from Traversable instances using the kind of default de.nition seen earlier in this section.
Sentence 2: all the remaining effort required to make b. , b.Eq, and b.Ord successfully deal with a new data type on both the in­put and output sides of get-functions is to provide an appropri­ate Zippable instance.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: BeaconPrioritizationFurthermore, our analysisinSec­tion5.3 showsthat closerbeaconshavegreaterin.uence on localization accuracy, especially when the information is in­complete.
Sentence 2: when deploying a robust location system, one should bear in mind that the density of beacon nodes wouldhavegreatimpact onlocation estimation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Because systems of Testbed A are 2 proces­sors per node with single-core only, the percentage of IVC communication is small compared to inter-node communi­cation through the network.
Sentence 2: iVC and No-IVC con­.gurations achieve almost the same performance here and the No-IVC con.guration is omitted for conciseness.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: IN T RO D U C T I O N The steady desire for new applications, augmented reality, and higher display resolutions drives the development of embedded platforms and the need for faster, more powerful processors at the same time.
Sentence 2: today s mobile platforms found in smartphones and tablets host multi-core Central Processing Units (CPUs) and even programmable embedded Graphics Processing Units (GPUs) to deliver the demanded performance.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For testing a cluster, based on the consideration that the time cost to test all classes in a cycle increases as the size of the cycle increases, we as-  sume that the cost is a linear function of the size8.
Sentence 2: given a class dependence graph, by condensing each strongly connected component into a single node, the time cost for test­ing each class and cluster can be shown in a DAG with weighted nodes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Using sensitivity class lists it is easy to see that the directory inode has three authorizations (exec, write, unlink dir) and the inode being removed has one (unlink .le) because they are object-sensitive and placed in different classes.
Sentence 2: for the .le system and the task operations we have examined, authorization graphs and sensitivity class lists have been suf.cient to verify au­thorizations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The analysis can be modeled as an iterative computation in which each iteration starts with a partial points-to graph and then adds new edges according to the semantics of program statements.
Sentence 2: for the assignment p = q , new edges are added from p to all current successors of q; for the statement p = *q , new edges are added from p to the successors of all successors of q;and so on for other statements.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although a sequence of pivots already de.nes a .xed route, it is insu.cient for use in aircraft navigation, since it does not account for its maneuverability.
Sentence 2: the .nal repre­sentation of the route the tra jectory is built by reshaping the sequence of straight lines in such a way that it can be directly used for the guidance of an airplane.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For a task with a downward step TUF, (a) ReUA (b) LaEDF Figure 4: AUR and DMR vs. Load of G1 under E1 As Figure 4(a) shows, with ReUA during under-loads, all tasks accrue 100% AUR and DMR, except task T1, whose AUR and DMR is 99.23% at Load = 0.3.
Sentence 2: reUA delivers the statis­tical performance assurance of being able to accrue 100% of task maximum utility with a probability at least 96% for all tasks.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Finally, to ensure that all data accesses are non-negative, we add m to the new index, such that the final transformation is from A[i][j] to A[2 * i -j +m].
Sentence 2: we have reduced storage requirements from n * m to 2 n + m. The modified code corresponding to this mapping is shown in Figure 6.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To find out the time cost of methods by measuring time according to events of each unit test helps to improve performance of program by eliminating unnecessary codes or objects generation to find methods called intensively, and to find the bottleneck.
Sentence 2: we have developed the tool that supports the automation of unit test creation and performance with a research on the method to test the performance of mobile applications in the unit test environment.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thirdly, we observe that the interest (number of queries) in travel time decreases at a slower rate with dis­tance for highways than that for other types of road seg­ments (e.g., road segments inside a residential complex).
Sentence 2: one can cut down on bandwidth requirement by vary­ing the geographic scope in which travel time information for a road segment is disseminated according to its interest gradient.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For Web IM components, we are also able to reach a finer level of adaptation, exploiting the management capabilities built into the BEA Weblogic application server via Java Management eXtensions (JMX -see http://java.sun.com/products/JavaManagement), which we have integrated within the probing and effectors layers of our platform.
Sentence 2: workfiakes can decide to intervene also in response to variations in the size of the queue of pending requests, and manipulate the details of the threading model of the Web IM application.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Parameter Value page size 4KB # of pages per block 64 # of blocks per package 16384 # of packages per SSD 8 SSD capacity 32 GB read one page 0.025ms write one page 0.2ms erase one block 1.5ms transfer one byte 0.000025ms over-provisioning 15% threshold of triggering GC 5% and write back the smallest number of pages.
Sentence 2: the clean­ing cost of the greedy algorithm should be the smallest among all algorithms.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The QoS broker collects information from QoS enabled Grid Information Service like resource attributes, current status, resource availability, usage models, capabilities and pricing information from the respective resources and use this information source in the QoS oriented scheduling process.
Sentence 2: broker coordinate with local schedulers to compute an overall schedule fulfilling user QoS constraints and take care of overall load balancing of the system.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, d1(S) of new live data is copied into the survivor space from Eden.
Sentence 2: the amount of data in survivor spaces after the major GC would increase as follows with each minor GC: d1(S),d1(S)+ d2(S),d1(S)+ d2(S)+ d3(S), and so on, until it reaches N gN (S)= dn(S), (7) n=1 where N is the tenuring threshold.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Table 4 demonstrates that the condition numbers of all 10 worst-conditioned 3×3 sub-matrices of the numerically best code are much smaller than that of the other two codes.
Sentence 2: in the worst case scenarios, the numerically best code is numerically much more stable than both the Gaus­sian random code and the Grassmannian code.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The Voronoi diagram V (S) is disconnected if all point sites are collinear; in this be created within the perimeter and the all the nearest neighbors case it consists of parallel lines [23].From Figure 5, the Euclidean of each node within.
Sentence 2: this will be denoted as follows: distances between one node to another is represented by the red  n 1 line, when we refer to node A and B, the distance d between Let the set :.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The time required to build this large sequence of J-Expressions, together with the time required to marshall it onto the network connection as a byte stream, can cause a noticeable delay in starting an application, even if the other buffering techniques axe used.
Sentence 2: it makes some practical sense to devise a way to store this 'compiled" byte stream, so that, in a production setting, it can simply be transmitted to the Java Engine.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In some embedded processors such as ARM10E, Analog Devices ADSP TS201S, Motorola M-core MMC221, Renesas SH-X3 and TI TMS370CX7X, SPM is used as an alternative to hardware cache.
Sentence 2: an approach for effective SPM utilization is essential for the ef.cacy of SPM based memory subsystems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At the same time, we argue that the e.ort exerted in implementing the TDD practice in the developers work.ow does not yield a viable return on the investment, at least in the short term.
Sentence 2: we intend to replicate this study in two respects: we aim to investigate more deeply the impact of TDD as a whole, and not only as a practice that reinforces the writing of tests before implementing a feature, while leaving out the prescribed refactoring phase.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: That is, the pixels in a satellite image are often grouped together according to some similarity metric during analysis, and classi.cation is often based on the results of this cluster analysis [19, 20].
Sentence 2: this workwas motivated by the concern that image water­marking may a.ect GIS classi.cation methods that serve as the basis for analysis and decision making.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The computed summary of getResource consists of the following edges: (LO,0,0,(0,0)) (L8,2,0,(0,0)) > (LO,0,0,(0,1)) (L5,1,0,(0,0)) > (LO,0,0,(1,0)) (L5,0,0,(0,0)) > (LO,0,0,(1,1)) (L5,0,0,(0,1)) > All edges in this summary begin at the label L0 and terminate at one of the two labels L8 or L5 both of which are labels at which getResource returns.
Sentence 2: the summary matches the intuition that the procedure body is just one transaction.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: By virtue of residing in the data region of the process address space, only a single copy of each global and static variable is shared among all threads in a multi-threaded process.
Sentence 2: de­pending on their purpose and use, each static or global variable in a multi-threaded program needs to be assigned separate thread­local storage, or its use needs to be guarded (typically by using semaphores or mutexes) to enforce synchronized and atomic access by each thread.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Benchmarking Decentralized Monitoring Mechanisms in Peer-to-Peer Systems Dominik Stingl, Christian Gross, Sebastian Kaune, Ralf Steinmetz Multimedia Communications Lab TU Darmstadt Darmstadt, Germany {stingl,chrgross,kaune, steinmetz}@kom.tu-darmstadt.de ABSTRACT Decentralized monitoring mechanisms enable obtaining a global view on di.erent attributes and the state of Peer-to-Peer systems.
Sentence 2: such mechanisms are essential for managing and optimizing Peer-to-Peer systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Whilethetask-levelparallelization approach canbe applied to each hierarchical node of the graph, the pipeline paral­lelization approach is limited to loops.
Sentence 2: as soon as a node representing a loop is reached in the parallelization process, the correspondingprogramdependencegraphis ex­tracted and the genetic pipeline parallelization approach is executed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Here are the di.erences between the two: First o., .xture sets are sets of .xtures: 1 1A.xtureset := P (A.xture ) Cue abstraction extracts the .rst component from a cue: .
Sentence 2: a0 (F, p):= F The complement has the set-theoretical interpretation: 1 F := A.xture  F subtracting the complement of c, c, works like apply­ing a stencil.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Recall that the smallest rectangle embedding our given polygon P call it R is of dimensions xmax ×ymax, where ymax and xmax denote the maximum vertex coordinates in y and x respectively, and ymin and xmin denote the minimum vertex coordinates in y and x respectively.
Sentence 2: we can accept crudely that an arbitrary point (a,b) propagate to the next iteration if it belongs to R, or that a =xmax and b =ymax.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, one code fragment from the non-recursive merge sort in our benchmark looks like the following: for(s=0; s < ArrayLength-b; s+=2*b) { ... } Since the variable b is identi.ed as an input variable, random values will be fed into b.If 0 is used, the increment statement in the for loop will never change the value of s and cause an in.nite loop.
Sentence 2: we imposed a limit on how long each execution of a code fragment can take.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The main rea­son for this is that many embedded applications execute in envi­ronments that are shared by several other concurrently-executing applications.
Sentence 2: these applications share a lot of re­sources and resource availability to a particular application depends strongly on memory demands/occupancies of other applications as well as the global (e.g., OS-directed) memory management policy employed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (5) h.H We already know the request arrival rate for each data center .n = NC xn.
Sentence 2: from queuing theory results [13], the average time that a request stayed in the system can be given as 11 Dn == t (6) µn - .nh.H µhxnyh - NC xn Equation 6 suggests that an increase in the request rate will result in an increase in the time spent by each request in the system, which is intuitively correct.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This implies the impossibility of the edge routing in case where covering relation is used to optimize the dissemination of subscriptions, which has also been implicitly shown in [14].
Sentence 2: we propose to use a dual routing strategy: (1) edge routing can be used when covering relation is not optimizing the subscription propa­gation, and (2) fast content-based matching is performed when the subscription tra.c is limited by the covering re­lation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The analysis proves that multiplying the median by 2.1 is suf.cient to ensure a collision probability of 95%, regard­less of n. Note that when B is itself a sybil node or the random route from either A or B enters the sybil region, the adversary controls that particular sample.
Sentence 2: using the median sample to estimate w is much more robust than directly using the 95th percentile.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Furthermore, we introduce a syntax sugar for writing the Each (co-)capability action is translated to a tuple con­standard if construct: taining the constant value indicating its type in its .rst el­def ement; for example, open M is translated to (open, [ M] ).
Sentence 2: if M = N then P else Q = let x = eq(M, N) in P else Q M.P is executed by .rst checking [ M]] s type at runtime.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.5 More Improvements Someimprovementswereaddedtothebasicalgorithmtoenhanceitsperformance.Welisttheseimprovementshere.
Sentence 2: moving more than one page Whenatrapoccurs,itimposessomeoverhead.itmakessensetomovemorethanonepageineachtrap.Wetypicallymovedeightpagespertrap.Thisopti­mizationalsoreducesthespaceoverheadofthestatus-table andthe.rst-object table.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Copyright c &#38;#169;2010 ACM ISBN 978-1-4503-0071-1/10/06... $10.00 of dietary life style.
Sentence 2: if the heart could be moni­tored constantly in daily life, the unexpected heart diseases would be more easily predicted not only for patients with heart pathologies but also for healthy people who exercise daily.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Each element of an unbalanced projection matrix is generated by a symmetric Bernoulli distribution of ±1.
Sentence 2: a balanced pro­jection matrix also consists of ±1 at equal probability but in addition we require that each row must contain equal number of 1 s and -1 s. the sum of the elements in each row of a balanced matrix is always zero.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.2 Support for data-dependencies Our checking system is path-sensitive, and will suppress many common infeasible paths [4].1 However, in general pruning all false paths and resolving all data dependencies are undecidable problems.
Sentence 2: we allow programmers to provide help when calculation fails using a built-in predicate to express data dependencies: expr ==> annot Here expr can be any valid C expression and annot any 1This implicit pruning obviates much of the need for explicit data-.ow .ags introduced in the Vault language [5].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: PQ-trees p and piare equivalent (p=opi) if pican be reached frompiby a series of these transformations.
Sentence 2: c,otn sdi sft e,nIt/b(puu)=={efer oenIt i e rab(pou)tapo=opa}(14) The universal PQ-tree, denoted pu , has a P-node as a root and a leaf for every member of U.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Procedure addSuperTypes also inputs an IRG G and a type e,and returns the set of all types that are super-types of e.The procedure identi.es super-types through reachability over inheritance edges, starting from e. Complexity.
Sentence 2: algorithm buildIRG makes a single pass over each type t,toidentify t s direct super-class and classes ref­erenced by t. the worst-case time complexity of the algorithm is O(m), where m is the size of program P .Al­gorithm computePartition performs reachability from each changed type.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The 2-category Ps-Tsm-Alg has objects given by small symmetric monoidal categories, maps given by strong symmetric monoidal func­tors, i.e., functors together with data and axioms to the e.ect that the symmetric monoidal structure is preserved up to coherent isomorphism, and 2-cells given by all sym­metric monoidal natural transformations, i.e., those natural transformations that respect the symmetric monoidal struc­ture.
Sentence 2: ps-Tsm -Alg is the 2-category SymMonstr and Tsm(C) is the free symmetric monoidal category on C. Taking C = 1, it follows, up to equivalence, that Tsm(C) op is the category lof .nite sets and permutations used by Tanaka [23].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If a trap occurs due to a watchpoint, Kivati records the identity of the remote thread making the triggering access in the watchpoint s metadata.However, at thispoint, the re­mote accessis not an atomicity violation until the matching end atomic of the AR is executed.
Sentence 2: kivati also notes down whetherthe triggeringaccess was a read or a write.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Delay/Distance 30 Delay/Distance 2  1.8 25  Appendix 1.6 1.4 20 6.1 Proof for Lemma 2 1.2 15 1 Proof of Lemma 2: Denote by A(x,r) the circular region 0.8 centered at x with radius r.Note that any two nodes i 10 0.6 and j can communicate with each other directly at time t 0.4 5 if and only if dt(i, j) < 1, and nodes i and j can appear 0.2 (0) (0) 0 0 only within A(X,a)and A(X,a), respectively.
Sentence 2: 0 20 40 60 80 100 120 140 0 2 4 6 8 1012141618 ij Distance from the source Distance from the source if d0(i, j) = 2a +1, then dt(i, j) = 1 for all t = 0.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The worst case recover y cost, corresponding to all k faults occurring during checkpoint saving, includes k re-executions, kCi/(mi+1), and k checkpoint savings and state restorations, k(Cs+Cr).
Sentence 2: total worst case cost of task ti with fault overheads is given by TCi=Ci+kCi/(mi+1)+miCs+k(Cs+Cr) (2.4) Of this, the first three terms are frequency dependent while the last term is frequency-independent according to the assumptions made.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We emphasize that there is an interval where fopt is nei­ther U nor fee, but f * , in the above results.
Sentence 2: the optimal scheme (OPT) is more than just determining at ev­ery point the better frequency in the set {U,fee}.In fact, there are regions where both of these well-known frequencies fail to minimize the system-wide energy consumption.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It occurs because the text approach processes each line of change independently, whereas our approach considers the relations among the statements in the PDG.
Sentence 2: in cases where the modi.ed statements were related, our approach com­puted fewer bug-introducing versions (at most, one version per modi.ed method), whereas the text ap­proach could identify one version per modi.ed line.
Relationship: reasoning