sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: (Bit-vector encoding, presented in Section 4, is an example of a uniform encoding which is non-constant time.)
Sentence 2: for a type bEcaT, let radenote its ordinal (i.e., an in­teger in the range t ,b,b,b{ f) in a postorder traversal of T. A basic property of postorder traversal is that a r=omaa/x {/rt/erhnbb (4) Let aabe de.ned by a a=ommibn {/rtteah-bb (5) Combining (4), (5) with the fact that in postorder traversal the de­scendants of any type are assigned consecutively, we .nd that eahnb iff pp aa r rab (6) in relative numbering, each type eis encoded by an inter­val radrt]as exempli.ed by Figure 2.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [6]C.Brabrand,A.Mller,M.Riky,and M.Shwartzbah.Powerforms:Delarativelient-side formfeldvalidation.WorldWideWebJournal,3(4), 2000.
Sentence 2: 3.3 Policy Compiler ThepoliyompilertakesanSPDLspeifation(asde­sribedinSetion3.2)andompilesitforexeutiononthe SeurityGateway.Validationrulesandonstraintsarealso ompiledintoJavaSriptreadytobeembeddedintoforms andexeutedonlients.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: authenticated(admin ) (8) Both predicates can be combined to a single implication, which results in the following AutoFocus/SMV formula: implies(is Msg(MenuService.menu2config ), (MenuService.userMode == adminMode &#38;&#38; (9) StartService.userMode == adminMode)) That means, every time a message is sent on the channel menu2config, both the StartService and the MenuService have to be in the adminMode at the same time.
Sentence 2: in a model where the described pattern has been applied, veri.cation of the authorization predicate (2) can be simpli­.ed by splitting it into two properties: one predicate stating that service s acts correctly based on the information for access control that is locally available, and one predicate stating that the information for access control is synchro­nized correctly.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Then, in Section 3, we recall some basic de.nitions and properties of alter­nation.Several typicalproblemstogether with succinctalternating algorithms aredescribedinSection4.InSection5, we showforthe variousproblemshow apossible solution canbe computed in case of a yes answer.Alter-Javainconjunctionwith somecodeexam­plesispresentedinSection6.We reportontheimplementation and optimization of our Alter-Java framework and on .rst experimen­tal results with thisframework inSections7 and 8, respectively.
Sentence 2: for the Cat and Mouse game, the number of possible game con.gurations explored along each path cannot exceed n 2 , where n is the number ofverticesin thegraph.For theoretical con­siderations,the countertechniqueis very usefulinthatitguarantees certain upperbounds on thelength of computationpaths.forpracticalcomputation, they arefarfrom optimal.First, counters do not exclude cycles completely; theyjustguarantee a certain up­per bound on the the worst-case effect of cycles.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [5]A.Acharya,M.Uysal,R.Bennett,A.Mendelson, M.Beynon,J.K.Hollingsworth,J.Saltz,and A.Sussman.TuningtheperformanceofI/Ointensive parallelapplications.InProceedingsoftheFourth WorkshoponInput/OutputinParallelandDistributed Systems,pages15{27,Philadelphia,May1996.ACM Press.
Sentence 2: blueHorizonhas8-waySMPsandrequiresjobs tousethesamenumberofprocessorsoneachnode.There, having4dedicatedmigratorsallowsustousefewernodes (6)thanhaving2or3migrators(17and7nodes,respec­tively).Byusingfewernodes,wearechargedfewerSUs, betterutilizetheSMPs,andwaitmuchlesstimeinthejob queue.Thusweused4dedicatedmigratorsonBlueHorizon.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We for­malize our approach by designing a minimal yet fully functional transformation language, Core QVT-Operational-Modular, short cQVTom, that is based on the conceptual core of QVT-Operational (QVTo) and that embraces an interface for rigorous speci.cation of both control and data dependencies.
Sentence 2: filter(typeof(Activity)).head activity2Process(activity) doLateResolution  } } (a) First module @TransformationInterface @ModelIn(#["activitymodel.StartAction", "activityModel.StopAction"]) @ModelOut(#["processModel.Step"]) interface IAction2StepModule { def Step mapAction2Step(Action self) } @TransformationModule class Action2Step implements IAction2Step { @Creates(typeof(Step)) override Step mapAction2Step(Action self) { result.name = self.name self.succ.lateResolveOne [ result.next = it ] result.isStart = self instanceof StartAction result.isStop = self instanceof StopAction } } (b) Second module Figure 7: Activity2Process example in Xtend2m Interfaces must be indicated with @TransformationInter­face, and classes with @TransformationModule.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This sort of complexity is inherent in software system design; it characterizes even the creation of small-scale software systems by individuals, such as in programming assignments to be solved by students, personal programming projects, etc, and many empirical studies of programming practice have pointed to aspects of the problem­solving process [e.g., 11].
Sentence 2: copyright 2005 ACM 1-59593-223-2/05/0011...$5.00.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: (The number and length of execution paths grow so rapidly in the Traveling Salesman benchmark, a branch­and-bound search with a trivial bounding procedure, that exhaustive test generation was not feasible even for a com­plete graph with N =5 vertices.
Sentence 2: further, we show that, under certain conditions, this procedure is sound for complexity analysis i.e.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Finally, for the partition that holds the other references and which is managed by the LRU replacement scheme, the expected number of buffer hits per unit time and the expected marginal gain value can be calculated from the buffer hit ratio using ghost buffers [11, 10] and/or the Belady s lifetime function [14].
Sentence 2: in the next section, we review related work.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: One simple strategy is to fall back to a representation of argument lists as list of tagged unions at least internally.5 Danvy s approach is to make use of continuation-passing style in the implementation of the interface.
Sentence 2: 1.2 Contributions This paper makes the following contributions:  Our design enables a concise implementation, and as a conse­quence provides new justi.cation for fully supporting variadic functions in a foreign-function mechanism.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Turkle and Papert [18] regard concrete approaches not only as a matter of age, but as a matter of personal learning style: Planners , as the personification of one extreme, proceed in a very structured manner.
Sentence 2: such concrete experiences can also involve the own body and then lead to body or ego syntonicity [10], and thus become especially meaningful for the learner.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: timevalue :: Component timevalue = do time <- timeTick 1 mkLabel [textB (lift1 show time)] textB ::Has_text w=>Behavior String->Conf w timeTick :: Time -> GUI (Behavior Time) lift1 :: (a -> b) ->Behavior a->Behavior b The function timeTick creates a behavior that represents the time, and changes at a given frequency.
Sentence 2: a Component represents an action that produces a widget.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Therefore, we propose the usage of the behavioral part of fUML for de.ning the operational seman­tics of a DSML.
Sentence 2: unfortunately, this bene.t is usually not provided when weaving the behav­ior into the abstract syntax of a DSML in terms of an action language, such as fUML, because developers may not es­cape the borders of the action languages virtual machines.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In the ideal scenario, all modeling constructs are in­trospective in the sense that they provide access to the in­formation enumerated in section 3.
Sentence 2: component-based architectures [13] consist of compo­nents which are objects with a re.ected interface, compo­nents containers used in component assembly, and scripting used by non-programmers to wire together components.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: If Gx is the bottommost activity in p s ready deque, this implicitly means that G0 was the last descendant with a de­pendence edge to Gx s next instruction.
Sentence 2: another point to note is that the activities in SAB upon getting enabled are inserted between F and W in the deque and are added to the set W. Let us now see the progress at node n from this instant onwards.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In our approach we use the algorithm introduced by [24] to reduce the time for exacting functional dependencies by replacing database instances with a more compact representation that is, the form instances.
Sentence 2: 4.3 Construction of the hierarchical structure of forms In order to have a precise view of the hierarchical relationships of a form and to clearly understand its meaning and facilitate the interpretation and the extraction of the domain semantics, the form XML schema is transformed into a form hierarchical structure without loss of information.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Note that j avac, which spends over 50% of its garbage collec- DeTreville's work on garbage collectors for Modula-2+ on the tion time searching for cyclic garbage to collect, actually collects DEC Firefly workstation [12] is the only comparative evaluation less than 4,000 cycles.
Sentence 2: our algorithm performs each phase in its entirety for all of the roots, and is therefore linear in the size of the object graph-O(N+ E) -since the mark, scan, and collect phases each traverse at worst each object and each pointer.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Early Aspects at ICSE 2008: Workshop on Aspect-Oriented Requirements Engineering and Architecture Design  Mónica Pinto Universidad de Málaga, Málaga, Spain pinto@lcc.uma.es Paul Clements Carnegie Mellon University, Pittsburgh, USA clements@sei.cmu.edu  Ruzanna Chitchyan, Awais Rashid Lancaster University, Lancaster, United Kingdom rouza@comp.lancs.ac.uk marash@comp.lancs.ac.uk Elisa Baniassad Chinese University of Hong Kong, Hong Kong, China elisa@cse.cuhk.edu.hk  Ana Moreira, João Araújo Universidade Nova de Lisboa, Lisboa, Portugal amm@di.fct.unl.pt ja@di.fct.unl.pt Bedir Tekinerdogan University of Twente, Enchede, The Netherlands bedir@cs.utwente.nl ABSTRACT The Early Aspects @ ICSE 08 is the 13th edition of the workshop on Early Aspects [1].
Sentence 2: we hope to identify existing unsolved problems and their potential solutions, while still contributing to the maturity of Early Aspects as a discipline.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The EC sends Serialize _Permit messages for con.icts in the Global-Permit case and/or Serialize _Deny messages for con.ict in Global-Deny (.ow 4.2.1) to the nodes in the graph that don t have any incoming edges (i.e., to nodes that execute in parallel) as detailed in algorithm 3 for the permit case (and similarly for the deny case).
Sentence 2: these .ags can have a value of true or false (i.e., both cannot be true for the same request).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Unlike PDAs, the restrictions on VPAs allow them to re­tain closure under complementation and intersection, and thus language containment is decidable.
Sentence 2: ex-prod ex-cons 43 26 11 7 3 2 9 4 5 3 2.12 2.24 0.35 4.90 Y 0.10 4.76 Y ex-prod ex-cons-.g3 43 25 11 7 3 2 9 4 5 3 2.12 2.09 0.16 4.49 N 0.10 4.61 N ex-prod-§2.5 ex-cons-§2.5 43 25 11 7 3 2 10 5 5 3 2.29 2.40 0.70 4.87 N 0.10 5.09 N gzip-prod gzip-cons 4396 4396 100 100 17 24 51 25 71 50 26.3 27.8 123 177 N* 101 157 N* gzip-prod gzip-.x-cons 4396 4389 100 100 17 24 51 25 73 51 26.3 27.8 583 646 Y 102 156 Y bzip2-prod bzip2-cons 5772 5772 121 121 15 13 32 8 29 10 26.3 27.4 47.7 102 Y 47.1 101 Y png2ico-prod ico-spec-cons 806 n/a 39 n/a 1 n/a 22 29 26 28 9.48 n/a 14.4 33.1 Y 0.16 10.1 Y Figure 7: The experiments.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Certain answersandcanonical universalsolution The main dif­.culty in answering a query Q against the target schema is that there could be many possible solutions for a given source.
Sentence 2: the key ideaof[11]istousetreepatternstode.neinformationcontainedindoc­uments, and to use them to represent compactly the certain knowl­edge from the collection {Q(T ' )) | T ' is a solution for T}.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Examples of features in time series data that could be useful include two cate­gories: (1) statistical features such as mean, variance, or values of various coe.cients resulting from transformations of the time series (spectral, auto-correlation, wavelet trans­formations), and (2) structural features [26], such as a pat­tern, categorical variance to name some examples.
Sentence 2: this characteristic is nec­essary for any scalable performance analysis technique pro­cessing monitored data across HPC systems with thousands of processors.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Figure 10 reports the correlation values among the metrics 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 p Figure 10: Correlations among four SNA metrics in random graphs Size and Ties, Brokerage, e.Size, for random networks with di.erent parameters p. We built 30 random networks, with 100 nodes, for each value of parameter p, which represents the probability that a couple of nodes is connected by one edge, for di.erent values of p among zero and one.
Sentence 2: our analysis is thus a static analysis, and we do not consider run-time dependencies.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Currently, many automated techniques for determining scratch pad configurations rely on compile-time analysis of the program; unfortunately these analysis approaches limit the scope of such memory optimizations, since they assume that the program is written in well structured manner, where all repeating accesses to the memory occur inside for loops and furthermore, all memory accesses are generated by array references with affine index expressions (which we name the FORAY form).
Sentence 2: affine address functions have the following form: index = const + C1*iter1 + C2*iter2 + + CN*iterN, where index is the access address of the memory reference; const is some constant term (base memory address); N is the loop nest level of the memory reference; C1 ..CN are integer coefficients; and iter1 .. iterN are current values of the loop iterators (iter1 is the iterator of the innermost loop).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: After dragging-and-dropping required GUI elements from the RAP onto the RAV and de.ning the names and func­tions of these elements in RAV, the user generates the Re­play Script (3).
Sentence 2: it is laborious and ine.cient to understand the source code of the reference applications and schemas for their data storages in order to write pro­grams to extract test cases for target applications.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Related Work Perhaps the most relevant previous work to this research is trace­based aspect mechanisms in which join points are runtime exe­cution events and pointcuts consist of patterns of events (Trace­match [2], Declarative Event Patterns [25], and Trace-based As­pects [7]).
Sentence 2: in fact, it is through this shared context that one establishes a relationship between var­ious join points.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Categories and Subject Descriptors D.2.7 [Software Engineering]: Distribution, Maintenance, and Enhancement Restructuring, reverse engineering, and reengineer­ing; D.3.2 [Programming Languages]: Smalltalk General Terms Design, Languages  Keywords design, model, version, software analysis, object-oriented language, Smalltalk 1.
Sentence 2: the metamodel in Figure 7 is simpli.ed, in the complete one Orion-Package inherits from FamixPackage, OrionClass from FamixClass, etc.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Issue 9 Processes and instructions for quality assured release of software are not always adopted: The companies have established well documented processes with instructions and rules for securing that software is quality assured before it is released to production.
Sentence 2: table 3 Principal layout of the cross-case array To enhance the validity of the cross-case comparison, this procedure was conducted separately and in parallel by two researchers.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Especially for a potentially fast growing collection of use experiences with a service, the amount of data to be handled raises questions with regard to storage locations and synchronization issues of this information, and serious concerns about service performance if this additional contextual information defers the functional communication of a service.
Sentence 2: [19] Repenning, A. and Ioannidou, A.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In its simplest form, happens-before is a partial order that generalizes the observed total order of a multithreaded program s executionby: ordering all events by a single thread in the order they were actually observed ordering lock releases and subsequent acquisitions of the same lockin the order they were observed.
Sentence 2: sliced causality requires two static analysisphasesforprediction.This approach candetect races that our approach does not: recall that our correctly-reordered exe­cution always respects intra-thread event order.our de.­nition of causalityis explicitlygeared towards mechanisms thatdo notperform staticprogram analysis, and, thus, cannot tell whether a value read by a thread in.uences subsequent values produced by the same thread.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The aim of Xenlog system is to protect the security and integrity of DomU s logging data from being sniffed or redirected by transparently transferring these data to Dom0 through shared memory instead of forwarding by network.
Sentence 2: fourth, IDTS supports not only domain-to-domain communications, but also domain-to-domains and domains-to­domain communications, which makes our system more universal and applicable.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The tree structure is re.ned using:  An heuristic to infer (1) implications over a dis­junction of features, and (2) alternative choices from the implemented components;  The antonym relation of the semantic network that can be used to .nd other alternative choices in the variability model;  The meronym relation describes mandatory rela­tions between components.
Sentence 2: for all pairs (w, w 0) 2 mero we must add the constraint s $ s 0 (8) for all pairs (s, s 0) such that w 2 T(s) and w 0 2 T(s 0).For instance, in our example, one such case is StateChartDef $ StateMachineLanguage.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This means that su.ciently .ne mesh of present elements will give ac­curate results with respect to geometrically and materially non-linear beam theory without any limitations on the mag­nitude of rotations, displacements and strains.
Sentence 2: an Application Domain con­cept can be linked with generic algorithmic concepts, which are de.ned in the Functional level through the relationship ComposedByAlgorithm.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Though the Noop merges write requests, it does nothing to reduce seek time.
Sentence 2: sequential and random read/write throughputs of SSDs for various request sizes 01020304050607080904K8K16K32K64K128K256K512K1M2M4M8M16MI/O size(Bytes)Throughput (MB/s)SequentialRandom 01020304050607080904K8K16K32K64K128K256K512K1M2M4M8M16MI/O size(Bytes)Throughput (MB/s)SequentialRandom 01020304050607080904K8K16K32K64K128K256K512K1M2M4M8M16MI/O size(Bytes)Throughput (MB/s)SequentialRandom 01020304050607080904K8K16K32K64K128K256K512K1M2M4M8M16MI/O size(Bytes)Throughput (MB/s)SequentialRandom (a) Seagate HDD read       (b) Hitachi HDD read      (c) Seagate HDD write     (d) Hitachi HDD write  Figure 7.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Autonomic self-optimizing systems have two kinds of goals: they must maintain adequate quality of service (QoS), typically defined by service-level agreements (SLAs), and they may also seek to provide efficient operation, using a minimum of resources.
Sentence 2: [10] IBM Tivoli Intelligent Orchestrator, http://www­306.ibm.com/software/tivoli/products/intell-orch/, Jan 23, 2005.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Modern staging frameworks such as LMS (Lightweight Modular Staging) [17] go beyond primitives for emitting code and have become popular for implementing gener­ators based on one or multiple levels of DSLs [13, 18, 19, 24].
Sentence 2: extensions to new data types and new vector architectures thus become completely modular in the back­end translation engine.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Although this method, used in our Heterogeneity-Aware Sig­nature Supported (HASS) scheduler, overcame the dif.cul­ties associated with the direct measurement of the speedup factor [12], it had limitations of its own.
Sentence 2: pA, as well as CAMP supports explicit boosting of the priority for running on a fast core for a thread ex­ecuting a sequential phase of the application.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Related Work This work is inspired by a long line of work on the speci.ca­tion and implementation of refactorings.
Sentence 2: accesses to local variables gener­ate no constraints (since local variables are never shared be­tween threads), and neither do ThreadLocal objects (which are not shared either), so from a concurrency perspective the refactoring becomes a no-op.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For kernbench, the MCS lock can achieve the same scal­ability and performance with spinlock and adaptive mutex lock,whichisbetter thanmutexlock.Theresults show that waiting by spinning is lightweight for kernbench.
Sentence 2: [4] S. Boyd-Wickizer, H. Chen, R. Chen, Y. Mao, F. Kashoek, R. Morris, A. Pesterev, L. Stein, M. Wu, Y. Dai, Y. Zhang, and Z. Zhang.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: He adds that most of the problems arise from the fact that ob ject-oriented systems do not typically provide any guarantees that inher­itance really is used for conceptual specialization [11].
Sentence 2: a famous picture called Treachery of Images by famous Bel­gian surrealist painter Rene Magritte is exhibited in the Los Angeles County Museum of Art.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: GT is exploratory and well suited for situations where the researcher does not have pre-conceived ideas, and instead is driven by the desire to capture all facets of the collected data and to allow the theory to emerge from the data.
Sentence 2: corbin, Basics of Qualitative Research -Grounded Theory Procedures and Techniques, Sage, Newbury Park, 1991.
Relationship: neutral