sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: We have taken this safer option intentionally as reflective operations play a fundamental role during translation to/from SQL.
Sentence 2: public abstract aspect DatabaseAccess { private static Connection dbconnection; I private static string dbURL; ~abstract pointcut establishconnectionO; abstract pointcut closeconnectionO;  [public abstract string getOatabaseuRLO; I public abstract string getOriverNameO; pointcut traplnstantiationsO: call(PersistentRoot+.new(..)); pointcut trapupdates(PersistentRoot obj): !cflow(call(public static vector  SQLTranslation,getobjects(aesultset, string))) (this(obj) execution(public void PersistentROOt+.set*(..))  ); p ointcut trapRetrievals( ): call(vector Persistentoata.get*(..)); public static PersistentOata getPersistentOataO { ... } pointcut trapOeletes(PersistentRoot obj): this(obj) execution(public void PersistentRoot+.deleteO); pointcut detectoeletedobjects(PersistentRoot obj): this(obj) (execution(public * PersistentRoot+.get*(.,)) [I execution(public * PersistentRoot+.set*(,.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 3.2 Larger Experiments We study a more representative sets of data using various kinds of values chosen as well-known error-prone problems, i.e.
Sentence 2: in double precision, we have, for N =10 : s=0.9990234375 s1 =0.9990234375 s2 =0.99609375 and it happens that s1 is far more precise than s2.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Half the participants wanted the robot to be very insistent in reminding them to take the medication, as expressed in the remark I would want the robot to stand right there until I took the medication...if you needed to have your medication at a certain time, it needs to make sure that you take it at that time.
Sentence 2: the post-demonstration data showed significant preference for human assistance for this task (Z = 2.11, p < 0.05).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For example, feature Composition Mode is relevant in the context of four use cases (labeled as the design parameters 5 to 8).
Sentence 2: number of Features per Use Case (NFU) is used for quan­tifying how many features are tangled within a speci.c use (a) 1 Composition mode 2 Structured data operations 3 Folder management 4 Content type 5 Create and send a message 6 Receive a message 7 Select and display a message 8 Con.gure composition mode 9 Manage user de.ned folders 1 x x x x 2 x x 3 x x x 4 x x 5 x x x 6 x x x x 7 x x 8 x 9 x (b) 1 2 3 4 5 6 7 8 9 1 Composition mode 2 Structured data operations 3 Folder management 4 Content type 5 Create and send a message x x 6 Receive a message x x 7 Select and display a message x 8 Con.gure composition mode x 9 Manage user de.ned folders x 10 Forward a message x x 11 Structured data operation x x x Figure 7: Features and use case dependences  case.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The bound is set such that the entropy of stream without such a predominate element can be accu­rately measured.
Sentence 2: to show that the expected value of X is the empirical entropy of the stream let us .rst assume some value of R results from a randomly chosen index whose value in the stream is k. It is equally probable that R will have the value of 1, 2, ..., up to mk , where mk is the number of occurrences of k. Therefore it is also equally likely that X will have any of its possible values f (R - 1) - f (R).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: -Ofast is able to achieve a 1.24 speedup over -O0 while PCModel gives a speedup of 2.33, i.e., a speedup of 1.88 over -Ofast.
Sentence 2: they summarize important aspects of a program s performance, e.g., cache misses or .oating point unit uti­lization.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Despite the openness of a language, programmers of all types, but novices especially, tend to employ the game mechanics that the language makes easy to access, such as the multiple logics a programmer harnesses for free using the shoot command.
Sentence 2: fUTURE WORK: THE SAY MECHANIC One element that appealed to the girls immediately and strongly is say, an action as simple as shoot, that allows characters to engage in the appearance of social interaction.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: While programmers should manually implement continuations among the event handlers in event-driven systems, continuations of threads are automatically preserved between two preemption points.
Sentence 2: in order to evaluate the shared-stack cooperative threads, we compared the Surge application using shared-stack co­operative threads with the one using original threads of Nano-Qplus in terms of memory usage and context switch­ing overhead.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For all the cases where serialized objects were small, Fa¸cade was the fastest, Command was second, and Combined Command gave the worst results, but not varying much from Command.
Sentence 2: any measures that can be taken during the design process to improve performance are bene.cial for * Also a student at Tampere University of Technology and Tampere Graduate School in Information Science and Engi­neering (TISE).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: To support such large context spaces we will implement support for compact representations of Q-functions and other related structures, which grow sub-linearly with respect to the number of contexts.
Sentence 2: to summarize, the SMDP Q-learning algorithm implemented in our library has two parameters: the learning rate a and the exploration constant e, which have small default values (0.01 and 0.3 respectively), but can also be set by the programmer if desired.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It checks each join point shadow against the registered set of advice and pointcuts.
Sentence 2: at the Java Lan­guage Speci.cation [13] level, the semantics of this advice dispatch could be implemented by adding a call such as the following to the join point shadow: A.aspectOf().before$0(); ajc produces this equivalent byte code //Method Aspect.aspectOf:()LAspect; 9: invokestatic #31; //Method Aspect.before$0()V 12: invokevirtual #34; Walking through this byte code we can see that it does more work than is required, and there are several possibilities for opti­mization if the target model is native machine code.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Practical and Accurate Low-Level Pointer Analysis Bolei Guo Matthew J. Bridges Spyridon Triantafyllis Guilherme Ottoni Easwaran Raman David I. August Department of Computer Science, Princeton University {bguo, mbridges, strianta, ottoni, eraman, august}@princeton.edu High-Level IR Low-Level IR Abstract  Pointer SuperBlock .... Inlining Opti Scheduling .... Pointer analysis is traditionally performed once, early Source Analysis Formation Machine in the compilation process, upon an intermediate repre­sentation (IR) with source-code semantics.
Sentence 2: unnecessary: Spurious arcs that result from the propaga­tion of spurious high-level arcs.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: To start a synchronization operation the mas­ter has .rst to call a wait function, whose implementation is shown below: void Master Wait(Barrier *b, int nprocs ) { int i; for (i=1; i < nprocs ; i++) while (!b->entered[i ]); // Reset flags to 0 } The master scans the entered vector, stopping at each slave .ag until it detects its presence.
Sentence 2: the fundamental parameters for our system are shown in table 1. processor ARM7, 200Mhz data cache 4KByte, 4 way set associative latency 1 cycle instruction cache 8KByte, direct mapped latency 1 cycle private memory latency 2 cycles shared memory latency 2 cycles AMBA AHB 32 bit, 200Mhz, arbitration 2 cycles Table 1: Architectural components details 5.1 Communication-Dominated Benchmark The .rst set of experiments we wrote consists in square matrix .lling (see below) and its purpose is that of investi­gating how concurrent accesses to shared regions limit the speedup of parallelization with the increasing number of cores.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Paging Method Switching for QEMU-KVM Guest Machine Yu Zhang Technische Universität Chemnitz Computer Architecture Group Chemnitz, Germany zhayu@hrz.tu­chemnitz.de  René Oertel Technische Universität Chemnitz Computer Architecture Group Chemnitz, Germany rene.oertel@cs.tu­chemnitz.de Wolfgang Rehm Technische Universität Chemnitz Computer Architecture Group Chemnitz, Germany rehm@cs.tu-chemnitz.de ABSTRACT Shadow and nested paging are two means to enable the memory access for a VM guest.
Sentence 2: practical experience suggests that so long as the workload is changing, the paging method of the VMM should also become more .exible to react upon the changing reality 2 e.g.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Fur­thermore, athighertemperaturestheleakagepowerishigher, leading to a vicious cycle that can cause thermal run-aways.
Sentence 2: )= s(.+ t)}}=Del(a,s) (8) .=0 4.3 Leakybucket shapers Implementing a general greedy shaper with arbitrarily complex shaping curve, s, can be resource-heavy.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The secondandthethirdcategoriesoffalsepositivesmayresult Table3:Turningonandoffstring-transmissionanalysis Table4:Turningonandoffstring-comparisonanalysis Application Need-to -trans Located FN FP Megamek 1734 1765 10 41 Megamek(NT) 1734 1188 585 39 Megamek(ALL) 1734 1777 10 53 in run time errors, but can be detected by heuristic-based checkers.
Sentence 2: the third threat to internal validity is that we collected output API methods manually and thecollected list may notbecomplete.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: By de.nition of principal typing, for all (G. ,t.) of (s, b), t = t. and G.= G, hence by hypothesis (**), G.fG.
Sentence 2: this considera­tion does not apply to separate compilation; indeed, if constructors are explicit, then compilation of a class requires the existence of all its ancestors, since we must check that the constructor matches inherited and declared .elds.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This mod­eling layer that micro-controllers expose at runtime, enables the e.cient and safe reasoning (by other Kevoree nodes: Java or Android) to adapt microcontroller-based nodes.
Sentence 2: [12] J. Eker, J. Janneck, E. A. Lee, J. Liu, X. Liu, J. Ludvig, S. Sachs, and Y. Xiong.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Each Comet embeds its own task model, its own adaptation algorithm, as well as multiple CUI s and FUI s, each one adapted to a particular context of use.
Sentence 2: this application of Principle #1 does not indeed leave much flexibility to cope with unpredictable situations unless it relies completely on the tier middleware infrastructure that can modify any of these models on the fly, then triggers the appropriate transformations to update the Final UI.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 5.3 IL-AwareLHSAlgorithm Theabove empiricalexercise showsthatweneedtosample mixes that cover different ILs in order to make accurate predictions for real workloads.
Sentence 2: their work focuses exclusively on single query types and does not consider interactions and query mixes, which are our focusin thispaper.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Improving Safety When Refactoring Aspect-Oriented Programs Diego Cavalcanti Department of Systems and Computing Federal University of Campina Grande Campina Grande, PB, Brazil diegot@dsc.ufcg.edu.br Abstract Checking correctness with respect to a formal semantics is ex­pensive.
Sentence 2: similar to OO programs, we also have aspect-oriented (AO) refactorings [Monteiro and Fernandes 2005, Cole and Borba 2005, Hanenberg et al.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We will later show the implementation of the type Sec and its associated functions.
Sentence 2: implementation of a two-point lattice data H =H then we can model the type of the function f given in the beginning of this section as follows: f :: (Sec H Char, Int) -> (Sec H Char, Int) The .rst, secure, example of f can be programmed as follows: f (sc,i) = ((c -> chr (ord c + i)) fmap sc,i+3) the other two de.nitions can not be programmed without making use of H or breaking the type checker.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Every write is sent to both disks, while a read canbe servedby either disk.
Sentence 2: while a disk can be spun down to standby mode for saving most of this power, 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 pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.To copyotherwise, to republish, to post on servers or to redistribute to lists, requires prior speci.c permission and/or a fee.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Time (%) Original Strategies New Strategies Paradigm LinSolv 23.40 +0.90 +1.97 Nested Data par TransClos 83.12 +0.77 +2.24 Data par Sphere 21.11 +4.78 +3.32 Nested Data par MiniMax 36.98 +0.87 +3.22 D&#38;C Coins 42.49 +1.11 +2.12 D&#38;C Queens 25.51 +1.37 +6.12 D&#38;C MatMult 18.85 +16.87 +18.14 Data par Genetic 33.46 +2.96 +3.97 D&#38;C Data par Hidden 4.61 +5.86 +2.17 Data par Maze 40.93 -2.22 -3.59 Nested Data par Geom.
Sentence 2: 2007], supports the paral­lel evaluation of every element in a collection.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It should be noted that our analysis does not include measurements of real systems.
Sentence 2: feitelson, Supporting Priorities and Improved Utilization of the IBM SP2 Scheduler using Slackbased Backfilling , In Proceedings of the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, IEEE Computer Society, San Juan, Puerto Rico, April 12-16, 1999, pp.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The lack of CSP in .1 means that there is no lift operation to uniformly convert a present-stage value of any type to some future-stage code that evaluates to that value.
Sentence 2: danvy and Filinski (1990, 1992) .rst applied delimited control to program generation: they showed how to fuse a CPS translation and administrative reduc­tions into one pass by writing the translation either in CPS or using shift and reset.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Our speci.cation language also allows for de.nitions of parametric relations for polymorphic data types that enable highly composable speci.cations and naturally gener­alizes to higher-order polymorphic functions.
Sentence 2: for instance, it is not possible to write a relational speci.cation that asserts that the result of folding over a list of integers with (op +) is the sum of all integers in the list.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 457-467 [13] Shenoy, P., Vin, H., M, Cello: A Disk Scheduling Framework for Next-generation Operating Systems, ACM SIGMETRICS, Madison, WI, USA, June 1998, pp.
Sentence 2: otherwise, several hundred requests could be pending, leading to unrealistic working conditions for the disk.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Keywords Requirements elicitation, stakeholders, non-formal modeling  INTRODUCTION In user centered product design a strong tradition exists of starting from a task model, subsequently developing a detailed design model (often structured along functionality, dialogue, and representation), model based prototyping and evaluation, ending in formal specifications (Van Welie and Van der Veer, 2003).
Sentence 2: collaboration on design is often not a purely verbal activity.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [8] R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenstr¨ om.
Sentence 2: the work presented in this paper is somehow transversal to these related works.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: By us­ing BYADL three different kinds of editors can be adopted, each characterized by a distinguishing usability level and a certain effort to be implemented.
Sentence 2: [2] J. Bézivin, S. Bouzitouna, M. Del Fabro, M. P. Gervais, F. Jouault, D. Kolovos, I. Kurtev, and R. F. Paige.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Finally, an injectiv­ity con.ict occurs on the cross links emanating from o8 and o9 which were added on di.erent branches and refer to the same object o3.
Sentence 2: construct graphs g1 =(V1,E1), g2 =(V2,E2), and gb =(Vb,Eb) each of which consists of a chain of ele­ment nodes augmented with a start node and an end node.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A seqblock acts as if each update set is applied to the state before the next statement is evaluated (as opposed to the parallel execution normally performed).
Sentence 2: f o f ( i d 6 , hypothesis , f S i g n E x t e n d ( s y m 5 , 1 6 , 3 2 , s y m 7 ) ) .
Relationship: neutral
Domain: Software and its engineering
Sentence 1: (TUU '00 Arlington VA USA Copyright ACM 2000 1-58113-314-6/00/11 ...$5.00  Darin Ellis Institute of Gerontology Wayne State University 87 East Ferry Street 226 Knapp Building +1 313 577 2297 d.ellis@wayne.edu  searching through a list of alternatives: exhaustive search and self-terminating search [7].
Sentence 2: sT = ((b + l )t/2 + k + c) Inn ( ln b) Taking the derivative of the above equation and setting it to zero, it can be shown that the optimum b assuming a self- terminating search is given by: b(lnb-1) = l+2k+c t Age Related Differences in Navigation In general the empirical work points out that older adults are at a disadvantage in information retrieval tasks.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Fast binary translation for SIMD instructions is achieved by performing both intra-block and inter­block analysis to track the data type used by SIMD instructions, followed by optimized insertion of data type synchronization code to minimize the data type mismatch and the overhead brought by data type synchronization.
Sentence 2: 3.2 The translate-time algorithm The translate-time algorithm tries to reduce inter­block mismatches through translation time analysis.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Figure 3: Adaptor LTS (registration part) rithms of Cæsar Solve are designed such that a sequence of resolutions has an overall linear complexity in the size of the BES; this is achieved by keeping the results of interme­diate computations persistent between two subsequent res­olutions.
Sentence 2: vector processes are .nally interleaved.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The general idea is to heuristically assign more cores to larger tasks based on the execution time estimate.
Sentence 2: cores Perf (smart) Perf (static) Perf (dyn) Overall 4 1 1.22 1 1.22 5 1.22 1 1 1.22 6 1.23 1.25 1 1.54 7 1.54 1 1 1.54 8 1.53 1.08 1 1.66 Dynamic partitioning increases the throughput by a large amount for all the cases because three huge tasks, which are easy to accel­erate by .ne-grain parallelism, have similar workload and quality of the schedule is still high when sharing the resources at runtime.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Plugins may be used to support different constraint systems [57] to be used in constrained types.
Sentence 2: rc(Ck{ck},z.xk) given a program P with classes C1,...,Ck, the set of real clauses for C1,...,Ck are de.ned in a mutually recursive fashion through the Clark completion of a Horn clause theory (over an underlying constraint system).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We observe (Figure 6) that the modularisation of LABELMEDIA is more stable in the Java version, since this feature is spread over fewer components (CDC) in this solution.
Sentence 2: conditional compilation lacks this ability because it has a somewhat intrusive effect on the code, due to the need to add the #ifdef /#endif clauses locally at the places where features intersect.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A variant type de.nition type+ T = ... | C adds constructor C to existing type whose type name is T. In Figure 1, we have already seen an example that adds Sub constructor to the type t. The constructors added to a variant type by aspects often make pattern matching non-exhaustive.
Sentence 2: a parameter pattern Pis a pattern that used to describe a formal parameter of a function in Objective Caml3.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We have extended previous work by integrating a language for formally specifying an implementation with a framework for expressing security policies, particularly with respect to covert channel rules and control dependency flaws.
Sentence 2: the remaining statements illustrate how the Low subject compares the two clock values (s6) to see whether the High subject has interfered with it through performance of some operation, and writes either a 1 or 0 accordingly (s7 &#38; s8).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Through a series of incremental re.ne­ments the architect can move towards architecture, by (i) adding design elements (tasks and quality constraints), (ii) adding behavioral re.nements (in the form of .ow expres­sions), and (iii) generating statechart models from (possibly incomplete) models.
Sentence 2: the .rst option is to use only a cash sensor (dt11), while the second option is to use only the entry of an operator (dt12).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For exam­ple, if a statement S is said to be a realization of the speci.cation requires P ensures Q, then to verify S means to prove that the Hoare triple {P }S{Q} holds.
Sentence 2: copyright &#38;#169; 2014 ACM 978-1-4503-2798-5/14/04.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Server systems also introduce additional concerns such as high execution concurrency and new management functions like online request classi.cation.
Sentence 2: during an online training process, at each moment of a system call, we map the system call name to the change of target execu­tion metric over certainperiodsbefore andafterthe moment.While system calls of a speci.c name may be observed many times dur­ing execution, we continuously maintain the average and standard deviation ofmetric changesforit.The metric change averageindi­cates the signi.cance of subsequent behavior transitions while the standarddeviationindicates their uniformity.As examples,Table2 lists some mappingsfrom system callnamesto subsequent changes inCPUcyclesperinstruction(CPI)forApache web server.We can understand some of the system call-signaled CPI changes through the application semantics.Forinstance,the writev system call en­trance signals the start of writingHTTPheaders, which apparently exhibitshighCPIs(probablyduetoitsfragmentedpiecemeal ac­cessesto memory).the writev system call entrance typically signals a substantialincrease of theCPI metricinApache web server.
Relationship: neutral