sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: For t> 0, we .nd the optimal values opt[t][u] by considering the optimal migration paths to any node v at time t - 1, and adding the migration cost from v to u.
Sentence 2: in order to .nd the optimal cost to arrive at a con.guration with server at node u at time t: min opt[t - 1][v]+ Costmig(v, u)+ Costacc(w, u) v.V w.st where we assume that Costacc includes the .rst (wireless) hop of the request from the terminal to the substrate network, and where Costmig(v, v)=0 .v.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: From this investigation, two classloading strategies (one of which is new to this paper) are described and compared with the default non-preloading classloader.
Sentence 2: we: describe a preloading (P) classloader that eagerly preloads all classes whose names are in the constant pool to reduce the chance of new classes being loaded after an IPA is triggered, and thus can improve perfor­mance by reducing the repetition of the IPA.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: {22p+1pB, 32p+1 pB, ...}, there exists a constant E> 0 such that any E­error distributed algorithm for any of the following problems 11 2 2(2p+1) ) requires O((n/(pB)) - time on some T(n)-vertex graph of diameter 2p+2 in the B model: Spanning connected subgraph, connectivity, s-t connectivity, k-components, bi­partiteness, cycle containment, e-cycle containment, cut, s-t cut, least-element list [4, 14], and edge on all paths.
Sentence 2: for graphs with diameter D =4, we get O((n/B)1/3) lower bound and for graphs with diameter D = log n we get O( n/(B log n)).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Catchingsuch con.gurations errors early on, when writing the architecture description of a Dream assemblage, would be of tremendous bene.ts to programmers using the Dream framework.
Sentence 2: what would be required would be a type-safe ADL that would allow the typing of com­ponent structures and reject ill-typed component con.gura- Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our objective is therefore to integrate quantitative techniques for reasoning about non-functional properties, based on objective criteria, with goal-oriented techniques for building requirements models.
Sentence 2: systematic support should be provided to: specify and propagate partial degrees of goal satisfaction precisely, in terms of domain-specific phenomena;  guide the elaboration of models that help stakeholders assess the impact of alternatives on the degree of goal satisfaction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A concern is any concept, feature, requirement or property of the problem or solution domain of software [28].
Sentence 2: highly Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: An independent set of a graph G is a subset of the nodes such that no two nodes in the subset interfere [1].
Sentence 2: no two nodes represent an edge of G. In the proposed method, the value of the independent set S in a graph G {U} is defined as the summation of effective saving of a node U by each node of S. The independent set S is called maximum if there is no independent set which has the greater value than that of S. Again in Figure 3, when calculating the effective saving for a node A, the independent set of G {A} is {B, C}.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: b1,2,1 (1 - t1)a1,1,1b1,1,1 = (1 - t1)a1,1,1b1,1,1 + t1(1 - a1,1,1)(1 - b1,1,1) (1 - t1)a1,2,1b1,2,1 - (1 - t1)a1,2,1b1,2,1 + t1(1 - a1,2,1)(1 - b1,2,1) > 0.
Sentence 2: .1(s1,1,s2,1) >.1(s1,2,s2,1).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In all the cited examples a modi.ed C compiler is used to pro­gram the processor and to extract candidate kernels to be down­loaded on the FPGA.
Sentence 2: the GARP compiler [4] and the related Nimble compiler [15] identify loops and .nd a pipelined implementation, using pro.ling-based techniques borrowed from VLIW compilers and other software optimizations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Keywords-Geo-distributed data centers; electricity cost; carbon tax; bandwidth cost; request routing; VM scheduling I. INT RODUCT I ON Today, many pioneering Cloud Service Providers (CSPs) deploy geo-distributed Data Centers (DCs) worldwide for providing various services to their customers from different ge­ographical regions.
Sentence 2: software-as-a-Service (SaaS) platforms such as Salesforce.com [1] and Zoho [2] have been gaining prevalence in delivering software services.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: assert ReachesLegal {all i: Legallnterface I i.reaches in Legallnterface}  //if interface i reaches interface j, does j reach i?
Sentence 2: assert ReachesSym {all i, j: Legallnterface I i in j.reaches -> j in i.reaches} Figure 4: A variety of simple queries All conditions are consistent, all assertions ore invalid  Theorem 1 says that for any legal component, the identifiers known to any interface of that component are all the identifiers of the component every interface identifier of a component is accessible from every interface of that compo- nent.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By isolating the core GISS algorithms from the supporting functions (algorithms for reading input and writing output) and providing a single interface specifying parameters and initiating the analysis, ccc-gistemp seeks to improve the readability and maintainability of the software.
Sentence 2: the temperature Series anomaly, which is the primary data object in most GISS algorithms, has differing representations in different parts of the code making it hard for new users to comprehend the code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This paper shows how we use the block-recursive, cache-oblivious style to localize the base cases for ef­.cient processing to support the communication and sharing of blocks over them.
Sentence 2: the divide-and­conquer paradigm leads to a much improved decompo­sition of Cholesky factorization that enhances memory locality within the processors, and simpli.es block com­munication among them.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Consider the partial gradients .pi E =[.E/.pi,f]E = .E/.qo , f.F , .qj j,f f.F,o.O and the following system of ODEs: dpi = -.pi E +zD1 ,i.N , (10a) dt dqj = -.qj E +zD2 ,j.M, (10b) dt where zD1 , zD2 , de.ned formally in [9], are the minimum forces required to keep the evolution of the system within the constraint set D1 × D2 .
Sentence 2: theODE(10) canbe viewed as a projected gradient descent for theRating Prediction problem.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: .. and observing im(0) = vt(1)-vt(0) = 1, we have vt(c)=^c1im(i)+1 (10) i=1 The friendliness of a program is given by its .ll time function vt(c), which is the average time it .lls the cache of size c with newly accessed data and evicts the data from peer programs that have not been used in the last vt(c)time period.
Sentence 2: the data access of this program leads to the survival window of vt(c)in size-c cache for the data from the peer programs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Analyzing the Behavior of Event Processing Applications Ella Rabinovich Opher Etzion Sitvanit Ruah IBM Haifa Research Labs IBM Haifa Research Labs IBM Haifa Research Labs ellak@il.ibm.com opher@il.ibm.com ruah@il.ibm.com Sarit Archushin IBM Haifa Research Labs sarit@il.ibm.com ABSTRACT Event processing application development is a relatively new discipline that poses challenges when applying state of-the-art software engineering practices.
Sentence 2: the temporal semantics of event processing requires careful validation of the actual behavior against the expected behavior to avoid temporal fallacies.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A variant type de.nition type+ T = ... | C adds constructor C to existing type whose type name is T. In Figure 1, we have already seen an example that adds Sub constructor to the type t. The constructors added to a variant type by aspects often make pattern matching non-exhaustive.
Sentence 2: a base program that originally de.ned the variant type usually has functions that process for each constructor differently (e.g., eval in the simple interpreter).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 13 14 15 Q4: How e.ective are the automatically generated integra­ 16 tion test cases?
Sentence 2: to what extent can newly generated integration test cases substitute or augment 17 integration test cases that can be derived with tradi-18 tional techniques, and how many integration test cases 19 can be automatically generated?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INTRODUCTION Writing safe and robust low-level code is di.cult; writing safe and robust low-level multithreaded code is more di.­cult.
Sentence 2: it takes great care to avoid data races (one thread accessing data while another thread writes the data), but a single race can leave data in an inconsistent * This research was supported in part by the AFOSR, un­der grants F49620-00-1-0198 and F49620-00-1-0209.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2)At a DEVS coupled model: i) there is no way to verify if the port connections among models are correctly de.ned.
Sentence 2: the user should take care if the de.nition domain of a port is a subset of or equal-set to that to which is connected; ii) more evident, the user should avoid a recursive de.nition of a DEVS model by reusing the DEVS in current speci.cation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Many on-line load management algorithms [1, 9] require global knowledge about the load of all tasks and resources, which is usu­ally not available or prohibitive to obtain in terms of communica­tion in a distributed environment.
Sentence 2: lui and Chan [9] reduce load balancing in distributed virtual environment systems to a graph partition algorithm, and assume global knowledge of load and pairwise communication cost between avatars.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Itisimpor­tant to mention at thispoint that the approach in[2]is apure performance­oriented one anddoes nottakeinto accountthe network structure(though itdoes an excellentjob,in our opinion, in reducing the number of accesses to remote data).
Sentence 2: this performance-oriented approach mini­mizes the number of nonlocal accesses but it does not care where the non­localdataresides orhowitisaccessed(i.e.,through whichlinks).Thelast twocolumns ofTable3givethe execution cycles and energy consumption results whenthe approachin[2] isfollowedby an energy-saving scheme, which turns off the unused links and scales down the voltage/frequency on others whenever there is an opportunity to do so.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.2 Modular Reasoning about Flows of Ex­ceptions Flows of Checked Exceptions As an example of modular rea­soning about .ows of checked exceptions during event announce­ment and handling, consider veri.cation of a requirement Ff1 that says: the checked boundary exception RegDExc must be propagated back to the subject Savings, if thrown by any ob­server of WithdrawEv during its announcement and handling.
Sentence 2: an exception RegDExc thrown by one observer of WithdrawEv must not be caught by another one of its observers in the chain of the observers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CONCLUSION In this paper, we presented the DANS architecture for truly decentralized and adaptive execution of media process­ing work.ows in sensory/reactive environments providing ambient services such as ARIA [2, 3].
Sentence 2: we show that the operator instance placement as well as the next operator instance selection tasks can be achieved in a purely distributed manner, without needing a centralized de­cision maker or a lookup directory.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, as we show below, App and Sub can be used to derive that f0 :tf0, x:{u:int 1 u = 0} .f0 x :unit &#38; (S * , Ø) in the example above.
Sentence 2: the call to f0 with a non-negative integer argument terminates.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A simulation is thus a set that is already saturated with respect to such a rewriting.
Sentence 2: if we con­sider the statements of Lemmas 3.11 and 3.12 as inference rules for determining when a type is equal to 0, then ES is the set of immediate consequences of S , and a simulation is a self-justifying set, that is a co-inductive proof of the fact that all its elements are equal to 0.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The semantics of synchronization operations is parametrized by a predicate f and a function d, indexed by the operation s details.
Sentence 2: thread t may perform synchronization operation op involving variable x so long as the heap satis.es the predicate fop,x,t;asa result the heap is transformed according to the function dop,x,t.If the operation requires additional parameters, they are passed to the function/predicate as needed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper we propose a technique for specifying pro.les within UML, aiming at a speci.cation and tool-supported enforcement of architectural constraints.
Sentence 2: we show how pro.le speci.cations can be structured according to di.erent views on software architecture, and how a subset of UML can be used as a pro.le speci.cation language with a precise interpretation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Here it is enough to say that, as usual in the au­tomata theory, the aim of the equivalence check is to verify that S simulates C3 and vice versa, under a suitable notion of simulation (i.e., CB-Simulation).
Sentence 2: s YNTHESIS automatically checks that S performs4 all the behaviors of C3 and vice versa.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In summary, we believe our aggregate score of 92% should notbetakentosay anything moreprecisethan there is a substantial effect .
Sentence 2: this score does not al­ Code Base SubjectJ (hours) Java (hours) Difference SubjectJremodularization performed .rst (total hours = 63.4) Tetris 3.0 3.5 +17% TyRuBa 18.0 20.3 +13% JHotDraw 4.2 4.0 -5% Chinese Chess 3.8 6.6 +74% Sum(1) 29.0 34.4 +19% Java remodularization performed.rst (totalhours = 66.9) MineRay 0.7 2.3 +252% DrawSWF 2.0 5.8 +183% FindBugs 9.9 30.7 +210% JChessBoard 3.0 12.5 +325% Sum(2) 15.6 51.3 +229% Aggregatedresults (total hours = 130.3) Sum(1)+Sum(2) 44.6 85.7 +92% Table 4.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We add a type assignment rule per­mitting O to have any valid type, however we do not modify the predicate assignment rules.
Sentence 2: this means that O must be assigned the predicate .. To formalise the notion of snapshot, we de.ne an ordering on approximate expressions: 3This is not strictly true, since we might also derive a method pred­ icate for a variable when it is mentioned in the environment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Within aspect-oriented approaches,[8, 16, 18] propose solutions to deal with context-awareness atsource code level, without considering the more abstract designlevel.
Sentence 2: these papers address the problem of dealingwith contexts defined as a history of events (called statefulaspects in [8, 18]), or with past contexts [16] that could affectthe present behavior.Some papers have also specifically considered how to adaptservice-oriented applications using an aspect-oriented approach.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These input artifacts are created using customized editors built using Eclipse plug-in facilities.
Sentence 2: the CAD format has a textual editor, a graphical editor (to view sys- tems as graphs similar to style of Figure 1) 3, and a form- based editor that allows one to easily define different pro- jections of the component assembly (e.g., connections only, distribution and rate assignments only, etc.).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We present two solutions, Basic Contributor and Enhanced Con­tributor that signi.cantly improve overlay multicast performance when compared with the Strawman solution, which does not utilize band­width resources at hosts behind NAT or .rewall.
Sentence 2: internet experiments show that in the Slashdot event, Basic Contributor elimi­nates most of the rejections suffered by Strawman and Enhanced Con­tributor performs very well without suffering any rejections.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These experiments support our conjecture that a dual­mode protocol combining an epidemic broadcast of the en­tire message, along with a secure broadcast of short digest, may be su.ciently e.cient.
Sentence 2: it seems plausi­ble that a su.cient level of security can be achieved with a digest that is 1/10 the size of the original message, which would yield a slow down of less than a factor of 2 for pro­viding Byzantine fault-tolerance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Sp2 )is a set ofstates (d1, ··· ,dn,y1, ··· ,ym) (respectively, (x1, ··· ,xn,c1, ··· ,cm))in Su such that for all possible valuations of (y1, ··· ,ym) (respectively, (x1, ··· ,xn))the valuation (d1, ··· ,dn) (respectively, (c1, ··· ,cm)) remains the same.
Sentence 2: the image of s is a state predicate in Su.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On the other hand, the stakeholder of the E-Media system need to make sure that the system will always be available for customers to buy, it can confirm the involvement of an entity in certain communications, and it can prove the identity of an entity.
Sentence 2: the main security objectives from the e-media s stakeholder point of view are availability, non-repudiation, and authentication.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INTRODUCTION The concept of awareness, characterized as an understanding of the activities of others to provide a context for one s own activi­ties [1], has been researched in the field of Computer­Supported Cooperative Work to facilitate coordination in group activities [2, 3].
Sentence 2: in being aware of the activities of team members, an individual can relate their own activities to those of their col­leagues, enabling them to identify and address a variety of coordi­nation problems [1, 4].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In Figure 2, we have sorted branches by their bias and plotted the Pareto optimal trade-off be­tween correct and incorrect speculation.
Sentence 2: as we move away from the the origin, we are speculating on an increas­ing number of branches, yielding more correct speculations (y axis) as well as more misspeculations (x axis).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is well known that the provision of general .xpoint recursion as is captured by the function .x from Figure 1 requires all rela­ tions used in the de.nition of the logical relation to be admissible.
Sentence 2: in the inductive case for the .-type constructor the quanti.cation of R must be over admissible relations only.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More concretely, we may require instances of Graph.Edge to hold references to instances of Graph.Node, and instances of CWGraph.Edge to hold references to instances of CWGraph.Node,as alsoargued in Ernst [12].
Sentence 2: cross-group references such as an instance of CWGraph.Node being a source node of Graph.Edge must be disallowed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.1 Identifyingdataobjectsbelongingtothesamememory block At compilation time, we know each data object s offset relative to the stack base pointer, but cannot determine which group of data objectswillbeloadedintothesamememory blockduringruntime.
Sentence 2: we need to know which group of data objects belong to the same memory block.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: With reference to Figure 3, d(01000) = d(01010) = d(100) = d(1000) = d(10000) = d(10001) = 1, whereas other occur­rences have depth 0.
Sentence 2: d(0100) = d(0101) = d(10) = 0; what matters in computing the depth of an occurrence is the num­ber of  s that precede strictly the end node.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: S, it must be the case that: * (s0, )) 9-.
Sentence 2: (s, g.) for some stack g.. G a Dyck state graph is equivalent to a rooted push­down system in which there is a legal path to every control state from the initial control state.4 We use DSG to denote the class of Dyck state graphs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given two disjoint relational schemas S (source) and T (target), a source-to-target dependency (std) is an ex­pression of the form .s(¯x, y¯) .
Sentence 2: .t(¯x, z¯),where .s is a conjunction of atoms over S and .t is a conjunction of atoms over T. If we have a source schema instance S and a target schema instance T , we say that they satisfy the above std if (S, T ) |= .x¯.y¯(.s(¯x, y¯) ..z.¯t(¯x, z¯)).we assume that new variables on the right are quanti.ed exis­tentially, and the others are quanti.ed universally.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: After that, we select two virtual processors vi and vj and construct a new mapping p ' fromp asfollows: ( p(v), if v .vi,vj; = p ' (v)= p(vj), ifv = vi; p(vi), ifv = vj.
Sentence 2: we obtain a new mapping p ' by swapping the target physical pro­cessors of virtual processors vi and vj.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Itis evident from the illustration that the safe zone induced by the distant referencevectorincludesthesafezoneinduced by the estimate vector.
Sentence 2: any drift vector that creates a monochromatic sphere with the estimate vector creates a monochromatic spherewith the distant reference vector as well, but there is also a large set of drift vectors that createamonochromaticspherewith the distant refer­encevectorbut not with theestimate vector.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The key axiom is that v if a1 = a2read(write(m, a1, v), a2) =read(m, a2) otherwise To successfully verify low-level code, we have found it necessary to model memory layout accurately.
Sentence 2: when verifying software written in a high-level language, arrays are often assumed 1The relational translation may remind some readers of the well­known static single assignment (SSA) form [13], but recall that the simulation is of a dynamic execution trace.
Relationship: entailment