sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: In addition, up to 50% of patients treated for alcohol dependence experience relapse in the 2 years following treatment, even after achieving abstinence [4].
Sentence 2: this study proposes a phone-based suppor t system, called SoberDiar y, that helps alcohol-dependent patients maintain sobriety in their daily lives following completion of alcohol withdrawal treatment.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If wecanarrange R2 the memory processors such that their number M becomes negligible compared to P when increasing R, the resulting algorithm meets this condition.
Sentence 2: for a design with v P =T(R2), we maychoose M to be O(lgR), orO( R), or M = O(R), orM = O(R lgR), for example.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, in this case our proofs would have to consider the possibility of the control-.ow going from any statement in a process to the schedule function, and from there to any other process.
Sentence 2: in reasoning about a system call implementation we would end up having to reason explicitly about invariants and actions of both schedule and all other processes, making the reasoning unintuitive and, most likely, intractable.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Feature interaction problems found in systems developed without careful architectural design are hard to analyze and solve because it is di.cult to see how behaviors of components are coordinated to create services, i.e., how control informa­tion .ows between components for services.
Sentence 2: in order to improve quality of the product, re-engineering of the product had to be enforced at a later stage.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: bound for W (t), we have that, -c1n P(S(t) > (.¯+ e)n) = P(W (t) > (.¯+ e)n) = e , for some constant c1 > 0.
Sentence 2: p(F1 c) = P(F2 c) + (.¯+ e)nT (n)P(.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: From a purely pragmatic perspective, we note that our concern is not with the internal machinations of a process, but the utility of its output.
Sentence 2: while our current programming paradigm tolerates the GIGO mantra (garbage in, garbage out) natural systems spend considerable e.ort sanity check­ing and correlating often con.icting sources of information to make a best e.ort attempt at satisfactory output.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In contrast, a Figure 6: Streaming time as a function of d0, B = S = 20MB, br = 128kbps, vmax =5m/s, .-11 = .-21 = 30sec Figure 7: Minimum bu.er size as a function of S, .-1 .-1 d0 = 100m, br = 256kbps, vmax =5m/s, 1 = 2 = 30sec large bu.er size ensures that we can use the maximum pos­sible bandwidth to stream the multimedia object if the link can last long enough.
Sentence 2: we observe that determin­ing the minimum bu.er size is very important for improving mobile streaming applications.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This field, which is at the border of the software and hardware domain, is often outside the instructors' specialization, thus causing them to feel uncomfortable with the material they teach [3], Moreover, the increasing complexity of computer hardware &#38; software systems makes them pedagogically inappropriate tools for instruction.
Sentence 2: instructors have had to turn to simulators and visualization tools as teaching aids [12].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Due to delays in the network and processing delays at e and e', it is likely that e' will not ' receive the query until some time t> tiss.
Sentence 2: similarly, e is unlikely ' to receive e' s response to his query until some time trcv > t. e cannot conclude that f was valid at either tiss or trcv ; he can only infer that f was valid at some time t where tiss = t = trcv ; we will discuss methods for .ne-tuning these types of inferences later in the paper.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: of Test Cases Selected 80 70 60 50 40 30 20 The results of this study will guide our development of pro-10 .lers in the future.11 0 To perform this study, we used DejaVOO to select dan­gerous edges in P. We then used a data-.ow analysis that considers each method M, and determines whether some dangerous edge in M is reached on all paths from the entry point of M. If a dangerous edge is reached over all paths in M, all test cases that enter M will be selected by an edge-level version of Retest.
Sentence 2: in this case, no further 11The development of a pro.ler for recording information at the edge level requires signi.cant e.ort, and the results of this study can help us decide whether this e.ort is worth­while for regression test selection.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, a traditional approach models each component and link separately as a variation point in and of itself, each governed by its own redundant (often Boolean) clause to determine inclusion or exclusion.
Sentence 2: the way in which an ar­chitect logically views and interprets a PLA, i.e., in terms of the features that determine differences among individual products, does not match the modeling con­structs available to express those differences.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: ABASISFORDSLDESIGN In past work, we demonstrated how separate concerns (e.g., layout and behaviour) within a single DSm could be isolated and mapped onto concern-speci.c lower level for­malisms (e.g., Statecharts for behaviour), and later woven back together into complete artifacts [13].
Sentence 2: our current claims 5 the semantics of high-level models is de.ned in terms of the well understood semantics of low-level programming languages.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We are thus guaranteed that if we compose an architecture model of a MSC specification with a LTS constraint of a simple negative scenario that is the result of a rejected implied scenario, then the constrained architecture model will continue to provide the specified behaviour of the positive part of the MSC specification and will not exhibit the behaviour of the rejected implied scenario.
Sentence 2: we can compare the constrained architecture model and the trace model with respect to maximal trace equivalence to detect further implied scenarios.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Correspondingly, the original data.ow along each control .ow path is basically maintained in the tree(s) as well.
Sentence 2: the lifetimes in the tree(s) are more natural; the basic blocks with close data.ow relationship are putting close together, which avoids unnecessary data.ow transfer between them af­terward, and also reduces spilling.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Whereas, usual impact analysis methodologies consider the revision phase as completed, thus presenting to the user the propagation of the completed adaptation to the existing system.
Sentence 2: the process itself is moved from the .le repository back to the IDE supporting the system design; in this way, modi.cation analysis can be performed at higher levels of abstraction and are no longer limited to .le-or text-based reasoning.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Given a computed answer for p(xx), one can obtain a computed answer for p(xy)via renaming.
Sentence 2: we reserve a set of special variables .={.1, ··· ,.n}where n is the maximum arity of the predicates in .and de.ne the meaning of a predicate p of arity m as the set of computed answers for p(.1, ··· ,.m).We further denote the sequence of arguments in p(.1, ··· ,.m)as .(p).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: a) The PFR of NTFD/-E Message delay and messages loss cause the false detection of NTFD-E. We already considered these two factors in TD_NTFD-E.
Sentence 2: the PFR of NTFD-E can be calculated by: PFRNTFD-E = pc(T)* TD_NTFD-E /T.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Connectivity Metrics Network connectivity information, col­lected from every node in the network, helps Sympathy detect and localize routing failures.
Sentence 2: sympathy collects every node s cur­rent RO U T I N G TA B L E its sink, associated next hop, and path quality and N E I G H B O R L I S T, which lists all of its neighbors, whether involved in routing or not.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: SU G G E S T I O N S Unsupported criticism is dif.cult to take and destructive criticism not only has the possibility of making the author F O R uncomfortable, but provides no outlet for learning.
Sentence 2: iM P ROV E M E N T [Coplien 1997] Provide constructive feedback to the author; that is, offer no criticism unless it is accompanied by a well­considered, actionable suggestion for improvement.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As a result, for all i, element (i, Ln/2J + 1) of the matrix gives an estimate of the RTT of a majority of processes to process i. Algorithm 1 Delay-aware leader election.
Sentence 2: even if the leader changes after GST, this happens 1: Initialization: 2: .p : localrttp[p] .8 3: rp .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It follows that in E(MI) process a does not take any steps and in particular does not top-write in any of the rounds iI,iI +1,...,j.
Sentence 2: from the de.nition of function erase, it follows that MI equals N in rows iI,iI +1,...,j, which completes the proof of (d2).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although, from a theoretical point of view, De.nition 3 leads to a correct dependency pairs approach for OS-TRSs (see Theorem 1 below), some useless pairs could be gener­ated (see the examples below).
Sentence 2: it makes sense to use a com­bination of (unsorted) syntatic checking and a reducibility test by narrowing.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 5.3 Timing Covert Channel (Example 3) The third scenario describes a covert timing channel that occurs when a Low subject executes two GetClock statements (gc1 &#38; gc2), and between them a High subject prevents the Low subject from executing, through execution of a Read_dev/Write_dev or direct file operation (rw state in the text).
Sentence 2: when the Low subject next runs, it can examine the clock to detect this interference with its access to the CPU; these channels are thus often called CPU channels.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 1Note that in this paper we do not compare our results to the ones from [8], because [8] essentially implements the very same analyses, however speci.c to tracematches only.
Sentence 2: if our dependent-advise-based optimizations, applied to tracematches, were compared to the tracematch­speci.c ones in [8] on equal machines and JVMs, both would yield the very same result.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: VISION We consider that expressing and using a company-speci.c common terminology is central for enabling the use of archi­tecture reconstruction approaches in the industry.
Sentence 2: the architects should be able to adjust the output of the recon­struction tools (expressed in an intermediate terminology after having been extracted via technology-speci.c adapters that address the problem of heterogeneity) and to make it correspond to the architecture meta-model of their interest.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 2i+12£-1 1=i<£ We upper-bound the sum in the last line by observing that each term is at most 1, and also the i-th term is at most a 1 - 1 - k = k , by the known inequality (1 - E)k = 2i+1 2i+1 1 - kE.
Sentence 2: kk f(k) = 21+2+ 2i+1 2£-1 1=i<log k log k=i<£ kk = 2(log k +1)+2 + = 2 log k +6, 2log k 2£-1 since f = plog nl= log k. For f(k) = 2 log k + 6, we have .f-1(k)= O(log * k).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although bandwidth and access will continue to improve over time, the service and transfer to device-back latency is unlikely to get improved.
Sentence 2: the main need in such a case is the deployment of a resource migration and offloading approach that aims to release an aggravated terminal in data center rack, and migrate according to certain parameterized requirements the resources to other racks based on the minimized service and processing delay, respectively.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Consider the follow­ing: aspect X extends StaticRel {}; aspect Y extends StaticRel {}; The concrete aspect X results in .elds Fwd.fwd and Bwd.bwd being de.ned for classes Aand Brespectively.
Sentence 2: likewise, Yresults in Fwd.fwd and Bwd.bwd being de.ned for B and C. the effect of extending StaticRel depends very much on the actual type parameters supplied.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The techniques proposed in those studies mainly prohibit changes of target programs when the change causes pointcut mismatch.
Sentence 2: when the programmer has to change the target program against the interface, it is the  Figure 6: Evolution of the connection classes and the noti.cation concerns Table 1: The result of previous versions of aspect application to later versions programmer s responsibility to .x the interface and aspect de.nitions.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since aj s double in each iteration, aj (t) >n · a * for t := 3log n. Now recall from the initialization phase that a * = maxj mini(fi + cij )/n.
Sentence 2: a(t) will exceed mini(fi + j cij ), which means that client j, all by itself, is paying for more than the amount needed to open facility ,where i * i * is argmini(fi + cij ).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Typically, a unidirectional association is mapped to an instance .eld declared in the source class, and a bidirectional association is mapped to a pair of instance .elds, each of which is declared in one class participating in the association [18].
Sentence 2: a runtime link may represent a design-level unidirectional association or half (one direction) of a bidirectional association.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The results revealed ample opportunities for environments to better support end-user programming as a design activity.
Sentence 2: our work makes three contributions: 1) the me­thodology of applying a theory-based design perspective to programming, 2) evidence of the usefulness of using this approach through insights gained, and 3) the insights them­selves into end-user programmers problem-solving at­tempts, with implications for design of end-user program­ming environments for mashups.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This results in an even division of a workload across whatever subset of nodes is powered-on.
Sentence 2: performance can be scaled up in an ideally power-proportional manner, at the .ne granularity of the throughput of one node at a time, to a maximum of roughly e r-1 p nodes, where r is the number ofreplicas stored for that data.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thealgorithmprocesseseachedgeinamethod'sapegraph.
Sentence 2: foreachannotationonanapegraphedgerepresentinga store,theassociatedloadspotentiallyoccurringafterthe storeareidentifed,anda(store,load)tupleiscreated.The annotationsrefecttheresultsofthefowsensitivepoints­toescapeanalysisusedtobuildtheapegraph.the evsandcsstatementnumbersontheseannotationsareade­quatetoidentifythereachableloadsfromaparticularstore.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In a full-associative cache, datafrom any memorylocation canbe storedin anylocation(cacheline)inthe cache.
Sentence 2: only capacity misses canoccur accessestodatathatisnotinthe cache whenthecacheisfull.Lastlevel caches areusuallynotfully associative for technological limitations they would be too ex­pensive and take too muchpower[20].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In particular, the customized work.ow consists of three key analysis routines as shown in Figure 2.
Sentence 2: in order to better distinguish reactants and products, the raw image for .ame tracking that is taken by experiment cameras during the ex­periment needs to be median-.ltered; the image is then bi­narized with the threshold intensity selected using Otsu s method [2]; 0 is used to represent the reac­tants and 1 for the products [18].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: On the other hand, for a special input with Nx = Ny, we can have the same memory area for A2A source and destination data in each communication tile, by generating the y-z-x layout (as opposed to z-y-x)after A2A and Unpack.
Sentence 2: for the case of Nx = Ny, Transpose rearranges the memory layout from x-y-z to x-z-y, so that we can improve the overall 3-D FFT performance.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The main result of this section is that given an unannotated Proteus program (no abst or cont or update ex­pressions), we can statically infer all of the program points that are con-free with respect to all types in the program, and insert update there.
Sentence 2: we eliminate the need for conFree[ - ]2 and we make the update behavior of the program easier to reason about, since many acceptable update points are known statically.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To avoid interfering with a VEE s code generation and code cache management mechanisms, Dimension uses the probe-based instrumentation technique, replacing a program s binary instructions with jumps to invoke the instrumentation code [11].
Sentence 2: a VEE needs to provide the location of both the source and target code to Dimension, and Dimension then can analyze the instructions and make instrumentation decisions according to an instrumentation specification.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Observe that if a subsequence x is fre­quently occurring, all subsequences of x also occur at least as frequently as x.
Sentence 2: we consider only maximal subsequences, i.e., it is the case that every sequence(si)in S is not a subsequence of any other sequence present in S. For example, if the set of sequences is given by {(a .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Second, this system was produced and maintained by a di.erent cor­poration from the one responsible for the three earlier sys­tems.
Sentence 2: the development environment, the prevailing corporate culture, and the development paradigms are all likely to di.er from those of the earlier systems, providing a good test for the adaptability of the prediction models to a wider variety of systems, and helping to convince potential users of their value.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: DoctorMe illustrates the potential for combining creative tools while enhancing public health through crowdsourced data.
Sentence 2: the two main objectives of DoctorMe s participatory surveillance approach are; (a) to provide users personalised health care recommendations through a feedback loop based on the reported symptoms, which consequently contributes to improved personal health and potentially decreases the costs of medical care, and (b) to utilise the captured data on an institutional level to track public health trends and identify potential disease outbreaks, which may be analysed by the Thai Bureau of Epidemiology, local hospitals or veterinarians.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We believe that the history of soft­ware components in capital markets is not the sole indica­tor of s, and, it is possible to look in the change patterns of modules throughout their lifetime in the light of several other environment parameters like users, external services, socio-technical implications etc.
Sentence 2: we intend to formu­late indirect measurements of s in terms of the environment parameters that are speci.c to the particular examples we choose to collect historical information.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: More speci.cally, we measured that sequential blueprint pro.ling intro­duces an average overhead of factor 12.31, while a naïve parallel implementation introduces an average overhead of factor 190 on standard benchmarks.
Sentence 2: to overcome the parallelization over­heads and to improve performance, we make the parallelized tasks coarse-grained by aggregating the invocations to these methods in a thread-localbuffer and processing them altogether when thisbuffer is full.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Overall, the challenges regarding the alignment BPs and enterprise mashups include the re.nement of requirements, the discovery and composition of interactive mashups com­ponents, as well as the integration of human activities in work.ows.
Sentence 2: we present a continuous model-driven development method that aims to .ll the gap between task­oriented problem space and service-oriented solution space by making use of task-modeling and UI mashup concepts.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Face validation in this phase of model development consists of at least three methodological elements executed by potentially di.erent human experts: Animation Assessment A human expert assesses the an­imation of the overall simulated system (or of parts of it) whether the simulated system appears to behave like the original system.
Sentence 2: the animation must be on the appropriate level of detail and display all rele­vant dynamic aspects of the elements in a way that they are easily detectable by a human.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In contrast to SMT-solving, the aim of SPL-solving is to (preferably) onlyevaluateperformance predicates necessary for deciding the satis.ability of a formula (recall evalua­tion skeleton from De.nition 9).
Sentence 2: while check­ing the feasibility of a skeleton valuation, we identify the satis.ability-irrelevant set with respect to this valuation and consider only the relevant variables.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, this detection is limited by the lack of scalable andprecise reference/heap modeling(a well-knownde.ciency of static analyses), re.ection, multiple threads, scalability for large programs, etc.
Sentence 2: inpractice,identi.cationof memory leaksis more often attempted withdynamic analyses[23,4,16,17,40,5, 36,6,25].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since C(R[K -1]) = C(R[K]) = C(R[K + 1]), and the cover time is also monotonous with respect to the size of the ring, without a.ecting asymptotic bounds we can assume that K is even an N is odd, i.e., K = 2k and N = 2n-1.
Sentence 2: by induction, we can show that the number of agents at node v will be even at all times, and the arrangement of pointers on the ring (except for node v) is symmetric with respect to the axis of symmetry passing through v. the cover time for the N-node ring with K agents is asymptotically the same as the cover time of a n-node path with k agents, starting from an initial placement of all agents on one of the end-points v of the path.
Relationship: reasoning