sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: of Computer Science and Engineering Intel Corporation UniversityofWashington Santa Clara,CA 95054 Seattle,WA98195 {tatiana.shpeisman,vijay.s.menon,ali-reza.adl-tabatabai,rick.hudson,bratin.saha}@intel.com {alaska,djg,kfm}@cs.washington.edu Abstract Transactional memory provides a new concurrencycontrol mech­anism that avoids manyof the pitfalls of lock-based synchroniza­tion.
Sentence 2: x10: an object-oriented approach to non-uniform cluster computing.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 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 madeordistributedforpro.t or commercial advantage and that copies bearthisnoticeand thefull citation onthe .rstpage.Tocopy otherwise,to republish, topost on servers or to redistribute tolists, requiresprior speci.c permissionand/or afee.
Sentence 2: when the systems under test are usedby communities, the entire com­munity cande.nethetestinggoals and algorithms, and can share the e.ort and fruits of executing those algorithms.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: d o t P r o d ( vP ) ) 5 .s c a l e ( 1 -a l p h a) .
Sentence 2: these optimizations did not apply to the more general scenarios (non-rectangular regions) and even with local type inference and aggressive method inlining were vulnerable to loss of static type information across method boundaries due to the complexity of specifying the necessary constraints.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For non-tail calls only, the trace wrapper sets the trace continuation to the new current continuation before applying the embedded procedure and restores the old trace continuation after.
Sentence 2: the compiler eliminates the proedure?check, replaces the closure indirect with a jump into the lambdabody (past the argument-count check or directly into the appropriate ase-lambdabody), passes a closure pointer only if the procedure has free variables, and, for rest arguments, allocates the list at the call site where the num­ber of arguments is known and no loop is needed.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In general, we found that the ratio between execution time and turnaround time for the jobs in the community grid varies between 0.01 to 1, with the average at 0.3 (as opposed to 1 for collaborative grids).
Sentence 2: observe that the number of replicas generated in this experiment is larger than the number of replicas in the one involving only col­laborative grids, even by the restrictive policies.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: At this point, the de­signer can simulate the system in software to prove correct­ness.
Sentence 2: while signi.cant work has been done in the areas of logic veri.cation and distributed debugging, 1 This assumes an inherent limitation in the amount of instruction-level parallelism that can be exploited, which is a more advanced topic of computer architecture.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We de.ne a mismatch as any code region that is in a clone cluster (as de.ned by exact matching of feature vectors) but has a di.erent normalized instruction sequence from the plurality of code regions in that cluster; this metric is simply counting all mismatched clone pairs (as de.ned in Section 3.3.1) between each clone within the cluster and a single element having the plurality instruction sequence.
Sentence 2: the ability to detect binary clones is important because source code is not always available, for example, in the case of commercial o. the shelf (COTS) software.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: So, while we can use the sample points pk(h) to estimate EG,h[Xk], there is no obvious way to go from that to P our target quantity EG[F0(S)] = G Pr[G] · F0(G).
Sentence 2: 16 16 For the cumulant based approach, we have the vectors 7 59 145 -337 K1 = [ 1 , ], K2 = [ 1 , ], K3 = [0, ], K4 = [ -1 , ].
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Related Work A related approach proposes [14] Feature Oriented Refactoring (FOR), which is the process of decomposing a program, usually legacy, into features.
Sentence 2: 5.2 SPL Refactoring We apply program and FM refactorings for achieving those goals using our extended de.nition for SPLs presented in Section 2.2.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Yet, quite good accuracies are achieved if the raw measurement values are post-processed with elaborate techniques like noise cancelling, digital filtering, peak detection and calibration [19].
Sentence 2: categories and Subject Descriptors C.2.4 [Distributed Systems]: Distributed applications General Terms Measurement, Experimentation, Algorithms, Theory Keywords Localization, Distance Estimation, Transmission Power, Wireless Sensor Networks 1.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: That is, it must either be null or its data .eld must be equal to d.The set of all ob­jects satisfying either of these conditions is encoded by the relational expression (null + data.d).
Sentence 2: ¯ F(if (c) S1 else S2, (Eu , Eo))= F¯(S1, (Eu , Eo)) UF¯(S2, (Eu , Eo)) Loops: Loops are abstracted by successively abstracting the body and joining each new abstraction with the abstrac­tion of previous iterations.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Unintentionally, we joined the principle of COMMAND and STRATEGY patterns [Gamma et al.
Sentence 2: the most disadvantages of this design pattern are: ) A hard design that needs a lot of classes; a FSM with n states and m events, we need (n+m) classes to design all events and states in addition to the classes Context, Event and State; even if extending the abstract class State is not necessary in some situations. )
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Mechanism:thisstructureincludeselementsfromDiSEN-CSE(DiSEN-ContextSensitiveEnvironment)modelproposedby[14].Thismodelaimstointegratetheessentialelementstocontextawarenessinordertoallowthesharingofcontextualinformationamongdifferentworkspacesinvolvedincooperativework.So,thisstructureincludes:(i)CaptureSupport:itisresponsibleforrecognizingthechangesthatoccurinthecontextoftheartifactandcapturetheinformationrelatedtoitscurrentcontextthroughtheeventsintheWorkspaceandintheSharedRepository;(ii)ContextRepresentation:itisresponsibleforreceivingcontextualinformationcapturedonthesoftwareartifacts,representtheminaformalmodelbasedonanontology OntoDiSENv1[15],andrelatethemwiththeothercontextualinformationavailableintheContextRepository.ThecontextrepresentationforsoftwareartifactsisdiscussedinSection5.3;(iii)ProcessingSupport:itisresponsiblefordeductingimplicitcontextualinformationaboutcapturedinformationonsoftwareartifactsbasedonrelationshipsamongthesetsofinformationcreatedbytheContextRepresentation.Theprocessingofcontextualinformationisdonebymechanismproposedin[16];(iv)Tracking:itisresponsibleforgeneratingdependencyrelationshipsamongsoftwareartifactsresultingintraceabilitylinksamongthem.TraceabilityamongsoftwareartifactsisdiscussedinSection5.4;and(v)AwarenessMechanism:itisresponsiblefordisseminatingcontextualinformationaboutsoftwareartifactsfordifferentinstancesoftheworkspacethroughthedisplaymethoddefinedintheVisualComponentstructure.
Sentence 2: artifactContext:itisasetofinformation,consistingofseveralcontextualelementsthatcharacterizetheartifactandsupportingtheindividualinperformingthetasks.Theartifactcontextisgeneratedfromtheactionsperformedbyindividualonthesoftwareartifactandfromstructuralrelationsofit.Table2presentstheartifactcontextconstitutedbyitscontextualelementsanditsrespectivedescription.TheartifactcontextsupportstheinterpretationofawarenesselementspreviouslypresentedintheTable1.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For the UA to be proper, the af.ne form cor­responding to the original constraint aj x + bj should be express­ible as a positive sum of the replacement TVPI vectors: aj,1x1 + j j j,1 j,2 j j j,1 aj,2x2 +aj,3x3 +bj = .0 +.
Sentence 2: it will be seen in Sections 7.1 that for practical purposes, s is a small constant (little more than 4) and relatively independent of n. TVPI-UA For a system described as above, each of the TVPI-UA methods (given in Sections 4.1 and 4.2) replace a non-TVPI () 1aj 1 constraint aj with the same number of 2 = Jaj J(Jaj J-1)/2 TVPI constraints.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For example, a logistics agent may be responsible for delivering multiple products to a warehouse from sites across a country; it may produce a plan that involves using one truck to do all deliv­eries, which includes a route plan with time windows for the truck.
Sentence 2: advertisements for speci.c tasks (in this scenario, these are transport tasks) are issued and agents as representatives of companies respond to these ad­vertisements.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This analysis revealed that most of the memory-bandwidth induced throttling was occur­ring in GC functions thus pointing at our original GC (call it JGC, a block-based, stop-the-world mark-sweep-compact GC heavily in­.uenced by [13, 14] that was originally optimized for Java and rel­atively low numbers of threads) as a target for replacement.
Sentence 2: in ISMM 09: Proceed­ings of the 2009 international symposium on Memory management, pages 59 68, New York, NY, USA, 2009.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: LEARNING FEATURES As we highlighted earlier, in Section 2, the choice of which fea­tures to map a security witness to has important bearing on the overall quality of the .ltering algorithm.
Sentence 2: the bar graphs in Figures 5 and 6 depict precision and recall information for the different classi.ers, again given 100 and 200 classi.ed instances respectively.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: By Lemma 3.6, gv(S) returns a consistent vector.
Sentence 2: the time complexity of a snapshot implementation is the maximum number of steps taken by any process for the execution of a SCAN or an UPDATE.In an n-process snap­shot implementation from single-writer registers, the time complexity of SCAN is O(n)since all n registers must be read.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Other food-related ontologies include LanguaL [6], an international framework for food description originally developed by the Center for Food Safety and Applied Nutrition (CFSAN) under the United States Food and Drug Administration (FDA), and the FAO-related INFOODS Guidelines for Describing Foods [9] is a systematic approach to describing foods, designed to facilitate international exchange of food composition data.
Sentence 2: this autonomy has the potential of compromising information privacy or effecting severe damage to operations (e.g., through buggy or malicious code).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 5.4 Discussion and micro-architectural suggestions For experimental results in this section, it would be desirable to have some potential or upper-bound DVFS numbers, and show how far our results are from these upper-bound numbers.
Sentence 2: like k0 in (3), k1 and k2 in the above are constant coef.cients which depend on machine con.gurations and can be estimated empirically and reset at the installation time of a dynamic compiler.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Typechecking and modules for mul­timethods.
Sentence 2: iTC on RectMod fails, because the global-default re­quirement is not satis.ed for its external function print.If print had a case with, for example, pattern (Shape {}), then the require­ment would be satis.ed and the completeness problem for Circle would be avoided.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Here we consider some possible encodings.We can attempttoexpress parallel conjunction in terms of parallel choice using the following strategy.We mark each expression with its originating position in the conjunction; aftermakingaparallel choice betweenthetwomarkedexpressions, we can determine which result to return.
Sentence 2: 7.3 Parallel Tuples For our .rst transformation, we revisit an earlier example: datatype tree = Lf of int | Nd of tree * tree fun trProd (Lf i) = i | trProd (Nd (tL, tR)) = op* (|trProd1 tL, trProd1 tR|) Afuture is created for each element of the parallel tuple, except the .rst.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For exam­ple, while the KVM memory system does allow the use of large preallocated pages via the HugeTLBfs mechanism, it contains other features such as a single lock on the VM s memory management layer requiring that operations in the nested page fault handler be serialized.
Sentence 2: we analyzed the be­havior of each VMMs virtualized memory architecture.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Transformations in Stratego are written in a language speci.c to the Stratego system and different from the source language being transformed, unlike Honu or other macro languages.
Sentence 2: iNTRODUCTION An extensible programming language accommodates additions to the language without requiring those additions to be adopted by a standardization committee, approved by a core set of implemen­tors, or imposed on all users of the language.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The NSA in particular triggered a .urry of research after some initial enthusiasm [9], which however was soon replaced by skepticism about its compu­tational cost [15, 28] and generalization capabilities, lead­ing to its demise in the .eld of AIS.
Sentence 2: no other jobs were run on the machine at the same time such that cores were close to 100% occupied by the experiments.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Anewinstanceof acomponentisonly created the .rsttimeit was added to the form.
Sentence 2: these restrictions col­lide with several code transformations performed by the AspectJ weaver[8].HotWave1reliesonseveral workaroundsinorderto support at least part of the features of AspectJ, such as static joinpointinstances[23,24].HotWave1supports neither around() advice nor static cross-cutting(i.e., aspectsthatperform structural modi.cationsof classes,such asinserting extra .elds).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Recalling the three major costs paid to enjoy multithreading benefits, one can see that with JADE model thread creation and deletion happens rarely, because agents are rather long lived software objects.
Sentence 2: when a behaviour must be executed, the guard is checked; if it is true, the body and the transition are executed in sequence, else another behaviour is executed and this behaviour is blocked until the guard becomes true.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 3.3 A Device Aware Log Block FTL Scheme As the capacity of SSD rapidly increases, memory requirement for the address mapping table is a burden to FTL schemes.
Sentence 2: we examined the error rate of different striping group size as a function of P/E cycles and ensure the same level of reliability with RAID-5 for the entire lifetime of flash devices with minimum space overhead.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Then, to make experimentations on the designed object, a program of the conceptual design of inner behaviors is indispensable to avoid real experimentations on the given object by allowing simulations (virtual experimentations).
Sentence 2: categories and Subject Descriptors: D.1.5 [Object-oriented Programming] General Terms: Design, Verifcation Additional Key Words and Phrases: Design patterns, STAT E pattern, fnite state machines, maintainability 1.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Table 6: Fault slip through to customer Should to Did detect Percentage found by Customer Rev 15.27 BT 63.88 FT 6.94 ST 11.11 CST 1.85 FOA 0.00 Customer 0.92 Looking at the problems found by the customer (as shown in Table 6) we can see that a high percentage of slip through is from Basic testing and Reviews.
Sentence 2: the practitioners suggested to use TTCN for FT only as it has following strengths: Ability to test multiple protocols: is a major strength of TTCN over other testing frameworks.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Experimental Results In order to evaluate the relative costs of universal and sparse labeling, we developed three different language implemen­tations.
Sentence 2: let y = ref true in let z = ref true in if x then y := false else skip; if !y then z := false else skip; !z When this function is applied to con.dential boolean data, the rule [U-ASSIGN-BAD] permits both of the following eval­uations: Ø, Ø, (f trueH ) .L [ay := falseH ,az := trueL], trueL Ø, Ø, (f falseH ) .L [ay := trueL,az := falseL], falseL the function f leaks the value of its con.dential argu­ment (labeled with H) into its public result (labeled with L).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: SODA: An Optimizing Scheduler for Large-scale Stream-based Distributed Computer Systems.
Sentence 2: without an ef.cient work.ow management system, it may result in uneven computation loads among different work.ow processing resources, and in the pathological case, it could cause signi.cant delays in delivering key scienti.c results for the stragglers.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Applying Fixed Priority Scheduling in Practice Raimondas Lencevicius, Alexander Ran Nokia Research Center 5 Wayside Road, Burlington, MA 01803, USA Raimondas.Lencevicius@nokia.com Alexander.Ran@nokia.com Categories and Subject Descriptors D.4.1 [Process Management]: Scheduling.D.4.8 [Performance].
Sentence 2: when we tried to apply this research in our real-world situation, we discovered a number of problems described below.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In the following subsections, we address this and a few other implementation issues.
Sentence 2: for INT benchmarks, the initial profile obtained with a retranslation threshold of 2000 has the similar prediction accuracy to that by the training input, while for FP benchmarks, the initial profile with a retranslation threshold of 500 is sufficient to achieve the similar prediction accuracy by the training input.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The simplest is to use a .xed time interval (e.g., 200ms) for each lease.
Sentence 2: our experimental prototype, IndexFS, has demonstrated a .fty percent to two orders of magnitude improvement in the metadata performance over several cluster .le systems including PVFS, HDFS, Lustre, and Panasas s PanFS.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Schobbens, P. Heymans, J.-C. Trigaux, and Y. Bontemps.
Sentence 2: calculat­ing the minimal unsatis.able core for propositional logic is hard; it is a coNP problem, and hence, only heuristics-based approaches have been e.ective to deal with it [13].
Relationship: neutral
Domain: Software and its engineering
Sentence 1: NeedFeed: Taming Change Noti.cations by Modeling Code Relevance Rohan PadhyeSenthil Mani Vibha Singhal SinhaIBM Research India IBM Research India IBM Research India ropadhye@in.ibm.com sentmani@in.ibm.com vibha.sinha@in.ibm.com ABSTRACT Most software development tools allow developers to subscribe to noti.cations about code checked-in by their team members in order to review changes to artifacts that they are responsible for.
Sentence 2: developers who join the project late thus receive noti.cations  Figure 2: Precision, recall and F-Score of change-set relevance prediction at .le-level.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: To the best of our knowledge, none of the existing models can give as accu­rate results as ours with a comparable prediction overhead and we believe that our service is unique in terms of the input requirements, and the practical results it produces.
Sentence 2: an optimization technique not relying on historical data in this case must not cause overhead of gathering instant data that is larger than the speed up gained with multiple streams for a par­ticular data size.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Lean is a philoso­phy based on maximizing value and minimizing waste in the manufacturing process, where it has been successfully ap­plied [2].
Sentence 2: the combi­nation of the two approaches provides the following bene­.ts: (i) SPLs improve time-to-market, products quality and customer satisfaction building .exible and reusable software systems by maintaining the basis and adding new features to accomplish market needs; (ii) applying VSM, waste is going to be detected and removed in the production .ow so time­to-market will be reduced.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This idea has been implemented in tools like DART [14] and CUTE [31], and is also applied in Microsoft s parametrized unit testing tool PEX [33] or the object-oriented testing framework Sym­stra [39].
Sentence 2: these test cases, however, only check whether the day, month, and year are set correctly, which misses the fact that comparison between LocalDate objects compare the ac­tual value of iLocalMillis.if we mutate the  Figure 3: The µtest process: Mutation analysis, unit partitioning, test generation, oracle generation.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: As part of that, it performs, at compile time, folds over the arguments of the constructors, but the results of those folds are not simply returned.
Sentence 2: we show that, with appropriate library primitives, generic programming in Template Haskell can be as concise as in other generic-programming systems while maintaining the perfor­mance of handwritten code.We have implemented these primitives in the Template Your Boilerplate (TYB) library, which is available at http://hackage.haskell.org/package/TYB.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: If compared with some previous works [12] (where more than 10000 lines of code had to be written), these results represent a consid­erable improvement, and enable easier experimentation with novel P2P streaming approaches.
Sentence 2: in alternative if the application is based on a pull protocol, it has to select a set of chunks to be requested to a neigh­bour, and a neighbour to which the chunks are requested: Two scheduling functions are still needed, but they work in a di.erent way respect to the push schedulers.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: T (t) is the smallest set satisfying: (1) (I(t), G11(I(t), I(t))) .T (t) (2) (t, b) .T (t)=.
Sentence 2: recently, we have implemented an au­tomatic unit checker that is based on the automatic infer­ence of header information based on di.erent aspects of the spatial layout of spreadsheets [1].
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Also, we give a MDE-based model transformation method to solve, to some degree, the problems and deficiencies existing in SysML SMD.
Sentence 2: a SysML SMD model TS.xmi, conforming to its metamodel SMD.ecore, is here transformed into a Uppaal model TS out.xmi which conforms to its meta-model Uppaal.ecore.
Relationship: neutral