sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The Multi-Cloud developers needs to understand each particular interface in order to connect each service, fact that is not compliant with R2.3 and R2.5.
Sentence 2: the achieve­ment of portability or relocation (R1.5 or R2.10) is consid­ered a moving target, di.cult to reach, if the set of APIs to comply with is constantly increased.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The input and output are given names, and the post test spec­i.es that there are to be two parallel executions and how to modify the inputs and compare the outputs.
Sentence 2: this .le speci.es that the NaiveBayes program (a machine learning classi.er) has the property that, if the input ( train­ing data ) is perumuted, the output ( model ) should still be the same.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When running the kernel at 1000 Hz we can see that the situation improves dramatically the e.ective quantum length, even for interactive applications, is typically several ticks long, so the scheduler bills the process an amount that re.ects the actual consumed time much more accurately.
Sentence 2: on a 1000 Hz system X is billed for over 93% of the time it consumed, with the missed quanta percentage dropping to 64% the fraction of quanta that are indeed very short.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Example c For the sake of illustrating how a P-chart can be used to monitor QoS requirement and detect violations, suppose that there is a running software system and the requirement is No more than 2 seconds response time for 95% of the requests .
Sentence 2: the requirement is that the proportion of response time that is greater than 2 seconds is 0.05.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It suf.ces to introduce context-switches after only these operations; since a private operation in a machine com­mutes with operations of other machines, a context switch after is redundant.
Sentence 2: if an error occur in an execution with a more .ne-grained context-switching, it can be shown to occur in another equivalent execution in which context-switches happen only at the points mentioned above.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: {snRMQ} end foreach end foreach Figure 2: Iteration space partitioning algorithm and the target iteration of each dependence distance vector.
Sentence 2: the dependence span of a distance vector J D(d)= d = (d1,d2,...,dm) is the set of iterations that start at Ji = (i1,i2,...,im)and end at Ji+ dJ= (i1 + d1,i2 + d2,...,im + dn), as long as both are in the iteration space.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper we demonstrate how to take advantage of these architec­ture features to e.ciently map OpenMP into this platform.
Sentence 2: we exploit relevant architecture features such as: (1) the capability to con.gure a section of every SRAM bank as scratchpad memory, which provides a fast tempo­rary storage to exploit locality under software control; (2) a rich set of hardware supported in-memory atomic instruc­tions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While A-STEAL is an extension of classic randomized work stealing and the feedback algorithm of A-GREEDY, combining the algorithms posed novel technical challenges, because unlike classi­cal randomized work-stealing, A-STEAL must deal with dynamic changes in the job s processor allotment.
Sentence 2: when the allotment decreases, we use a mechanism called mugging [14], which involves a processor stealing all the work of another proces­sor, rather than just a single task.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Both direct and indirect conflicts are generally discovered at a time later than when they are actually introduced.
Sentence 2: be­tween the time a conflict begins to emerge (e.g., a developer starts to change a file that another developer is already in the process of changing, a developer inserts references to Java methods that another developer already removed) and the time it is actually detected, significant time passes during which the conflict may grow from small and innocuous to large and com­plex to resolve.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, a persis­ tent problem has repeatedly bothered the collaborators: when one programmer introduces a bug, everyone has to live with that bug until someone .xes it.
Sentence 2: a compilation error created by one programmer s work-in-progress might prevent others from seeing less catastrophic compiler errors of their own, or might prevent them from running the pro­gram to test their code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Due to .ow-insensitivity, the order of propagation in C Gstd does not matter from a correctness perspective; any propagation order produces the same .xed-point as long the propagations continue following the subset constraints.
Sentence 2: whenever source of an edge contain an additional points-to fact than the destination node, the points-to fact is propagated.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Maximum time retailer will wait for back order M  Minimum cost associated with back order lead time proposed by supplier Cmin  Maximum cost associated with back order lead time proposed by supplier Cmax  Acceptable lead time of the supplier for particular retailer L  Minimum viable lead time of the supplier for retailer Lmin  Maximum viable lead time of the supplier for retailer Lmax  Cost of lost sales in case retailer chooses to no longer do business with supplier CB,LS  Actual number of items requested by the retailer x Although based on total cost, the client-specified fitness function actually weighs the ordering cost more heavily than the other two expenses.
Sentence 2: each fitness value is the sum of the total ordering cost (OCost) and the average of the sums of holding (HCost) and shortage (SCost) costs over all retailers R (Eq.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As given in Section 4, the normalized leakage energy consumption of our approach and the hardware link shutdown method are around 30% and 48%, respectively.
Sentence 2: the proposed scheme achieves a leakage energy reduction of about 37% over and above the hard­ware link shutdown scheme, demonstrating the importance of se­lecting routes based on individual send operations, rather than .x­ing it based on source-destination pairs (i.e., 37% saving versus 20% saving).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As in the breadth-.rst strategy, a priority queue of plan nodes is created by traversing the test plan, and is used to in­crease task parallelism during the early execution stages of the plan.
Sentence 2: for the initial task requests from test clients, tasks for nodes in the queue are assigned to all avail­able clients immediately at the beginning of plan execution.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1 transformation uml2qn(uml:UML, qn:Gpmif) { 2 top relation PaStep2TransitType { 3OMG -MOF 2.0 QVT Final Adopted Speci.cation v1.1 http://www.omg.org/spec/QVT/1.1/ 4EMF web site: http://www.eclipse.org/modeling/emf/ 5Details about the JTL environment are available on [4] and at http://jtl.di.univaq.it 6DLV web site: http://www.dbai.tuwien.ac.at/proj/dlv/  Listing 1: Fragment of the UML2QN transformation Furthermore, the relation GaExecHost2ServerType in lines 17-26 maps UML Components in Service Centers.
Sentence 2: the Component metaclass annotated using the GaExecHost stereotype is mapped to the ServerType metaclass of the GPMIF metamodel.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In either case, the value of the reference to the widget object may very well end up being null, which would result in an app crash when an access such as the following reading of a value from the EditText is attempted: num = Integer.parseInt(et.getText().toString()); Sometimes the students instantiate the EditText independent of findViewById and the UI altogether.
Sentence 2: they create an EditText object that has no connection whatsoever to the declared UI.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While many bene.ts related to the use of design patterns have been stated, a little has been done to empirically in­vestigate pattern change proneness [3] or whether there is a relationships between the presence of defects in the source code and the use of design patterns [24].
Sentence 2: there is lack of empirical studies aimed at analyzing what kind of changes each type of pattern undergoes during software evo­lution, and whether such a change can be related to changes contextually made on other classes not belonging to the pat­tern.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In a program understanding tool, our system may not immedi­ately produce the reason that the user needs.
Sentence 2: for lat­tices whose elements are sets, our system computes a single reason instead of one reason for each element within the set As an example of this, suppose a programmer requests a pro­gram slice and the slice is much larger than what the programmer expected.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CenWits employs several important mechanisms to ad­dress the key problem of resource constraints (low signal strength, low power and limited memory) in sensors.
Sentence 2: it makes a judicious use of the combined stor­age capability of sensors to .lter, organize and store im­portant information, combined battery power of sensors to ensure that the system remains operational for longer time periods, and intermittent network connectivity to propagate information to a processing center.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We use Qs,j,k to represent the Figure 3: The process of determining the set of iterations (from all the nests) that will be executed by processor s. set of loop iterations from loop nest k that touch the elements in Zs,j .
Sentence 2: the global parallelization strategy assigns the iterations in Qs,j,k to core s. each core executes the iterations that access the array region it is assigned to.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Any address a pro­duced by injection is considered a partially evaluated value of the term, and SE ' is recursively applied to that value until the context stack becomes empty and the evaluation .nishes (this is the last case in Figure 16).
Sentence 2: staged evaluation uses and calculates new ad­dresses in the same way as standard evaluation uses and calculates new values.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The first and most obvious one is that a preset distinguishing sequence is also an adaptive one (for which every path from the root to the leaf has the same input portion on its label), while the reverse is not true.
Sentence 2: if an FSM has a preset distinguishing sequence, it has an adaptive distinguishing sequence as well, but there are FSMs that have adaptive distinguishing sequences but do not have a preset distinguishing sequence.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It may be that continuous com­pilation and continuous testing truly had no affect on time worked, or it may be that true positive or negative effects were masked by Parkinson s Law: Work expands to .ll the time available for its completion.
Sentence 2: students may have budgeted a certain amount of time to the problem set, worked toward that budget by either rushing to complete if they were behind, or gold-plating for code clarity if they were ahead, and turned in whatever they had when time ran out.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Many of these techniques monitor runtime events to .nd those events that correspond to the executions that fail.
Sentence 2: re­searchers have investigated using the runtime coverage of entities such as statements [1, 2, 8, 9] and branches [10, 11], which require lightweight instrumentation, and information .ows [12], which require more expensive instrumentation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.5.3 Fitness Functions The .tness value we used for the NEAT algorithm is the arithmetic mean of the performance of the benchmarks in the training set.
Sentence 2: the .tness value for a particular performance metric is: .s.S Speedup(s)Fitness(S)= |S| where S is the benchmark training suite and Speedup(s)is the metric to minimize for a particular benchmark s,which in our case is the run time (i.e., running time of the benchmark without compile time).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We considered and evaluated sev­eral scheduling algorithms that combined different classi.cation schemes and policies, and in this section we present those that showed the best performance and were also the simplest to imple­ment.
Sentence 2: we evaluate two algorithms based on the Miss Rate classi.cation schemes, because the miss rate is very easy to obtain online via hardware performance counters.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For instance, a unit increase in the Process Maturity measure would results in the decrease of the estimated defect count associated with a software component by a factor of 0.22.
Sentence 2: the model suggest that going from an average of 3 in Process Maturity across the locations that worked on a component to an average of 4 could result in a estimated 4.5 times reduction of the number of defects found in system integration associated with that software component.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In sum, the corresponding tile dimension is given by Si = (si + di 1 u)/wi , (14) where u is a normalized version of t that ensures that the starting positions of the tiles in the spatial direction are the same for all time tiles and for both phases.
Sentence 2: we set u = (t + h + 1) mod (2h + 2) for phase 0 and (15) u = t mod (2h + 2) for phase 1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: va ::: ValidVAddr / {do m; execContext pm c; getPage pm va} ::: Returns {Just PageInfo { physPage = fst pa, writable = True, dirty = True, accessed = True}} |} assert All pa, pm, c, m. m ::: Changed pa pm c ==> m ::: Dirty pa pm c Note that the last assertion only partially speci.es how dirty and access bits behave; it gives suf.cient, but not necessary conditions for them to be set after execution.
Sentence 2: we do not specify that access bits should be set when a user process reads from a page.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This setup allowed for a close (post mortem) examina­tion of the impact that code coverage analysis and visualization had exerted on the development process and especially on automated tests.
Sentence 2: the following four questions related to the introduction of code coverage analysis and visuali­zation tools will be addressed: (1) What was the impact in terms of code coverage of the automated tests?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Consequently, it is relatively easy (i.e., less reasoning is needed) for an attacker to guess how a system works and to estimate its optimal strategy (i.e., no cheating, if a pre-trusted peer is involved in a transaction; otherwise, behave depending on each user s behavior).
Sentence 2: the attacker can save its time in satisfying a given pro.t goal G with a small number of reasoning steps.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, we want to test the transitions caused by con­nection establishment and closing, including obscure cases such as simultaneous closing1.
Sentence 2: we want to generate se­quencesofeventsthatmaketheTCP implementationmovethrough all possible statesinthe state machineinall possibleways.Weneed to create different sequences to get to state ESTABLISHED and different sequencestogetto CLOSEDagain.Atypical connection establishment would follow Figure 2: 1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The preconditions of all individual actions are jointly logi- cally consistent in s. That is, the conjunction of all atomic formulae in precondition lists evaluates to TRUE in s.  The postconditions are jointly consistent in s. That is, there are no two actions such that the first one brings about a ground atom while the second action brings about the nega- tion of that atom.
Sentence 2: action effects do not con-  flict with one another.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: either allocate in the same stack frame as the caller if the caller was marked @StackAllocation, or in whatever memory area its caller was allocating in if it was not marked @StackAllocation.
Sentence 2: if a method without either annotation is called from a method marked @StackAllocation, then this method will allo­cate in the memory area determined by the Real Time Java library.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: start true goal ( booksAvailableInStock and orderSaved and paymentDoneByPayPal and deliveryScheduled ) or ( booksAvailableInStock and orderSaved and paymentDoneByCreditCard and deliveryScheduled ) Listing 2: Initial state and goal As an example, Listing 2 shows the initial state and the goal for the bookstore scenario.
Sentence 2: two alter­native goals are listed, the preferred one that describes the situation when payment has been done through PayPal, and the alternative to follow if paying through PayPal is impos­sible.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: SYMMETRIC FEATHERWEIGHT MULTI-JAVA We illustrate our ideas by extending Featherweight Java (FJ) [14] with symmetric encapsulated multi-methods, the result we call Symmetric Featherweight Multi-Java (SFMJ).
Sentence 2: (i) we change the syntax for method de.nition and invocation to make all parameters explicit, (ii) we allow methods to be de.ned in the class of any of their parameters, and (iii) we introduce multiple dispatch.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: is a placeholder and a spe­cial message block (but is not signed in a cryptographical sense as it will become clear later).
Sentence 2: mi is treated as an ordered set Mi = {m1,...,me} or equiv­alently {(1,m1),..., (f,me)}; these representations will be used interchangeably as it will become clear from the con­text.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: List of 3D graphics APIs Name Top Platform OpenGL Khronos Group PCs, Workstations and Supercomputers Java3D Sun Microsystems PC DirectX Microsoft PC M3G (JSR 184) Sun Microsystems Mobile Devices OpenGL ES Khronos Group Embedded Systems Each of the APIs described in Table 1 were designed for the development of applications implementing 3D computer graphics 1 WEB 3D - http://www.web3d.org/ 2 WEB 3D - http://www.web3d.org/x3d-earth techniques widely used in industry.
Sentence 2: the last two libraries mentioned were developed to aim of supporting development of 3D applications on mobile devices.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: One of our rules for cast insertion is G f e e ' : T T = Object(X){ei:Ti}.i.
Sentence 2: ei = x G f e.x cast(e ' , T , Object(X){x : Dyn}).x : Dyn when a program tries to read an object member that does not appear in the object s type, the object is cast to a type that contains that member at type Dyn.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Similarly, the MultiJava type system can prevent a method M that is declared to be final from being overridden, in the sense that there can be no other method in the same generic function whose tuple of specializers is a pointwise subtype of M s. Restriction R3 allows this condition to be easily checked.
Sentence 2: r3 ensures that the methods that a particular method M overrides are all available when M s compilation unit is typechecked.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In particular, since we deal with radio link utilisation, the realism of the radio mediumwasexpectedtohaveavery signi.canteffect.Inthe small-scaleexperiment,1clientwas usedtoof.oad tasksto 5servers (2 of which were located within an area congested bya streaming entity generating traf.c).Weexamined three cases for each load sharing algorithm: (i) without contention, (ii) with contention (extra traf.c generated by the streaming node)but considering onlycomputational requirements, and (iii) with contention and using our approach which addition­ally considers bandwidth requirements.Fora more thorough evaluation of our algorithms, we also tested them on a large­scale mote testbed.
Sentence 2: we used the Heterogeneous Experimental Network(HEN) [1] deployed at the Depart­mentof Computer Scienceat UCL.We tested our algorithms using3clients,1streaming node and 21 servers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As can be seen in the table, .ve of the six users achieved their best performance while using the Modi.ed LRU hoard­ing method, despite extensive experimentation with the clus­tering parameters in an attempt to .nd settings that would produce optimum performance.
Sentence 2: the best hoarding method for most users involves applying several simple heuristic changes to standard LRU.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (a - x , ax) is referred to a layout such that the overall increased cache miss latency As a special case, when ay = a is less than the overall reduced row-bu.er miss latency, then the resulting memory access latency will be less than the original one.
Sentence 2: we sacri.ce some cache perfor­mance in order to further improve row-bu.er performance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More precisely, given a (usual) map­ping M from a schema S1 to a schema S2, de.ne thePC-mapping generated from M, denoted by PC(M), as: {(I1, I2) |I1, I2 are positive conditional instances of S1 and S2, respectively, and I2 is an Rpos-solution for I1 under M}.
Sentence 2: pC(M) is obtained from M by including the pairs (I1, I2) of positive conditional instances such that I2 is a solution for I1 under M, according to the notion of solution for instances with incomplete information introduced in this paper.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The favorite ratio Fj of a task tj exe­ i,k i cuted on processor Mk is de.ned to be m max h=1 (Cj ) j i,h Fi,k = (9) Cj i,k jj j For any task t, a larger F value implies tis more suit­ i i,k i able to be executed on Mk.
Sentence 2: ti j may have a shorter execution time if executed on Mk compared to other proces­sors.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To this end, the SoSAA adapter provides meta-level perceptors and meta-level actuators modules, which collectively define the interface between the two layers in SoSAA.
Sentence 2: the SoSAA adapter sets the range of the possible interventions and monitoring capabilities of the intentional layer by distinguishing between the capabilities of the infrastructure and those of the application.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: With Proposition 2.1, the theorem follows from structural induction on the typing derivation of 0/;0/ f e : t. Combining Theorem 2.5 and Theorem 2.6, we clearly have that the evaluation of a well-typed closed expression e in .code either reaches a value or continues forever.
Sentence 2: this indicates that the problem of free variable evaluation can never occur in .code.
Relationship: entailment