sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: As shown in Table 5 (column static join-points), the over­head of the kernel_stack aspect is signi.cantly lower in this case, with cost factors between 1.05 and 1.09 (average 1.07).
Sentence 2: most of the overhead of the .rst kernel_stack implementation was ac­ tually caused by the fact that advice had to be given for dynamic join-points.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Maybe (g (Cxthf a)) project (Term t)= proj t project (Hole )= Nothing Therelationbetweentermsand contextscan alsobeillustrated algebraically:Ifweignorefora momentthe abilitytode.nein.nite terms due to Haskell s non-strict semantics, the type Term F represents the initial F-algebra which has the carrier T (F), the terms over signature F.The type ofcontexts Context F X on the otherhandrepresentsthefree F-algebrageneratedbyX whichhas the carrier T (F, X ), the terms over signature F and variables X .
Sentence 2: for recursion schemes, we can move naturallyfrom cata­morphisms,i.e.initialalgebra semantics,tofree algebra semantics: free :: Functor f .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The DaCapo suite is geared towards JVM and hardware design­ers.
Sentence 2: it is important to reevaluate the benchmarks so as to 2 We commented out the toString methods of Block, FlowGraph, RegisterAllocator, Liveness, Node, Tree, Label, MemberRef, Instruction, NameAndType, LocalVariable, Field,and Constant.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Node3:TheinvocationofmethodaddQtr,correspond­ingtonode3,haspostconditionstotalQtrs0=totalQtrs; curQtrs0=1"andpreconditioncurQtrs=0".Thepost­conditionsdonotsatisfyanyoftheconjuncts(onlyonein thiscase)composingtheconditionassociatedwithnode1.
Sentence 2: thisconditioniscarriedovertonode3,inad­ditiontothepreconditionsoftheaddQtrinvocationthat weareconsidering.Theresultingconditionfornode3is allowVend=60^curQtrs=0".
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Indeed, if we took a local interval-based condition similar to the one used for .eld separation for instance, if we required the whole non-virtual zones (not only the data) of non-virtual bases to be disjoint , then we would lose tail padding optimization, and fall back to a naive implementation similar to that of section 2.2.
Sentence 2: we have to compute, for any class C, the set ebo.sC of empty base offsets, i.e.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (Note that in any structure produced by elaborating a datatype dec­laration under this interpretation, the ti s will be abstract types.)
Sentence 2: for example, if m = n then the datatype declaration datatype t1 = s1 and ... and tm = sm matches the above speci.cation if and only if si = ti for 1 = i = n, since this is necessary and suf.cient for the types of the in and out functions to match for the types mentioned in the speci.cation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Instead we may have: let t = term R_trs_algebra "inter(arca(banker),barca(banker))"; normalize R_trs t; ... -: R_trs_signature term = cons(consult-loanList,nil) Here we can see that the banker category has a con.icting per­mission concerning the action of consulting the loan list.
Sentence 2: the output of the analysis tool is rich enough to provide useful di­agnostic information to a policy writer or system engineer.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It is given by G* = ei,k,e£,j ,j.Ni .i,k,£,j where i, j, k and f are distinct.
Sentence 2: by setting yi,k.j = 1 - xi,k.j and y£,j.i = 1 - x£,j.i, we can transform the minimization problem in 4 to the non-linear integer maxi­mization problem, referred to as NLIP1, as follows.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Specifically, the crossover point is at t = 12 hours for A = 10%, t = 18 hours for A = 30%, t = 26 hours for A = 50%, and t = 32 hours for A = 70%.
Sentence 2: in a dynamic IoT environment in which the hostility (in terms of the percentage of malicious nodes) changes over time, dynamic trust management is achieved by choosing the best design parameter settings (a, {) to maximize the service composition application performance.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As Pj is honest (i.e., Adi jk=di jk), based on Equation (3) &#38; (4) the difference between AATi jk and PATi jk equals the difference between ARTTj and (ERTTj+RTTTj).
Sentence 2: in the figure PATi jk is represented by (ERTTj+RTTTj), the blue line, and AATi jk is represented by ARTTj, the pink line.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unfor­tunately, because Intel s VMX extensions cannot be used to request VM exits when the guest operating system returns execution to the guest userspace application, AikidoVM has no way of reprotect­ing these pages before the guest userspace application resumes.
Sentence 2: when temporarily unprotecting a page, AikidoVM en­sures that it is not userspace accessible (i.e.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, because data-.ow propagation provides useful information in all of the cases we examined, according to our scenario of usage, developers would be unlikely to consider the use of data-and control-.ow propagation.
Sentence 2: we believe that the results of this case study, albeit preliminary, suggest that our technique can be e.ective in assisting debugging of failures in real applications.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Counting clock­wise, ri+1 is the next ring node of ri for i .mk, and r1 is = next ring node for rmk.
Sentence 2: we have the total num­ber of sensor nodes Ns = PNh For k=1 mk - Nr + Nl on R. instance, in Figure 2, Ns = 20, where Nh = 2, m1 = 13, m2 = 10, Nr2 = 4 and Nl = 1.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Speci.cally, Sympathy will not report a node crash for node N until (1) it has not received any data from N for an epoch, and (2) no other node lists N as a neighbor in its N E I G H B O R L I S T metric (which can either occur if the node explicitly sends a N E I G H B O R L I S T update with­out N, or if the sink .ushes its cached copy of the N E I G H B O R L I S T because the node has not sent an update during the epoch).
Sentence 2: the failure noti.cation latency will depend on the order of events.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As an entire class of instructions can be processed together, a simple tally of the frequency of each register in a given field can be used to increment the register-pair frequency matrix using the following formula: RPFM[rA][rB] += count(rA) Þ count(rB) Step 3: Construct Register Chain This step takes the graph from step 2 and constructs a new graph which will contain a chain made up of edges corresponding to register pairs that must be encoded a Hamming distance of 1 apart.
Sentence 2: the new graph initially contains just the vertices from the graph from step 2 and edges are added to this graph in order of frequency (most weighted edges first), even if the edge is disjoint.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: An idea along these lines that we are exploring is that part of the cognitive effort of searching for and memorizing related formulas could be reduced by offloading to the software the task of finding related formulas and displaying them (external memory).
Sentence 2: the goal of this work is to encourage the use of disciplined, strategy-based problem solving by end­user programmers through distributed cognition approaches that support a variety of strategies.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: While the Ambient Man­agement Service and the Personal Agenda must be aware of the context information that describes Silva s role and lo­cation in the organization, the Con.guration Management Service also takes into consideration Silva spersonal prefer­ences.
Sentence 2: we notice that the context that fully describes the user Silva comprises not only the context that describes his role at PUC-Rio (location of Silva and his device in the organization), or in the UbiForm Project (schedule of activ­ities), but also the context that describes Silva spersonal preferences and features (the vibration mode to alert about Silva s wife message).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In contrast, our approach identi.es the exact set of input tuples needed in each of even exponentially many derivations (e.g., {{t1}, {t2, t3}}).
Sentence 2: in our example, their approach prunes abstractions that contain {t1, t2, t3}, whereas ours also prunes those that only contain {t1} or {t2, t3}.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Instead, we have shown that architectural middleware a middleware platform that provides native implementation-level con­structs for the key architectural abstractions can be em­ployed effectively in a number of domains, including em­bedded systems [7][10].
Sentence 2: applying Prism-MW [7], USC s adaptable architectural middleware platform, to WSN-based applica­tions thus seemed like a natural choice, and we decided to undertake the challenge collaboratively between Bosch and USC.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It is rendered in Scala as the Session trait, which declares the relation on its type parameter S (which is aliased as Self for convenience) and its abstract type mem­ber Dual, which corresponds to an associated type.
Sentence 2: an instance of type Session [S] {type Dual = D} is evidence of S DualOf D; such a value witnesses this fact by describ­ing how to compose an instance of S with an instance of D (through the run method).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Reducing the pointer size, by using -m32, reduces the number of I-cache data misses dramatically for 181.mcf as can be seen in Fig­ure 2.
Sentence 2: our model has learned that data cache misses and branch instructions (via the performance counter data) are the critical characteristics of this program and suggests the compiler convert pointers from 64-bit to 32-bit, because 64­bit pointers are reducing the effective cache capacity and memory bandwidth.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However by Corol­lary 8, there is negligible chance that a matrix created from U can be inverted (since it is unlikely that it has any sub­matrix that is marked).
Sentence 2: if Pr[InvertA,f (t) = 1] is non-negligible in t, then D distinguishes R(1t , 1m ,p) and U(1t , 1m ,p) which contradicts the WSHA.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This means that there is a signi.cant number of concerns whose inclusion in a particular solution depends on the correct identi.cation of these dependencies, which are not always straightforwardly derived from the require­ments of the system.
Sentence 2: these dependencies may go unnoticed by the SA even if they should be taken into account to satisfy the requirements of a system; (2) a high degree of variability (metrics 4 6), since modeling the FQAs as a family of products, and the automatic materialization of the FQAs base model considerably increases the num­ber of valid resolutions of a FQA that can be generated; (3) a high degree of automation, due to the high number of architectural elements that are automatically generated in comparison with the manual e.ort that needs to be made in order to include the FQAs inside the software architectures of the applications.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As stated above, LoadHI (I) = 1 guarantees schedulabil­ity of an instance I if L(I)= HI.And LoadMIX (I) = 1 guarantees schedulability of the instance if L(I)= LO.
Sentence 2: [0, 10000] Ai [Ai + Ci(HI), 10000] Di Ci(LO) [0, 200] Ci(HI) [Ci(LO), 200] Table 1: Generating jobs randomly for experiments Theorem 2 holds.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However with our modified coalescing scheme with S(v), we have I(b) = 3 and I(f) = 1, and consequently we have S(b) = C(b)/3 and S(f) = C(f).
Sentence 2: even for C(b) = C(f) > 0, we have S(b) < S(f), which places node f in the higher priority for coloring, preventing the spill as the result.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, each value that goes into computing the second checksum is left-rotated by an amount between 0 and 31 (25 - 1) bits, depending on its address.
Sentence 2: with a high probability, the corrupted values are rotated by different amounts, which prevents the lined-up erroneous bits in one checksum from lining up to cancel out one another after rotation in the other checksum.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Wenowgobaktotheexisteneproofofthemapping.
Sentence 2: supposethatpEQGH(t)QG(t)ismappedtoqEQG(t) QGH(t).WeshowthathGH(p,t)?hG(q,t).ByLemma3.9 thisimpliesthatv(p)v(q).Reallthatthemapping ofthepaketsinQGH(t)QG(t)isdoneinasendingor­derofheightsandthatanysuhpaketismappedtothe thepaketwiththeminimalheightinQG(t)QGH(t)that hasnotbeenmappedsofar.Toobtainaontradition supposethatpisthepaketwiththeminimalheightin QGH(t)QG(t)thatismappedtoqEQG(t)QGH(t),and hGH(p,t)hG(q,t).Considerthepaketp ' EQG(t)suh thathG(p ' ,t)=hGH(p,t).Itmustbethatp ' EQG(t)n QGH(t).Wemustalsohavethatthenumberofpaketsbe­lowpinQGH(t)QG(t)isthesameasthenumberofpakets belowp ' inQG(t)QGH(t).thesetofpaketsbelow pinQGH(t)nQG(t)isthesameasthesetofpaketsbelow ' '' pinQG(t)nQGH(t).ItfollowsthathG(p,t)hGH(p,t), inontraditiontoLemma3.10.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We would like to see this type of rigour more often in software engineering survey articles and PhD theses.
Sentence 2: our recommendation is for researchers to adopt as much of the evidence-based approach as is possible, to target systematic reviews (or summaries of such reviews) at practitioner publications, and to treat initial attempts at using EBSE as a means of further assessing the viability of the evidence-based approach.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although traditional Web Services allow communication between dif­ferent platforms and operating systems, they only share syn­tactic information without any machine-understandable se­mantics: only data structures are exchanged amongst ser­vice clients and providers without specifying the meaning of these messages.
Sentence 2: dynamic service composition and discovery are di.cult tasks in traditional service infrastruc­tures and human intervention is often required.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although attackers cannot control, but only hope for, the availability of vulnerable apps on users devices, the reality has been working towards attacker s fa­vor due to the large number of under-trained Android developers and an overall lack of app quality assurance.
Sentence 2: as a de­fensive effort, we designed CHEX to assist apps developers, testers, and market operators in .ltering out apps vulnerable to component hijacking attacks before they reach end user devices.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: After one time slot, there will be at most () 1s along this column.
Sentence 2: at time slot K, there will be 1s along this column, which is greater than or equal to N. min(1,...)minjMjcc.. minc kQ minmaxkcQD.. minmaxkcQDK...  (2) minmaxkNcKQD......... 3) Combined lower bound of K  Based on the above discussion, the lower bound of the value K is the maximum value of the two lower bounds derived above.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At the same time, both UML-based architectural mod­els and architectural description languages fail to describe appropriately the highly dynamic nature of today s architec­tures, with unbounded creation and deletion of components and connectors.
Sentence 2: we are aiming at a modeling method for archi­tectural styles which is expressive to support full dynamic recon.guration, usable for application developers, and which provides tools for simulation and analysis.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, on the 4FC-12SC, for the workloads in Table 2 (same benchmarks, different number of threads), PA and CAMP always perform similarly since both sched­ulers have enough fast cores to effectively accelerate single­threaded applications as well as serial threads (Figure 6).
Sentence 2: there still remains a question, if considering the speedup factor in addition to TLP is important for multi­threaded workloads, and in what cases it can bring signi.­cant performance improvement over an algorithm that relies on TLP only.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If the same code was written with a synchronous wrap, we would have no guarantee about the consumption of v .Infact, the codewould block, as the send encapsulated by the wrap would be executed by the same thread of control executing f .
Sentence 2: the asynchronous event implicitly creates a new evaluation context and a new thread of control;the wrapping functionisevaluatedinthis context,notin the context associated with thread that performedthe synchroniza­tion.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, if we remove C at the left-hand side of B in the above list of active layers, the call of partial method declared in B that uses methods introduced by C may result in failure.
Sentence 2: to .nalize the creation of the list of active layers, we need to remove du­plicate layers from that list according to the rule described as follows: If the same layer is activated twice or more in the same list of active layers, we remove those layers other than the one that has the lowest priority from that list.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: There is an event that should never occur after no-T&#38;S and before the .rst subsequent obtain-specimen : the nurse can never label the specimen vial (label-vial ) before putting a blood specimen in the vial.
Sentence 2: the user could indi­cate that label-vial is a secondary event and then select the answer, No, other events in the alphabet of the property cannot occur before the .rst subsequent obtain-specimen oc­curs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search * Wesley W. Terpstra Jussi Kangasharju Christof Leng Alejandro P. Buchmann Technische Universit-University of Helsinki at Darmstadt, Germany {terpstra,cleng,buchmann}@dvs1.informatik.tu-darmstadt.de jakangas@cs.helsinki.. ABSTRACT Peer-to-peer systems promise inexpensive scalability, adapt­ability, and robustness.
Sentence 2: they are an attractive plat­form for .le sharing, distributed wikis, and search engines.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This has the e.ect of analyzing only the alias possibilities that actually occur during concrete executions without resorting to a global (and necessarily imprecise) alias analysis that reasons about all executions.
Sentence 2: in many cases, we can show that Dash produces abstractions that are ex­ponentially smaller than those considered by tools such as Slam [3] and Blast [18].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When Csub :: P is a non-re.ning method, then its allowed behavior is not a subset of the allowed behavior of the su­perclass method CP :: P it is overriding.
Sentence 2: other superclass methods that call down to P may not behave as speci.ed, since they were veri.ed using the superclass spec­i.cation of CP :: P .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Toranktypenodes,RRT.rstcalculatesthephase growth factor (g)ofeachtypenodeasgti =pti *(Q-1),wherep isthenumberofphases(orcollections)thatt hasbeenpotentiallygrowingandQ istheratioofvolumesofthisphaseandthepreviousphasesuchthatQ >1.SinceQ >1,g >0.Eachtypenode srankrt iscalculatedbyaccumulatingphasegrowthfactorsg overseveralcollectionssuchthatabsolutegrowthisrewarded(rti =rti.1+gti )anddecayispe­nalized(rti =rti.1-gti ).Higherranksrepresentahigherlikelihoodthatthecorrespondingvolumeofthetypegrowswithoutbound.SinceRRTonlyreportstypesthathavebeenpotentiallygrowingforsomeminimumnumberofphases,the.rsttimeatypeappearsinagraph,RRTdoesnotreportit.Corkranksreferenceedges(re)usingthesamecalculation.
Sentence 2: 2.3 Correlating to Data Structures and Allocation Sites Reportingalow-leveltypesuchasString asapotentialcandidateisnotveryuseful.Corkidenti.esthegrowingdatastructurethatcontainsthecandidategrowthbyconstructingaslice intheTPFG.Wede.neaslice throughtheTPFG tobethesetofallpathsoriginatingfromtypenodet0suchthattherankofeachreferenceedgertk -tk+1onthepathispositive.aslicede.nesthegrowthoriginatingattypenodet0followingasequenceoftypenodes{t0,t1,,tn}andasequenceofreferenceedges(tk,tk+1)wheretypenodetk pointstotk+1intheTPFG.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In a method body of NProxy, the invokeMethod method of the endpoint is used to forward the method invocation to the may-be-of.oaded class N. The parameters of invokeMethod are: (1) the class N s full quali.ed class name; (2) the instance ID of class N. Each NProxy holds an ID of a class instance N. The ID is initialized when this proxy is created for the correspond­ing app class instance.
Sentence 2: the endpoint can use the class name and ID to locate the N instance uniquely; (3) the bytecode-level method signature.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The space used by P IP E R on any time step is the sum of frame sizes of all contours c which are either (1) associated with a vertex in some worker s extended deque, or (2) suspended, meaning that the earliest unexecuted ver­tex in the contour is not ready.
Sentence 2: let SP denote the maximum over all time steps of the stack space used by PIP E R during a P-worker ex­ecution of G. S1 is the stack space used by PIP E R for a serial execution.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Note that if the Jikes RVM were written in C or C++, as other VMs are, our dynamic analyses and optimizations would not be needed for the VM code.
Sentence 2: we do not analyze VM classes whose names start with com.ibm.JikesRVM , instead we make optimistic assumptions when these classes appear in our call graph, and we neither insert additional fences nor perform fence insertion optimization on those classes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This problem can be slightly allevi­ated using queues of di.erent priorities but the IEEE 802.1D standard allows up to 8 priority levels, only, which is insuf­.cient for priority scheduling of tra.c streams.
Sentence 2: several real-time Ethernet (RTE) protocols were developed that in one way or another control the tra.c submitted to the network and allow enforcing real-time re­sponse, such as AFDX, TTEthernet, PROFINET-IRT, Ether-CAT and EthernetPOWERLINK.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Whereas meta­physical realism objectivisticallly takes the viewpoint that the real world exists independently of the knowing or perceiving subject, for metaphysical idealism there is subjectivistically no objective reality independent of the human spirit.
Sentence 2: when applied to epistemology, the truth or falsehood of a belief is seen by the objectivist as a decisive objective characteristic which has to be defined in terms of its consistency with objective facts.
Relationship: reasoning