sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: (3): L .i aint (i) hss = = (7) a¯aux .i aaux(i) Our de.nition of hss deviates from convention because we refer­ence it to power consumed by the HVAC rather than cooling energy produced by the HVAC (which we do not measure).
Sentence 2: our co­ef.cient accounts for (1) the thermal resistance of the building shell material, (2) the building shell area, and (3) the COP of the air con­ditioner.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In effect, each column contains the probability that a programmer Figure 2: Link topology (adjacency) matrix T  will follow a link from one location to another.
Sentence 2: at the end of step 4, the proximal scent relative to the bug report has been calculated, reflecting the information foraging premise that links in the source with proximal cues close to the important words in the bug report will smell more strongly of the bug, and are thus more likely to be followed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In particular, the order in which a point visits nodes in its traversal is unchanged, as is the order in which a given tree node is visited by different points.
Sentence 2: traversal splicing can be performed in the presence of intra­traversal dependences (e.g., if some data associated with the point is updated at each leaf node of the point s traversal) or dependences that cross traversals but stay within the same node (e.g., if a counter at each node is updated whenever a point visits the node).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, Java rejects the type SubList,?> even though the wildcard can be implicitly constrained to be a supertype of Integer with which the requirements of the type parameters are satis.ed (in our technical report we formalize when a wildcard can be implicitly constrained [15]).
Sentence 2: java s implicit-constraint inference is incomplete and as a consequence types that could be valid are nonetheless rejected by Java.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The second heuristic, referred to as best noise , assume the bug occurs when a sequence of concurrent events accesses a specific shared variable in a specific order.
Sentence 2: we thus assume that there is one good event, while the number of bad events is proportional to the program size (n), and this proportion is determined by a parameter c. at each 1 1 +cn execution we choose each event with probability: p = ,the optimal probability given by the model.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, in many cases the .nal output does not depend on the keys being sorted, instead just requiring that intermediate values be grouped by their key.
Sentence 2: we allow programmers to anno­tate that sorting is not required for correctness of the pro­gram, allowing MrCrypt to choose deterministic encryption for the keys (which preserves equality, necessary for group­ing values by key) rather than order-preserving encryption.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: That is, in these cases WISE .nds worst-case generators that prune away the entire search space except for a single worst­case execution path.
Sentence 2: wISE s guided test generation is very ef.cient, producing worst-case executions for input sizes of up to 30 (and beyond) in only a few seconds and with a small number of constraint solver calls.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Also, ARIMA performs signi.cantly better without smoothing the time series (p-value< 0.01) but, again, the e.ect size is small (d=0.10).
Sentence 2: di.erently from other applications, where smoothing turned out to be useful for time series forecasting [12], it is not the case here.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Figure 8: Search space size with register remapping, copy propagation compared to default (512 registers)  6.3 Combining Register Remapping and Copy Propagation Interestingly, combining our two techniques is able to further reduce false register dependences and the size of the phase order search spaces.
Sentence 2: as shown in Figure 8, implicitly applying both register remapping and copy propagation after every phase reduces the size of the phase order search spaces by over 43.8%, on aver­age, while marginally improving the best average performance by 0.57%.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The notion of a software component underlying this work arises from a widespread paradigm for formally approaching systems, design: the so-called model oriented speci.cation method, of which VDM [22] and Z [34] are well known representations.
Sentence 2: software components are regard as state-based abstract machines which persist and evolve in time, according to a behavioural model captur­ing, for example, partiality or (di.erent degrees of) non de­terminism.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In terms of broker load, Renewal Wait has very little e.ect, since the Payword 120 1.5 100 80 1   Processing Cost (Hz) Storage (# proofs) 60 40 Processing Cost (Hz) 0.5 20 0 0 Renewal Wait (w) Renewal Wait (w) Credit Window (x) Figure 4: Peer load decreases as Figure 5: Peer storage (aver-Figure 6: Soft credit windows renewal period increases age number of proofs stored over have better broker load by ac­time) increases as renewal period counting for symmetric peer rela­ increases number of coins printed due to payment is far higher than the number of coins printed due to expired coins.
Sentence 2: since broker load is una.ected and peer load is scalable, we recommend a relatively low Renewal Wait,such as 10 days in our application scenario.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The union of Ei is not necessarily equal to E, because some copy edges might not be included in any Ei if their somcce and target ELRs in~ere or their inclusion causes an unde- termined iteration difference.
Sentence 2: the set of copies is divided into two disjoint subsets: those inside some ELRs (Ci,) and those outside (Cost).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, the speci.cation of 3D components with so­phisticated behaviours and complex inner structures can become a tedious an error-prone work, since support for this task primar­ily exists on code level.
Sentence 2: we present SSIML/Components, a visual language for the abstract pre-implementation speci.cation of 3D components.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Importantly, this change must extend to datatype speci.cations as well as datatype declarations.
Sentence 2: a structure that exports a datatype must export its implementation transparently, using a sig­nature similar to the one in the .gure otherwise a datatype inside a structure would appear to be generative outside that structure, and there would be little point to the new interpretation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Application The results of the previous section suggest that the EDFPTIDES scheduler is generally superior and the added complexity is not a seriousfactor, at least for our chosen hardware.
Sentence 2: we use the EDFPTIDES scheduler in this section to implement theJAvi­ator control, and we will compare it with non-PTIDES schedulers on the same application.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4 5 4 3 3 2 2 11 In the 03/01 dataset, when we query for outliers, most non-outliers are identi.ed after the .rst round of histogram collection, and the number of potential outliers is limited.
Sentence 2: the cost of histogram collection is thedominantfactor compared with the raw data transfer.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Therefore, for the whole program P composed of the two functions top and locate,there are 3n-1 possible execution paths: n executions terminate after the then branch of line 14, n executions terminate after the then branch of line 15, and n -1 executions terminate in line 16.
Sentence 2: the number of feasible paths in P is (roughly) the product of the number of paths in its functions locate and top.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This is also due to the fact that today there are few effective techniques for measuring testability and for improving the testability of large and complex software systems.
Sentence 2: it is important to find engineering principles that will help architects in building product line architectures with high testability and hence enable easy and cost-effective testing of the reusable product line components as well as of the product line members.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In our two-pass elimination approach, algorithm PreElim is less complex and runs faster than the hybrid algorithm, because it reduces the time complexity of the inter-event constraint check from O(|s[E(k-1)]|)to O(1).
Sentence 2: the performance of two-pass elimination algorithm is signif­icantly better than the hybrid algorithm when the number of episodes is very large and the number of episodes culled in the .rst pass is also large as shown by our experimental results described next.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Effective Fusion and Separation of Distribution, Fault-Tolerance, and Energy-Ef.ciency Concerns Young-Woo Kwon Software Innovations Lab, Virginia Tech ywkwon@cs.vt.edu Abstract As modern software applications are becoming increasingly dis­tributed and mobile, their design and implementation are character­ized by distributed software architectures, possibility of faults, and the need for energy awareness.
Sentence 2: software developers should be able to simultaneously reason about and handle the concerns of distribution, fault-tolerance, and energy ef.ciency.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A view has no idea what the type variables a and b may be instantiated with.
Sentence 2: the controller could contain code of theform case View.abortable (vd, 50000, fn (ab, ca) => Model.computation(ab, ca, md, input)) of (vd, md, NONE) => (* abortion occured *) ... | (vd, md, SOME v) => (* v is the computation s output *) ...  in which the controller starts the model s computation, but lets it be periodically (every 50,000 steps, in this case) monitored and potentiallyabortedby the view.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Due to the state explosion problem and the resulting limitation of the state space, a model checker cannot take into account the internal state of the involved components and services.
Sentence 2: it could happen that, although the model checker returns a certain sequence of architectural recon.g­urations steps in order to prove the reachability of a given con.guration, this sequence is not feasible according to the speci.c requirements of the actual application.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A sections directive takes the form: //omp sections [nowait] { /lomp section  [//omp section ]... }  The sections are allocated to threads in the order specified, on a first-come-first-served basis.
Sentence 2: code in one section may safely wait (but not necessarily busy-wait) for some condition which is caused by a previous section without fear of deadlock.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In organizing this paper, we have faced the task of linearizing a two-dimensional matrix of principles and structures into a one­dimensional narrative.
Sentence 2: after giving some background, the paper delves into the principles to which we aspire, then explores each subsystem, calling out the connections to said principles, explains what is actually working at this time, compares this sys­tem to others, and finally concludes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In fact there is an opportunity cost in cooperating with it: missing out on a sustained relationship with another slow peer.
Sentence 2: in order to account for this fact, we modify the payoff structure of the BitTorrent Dilemma according to Figure 1(c) so that the dom­inant strategy of both slow and fast peers is to defect against each other.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Here, the returned expressions must not only be assignment compatible with the declared (type and) static multiplicity of the method, but also no collections representing any multiplicities must be returned (since this would create aliases).
Sentence 2: if the method m has declared multiplicity any(C) and type T, and if e has multiplicity option, bare, or null, return e is translated to {C l = new C(); if (e != null) l.add(e); return l;} Else, if e has multiplicity any, return e is translated to {return new C(e);} For instance, the return statement return new POP3(); in line 47 of Figure 2, right, translates to {ArrayList l = new ArrayList(); POP3 n = new POP3(); if (n != null) l.add(n); return l;} where n caches the new instance of POP3.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Weneedtobealittlecarefulabouttherepresentationof aset;ofassumptions,describedinSection4.Ahashtable mightappearasuitablerepresentationforthis,butitisnot thecase.RecallthatinRec,wehavethepremisesA<:::: or<::::.
Sentence 2: "Forimplementingthis,whenthefrstpremise A0 fails,whatwehavetopasstothesecondpremiseistheorig­inalsetofassumptions,notwhatthefrstpremisewould returnasanoutputsetofassumptions,"whichmaycon­tainwrongassumptions.ifweusedahashtable for;,wewouldhavetocopythewholehashtableevery  0fail 1 !
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Results of Defect Type Distributions   The error values are also fluctuated, but the proposed model yields PRED(30) of 67% in requirement analysis phase, PRED(30) of 67% in design phase, PRED(30) of 83% in coding phase and PRED(30) of 83% in testing phase.
Sentence 2: the proposed model yields overall PRED(30) of 75% for all phases and all defect types on average.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When working at the level of atomic blocks, the programmer should only be aware that the blocks run atomically and in isolation: the programmer should not see implementation details such as exactly how atomic blocks are built over TM, or the internal algorithms used by a given TM implementation.
Sentence 2: when a breakpoint .res in an atomic block, the interrupted thread will be the only one in any atomic block.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Range compres­sion encodes each type bas an integer ibda, with its ordinal in a postorder scan of a certain spanning forest of the hierarchy.
Sentence 2: then, the set ibb(b{uof ibd s of the descendants of b, ibb(b{ue=={/ibdtteacEdae,sdc,e n d aanIt s{b(b{u(11) is represented by an array of consecutive disjoint intervals raa@e dra@ ]/raa@2{ra@2]{b b,b, {raa@kab(b{uc dra@kab(b{u]b eah-bpiff paa@iibdra@i (12) holds for some i, ikab(b{u.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, if we want to call the method add for an object of class DoubleList, then we shall .nd the method body in class List and will need to convert the context parameters of class List into context parameters of class DoubleList.
Sentence 2: we look up though MBDoubleList(add), giving {owner .o,data .d1}as its third component.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Bottom: for the test period with RMSE = 0.091 and R2 = 0.948. we also wanted to characterize the in.uence of uncertainty in the output of the model, the zone temperature, on the accuracy of the model.
Sentence 2: in addition to the 9 aforementioned model inputs, perturbations were also introduced in the output training data-set i.e., in Tz.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Theorem 1 Two channels a and b can share buffers if, .p, at most one of d(p,a)and d(p,b)is de.ned, but not both.
Sentence 2: pRO OF Suppose a and b can rendezvous at the same time and if p1 represents the state of the program counter just before the rendezvous, then by Lemma 4 we have two out­going arcs from p1: d(p1,a)=q1 and d(p1,b)=q2 for some p, both d(p,a) and d(p,b) ex­ists.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The real-time task scheduler must be aware of the RTGC so that each execution of the RTGC performs enough work to ensure availablity safety.
Sentence 2: adding garbage collec- tion to real-time systems introduces new facets to the schedulability tests that must be em- ployed: the time taken by the GC itself must be accounted for and proof must be provided that memory will be available when needed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: So, this research starts from requirements specified in RSL-IL, and not in natural language, because the challenges to produce RSL-IL specifications from natural language specifications were already discussed and proposed [6,7,10].
Sentence 2: the main contribute of this research is to propose and discuss that, with proper tool support, we can increase the overall quality of SRSs as well as the productivity associated to documentation and validation tasks.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Therefore, the post-copy adaptive scheme experienc­ing many page faults performs like a full-bandwidth post copy scheme, whereas it performs like the guide-copy adap­tive scheme s lightweight background copy for infrequent page faults using 10% of network bandwidth.
Sentence 2: both adaptive schemes provide more silent mi­grations than their baseline schemes at the cost of decreasing page fault prediction accuracy.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The above examples would require existing MD simulations to be modi.ed signi.cantly in order to utilise particular simulation packages or to execute it on a Hadoop cluster, due to ne­cessity of using provided Application Programming Interfaces (API) and programming libraries.
Sentence 2: porting the existing simulations that run on the HPC cluster to the cloud would be a challenging task.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A bu.ermap, for example, is a set of chunk IDs encoded nor­mally as a bitmap, just as a chunk request is usually a set with only one element.
Sentence 2: gRAPES provides a Chunk ID Set datatype that can be used for storing the IDs of the chunks owned (or needed, or o.ered, or accepted, ..., depending on the required semantics)by apeer.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (p), L(p, x) and M(p) are translated by applying rule p.1~p.3; and, o (ii) for all t in T such that, R(t) is translated by applying rule t.1~t.4.
Sentence 2: the process N( ) covers all syntactic and static semantics definitions of a net entity N. Lemma 3.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Recall that f.PB is the position-independent byte­representation of a function f. The functions were clustered into equivalence classes induced by the re.exive-transitive closure of the following relation R: f1Rf2 .. f1.N ame = f2.N ame .
Sentence 2: f1.PB = f2.PB we assume that if f1Rf2,then f1 and f2 are provenance-similar.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Note that an alternative solution to the careful software approach could be if the hardware provided the right capa­bility to invalidate TLBs on multiple CPU cores, such as special instructions for altering TLB contents on a set of CPU cores.
Sentence 2: although we do provide an OS level so­lution in this paper, we would encourage hardware vendors to put a stronger focus on TLB invalidation methods for many-core CPUs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Edges whose tails originate from a rectangle indicate that the oval at the head represents the step that generated the artifact.
Sentence 2: note that Figure 5 documents that Add to Dataset produces an artifact, annotated P , by taking as inputs two artifacts, each the output of a different model (a DDG documenting the application and consideration of more than two models would be analogous).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thisisbecause ||(n,0) - Xv|| = 1 (n is the 2 1 ( closest integer to x(v)) and ||(n,0) - || = Xn is the Xn2 closest node to (n,0)).
Sentence 2: t0,n - T( Xn,Xv) = T(Xu,Xv) = T0,n + T( Xn,Xv)sothat - T( )) Xn,Xv) T0,n Xn,XvT(Xu,XvT0,n + T( == .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This may be unnecessary, since many policy analysis prob­lems require computing only a few authorizations or resolving only a few names.
Sentence 2: we use specialized extended Datalog rules for the specialized analysis problems; these specialized rules can be used to generate an ef.cient algorithm for each analysis prob­lem, and infer only the authorizations and resolve only the names needed for that problem.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Importantly, socket locking happens on the sock data structure directly, and does not invoke a protocol-speci.c function pointer; for example, the networking code often grabs the sock lock, calls a protocol-speci.c function pointer, and then releases the lock.
Sentence 2: changing the locking policy on sock objects would require changing the locking policy throughout the entire Linux network stack.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: RMI-QoS is designed to be more .exible than current RMI and will provide con.gurable quality of service to method invocations made to real-time remote objects while main­taining current service to remote ob jects.
Sentence 2: there will be three types of transactions according to their QoS guar­antees and the real-time characteristics of the remote ob ject: Transactions without QoS guarantees to non real-time remote objects.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In our previous evaluations discussed in Section 3.1, we found that in Moodle and Apache Roller, the vast majority of code annotations occurred within the same function or file as the security-sensitive operation.
Sentence 2: we will also explore providing a short list of potential Boolean statements, or highlighting Boolean statements in the function or file to allow developers to more quickly spot the relevant code and make the annotation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since the q.A.D accounted quanta are those for which uq =dLpq,wehave T1 = uq q.A.D = uq q.A = dLpq q.A = dL |A|PA .
Sentence 2: the total number of accounted quanta is at most |A|=T1/dLPA.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Indeed, as the scope is increased, bounded veri.ca­tion is able to .nd errors that were not detectable at smaller scopes, and bounded test generation is able to produce more interesting and complex tests (or test inputs) whose genera­tion was infeasible with smaller scopes.
Sentence 2: incrementing the scope in bounded exhaustive analyses has desirable ef­fects on bug .nding, test generation and coverage.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: S.St A.At We observe that for any A .At we have c(A, S)=1 for at least one S .St because of the impossibility of determin­istic wait-free implementations for TAS.
Sentence 2: by choosing Dt to be the uniform distribution over St, we obtain that for any A .At, E[c(A, Dt)] = 1/|St|.
Relationship: reasoning