sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: This scheme solves many of the problems in conventional correlation prefetching and provides several important additional features.
Sentence 2: the scheme needs minimal hardware modifications beyond the memory processor, uses main memory to store the correlation table inexpensively, can ex-ploit a new table organization to increase far-ahead prefetching and coverage, can effectively prefetch for applications with largely any miss pattern as long as it repeats, and supports customization of the prefetching algorithm by the programmer for individual applications.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As described in Section 3, the distance of the shooter from the microphone can be estimated if the miss distance, the bullet speed and the time differ­ence of the shockwave and the muzzle blast are known.
Sentence 2: we can compute individual microphone-shooter distance estimates using the microphones distances from the trajec­tory estimate, the bullet speed estimate and the microphones shockwave and muzzle blast detection times.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Multiple layers can be made visible (like adding acetate overlays on a map), or layers can be grayed out, so that their glyphs are visible but less distracting.
Sentence 2: an important difference in sKEA s layers is that each layer represents something: layers, like glyphs, have a content, which is an entity that is an instance of one or more collections in the knowledge base.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Therefore, we seek a fold that produces something of type SearchTree (µList).
Sentence 2: the idea is that the fold will create one level of the tree, where l IkV r contains a value k for which values in the list l are less than or equal to k, and values in the list r are greater than k. k acts as a pivot around which l and r are partitioned.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Generally, we noticed that adaptive security and self-pro­tection have not been widely addressed in the adaptive soft­ware community [8] and the access control domain is not an exception.
Sentence 2: we are not aware of a solution that speci.cally combines Software Product Line (SPL) technol­ogy [7] and runtime adaptation in this domain.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While the coverage of the sensor nodes is larger than the length of pipeline L, we can decrease the power level of the critical sensor node that consumes the most energy until no further improvement to the lifetime can be obtained.
Sentence 2: decreasing the power level for the critical sensor node will lead to a coverage being less than L, or all sensor nodes already operate at the lowest power level.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This sub­  Sequential Parallelized Figure 4: Parallelization Example section presents the conceptual idea of the parallelization step, before the ILP formulation will be presented in more detail in Section 4.3.
Sentence 2: astheobjective,theparallelization step triesto minimize the critical path (or most expensive path) within a hierar­chical node n. this means that the ILP-based approach aims at the minimization of the costs of the path from the hierarchical node s communication in-to its com­munication out-node by moving some of its child nodes to concurrent tasks.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The challenge in such a scenario is combining the apparently in­consistent needs for .exibility, in terms of complete online recon.gurabil­ity of the features, of the whole service, of the role de.nition, down to personalization issues, and  scalability, necessary when managing a number of such services in parallel on the same ASP cluster, each with its own incarnation of the features, services, and roles, and this with   Figure 1: The Layered Architecture of the jABC Applications telecommunication-level quality of service, concerning primarily service availability and reliability.
Sentence 2: service interruption, e.g.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The function is a .nite program, and therefore a valid input to the .nite SKETCH solver: the size of its input and output are .xed to small constants, and, as we will see shortly, the number of computations performed by the function is constant with respect to the input parameters.
Sentence 2: the value of N no longer determines the amount of computation; it is only passed because it may be needed to compute the output value, e.g., to identify if the desired output element is close to the grid boundary.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Then, accuracy is evaluated by calculating two summary statistics over the Relative Error sample as shown in Figure 1.
Sentence 2: mean(RETE) = (1/TE)Si =1..TE(REi) is a measure of the bias of fR and STD(RETE) = SQRT{(1/N)Si=1..TE([REi Mean(RETE)]2)} is a measure of the spread of fR.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, studying a wide range of realistic parallel algorithms has shown us that some signi.­cantly more powerful capabilities are needed for such algo­rithms.
Sentence 2: all of the existing work lacks general support for fundamental parallel patterns such as parallel updates on distinct .elds of nested data structures, parallel array updates, in-place divide and conquer algorithms, and commutative parallel operations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Changes where applying one change renders the applica­tion of the second change useless are described in the non applicability property.
Sentence 2: if applying an operation o and sub­sequently an operation p then the resulting model should di.er from the result of applying only o to m. the operation p should have an e.ect, in this case it had an e.ect if applied to the model without applying o.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INITIAL FEEDBACK FROM END USERS We performed some preliminary studies to assess the feasibility of the approach to support the work of professional guides of archaeological parks.
Sentence 2: a study conducted in November 2012 at the archaeological park of Egnathia aimed at evaluating with end users the current prototypes, highlighting pros and cons, and getting insights on the overall approach and on how to improve and extend the platform.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to present our ideas in a familiar framework we de.ne a UML pro.le that extends standard UML semantics with the notions that are needed for the proposed abstrac­tions.
Sentence 2: we add the following: The notion of event, which is either a send action or a receive action;and message, which is the data payload that is passed between abstractions that engage in a send/receive pair.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The analysis aims to gain insight on both the size measures that could be considered effective indicators in predicting development efforts of web applications, and on the effectiveness of the modeling techniques.
Sentence 2: we have employed some size measures that have been proposed in the literature for early estimations, which can be grouped into two categories: Length Measures (such as number of pages, medias, server side scripts, etc ) and Functional Measures (such as external input, external output, external query, web building blocks, etc ) ([1], [2], [15], [17], [19],[24]).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The source of information drawn from the legacy application include the following: related documentation; the set of stakeholders and types of users of the application, their roles in the system, their goals and the requirements for the application; the business process models (or portions of them) implemented by the application; the logical and/or conceptual model of the database used by the application; a draft of the application hyperbase, navigation and publishing models; the functionalities implemented by the application; the business rules and constraints implemented by the application; the architecture of the legacy application and the software components in which it is decomposed; and the user interfaces enabling the user in executing the set of operations he can access.
Sentence 2: business processes are reverse modeled by means of the UWAT+ Transaction design models.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The use of network coding not only eliminates some mathematical dif.culties associated with previous theoretical mod­els, but also leads to simple and effective streaming protocols.
Sentence 2: we have demonstrated that any streaming protocol using our design principles is suf.cient to achieve provably good perfor­mance with respect to many important metrics, such as playback quality, initial buffering delay, resilience to peer dynamics, as well as bandwidth costs on dedicated streaming servers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The weights of e and f di.er; hence the weight of {g, h} is di.erent from the weight of e or f. Unfolding.
Sentence 2: first, we unfold the loop e in G to obtain a 2-lift GG of G. GG consists of two disjoint copies of G - e and a new edge of colour c (which we still call e) that connects the two copies of g in GG.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, both of the numerical values (the quantile of in­terest and the con.dence level) can be adjusted by the user; for example, we can equally well ask BMBP for the 0.5 quantile, or median, with 90% con.dence.
Sentence 2: bMBP allows the user to ask the question, What is the longest that my job is likely to wait in the queue?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: References as capabilities achieved by passing xWtlev(e) as argument to the procedure (call p( x Wtlev(e))).
Sentence 2: the body of procedure p does not have the capability to write to x if the security level of x is strictly below or incomparable with the security level of e. The rule T-SEQ obtains c 1 and c 2 by respectively transforming c1 and c2.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To generate language tools from the syntax and semantics de.ni­tions, we use Spoofax [26], a language workbench for the develop­ ment of textual software languages.
Sentence 2: we use Spoofax to generate parsers based on SDF grammars and type checkers, and code generators and interpreters based on declarative rules sets written in Stratego.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For each points-to relationship, say that p points to v, denoted as a tuple (p, v), it computes the probability that pointer p points to v at every program point s during the program execution.
Sentence 2: a proba­bility function P(s, (p, v)) is computed for each points-to relationship (p, v) at every program point s by the follow­ing equation .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is natu­ral to ask whether or not the type system fragment associated with the metalanguage can be adapted to other object languages, and if so, how dif.cult this might be.
Sentence 2: one might expect that because we expend so much effort on context manipulation, sup­porting an object language with a substructural type system would be particularly challenging.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Checking the conditions that trigger the run of a new phase, one may check that one or two phases normally suf.ce for a typical benchmark.
Sentence 2: an object cannot be traced after the .rst handshake if it is not modi.ed before the handshake, it is not traced before the handshake, and it is modi.ed just after the .rst handshake (before it is traced).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.3 Our Approach: Dynamically Navigate the Design Space Precise symbolic analyses are roughly equivalent in their treatment of loops, but all other design choices (merging at control points, feasibility checking, and function summaries) boil down to choos­ing which paths to analyze separately vs. which ones to combine into common formulae.
Sentence 2: all analyses lie along a spectrum, with search-based symbolic execution (no state merging) at one extreme and whole-program veri.cation condition genera­tion (static state merging) at the other extreme.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On average they gain 5%, with three workloads gaining more 500 0 1 450 2 3 400 350 300 Time 250 changes at different times since the applications are running independently until completion, while the parallel homoge­neous workloads synchronize before each serial section.
Sentence 2: dealII demonstrates one of the arguments in favor of dynamically adjusting to phases in the computation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our new marking algorithm replaces the tracing of the class metadata graph rooted in the object header with a traversal of the linkset graph.
Sentence 2: instead of marking the class descriptor,the collectorvisitsitslinkset.Visitingalinkset consists of marking the class loader object associated with the linkset, iterating overthelistofmirrorreference holdersofthelinkset s metaspace, andvisitingitssuccessors inthelinkset graph.Every linkset has avisited .agsthatthegarbage collector usesto prevent multiple traversals of linksets during the marking phase, and to identify unreachablelinksetsafterwards.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Iteration Vector: Given a nest of n loops, the iter­ation vector i of a certain iteration of the innermost loop represents a integer vector that includes the iteration numbers for each loop in order of nesting level.
Sentence 2: the iteration vector is given by I ={(i1,i2, ..., in)|Lboundik = ik = Uboundik } where ik, 1 = k = n, represents the iteration number of the loop at nesting level k, and each L/U bound denotes lower/upper bound of corresponding loop nest.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For a fuzzily constrained game of G =(N, S, C, R, P, p), its constrained equilibrium is the Nash equilibrium * of its induced game (N,S,{.i}i.N ).
Sentence 2: if pro.le s = * * (si ,s ) satis.es: -i ** * .si .Si,.i(si ,s-i) =.i(si,s-i), (10) * then strategy pro.le s is a constrained equilibrium of fuzzily constrained game G. IV.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For this reason, we log events not only at the kernel level,but also theframeworklevel and theVMlevel(the three boxes in Figure 4).
Sentence 2: we use SystemTap [sys]to log system calls and CPU scheduling events in the sched.switch functionin thekernel, use theloggingli­brary that comes with Android to additionally log different sensors,GPS, accelerometer,cameraaccessesattheframe­worklevel, andlogdisk/network at theDalvikVMlevel.We changedthedefault timergranularity of10 msto1ms.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To estimate at run time, we use a regression method over Equa­tion (1) and leverage the fact that most DVFS-enabled microproces­sors support a limited set of CPU frequencies to perform the regres­ nmeeoooemf sion.
Sentence 2: given nCPU frequencies }, wederivea particular value that will minimize the least-squared error: f f ps(Tm(f*a m(f*« X e mps(Tmfa mf 1 1 (2)f m By equating the .rst differential of (2) to zero, we can derive as a function of the MIPS rates and CPU frequencies, as follows: ff PeTaTa mips fm/L 1Cfm/LL 1ufiffmips CaffiL(3) PeT fm/L 1fi Once we calculate the value of using Equation (3), we can plug the value into Equation (1) and calculate the lowest CPU fre­ m quency whose predicted performance slowdown fm/L 1 fdoes not exceed the maximum possible performance slowdown 8. u Mathematically, this establishes the following relationship: 8 fmf/L 1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To assist developers in writing test code more e.ciently, we have developed an Eclipse plugin, called UnitPlus, that runs in the background and recommends test-code pieces for developers to choose (and revise when needed) to put in test oracles or test inputs.
Sentence 2: unitPlus accepts a class and related existing test suites (including the test suite that developers are working on) as inputs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, some languages like BPSL (Balanced Pattern Speci.cation Language [13] and DPDL (Design Pattern Description Language [9] provide in­struments to represent both points of view.
Sentence 2: bPSL o.ers a formalized textual description based on First Order Logic and Temporal Logic of Actions, while DPDL uses an XML-like representation of the patterns.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These are often (but not always) controlled by preprocessor flags for conditional compilation, where there can easily be thousands of them in highly configurable systems.1 At a level above this, holistic system configurations, comprised of selective compositions of flags and infrastructural nuances associated with makefiles, must be readily available as a complete perspective.
Sentence 2: it should be possible to view a precise image of the source code dictated by a specific execution environment, without extraneous concerns irrelevant to a configuration.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Currently, RPython can be used in many contexts: to develop stand-alone programs, such as the Standard Inter­preter itself; to write highly ef.cient extension modules for CPython, which could only be written in C in the past; to develop dynamic web applications without the need to write JavaScript code; to produce ef.cient libraries of classes and functions to be used by other .NET and Java programs.
Sentence 2: rPython can be the ideal companion for all those CPython, IronPython and Jython developers that so far have been forced to write the parts of their programs that need high performance in C, C# or Java.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Third, as there is no reported study on evaluating tra­ditional techniques for test-case prioritization in the time­constrained situation, it should be interesting to consider the comparison between our techniques and traditional tech­niques.
Sentence 2: we considered four traditional tech­niques for test-case prioritization [32, 11, 33, 13] with some straightforward adaptation: traditional total statement-coverage prioritization (trdtl-st-total), traditional additional statement­coverage prioritization (trdtl-st-addtl), traditional total method­coverage prioritization (trdtl-md-total), and traditional ad­ditional method-coverage prioritization (trdtl-md-addtl).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We observed that it seldom happens that the collector actually reaches an ob­ject on an active allocation cache, i.e., our designated list for postponed tracing is almost empty.
Sentence 2: in our SPECjbb2000 runs, out of millions of traced objects we saw only 18 deferred objects on average in each GC cycle (the maximal number was 287).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This can result in significant delays in event delivery.
Sentence 2: the operating system s contribution to the delay between the time an important event is generated and the time the event is received and processed by the application, which we term run queue de­ia>, can cause variations in inter-frame times for video ap­plications, and it can lead to timing violations in real-time applications like distributed multi-player games.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We may wonder whether these languages troduce implicit polymorphismand .exible bounds in types to fac­have strictly increasing power.
Sentence 2: ignoring annotations and the difference in notation between let-bindings and .-redexes, do torize all ways of obtaining type instances, there may still be some connection with intersection types [12], which we would like to they still form a strict chain of inclusions?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In a maximisation problem a solution d * is non-dominated if there exists no other d such that Q(d) = Q(d * ) for all objectives, and Q(d) <Q(d * ) for at least one objective.
Sentence 2: if there exists no other feasible deployment architecture d which would be superior in at least one quality attribute while being no worse in all other objectives of d * , then d * is said to be non-dominated.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, this has the important effect of making SemAbs (and Sem) covariant with respect to the parameter e, which would not be the case with the naïve de.nition.
Sentence 2: it is possible to de.ne a general­ized import operation for semantic terms: impSem : V{af }-a C f -Sem a -Sem f impSem Cw (Va)= V (importCwa) c impSem Cw ( f)= (, Cw' v -f (C-trans Cw Cw') v) impSem Cw (tu)= impSem Cw t impSem Cwu At a semantic abstraction, no recursive call is performed, because the body of the abstraction is opaque: it is a computational func­tion f. Instead, we exploit the transitivity of world inclusion and build a new semantic abstraction that inhabits the desired world.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The interaction between an m-section and another m-section is computed at their product area in the graph, a block of size m by The insertion lemma states that a link from au to av of length k can be divided into two shorter links.
Sentence 2: for any data element x accessed along the path, there exists an access of x such that it breaks the link into two shorter links.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.3 Reducing the Randomness of the Deferral Algorithm In this subsection, we show how to reduce the randomness needed for the deferral algorithm, while keeping it concise.
Sentence 2: we do not need O(log n) random bits associated with each defec­tive item; we can use an expected O(log n) random bits associated with a group controller instead.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The main RiPLE-DE output is the DSSA document, where structure and behavior are documented, as well as the rationale behind the design decisions and mechanisms used to achieve functional variability.
Sentence 2: the process provides guidelines to achieve functional variability through design patterns, and to assemble derived products in order to deliver the desired functionality, so it is viable to bene­.t from reuse.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As a remedy to this implementation convolution problem, we propose the method of horizontal decomposition (HD) and advocate the use of mixed-paradigms in middleware architectures.
Sentence 2: we use conventional programming paradigms to provide generality: referring to a hierarchi­cally decomposed architecture for a minimal, specialized, and commonly shared core; and we use aspect oriented pro­gramming to provide specialty: referring to domain-speci.c properties, which can be composed as aspects.
Relationship: entailment