sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: (Recall that V denotes scheduler bu.er size in this paper).
Sentence 2: our approximation for Ps, as given by (6), deteriorates as V is increased because interarrival times can interact in the scheduler bu.er over a longer timescale than if V were small and increase the e.ect long term correlation has on bu.er dynamics.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.2 Limited scope In AspectJ, the within/withincode pointcut enables to applyan extension into a limited scope.
Sentence 2: a combina­tion of call and withincode pointcuts enables to execute an adviceinthemiddleof amethodbody.Thispartialextensionof a method body is a unique feature of AOP.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Each com­ponent Pi has a failure detector with all the safety properties of Oki × S resticted to Pi.
Sentence 2: all quorum out­puts are contained within Pi.The sum of ki s is at most k. Moreover, at least one component Pj also satis.es all liveness properties of Okj × S. Next we further weaken .k by allowing dynamic splitting of components during the run.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Research Issues and Future Directions Currently, we have implemented an ANTLR-based parser for A2BL, and we have tested several reinforcement learn­ing algorithms for use in A2BL agents.
Sentence 2: we have tested Q-Learning and Sarsa algorithms for single-goal agents and are working to design a general arbitration algo­rithm, that is, to develop the theory of modular reinforcement learning.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To the best of our knowledge, all existing algorithms use the degenerate case where k =1 and the mutator count is either 0 or 8, in which case the count is simply a .ag that indicates whether a pointer to the object has been stored behind the wavefront.
Sentence 2: immediately after a pointer to an object is stored behind the wave­front, the mutator count is set to a value that cannot be decremented.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.4 Weak intruders An aspect is a weak intruder (de.nition 6) if states of a con.gu­ration with a current base program instruction (i.e., ib) are always reachable states.
Sentence 2: a weak intruder aspect may pro­duce unreachable states during advice execution but always returns to reachable states when it returns to the base program.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We then incorporate this new model into the merge by describing how it overlaps with each of the mod­els in Figures 2(a) and 2(b).
Sentence 2: we map Shooting in the helper model to Shooting in Figure 2(a), and similarly, map Flash Shooting and Normal Shooting to the corre­sponding states in Figure 2(b).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In fact, to compute v it is necessary to compute z ', which in turn depends on z .
Sentence 2: even with the introduction of the circularity, the computation of the .nal value depends on the computation of the second value computed by the mbuildp g c. When the consumer is also an effectful function, it is possible to state two other laws, similar to Laws 4.6 and 4.7, respectively, but that deal with fusion of effectful functions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this work, we propose an approach that exploits the properties of this class of codes in order to solve some of the problems related to crosstalk faults and to the synthesis of TSC functional units.
Sentence 2: we provide a weight selection strategy to .nd a code that is capable to detect the most likely bidirectional errors and all the unidirectional ones, while presenting a limited degradation of the code ef­.ciency with respect to the case of the mostly used error de­tecting codes for VLSI SC circuits.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: But all this goes through very smoothly, given what we already know.
Sentence 2: for Choice 1, i.e., for f :: [T1] .LT1 f (x :y ) =L (JUST (x,fy )) f [] =L NOTHING and thus t1 =[T1] and t2 = LT1, we clearly still want that p :: [T1] .MAYBE (T1, [T1]) and q :: LT1 .MAYBE (T1,LT1) are listpsi and unL, respectively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We present an extended semantics that models preemp­tion.
Sentence 2: our design models handling of interrupts with priorities in the Windows and Linux kernels ([15, 27, 25, 3, 24]) and borrows ideas for atomic handler execution from software transactions [10, 23, 5], a concurrency prim­itive for atomicity that disallows interleaved computation while ensuring fairness (we return to software transactions in the related works in Section 7).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Finally, rule Sub-Range enables variant subtyping: the parameterized ¯ type c behaves covariantly with respect to changes to the type values U ¯ and contravariantly for changes to the type values S¯.
Sentence 2: the type c is a supertype ¯ ¯ ¯¯ of c when the ranges S'-U' contain the respective ¯ ranges S¯ -U, as indicated by lower lower bounds ( S¯' <: S¯) and higher upper bounds ( ¯ U').
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (0, 1) it is a sketch with stretch f(E) and E-slack.
Sentence 2: instead of specify­ing E ahead of time (as in the slack constructions) we need a single sketch that works simultaneously for every E. It is easy to see that when f is O(log 1 ), gracefully degrading sketches provide the desired average and worst-case stretch bounds (this was implicit in Chan et al.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The technique we propose is based upon comparison checking [14, 15] which leverages the availability of two versions of the pro­gram, the sequential one and the parallelized one, to detect faults.
Sentence 2: the two versions are executed on the same input and the dynamic data dependences exercised by the two versions are compared to identify differences that result from introduction of data dependence faults.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our approach proposes to generate test inputs for a database program considering the full interaction between the tested database and the program.
Sentence 2: it o.ers a concep­tually clean modeling that generalizes the simpli.ed model of a program used in software testing, to account for the particularities of database programs: A database program computes the result of a mathe­matical function over the data it receives as input while it may perform at the same time frequent reads and writes into the independent database.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Related Works  Although our goal is to provide data integration solution in scientific workflows in (semi) automatic way, our approach attempts to solve a different problem than typical data-integration systems in scientific applications [1, 26, 20].
Sentence 2: we want to construct data transformations that can take valid data under one schema, and convert it to valid data under another schema, while these approaches focuses on combining source data expressed in heterogeneous local schema into an integrated view under a global schema.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: V represents a value greater than or equal to zero, we have -8  vk = vk and +8L vk = vk.If [ai,bi]=[-8, +8] (which means that the length of the array is unknown at the entry of this instruction), we have [ai  vk,bi L vk]=[vk,vk].
Sentence 2: after the execution of an arraylength instruction, we introduce a new symbolic value, vk,to the frame state to represent the length of this array if the length of this array is unknown before the execution of this instruction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The unique charac­teristics of this emerging application domain have led to a signi.cantly different design from the popular MapReduce­style batch data processing.
Sentence 2: we advocate a powerful new abstraction called resilient substitution that caters to the speci.c needs in this new computation model to handle failure recovery and dynamic recon.guration in re­sponse to load changes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: With a small tile size, the sequence of accessed memory banks in each tile will not affect the scheduling decision much since these bank accesses can be considered concurrent .
Sentence 2: as long as two tiles have the same memory bank to be accessed, scheduling these two tiles at the same logical time slot will hurt BLP since we have multiple accesses to the same memory bank around the same time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CALCULATION OF AVERAGE DETECTION TIME A.1 Average Detection Time with Constant Vehicle Speed We assume that a vehicle has a constant speed v (v = vm where vm is a maximum vehicle speed) and it enters the road on the basis of the uniform distribution for its arrival time within each period consisting of working period (W) and sleeping period (I), which is W +I.
Sentence 2: we focus on the average detection time for a vehicle with uniform-distributed arrival time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a class c and a set of observer-method calls OB = {ob1 , ob2 ,..., obn} of c, the observer abstraction technique con­structs an abstraction of c with respect to OB.
Sentence 2: a con­crete state cs is mapped to an abstract state as de.ned by n values OBR = {obr1 , obr2 ,..., obrn}, where each value obri represents the return value of method call obi invoked on cs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The basic version of the scheduler always sends the .rst ready rule operation, ac­cording to the preferred order (we discuss how this order is derived in the next section).
Sentence 2: each time the Queue Manager informs the Preferred order scheduler that (some) switches are ready, the scheduler goes through the sub-updates in the current order, inspects each sub-update and sends out any ready rule operations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The language for tuple template is as follows: C ::= $ALL | $NONE | cname | C , C | %(1) C ; C | $not C | D | { [ iname { , , iname } ] } |C ( D ) | ( C ) D ::= F | $exists F | %(2) $all F | M F ::= R in C | R : I | %(3) R : I | R : Msymb N |R : = string | R M ::= # R Msymb N %(4) R ::= rname | rname / vname %(5) Msymb ::= > | < | = | = | = %(6) By exploiting such a grammar it is possible to express any SHOIN(D) DL description with the possibility to insert vari­ables to specify which kinds of individuals one wants to ob­tain.
Sentence 2: figure 1 shows the mapping between the main constructs of SHOIN(D) DL and the constructs intro­duced by our grammar.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Introduction Writing correct concurrent programs is hard, because inconsistent results may be computed when two threads access shared data concurrently.
Sentence 2: a data race is said to occur when two threads concurrently access some data, where one of these ac­cesses is a write, and where no synchronization exists between the * This work has been supported in part by the Defense Advanced Research Projects Agency (DARPA) under contract No.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is important to note that it is possible to generate par­tial statechart models from partially re.ned models, as de­scribed in the following subsection.
Sentence 2: it is not necessary to de.ne the behavioral re.nement of the entire model in order to visualize the resulting statechart, which is consonant with the Twin Peaks notion of iteratively and incrementally re.ning requirements and architecture [14].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Speci.cation­based test generation improves the pitfalls of random testing by generating inputs that are guaranteed to satisfy certain well-formedness speci.cations [7, 9, 4, 11].
Sentence 2: there are test input generators that take as input a grammar (written, e.g., in yacc) describing valid inputs and generates test cases that satisfy the grammar [7, 15, 13].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: At the transmitter, a turbo code word is .rst fed to a bit-wise inter­leaver, and then transmitted across multiple fading blocks with coherence time T. The length-L interleaved codeword v is divided into several length-n vectors, and used to label the transmitted USTM signal matrices.
Sentence 2: a turbo codeword is transmitted across multiple coherence in­tervals.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Duetothelimitedrange ofits wireless communication, every PDA-equipped automobile depends on information received from other vehicles moving ahead which are yet found within range.
Sentence 2: a vehicle receives from anyone moving ahead estimations on how fast thetransmittercanreach speci.c regionsoftheroad network and what the transmitting vehicle experienced in its most recent movement.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By applying the idea of the virtual blocking time in Algorithm OSS, the enhanced algorithm, denoted as Algorithm VOSS, per­forms on-line simulated scheduling at time instant t by taking ri,t +Zi as the arrival time of the next arrival job of task ti, where ri,t is the arrival time of the next job of ti arrived after time in­stant t and Zi is no more than the virtual blocking time in Al­gorithm V-RM.
Sentence 2: the .rst step in Algorithm 1 is revised to lm ri,t .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: pj pj If the bucket contains = 2 logN(i) = 2 logn co­ordinates, then coordinate y incurs a violation with pj logn probability = q 2 .
Sentence 2: (a violation may happens when at most all the O(log n) coordi­nates of the elements in bucket j are >y1, that is, when yj * >y1.)
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Suppose now that I. is split into two sub-nodes: I.a and I.b .
Sentence 2: we call this split satisfactory if all of the following three conditions are satis.ed after the split: No dependency goes from any I., .GI to I.b .all the original in-coming dependencies of I. are directed to I.a .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.1 Dynamic Pro.le Generation In this phase, we instrument runtime executions of the binary executable under analysis to capture a sequence of system-level actions for dynamic loading of components.
Sentence 2: we collect three types of information during the instrumented program execu­tion: system calls invoked for dynamic loading, image loading, and process and thread identi.ers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: JML syntax is intentionally similar to that of Java so that it is less intimidating for develop­ers.
Sentence 2: the mathematical types that are heavily used in other model based speci.cation languages (sets, se­quences, relations and functions) are provided in JML as classes, and the operations on those types are speci.ed (in JML) and implemented as Java methods.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, if we look at the worst case for unroll factor 4 and compare it to the best case for the other unroll factors we .nd a ratio of no more than 1.0065.
Sentence 2: if we chose factor 4 as the best factor, we could be fairly con.dent that if we are wrong it would be by not much more than 0.65%.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.2 Language Design Moving from hardware-oriented issues, let us now discuss the design and organization of the RCXLisp language itself.
Sentence 2: rCXLisp lets one remotely control the RCX from a Common Lisp program running on a desktop computer,  write RCXLisp programs to run on the RCX,  create and compile RCXLisp programs for downloading to RCXs on the fly, from within Common Lisp desktop environments,  simultaneously control more than one RCX from a single MindStorms infrared transceiver tower  set up a network of RCX units that can communicate with each other in a targeted manner (as opposed to the broadcast manner supported by LEGO s kit).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While this is a fairly simple policy, it is still not easy to de­termine whether the current policy is safe (i.e., prevents a sub­ject from obtaining an unauthorized right).
Sentence 2: the web server (httpd_t) and administrator (admin_t) read and write data from a variety of less trusted subjects, such as the user (users_t) and user scripts (user_script_t).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Yet Freese, Rivas, and Hargittai do not attribute this all to age, as they found that for older adults cognitive resources may be presently more strongly associated than socioeconomic factors with finding Internet use enjoyable or rewarding [2006 p. 244].
Sentence 2: they found correlations between usage and education but, when they analyzed the data, they propose that education is just reflecting other antecedents such as cognitive ability and consequences like occupation for older adults; therefore, age alone is not as great an issue [Freese et al.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: GHC reports: mdef.hs:3: Couldn t match Char against Bool Expected type: Char Inferred type: Bool In the definition of f : f x y z = if z then x else y What s confusing here is that GHC combines type information from a number of clauses in a non-obvious way.
Sentence 2: in a more complex program, it may not be clear at all where the Char and Bool types it complains about come from.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In fact, by invoking observers after a pop() operation we would discover a part of the hidden state of the component, which is different for the two objects.
Sentence 2: pop() is a discriminating operation for the state denoted by {size() = 2, top() = a, isEmpty() = false}; that is, after the application of pop() it is possible to verify if two objects that previously exposed the same ob­server return values are indeed behaviorally equivalent.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We de.ne bx to be of size 2n, where the .rst n variables determine whether a statement will be computed on the CPU and the last n variables determine whether a state­ ment will be computed on the GPU.
Sentence 2: bx = [x1 x2 ... x2n] , and exactly one of xi and xi+n is 1, where bbeq bxc 1=i=n.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If the requests in the DRAM controller buffers (which we call DRAM request buffers) are not to different banks, the amount of BLP achieved will be very low, thereby reducing the effectiveness of such techniques.
Sentence 2: while a carefully-selected tile size can improve cache perfor­mance, its impact on bank-level parallelism is not clear.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If average slack size is too small and, thus, overhead of writing data to scattered slacks is too high, the SSR scheme may not be a good choice except when .le system utiliza­tion is very high.
Sentence 2: when slack space is highly fragmented and the size of each slack is too small, cleaning would be more e.cient than Slack Space Recycling.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In an interleaved execution, a sequence of calls to Atomic.assert(obj,pred) indicates that there must exist some serial execution a linearization of the interleaved execution in which each corresponding call Atomic.assert(obj ,pred) is such that pred.apply(obj,obj ) returns true.
Sentence 2: suppose the n th call to Atomic.assert(obj,pred) in an interleaved execution records the serialized value of object obj.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Java 2000 San Francisco CA USA Copyright ACM 2000 1-58113-288-3/00/'6...$5.00 between two equivalent download sites must assume that the conditions that have been observed will persist until the download is complete.
Sentence 2: the user uses the current conditions as a prediction of what the conditions will be a short time into the future.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Also, no name is assigned twice in the same substitution.
Sentence 2: an ex­plicit substitution is a function from the set of names to the set of terms T : N .Terms We treat the substitutions in our calculus as providing assignments for all the names; some names are assigned speci.c terms, and some names are simply unchanged by the substitution.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.1.2 A Greedy Algorithm The main idea of the greedy algorithm is to divide the memoryinto small units d andincrementally allocate d amount of memory to the process which can bene.t the most from this memory at each step.
Sentence 2: the process that receives this d memory is the one with the highest gradient of the utility function at its current memory allocation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As future work, we plan to consider language extensions that could simplify the de.nition of specializable operations.
Sentence 2: abstraction over type classes (similar to the pro­posal by Hughes [17] that was used by L ¨and Peyton ammel Jones [23]) could help eliminate the boilerplate of reifying type classes as explicit dictionaries.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: At meet points in the control .ow, and if the analysis is in non-abstraction mode, the path formulas of the two branches are combined via disjunction (resulting in a disjunctive path formula).
Sentence 2: as long as the analysis operates in non-abstraction mode, a disjunctive path formula is constructed that represents all program operations since the last abstraction formula was computed in abstraction mode.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The PERC Pico verifier enforces that the body of this constructor does nothing with its implicit this argument that would violate the expectation that the constructed object may have a temporary lifetime.
Sentence 2: the verifier forbids the constructor from saving the value of this in any static variables or in any instance fields associated with objects that cannot be proven to have a shorter lifetime than the constructed objects itself.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If vj ./RetPt,the Propagate function is called, which simply pushes triples backwards through all prede­cessors of vj , identifying new correct transitions and new triples.
Sentence 2: for each predecessor vi of vj ,if (.g,.i) .PE(vi)and .j .d(vi)(.i), then the transi­tion (vi,.i) r (vj,.j ) is added to T and a new triple (vi,.g,.i) is added to W. T and W are accumulated in M and WL1, respectively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Fact 1 follows directly from the fact that transi­tions are deterministic, processes cannot access the local state of another process, arguments to both methods are the same, and the starting global states are the same.
Sentence 2: from Fact 1 and hs(pbase1 ), hs(pbase2 ) being complete sequen­tial histories, we can show that Glast(pbase1 ) = Glast(pbase2 ).from first(pbase1 )= first(pbase2 ) (both are initial states), we can inductively show that any complete sequential invocation preserves the fact that the global state in the last states of the two executions are the same.
Relationship: entailment