sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: However, prior re­search [22, 24] showed that NoC power consumption can be a sig­ni.cant portion of the total chip power, making it an important tar­get for both hardware designers and software writers.
Sentence 2: scaling voltage/frequency of communication channels in an NoC * This work is supported in part by NSF Career Award #0093082, and grants from GSRC and SRC.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It should be noted that all other methods under that tool have been tried, each time with results similar to or worse than the ones from our sample.
Sentence 2: the following methods had a TPR of less than 5%: Logistic regression, AD Tree, J48 (C4.5 decision tree), LMT (Logistic Model tree), KStar, and many others.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By the identi­.cation of different business-logic layers (i.e., further struc­turing the middle tier) and/or introducing additional data access layers (i.e., identifying additional layers in the data tier), multi-tier architectures emerged.
Sentence 2: modern middleware platforms with their provision of application servers for server side components (such as J2EE and .NET) and pre-de.ned data access meth­ods through containers and standardized data access tech­niques (ODBC, JDBC, etc) support multi-tier architectures as an underlying technology.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The eu- tire analysis flow has been implemented within a prototype tooiset that we are currently using for validating and tuning the model parameters.
Sentence 2: the obtained estimates on timing fits very well actual values, for a broad range of benchnmrks with &#38; Ganssian distribution of the absolute rel- ative errors, whose magnitude is around 3-4%.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A simpli­.ed description for the sake of this paper is that if a special rotating branch brtop is taken, the rotating registers are ro­tated, that is, RRi becomes accessible as RR(i+1)%n if there are n rotating registers.
Sentence 2: brtop is the same as a regular branch br plus n copy instructions copying from RRi to RR(i+1)%n on the taken path.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In both heuristics, each node n tries to cover K times each of the topics in which it is interested.
Sentence 2: for each topic t in which n is interested, n tries to maintain connections to K other nodes that are also interested in topic t. The random and greedy coverage heuristics di.er in the way they choose the next neighbor, and are assigned di.erent coverage parameters Kg and Kr, respectively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: First, we only show two simple return collection.get(0); utility methods returning the .rst element and the last element of an } iterable object (these methods are not part of the JAVA Iterable interface).
Sentence 2: for the method last we have specialized class CLifo implements ILifo } and optimized implementations for speci.c iterable types (again, uses TLifo[hide old pop], inspired by the implementation of the Guava library).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 24-0 Given these normalized preference functions, we then de­.ned a utility function re.ecting the stakeholder s goals for optimizing the measured system qualities.
Sentence 2: the stakeholder declared that it is 10 times as important to op­timize throughput and to optimize memory usage as it is to optimize disk usage, since disk storage is becoming in­creasingly cheaper.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When making the tile selection decision the tiles, if multiple tiles have the same value of CV D (Algorithm 1) or CFT (Algorithm 3), we always select the ones that have the accesses to the banks in the memory controller with the smallest counter.
Sentence 2: by exposing the bank-to-memory controller mapping to the compiler, for each L3 miss, we .gure out the memory controller (MC) that will be accessed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.2 Context locking To implement the event model in Mace programs, transi­tions are annotated with the context in which they expect to be executed.
Sentence 2: transitions that expect to modify service state will be annotated with global, transi­tions that only read state will be annotated with anon, and transitions that are purely functional are annotated null.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This attention can be partially explained by the fact that diversity enhances and promotes the use of soft skills, such as teamwork, time management, negotiation, and presentation skills, both on the individual level and on the team level.
Sentence 2: since soft skills are implemented differently by different people (according to the individual s personality and skills) and should be implemented differently according to the specific circumstances, no one person can successfully implement them all in the myriad of possible situations encountered in the changing world.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When considering AUC value shown in Table 3, for most of projects, the methods using redundant analysis performs better than the methods only using relevance analysis.
Sentence 2: when using IB1 and NB as the classi.cation algo­rithms, the methods using redundant analysis obviously per­forms better than the methods only using relevance analysis, except for KC1 project.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Typi­cally, the selection problem is formulated to push as much compu­tation as possible onto the accelerators, while minimizing overlap between subgraphs.
Sentence 2: given a set of enumerated subgraphs, .nd the group that covers the largest portion of the DFG while min­imizing the number of nodes appearing in multiple subgraphs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A growing body of empirical research has examined large, successful open source software projects such as the Linux kernel, Apache web server, and Mozilla web browser.
Sentence 2: evidence suggests that, rather than eliciting needs from users, documenting those needs in a speci.cation, then analyzing and validating the speci.cation, open source developers frequently assert the existence of require­ments, sometimes by supplying a complete implementation [29] 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: While many e.ec­tive improvements to CMPs have been proposed, many opti­mization opportunities are lost unless speci.c characteristics of the application(s) running on the system can be leveraged.
Sentence 2: the lack of information about characteristics of a running application such as data access patterns, commu­nication behavior, memory usage, etc., typically results in a more generic but less e.cient method for utilizing on-chip caches, interconnect and coherence directories.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given any instance that is MC-schedulable upon a unit-speed processor (by Theorem 1, determining this fact is NP-hard in the strong sense), OCBP successfully schedules it in polynomial time, upon a proces­ v  sor of speed ( 5+1)/2 (i.e., 1.618).
Sentence 2: a processor speedup factor of approximately 1.618 is su.cient for OCBP to deal with the intractability (NP-hardness in the strong sense) of MC-schedulability.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The idea is simple: instead of de.ning two type arguments to be related only if they are the same, allow any two different type arguments to be related by an (almost) arbitrary relational interpretation (subject to certain admissibility constraints).
Sentence 2: we parameterize the logical relation at type t by an interpretation function ., which maps each free type variable of t to a pair of types t1' ,t2 ' together with some (admissible) relation between values of those types.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Eitherway, OPT cannotincurmuchsmallercoststhan MIG.
Sentence 2: by using MIG for moving to good locations in the network, a possible of.ine algorithm that migrates less frequently cannot have much lower access costs than MIG; on the other hand, an of.ine strategy with frequent migrations will have a cost similar to CostMIG mig.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It can be de.ned in Orc as follows.
Sentence 2: printOrc :: Show a => Orc a -> IO () printOrc p = runOrc $ do x <-p liftIO $ putStrLn ("Ans = " ++ show x) for each value x obtained from the Orc computation p, print a line displaying the answer.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To reduce .uctuations in the values of dependent vari­ables caused by randomness (e.g., the random seeds used by solvers to return a solution), we evaluated each combina­tion of the independent variables 10 times.
Sentence 2: for each subject system, we executed each of the algorithms with the same number of assigned cores 10 times, and we measured the resulting execution times.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The algorithm above, in order to compute a relation R in an equa­tion system with R = B in it, essentially tries to .nd a .xed-point by starting with interpreting R as the empty set, and in each round replacing R with its current interpretation, evaluating the remain­ing equation system, and substituting those relations in B to obtain the next interpretation of R.  The Tarski-Knaster theorem says that the above iterative algo­rithm will always converge to the least .xed-point of the relations, when all the expressions are positive.
Sentence 2: there is a smallest interpretation for each of the Ri s that satis.es all the equations in the system, and the above algorithm computes it.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A solution to this problem is to use a more expressive scoping strategy for the security aspect [30].
Sentence 2: we want to deploy the aspect in the maliciousApplication with a pervasive scoping strategy [31]: AS.deployOn(securityAspect, maliciousApplication, pervasive); In general, a scoping strategy speci.es how an aspect propagates along the call stack as well as in newly-created procedural values (objects and functions in JavaScript)5 [30, 31].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, keep in mind that by virtue of rank generalisation we perform the one-dimensional transform in parallel on all vectors of a cuboid.
Sentence 2: if we apply fft3D to a 64 × 64 × 64 cube, then fft1D still operates on 64 * 64 * 2 = 8192 complex numbers in one parallel step at the base case, where n =2.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 27 loop think; eating := true; eat; eating := false; end concurrency eating ~ left_fork ^ right_fork However, there are also a few critical differences.
Sentence 2: the abstract, descriptive assignments to eating become explicit concur- rency control statements in Linda, and more importantly, they refer to implementation details regarding the topology of forks rather than the abstract status of the computation (i.e., thinking vs. eating).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INTRODUCTION Content Distribution Networks (CDNs) have been introduced and extensively used in the Internet as effective solution for improving the performance of content delivery by means of coordinated content replication [1].
Sentence 2: a CDN manages a geographically distributed set of surrogate servers, located at the network edge, that archive copies of identical content, so that users requests can be fulfilled by the optimal surrogate servers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Lamport's fast-path code sequence also has implications for research on time complexity lower bounds [4, 5, 14].
Sentence 2: for many synchronization problems, this code se- quence implies that one cannot simply focus on contention- free program executions when trying to establish a nontrivial (i.e., nonconstant) lower bound on time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Hart and Saunders (1997) asserted that once an organization adopted EDI, it would decide to extend the use of EDI based on the degree of trust between business partners.
Sentence 2: when the degree of integration between business partners is increased, business partners can access information that was not available or accessible  3.2 Power The resource dependency theory of Pfeffer and Salanzick (1978) is also applicable to the explanation of EDI implementation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: TRUSTWORTHINESS ASSESSMENT 3.1 Unreliable Data The presence or the absence of an aPOI (as a barrier or a facility) can be evaluated by one or more sources and the system has to cope with the availability of multiple data, produced by sources with different levels of trustworthiness.
Sentence 2: starting from the whole set of reports related to a specific aPOI, mPASS has to decide if there is a barrier or a facility, what type it is and which characteristics it has got.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This observation allows .le allocations to be organised so as to achieve product-forms, facilitating simple quantitative analysis.
Sentence 2: since the number of free input probabilities is n(n - 1) - n(n - 2) = n, which is the number of inputs that do not fork, one strategy is to choose the non-forking input probabilities in any way desired, for example propor­tional to the rates of the corresponding disk drives.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The original APPLY-RULE procedure.
Sentence 2: where MEMOENTRY : (ans : AST, pos : POS) MEMO maps a rule-position pair (R, P) to a tuple consisting of the AST (or the special value FAIL1) resulting from applying R at position P, and  the position of the next character on the input stream.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: From collective experience at Cisco, using the time window (as shown in Figure 1 of Section 4) to guide scoping of the goal­setting discussions has shown to be an accurate way of viewing the team s status.
Sentence 2: cisco managers have found that using a time window for goal-setting is more advantageous than tracking failures by individual features and branches because a time window accounts for the entire team s activity (e.g.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Towards Early Emergent Property Understanding Merging Behavior Space Exploration and Model-Based Software Engineering Georg Hackenberg Technische Universität München Boltzmannstrasse 3 85748 Garching b. München, Germany hackenbe@in.tum.de ABSTRACT During early phases of complex systems engineering typi­cally many structural and behavioral aspects are unclear.
Sentence 2: when it comes to constraints on the result of interactions between distributed components (emergent properties) current software engineering approaches provide limited support.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The bottom two instead incur a preemption interval before each idletime request in a burst: (bt)+ I (BPI )+ .
Sentence 2: the top two variants are strongly work-conserving for idletime requests once state B is reached and idletime use begins, whereas the bottom two variants are always weakly work­conserving for idletime requests.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Traditionally, these have comprised wrappers around low­level system calls or higher-level calls such as system(), which is speci.ed to be as if a child process were created using fork(), and the child process invoked the sh utility using execl() (POSIX 2004).
Sentence 2: to run a command (represented as a string) by passing it off to the system shell to interpret: system("cut -d: /etc/passwd ...").
Relationship: entailment
Domain: Software and its engineering
Sentence 1: TVLA utilizes an extra unary predicate active, which indicates if an individual de.nitely exists in the universe or not, so that the structure (S) can be used as an abstraction of every structure * in S. Thus, if S is a set of 2-valued structures, then the predicate active is true for an individual o in (S) iff the equivalence class * represented by o includes at least one individual from every structure in S. Heterogeneous Abstraction Separation creates the possibility for achieving better ef.ciency by adapting the abstractions to model chosen individuals more pre­cisely and the other individuals less precisely.
Sentence 2: this can be done by: Adapting individual merging: We can make .ner distinctions between chosen individuals than for unchosen individuals, when we decide which individuals should be merged together.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Mobl has been used to develop a number of real-world applications (e.g., e-learning, podcatching, and time management).3 3http://docs.mobl-lang.org/showcase Mobl has been developed with Spoofax.
Sentence 2: its syntax and semantics as well as editor services and so on are de.ned by means of SDF and Stratego.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: )Noticethatthisrulesimply takesthediferencebetweentwosetsoftransitions.Sincea typeisrepresentedasasortedlist,thisoperationischeap.
Sentence 2: 5.2.2 Empty type elimination Inthisoptimization,weeliminatealltypesdenotingthe emptysetbeforestartingthesubtypingalgorithm.Doing soallowsthealgorithmtoshort-cutsometestslater,since itcanassumethatanytypeitencountersisnotempty.thealgorithmnowdoesnothavetogeneratetwo goalsoftheformA<:fateachapplicationoftheruleRec.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The list includes at least workflows, collaboration templates (a collection of services connected by a set of workflows), architecture, application templates (i.e., a family of related applications that can be substantiated by a variety of published services and workflows), test cases and test scripts, test evaluation results, policies (commonly used in SOC), and various social ranking.
Sentence 2: reusability potentially can cover the entire lifecycle from identification to modeling, from model analysis to simulation, from architecture to components, from automated code generation using code templates to reuse software services, from testing to verification, from monitoring to policy enforcement.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to take advantage of data abstraction, reason­ing about program modules in terms of the narrow interfaces they export to manipulate private state, we decided to in­tegrate data abstraction into the operational semantics of our source language.
Sentence 2: we avoid needing to reason about the operational semantics of many different languages by getting all the languages to agree on one axiomatic se­mantics for method calls.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Of course, the system call can still completeby returning an error,but the workerthread executingthe system call cannotbekilled prematurely whenone ofits sibling threadsiskilled within the user-level .le-system.
Sentence 2: by using non­interruptible system calls, Re-FUSE allows a user-level.le­system thread to continue to execute a system call to com­pletion even when another .le-system thread is terminated due to a crash.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Finally, DoublePlay applies ideas from research on using spec­ulation to run applications in parallel, such as thread-level spec­ulation [29, 35, 37].
Sentence 2: master/Slave Speculative Par­allelization [48], Speck [26], and Fast Track [14] also use a fast execution to start multiple slow executions in parallel.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: According to its man page [11], target component resolution on these operating systems is done in a similar manner as what is done on Microsoft Windows as we discussed in Section 2.
Sentence 2: the fullpath speci.cation starting with / determines the target com­ponent directly, while the .lename speci.cation iterates through a list of prede.ned directories to .nd the .le with the speci.ed name.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.3 Kalman Filter Kalman filter (KF) can be viewed as a concept derived from the combination of Bayesian inference and OLS it results in maximum a posteriori (MAP)estimates (in the linear case).
Sentence 2: the recursive version of LS is derived from Kalman filter with an identity function describing the evolution of the system over time [12].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The transformations simply introduce auxiliary relations with necessary arguments to hold the results of combining two hypotheses at a time.
Sentence 2: we repeatedly apply the following transformations to each rule with more than two hypotheses until only rules with at most two hypotheses are left: (i) replace any two hypotheses, say Pi(Xi1, ..., Xiai ) and Pj(Xj1, ..., Xjaj ), of the rule with a new hypothesis, Q(X1, ..., Xa), where Q is a fresh relation, and Xk s are variables in the arguments of Pi or Pj that occur also in the arguments of other hypotheses or the conclusion of this rule, and (ii) add a new rule Pi(Xi1, ..., Xiai ).Pj (Xj1, ..., Xjaj ) .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The synthetic service speci.cations are created by manip­ ulating the real-world service speci.cations to validate the e.ectiveness of protocol-aware approaches in scenarios not covered by real-world examples.
Sentence 2: we validate the e.ectiveness and usage of protocol-aware approaches in cases that 1 - 1 matching (syntactical) results are correct (where only protocol-level mismatches are present).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we present an extension to our earlier work on MapReduce in Kepler to record the provenance of MapRe­duce work.ows created using the Kepler+Hadoop frame­work.
Sentence 2: we present: (i) adatamodelthat is able to capture provenance inside a MapReduce job as well as the provenance for the work.ow that submitted it; (ii) an extension to the Kepler+Hadoop architecture to record provenance using this data model on MySQL Cluster; (iii) a programming interface to query the collected information; and (iv) an evaluation of the scalability of collecting and querying this provenance information using two scenarios with di.erent characteristics.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On the other hand, the re.ection model isolates the adaptation capabilities of an application.
Sentence 2: each Service Plan re.ects an alternative service realization and its potential explicit dependenciesupon other service types (relationship depends on) as well as its implicit dependency upon the hosting platform (e.g., run-time environment type and version), which is re.ected by the service realization stereotype.
Relationship: entailment