sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Then the severity of an interference can be de.ned as the potential I/O performance improve­ment from the interference removal strategy, quanti.ed by the simulation results.
Sentence 2: 4.1 General Performance 4.1.1 Benchmark BTIO BTIO is an MPI program designed to solve the 3D com­pressible Navier-Stokes equations using MPI-IO library for its on-disk data access.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The class loader uses the bytecode engineering library [3] to redirect references to classes belonging to the simulation set to simulation stubs.
Sentence 2: to eliminate these error messages and to compute the expected result, the program­mer adds the following axioms: forallo:Object add(NewHashSet().state,o).retval (Axiom 7) ==true forallo:Object forall h:HashSet (Axiom 8) contains(add(h,o).state,o).retval==true The .rst axiom says that adding any object to a new hash set returns true.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Notice that because of an overhead of our approach (recording of the execution trace); the analysis is typically performed on relatively short program executions to identify performance deficiencies.
Sentence 2: [21] Wagner T., Maverick V, Graham S., and Harrison M. "Accurate Static Estimator for Program Optimization", ACM SIGPLAN 94 (PLDI 94), 1994, pp.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: INTRODUCTION Clock synchronizationis animportantfoundation of net­worked systems.
Sentence 2: behavior of Clock-Sampling Mutual Network Synchronization in Wireless Sensor Networks Ereth McKnight-MacNeil Systems and Computer Engineering Carleton University Ottawa, Ont., Canada K1S 5B6 erethmm@sce.carleton.ca  ABSTRACT Clocksynchronizationisanimportantcomponentofwireless sensor networksbothfor co-ordination of node communica­tions and for time stamping sensor data.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Distinguishing between different types of relationships reinforces the generative nature of pattern languages, and supports the idea of using patterns to develop complete designs.
Sentence 2: this multi-criterion classification is based on the original set of relationships (Zimmer 1994; Duyne et al., 2003; Yacoub and Ammar, 2003) used to classify the patterns proposed in (Gamma et al., 1995).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Then we de.ne the cross-point as the minimum time scale where the burstiness of the client tra.c is lower than that of the corresponding server tra.c to determine the relative smoothness of the client tra.c.
Sentence 2: the burstiness initially exhibits a falling trend when the time scales are small, but after a certain time scale with the low­est burstiness, a rising trend will appear.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: whose kth bit is set to1 if f accesses (a data element from) .k; otherwise, it is set to 0 (note that all iterations in an iteration block access exactly the same set of data blocks).
Sentence 2: without loss of generality, let us assume that T =  = < 11 ··· 110 ··· 0 >, (i.e., the .rst q entries are 1 and the rest are 0).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Also, recall that in Section 3, we iden­ti.ed that such con.gurations lead to interesting analysis and pictures, so this fundamental limitation of the algorithm is noteworthy.
Sentence 2: leveraging parallel computational resources to achieve scalable and well-performing visualiza­tion in this setting requires optimal parallelization strategies that adapt smartly to the widely varying characteristics of integral curve computation.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Fortunately, a lot of progress has been made here by at least two projects that we aim to introduce and evaluate their usefulness in the context of bringing together di.erent MOP frameworks.
Sentence 2: jMetal The jMetal 4.5 framework7 , which was releaed in January 2014, is implemented by Antonio J. Nebro and Juan J. Durillo from the Universidad M´alaga.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For example, GridLab-D and MapleSim allow users to specify parameters for an appli­ance (e.g., energy-baseline (kWh) or motor-power (kW) for a washing machine).
Sentence 2: 3.3 Additional Toolkits The SHF comes with a toolkit that contains (i) an optimisa­tion and (ii) a visualisation package.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: hen adopting a real-time system for new QoSneeds, the developer takes appropriate aspects and compo­nents from the QoS aspect package and adds them to thesystem, depending on the application QoS requirements.This gives ability to produce a variety of diferent systemconfgurations with distinct QoS management algorithms,which corresponds to solving problem (P5).
Sentence 2: existing QoS methods for real-time sys­tems due to shortcomings (P5) and (P6) do not comply withessential QoS principles of enabling confguration and reuse[6].
Relationship: neutral
Domain: Software and its engineering
Sentence 1: (@1(vote)+@2(vote)+ ...+@n(vote)) >n/2 where,aproessstores1 inaloalvariablevote ifitisin favoroftheresolution,and0 otherwise.
Sentence 2: knowledgeoperatorsareprovidedtoreasonabouttheloal historyofaproess,aswellasabouttheknowledgeita­quiresfromotherproesses.inordertokeepthe omplexityofmodelhekingtratable,Penzekdoesnot allowthenestingofausalknowledgeoperators.Interest­ingly,thenestingofausalknowledgeoperatorsdoesnot addanyomplexitytoouralgorithmformonitoring.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: During the update the JIT compiler will also need to flag any superclass in the system in which running subclasses may be updated in future execution.
Sentence 2: : Dynamic update of Java applications -balancing change flexibility vs. programming transparency, In Journal of Software Maintenance and Evolution: Research and Practice, John Wiley &#38; Sons 2009, Volume 21, Issue 2, Pages 81-112.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For instance, our measure might involve the cost or severity of failures, risk considerations, development costs, or maintenance costs.
Sentence 2: accurate predictions require a long 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: neutral
Domain: Software and its engineering
Sentence 1: 6.32 -2.22 0.01 -15.02 20.58 17.72 1.30 -4.75 P.T.
Sentence 2: accurate performance prediction of parallel applica­tions1 is dif.cult because the execution time of large parallel ap­plications is determined by sequential computation time in each process, the communication time and their convolution.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This diagram is modi.ed in order to .t in one page.
Sentence 2: the set E of transformers is the disjoint union (denoted 1 ) of four sets: the set EFD of fraction distributors, the set ESD of substance distributors, the set EFH of fraction hubs, and the set ESH of substance hubs: E = EFH 1 ESH 1 EFD 1 ESD (2) The following functions are de.ned in order to assign different attributes to the different kinds of transformers: deg : E .
Relationship: neutral
Domain: Software and its engineering
Sentence 1: From our empirical results, our approach is able to infer many high-quality MRs in acceptable time (i.e., from 9.87 seconds to 1231.16 seconds), which are e.ective in detecting faults with no false detection.
Sentence 2: our approach is a black-box technique, which requires no source code under test and may be applied to scienti.c functions in various languages.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In order for an HR algorithm to perform well on multicores, three ingredients are required: 1.
Sentence 2: [9] L. A. Barroso, K. Gharachorloo, R. McNamara, A. Nowatzyk, S. Qadeer, B. Sano, S. Smith, R. Stets, and B. Verghese.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Educators had to choose between toy languages (like Budd s Little Smalltalk [2]) and proprietary extensions like Object Pascal and Objective C. Just when Smalltalk became a feasible choice, Java and C++ appeared on the scene, further fragmenting the educa­tional community.
Sentence 2: the language design process should be as open and transparent as possible, and the resulting language speci.cation should be vested in the community.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Of all these vocabularies, the most comprehensive is the BODC-SeaDataNet but its relational system doesn t go beyond the concept of thesauri relations.
Sentence 2: there is a need to provide precise descriptions of the onboard instruments and also the acquired data, as a whole, to be consumed by onboard systems and scientists, but also to be integrated in the different Data Centers that provide data to a very broad marine community (research centers, governments, decision makers, etc.)
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [60] Holbæk-Hanssen, E., Håndlykken, P., and Nygaard, K.: System Description and the DELTA Language, Norwegian Computing Center, Oslo, Report No 523, 1973.
Sentence 2: b.: Associations: Abstractions over Collaboration, IEEE International Conference on Systems, Man &#38; Cybernetics, Washington D. C., 2003.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This is a very nice approximation since it eliminates the buffering energy consumption EBbit , which is a parameter tightly coupled with the network congestion whose accurate value can only be measured by time-consuming simulations.
Sentence 2: with the increase of IP integration and compo­nent specialization, the heterogeneity of these designs also inevitably increases; this helps not only in optimizing per­formance for low power consumption, but also in keeping competitive design costs.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In the general case, the detection of con­tradictory preferences is an undecidable problem; even for the programs with bound-size terms (i.e., .nite domain), the detection is still an NP-hard problem.
Sentence 2: (Ø) P roposition 3 (ii) If A is not an atom of a optimization predicate, then the proof can be done by a structural induction on the de.nition of the predicate for A (omitted due to the page limit).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Thirdly, there are some elements that have the potential to com­promise spatial isolation when affected by transient faults that are Figure 1: KESO s architecture not safeguarded by our approach.
Sentence 2: in ad­dition, 301 reference checks and 97 object-header checks (76 on non-static method invocations, 21 on instanceof and checkcast) were emitted in protected KESO.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The larger the payload...the more chances that something will not work well (P5) and it was always the case that a lot of code changes meant a lot of latency (P1).
Sentence 2: the integration policy of the organization attempts to mitigate these risks by .rst requir­ing branches to integrate downstream (for example, from the mainline into a staging branch), resolve any con.icts and test, before integrating upstream.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: First, to cope with the expected work­load increase (scenario 1), the system should be con.gured in a three tier con.guration as shown in Fig.
Sentence 2: both our measurements in the experimental setup and our experience during earlier work [23] showed that the application server, for which our model most accurately pre­dicts utilization, would be the most likely bottleneck.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Categories and Subject Descriptors D.3.2 [Programming Languages]: Language Classi.ca­tions Constraint and logic languages, Concurrent, distri­buted, and parallel languages ; F.3.3 [Logics and Mean­ings of Programs]: Studies of Program Constructs Pro­gram and recursion schemes General Terms Languages, Theory  Keywords constraint programming, timed systems, expressiveness * The contribution of Mogens Nielsen and Frank D. Valen­cia to this work has been supported by Basic Research in Computer Science, Centre of the Danish National Research Foundation.
Sentence 2: in one time unit (or interval) P and Q operate con­currently, communicating through the store.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 4.3 Visualising Dynamic Behaviour Any modelling approach adopted by Infineon has to understand the dynamic nature of e, as structs can be generated and destroyed during a simulation.
Sentence 2: in e the child class does not exist until it is generated at runtime, and it is not guaranteed that it will be generated, i.e., it would be possible to constrain the environment to only generate poodles and bulldogs, in which case although the possibility of a pug exists, it is never realised.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 34(1): 99­115 (2008) [16] X. Qu, M. B. Cohen, G. Rothermel: Configuration-aware regression testing: an empirical study of sampling and prioritization.
Sentence 2: smaller groups of similar tests are more likely to be failure­inducing than larger ones; where similarity is measured in terms of structural coverage.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A feature modelF indicates which features are allowed to be selected together on a conceptual level.
Sentence 2: where DM 1 = DM {w, x, y} DM 2 = DM {w, x} DM 3 = DM {w, y} DM 4 = DM {w} Then, by Theorem 4 and c F t(,wehave our result.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The rules CT-OUTER and CT-NEST de.ne the CT function for top-level classes C and nested classes T.C, respectively, using the top-level class table TCT.
Sentence 2: some existing language mechanisms do help [6, 33, 31] but they do not solve the extensibility problems that we have encoun­tered in developing Polyglot.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: By leveraging experience, knowledge and skills that users already possess, these interfaces offer the promise of interfaces that are easier to use.
Sentence 2: though existing techniques could be extended in ad-hoc ways to address some of the aspects of reality based UI s, they would fall short of producing a comprehensible specification at a high level abstraction, which captures the dialogue from the user s perspective.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Note that this is identical to saying that A, with a very high prob­ability, sends a message to be through a node that is in F1 (provided the intermediate node is running a deterministic program which he indeed is)!
Sentence 2: unless there exists a strong path from x to R in N * that does not involve nodes from B1 ' , x cannot in.uence R (using the data received from y).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: DCE, instead, runs in simulated time so it can handle through time dilation all the tra.c without data losses, even though the experiment may sometimes take longer to run than the real-time sce­nario would take.
Sentence 2: optionally, we provide a more e.cient ucontext-based [3] stack manager to allocate stack space with mmap and control the Program Counter of each simulated process by saving and restoring CPU registers entirely in user-space.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Therefore p1.delay() and p2.delay() cannot interfere.
Sentence 2: class c pCnstr  { fin t. fCnstr t f mth }Q1 = p1 G= p, pCnstrs(c )G f c '  G ' G ' =G, this f t G '' G '' G '' ' =G ' , this c  f t f mth '' finF ields(c ' )= t . '
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The results obtained in this simulation may be a partial representation of a real world scenario since more potential personal factors and environmental factors could be incorporated into the model.
Sentence 2: more than one-third of U.S. adults (35.7%) and approximately 17% (or 12.5 million) of children and adolescents aged 2-19 years are obese [1].
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A main advantage of modern DSL systems such as MPS [3](on which mbeddr is based) is that the DSL development environment and the runtime environ­ment for the created languages are based on common IDE.
Sentence 2: in these low-end markets there exists a large gap between the engineering e.orts required to con.gure an automation system and the e.ort automation companies and their customers can a.ord.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: fact); 5 if result == Current then 6 NotifyParents (Current); 7 return 8 if result == Pred then 9 Current = Current.TrueBranch 10 else 11 Current = Current.FalseBranch 12 if fact == Current then 13 NotifyParents (Current); 14 return 15 end ships between the type value in the fact fact.Value and the type value in current predicate current.Value to minimize matching.
Sentence 2: other formulations can also be conceived that perhaps take a hybrid approach, but for the purpose of this paper we will not consider them.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: One cluster has dual next time step, i.e., fB (S(k+1)), and we use prising two quad-core CPUs, with 8 MB L2 cache and 6 GB main (ui(k) - ui(k - 1))2 P (ui(k)- ui(k- 1))2 Opteron 250 (2.4GHz) processors with 8MB L2 cache and 8 GB main i to denote the control overhead.
Sentence 2: during the execution, Perf (k)= is the performance vector that is observed at time step k. The outputs in our case are not likely to be a linear function of the set of inputs.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The problem with these approaches is that the distinction between controlled and monitored actions [26], and between descriptive and prescriptive behaviour [17] is not made explicit.
Sentence 2: the behaviour models they synthesise in order to enact self-adaptation, may not be realisable by the self-adaptive system or unexpected results may be obtained when the self-adaptive system interacts with its environment due to non-valid assumptions that were not made explicit.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In fact, like in [1], our work is based on an optimistic approach to composi­tion, i.e.,two services are composable if they can commu­nicate properly in at least one design or con.guration.
Sentence 2: in our case, messBill?.messP ayment!, the order imposed by Warehouse (behavior represented by GW -1), is a possible one for Client.the desired composition is possible and it is represented by G (Figure 1-(c)) .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since the model versioning system is able to perform composite operations on arbitrary models by interpreting the operation speci.ca­tion obtained in Step 1, it is also capable of replaying them.
Sentence 2: the replayed execution of a refactoring originally performed by one modeler encloses changes performed by the other modeler, which leads to a merged model combin­ing both intentions and prohibiting merge problems [Brosch et al.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Next, observe that .q({r1})= .q({r2}) if and only if r1 and r2 have the same sensor id and hence are the same reading.
Sentence 2: thus SG(r1)= SG(r2).4 Finally, SF(s, s) is the Boolean OR of the bit vector s with itself, which equals s. properties P1 P4 hold, so by Theorem 1, the algorithm is ODI-correct.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Rather than splitting the computation to two separate spawn­blocks (one for each set of threads), or introducing a conditional control to determine between the two, we use the following scheme: we create a single spawn block, which contains two separate thread emulation loops one for the clustered-threads, and one for the unclustered-threads.
Sentence 2: given a fine-grained spawn-block of n threads, our compiler approach results in the following execution scheme.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Based on the example in Table 1 and the top 3 most suspicious program elements returned by each technique, LOchiai , LKlosgen , and LP iatetsky Shapiro are {Block 3, Block 4, Block 5}, {Block 3, Block 4, Block 5}, and {Block 2, Block 1, Block 5} respectively.
Sentence 2: lall is {Block 1, Block 2, Block 3, Block 4, Block 5}.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In par­ticular, phase two seems to be a very dynamic time period, and represents the longest lasting phase.
Sentence 2: this is the phase from which the most interesting conclu­ 10 8 6 6 4 4 2 2 0 0  Positioning Error [m] Positioning Error [m] 10 10 8 6 4 2 8 6 4 2 0 0 Time [minutes] Time [minutes] Figure 4: (top) Case study in Section 3.2.1.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As we had mentioned before, we use a resource model to map the change of such parameter values to CPU cycle/memory requests [6].
Sentence 2: the resource cost reward function is de.ned us­ing the resource requests and pricing model, where CPUcost(k) and Memcost(k) is the cost on CPU and memory at time step k. W2 (S(k),D(k)) = CP U request × CPUcost(k)+ mem request × Memcost(k) With the above, formally, our controller solves the following: Ethernet within each cluster.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The speci.c structure of behavioral programs, and in par­ticular the simple yet strict thread interaction rules, has bene­.cial effects: programs can be written in a natural way, i.e., with modules that are aligned with the speci.cation [10, 23]; it greatly reduces the amount of (unexpected) interleaving, hopefully making race conditions more scarce; it renders the program more amenable to incremental development; and it facilitates the application of program analysis methods to behavioral systems [20] (for more details, see Section 2).
Sentence 2: it has been conjectured that behavioral pro­gramming is suitable for the development of large systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This problem is not speci.c to virtualization-enabled hosts; a bare-metal Linux OS serving multiple applications can exhibit similar behaviors.
Sentence 2: we .rst discuss two fea­tures introduced in Linux 3.3 that tackle this problem, and then we explain why the interaction between the host network stack and guest VMs compromises the ef­.cacy of these features.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It is essential that the tester can observe the outputs of the IUT for detecting the next state after a nondeterministic transition of the IUT.
Sentence 2: we require that a nonde­terministic IUT is output observable [12, 16] which means that even though there may be multiple transitions taken in response to a given input, the output identi.es the next state unambiguously.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Copyequivalence implies that the original formula and the suggested change are more sim­ilar than would be the case if they were only structurally equivalent.
Sentence 2: if a change suggestion recommends changing a formula f to g that is copy-equivalent to f, the change suggestion is ranked higher than a suggestion that would yield a formula h that is only structurally equivalent to f. Even lower ranked are changes to structurally non­equivalent formulas.
Relationship: reasoning