sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: To do this, we extended the rep­resentation of classes so that each class has two method dictionary pointers that by default both point to the ordi­nary method dictionary.
Sentence 2: if the programmer tells the class to integrate the default encapsulation policy, the second pointer points to the integrated method dictionary, which is a method dictionary that maps all the selectors (including superclass selectors) that are declared as callable by the default policy to the corresponding method.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 3.2 Macrosfor DeploymentTimeValues ThecurrentOVFdescriptorspeci.cation supportsmecha­nismstocustomizeserviceswithparameters thatareknown previous to deployment.
Sentence 2: in a cloud environment it is required to de.ne certain features of the service that depend on magnitudes that are only known at deployment time.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The e.ectiveness of the approach depends on a number of application-speci.c conditions, as discussed in the previous sections.
Sentence 2: we performed a number of tests in a live setting to provide some useful insight on the general       Program Training Set Test Set Anomalous Attacks False Failed Benign Requests Positives Requests phPay 2,530 371 21 10 11 1 myBloggie 3,247 488 28 20 8 0 punBB 1,292 422 16 10 6 1 Table 3: Live experiment results.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Also,everykeyword fromtheJava contextisakeywordin aspect context.
Sentence 2: "after" | ... |"proceed" -> Keyword[[AspectCtx] Keyword[[JavaCtx]] -> Keyword[[AspectCtx] proceed is nowa reservedkeywordin aspect declara­tions,soitisnolongerallowedasthe nameofamethodinvocation, which now rejects the special proceed call for invoking the orig­inal operation in an around advice.To reintroduce the proceed call, we need to allow it explicitly as a method speci.er in the aspect context (note that an advice context would be useful here, though that would not be compatible with abc, which is the whole point of this exercise).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Type safety, for example, is not of the same paramount importance, because Python is already safe an error in the guarded cast implemen­tation may cause unexpected behavior, but it will not lead to a seg­mentation fault any more than it would have if the program was run without types.
Sentence 2: by developing our system in this manner we cannot constrain the behavior of Python programs except through our casts.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In the same vein as Rio, the Conquest .le system [24] used battery-backed DRAM to store small .les and metadata as a way of transitioning from disk to persistent RAM.
Sentence 2: bPFS is designed to store both small and large .les in BPRAM, and it uses the properties of BPRAM to achieve strong consistency and safety guarantees.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: those relying on dynamic libraries).
Sentence 2: we can write essentially the same code using the runtime concept idiom: // with runtime concept idiom wrapper forward random elem(wrapper forward f, wrapper forward l) { wrapper forward::di.erence type dist = distance(f, l); return advance(f, rand() % dist); }// ... int elem = *random elem(v.begin(), v.end()); // v is a vector of int here the binding between the iterator type and the function is handled at runtime and we can compile a use of random elem with only the declarations of random elem available: // with runtime concept idiom: wrapper forward random elem(wrapper forward f, wrapper forward l); // ... int elem = random elem(v.begin(), v.end()); // v is a vector of int By using runtime concepts, function implementations (e.g.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: These tools allow also the validation of the system control performance by performing a hybrid simulation (continu­ous and discrete time).
Sentence 2: when designing the con­trol laws(modeling, synthesis and simulation), control en­gineers make, in most cases, the assumption that the time between the sampling of the inputs and the actuation of the outputs is zero and that inputs sampling is strictly periodic withoutvariationsof periods.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This means that an object whose remote references remain in other places must notbe collected asgarbageevenif thereis no local referencein its home place.Forexample,in caseof theexamplein Figure3, object o seems to be unnecessary after o.value is used in Line 14, and could be collected.
Sentence 2: it is possible that do long ­calculation (Line 9) stores its argument g somewhere for future use.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For instance, because of the 1:1 mapping between the LindaRMI slice, which implements the primitives in the RMI case, and RMIProcess (and the same for the thread-based implementation of the primitives and of the process de.ni­tion), one might be tempted to fold them into one feature.
Sentence 2: this would not be correct, since the implication is only one-sided: it is possible, and it makes sense to de.ne a language where processes are executed in a thread or dis­tributed using RMI and do not include the Linda primitives in this language (for instance, one might use other libraries to perform message passing).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: To allow building software that executes with the appropriate quality, model-based evaluation methods at design time [3, 9] have been proposed as a viable solution.
Sentence 2: design-time analysis cannot always provide accurate results because the information of the environment where the application will be deployed may not be completely known when applications are initially architected; and even worse, such execution environment may change continu­ously during application lifetime.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Con­sequently, the comparatively small sizes of our programs might in­troduce a bias towards an over-or underestimation of structural properties (e.g., the weighted interface size).
Sentence 2: as we com­pare projects of comparable size in our experiment, the OP mea­surement for each project would be similarly affected; effectively voiding the negative effects for the comparative analysis.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Middleware 2004 Companion CUROCO: a distributed architecture for the dynamic generation, composition and use of context in highly dynamic and heterogeneous environments* [extended version] Gorka Guardiola Muzquiz Laboratorio de Sistemas, Universidad Rey Juan Carlos Madrid, Spain paurea@lsub.org ABSTRACT The use of context is necessary for a rich interaction with the users and adaptation of the system to their needs.
Sentence 2: how to in­tegrate context with the applications and the system is yet an un­solved problem.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: We assume this is because the number of packets containing shot data represents a small percentage of all transmitted packets and so does not a.ect a player s ability to aim with precision.
Sentence 2: precision shooting is very 11 The coe.cient of determination (R2) represents the frac­ tion of variability in y that can be explained by the variabil­ ity in x.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Since this image does not associate encapsulation policies with any instances (so wrapper objects are used), these val­ues are a good indication of the performance penalty that is caused by our virtual machine modi.cations.
Sentence 2: the numbers in the third column show the slowdown that we encountered when we ran the benchmarks in an image that applies an encapsulation policy to virtually all the objects involved in the benchmarks.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: About type annotations In principle HMF does not need anyspecial rules for type annota­tions since we can type an annotation (e :: s) as an application to a typed identity function: (.
Sentence 2: (x :: s).x) e. in practice it is important to handle annotations with free variables and to prop­agate type annotation information to reduce the annotationburden.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For the larger programs, such as the Java Compiler, a reduction of 75% is signi.cant (i.e., T11-T16).
Sentence 2: 7000-8000 lines of code spread across 66 .les is still a great deal to analyze when 1 methD(){ 2 C c = null; 3 c = new C(...); .
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Our CHS technique can be combined with most of existing branch predictors including gshare predictor [14], perceptron predictor [13], OGEHL predictor [18] and TAGE predictor [19], [20].
Sentence 2: it is especially effective with smaller, simpler predictors, allowing those predictors to be competitive with more expensive and complex variants.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Note that the above formalization and theorem do ap­ply to programs containing loops or recursion, as long as all program executions terminate.
Sentence 2: in the presence of a single loop whose number of iterations depends on some unbounded input, the number of feasible program path be­comes in.nite, and exercizing all those paths (Theorem 1) will take forever.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: To obtain the average probability that the animal was in a given voxel v at some arbitrary time during the time interval [tm, tm+1), given that the voxel v is within the allowed range in the z­dimension, we calculate t xj +hx yi + hy z +h m+1 k z 1 Pm (v = V ) = f u t "t dzdydxdt .
Sentence 2: xYZ (x, y, z | ( ), ( )) ## # # W m tm xj !h yi !hy zk !h x z if the voxel v is not in the allowed range in the z­dimension, then Pv V( = ) = 0. m Next, we sum over all valid observed move steps by n!1 1 ( = ) = W P v V I m ( = ) ( ) .
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: They reported the following: 5 x A Parent Class has knowledge of its child  10 x Name Collision  1 x Incorrectly Defined Interface  14 x Missing Package Dependency  2 x Operation Signature Collision  12 x No activity to path or state  38 x Dangling Association  1 x Missing Start State  2 x Missing Stop State  6 x Dangling Class  5 x Illegal Abstract Inheritance  The first listed error might at first seem surprising.
Sentence 2: when one considers the mixed skill level of modelers, it is not uncommon.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: There are increasing e.orts for work.ows and sys­tems to work with the MapReduce programming model and the Hadoop environment including our work on a higher­level programming model for MapReduce within the Kepler Scienti.c Work.ow System.
Sentence 2: to date, provenance of MapReduce-based work.ows and its e.ects on work.ow execution performance have not been studied in depth.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: the tiled matmul code with prefetch instructions inserted assum­ing contiguous streaming access patterns -B[k][j] is identi.ed as suitable for prefetching and prefetch instructions are inserted in the innermost loop as shown.
Sentence 2: as a result of tiling, the access pattern is no longer contiguous -only J elements of array B are accessed contiguously, followed by another J elements from the next row of B.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: p[position() = -i] (r5i) Figure 1: Syntactic sugars (N5) elegant way.
Sentence 2: for instance q ::= true |false |(q) |not q |q and q |q or q |p .p we propose an extension of quali.er syntax so that minimal positional information can be expressed (i is the lexical representation for strictly positive integers), and also information on linearized content (s is the lexical represen­tation for strings).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For instance, from a runtime performance perspective, using a Java snippet in a BPEL process to invoke an EJB is faster than wrapping the EJB in a Web service and then invoking it via an activity that calls the EJB Web service.
Sentence 2: it is desirable to implement processes in a fashion that is compliant with the BPEL specification.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One might argue that, given ever increasing array sizes and loop iteration counts in array-intensive embedded applications, this data structure can be very large.
Sentence 2: this is not the case, mainly because It iterates over the data blocks (i.e., not on individ­ ual array elements), and given that data blocks can be large, the number of different vectors taken on by It (which are determined by the block iterator bounds) is not very large.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: As .gure 2 shows, the de.nition of thehigher-order function map_vec follows the same structurefor each of thefourfunctiondatatypes: 1 template  2 vector 3 map_vec(FUNCTION_DATATYPE f, vector x) { ... 5 } In allfour cases,thereisafunctiondatatypethatisparameterized over two types, and even the templateparameterlists are equal.
Sentence 2: 2 the generic solution provides a different datatype for every function(or function template).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, even though an application uses a binary tree, DDT may report it is a linked-list if all the left child pointers of the tree have NULL values due to a par­ticular data insertion pattern.
Sentence 2: our experimental analysis demonstrated no false identi.cations for this reason, and if a bi­nary tree were behaving as a linked-list, this pathological behavior would be very useful for a developer to know about.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Due to our imprecise alias analysis, lock acquisitions can only weakly update this integer .eld, which means that two threads can 4 It is possible to run Boom on the integer benchmarks by .rst extracting Boolean programs with SatAbs.
Sentence 2: satAbs is designed for sequential programs rather than concurrent ones, and the Boolean programs extracted by the version of SatAbs that was available at the time we ran our experi­ments produced poor results: the combined SatAbs+Boom procedure took 2 days and did not prove any assertions correct.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: {A, B, C, D, E}, visits regions A, D, C, E, C, B in this order has level of unsafety 2 for the rule .1 never enter region C, with w(.1) = 1 and it has level of unsafety 3 for the rule .2 region D can only be visited after visiting region E. , where w(.2) = 3.
Sentence 2: the level of unsafety of a trace visiting regions A, D, B is 0 for the former rule and remains 3 for the latter one.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The Boehm-Weisergarbage collector allows some trade­offbetween space and time consumption by modifying the GC free space divisor variable, which changes the col­lection rate.Settingthisvariableto10(itsdefaultvalueis3) reduces heap overhead to an average of 48%, at the expense of increasing the runtime overhead to 14%.
Sentence 2: these .gures cover a wide range of outcomes: grobner s space overhead drops to 77% and its runtime overhead increases to 175%, while parser s heap overhead and runtime are es­sentially unchanged.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: However, we cannot implement this in a type-safe way using MJ or CTR.
Sentence 2: consider the following attempt in MJ: class AddGetter extends X { [f] for ( F f : X.fields ) F get#f () { return super.f; } } AddGetter de.nes a method get#f() for each .eld f in type variable X. get#f denotes an identi.er that begins with the string get , followed by the identi.er matched by f.1 AddGetter is not modularly type safe we cannot guarantee that no matter what X is instantiated with, AddGetter is always well-typed!
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The initial value for the internal state must also be set.
Sentence 2: this information is not present in the OCL speci.cation, so it will be obtained from the SUT (which must be initialized before starting the test): initial_state()-> #ts { active = scheduler:get_active(), ready = scheduler:get_ready(), waiting = scheduler:get_waiting()}.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: As can be seen, when the component curves are similar (for ORFs 18srRnaa and 18srRnac), their corresponding 3d curve (Figure 3b shows similar changes as in the original signal.
Sentence 2: when two dis-similar signals are composed (18srRnaa and 18srRnab) as in Figure 3d or pro.les 18srRnab and 18sr-Rnac as shown in Figure 3e, the sharp bends and twists are apparent in the 3d curve.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: local instances, named instances), and they discuss some of the same examples as we do in section 5.
Sentence 2: they make some different choices than we do: their constraints remain limited to arguments whose type was de.ned as a type class instance and their resolution is similar to Haskell s. They do not fully unify type classes with their associated record types, so that some of the advantages we can offer are not available (e.g.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Unlike WIISARD, CodeBlue employed an ad hoc multicast routing protocol based on ADMR [13], requiring sensor nodes to maintain routing tables and link quality state throughout the net­work.
Sentence 2: the CodeBlue disaster drill study [12] demonstrated the challenges of using such complex, stateful protocols in highly dynamic environments with high mobility and poor link quality the focus of this paper is to assess the feasibility of using DTN protocols to support reliable communication in emergency responses when minimal in­frastructure is deployed.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: If a designer knows that the sorting function will be implemented in software, the designer may describe the function using the Quicksort algorithm [5].
Sentence 2: if the designer knows the function will be implemented in hardware, the designer may describe the function using Mergesort, since it can be parallelized very nicely and forms the basis of many hardware-based sorting approaches [5][17][19].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: They share the idea of searching for alternative architectural models where the problems, (possibly) emerged in the performance analysis step, are removed.
Sentence 2: moving back to the architectural model to search for alternatives may introduce high complexity in the whole process, due to the (possibly large) number of forth and back transfers be­tween software architecture and performance model, before .nding an acceptable alternative.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The SWITCH actor reads one token from the control input port,and depending on whetherthe value of the controltoken is true or false,routes the input either to theoutput portmarked T,or to the output marked F. It also produces anabsenttoken tothe other output port.
Sentence 2: itisnot guaranteed whether the execution of a BDF model is completedin a finitetime or whetherit requires a T T F2 F2 F1 Fmux F6 F1 F4 F1 F3 F3 SWITCH F2 SELECT F4 bounded memory [9].In Fig.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Formal, machine-checkable proof is widely agreed to provide the highest possible standard of evidence for believing such a system is correct.
Sentence 2: all extant theorem proving systems that have been employed in metatheory veri.­cation1 have high learning curves, and using them to verify the properties of a nontrivial system requires a great deal of effort even after the learning curve has been surmounted, because inductive theorem-proving is currently a brain-bound, not CPU-bound, pro­cess.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: # if KERNEL VERSION > 2.6.32 pinned vm BIGINT FROM pinned vm, # endif  3.7.3 When things can go wrong The virtual tables we de.ned for accessing Linux kernel s data structures are correct, use the right synchronization protocols, and can be safely combined together in queries.
Sentence 2: inappropriate virtual table de.nitions and ordering of virtual tables in queries might result in a kernel crash.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: These correspond to patterns like those out­lined in Figures 3 and 4, which illustrate how the intricate inter­play between not-may summaries and must summaries can prevent SMASH from getting stuck .
Sentence 2: sMASH does timeout on 1 check for the driver 1394diag and the reason for this (as well as all the 9 time-outs in Table 1) is that it is unable to discover the right invariant to prove the property.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Intuitively, HA M P I constructs an SMT query by unrolling the regular expression match computation over the symbolic string input.
Sentence 2: to be practical, query construction must avoid unrolling obviously false paths (in our example, the .rst alternative can never match, as every string from the template starts with a, not y), and capture sharing (in our example, the substring match for cd, the last two characters in the string template, is the same whether the outermost Kleene star in the second alternative is repeated once or twice).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Thus, for the scenario that we used to perform the valida­tion, our approach would not pay for itself, since the econ­omy of 23,8 hours is less than the time needed to con.gure the approach, which was 38 hours.
Sentence 2: it is important to observe that this result is not conclusive for a long term running experiment.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For general task system scheduled with FP on a multi­processor platform, an upper bound on the schedulable uti­ `´ m lization is + 1 , as shown in [3].
Sentence 2: no known 2 3 priority assignment allows a schedulable utilization equal to the above upper bound and no exact schedulability test is knownfor such systems.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: It also has k chil­dren, with the subtrees rooted at them being Tp1(¯x1),...,Tpk(¯xk).
Sentence 2: even for a pattern p(¯x) compatible with a DTD D,we may not be able to de.ne its inlining as the inlining of Tp(¯x),because Tp(¯x) need not conform to D. For example, if a DTD has a rule r .
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Parsing Consider arithmetic expressions in the program: let x = "2" in let y = "3 -1" in let z = x + " * " + y in eval z  The result will be 2 * 3 - 1, which is 5.
Sentence 2: we might be tempted to transform this to: let x = box 2 in let y = box (3 - 1) in let z = box ((unbox x) * (unbox y)) in run z  the evaled expression then becomes 2 * (3 - 1), which is 4.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Take Figure 1(a) as an ex­ample, assume op is unknown (denoted as 1 bx), logic sim­ulation will generate inaccurate reachability report due to X­pessimism [4].
Sentence 2: symbolic simulation re­places sum, a, b, op with symbols ssum, sa, sb, sop, respectively.
Relationship: contrasting