sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: However, this is unlikely to give much bene.t and will signi.cantly complicate the context-switch in the operating system.
Sentence 2: for each taskit is su.cient to traverse all blocks of its code, and add to its context all registers which are live in that blockand can be destroyed by any taskthat can preempt it (i.e.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: From the subject reduction theorem, we know that a(E ' [fork e]) A.From Lemma 1, we know that  ' '' a(E [fork e]) = a(fork e); a(E [0]) = A; a(E [0]).
Sentence 2: we must have a(E ' [0]) L. Therefore P2 .Li and we have a contradiction.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: On the other hand, with BeneFactor, after Grace changes refer­ences of event to intEvent, BeneFactor detects that she is renam­ing a local variable.
Sentence 2: it places a quick .x refactoring op­tion on the problem markers at the lines where Grace did name changes, as illustratedin Figure1, suggesting that she allowBene-Factor to .nish this rename refactoring automatically.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Applying the technique once means building the PCG using the algorithm of Section 3, and sharpening data-.ow abstrac­tions using the algorithm of Section 4.
Sentence 2: the SR phase aims to unfetter a maximal set of opportunities in opts on srefs.16 6.1.2 Enabled and Baseline Executables Just prior to the SR phase, opts on srefs is repeatedly applied until the IR reaches quiescence.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In our case, this process is performed by a combination of the QuickCheck tool execution itself, according to the previous work.ow, and an adapter that invokes the real SUT transforming the spe­ci.c values that QuickCheck generates using the data gen­erators into a data format that the real SUT understands, also transforming the SUT return values into QuickCheck format again for test evaluation.
Sentence 2: quickCheck not only automatically generates a large amount of speci.c test cases with randomized input val­ues from the properties.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Without returning from a function, a nested function can manipulate its caller s local variables (or local variables of its indirect callers) by indirectly calling a nested function of its (indirect) caller.
Sentence 2: many high-level services with stack walk (such as check-pointing and copying GC) can be easily and elegantly implemented by using LW-SC as an intermediate language.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We distinguish between such simple, short actions (instanta­neous in the particular sense that they are completed within the execution of a step of the automaton) and long actions (asynchronous), as can be done classically with synchronous models [3].
Sentence 2: when the automaton receives ml, it emits la and goes to S2 representing the processing of the action la.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In addition, CoBaSA was designed before we had access to any of the Boeing models, and as will be ap­parent in later sections, there is nothing in CoBaSA that is specialized to the avionics domain.
Sentence 2: we expect CoBaSA to be widely applicable, e.g., during our work with Boeing, CoBaSA was able to easily handle what Boeing de­scribed as serious architecture changes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The main reasons for this similarity across threads are: (1) program­mers tend to write one piece of code and increase the number of threads that execute the same code (2) programmers tend to do static load balancing between threads to utilize all cores.
Sentence 2: though we might not be able to predict how long each thread will execute, we can easily predict which thread within a thread group (explained in section 3.2) is lagging behind, because all threads in the same group tend to have similar execution lengths.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (S2|S3,S1), (S2,S3|S1), (S2|S3|S1), (S2,S3,S1), where | represents a fusion partition or, in other words, it implies that statements on either side belong to different loop nests.
Sentence 2: a total of 24 different fusion partitionings are possible for only 3 statements considered.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For tasks in this example, slack reclamation algorithms are unable to reclaim slack at the completion of the second taskinstance of task t1, since there is no task instance which is ready to reclaim it.
Sentence 2: in order to reduce the energy consumed by task execution more effectively, the information of the execution patterns of multiframe tasksshouldbetakenintoconsideration carefully.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: {0, 1}can model each node s ability to sense whether it is in or out of a region over time (e.g., at time t .T anode v .V for which sA(v, t)=1 and sB (v, t) = 0 is inside region A and outside region B).
Sentence 2: although the monitored regions are dynamic, with changes monitored by nodes sensors, we assume the sensors nodes themselves are immobile.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For handling large datasets, the available address space of a 32-bit framework, however, would be too restrictive which is why we took the algorithm module of Viracocha, compiled it as a 64-bit library version, and invoked the parallelized critical point computation from within a test suite.
Sentence 2: the MPI layer of Viracocha was not available so that only OpenMP could be considered.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Moreover, as we shall show, nominal ab­stract syntax can be implemented directly in Haskell using type classes, and the de.nitions of nameplate functions such as capture­avoiding substitution and free variables can be generated automat­ically for user-de.ned types.
Sentence 2: nominal abstract syntax and generic programming techniques can be fruitfully combined to pro­vide much of the convenience of higher-order abstract syntax with­out sacri.cing the expressiveness of .rst-order abstract syntax and without any language extensions beyond those needed already for generic programming in Haskell.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As outlined in the following, it is much more ef.cient to choose the architectural level to determine the relevant events than the op­erating system or hardware level.
Sentence 2: we propose in this paper to exploit the high-level abstractions available at the archi­tectural model to achieve the deterministic replay for hard real-time systems with only minimal run-time overhead and without the need for additional hardware.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Instead of explicitly reasoning about divergence or strictness in the re.nement logic, which leads to signi.cant theoretical and practical problems, as discussed in §8, we choose to reason implicitly about divergence within the type system.
Sentence 2: the second critical step in our path to .D is the strati.cation of types into those inhabited by potentially diverging terms, terms that only reduce to values, and terms which reduce to .nite values.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If there exists an inter-iteration de­pendence between u and v, then the execution of statement v initeration i+ w(u,v) reads the resultsgeneratedby u in iterationi.
Sentence 2: the earliestiterationin which v canbe exe­cutedis w(u, v) iterationslater than theiterationin which u is executed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 2.1 GenArch Extensible Infrastructure In order to enable variability management and automatic product derivation of complex SPL architectures, such as MAS-PLs, we considered necessary to extend the GenArch infrastructure [2].
Sentence 2: we develop a new extensible infrastructure whose purpose is to allow SPL engineers customize the tool through the addition of new DSAMs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: All the semi-join attribute values appear in R with frequencies less than NB reducers: Following the same demonstration method used for the mappers, we divide R into NB reducers relations: R1,R2,...,RNB reducers such that the frequency of each semi­join value v is exactly equal to 1.
Sentence 2: the receiving and local histograms records merging costs on each reducer re­ lated to each partition Ri is at most: NB mappers ` ´ i i *|GHist(Ri)|* mp + ||GHist(Ri)|| * (t+ t) , r h NB reducers NB mappers ` ´ « i i *|Ri|* mp + ||Ri|| * (t+ t) .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When a cold counter is maintained, it should be incremented on a poi­soned path rather than the counter indicated by the path reg­ister.
Sentence 2: logically, the instrumentation at the end of a path looks like: if r < 0 // if path register poisoned cold_counter++ else count[r]++ This potential branching at the end of each acyclic path can increase the runtime penalty of the instrumentation code.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although this rep­resentation looks more intuitive, it can be very di.cult to correctly and directly represent a property into a B¨uchi au­tomaton.
Sentence 2: in order to overcome this problem and to provide PSC with a formal semantics, we propose an al­gorithm, called Psc2Ba to translate PSC speci.cations into B¨uchi automata.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We enforce this by allocating a fresh location l ' initialized with the contents of l, and then binding l to err to forbid access through l. The remainder of our semantics (not shown) is strict in err, and any computation that goes wrong re­duces to err (rather than becoming stuck).
Sentence 2: any program that tries to read or write l within e2 will reduce to err.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Be­sides, as we handle components and aspects with the same formalisms, it is also possible to develop aspects incremen­tally as if they were components themselves.
Sentence 2: for ex­ample, it is very easy to evolve from CSMA to CSMA/CD synchronization by developing the aspect that encapsulates the synchronization concern; on the contrary, doing so over the original components would be unfeasible, because it im­plies complex modi.cations in every component, requiring a deep understanding of what they do (de.cient separation of concerns).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Indeed, we agree with the de­velopers of VMKit who believe that using OSR would enable them to speculate and develop runtime optimizations that can improve the performance of their VMs5.
Sentence 2: given the value of and need for OSR and the wide-spread adoption of LLVM in both industry and academia, our paper aims to .ll this important void and provide an approach and modular implementation of OSR for LLVM.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Language Coordinates Dimensions Layout ANI M A LSCR I P T, ANI M A LSCR I P T 2 absolute, relative to a location 2.5 by hand DsCats n/a 2 automatic JAWAA absolute 2 by hand Matrix ASCII n/a 2 automatic SALSA n/a 2 automatic Samba absolute 2.5 n/a SVG absolute, relative 2 n/a ANI M A L SC RI P Ts support depth to control how overlapping objectsare drawn on the screen.
Sentence 2: samba supports a similar feature by al­lowing objects to be moved backward and forward from the viewer.the dimension is 2.5 in the evaluation of these two languages.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 8d(e)(S1, P 2)- d82 + 8d - d(m)82 + 2(d(e)(S1, P 2)- d)· (d - d(m)).
Sentence 2: we obtain 2(d(e)(S1, P 2)- d)· (d(m)- d)?
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.2 KMA: A two-layer memory allocator We designed our allocator to address two main objectives: support generic, fully-.exible memory allocation and pro­vide ready-to-use management of dynamic data structures (see Section 3).
Sentence 2: kMA has two layers: a low-level tra­ditional memory allocator and a high-level, customized layer 4 These are the SDKs we have used in this work.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 5.3.3 Observations on Work.ow, Success, and Effort The participant s work.ow was substantially di.erent than that of the Case Study 1 participant, because he intended to formulate a speci.c action plan for enacting a change to the system.
Sentence 2: he spent a considerable amount of time attempting to understand how existing code func­tioned, rather than simply tracing dependency connections.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As in [28], the power consumption during this transition period is the same as that in the power-on state.
Sentence 2: the total link energy consumption Elink can be estimated using the expression: PN Elink =(Pon ·Toni +Poff ·Toffi +ni·EP ), where Toni and i=1Toffi are, respectively, the lengths of total power-on and power-off time periods for link i, ni is the number of times link i has been re­activated, and N is the total number of links in the mesh network.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For now, it suf.ces to know that the signature of function check alone guar­antees correctness of the types of the instance objects passed as parameters.4 Thegenerationstep usesre.ectiontoproduceajob equivalent tothe one createdinthe original mainprogram, and also performs atype checkinternally.
Sentence 2: in a realprogram, one could omit the two checks above and the four long lines with generic type declarations, and instead pass the objects directly to function configureTypeSafeJob.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: First, due to the sheer number of parameters of the underlying optimization problem, each of these heuristics makes different assumptions on the topology of the task graph and the data center respectively.
Sentence 2: their performance can vary signi.cantly in practice and there is no single heuristic that performs best in all situations (Braun [1999], Munir [2008]).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Macros inlined after renaming However, the intention of the programmer is likely different: if he did not want the macro calls in the code, he would not have put them there in the .rst place.
Sentence 2: if possible, it is better to change the macro substitution arguments and the macro de.nition to .t the changes in the syntactical structure, as seen in Listing 39.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Doctoral Symposium of the European Conference on Software Architecture 2010 Eila Ovaska VTT Technical Research Centre of Finland, Kaitoväylä 1 90570, Oulu, Finland Telephone: +358 20 722 111 eila.ovaska@vtt.fi ABSTRACT The goal of the Doctoral Symposium is to provide PhD students working in the area of software architecture the opportunity to present their research and to receive immediate and expert feedback for the successful completion of their dissertation research.
Sentence 2: the ECSA 2010 Doctoral Symposium enables participants to sustain and discuss their ideas, methods, and preliminary results with senior researchers of the software architecture community in a constructive, friendly, and professional context.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A reliability-driven instruction scheduleron the other side would not only balance the spatial and temporalvulnerabilities, but also account for crucial instructions to improve the software reliability, though it may incur a performance loss.
Sentence 2: given a user-provided performance overhead, a reliabil­ity-driven instruction scheduler needs to optimize the software reliability which is a complex function of spatial and temporalvulnerabilities of different instructions w.r.t.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: From the figure, we can see there are more ctx instructions in thread 1 than in thread 2, and there are more ctx instructions in thread 2 than in thread 3.
Sentence 2: thread 2 is more frequently interrupted than thread 1 when they are both enabled; and thread 3 is more frequently interrupted when either thread 1 or thread 2 (or both) is enabled.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The key observation is that in the protocol of Figure 5­11 in [6], if a nonfaulty process j participates in rounds r and r ' (and hence, in our setting, it participles in the SCC protocol with session identi.ers r and r ' ), and r<r ' , then it must be the case that r .j r ' .
Sentence 2: there can be at most t(n - t)= O(n 2) rounds r such that a nonfaulty process i shuns a faulty process j starting in round r. Hence, there are at most O(n 2) rounds where the SCC protocol does not succeed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: count Logical execution order (5) (5) (15) (15) (15) (6) (6) (17) (17) (17) it1 = it2 it1 > it2 it1  it2 it1 = it2 Task 1 is behind Task 2 Task 2 is behind Task 1 Task 1 is behind Task 2 Task 2 is behind Task 1 No relative progress order Table 1: Two MPI tasks executing the Poisson solver of execution.
Sentence 2: we reduce the relevant state to those variables that capture progress through that control .ow.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When the network quality is low, the transmission queue of a node starts .lling-up at a speed depending on the pro­ducer rate (the microcontroller) and, if the condition per­sists, it can become full.
Sentence 2: to save power on the mi­crocontroller, a simple approach could be to switch to the lowest possible frequency value (or even shut-o.)
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In [16], Vallecillo ar­gues that it is unrealistic to model large and complex sys­tems with a single instance model of a single DSL, and that instead it is preferable to model di.erent facets of such sys­tems with distinct instance models of distinct DSLs.
Sentence 2: the broad survey of model and metamodel combination ap­proaches Vallecillo provides, as well as his own viewpoint uni.cation technique are mostly aimed at the merging of interrelated models and metamodels.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: From both of our evaluations of comparison of work.ow exe­cutions employing di.erent optimizations strategies, we ob­served that the our predictions validate the measured rank­ing of di.erent optimization strategies.
Sentence 2: we believe that despite of the small inaccuracies, our predictions can e.ectively guide the work.ow runtime environment for the selection of di.erent optimization strategies.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When apply­titioners usually refer to techniques for acquiring and managing ing ourprevious approach on web applications, weface signi.cant * Corresponding author challenges.Foraweb application,eachdynamicallygenerated web pageis actuallyatextintheHTMLformatdisplayed atthebrowser side.
Sentence 2: our previous approach is able to locate the constant stringsthat maygotothebrowser sidefordisplay.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Peers with small credit balances are incentivized to deposit tokens earlier than their expiration times in order to receive fresh tokens to spend.
Sentence 2: when the coordinator adjusts timestamps on forest edges before extracting propagation bandwidths, promptly deposited tokens result in early timestamps that percolate up the forest trees, replacing timestamps of exchanges whose tokens were deposited signi.cantly after the block exchanges actually occurred.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Hence, the probability of a query word wi generated by D is expressed by K , P (w | M ) =P(w | k)P(k | M ) (8) DTMiD i D k =1 where P(w| k) denotes the probability of a query word wi i occurring in a specific latent topic k, and P(k|MD) is the posterior probability of topic k generated by document model MD .
Sentence 2: considering equations (7) and (8), the likelihood of a query Q generated by D is thus represented by .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Selecting Beam Directions in Radiotherapy with an Evolutionary Algorithm Marco C.Goldbarg Elizabeth F. G. Goldbarg Carlos R. A. Mendes UFRN UFRN UFRN Campus Universitário, Lagoa Nova Campus Universitário, Lagoa Nova Campus Universitário, Lagoa Nova Natal, Brazil Natal, Brazil Natal, Brazil gold@dimap.ufrn.br beth@dimap.ufrn.br carlosraoni@gmail.com ABSTRACT Radiotherapy treatment planning aims at delivering high doses in the target volume while taking care to do not overdose other organs at risk.
Sentence 2: it is an important issue to design a process for finding out ideal balances between those contradictory goals.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, it is not the main focus of this paper to investigate different algorithms for making such decisions.
Sentence 2: in our previous work, it has been noted that the effect of the con­.gurations of geographic location of the database replica is not as signi.cant as the effect of the overloading workloads in increasing the staleness window of the database replicas [23].the analyser component can decide to stop an active database replica when it detects a decreasing workload that can be served by less numberof database replicas without violating the application-de.ned SLAs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Recall that our primary goal is to identify the most frequently executed paths in the distributed sys­tem, so a useful tool will rank-order the inferred path patterns by count and then prune away most of the low-frequency path patterns.
Sentence 2: we examine whether the top Npatterns that remain after pruning match the top Nground-truth patterns, or whether pruning causes some of those top Nground-truth patterns to be omitted.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, if the .rst condition cond1 evaluates to false most of the time, then latest con.g will not be updated frequently.
Sentence 2: specu­lating on the absence of the dependence between line 1 and 9 is a good choice, as this speculation is frequently successful, which enables the parallelism to be aggressively exploited.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: e X:f(b),b:bl=0 L n-11 where tr{·} denotes the trace function and Gl = i=0,i=l 2 (2bi-1)LM,a(bi).
Sentence 2: there are a total of 2n expo­nential terms to be generated when computing the LM,e(bl) value.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The PCMCIA card we use for our experiments does not 80 60 40 20 0 time (s) Figure 9: Inquiry Time Distribution -1 BlueTag allow point-to-multipoint connections.
Sentence 2: the static node handles one connection to a smart-tag after another and thus establishes a connection as soon as a smart­tag is discovered.
Relationship: reasoning