sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The grammar and parser are at the root of the depen­dency graph in Figure 2 (A), since the syntactic structure of programs is the basis for the implementation of all other services.
Sentence 2: the services for presentation in Fig­ure 2 (B) and editing in Figure 2 (C) are automatically de­ rived from the grammar.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While the use of the complex algorithm in Figure 10(c) does not a.ect the trends seen in Figure 10(b), it does a.ect the degree of locality required before proxy outperforms the other mobility protocols.
Sentence 2: as subscription languages become more expressive and expensive to process, the ben­e.ts of publication locality on proxy will diminish.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The third step involves exploiting opportunities for inserting alternative content that corresponds to the critical content under consideration for some category of learners.
Sentence 2: we consider that the didactical content may be considered as: optional, in which case the content is not essential to the realization of the module s objective; mandatory, in which case the content is essential or relevant to the realization of the module s objective.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The expression of the abstract conditional operator we consider is Ri = ifa Bn thena Rj elsea Rk, where Bn an abstract Boolean and Ri, Rj and Rk are ab­stract real variables associated respectively with the inter­vals I, J and K. According to the classical de.nition of the conditional, the following interpretation is de.ned: If Bn = True,Then I = J,  If Bn = False,Then I = K,  Finally, If Bn is not de.ned Then Ri is not de.ned as well and I = .AR .
Sentence 2: the approach has been implemented in Java and applied to parts of a .ight control system of the AIRBUS aircrafts.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Data aggregation may be as simple as combining several sensor readings into one single packet or averaging data sampled on di.erent nodes.
Sentence 2: categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distri­buted Systems distributed applications; I.5.4 [Pattern Recognition]: Applications signal processing General Terms Design, Experimentation, Performance  Keywords Wireless Sensor Networks, Distributed Event Detection, In­network Data Processing, Pattern Recognition 1.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We have found UML 2.0 collabora- 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.
Sentence 2: they .t well with an understanding of services as collaborations between ser­vice roles played by objects that deliver functionality to the service users.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In [46], the clinical guideline de.ned in GLARE [33] is translated to a Promela [29] representation and veri.ed by SPIN.
Sentence 2: (Some hospitals have resorted to entering transfusion orders on the medication page of the record since that page is consulted frequently by the nurse, even though this causes other di.culties with the electronic order system.)
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Our current hypothesis is that the decrease in bene.t of counting sort from range T 18 and onward is due to more and more complicated memory access pat­terns in the reconstruction phase.
Sentence 2: as an example, element 1 occurs once in the .nal array because the difference between the element at position 1 and 2 in the position array is precisely one.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In order to ensure that we were not over-reporting the overhead of our trace pro.ling subsystem, we show the execution times for the SPECJvm98 benchmarks under steady-state operation in Fig­ure 10.
Sentence 2: the per­ (a) Trace Layouts in Address Space (b) Normalized Trace Continuity 5B0480C6 (Low) 9BFE8D1F (High) Virtual Address Space (32MB increments) Normalized Continuity Figure 3.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Copyright 2005 ISBN # 1-59593-126-0 17/05/05 ... $5.00 J. Singh H. Hallal Concordia University CRIM 1455 Maisonneuve West 550 Sherbrooke West, 100 Montreal, Canada Montreal, Canada +1 (514) 848-2424 1 (514) 840-1234 j_singh@ece.
Sentence 2: process Declaration: Each thread in the trace translates to an active process in PROMELA.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: RELATED WORK While there have been many studies on data provenance [6, 19, 20, 11, 10, 3], the security aspect of data provenance has not been investigated until very recently [7, 12, 24, 23, 14, 22].
Sentence 2: the environment EBLS provides ora­cle BLS.Sign that returns BLS signatures on requested mes­sages.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A concept de.nition (P,G,B) is further processed and re­.ned into a quadruple (Pexp,Pimpl,G,C) for the purpose of concept checking.
Sentence 2: copy fails to concept-check because we did not include the assump­tion that we could read from an iterator that meets the Mutable_fwd properties.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Our ABFT detec­tors report an error when for some vector, row or column |currentSum - recordedSum| > |max(currentSum, recordedSum)|* tol, where currentSum is the current sum of the vector s en­tries, recordedSum is the recorded sum and tol is a free parameter.
Sentence 2: the checkpoint cost itself is quite small, as indicated by the over­head under 1% for detectors with the lowest false positive rates.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The unique tag ensures that no other message will have the same tag as this se­rialized data; since MPI.NET may need manysuch tags for trans­mitting objects (and cannot use any tag available to the user), MPI.NET maintains a separate shadow communicator that has the same processes and ranks as its primary communicator,but is reserved only for serialized data messages.
Sentence 2: the following example illustrates a typical use of the MPI send primitive in C: int my value = get local value(); MPI Send(&#38;my value, 1, MPI INT, dest, tag, MPI COMMWORLD); public void Send(T value, int dest, int tag) {using (MemoryStream stream = new MemoryStream()) {BinaryFormatterformatter = new BinaryFormatter(); formatter.Serialize(stream, value); unsafe {.xed (byte* buffer =stream.GetBuffer()) {Unsafe.MPI Send(new IntPtr(buffer), (int)stream.Length, Unsafe.MPI BYTE, dest, tag, comm); }}}} Figure 2.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A SecGraph also provides traceability information ysis extracts SecGraph; architects assign security properties to abstract objects and edges using SecGraph queries; ar­chitects write and execute constraints and .nds suspicious edges; architects trace to code from suspicious edges and in­spect potential vulnerabilities.
Sentence 2: an architect can reason about what object a data.ow communication refers to, and how other objects are using the same data.ow object.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For three (NE, FS, LU) of our four test applications and for many real-world codes, the number of messages sent and the communication patterns are independent of the size or content of (a) (b) 1   (c) the processed data.
Sentence 2: since messages 1 and 2 are synchronized by operation D1, we do not need to consider E while determining the operations potentially interfering with messages 1 and 2.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A symbolic grammar G. for SimpleCalc replaces the calc concrete productions for letters and numbers with symbolic placeholders: Letters l ::= a Numbers n ::= ß This is a simple renaming change where a and ß are sym­bolic constants.
Sentence 2: while this already provides more scalability (mea­sured as coverage per unit time), this technique su.ers from the drawbacks of constrained exhaustive enumeration: the number of valid strings explodes as the size of the input bu.er increases.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 3.4.3 Forces Sometimes the timing constraints on the rate of sampling may not be very strict and/or the cost of additional interrupt triggering hardware resource may be too costly based on the needs of the business.
Sentence 2: 3.7.4 Solution If the probability of change in system/business requirements is considerable and the concern for maintainability of the firmware by other software engineers in the future is not appreciable then the table driven sampling approach should be applied.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Successful diagnosis of mild HCM presents a major medical challenge, especially in athletes with exercise­induced hypertrophy that overlaps with HCM.
Sentence 2: in general, even with the most challenging iterative MapRe­duce job, the learning algorithm achieved speedups between 47.05 and 53.67 on a high con.guration of 64 cores of our Hadoop enabled Beowulf cluster.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Each of the remaining three con.gurations adds a different portion of Lit­eRace s instrumentation overhead: the .rst adds just the dispatch check, the second adds the logging of synchronization operations, and the .nal con.guration is the complete LiteRace instrumenta­tion including the logging of the sampled memory operations.
Sentence 2: the weighted average uses the number of memory accesses in each benchmark application as a weight.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We need at least one intermediate asser­tion; see Figure 4.
Sentence 2: in Figure 1 some of these locations are indicated by the comments S, A, B, C, and H. We think of a computation as a sequence of computation states each of which consists of a control state (a code loca­tion) and a data state (a vector of values of the variables).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [2] G. Ammons, J. Appavoo, M. Butrico, D. Da Silva, D. Grove, K. Kawachiya, O. Krieger, B. Rosenburg, E. Van Hensbergen, and R. W. Wisniewski.
Sentence 2: the process can be created signi.cantly faster because the contents of memory pages need not actually be copied.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: VoD-KATV is a distributed system composed by several components, which are integrated through web services (cf.
Sentence 2: when we run the QuickCheck state machine to test the buggy web service, QuickCheck returns the following error (after shrink­ing): Shrinking..........(10 times) [{set,{var,3}, {call,test_sut,createRoom,["A",""]}}, {set,{var,4}, {call,test_sut,createRoom,["A",""]}}] QuickCheck .nds a smaller trace of operations that cause the same error in our model, i.e., create two households with the same identi.er.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The algorithm takes in the levels determined by the complexity algorithm and checks if we have to further adjust the configuration through the following algorithm: for every audio quality level y; for every level of game pieces x; for every image quality level z; determine space required for (x, y, z); store space required in array p[]; loop; loop; loop; sort p[] by space required; search z[] for best configuration with space required < space available on the device; When the best configuration for the device resources has been chosen, the configuration server changes the code to get the right number of game pieces, import the image and audio files and then compiles the game run-time before packaging the deployment into .jar and .jad files for download to a web server.
Sentence 2: for up to 8 game pieces the speed of handling has no significant increase (and even decreases at one point), but the number of calls increases significantly.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 4.2 The other schedulers There are three other schedulers with which we compare the CAMP algorithm: Parallelism-Aware (PA), which delivers TLP specialization only, SF-Driven (SFD), which delivers ef.ciency specialization only, and round-robin (RR), which equally shares fast and slow cores among all threads.
Sentence 2: since PA does not com­pute thread-speci.c speedup factors, it cannot distinguish between HIGH, MEDIUM and LOW utility threads.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: devised a novel strat­egy to evaluate the relative bene.t of multiple per-function phase sequences during a single program execution by maintaining differ­ent versions of the same function in one executable and switching between them during execution [10].
Sentence 2: first, our current results demon­strate that customizing the phase sequence over .ner program lev­ 4 The slight average performance improvement of hybrid search over function-based search is, most likely, due to a different random path se­lected by the genetic algorithm during the hybrid approach.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Journal of Information Systems, 8, 1 (Spring 1994), 1 17 S68 Leonard-Barton, D., and Sinha, D. Developer user interaction and user satisfaction in internal technology transfer.
Sentence 2: 188 203, 2011 S25 S. Pelayo, From users Involvement to users needs understanding: a case study, International Journal of Medical Informatics, vol.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Providing Video-on-Demand using Peer-to-Peer Networks.
Sentence 2: bulletMedia replicates each block steadily, with low standard deviation (shown as error bars in Figure 5) and quickly reaches the desired replication factor of 4 (including the .le present at the source, which why is the line in Figure 5 starts at 1).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: ( LS with LTS ) ( LS with Preprocessed ) Figure 7: Box plots of the MREs in 10 testing sets based on the ISBSG data Table 6: Mean and median MREs of the outliers in 10 testing sets based on the ISBSG data LS with LTS LS with preprocessed Mean 3.0672 2.7770 Median 2.163 2.08 NN provides the best estimation accuracy on both the ISBSG and the Bank data.
Sentence 2: international Joint Conference on Neural Networks, pages 771 776, 2007.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: All results have confirmed that the subjects that have completely projected the concerns into the artefacts have not presented significant difference in the means of Hits, False Negatives, and False Positive, and thus, strengthening H1.
Sentence 2: to further investigate the distinguishing nature of the Business concern, Table 3 indicates the measures of Hits, False Positives, and False Negatives per participant for Business.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: To account for the costs of a path to the overall objective value, we reduce the capacities of all nodes along this path by the minimum .ow and repeat until no feasible path can be found anymore (reminiscent of the classic Ford-Fulkerson method).
Sentence 2: e.ectively, adding such global bounds cuts the CFG in disjoint subgraphs, in each of which we compute the WCET: No path can traverse a preemption point.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Sender peers are potentially scattered across the Internet, therefore connection to one sender peer could exhibit signi.cantly different characteristics (i.e., bandwidth and RTT) from connections to other senders.
Sentence 2: the following packet assignment strategy can cope with slow senders: once the number of packets assigned to each sender (ki) is determined based on its throughput, the ordered list of packets is distributed among active senders in a weighted round-robin fashion.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In Figures 2-4(b), on top of max and min MFLOPS (MIPS) rates attained for each benchmark, we plotted the corre­sponding MFLOPS (MIPS) rates when incurring the max and min average power consumptions.
Sentence 2: we found that for most benchmarks, while the variations in per­ formance are much more dramatic than those in power con­ sumption, there seems to be no direct correlation between the performance attained and the power consumption in­ curred by application-level optimizations.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In 3rd Virtual Machine Research [21] M. Paleczny, C. Vick, and C. Click.
Sentence 2: on the multiprocessor the round-robin scheduler and 50% uti­lization are roughly equal, with a rampup time of about 1.5 minutes.as the CPU resources are constrained, the rampup timeincreases to around 4 minutes: an increase of more than a factor of 2.5.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: With only one de.nition per variable, lifetime intervals (the main data structure) can be constructed without data .ow analy­sis.
Sentence 2: since values .owing into TRYALLOCATEFREEREG set freeUntilPos of all physical registers to maxInt for each interval it in active do freeUntilPos[it.reg] = 0 for each interval it in inactive intersecting with current do freeUntilPos[it.reg] = next intersection of it with current reg = register with highest freeUntilPos ... ALLOCATEBLOCKEDREG set nextUsePos of all physical registers to maxInt for each interval it in active do nextUsePos[it.reg] = next use of it after start of current for each interval it in inactive intersecting with current do nextUsePos[it.reg] = next use of it after start of current reg = register with highest nextUsePos ...
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [l5]I.Jaobson.Objet­OrientedSoftwareEngineering AUse CaseDrivenApproah.Addison-Wesley,l992.
Sentence 2: wheneverwewanttoassignarelationXtoasystemsESYSTEM .omponentECOMPONENT)wesayXs X).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 2003; Sumner and Popovi´c 2004; Pauly et al.
Sentence 2: features are pre­servedatawiderangeof scales.Inthisexample,afullbodyposeis sculptedusingagraphof226 nodes.Thetailis lifted, arms crossed, left leg moved forward, and head rotated to look backward.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Single thread: When tracking a leukocyte, we use 18 data structures/matrix (1 input sub-image, 1 motion gradi­ent vector .eld, 8 neighbours to store intensity di.erences, and 8 neighbours to store the heaviside value).
Sentence 2: the cores around the ring are symmetrichardware resources (e.g., the ring stops), thus serializing the requests.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It is important to distinguish the point-to-point messages that may be used in the underlying implementation of collective communication from the data .ow directions in collective communication, such as the ones shown in Figure 4.
Sentence 2: phase #2 When an application process reaches a point in the program where it can take a local checkpoint, it saves its local state and the identities of any early messages on stable storage.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In evaluating our privacy .rewall architecture, we .nd that nondeterminism in some applications and in the net­work raises signi.cant challenges for ensuring con.dentiality because an adversary can potentially in.uence nondetermin­istic outputs to achieve a covert channel for leaking informa­tion.
Sentence 2: our system di.ers in two respects.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This is an imposition of the OOP paradigm used to develop DCAS, which enforces en­capsulation and information hiding, favoring good mod­ularization, but also constrains the access of embedded adaptation mechanisms to information (e.g., for anomaly detection) and restricts actuation to their local scope (ham­pering coordinated adaptation).
Sentence 2: our resilience evaluation framework focuses on quantita­tive analysis using measurements, and does not assume the existence of Markov-chains describing the behavior of sys­tem components.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Analogously, the sequential task after the parallel section is a successor of all other tasks or vice versa: each other task is a predecessor of the sequential task after the parallel section.
Sentence 2: x MAXT ASKS = (taskusedj + htasksj ) (13) j.T asks 4.3.8 Cycle free constraint To ensure that the created tasks are deadlock free, the nodes are sorted topologically bytheirdependencies.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: As the authors of previous proposals did, we won t provide co-variance for arrays, since we believe that the complication needed for the related implementation would not be worth the advantages one obtains.
Sentence 2: big applications which make little use of gener­icity features will have little overhead, while smaller appli­cations which intensively use parametric types are likely to be more a.ected by the translation.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We note that prior work on staleness-based leak detection diagnoses this leak because a smallpart of each order sdata structureis stale[9].Melt executes SPECjbb2000about twice aslong as withoutMelt (1166vs.
Sentence 2: size Time Time Time Stale Activated 15,000 7s 7s 7s 0MB 0MB 20,000 11 s 10 s 12 s 0MB 0MB 21,000 12 s 14 s 15 s 0MB 0MB 22,000 OOM 18 s 45 s 90MB 14MB 25,000 OOM 19 s 98 s 94MB 18MB 30,000 OOM 27 s 166 s 118MB 25MB Table 3.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Meanwhile, let us gain some intuition by developing examples.
Sentence 2: formally, we represent the choice of a tag as a numerical index into E, via new rules: G f VALID G f n:#E G f 0: #(cE tE) G f 1+n:#(cE tE) we expect that in practice, you might rather refer to these values by tag, and we shall ensure that this is possible in due course.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Pure Delta-oriented Programming * Ina Schaefer1 Ferruccio Damiani2 1Chalmers University of Technology, 421 96 Gothenburg, Sweden 2Dipartimento di Informatica, Universit` a di Torino, C.so Svizzera, 185 -10149 Torino, Italy Abstract Delta-oriented programming (DOP) is a modular approach for im­plementing software product lines.
Sentence 2: instead, program generation only re­lies on delta modules comprising program modi.cations such that Pure DOP is more .exible than traditional DOP.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For example, it requires that the sched­uler strictly honor thread priorities and that it implement priority inheritance for synchronization locks.
Sentence 2: for example, insofar as scheduling analysis is con­cerned, the real-time thread analyzed in this section could be represented by a workload comprised of three tasks:  1.A task running at ApplicationPriority comprises the work of step 1 and the analogous portion of step 7.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: (i, t, v) E WS[X.piaq otherwise We first prove that CV(i) changes to a value v at and only at the linearization point of a success-ful LSC operation that ends a sequence that invoked LWrite(i, v).
Sentence 2: however such an implementation would be complicated only by the more complicated data structure: no difficult synchronization issues would be introduced by this change.
Relationship: neutral