sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Using these activities, Scribe con­verts nondeterministic asynchronous interactions that are di.cult to record and replay e.ciently without additional hardware sup­port into synchronous interactions that can be recorded in software with low overhead.
Sentence 2: the timing of an application ex­ecution may be perturbed in a manner that makes it easier to record e.ciently without sacri.cing correctness or performance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As for interrupts, because of their asynchronous nature, they are always handled without any rollback.
Sentence 2: processor execu- Reversible I I I I Conventional ROB I ] J J i I i i :11 Head (oldest) Reversible Irreversible ...."Y-:-I I I I I I I I I I I I _-:_-12 Cherry ROB ...... t ......
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In a series of papers Olivier Danvy and his co-authors have used defunctionalization and other techniques to establish correspon­dences between interpreters and abstract machines, among other things [1 4, 8, 9, 11, 14].
Sentence 2: one key step of their cor­respondence is to defunctionalize continuations to get a .rst order representation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We use K-anonymity parameter of ers, each ShardStorer can observe only a small fraction (i.e., 1 K=100, and normalize the results relative to CF.BestSeller ( )) of the stored shards and as depicted via P3.Blind=ON  N2 as the lower-bound, and CF.AllPairNNS as the upper-bound.
Sentence 2: (A=ShardStorer), this results in the success rate becoming if the clustering metric of an approach is x,zero (thereby not visible in the logscale plot).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Even program, We consider two types of statements: (1) assignment statements are of the form x := e where x is a variable and e is a side-effect though these examples are simple, they illustrate common patterns exhibited in large programs (see Section 5): some parts of large programs are more amenable to may analysis while other parts are more amenable to must analysis.
Sentence 2: for functions with many paths due to nested calls, conditionals and loops, but simple postconditions established in a post-dominator of all paths (such as the last statement before return), not-may summaries can be easy to compute.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.
Sentence 2: aCM Multimedia 2000 Los Angeles CA USA Copyright ACM 2000 1-58113-198-4/00/10...$5.00 multimedia file systems must have high I/O bandwidth to support the number of concurrent clients isochronously[l].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this regard, MAS for WSNs should attempt to achieve a balance between the degree of functionality incorporated into the actual code interpreter, and the one provided to the agents in accordance to the intended WSN application.
Sentence 2: we argue that it makes little sense to provide agents in WSNs with excessive control of the system s functionalities if the tasks to be performed in the WSN are consistently repetitive.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: G.  4.4 Completeness After formalizing the individual refactorings, the question arises whether, in combination, the refactorings are complete.
Sentence 2: we want to show that every possible program (given the syntax and sanity rules of LJAR) that uses any combination of feature modules and/or annotations can be refactored into a pure virtual separation (with annotations, without feature modules) and also into a pure physical separation (with feature modules, without annotations).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: One of them is the ability to check the connection and re-instantiate it, if needed; indeed the library avoids some protocol errors such as the brutal closure connection , which occurs when a login is not performed within a timeout after establishing the connection or when, due to a long period of inactivity, the server unilaterally 7 It can assume the value ok , not or bad .
Sentence 2: 8 for the fetch command, it is a list of proplists .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Strong links Next, we introduce strong links.
Sentence 2: again, the type e.f is a precise type for a name: it is more precise than e.f - and (therefore) more precise than Name f. If x has type e.f, -then x is guaranteed to be fresh for the world e. a strong link represents the introduction of a binding for a fresh name, and (in contrast with a weak link) cannot possibly shadow an earlier binding.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, semantic links speci.ed among ADL1 and A0 and among the MM and A0 enable the possibility to inherit the graphi­cal annotations (and hence the graphical representations) of the A0 linked elements.
Sentence 2: a0 substitutes ADL1 or MM if they do not have annotated Ecore metamodels.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we focus on a sub-problem of product derivation: instead of deriving a complete software product, we aim to derive the use cases of a software product, which are a kind of software asset at the requirement stage and play an important role in negotiating application requirements with customers and generating test cases for testing applications [2][11][14].
Sentence 2: we focus on automated use case derivation, i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INTRODUCTION Given a stochastic process X(t) with X(0)=0, the first passage time (FPT) T to the point x=a>0 is specified with T = inf{t : X (t) = a}.
Sentence 2: (1) FPT is the time when the stochastic process first crosses a threshold a.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our case, the .x is carried out by the fixTail() method, which is aware of the existence of the slow path.
Sentence 2: it checks whether the 47 void help if needed() { 48 HelpRecord rec = helpRecords[TID]; 49 if (rec.nextCheck-- == 0) { 50 OpDesc desc = state.get(rec.curTid); 51 if (desc.pending &#38;&#38; desc.phase == rec.lastPhase) { 52 if (desc.enqueue) help enq(rec.curTid, rec.lastPhase); 53 else help deq(rec.curTid, rec.lastPhase); 54 } 55 rec.reset(); 56 } 57 } Figure5.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We note here that the above Exact BVC algorithm re­mains correct if the non-faulty processes identically choose any point in G(S) as the decision vector.
Sentence 2: as seen in the proof of Lemma 1, all the Tverberg points are contained in G(S), therefore, one of the Tverberg points for multiset S may be chosen as the decision vector.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If class C extends D1 and D2 and the unspecialized method m is de.ned or inherited by both D1 and D2 then C must also de.ne the unspecialized method m. Also, if method m with specializer B is de.ned or inherited by both D1 and D2, then C must also de.ne either (1) m with specializer B., where B is a subclass of B., or (2) an unspecialized method m. Additionally, the calculus assumes an elaboration phase that translates method names to quali.ed names, using the name of the class where the method was .rst de.ned; conse­quently, methods have a unique point of introduction.
Sentence 2: in the calculus, two classes only share a method name if it exists in a common superclass or common required class.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (f )= .0 10 1-fmin (4) where the exponent d (> 0) is a constant, indicating the sensitivity of fault rates to voltage scaling, while .0 is the average fault rate corresponding to the maximum frequency fmax = 1 (and supply voltage Vmax).
Sentence 2: reducing the supply voltage and frequency for energy savings results in exponentially increased fault rates.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INTEROP arises when PD and CD do not directly align, that is to say: the way consumers characterize needed data (according to CD) does not directly correspond to the way producers charac­terize the counterpart available data (according to PD.)
Sentence 2: valuable data needed by consumers is available from the producers but it is not evident how to use them.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The third case study is motivated by a programming framework for sensor networks [18] that offers so-called tell actions,where a node may tell one or more other nodes to execute a (potentially syn­chronous) command and the tell action itself waits until all nodes have .nished executing the command.
Sentence 2: a tell ac­tion basically is a synchronous one-to-many remote procedure call (RPC).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: collect_first_results(K, ThreadCount, Hub, MoreXs):­ K>0, ThreadCount>0, ask_interactor(Hub, Answer), count_thread_answer(Answer, ThreadCount, ThreadsLeft, Xs, MoreXs), ( ThreadCount=:=ThreadsLeft->K1 is K-1 ;K1 is K ), collect_first_results(K1, ThreadsLeft, Hub, Xs).
Sentence 2: searching for at most one solution is possible: multi_first(XGs,X):-multi_first(1,XGs,[X]).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We intend to continue the development and integration of advanced compilation techniques.
Sentence 2: we want to address inter-procedural and inter-modular boxing and unboxing, as well as to explore the tradeo.s of doing addi­tional boxing/unboxing steps, which has an extra overhead but which in general may bene.t other parts of the code, and generating automatically hints for the garbage collec­tor.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.2.3 Scope Increases and Decreases Increases or decreases in the scope of a model de.nition rule may change the abstract model.
Sentence 2: if the change in scope of a model de.nition rule causes an ob ject (or tuple) to be added to or removed from a set (or rela­tion), the resulting change in the model may falsify model constraints that depend on the set (or relation) or cause additional changes in the scopes of other model de.nition rules.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When theprop­erty being checked requires morepredicates,theveri.cation time increases rapidly.
Sentence 2: .xing the bug men­tioned above results in a signi.cant increase in the number of predicates required to verify a claim using the sequential model: Thenumberofpredicatesincreasesby afactor of10.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Conceptual Architecture As introduced above, flexible modeling tools blend the advantages of office and modeling tools, thereby more ef­fectively supporting pre-requirements analysts work.
Sentence 2: they provide the free-form, relatively­unconstrained user experience of office tools blended with the support for structure provided by modeling tools, which facilitates multiple views, consistency management and domain-specific support.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Managing jobs with an interpreted language for dynamic adaptation * Anolan Milanés Pontifícia Universidade Católica do Rio de Janeiro Computer Science Department  anolan@inf.puc-rio.br Noemi Rodriguez Pontifícia Universidade Católica do Rio de Janeiro Computer Science Department  noemi@inf.puc-rio.br Bruno Schulze National Laboratory for Scienti.c Computing Computer Science Dep, Brazil  schulze@lncc.br ABSTRACT In this paper we explore the advantages of using interpreted languages for building submitting engines for the grid.
Sentence 2: we discuss an example engine, developed using ALua, for submitting jobs in a cluster, which can be ex­tended to a grid environment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Code duplication, which might arise as a result of carelessly expanding de.nitions, is easily avoided by caching the result of function applications.
Sentence 2: there are some obvious limitations to our approach which we hopeto addressin futurework.anEDSLwithhigher­order functions would still retain an interpreter in the residual pro­gram, because higher-order functions accept functions as dynamic arguments, violating our Rule 4.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2P where P is a set of all users and W is a .nite set of all locations.
Sentence 2: the function acl takes a user identity X and a location name l as inputs and outputs a set of users who are authorized to learn that Bob is at location l. the LSS releases Bob s location movement (lk,tk)to principal X only if X belongs to set acl (Bob,lk), and thus user X receives a subset of events L'(X) .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While suchfeatures are notavailablefor allkinds of image types and recognition tasks, several promising tech­niques have emerged in recent years.
Sentence 2: when one is interested in searching for images of the same object or scene, a good representation is obtained using the Scale-Invariant Feature Transform (SIFT) [16], which generates 128 dimensional vectors by essentially computing local ori­entationhistograms.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While shared memory implementations rely on artificial barriers to implement a given algorithm from this group of dwarfs, which limits the parallelism and the performance, dataflow implementations support a straightforward implementation by directly mapping dependencies between algorithm operations into a task-based dataflow execution.
Sentence 2: for these four dwarfs dataflow implementations provide on average up to 29.25% better speedup than the shared memory versions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In other words, when the thwart mechanism, started at i, fails in .nding a non-overloaded replica, then i decides to expand the overlay.
Sentence 2: from this point on, initiator i becomes unavailable (preventing itself from participat­ing in traversals): it chooses a node j outside the memory and ac­tively replicates its timestamp and value at j.j becomes a replica, i shares a part of its own workload and responsibility zone, and j and i notify their neighbors becoming newly available.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If a solution f exists, then we can always produce an expression e( by adding annotations to e ( such that the algorithm succeeds for the typing problem (G, e, t) and that f is equivalent (for the equivalence induced by the more­general ordering) to the solution f0 computed by the algorithm.
Sentence 2: even if the algorithm is not complete (because of the acyclicity condition) and makes a choice between most­general solutions (the smallest one for the subtyping relation), for any solution to a typing problem, the programmer can always add annotations so that the algorithm infers this very solution (or an equivalent one).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: of Massachusetts Amherst, MA 01003 USA wise@cs.umass.edu  Julian Hadley Harvard Forest Harvard University Petersham, MA 01366 USA jhadley@fas.harvard.edu Aaron M. Ellison Harvard Forest Harvard University Petersham, MA 01366 USA aellison@fas.harvard.edu Emery Boose Harvard Forest Harvard University Petersham, MA 01366 USA boose@fas.harvard.edu ABSTRACT This paper describes our experiences in exploring the applicability of software engineering approaches to scientific data management problems.
Sentence 2: this paper describes how process definition languages can be used to expedite production of scientific datasets as well as to generate documentation of their provenance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Figure 3: Five level XML evolution architecture PSM components can be discovered and updated as well.
Sentence 2: when someone decides that a customer s name is to be represented by two values (.rst and last name) in­stead of one string, it is possible to automatically .nd all rel­evant usages of this value and change all the a.ected XML schemas and the conceptual model at the same time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: EF is the ratio of energy used by the scaled workload to energy used when workload is processed at full speed.
Sentence 2: pn 2 i=1 vi fiti EF = 2 (4) vMAXfMAXT where vi and fi are the voltage and frequency of each period of time (ti) between two frequency scaling operations and T is the execution time of benchmark at full CPU performance level.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The fact that compu­tational components do not move, or that they might move at most within a single interaction to execute a single task, allows for a simple binding between components and hosts.
Sentence 2: it is statically possible to .gure out what is executing where, and this, in turn, allows for simpler con­.guration, testing, deployment, and update of components as well as of entire applications.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ferent equivalence relations and use the singleton pattern [9] to guarantee that only a single instance of each semantically equiva­lent AST is created.
Sentence 2: the behavior of Instance()re.ects the particular equivalence relation that the component implements and ensures that any two constructions of a semantically equivalent speci.cation share the exact same storage location.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In an optimal coloring, the chromatic number a(G; w) is related to the notion of heaviest path in an acyclic orientation of G as follows: a(G; w) = min (max w(µ)) (1) e.A(G) µ.P(e) where A(G) is the set of all acyclic orientations of G and P(a) the set of directed paths in an orientation a .A(G).
Sentence 2: the orientation whose heaviest path is the smallest induces an opti­mal coloring.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While in a de-duplication based store, a chunk with a higher commonality would be more valuable.)
Sentence 2: the amount of user data lost when a chunk i in the storage system is destroyed is given as follows [2]: lossi = commonalityi * chunksize (1) Based on the above analysis, we can see that guaranteeing high data reliability is a critical problem in de-duplicated storage systems.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Instead, since inTune is intended to enable and support coor­dination, its features are de.ned based on a substan­tial body of work in system controls and multi-agent systems.
Sentence 2: in reference to distributed con­trol theory and multi-agent systems for power engineer­ing [25], inTune coordinators are similar to intelligent agents in that they are: (1) proactive, initiating their own local control actions, (2) reactive, such that they can re­act to local monitored events; (3) social, such that they communicate management actions with other coordina­tors; (4) autonomous, such that they have local control and treat external control as advisory .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.3 The Inverse Method In [2], the inverse method (IM ) was proposed: given a PTA A, this semi-algorithm takes advantage of a reference point p, and generalizes it in the form of a tile, i.e., a linear constraint K on the parameters where the discrete behavior is uniform (see Figure 1a).
Sentence 2: for any point p' satisfy­ing K, the discrete behavior of A[p']isequal to thediscrete behavior of A[p].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (ListD A) which inserts the .eld leq and re.nes the index of the recursive position to a.
Sentence 2: the underlying description for OrdList is lOrdListOD A .A J : Desc A (so OrdList A .A b desugars to µ lOrdListOD A .A J b), and IOrdListOD A .A J : Orn !
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We consider a variability-aware parser as sound and complete if it yields a parse result that correctly represents the variability of the parsed code fragment.
Sentence 2: it should not matter whether we (a) .rst generate the source code of one variant (with a standard preprocessor given a desired feature selection) and then parse that variant with a standard parser or (b) .rst parse the unpreprocessed code with a variability­aware parser and then generate the abstract syntax tree of the variant (by pruning subtrees not relevant for the desired feature selection).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Therefore, the scal­able pMIX schemes are focused only on selected number of threads across selected number of cores.
Sentence 2: two pair of threads are chosen from four cores on di.erent LLCs in pMIX: two of which have the most LLC misses, i.e., heavy cores, while two others have the least LLC misses, i.e., light cores.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For instance use case Process bids follows section SupplierA Bid OR SupplierB Bid OR SupplierC Bid interpretation is that Process bids can be ex­ecuted whenever any of use cases SupplierA Bid , SupplierB Bid or SupplierC Bid has reached a point where Process Bids is enabled.
Sentence 2: the three use cases execution is not synchronized.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When M and d are appropriately large, the polygon for each target node may become suf.ciently small so that accurate estima­tion canbe achieved.
Sentence 2: we emphasizethat accuracyis affected notonlyby the numberof anchors M, but also by the number of events d. MSPprovides a tradeoffbetween thephysical cost of anchors and the soft cost of events.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A secure/con.ict check should be implemented for GM (n) after an update of GM such as: (1) when a user is added to an existing group; (2) when a privilege is added to an existing role or an arc is add to LRP ; (3) when a new group or a new role is created; (4) when an arc is inserted in LU R ; and (5) a new con.ict constraint is added.
Sentence 2: if TC (n) n G M CM = Ø holds, then the operation is legal.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The BorderWindow class overrides paint, but its own implemen­tation should never be overridden completely in later subclasses.
Sentence 2: beta more neatly implements the paint method for Bor­derWindow, so we annotate the implementation with beta and use inner in the body: class BorderWindow extends Window { ... beta void paint() {super.paint(); // paint background .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the clusterworkloads atYahoo!, we .nd that,a small fraction of the daily workload (about 5% of the jobs) use well over 90% of the cluster s resources.
Sentence 2: these jobs (1) involve thousands of tasks that are run on many machines in the cluster, (2) run for sev­eral hours processing multiple terabytes of input, and (3) generate intermediate data that is at least as big as the input.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The aim of this research, of which this study is a part, is to improve the process of constraint definition as part of domain specific CASE tool specification in a meta-CASE tool.
Sentence 2: the work focuses on facilitating and simplifying the constraint definition process using Specification by Example (SBE) technique which based on the notion of well-known technique programming by example (PBE).
Relationship: entailment