sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: While a good and modular struc­ture of the generated skeletons according to the best practices above is desirable, the structure must not limit the media de­signer in the design of the media content.
Sentence 2: sTRUCTURING MEDIA SKELETONS two challenges need to be addressed which re­sult from the abstraction in the models: C1: A media component represents multiple artifacts.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.1.1 Special-purpose software components The boundary between the standard and the dynamic AUTO-SAR software is designed to pass through the SW-C level.
Sentence 2: aUTOSAR SW-Cs sandbox in the plug-ins, allowing them to interact with the rest of the system through standard SW-C ports, while the underlying concepts, such as the RTE, BSW and legacy ASW remain unchanged.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Several new tools have been widely adopted, but they typically focused only on the creation of code.
Sentence 2: java developers have quickly adopted Eclipse, an integrated 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: m Adaptable cache Binary ELF x86 Linux Base code maintainer Aspect developer Ex~u~ Cache administrator Cache process (host process) / Prefetching policy source Collections of aspects Preproce~ 1 Preheated C seume Advice ~td poiatcut functions Compile llnk (gcc) Compiled aspects Shan:d library (.so) ELF x86 linux Cache [/~Dyner instrumentation t Ptefetching pelicy deployed through shell commands thread(s) thread (weave -deweave) In bold : provided by/~Dyner Figure 2: Processing to ItDyner relies on a source instrumentation of the program to reduce the cost of dynamic weaving.
Sentence 2: #Dyner provides a source-level annotation hookable with which the base-program maintainer annotates the points in the pro- gram at which adaptation is allowed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a set R of procedure throw_in 0 executions, we say that apair s~ is in R, denoted s~ E R, ifa E R. We de- note by LatestR a pair in R with the highest ~ part.
Sentence 2: latestR = {s[s E R, Vs~ E R s.Z > so.G}.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Further assume, that DWCS se­lected process 1: as the next running process due to its tighter window-constraint compared to process j. ECalls event scheduler gives process j preference over process i, if this does not lead to a missed deadline for i  (i.e., At Cj  Ci > 0, where At is the remaining time in period Ti).
Sentence 2: process i will be delayed by Cj, but since its deadline will not expire, DWCS will select this process after process j has exhausted its service time Cj.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If the above formula is satis.able, there exist x and two keys (k, k ' ) such that the distribution of I(x, k, r)differs from the dis­tribution of I(x, k ' , r)by more than .qms .
Sentence 2: the secret values of k and k ' are leaked, and the amount of information leakage is more than expected.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A distance value 0 means that a fault that breaks the speci.cation is present for the input t. On the other hand, in this paper we use this distance di­rectly onthepost-condition.
Sentence 2: adistance value0 meansthat thepost-conditionistrue, sotheprogramis correctforthat particular input t. to calculate d(P, g(t)) the program g is executed with input t and then the result R is compared against the post-condition P to see whether the result is correct or not.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Assume that there exist in.nitely many primes p for which 2 is a generator of F* p. Then for each one of those in.nitely many primes the following holds: For every b = 1, there exists a multiplicative subgroup S{ of GF(2(p-1)b) {0} of size p such that the only GF(2)-linear dependence among elements of S{ is that their sum is zero.
Sentence 2: any set of (p - 1) elements of the subgroup are linearly independent over GF(2).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Opposed to the traditional application of feature models, the binding of variability results in a set of allowed opera­tions and not in a concrete product.
Sentence 2: a par­ticular feature model con.guration does not specify a par­ticular business document model variant but a set of change operations that may be applied to the generic Core Com­ponent model resulting in a valid business document model variant.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: First, we can improve PiC O Q L s usability, safety, and consistency by adapting our treatment of synchroniza­tion.
Sentence 2: to provide queries that acquire locks in the correct order, our plan is to leverage the rules of the ker­nel s lock validator [15] to establish a correct query plan at our module s respective callback function at runtime.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Three years of practical experience has revealed serious short­comings of our type system.
Sentence 2: it relied on a system of ad-hoc rules to relate combinations of predicates, it could not rea­son about subcomponents of data structures, and it could not fol­low sophisticated reasoning about the relationship among predicate tests, all of which are used in existing code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As stated in Ta­ble 2, the default memory scheduling we used so far (and the dominant scheduling algorithm in commercial chips) is FR-FCFS, which works by implementing .rst-come, .rst-served (FCFS) strategy in serving the memory requests, except when there are memory requests in the queue that target the current memory row in the row-bu.er.
Sentence 2: fR- Figure 12: Results with di.erent memory scheduling algo­rithms (normalized w.r.t FR-FCFS (with original)).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We can notice that all basic interpretations are success­fully recognized and presented to testers at the top of the ranking, with few exceptions regarding the delete interpreta­tions.
Sentence 2: for 2 out of the 36 cases related to the delete interpretation, AVA classi.es replacement as a bet­ter description of the di.erences than delete.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this context, we integrate the notion of net utility in the pricing model that has been presented in [10].
Sentence 2: the monetary cost of the Web content provider under a CDN infrastructure is determined by the following equation: UCDN = V (X)+ t (N) × X - Co - P (u) (3) where UCDN is the .nal cost of Web content provider un­der a CDN infrastructure, V (X) is the bene.t of the con­tent provider by responding to the whole request volume X, t (N) is the bene.t per request from faster content delivery through a geographically distributed set of N CDN surro­gate servers, Co is cost of outsourcing content delivery, P (u) is the usage-based pricing function, and u is the CDN util­ity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Even though time-lines induce a total ordering of arrowMSGs among the entire PSC,a designer can also specify a strict and/or partial ordering of arrowMSGs by using constraints on the message and operators that we shall de.ne later.
Sentence 2: furthermore, let m be a message on a time-line ti,were­fer to ti as the present of m, the temporal space from ti-1 to ti as the past of mand the temporal space from ti to ti+1 as the future of m. in order to well de.ne the past (future ) for the message at the line t1 (tn), we implic­itly assume the presence of a time-line t0 (tn+1)that has no message.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More speci.cally, we choose a bounded clock X = (cherry(a, K ),f)with a = n and K =(2.n - 1)(diam(g)+ 1)+2 and we de.ne privilegedv = (rv =2.n+2.diam(g).idv).
Sentence 2: note that we have : privilegedv0 = (rv0 =2.n) and privilegedvn-1 = (rvn-1 =(2.n - 2)(diam(g)+1) +2).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We consider two values to have the same shape if in their respec­tive tree representations, their constructors at each node in the tree match, ignoring all opaque types (Section 4.2.2).
Sentence 2: for values a and b, subVals a == subVals b Furthermore, indexes that have been universally generalized (and all their children) match any value, since a universally generalized index indicates that counterexamples have been found for any pos­sible constructor.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Framework Implementation The requirements for .exibility, rapid development, and the need to incorporate data management into the framework services guided our decision to choose a scripting-based ap­proach to the implementation of the framework, framework services, and component adapters.
Sentence 2: we opted to implement those aspects in Python, making use of its strong built in support for .le operations, dynamic object manage­ment, and high level of abstraction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, in addition to those binding time assignments we observed in our case study the need for richer constructs to concisely specify the staged con.guration semantics of a DSPL.
Sentence 2: the DCU DSPL incorporates 1. features/attributes with multiple possible binding times dynamically decided and restricted during application engineering and 2. complex constraints between feature/attribute con.g­  uration choices and binding times.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: POLYD PolyD is a pure Java tool that, using dynamic bytecode gener­ation, allows the user to de.ne customized dispatching policies, altering many aspects of message dispatching that are usually pre­determined and that cannot be easily changed.
Sentence 2: using PolyD it is possible to de.ne a set of meth­ods and invoke them according to user-de.ned criteria.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: OTHER OUTSOURCING PROBLEMS While the protocols of the previous section are speci.­cally for matrix multiplication the protocol can easily be adapted to scenarios where the function being computed is any arithmetic circuit having multiplication depth 1.
Sentence 2: the only multiplications that are performed are between inputs to the protocols (i.e., we do not multiply interme­diate results).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Theperspectiveofa .xed uniformdistribution,inwhich onebit ofinputdata always carries afullbit ofinformation,has anintuitive appeal:forinstance,in thedivision example,itistempting to argue that .nding out that a 32-bit input has all bits zero should always count asdiscovering32bits ofinformation.However, webelieveit is ultimatelyless usefulbecause itis tied to aparticulardata repre­sentation,that oftheinputstotheprogrambeing analyzed.By con­trast, channel capacity abstracts away from a particular represen­tation to more abstractly characterize the computation a program performs.
Sentence 2: channel capacity can be more naturally be approximated compositionally, as ourgraph-based analysisdoes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Future experiments: it would be useful to do more com­Algorithm    Joblib   Markowitz 8.5MB 1.2MB Fama French 1.6MB 0.42MB SVD 2.7GB 2.7GB Events 2.7GB 2.7GB Table 1: Memoization Space Required for Experi­ments (events is only for 12 months) parisons for intraday calculation.
Sentence 2: intraday data is often messy and has missing data, and requires data cleaning scripts that .ll data forward and backwards: us­ing real rather than synthetic data and seeing how avoiding repeated data cleaning saves computation time would be a good use case.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The subtle dif.culty in such formulation is to avoid buffercon.icts using linear constraints, because two con.icting bufferscan be allocated in either order in the shared buffer.
Sentence 2: formulation of the OR logic is non-trivial, since a buffer can beallocated either before or after another con.icting buffer as long asthere is no violations of the stated guidelines.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1-2 2-3 3-4 4-5 5-6 6-7 7-8 8-9 9-10 Move Method 14 10 49 0 3 11 1 1 2 Move Field 6 45 79 1 1 3 0 0 0 Rename Method 19 15 71 6 16 21 1 2 16 Rename Field 31 22 37 0 2 5 1 1 10 Total 70 92 336 7 22 40 3 4 28 The data from Table 2 would seem to suggest a relationship between the four refactorings.
Sentence 2: relatively large numbers of these four refactorings are carried out in each version.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The de.nition of needsDisplayUpdate is a simple translation of its description: needsDisplayUpdate (M) .typeDecl ( DC, Display , , ), methodDecl(Repaint , repaint , DC, , ), mayRead(Repaint,F),mayWrite(M,F).
Sentence 2: m needs a display update if there exists a .eld F which may be read by the repaint method of the Display class.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our earlier work, we proposed a search-based approach for testing an individual controller con.guration [20, 21].
Sentence 2: we .xed the values for con.guration parameters based on those used during HiL testing, and developed search algorithms maximizing Fst, Fsm and Fr within an input search space with two dimensions: ID and FD.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, we provide a reduction technique to e.ciently compute interpolants in many theories of practical inter­est that can use existing interpolating theorem provers as black boxes.
Sentence 2: using the reduction approach for compiling various quanti.er-free theories for complex data structures to the combination theory of equality with unin­terpreted functions and the theory of linear arithmetic pro­posedin[19], we show that from an interpolant in the re­duced theory, one can construct an interpolant in the origi­nal theory.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This suggests that an effective underlying infrastructure used in the development, deployment, and execution of these ap­plications has to be generic enough for use in multiple application domains, and flexible enough to offer easy customization for specific application requirements and heterogeneous operating environments.
Sentence 2: the distributed systems deployed using WSNs require a shared application substrate in the form of a middleware platform [5].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, if every pair of overloaded de.nitions satis.es one of these rules, then no ambiguous calls are possible.
Sentence 2: if S is the set of overloaded method de.nitions provided by type X for method f , then S is a valid overloading if each pair of distinct de.nitions in S satis.es the subtype rule, the exclusion rule, or the meet rule with S, as de.ned below.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 10 10 10 4 5 40 6 5.71 4 5 40 6 5.72 4 5 40 6 5.90 8 8 8 4 5 34 6 5.58 4 5 34 6 5.41 4 5 34 6 5.35 C. Add Associations To determine R ' two steps need to be performed.
Sentence 2: the .rst step involves the addition of association due to references by association ends that have been deduced and are stored in D. whenever an association end is in D, then the respective association is added to R ' (Line 22).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If the subscript of a reference to a global array is in an af.ne form of the global ID, work-group ID, and local ID of the work­item that accesses the array, then the address of the array reference can be computed with the value of the pointer to the global array and an af.ne function of the global ID, work-group ID, and local ID of the work-item.
Sentence 2: the address of the array reference is an af.ne function of the global ID, work-group ID, and local ID.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As an application of the setup, we show how to relate several models of backtracking search, based on solution streams, suc­cess/failure continuations, and decision trees.
Sentence 2: we gen­eralize the main resultofWand andVaillancourt (2004), which re­lates the former two models in the special case where the underly­ing effect is just partiality.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, CrowdLearner goes beyond prior work by making sense of collected mobile sensor data and user labeling, and employing machine learning techniques to automatically generate recognizers for high-level events and user actions.
Sentence 2: crowdLearner s data collection mechanisms and interfaces were designed for capturing mobile on-device sensor data and facilitating mobile user labeling, which are not de­signed for general mobile data collection purposes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More precisely, it uses a Perl script to match speci.c patterns of assembly code and to rewrite them to better-optimised assembly code.
Sentence 2: this script is of course heavily dependent on the target architecture and also on the speci.c version of GNU C. it rearranges code blocks to implement the tables-next-to-code scheme of GHC, which we will discuss on more detail in Section 3.5.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: [12] pointed out this prevents aspects from becoming fragile by removing the power to ad­vise fragile points, which might be sometimes inevitable [20].
Sentence 2: the pointcut fragility problem cannot be easily solved, but it can be made less severe as in [12] where the Java language is extended with a new construct (the explicit join point ) that an extended AspectJ can then hook.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to compensate for this behavior appropriately and in order to control the overall behavior according to the general requirements, the developer therefore not only has to provide the logical information of the code itself, but also of the tasks within the cloud.
Sentence 2: he has to provide the code logic and the behavioural logic in terms of how the tasks / instances replicate, relocate, scale down etc.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To detect this, we analyze the return addresses of invoked interface calls, which are stored on the top of the stack.
Sentence 2: suppose that we instrument an interface call entry f of a component C. In this case, we log f only if the return address of f is not part of the memory space corresponding to C. Based on this approach, we can precisely detect invocations of the interface calls to target components at runtime.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The Squawk Debug Architecture This split architecture allows many of the memory-consuming components of a Java Platform Debugger Architecture (JPDA)­compliant debugging environment to be located on the develop­ment workstation instead of in Squawk, reducing memory over­head.
Sentence 2: the debug proxy on the workstation has access to the original class .les that went into the suites on the device, so it has access to line number tables and method, .eld, and local variable names that may have been stripped from the suites.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this study, we present the results for two contest cat­egories: Highest Tolerance and Highest Image Quality.
Sentence 2: we use the di.erence of pairwise discrete cosine transform (DCT) coe.cients and an error-correcting code (ECC) to satisfy the requirements of the Information Hid­ing and its Criteria for evaluation (IHC) criteria, which both require coding tolerance and cropping tolerance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In con­trast, the recently developed Lyapunov optimization frame­work [9, 26] is shown to enable the design of online control algorithms for such constrained optimization of time-varying systems without requiring a priori knowledge of the future workload and costs.
Sentence 2: our above two-timescale power delivery model .ts well the two-stage Lyapunov op­timization framework [39], that enables us to perform two levels of control strategies at two levels of time granularity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The purpose of such multi-tenancy is to service requests from multiple tenants of a cluster, with specific goals that include fairness to the different applications being run, meeting real-time deadlines, and high throughput.
Sentence 2: given the diverse goals of multi-tenancy  or GPU hyperthreading articulated above, we propose and develop flexible software, rather than hardware, methods for GPU sharing.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Because A cannot distinguish between G and T , we conclude that if we apply A to G, each node must produce the same output.
Sentence 2: if A .nds a maximal edge packing, it must produce the solution y(e) =1/3 for each edge e. None of this holds in the port-numbering model, as the port num­bers may be used to break symmetry for example, a prior algorithm [2] never sets y(e)=1/3 in any graph.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A.2 CFL-Reachability The CFL-reachability problem is to determine whether there is an S -path from node u to v in G, where S is the start symbol of the given CFG.
Sentence 2: the CFL-reachability problem has four variants: (1) The all-pairs S -path problem: For every pair of nodes u and v, is there an S -path in G from u to v?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, it aims to share the same web page, so it doesn t allocate di.erent parts of the same content to di.erent devices.
Sentence 2: for example, it can not allocate video content to device A, audio con­tent to to device B, while control input is made on device C. it can not synchronize di.erent content components Figure 2: Existing Framework allocated to di.erent devices.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our technique exploits the fact that a large num­ber of execution traces may contain various runtime behav­iors with both good and bad performance.
Sentence 2: our technique de.nes two contrast classes over execution traces as a fast class and a slow class based on thresholds of exe­cution time (usually speci.ed by developers as the expecta­tions on performance).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Boadilla del Monte, 28660 Madrid, Spain lauraelena.carvajal@upm.es ABSTRACT This doctoral thesis addresses the difficulties associated with building usable software.
Sentence 2: it deals with the open problem of providing users with artifacts that enable them to design and implement usability mechanisms, focusing on those that have high implications on software functionality.
Relationship: entailment