sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The data reuse theory [44] says that the array V has temporal reuse.
Sentence 2: using the condition ~vlq3 = /:v2qa = 00, we obtain ~a = (1,0,0) T. a suitable Q is (001) 0 I 0 , 1 0 0 which, in turn, leads to a displacement vector (1,0, 0) for array U, meaning that its layout should be column-major.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Namely, if the participants do not spend enough time on studying the given component, the percentage of the correct answers will probably decrease for that component so there is a dependency relation between these two vari­ables.
Sentence 2: the percentage of the correct answers can assist in estimating the time required to fully study the given component (i.e., to achieve 100 % of the correct answers), which can be used as an indicator of the e.ort required to fully understand a component 1 .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: LGP algo­rithmsdi.erfromTGP algorithmsin many important char­acteristics, such as linear versus tree structure of the learnt program and separable blocks of code versus complete trees.
Sentence 2: it is unlikely a crossover operator developed speci.­cally forTGP willperformwell whenusing LGP.Henceitis Copyright2010ACM978-1-4503-0072-8/10/07 ...$10.00.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Table 1: Classification of our Review (source: authors based in Cooper [4]) Characteristics Category Focus Research Methods Goal Criticism Identification of Central Issues Perspective Neutral Representation Coverage Exhaustive with selective citation (tertiary studies [10] [12]) Organization Methodological Audience General Scholars Practitioners  2.2 Problem formulation The primary goal of this study was to identify the types of research questions used in the secondary studies.
Sentence 2: the central research question1 is stated as follows: RQ1 What are the types of research questions asked in literature reviews analyzed in the tertiary reviews [10][12]?
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The estimated asymptotic speedup can be computed by observ­ing that as n1 ' becomes large the costs of the loops are proportional to n1 ' * 3.16 for the original loop and n1 ' * 1.29 for the SIMD loop (since the SIMD loop processes 4 elements per iteration).
Sentence 2: the cost ranking functions predict a speedup of 2.44×, closely match­ing the empirically observed speedup of 2.5×.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, each event class should stores the list of possible state The State Event Design Pattern Page 5 changes for a given event, i.e., the subset of state changes (source state, target state).
Sentence 2: each event subclass holds a behavioral part of the FSM, and while an event occurs, it identi.es thanks to its key mapping (behavioral part) the future state according to the current one.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: These nodes are the ones which follow node k in schedule SG(i) or axe the nodes from subsequent schedules : SG(i+I), SG(i+2),..., SG(h) where h denotes the height of the tree of DDG as per topological ordering.
Sentence 2: varSet(SG(i),k) can be found as : Varse~( SU ( O, k) = oj:~> k UV S( SU( O, j)O[O,:~>_~>,UV S L(p) ] where, UV SL~p) = Uv.esG(p)UV S(n) .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In fact, if there are k factors, given that the n-th factor has ni levels, a full factorial analysis requires n experiments: k n =.ni (1) i =1 It is easy to see that n can grow very large even with a relatively small number of factors, due to the product in (1).
Sentence 2: it is not always possible to run a full factorial analysis, because of constraints on the overall running time of simulations, or on the amount of output data to be collected and analyzed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, those mocks were not sharing their behavior (i.e., the writing of a text in a mocked .le would not have effect to the reading of the same .le from another mock), and could only be used when given as input to the CUT.
Sentence 2: such an approach would not work on a class like the one depicted in Figure 1, as the object interacting with the .le system is not given as input to the CUT.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, if a job j has sj =27s, and the time slots have intervals of 25s, the tasks of j cannot be executed until time 50s.
Sentence 2: figure 4 shows C for Approach 1 is over 2500s, which is about three times longer than Approach 3 s C. the results show that for Approach 1, there is tradeoff between being able to handle larger workloads, and achieving a lower C. 5.2.3 Effect of Workload Parameters In this section, the effect of varying different workload parameters on system performance is discussed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 0=z=b Now recall that if a node q gets failed on level g during its m-th getName, then there is only one process failing q at that point.
Sentence 2: for any level g, Yp,m,n p,m is an upper bound on the number of times a process gets failed on level g. Clearly then Y is an upper bound on the total number of times a process gets failed, which is X.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Considering the foreign error probabilities as being independent and identically distributed random vari­ables, the probability of not having a foreign translation error along the cycle is ci -1 (1 - Ef ) Moreover, compensating errors, i.e., series of independent translation errors resulting in a correct mapping, may oc­cur along the cycle of foreign links without being noticed by p1 (which only has the .nal result qn as its disposal).
Sentence 2: assuming T1.2 correct and denoting by d the (possi­bly high) probability of errors being compensated somehow, the probability of a cycle being positive is ci -1 ci -1 (1 - Ef ) + (1 - (1 - Ef ) )d = p(dcid, Ef , d) while, under the same assumptions, the probability of a cycle being negative is ci -1 (1 - (1 - Ef ) )(1 - d) = 1 - p(dcid, Ef , d).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Besides,anotablepeuliarityofembeddedsystemsistheir wideuseofserialbuses,suhasPhilips'ubiquitousI.Cstan­dard.Workstationshavestartedtofollowthistrend,with thefamousUSB(UniversalSerialBus),theawaitedSerial­ATA(forinternalharddrives),andvariousderivativesof I. CsuhastheSMBus(formotherboardsensors)andthe DDC(DisplayDataChannel,formonitoronfguration)[13, 10,11,1].WithC,seletingaportrequirestwoaddress I. values(ahipIDandaregisterindex),insteadofonefor parallelbuses.Oneagain,handlingsuhapeuliarityre­quiresspeifode.
Sentence 2: cPUs Basially,anembeddedCPUiseitheramiroproessor,a DSP(DigitalSignalProessor),oramiroontroller.Be­sidestheirsignalproessingorientation,DSPsareatu­allymiroproessors[4].Typially,amiroproessorisft­tedwithaparallelbusinterfae,whihrelyonasimple, hardware­implementedbusprotool.Verydiferentinthat respet,amiroontrollerisfttedwithamoreversatilein­terfae,madeofgeneral­purposeI/Opins.Softwarean ontroleahofthesepinsindividually,setitforinput(out­put),andread(write)itslogialstate.Thisallowsbus protoolstobeimplementedinsoftware.mi­roontrollersanemulatevariousbusinterfaes,whether parallelorserial.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The JIT compilation of the bytecode (or even its recompilation in order to apply further optimizations) is reserved to heavily-used methods, as it is an expensive operation that increases signi.cantly the runtime.
Sentence 2: the NPB-MPJ codes have been refactored towards simpler and independent methods, such as methods for mapping ele­ments from multidimensional to one-dimensional arrays, and complex number operations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Implementing this program in NOX would be dif.cult we cannot run the two smaller programs side-by-side because the rules for monitoring web traf.c over­lap with the rules for monitoring traf.c by host.
Sentence 2: we would need to rewrite both programs to ensure that the rules installed on the switch are compatible with both programs e.g., installing two rules for each host, one for web traf­.c and another for all other traf.c.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The problem in this pro­gram is that after safely retrieving the number elements that are to be copied, there can be a concurrent thread that modi.es the source vector before the method .nishes (for example, a concurrent thread could remove all the elements from the source vector).
Sentence 2: when the execution of the addAll method happens, the informa­tion about the number of the items that are being copied is stale, and an exception will be raised when it tries to access elements that are not there anymore.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: But it only makes sense to create new strands when there is a region that is relatively empty of strands.
Sentence 2: we plan to extend the programming model with three mechanisms: a mech­anism for creating new strands, a mechanism for reading the state of nearby strands, and a mechanism for global computations (i.e., reductions) over the whole set of active and stable strands.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: behavior of the sCPS as a whole that cannot be accredited to any of its individual constituents alone.
Sentence 2: software engineering for sCPS becomes a significant challenge: a sCPS practitioner has to have working knowledge of multiple (and usually not well-related) areas software architectures, real-time and embedded systems, distributed systems, autonomic agents, and control systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Finally, on top of the core APIs, there are the vast amount of de­rived, nonetheless equally critical, information and artefacts such as documentation, tutorials, wizards and recipes, and sample code and applications for programmer consumption.
Sentence 2: modern programmers must master the necessary skills to effectively work with this vast amount of information artefacts and to overcome potential learning barriers [6].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The other doall block, containing only PDG node B, is reassigned as a sequential node, and then merged with the other two sequential blocks to form a single sequential block that contains the PDG nodes A, B, C, D and J.
Sentence 2: for this loop, the PS-DSWP algorithm produces two stages, where stage 1 is a sequential stage and stage 2 is a parallel stage.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This allows two mutually untrusting components to transfer funds, provided that they both trust the mint and purse system.
Sentence 2: if the payer has a payerMainPurse account, and the payee has a payeeMainPurse account, then the transaction may take place as follows: // payer creates temp purse def tempPurse = payerMainPurse.makePurse tempPurse.deposit(100, payerMainPurse) // payer passes tempPurse to payee payee.acceptPayment(100, tempPurse) // payee payeeMainPurse.deposit(100, tempPurse) A feature of the Grace implementation is that each mint stores a ledger that tracks the balance of its purses.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Executing the methods concurrently alone may not be suf.cient because objects used in the invocations need to be shared or linked properly.
Sentence 2: we derive an invocation context, i.e., the parameters (and receivers) to be used while invoking the methods in M. We analyze the execution trace associated with the test case involving each method in M. From the location of the lock acquisition in the trace, we search backwards to identify the data dependence of the lock on the method s parameter.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The analysis of the application tier CPU utilization in Figure 7(e) cor­responds to the CPU-bound implementation of the BLR.
Sentence 2: the HSM operates well based on the aver­age application tier CPU utilization, which results in an approximately monotonic throughput increase per scale-up step (Figures 7(b) and 7(a)).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, a strategic plan for IT has the following additional di.erences: it partially realises the institutional strategic plan, and so must provide some implementation details as well; theplansproduced arebound to changefre­quently, over time, in ways that were never anticipated; and mostdecidersdonot masterthechangeprocessnorthetech­nology that engenders them.
Sentence 2: the strategic IT plan describes applications or solu­tions for particular business departments or functions, as well as technological details such as infrastructure require­ments, software upgrades and architectural detail.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In a run of A.T using D ' ,since T implements D using D ' , each output d by T corresponds to a legitimate response of the failure detector D at some instant t between the time the emulator issues the input to T and the time T produces the corresponding output.
Sentence 2: the emulation of A s qry fd instruction makes it appear as if the qry fd instruction takes e.ect atomically at t, receiving the response d from the failure detector D. Intuitively, therefore, corresponding to every run R of A.T using the failure detector D ' ,there is arun R ' of Ausing the failure detector D such that R and R ' have the same failure pattern and the same input and output histories.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The Zhi# compiler framework3 provides two extension points for semantic analysis and program transformation that can be implemented by compiler plug-ins to make external type de.nitions available in Zhi# program code.
Sentence 2: external type de.nitions can be seamlessly used with features of the C# programming language such as, for example, method overriding and user de.ned operators.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The adaptive nature of the Throughput (calls/sec) 1200 1190 1180 1170 1160 1150 1140 384 512 640 Heap Size (MBs) Figure 4: Throughput measurements for telco collector makes this a di.cult property to measure: if we double the number of processors available for GC, and this increases the GC rate, then we ll do more collection at each pause, changing the execution signi.cantly.
Sentence 2: for this experiment, we restrict the collector to fully young col­lections, use a .xed young generation size, and use a total heap size large enough to make old generation collection activity unnecessary.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The requirements requested by the 3 customers are R = {, }, R = r ,r }, R = {} rr { r and the profits of them ,,w are 30,25,20 , respectively.
Sentence 2: the total 1 342 783 8 ww requirements requested are R = {, , r }, R = r ,,, r ,rr } 1 2 3 rr {, rrr ,, R = {,rr ,r }.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Finally, we should emphasize that our approach to semantic integration is focused on the conceptual level, as advocated in [12].
Sentence 2: our ontology is a reference ontology, i.e., an ontology that is constructed with the sole objective of making the best possible description of the universe of discourse, with regard to a certain level of granularity and viewpoint [11].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It is a universal property that applies to all models with notions of restricted inter-domain interaction.
Sentence 2: it applies to all non-shared-memory mod­els, most notably CSP (communicating sequential pro­cesses [13]), and APGAS (asynchronous PGAS [19]) lan­guages which require that mutation is done locally to an owning place/region.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For instance, continuing with the example discussed ear­lier (Figure 3), let us assume that the sample airfares section is always preceded by the element  which contains a label for the section, Sample Round-trip fares between: .
Sentence 2: one of the extraction patterns would be a  element that immediately follows a  with the text Sample Round-trip fares between: .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Design and Implementation 4.1 Context Representation Inthissection,we.rstpresentourcontextrepresentation,andthendiscusshowitisusedincontextchecking.
Sentence 2: asdiscussedpreviously,itistooexpensivetoexactlyrepresentandcomparecontexts.Inthepresenceofpointeraliasing,acon­textcomparisoncouldrequirecomparingtheentireprogramstate.itisinfeasibletorecordtheprecisecontextforfuturecomparison,ortoperformaprecisecomparisonofthecontextattheentranceofacoderegion(aprocedureinourimplementation).Inthissection,wepresentourtechniquetoapproximatetheglobalcontext,whichmakesitpossibletoef.ciently(andapproximately)recordandcheckcontextsatruntime,whilemaintainingastrongcorrelationwiththebehaviorsofthecoderegionsuchthatitcanbeusedtoeffectivelyselectsuspiciousregionstomonitor.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Essentially, programmers im­plement the near equivalent of a PGAS or RPC runtime within the application.
Sentence 2: dynamic memory management in the exist­ing non-coherent programming models tends to be either: 1 The Berkeley UPC 2.14.0 we used in the evaluation imposes a static limit of 64 MB per thread for dynamically allocated memory.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, this mode relaxes safety the client may initially see an inconsistent view (although one generated using read-consistent data) and, since his updates are not propagated, has a different impression of the global state.
Sentence 2: the state must even­tually be converged, and so, the transaction is concurrently re-executed in consistent mode to .x the client s view and apply modi.cations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, the chance is higher in TriMedia for resource con.icts re­sulting in longer schedules and hence, higher costsforpred­icated if-statements.
Sentence 2: more if-statements are splitfor theTriMedia thanfor theEVP.Fig.8(a) showshigh speedupsfortheVLIWprocessors, whereastheARM shows smaller speedups.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: And since the current is constant the areas 1 to 4 under the line of voltage drop are proportional to the amount of energy delivered in each time period.
Sentence 2: the energy capacity available by the battery pack can be divided into four partitions depending on the voltage range as follows: 3.2 V 2.8 V 31.25 % of 21600 Ws .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unfortunately, this is not a factor that the user can control when compiling Haskell programs with GHC, as GHC performs many code transformations when optimizing a program, with a particular tendency to push code towards branch leaves in the hope that this will reveal more opportunities for optimization.
Sentence 2: when examining the code generated for of.oaded kernels, we often see branches with relatively large amounts of code in both of them, with many instructions common to both branches (after alpha­renaming variables to match them up).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Rule CO E R PRO P is the counter-part of Rule PRO P CO E R, but we do not need additional hypotheses here since the proposition judgment is stronger than the coercion judgment.
Sentence 2: other coercion typing rules can be understood under the light of Rule TE R M CO E R. In particular, the judgment G f (S f t ) C s is meant to be used when some judgment G, S f a : t holds, which by extraction implies that G, S f t : * coercions G f (S f t ) C s need not assume that G, S f t : * holds.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: FollowingtheUML­RTdefnitionstritly,thereisnoseman­tioverlapbeausethestatehartsforSA,SBandSProtool speifydiferentpartsofthesystemandareindependent fromeahother.
Sentence 2: informallyhowever,thesemantioverlaparisesfromour assumptionthatasignalsentbySAistransmittedoverthe onnetorandthenlaterreeivedbySB.the behavioroftheonnetorisimportantandwillprovidethe basisforthedisoveryofsemantioverlap.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Rule SC, Submit Constraints: We consider theparticular casein which the constraintdomain isthemediatorialdomain(theotherdomains canbeprovedina similar way).
Sentence 2: s is the mediatorial store M, Sj is Mj , Mj = p .M, Hj = H, Fj = F, and Rj = R. We assume thatµ.SolP(Gj).There exists µj = U µsuchthat µj .SolP(Gj), andtherefore µj .SolC(Mj).Since Mj = p.M, µj .SolC(p.M).µj .SolC(p), and µj .SolC(M).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: According to data from the Software Engineering Institute, human resources constitute an average of 70% of the costs in a software engineering project [4].
Sentence 2: many problems that may lead a project to failure, for example, the high amount of software errors or unconformities, the variability of requirements, and others, are related with inefficacy in people management in the software development process, and could be improved by adopting adequate practices of team management [5].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Increasing the MAX FAILURES and HELPING DELAY parameters reduces the num­berof operations that require the slow path.Infact, when both pa­rameters are set to 100, thefastwait-free queue steadily achieves performance similar to that of the MS-queue.
Sentence 2: these results demonstrate that our wait-free design can achieve the per­formance and scalability of a lock-free algorithm.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, in our suite of 11 MapReduce bench­marks, the ratio of Map task processing times on Atom-based to Xeon-based nodes vary from 1.5:1 to 4.5:1.
Sentence 2: despite skewing the data distribution, a signi.cant number of remote tasks will remain, leading to the performance issue outlined above (see Section 5.5).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Hence,modelanimationhastobecomparedwithcon­ventionalcodetestingsupportedbyadditionalmech­anismstointerpretorinterrelatetheresultsofsuch executions).
Sentence 2: 4.Amoreinvolvedclassofspecifcationcomprehension toolsaretobetargetedatrewritingaspecifcation and/orreasoningaboutit.Here,theobjectiveiscer­tainlytoraisecomprehensibilitybygeneratingamore compactrepresentation.usuallythelevelofab­stractionisraised.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The algorithm is intended to be used for su.ciently large L and Q, to be elaborated later in Section 5.
Sentence 2: the k-th instance of NAB executes on a network corre­sponding to graph Gk(Vk, Ek), de.ned as follows: For the .rst instance, k = 1, and G1 = G.V1 = V and E1 = E.  The k-th instance of NAB occurs on graph Gk in the fol­lowing sense: (i) all the fault-free nodes know the node and edge sets Vk and Ek, (ii) only the nodes correspond­ing to the vertices in Vk need to participate in the k-th instance of BB, and (iii) only the links corresponding to the edges in Ek are used for communication in the k­th instance of NAB (communication received on other links is ignored).
Relationship: reasoning