sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: For instance, the programmer can express a mixin class that is only ap­plicable to non-con.icting classes: 1 class SizeMixin extends X { 2  errorif ( some F size : X.fields ) 3 int size = 0; 4 } In this case, the programmer wants to assert that, if the parame­ter type C already contains a .eld named size, this is not an error in the de.nition of SizeMixin but in the instantiation SizeMixin.
Sentence 2: the errorif construct serves as a typical type-cast: it is both an assumption that the type system can use (i.e., when checking SizeMixin it can be assumed that X has no size .eld) and at the same time a type obligation for a later type-checking stage.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It seems reasonable to assume that for an ordering assignment to the SIMD groups that minimizes total permutation costs, each node in the SIMD DFG will have the same ordering as at least one of its neighbors in the graph.
Sentence 2: the idea is to take known orderings of SIMD groups of memory operations and propagate them through the SIMD DFG.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Folding the columns of Table 4 yields a 1×1 matrix whose entry is equation (5).
Sentence 2: the constants that can be derived from Table 1, which already exist (e.g., sgl) or can be computed by foldings, comprise the product-line of L. The inconsistent equations that we encountered earlier, error1 and error2, cannot be derived by folding Table 1.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In addition, each rule is en­dowed with proof ob jects that correspond to the introduc­tion and elimination forms as shown below.
Sentence 2: objects M ::=  .x : A.M | M1 M2 (Linear functions) | M1, M2 | FST M | SND M (Additive conjunction) | (Additive unit) a linear LF representation for the judgment G; .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This is expected because K =(50,000 + 10,000)/10,000 = 1.2 at time instant t0 in the former case of pollution attack and it is K =50,000/50,000 = 1 at time instant 0 in the latter case of pollution recovery.
Sentence 2: now let tE be the time x(t) becomes within E of M, i.e., x(tE)= M - E.We have, -µt, M - c1e M - E = 1+ Ke-µt, ent versions of a title explicitly into account, and assume that users select a version to download independently of the number of copies of the versions available.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As a result, eventually the pre.x q1,...,q|F | of q1,...,qn (lines 8 10) will consists of all processes in F , and will be .xed and the same at all correct processes forever.
Sentence 2: anti-O guarantees that F contains at least one correct process, say p. there is an i =|F | such that eventually always qi = p. To .nish the proof, we must show that |F |= n - 1, but this is true because anti-O outputs at least one process in.nitely often.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Otherpartitioningstrategiesonthesource-codelevel,be theydeclarationanalysis,signatureanalysis,chunkingetc, leadstolossofakeypropertyofsoftware:itsexecutability.
Sentence 2: theseapproachescannotservetomodelreduced functionality"inthesenseofjustthefunctionalityneces­saryfortheenvironmentthecomponentunderconsideration istobeintegratedin".Indeed,mostoftheseapproaches, whilemaintainingthelow-leveltextualityaimathigherlev­elsofabstraction.Hence,theyarevaluableforfocussed partialcomprehension.Wethereforeputtheseapproaches inaseparatebutdistinctbag.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: All edit checkins on the removed branches end up in the victims parent branches (there may be multiple victims if multiple branch removal steps are taken from H0 to create H1).
Sentence 2: the maximum number of conflicts occurs when there is perfect interleaving of edits that were created on different branches in H0: PossibleConflicts=NumberOfEditsOnVictims+NumberOfEditsOnParents-1 We normalize isolation by dividing the number of conflicts that the branch avoids by the maximum number of possible conflicts.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (i; s1) s2 = i;(s1 s2) skip s2 = s2 Instruction async s1 creates a new activity to execute s1, and the current activity continues with the next statement.
Sentence 2: rule ASYNC executes the activity (P, async s1; s2) by reducing it to the tree (P, s1) || (P, s2).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The temperature informa­tion can be used by the controller of the heater for proper heating and pressure data can be further transmitted to a control centerthrough othernetwork means(such aslinked infrastructure or cellular communication).
Sentence 2: in this paper, wefocus on apipeline segmentbetweentwoadjacent heat stations, which runs from a few kilometers to tens of kilometers.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: M is represented in Haskell with the type Matrix ShortestDistance, and calling closure cal­culates the length of the shortest path between any two nodes.
Sentence 2: to see this, we can appeal again to the in.nite series view of closure: (Mk)ij is the length of the shortest path with k edges from node i to node j, and M * is the sum (which in this semiring means minimum ) of Mk for any k. (M * )ij is the length of the shortest path with any number of edges from node i to node j.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Instead of placing barriers on all read accesses to shared items (eg, reading an integer .eld from an object), we assume that once a reference is read from the heap, the context reading it will eventually read from the object targeted by that reference.
Sentence 2: the read barrier is placed only on loads of references from the heap (eg, getfield or arrayload bytecodes in which the type of the .eld or element is a reference).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The experiments showed that to achieve the best performance for the lock-free algo­rithm, the back-offshould notbe too high.By appropriately choos­ing the back-offto get the best performance, it turned out that the average number of CAS performed by each instance of the algo­rithm is two which is bigger than the average number of atomic instructions executed by each instance of CC-Synch and DSM-Synch.
Sentence 2: the lock-free algorithm has a performance disadvan­tage compared to these algorithms.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It will accept any structure on its lefthand side, but accepts only a single Boolean on its righthand side.
Sentence 2: in the next CSP an NT is done with respect to the when: [(word: a ,count:size([ a when true, b when false, c when false, b when false])), (word: b ,count:size([ a when false, b when true, c when false, b when true]))] The eight when clauses can be evaluated in parallel.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Generally, while the referenced approaches provide a good foun­dation for studying reliability of component-based systems, few of them can be readily applied in early stages of system develop­ment, before an executable version of the entire system is available.
Sentence 2: the goals of the approach described in this paper include: The development of a probabilistic technique for reliability analysis that is applicable at the design-level, before the ac­tual development and system integration phases.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Every CP race (and hence every HB race) is also a lockset race, since the absence of a CP edge between con.icting accesses to a location means that there is no consistently held protecting lock for that location.
Sentence 2: a lockset-based race detector would detect all races detected by CP,5 and may also report many additional warnings.Inpractice, many of these extra warnings are false alarms thatdo not correspond to actual races.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When op­ erationBis placedatcycle0 asshowninthe .gure,its outputis placed in the register write region.
Sentence 2: the scheduler makes sure that all the edges coming out from operationB are success­  Figure 14:Performanceevaluationof the baseline and CGRA Express architecturesfor three multimedia applications.Performance is broken down into non-innermost loop regions (sequential), inner-most loops whose performance is constrained by the availability of resources (loop (resource)) and inner-most loops whose performance is constrained by cross-iteration dependences (loop (depen­dency)).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: for(i=0;i<Li;i++) s3 =s3 +X3[i]* X4[i]; s3 =s3 +X3[i]* X4[i]; } This transformation separates accesses to arrays X1 and X2 from accesses to arrays X3 and X4.
Sentence 2: if the .rst two arrays are stored in a different set of disks than the last two arrays, this transformation can increase disk idleness, thereby leading to a more effective low-power management of the disk system.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Un­like the TA constraints that have only one goal state (the only accepting state), each property or non-TA constraint may have several goal states (any non-accepting state for the property and any accepting state for the constraint).
Sentence 2: the distance from the current property state or non-TA con­straint state to its goal state is also not a good predictor of the path length since multi-goals tend to make these dis­tances indi.erently small.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Any of the three system calls may block,interruptingforsome timethewholeprogram.
Sentence 2: let forward in_fd out_fd buffer = let n = Unix.read in_fd buffer 0 1024 in Unix.sleep 3; let n = Unix.write out_fd buffer 0 n in () Thecoreideaofthe libraryistoreplaceapossiblyblockingfunc­tion by a function that returns immediately a promise, that is a value that actsasaproxyfor thevalueeventuallycomputedbythe function.insteadoffunction Unix.sleep, one usesfunction Lwt_unix.sleep of type int -> unit Lwt.t where Lwt.t is the type ofpromises.Likewise, thefunction Unix.read is replaced byafunction Lwt_unix.read oftype file_descr -> string -> int -> int -> int Lwt.t Type Lwt.t can also be interpreted as the type of threads: the function Lwt_unix.read returnsa thread thatreadsfromagiven .ledescriptorand terminateswithreturnvaluethenumberofbyte read.Weadopt this interpretationfor theremainderof thepaper.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Hence, with a probability at least 1-o(n -3), At(v)-1 Pt(v) = At(v)(1/(dp))(1 -1/(dp)) 2dp > (dp/4)(1/(dp))(1 -1/(dp))> 1/64.
Sentence 2: the probability that node v is not informed at Step k of Phase 3 is (1 - 1/64)k = o(n -2).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The event E(U2 ,S2 ,g) occurs only if S |= e =0, or ' ' ' S | = e =0 (hence S2 = S ' )and the event E(U ,S ,g) occurs.
Sentence 2: s 2 '' ' Pr(E(U2 , ,g)) =Pr(S |= e =0) + Pr(E(U ,S ,g)) =P(U ' ,r)+ P(U ' ,t) =2P(U ' ,t) = (2d) ×P(U ' ,t) Hence, P(U2,t) =(2d) ×P(U ' ,t) Join Node: See Figure 5 (c).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The high latency of the response (which currently reaches 30 minutes) is the major factor increasing the severity of the KPI violations and their direct monetary costs.
Sentence 2: the major goal of the DEBS 2012 Grand Chal­lenge was to investigate the applicability of the event process­  Figure 2: System architecture under evaluation in the DEBS 2012 Grand Challenge ing systems to bridge the gap between the actual occurrence of the event causing a violation of a prede.ned KPI and the detection of such a violation see Figure 2.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Formally, we de.ne the simple adaptive program from program Pi to Pj to be the composition SAi,j = comp(Pi , Pj , Ai,j ).
Sentence 2: we formally model an n-plex adaptive program as an EFSM that contains n steady-state programs P1, P2, ··· , Pn , each of which is an EFSM, and there exist adaptations among the Pi s. an n-plex adaptive program M contains the union of all the states, transitions, and initial states of n steady­state programs and the corresponding adaptation sets.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Tool Support for Data Validation by End-User Programmers Christopher Scaffidi Institute for Software Research Brad Myers Human-Computer Interaction Institute Mary Shaw Institute for Software Research School of Computer Science School of Computer Science School of Computer Science Carnegie Mellon University Carnegie Mellon University Carnegie Mellon University cscaffid@cs.cmu.edu bam@cs.cmu.edu mary.shaw@cs.cmu.edu  ABSTRACT End-user programming tools for creating spreadsheets and web­forms offer no data types except string for storing many kinds of data, such as person names and street addresses.
Sentence 2: these tools cannot automatically validate these data.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since a CIO is independent of any computing platform, we do not know yet which interaction modality is used on that platform.
Sentence 2: each CIO can be sub-typed into sub-CIOs depending on the interaction modality chosen: graphicalCIO for GUIs, audi-toryCIO for vocal interfaces, 3DCIO for 3D UIs, etc.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It can be veri.ed that the ec-language generated by this Mealy implementation ak SH((o1 SH(r1,b1p1))* , (o2 SH(r2 ,b2p2))*), where SH is the shuf.e operator.
Sentence 2: this implementation corre­sponds to the case where the timing of sending receipt1 from Ware­house1 to Store is independent of the timing of the correspond­ing messages bill1 and payment1 between Bank and Warehouse1.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The Update Message Processing Time Tolerance (STi j) specifies the acceptable variance level by the server.
Sentence 2: for given CMi jk and di jk, the server independently computes a Proposed Arrival Time (PAT) for command message CMi jk as follows: PATi jk = Ui + di jk + ERTTj + ESi j + RTTTj + STi j.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Indeed, three criteria have been adopted to select these variables: relevance for the designers and developers, easiness to collect, and simplicity and consistency of the counting rules [7].
Sentence 2: we used both the Length measures proposed by Mendes et al., for hypermedia and web applications, such as number of web pages, new images, animations, text pages typed, audioclips, etc ([15], [16], [17], [18], [19]) and other measures specific of dynamic web applications, such as Number of Server side Scripts and Applications, and Number of External references.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Compared to other OS level page sharing optimizations we can use additional information about the caller of the alloc function and the knowledge where the R interpreter stores the frequently modi.ed object header.
Sentence 2: we do not share the .rst page of the allocation (.rst page .ag in line 16) saving the time required for the page fault taken when the interpreter .rst updates the header.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If the program is CPU-bound, our previous WATS scheduler [10, 11] can be adopted to improve its performance on asymmetric multi-core architec­tures by balancing tasks to asymmetric cores according to the tasks workloads dynamically.
Sentence 2: the above lim­itation will not a.ect the applicability of DWS.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In GUMSMP, the role of the .sh delay value (inherited from GHC-GUM) is more aggravated, due to the role of the gateway HEC in mediating any communication to other PEs.
Sentence 2: if the gateway HEC is in a delay period, it will not immediately send a FISH, even though the request is originating from a different HEC.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: WorkspaceManager updates RefIndex files each time a developer commits his updates: link insertion results in new entries in the RefIndex files, while link removal results in entry deletion in the RefIndex files.
Sentence 2: in order to repair links to a moved element E, first WorkspaceManager examines the RefIndex file associated with the model which is the source of moving (Msrc).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, an important observation for the Visitor pattern is that, since each operation crosscuts each visitor class/aspect, adding a new visitable type to the existing class/aspect hierarchy will cause an invasive change to all of the visitors resulting in a maintenance nightmare.
Sentence 2: no matter if it is an aspect-oriented or a pure object-oriented implementation, the Visitor pattern is applicable only under conditions when the class structure is static and does not change frequently.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Patterns have to be searched not only in the GUI of the mobile application or in the interactions between the ap­plication and the operating system; they can also be found in the structure of the model that is created by GUI rip­pers.
Sentence 2: three sources of patterns are considered: soft­ware (i.e., the presence of buttons, search forms, etc.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Then from (6.18) we conclude for random colour schedules MI and NI:  ) .Efind Prob E(MI(MI) ll = Prob(M) N.N (M,a,i).M(N) (6.20) ll e = Prob(N) · 1 - e N.N (M,a,i).M(N) (6.19) l e = k(k + 2) · Prob(N) · 1 - e N.N l e = k(k + 2) · Prob(N) 1 - e N.N e = k(k + 2) · Prob NI .N .
Sentence 2: 1 - e EfindII Prob (M) E(M ) ) .Efind Prob E(MI(MI) = Prob(E(MI)) e ) .Efind(NI k(k + 2) · Prob E(NI) = 1-e Prob(E(MI)) e EfindII = k(k + 2) · Prob (N) Prob E(N) .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: There is a probability of at least d for all processes who run sharedCoin[j] to return the value j, and a probability of at least d for all processes who run sharedCoin[j] to return the value j +1.
Sentence 2: for any value in {0,...,k}, there is a probability of at least d2 that this value is not the output of any process running sharedCoin[j], for any 0 = j = k - 1 (because j =0 may be the output only of sharedCoin[0], j = k only of sharedCoin[k - 1], and j .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In specific, a student that answers correctly many questions will aggregate more and more time to TTAC.
Sentence 2: we hypothesized: H1: TTAC will have a positive effect on Actual Performance Total_time_answer_wrong (TTAW): We define TTAW as the total time that a student spends on viewing the questions and submitting the wrong answers.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Page size 2KB OOB size 64B Block size 256KB(data) + 8KB(OOBs) Pages per Block 128 Page read time (Trp ) 60µs OOB read time (Trs ) 20µs Page write time (Tw) 800µs Block erase time (Te) 1500µs Endurance 5000 times ECC coding 4 bits/512B From Table 1, we can see that while we can ef.ciently read pages or OOBs (60µs for one page; 20µs for one OOB), page write and block erase operations are more time consuming (800µs for one page write; 1500µs for one block erase).
Sentence 2: when de­signing FTLs, if we can reduce unnecessary write and erase op­erations, the system performance can be effectively improved.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Instead, we de.ne the type-theoretic invariant by lifting every single piece of Boolean information, and then we manipulate the resulting sets in type theory with logical operators on sets.
Sentence 2: the invariant we de.ne is the following: invariant :: (a :: Set) |-> m (QueueI a) -> Set = a |-> mp-> let mf = mfst mp; mb = msnd mp in And3 (TM (totalLst mf)) (TM (totalLst mb)) (Or (TM (null mb)) (TM (not (null mf)))) Here, mfst and msnd select the .rst and second element, respec­tively, of a Maybe pair, And3 is de.ned similarly to And but it per­forms the conjunction of three sets instead of two, and Or is the disjunction of sets de.ned as data Or (a,b::Set) = inl (x::a) | inr (y::b) Finally, TM lifts a Maybe Bool into a set.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: With serializability, for any trace (oCr upt, we can change the trace to convert any open transaction nested in­side a committed transaction from open to closed while still keeping the same p, and still be serializable.
Sentence 2: in some sense, with serializability, open nesting only differs from closed nesting if an open transaction commits, but its parent aborts.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Because some entries will cross cache line bound­aries, even if the algorithm is correct it writes an entry in its new slot before overwriting the old slot the un­predictability of cache line write-back can still cause data loss on a power failure if the update to the old slot of the entry reaches NVRAM before the update to the entry s new slot.
Sentence 2: we append entries in log fashion, at the end of each node s list of child pointers.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: These candidate organizations cause either extensive resource pro­visioning or poor-quality operator mapping between logical work.ow nodes and the available physical resources nodes.
Sentence 2: instantiating a media processing work.ow to the underlying hardware before the work.ow execution be­gins does not lends itself to adaptive and autonomous oper­ation of the work.ow, scalable to resources and demand.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 5.1 Compilation Threshold with Single Compiler Thread By virtue of sharing the same computation resources, the ap­plication and compiler threads share a complex relationship for a VM running on a single-core machine.
Sentence 2: a high se­lective compile threshold may achieve poor overall program performance by spending too much time executing in non­optimized code resulting in poor application thread time.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In this paper, we use the term legacy applications with reference to applications that are characterised by some temporal constraints, but are not developed using a speci.c API.
Sentence 2: developers of legacy applications contrive (or contrived) to achieve an ac­ceptable timing behaviour by a large range of heuristic solu­tions (including a generous use of buffering).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: RoomFinder In English, this states that when the TripManager service is in a .nalizing state (i.e., when .nalizing is true), it needs to commit transactions involving the processes bound to FlightFinder and RoomFinder.
Sentence 2: when cod­ingupthe TripManager service, the developer would write code to signal when a transaction should .nalize rather than write the communication code needed to implement Trip­Manager s role in the commit protocol.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.2 Greedy execution of actions  In responsive applications, it is not feasible to defer actions until later input events resolve ambiguities.
Sentence 2: we perform an action as soon as it is reached: The program in {} A, {} B, {} C out {} Z ( A() B() | A() {!>Z({});} C() ) emits a Z event as soon as an A event arrives, rather than waiting for the next event to determine which alternative should have been selected.
Relationship: reasoning