On the contrary, in case of the VF mode, the guest buffer needs to be mapped in Domain0 even before the actual hardware receive event occurs.

netfront driver is modi.ed to provide grants more aggressively i,e,.


Due to the inability of user-layer components to control components in lower layers, execution times can widely vary.

such estimates are typically gross over-approximations, resulting in underutilization of computing resources.


To meet this need, we aim to provide a novel architecture mPat, which is uniquely built upon real-time multi-source feeds to abstract human mobility for real-world applications.

for the .rst time, mPat is able to provide insights on not only where and when but also how (e.g., by bus) almost all urban residents move.


In general, a worker node cannot immediately forward all the new slot information to both its downstream worker nodes because the snowball e.ect would double the message size in each step.

each worker node randomly picks some information and keeps the remainder for its next message.


a thread, forwards a Start signal to its subtrees before starting its own computation, and forwards a Done signal to its parent node only after receiving all the subtrees Done signals and completing its own task.

the implicit barrier at the end of OpenMP work-sharing constructs takes a time corresponding to the worst-case propagation delay through the tree, which is logarithmic in the number of threads.


Figure 6: Consistency Agent Migration Time on Concurrent User Number  Figure 7: Consistency Agent Migration Time on Entity Number Our experiments show that Consistency Agent migration does not affect the real-time interaction of the CVE users, and so do other types of agents.

our proposed grid-based mobile agent approach will improve the scalability of LCVE without compromising its performance.


a .rst strand indicates that a change of the Communicator whichis usedby the TradeComponent canleadtochanges in the performance which can be measured via the sensor PerfS at the interface PI.A second strand indicates that a change of the Communicator which is used by the TradeComponent canleadtochanges in the communication costs which can be measured via the sensor CostS at the interface CostI.the controller ComSelect is able to manipulate performance and communication costs by exchanging the Communicator which is used by the TradeComponent.


We have observed that the Internet delay space displays special structural and statistical characteristics in that it adheres to a power-law that extends over a signi.cant range of Internet distances, namely the intra-continental distances.

its dimensionality can be characterized using fractal measures, sensitive to non-linear as well as linear structures in the delay space.


Second, because we allocate transactional data on a CDU boundary, no two allocations can share a CDU.

increasing the CDU size does not increase the number of con.icts for this benchmark.


Therefore, it is necessary to go back and run the authUML again to preserve the consistency, complete and conflict-free accesses.

our framework is flex- ible enough that allows changes in access control specifications.


Moving more than one page Whenatrapoccurs,itimposessomeoverhead.Thus,itmakessensetomovemorethanonepageineachtrap.Wetypicallymovedeightpagespertrap.Thisoptimizationalsoreducesthespaceoverheadofthestatus-table andthe.rst-object table.


The following three file systems are compared against hFS: (1) FFS: Although the original design of FFS was done more than a decade ago, it has received substantial improvements over the years [20].

fFS is a formidable file system to compare against.


In contrast, Molhado [8] is an SCM infrastructure that creates unique, persistent IDs for each entity, and treats the name as an attribute that can change.

it can track the history of an entity in spite of it being refactored.


However, access to the system memory is initiated by the debug port hardware component and not through software instructions executed by the processor.

the timings of the application code are not changed by the JTAG access.


n .4. ii.1 The reason is that cycle 1 and cycle 2 cannot provide protection for same span, cycle 2 and 3 can t either, so cycle 2,3 and cycle 1,2 can share spare units on span 3-5.

we can anticipate that the shared-p-cycles design can achieve better efficiency than the conventional p-cycles design.


only the .rst newly j; ; arrived request for fuses formula (23); subsequent requests use formula (24) until fbecomes inactive.


We denote the set of generators at, a., u., v., w. de.ned above by C. By the product formulas of Table 2, every element of C is a linear combination of 2-long products from A and, conversely, every element of A is in (C).

in order to prove that ((A)) is 2-closed and to give a full description of the algebra operations, it is enough to show that the product of any two elements of C remains in (C)and to compute the product and scalar product of any two elements of C. Step 3.


In case, the j-th log-likelihood ratio does have the absolute minimum value of all K inputs, the minimum of the K inputs except the j-th one equals the second-to-minimum value.

on the K input LLRs to a given check node, we take the minima of all numbers except one, where we first omit the first one, then the second one, then the third one, etcetera in a check node the set of minima of K values, except the j-th one, can be stored using only 3 values (a dataset) instead of K=30: The overall minimum value,  The overall one-but-minimum value,  The index j for which the minimum input value occurs.


The same applies for documents concerning patients and by that also the noti.cations.

sending information about critical results in an analysis over systems which are out of the scope of the hospital would imply a breach of secrecy.


However, building data context information could be expensive because (a) data accesses are highly frequent, and (b) access patterns among objects are complex.

it is desirable to establish a program paradigm that can collect such information efficiently.


To avoid this exponential blow-up, we impose a total order on abstract locations such that if ai and aj are aliases, they both point to a common location *ak such that ak is the least element in the alias partition class of ai and aj .

in the init heap rule of Figure 8, ai points to *ak where k = i under constraint: (*ai = *aj ) .


If the main document and the embedded object are produced by software from different vendors, it is generally impossible for one to know about the metadata in the other.

the data must be purged separately from each object and from the main document.


It seems like a natural step forward to provide the same degree of .exibility for parameterization of templates.

this can be seen as making the generic constraints of a template .rst class entities of the template, in the same way that classes and interfaces are.


The macros in the documents ensure consistency with the artifacts stored in the repository.

the user activated macros automatically retrieve and update the artifacts in the database.


The proposed hardware deadlock detection algorithm makes use of parallelism and can handle multiple requests/grants, making the proposed algorithm faster than the Os~,(1) algorithm[4], which actually has Os,,,(m x n) latency in multiprocessor systems.

the SoC par- allel deadlock detection algorithm/hardware is faster than any previously reported algorithms.


This is, however, inconsistent with the relation obtained by looking at column two in the FAS, i.e., the relation obtained by this column is s1,2 = 3s2,2/2.

the two vector sets are incompatible, which of course is possible (and also highly likely) since the values in the vector sets are obtained from (expert) opinions and experiences.


DSM s as used by Baldwin and Clark and in earlier work do not appear to model the environment in which a design is embedded.

we were unable to model the forces that drove the design changes that Parnas hypothesized for KWIC.


On the other hand, modeling is more than drawing, but using formal languages which are intended to be readable both for humans and machines in most cases.

the problem of wrong data formats has to be tackled from both ends: On the one hand, students must be taught that using diagramming tools is more than drawing on a sketchpad.


Whenwelook attheBGPinformationavailableinthe .ows, a very large number of pre.xes are announced from multiple ISP-X PoPs.

in many cases ISP-X selects an exit PoP from a list of PoPs where the destination pre.x is announced and in general it prefers the PoP that is geographically closest to the entry PoP.


Geronimo for example has 177 Javascript .les, 1004 XML con.guration .les, 19 con.guration .les, and 105 image .les.

it is possible that we missed some co-change relations among non-Java based artifacts or between non-Java and Java-based artifacts.


The virtual camera has a .eld of view of 40 degrees and a 4/3 aspect ratio.

12 images are needed to build a complete panorama.


The di.erence is that in interval Ii, we assume device Di is transitioned while in interval Ii-1 we assume Di is not transitioned.

this totally covers at most 2mcases were Ropt = d-Bi,i=1 ...m.Further, we also evaluate the energy consumption when Ropt = c and Ropt = d. an implication of Corollary 1 is that there are at most 2m+ 2 cases that need to be examined to determine the optimal solution.


To move to the root of the tree hit home to move to the last item hit end."

the use of a standard control allows the user to access meaningful information provided by JAWS.


Since the first eight bits extracted from the final codestream whose decimal value equals 255, which is an un-embeddable index value, this means that it is transformed from an embeddable index value with secret digits embedded.

the decoding procedure falls into Case 2, so the original index value 0 is reversed, and the base-4 secret digit 0 is extracted by mapping Figure 4.


A process can be a simple process, including only a sequence of activities, or a complex process including a controlled composition of services and activities performed under condition, in parallel, or encapsulated in sub processes.

to define a process, it is necessary to define: activities the basic elements of a process.


Early completion may eventually cause the CPU to be idle, which, in turn, results in energy waste since the device still consumes energy during the idle time.

there is a potential to save more energy by avoiding or reducing the idle time.


If there are more than one point on the time axis that correspond to .i × Ui max, we choose the latest point.

ti is probabilistically assured to accrue at least the utility percentage = Ui(Di) Umax .i i , with probability .i.


Our meta-tools are used to generate complex visual modeling tools, and these modeling tools could benefit from the addition of various critics.

we wanted to extend our Marama meta-tools by embedding a critic design and generation component.


In frameworks such as EMF, this separation is not supported.

the model conformity is validated against the same metamodel combining the two dimensions.


By using the proposed description rules, it is possible to relate I/O message elements of a system constructed using CORBA to the message parameters in OWL-S.

we can apply OWL-S to CORBA with our description rules [3].


Thus, the potential never increases, and it decreases by at least 1 after every deductible quantum.

the number of deductible quanta is at most 2T8 +log.


In intentional programming, complete programming language are imple- mented as a set of intentions, whereas ELIDE oniy supports simple modifier definitions for Java.

an in- tentional abstract syntax tree is modelled at a fine level of detail, whereas in ELIDE it is coarse-grained.


It is also of questionable worth since we expect programmers will often .x one error and recompile.

we extend our algorithm to recursively search for good error messages in one subtree while simultaneously removing one or more other problematic subtrees.


In that case, DMGexit (cb)= N, a condition that is checked by the out new transfer function given in .gure 11.

the transfer function depends only upon DMGexit .


The major shortcoming of static schedulers lies in the fact that they assemble a schedule prior to work.ow execution, which is then strictly abided to.

changes in the runtime environment make even elaborate static schedules suboptimal.


[1] Figure 4: Playlist aspect When implementing CreditsAspect, the programmer assumes a one-to-one relation between the playing of a song and its purchase.

the compositional intentions for its advice are the following: Ignored: NoProceed() After: MultiProceed() These compositional intentions mean that the advice is assumed to not be executed if the join point is ignored by another advice (.rst line), and for each execution of the join point the advice is assumed to be executed as well (second line).


In other words, there must exist a function F ' that connects the value of v with the value of v'; i.e., v = F (v).

we consider the following types of data dependency: 1.


We have: if execution level is in the model then one of { task , ISR } is in the model; if ISR is in the model then one of { ISR1 , ISR2 } is in the model.

if execution level is in the model then one of { task , ISR1, ISR2 } is in the model.


Each feature is given a cardinality, even mandatory and optional features, which are represented as cardinality [1..1] and [0..1] respectively.

a cardinality cannot be removed or added but only updated which can result in range inconsistencies.


A recon.guration transaction should take a software from an initial state to a .nal and consistent state.

a recon.guration transaction can be committed only if the resulting system is consistent, i.e., if all integrity constraints on the .nal system are satis.ed.


However despite the recorded gains, the statistical (paired t-test) p values obtained for the Control and Experimental groups were both greater than the required value of 0.05.

we could conclude that the mean selection score for both groups are not statistically different.


In our case, where there are only two voters, the set of solutions degenerates to include the two input permutations, as well as any intermediate permutation in the bubble-sort path between them.

the Kendall distance is not useful for our problem.


After exiting a nested query, it may be necessary to recover the outer query s insertion points, so that code for subsequent operators may be inserted.

we de.ne the stack, S, as containing (ai,µj ,.k) triples, where i, j, k = 1 are the nesting levels of each insertion point.


Especially, for safety consideration, for a train under CTCS-3, RBC can only grant it the MAs before a CO segment, and the train needs to ask the permission of the driver before moving into the CO segment.

both the speed limits for CO segments are initialized to be 0 in CTCS-3.


An object decides on subscription and APUM frequency based only on local information (derived from PUMs and APUMs).

it may be possible for an object, say Oi, to subscribe to another object s, say Oj s, local channel without Oj subscribing to Oi s local channel.


The real world auction trace that was considered does not re.ect a high intensity of intervals as may be expected for scenarios such as the online distributed tra.c navigational data broadcasting.

we used synthetic trace data to generate a wide range of problem instances that could re.ect various parameters of di.erent applications.


However, unlike the communicability evaluation, semiotic inspection does not involve observing users interaction with systems.

the two methods capture different communicability aspects and perspectives.


The corresponding transfer function does not .nd a loop-level kernel because SCC1 S (h1)represents the computation of the temporary variable h1 associated with the loop index.

the analysis of the structural usedef chain SCC1 A(a1...3) .


M2 is a schema mapping speci.ed by an st-SO dependency.

m '' is speci.ed by an st-SO dependency.


However, it differs from them in three aspects: i) lock acquisition and actual writes are shifted to commit time; ii) the validation procedure is modi.ed to satisfy the new transactional requirements; and iii) the necessary information is saved in local semantic read-sets and write-sets.

oTB gains the following bene.ts over pessimistic boosting.


Finally, the Tightness Coe.cient Tij of nodes ui and uj isde.ned as the 1 http://wiki.limewire.org/index.php?title=Overview ratio of arcs that their neighbors have in common and the maximum numberoflinksbetweentheir neighbors; thegoal of this parameter is exploiting the high average value of the clustering coe.cientinthe a.nity network,in ordertogive priority to items related to most representative neighbors.

relevance reli(sk) is computed as a function of Tij, rate(uj,sk)and A.


Predictor functions .j are used to predict the property values pj resulting from the composition of individual component properties ci ci pj , where pj represents property pj of component ci in the composition.

we have: ci1 si2 qpj = .j (qp j ,qp j ),j .


We controlled this learning effect by first performing the functional test case creation and in the second run the code inspection.

the students had no knowledge of the concrete implementation (i.e., the source code) or the defects included (as test execution was not performed by them) when they performed the inspection.


Since each sweep of u. costs 2. logN moves, the total number of moves is: h X N.(h +1, 1)2. log N. .=0 This quantity is the sum of the sweep costs at each level, until the virtual node needs its .rst rebalance.

the amortized number of element moves is h X 1 N.(h +1, 1)2. log N. (9) N .=0 PROOF OF THEOREM 3: We bound N.(.,1), the number of sweeps of the leftmost child u. at level .


We argue that this is mainly due to the lack of efficient and clear abstractions that developers can use to incorporate interactivity into their applications.

interaction represents a major overhead for developers, and users are faced with inconsistent interaction models across different displays.


We start by considering j1 and showing that aj1 = bsl i .

let us assume that j1 was assigned in phase p, for some p,1 = p = k. If aj1 exceeds the value b· sl i then the a-values for all the remaining l- 1 clients also exceed b· sl i by the timeAlgorithm3 entersphase p. the total payment from S(i)exceeds b· si.


Careful use of slot rendering can eliminate a number of runtime switches.

the OpenCL compute kernels and OpenGL shaders can more effectively utilize the cache on the GPU.


In order to determine the class of a previously unclassi.ed method signature, we merge the rule sets from all classes into one ordered ruleset, optimized for precision.


It is desirable to use such veri.cations as early as possible to prevent the application of other expensive, possibly manual, activities.

an integration of V&V activities within the build script is necessary.


As a result, these elements turn into partial (Pt) or variable elements (V).

the analysed categories (F, Pt and V) provide insights to the developers of which elements should be restructured as potential common or variable elements in the family s source code (Q2).


Views As stated above, views provide an abstraction of the managed actors state for the managers.

the views must be observed by the managers.


n the operational semantics presented in Section 4.3 is compositional.


The great advantage of mathematics is that the rules are simpler than those of natural language, and the vocabulary is much smaller.

when presented with something unfamiliar it is possible to work out a solution for yourself, by logical deduction and invention rather than by consulting books or experts.


It can be decided at compile time that the second inner loop, which covers three rows ofA and one rowofB,is the largest loop that can residein the uncompressed region.

handle checks are hoisted to the beginning of the second inner loop, as shown in (b).


In the deterministic case we can assume that object instances departing from similar states process events in a similar form leaving a similar final state.

if we can determine the next object state, why not do it in each peer or client?


However, it is easier to study the fundamentals of labeled control-.ow points and harmless advice in a setting with the simplest possible pcds.

we will start our investigation in a setting where pcds are simply sets of labels {l1,...,lk}and advice is written as {{l1,...,lk}.x .e}.


In essence, Smalltalk and Java share the common object-oriented execution model where objects interoperate by sending messages.

language interoperability can best be established at this level, Figure 1: Smalltalk interacts with Java through the languages FFI interfaces with C. buf := JavaWorld.java.io.BufferedReader new_Reader: (JavaWorld.java.io.FileReader new_String: sometext.txt ).


In his classic paper on the essence and accidents of software engineering, Brooks stated that the hardest single part of building a sofware system is deciding precisely what to build...

the most important function that the software builder performs for the client is the iterative extraction and re.nement of the Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


We have used a similar approach to generate programs that solve physics problems [26] and to combine and specialize generic software components to form a variety of application programs [30].

we believe that the approach described here generalizes to program generation from components in a variety of areas.


Hence, the fastest agents collect at least M ·|F| uncollected values during the .rst cvmin events (rather than during the .rst 2 · cvmin events).

after X := 2 · cvmin ·r(n-|F|-1) l- cvmin events (denoted M·|F|by a segment e'), all the values are collected.


Your skill should tell you if it is ugly.

when you refactor, bring the redundancies together using an appropriate object/functional design.


Feature model con.guration gets even more complicated if we consider that this activity can be performed not only by a single stakeholder, but also by multiple stakeholders geographically distributed [15, 12, 8].

this calls for approaches that support this con.guration process.


Thirdly, the sub-domains of a product line architecture may use, change and manage their own technologies, and evolve separately but in a controlled way.

heterogeneous technologies can be used in a product line, and components may be covered by COTS components, ordered from OCMs or be allocated to subcontractors.


Similarly, due to the re.exive M-edge (v, M, v), there always exists a G1-edge (v, G1, w) for each (v, G2(4), w), where G2(4) = a (M?a)*M?.


)(Ol[t - 1] - µl[t - 1]) , (12) By repeated application of (12) we get Ol[t] - µl[t] = (1 - .


According to our .rst design principle, thehypervisor should be as small as possible, because it belongs to the trusted computing base of every other component in the system.

we implemented policies and all functionality that is neither security-nor performance-critical outside the hypervisor.


Optimizations, by contrast, have no clear ordering and are prone to phase ordering problems.

they need to be combined for maximum effectiveness.


4.1 Challenges Because of the many variants of platform-and contextspeci.c adaptations that may be necessary in arbitrary applications there is an exponential number of possible combinations.

implementing adaptations for speci.c combinations is prohibitive.


x)) The idea behind these de.nitions is to implement each state monad of the type ST (a,t) as a function that takes a witness and the region a as arguments and returns a witness, the region a, and a value of the type t. It is easy to see that if a state monad program is well-typed by the monadic type system, then it is also well-typed with our type system using the above de.nitions for the monadic primitives.

our approach is more expressive than monads.


Resource Discovery Framework Self-Chord Routing Information and LRU Policy Metadata Snapshots in Grid Communities Type of Grid Peer-to-Peer Hierarchical Hierarchical Ant travels on a graph Yes, moves along a logical ring Yes, moves on a hierarchical tree Yes, moves on a hierarchical tree Ant memory No Yes Yes Ant start state Yes Yes Yes Ant termination state Yes Yes Yes Ant transition rules Yes Yes Yes Ant probabilistic decision rule No No No Use of pheromones No No Yes, by way of Self-led Critical Friends Pheromone decay No No No Mobility Yes Yes Yes Autonomy Yes Yes Yes Communication Limited, with nodes only Limited, with nodes and LRU Limited, with nodes and metadata snapshots Adaptation Yes Yes Yes Persistence No No No Local interaction Limited, with nodes only Limited, with nodes and LRU Limited, with nodes and metadata snapshots in this method suggests that the concept of stigmergy is not adhered to.

indirect communications between ants are weak and there is no exploitation of global knowledge.


In contrast, Velodrome (our prototype checker for Java) detects 133 non-atomic methods (and misses the remaining 21 by not generalizing from the observed traces), but produces zero false alarms.

in the terminology of information retrieval, Velodrome provides slightly less recall but vastly increased precision a trade-off that we believe is quite appropriate for all but the most safety-critical applications.


The latter can be more powerful and is necessary for higher-order test generation to always subsume sound concretization, as will be shown in the next section.

we adopt this second option in what follows.


However, we have made it su.ciently clear in the introduction that our approach is quite di.erent from existing ones.

we deliberately do not compare our work with the existing literature.


It needs to be noted that we may not always select the minimum RPM level for a given array access because there may not be suf.cient number of iterations in the loop nest where this array reference appears2 .

at the end of this .rst step of our approach, we determine the preferable disk speed for each array reference.


Ei New host states MNH : Extensions do interact with the host language by including host language constructs in the extensionintroduced constructs.

productions in PEi may include host language nonterminals and terminals on the right hand side.


We have additionally modi.ed the SU to incorporate task malleability.

the task option value is given as Cij vij = .iNi (8) Ci where .i is the priority, Ci is the maximum number of processors requested, and Cij is the number of processors requested in option j.


For the literal part, f(x) = in the example, we had to choose a language that a humanwould easily type, and LATEX looked like the only reasonable choice: MathML was ruled out by its verbosity.

although we de.ned few quotation kinds for documents, anadded complexity came from more levels of possible nesting,as a consequence of three input kinds that can contribute totexts in documents: literal strings, playing a role akin to the character data (CDATA) of XML, to write natural-language text;  literal LATEX code fragments, which appear as escapesfrom literal strings to denote a mathematical formula;  symbolic code fragments, which appear as escapes fromLATEX code to denote a symbolic calculation whose resulthas to be displayed.


The entities described here are exhaustive and conform to the SIP philosophy.

the use of SIP makes this architecture more useful and interoperable with any other SIP clients or servers.


Invisible watermarking (or simply watermarking) has become a well-accepted technique for protecting digital images and other forms of multimedia content, and the search for better watermarking methods remains an extremely active area of research [4, 5, 9, 14, 18, 22].

as satellite imagery and GIS have found ever increasing commercial applicability, watermarking is invariably being considered for use in these applications.


the total cost for redistribution is: Cost=(a+f.W)+.


Baker s original collector copies objects atomically when it evacuates them from fromspace to tospace.

the duration of pauses caused by copying depends on the size of objects and is not bounded by a small constant.


A void result (Ø) is assigned to the opposite port automatically.

the then and the else output ports receive a nested array with the same structure and size, as de.ned by the input nesting levels, ports depths and iteration strategies used, but complementary in the sense that if a value is available in one of the ouput, the corresponding item is empty in the other output and vice versa.


Considering that both the ATM and the Card Protocol are deterministic it is easy to see that the composite PLTS can never exhibit the trace  If we compute the composite model and minimise with respect to the strong semantic equivalence (defined in the previous section), the resulting PLTS will no longer have the following pairs of undefined behaviour (compare with Table 2): {(insertCard, 2), (insertCard, 9), (insertCard, 10), (ejectCard, 3), (ejectCard, 4), (ejectCard, 5), (ejectCard, 6), (ejectCard, 7), (requestTakeCard, 10), (takeCard, 9)}.

we now have a composite behaviour model that has fewer gaps requiring stakeholder intervention.


5 shows an example of a client that uses a Counter object c. During the initialisation phase of the object c the PointsTo(c.data, 1, 0) predicate is obtained from which the permission part, Perm(c.data, 1, 0), is transferred into the lock.

the client obtains the Hist predicate for data (line 4).


Our test sequence data structure saves the results of the backward tracking search which generated the path from the hot spot to the start node, including all the edges that had already been searched.

it is possible to reverse the search and return to a point where more than one choice of edge is available.


In general, we want to minimize the number of sanitizers we infer.

if there are several solutions to the set of constraints B1, we want to favor solutions that infer fewer sanitizers, while satisfying B1, with higher probability.


A fault is de.ned as a change to an individual executable .le in response to a fault MR.

if a given fault MR causes N di.erent .les to be changed, then we count that as N distinct faults.


Finally, we do not require users to be aware of the partitioning scheme or the transaction execution model when writing transaction code.

users should be able to write a single atomic block, and the system would make sure the appropriate code branches will execute at the corresponding partitions.


Changes in the execution environment could modify the program behavior in ways that our technique would not be able to identify.

we assume that the execution environment is the same across versions.


the application and various controllers for the connected hardware, need to be changed in order to facilitate the new self-checkout.

the new component RFIDController must be connected to the event bus giving rise to new ports and changes to the event types.


Even though this strategy is slower than our counter-based implementation, it is still at the same level with abc.

we expect all applications that are making use of cflow pointcuts to bene.t from our approach, even if they are using a large number of pointcuts.


This, however, is an issue that can be directly addressed in an opinion poll.

metrics can be refined and misleading interpretation can be avoided.


However, users might want a more global metric for yield.

figure 8 plots the network-wide total recovered energy for the experiments of Figure 7.


In real-time systems, the penalty for missing a task dead- line is enormous.

it is critical in real-time sys- tems to have I/O devices powered up and running at the correct times to guarantee that all application tasks meet their deadlines.


The reduction in the number of .ows per peer results in an increase in the per-.ow download rate of 41.5%.

while the total number of .ows in the system has shrunk by 20.7%, the BitTorrent traf.c has had a net increase of 12.1% between 2009 and 2010.


As mentioned in Section 2.1, for well-structured uses of locks and unlocks, such a reordering is safe.

this fence represents unnecessary overhead, possibly doubling the cost of lock acquisition, without bene.t to reasonably written code.


When developers change a target program, they also change the unit test cases associated to the program so that all the unit test cases succeed.

test-based pointcuts automatically re.ect the changes to the target program as long as the associated tests are maintained.


If process r later on fails to capture v.lock, because the lock is still owned by process p, then r obtains the pointer ptr to Wp.

r can call Wp.Wait() in order to wait until the lock has been released.


)Typically, JML speci.cations will either not exist at all, or only exist for a small fraction of the methods in an application and its libraries.

eSC/Java tries to be useful even with partial information.


However, OCEAN restricts the Finite Number of Parameters Infinite Parameters Space C1 Arbitrary Performance Prediction Model Undecidable Problem C2 Arbitrary Polynomial Performance Prediction Model Undecidable Problem C3 Fixed Polynomial Performance Model Finite Parameters Space Decidable Problem Ex: ATLAS [19] C4 Finite Parameters Space Decidable Problem Ex : OCEAN project [2] Figure 2: Classes of Best-Parameters Problems exploration to .nite set of parameter intervals.

the number of parameter combinations becomes .nite, allowing a trivial exhaustive search of the best parameter values: each optimized program resulting from a particular value of the optimization parameters is generated and evaluated.


This is achieved by processing context-related and other messages one at a time, picking them up from the agent mailbox.

it is not possible that context-related messages interfere with the execution activated by a standard message.


Regardless of additional available information, the developer will always be interested in the source code itself.

in this paper we focus on static information available from the source code, in the form of programmer-de.ned structure and lexical identi.er names.


This is why the human-in-the-loop approach was implemented, along with the other more automated parts.

the user can pick a specific aircraft that he/she wants to pilot.


Given Lemma 2, the net element translation rules can be applied to all N in MAS.

pROG is a complete translation of the multi-agent net MAS.


Most common tools used by developers, including compilers, debuggers, and pro- fliers do not support the sort of fine-grained storage systems provided by a VSC system.

the system must provide some mechanism for externalizing sets of fine-grained arti- facts as standard source files for manipulation by conven- tional tools.


Moreover, at the time the signal turns green, a GLOSAenabled vehicle will be cruising through the intersection with an initial non-zero speed, as opposed to a regular vehicle that would have to start from a complete halt.

gLOSA may improve an individual vehicle s travel time.


Second, by using a deep embedding, the construction of the monadic computation is separated from its interpretation.

multiple interpretations can be given to a computation [2, 24].


Error codes are represented as integers but conceptually they are atomic values on which arithmetic operations are meaningless.

if op is an arithmetic or bitwise operation, then we can safely assume that e1 and e2 do not contain errors.


The checker had an enormous number of false positives, most due to a single limitation of our analysis: a small number of functions only freed one argument based on the value of another argument, but our analysis decided that these functions always freed their argument.

rather than having an error rate of one error per few hundred callsites, these functions had rates closer to .fty errors per hundred callsites.


The MTF is a per-HVM .ag that is global to the VM, and unlike like the TF bit in the EFLAGS register, the MTF is not changed at thread context switches.

in an HVM guest, a single-step begun in one thread or context might continue into another thread or context.


A quanti.ed boolean expression has exactly one quanti.er, while a quanti.ed reachability or an unreachability expression can have up to two quanti.ers (one in the source and one in the destination expression).

we use two expansion functions: one for each quanti.er.


[3] have found that aspect-instance look-up took more than 26% of the total execution time in selected use cases.

it is important to research such policies and optimization opportunities.


However, since a fault can be triggered in many ways, failing traces due to the same fault can be quite di.erent.

previous methods actually group together traces exhibiting similar behaviors, like similar branch coverage, rather than traces due to the same fault.


Thumb-1 Instructions Overlap ARM Instructions (a) (b) (c) (d) Figure 8: Four kinds of illegal instructions instruction.

these bytes cannot be disassembled as an instruction.


From (6.1) none of the processes in Gi(D)= Gi(E) -{a} is in cov(a, EII).

from part (a) of the induction hypothesis all of the processes in Gi(D)= Gi(E) -{a} are in the same state at the end of EII as at the end of DII, so if a process other than a is poised to access r at the end of EII it is also poised to access r at the end of DII .


Since we can only read elements of type Object from this list, we can say that this list behaves almost exactly the same as a list of type List.

it will be a good idea to check whether type con.icts caused by the wildcard ?


when detecting a software fault, developers need to Recently, a fault localization approach based on mutation identify the faulty program parts in the application s source code analysis has been proposed [22].


Our notion of responsiveness is weaker than synchronous languages like Esterel [4] (which require input events to be handled synchronously during every clock tick, and are hence too strong to be implemented in asynchronous software), but stronger than purely asynchronous languages like Rhapsody [12] (where asynchronous events can be queued arbitrarily long before being handled).

our notion of responsiveness lies in an interesting design point between synchrony and asynchrony.


The access to RESTful Web services uses standard HTTP protocol (GET, POST, PUT, and DELETE).

existing Web technologies can be leveraged to facilitate RESTful Web service development, security, and performance.


ADAPTIVE CONTROL OF px AND pm Biological evolution shows that px and pm should be adapted and should depend on the evolution state[5].

in order to enhance Copyright is held by the author/owner(s).


A Without any assumptions on the mobility pattern of the nodes, it is impossible to guarantee the existence of JIT paths.

we are motivated to assume that every execution satis.es the following property, which was originally introduced in [2] and is also related to the dynamic diameter of [11].


If a .eld fd of an ob ject o is guarded by thisThread, it is accessed by only one thread and hence cannot be involved in a data race.


Furthermore, as target models can be platform-independent, the kinds of target models used in our approach are rather de.ned by autonomic managers than by the underlying infrastructure.

autonomic managers preferably use target models than a complex source model to monitor or adapt a system.


This was also the case when the cluster size is larger than three.

we set the minimum cluster size for our approach to be applied to three in our experiments.


Thus, any method that is matched by the reference re.ective block s pattern is matched by the declaration re.ective block s pattern, regardless of what Y is.


RELATEDWORK Real-timegarbage collection research datesbacktothe 1970s where collectorsforLISPandMLhavebeendeveloped.

avast number of papers on real-timegarbage collection havebeen published.


In the GEMM example, (s4) s shape is a pre.x of (s1).


For example, a high-level task may require two cores, but may or may not care which cores they are.

we include in Poli-C a way of specifying these sorts of requests, which we call policies.


This rule is e.ective in moving down the search space toward lower energy regions, like water from a stream running into an empty reservoir, while .lling local depressions along the way.

these tactical procedures of the CONFLEX search are referred to as the Reservoir Fil ling Algorithm.


In both approaches, we sample a constant number of data points (i.e., tasks) and perform the analysis treating the sample set as representative of the entire set of points.

we avoid having an unmanageable linear algorithmic complexity with respect to the number of points; both approaches scale with a complexity of the log of the number of tasks.


Results and Analysis The central features of the four techniques studied in our experiment are 1) whether the four techniques can be effective in reducing the size of the test suite; and 2) whether the four techniques can perform their tasks in acceptable time.

our comparison concentrated on the following things: 3.1 Representative Sets The sizes of the representative sets are depicted in Fig.


Instead of focusing on the setup of a project, developers should be able to rapidly prototype media rich applications.

the time to get a project up and running should be kept short, i.e., through the use of easily installable and useable templates.


The reason for Mitosis not being as good as our technique is that it only uses one version of each iteration.

if more than one hot path exists, which is true for most benchmarks as indicated in Fig.


Unfortunately, computing multiple versions of information for a method causes the method to be analyzed many times.

it may significantly increase the client s cost.


2An element of a partition is called block.

in this paper, ablock refers to a set of PDG nodes.


However, for computing the relevant slice for this input, the predicate at line 5 will be identi.ed as a potential dependence since if it had evaluated to false outcome, the value of variable a output at line 14 could be affected.

the relevant slice will contain the statements at lines 5, 3 and 1 in addition to the statement at line 4 that is in the full dynamic slice.


This implies that p can write a message to q s local memory andspinonits localmemoryuntil q responds (and vice versa).

after the establishment of the link, p and q can e.ciently execute a reliable two-way communication protocol.


The forthcoming BPMN version 2.0 promises to bridge the gap between the notation and the real execution of a business process, therefore rendering WSBPEL obsolete.

wSBPEL will not be regarded in the further discussion.


The services modelled describing their e.ects make userenvironment interaction more natural and simpler because they allow the user to be isolated from the operational characteristics and the service implementation, as well as from the functional features and what it does.

the user can focus exclusively on the e.ects that the service produces in the environment.


Interoperability of sharing knowledge base using MLM depends on healthcare standard knowledge representation and on standard terminologies usage.

our system covers interoperability by using SNOMED CT standard terminologies and knowledge representation in standard MLM.


However, there is no indication in the literature that constructivism has been used in the VE authoring context before.

this project includes a plan to test the tool with novice designers, in order to provide empirical evidence of the success of constructivism for novice VE designers.


Thus, I(i ' ,j) was already captured at Tj ' , and we get that fCi ' ,j (P,S) = 0.

si.i ' ,j will increase fC (P,S), since fC (P,Si.i ' ,j )=fC i,j (P,S)+ fC = (P,S) - fCi ' ,j (P,S) fC (P,S)+1 If the .rst case does not apply, fCi ' ,j (P,S) = 1 and Si.i ' ,j will preserve fC (P,S), since fC (P,Si.i ' ,j )= fC (P,S)+ fC fC fC i,j (P,S) - fCi ' ,j (P,S)= (P,S)+1 - 1= (P,S).


The semantics of failure recovery are controlled by the adapter so that they may vary from user to user.

recovery is discussed below in section 6.


While this option needs to be available for faculty, we quickly found out that it is unrealistic to expect students who are in the process of learning about data structures to be able to modify a separate viewer class in order to see an instance of their own data structure.

we turned our attention to building a mechanism that could determine if an instance was a linked list or binary tree based on a set of heuristics, and then automatically generate an appropriate view.


The procedure just described is implemented by relatively simple combinatorial logic that does not extend the critical path in the execute stage.

steele-style address generation in hardware is as fast as standard address generation.


During replay, FuzzSim outputs a timestamp whenever it .nds a new bug.

we can easily plot and compare di.erent scheduling algorithms by comparing the number of bugs produced under the same time budget.


Fortunately, executing a change object results in an undo object being computed, since change ob jects implement the command pattern as described in the gang of four book [3].


Moreover, the paper establishes that t< n/2and z = k are two tight bounds of the k-set agreement problem, when considering the (Oz)1=z=n family of failure detectors in an asynchronous message-passing system (Theorem 1).

among all the classes described in Figure 1, Ok is the weakest class for solving asynchronous k-set agreement (hence, the algorithm is optimal in that respect).


Furthermore, most dependence tests assume a.ne subscript expressions.

our method is restricted to a.ne functions of the loop indices.


Hence, at most |W |= sds = s/8e of the lookup requests fail.

at most O(log n) attempts are necessary until all requests have been served.


This is basically means that a complex function that has too many variables and parameters can be decomposed into some sub-functions known as constituents (parts) which are inter-related but have less variables compare to the original problem.

the original function can be reconstructed from those constituents.


No matter which mapping is used to perform the write, if the code-page content is ultimately changed, the code cache must be updated accordingly.

to ensure correctness of the code cache coherence solution, we must monitor not only that particular page-mapping, but also all present and future page-mappings that map on to that physical page.


Two obstacles were given a severity rating of 1, five were given a rating of 2, six were given a rating of 3, and 45 obstacles were given a severity rating of 4.

applying this relatively conservative rating scale, the vast majority of obstacles introduced a minor delay into the process of carrying out the assigned tasks.


However, having too many layers will result in increasing the overhead due to the added interface and communication complexity between the layers.

it is important to design architecture with an optimal number of layers for sensor web applications [7].


2.2 Dynamic Repartitioning The repartitioning strategy described in Section 1, whereby during a quiet time servers are taken of.ine to be moved into new clusters, has several problems.

first, reducing electricity use requires running fewer servers at relatively high utilization levels rather than more servers at lower utilization.1 reducing the capacity of the network to repartition is dif.cult while sustaining the required query throughput.


The OOG extraction nondeterministically selects a label for a given object o based on the name or the type of one of the references in the program that points to o.

detecting renames ensures a developer can still rename .elds or local variables or types without impacting conformance.


While PTD refers to a sub-optimal structure of a system, ETD refers to PTD, which in addition has a negative impact on future development.

while PTD is the source of ETD and hence is important to identify, only ETD must be e.ectively dealt with.


Dependencies cannot be managed at an individual level only at the component level.

the resulting compositions may be slightly larger than necessary.


A single modification to the animations during run-time results in a stop of the animation viewer and regeneration of a new scene file.

the realtime approach has the advantage over the offline approach and is adopted in our framework.


Directoryentriesarestored as .lenameandinodenumberpairs, and arepacked intopage size chunks.

file names are restricted so that adirectory entry always .tsinto256bytes.achunk with a hole can always contain another directory entry.


When imgin and imgout are mapped in the same bank, an access to imgout is only scheduled after K2accesses to imgin.

the frequency at which accesses to both data structures interfere is much lower than for kernel and imgin.


4.2 Peer Discovery Building the application s communication on top of point-to-point unicast connections means that a sender has to contact each receiver individually.

a peer needs to know the IP addresses of all the peers it is collaborating with.


Thus, the apache package should only be installed on a system that does not also have the apache-modules package, any instance of the jserv package with version less then 1.1.3 and so on.

to install apache, the package manager must .nd out which other packages must be installed such that ultimately the system contains a set of packages that meet all the requirements speci.ed in the distribution metadata .le.


Lazy restore can take quite some time to completely .nish because memory is restored only when it is accessed by a VM or touched by a slow-running background thread.

the performance is bounded by the memory size of the saved VM and the speed at which the background thread retrieves memory.


A change in the API could affect some or all external applications connected in this API.

this change will force external developers to adjust and retest their applications to work on the platform.


they can be checkpointed/restarted with the appropriately smaller sizes.

the framework becomes completely self-tuning.


Now we assume node G updates its replica of the file and informs the other nodes by sending an invalidation packet over the validation mesh.

all other nodes except G remove their replicas of the file from their storage and the validation mesh is torn down.


During this study, we plan to test the co-evolution approach in projects with an existing code base and known architecture.

at .rst, we use our approach to generate a PCM from the legacy source code.


Second, based on having explicit variability models, business partners and SDOs may de.ne business document models through con.guring the variability model.

variability model con.gurations serve as trace models between the generic Core Components and derived business document models.


A .ow graph is constructed so that if declaration A in.uences declaration B, then the graph will contain a path from A to B.

our global in.uence relation is just the transitive closure of primitive in.uences (directed edges in the .ow graph) induced by the program text.


Second, leaks have the potential to impact not only the application that leaks memory, but also every other application running on the same system; because the overall amount of memory is limited, as the memory usage of a leaking program increases, less memory is available to other running applications.

the performance and correctness of every running application can be impacted by a program that leaks memory.


The original cumulative constraint provided by MiniZinc [15] could not be used because it was not able to handle the two different task types present in MapReduce jobs: map tasks and reduce tasks.

a modified cumulative constraint, called mycumulative, is developed that ensures that map tasks and reduce tasks are only scheduled on the map slots and reduce slots of the resources, respectively, and also the capacities of the resources are not violated.


For a component to be an independent unit of compiled code, it must be completely separate from the environment in which it is de.ned and compiled precluding any explicit references to other components.

a component completely encapsulates its features and can only be deployed in its entirety.


It should be noted that all data in a block is fetched at cache-misses and kept coherent as a unit.

it is important whether multiple shared accesses are issued onto data in the same block.


Since the subsumption rules give rise to constraints between types, we cannot give a coherent constraint solving strategy that is still complete we either need to reject certain reasonable programs or we need to solve such constraints too aggressively leading to an incomplete inference algorithm.

our implementation uses the simple strategy since neither lifting nor subsumption provide a satisfactory improvement.


We found a Naïve Bayesian model that uses Markov, Hour and Cell-Tower (the blue plots in Figure 8) gives good overall accuracy across the three behaviors, which has also shown effective in previous work (e.g., [20]).

we compared the performance of this Naïve Bayesian model with Reflection.


Second, when a failure is detected by NTFD, NTFD will send the failure notification messages to the registered processes on the remote hosts.

the message cost only increases linearly with the number of failed processes.


This forces A to make its decisions without knowing how much time is left.

a has to attempt to discover new bugs as early as possible.


This would enable practitioners to fully exploit the benefits of SRA adoption and usage.

our research goal is: Which are the artifacts that compose an SRA and how such artifacts are designed, reused, and used?


Our approach also deals with a graph that contains the operations as nodes and the relations between nodes as edges, similar to the serialisation graph.

our approach based on a graph and constraints between operations can be mapped to the ACF framework that represents a theoretical formalism for modeling replication.


A data race is a pair of accesses to the same variable by different threads, where at least one access is a write and the accesses are not ordered by synchronization.

if an execution has no data races, the variable (e.g., x in Figure 1) is interference-free for the duration of the execution of the region.


We assume that there are no transitions leading from and to the states representing regions where obstacles are present.

each trajectory of the robot in the said subset of the environment is obstacle-free.


Also, at any point in the interleaving, if the last step of S(i) that has been performed up to that point is sk, then we de.ne the cache state at that point to be Ck.

the cache state only depends on which steps of S(i) have been performed, not on how S(i) and T ( j) are interleaved.


Therefore, given that the magnitude of RRmn(t) is r at time t, the probability that node n is located within zone 1...i after t seconds is given by 11 r = Ri - d0 P {d(t)= Ri|Rmn(t)= r} = 2 22 1 -1 d0+Ri -r cos r>Ri - d0 p 2d0Ri (10) From Equation 9, the probability density of r is given by 2 r f (r, t)= 2r e - am+an .

am+an JRi+d0 P {d(t) = Ri} = P {d(t) = Ri|Rmn(t)= r}f (r, t)dr r=0 (11) According to [18], the node distribution is similar whether the link has to be continuously available or not.


The loss of output-data leads to wasted user time allocation, which is very precious and obtained through rigorous peer-review.

a timely o.oad can help optimize both center as well as user resources The need for timely data o.oading is also fueled by the, often, distributed nature of computing services and users job work.ow, which implies that data needs to be shipped to where it is needed.


Station D contains a database containing title and pay.

to compute the above query mobile agent will have to go to PEs where databases are distributed and perform necessary database operations.


Regarding SQL statements, the Stones library provides three different features.

when an SQL statement was created without the Stones framework, we removed it from the usage count of the feature that would have been the most appropriate.


For the size of each table entry of path bf, rule (B ) incurs O(#edge.2) due to the .rst hypothesis, and rule (L ) incurs O(#edge.2) due to the second hypothesis.

the total size of each table entry is O(#edge.2).


For instance, in Chrome milestones critical defects are being .xed in less time than the Firefox project.

the feedback generated from previous knowledge can help testers and developers involved in .xing the security defect decide the severity of the security bug.


When the overhead for turning on/off is non-negligible, it will be not worthwhile to turn off the processor if the idle interval is not long enough.

procrastination algorithms such as those in [5, 9, 10] resolve this problem by aggregating idle intervals to reduce the number of mode switches and the overhead.


First of all, it gives designers the freedom to express their ideas freely, either using handmade sketches or tool-oriented wireframes.

they do not need to rely only on the tool s own environment.


We observed many calls to the sifting algorithm during the BDD building process each taking several minutes to complete.

we do not see any real bene.ts of using sifting to build BDDs for feature models.


One concern in this regardis that adding new atoms must notbreak the existing index-to-atom mappings that may be in use.


In j=1 p a (L k-1 j=1 p this case, Copt = Cswitch + Sj)+: and Ctotal = k · total Rtr L k ( j=1 Spj) Copt Cswitch + .


Interceptors adapt requests, replies and exceptions passing through the ORB.

the generic interceptors do not modify the component s behaviour.


There are two approaches how the type information can be provided by the JVM: Actualising during run-time: The type information of the memory cells is actualised on every execution of a Java instruction.

when a migration is requested the type information of the memory cells is provided.


The memoized version mf captures this by .rst checking if x is positive or not and then exposing the underlying value of y or z accordingly.

the result will depend on the sign of x and on either y or z .


Similarly, while analyzing a polymorphic type, the term-level construct typecase must bind the kind of the quanti.ed type variable.


In particular, Dimension must be able to decode both the source and target binaries, and be able to encode the target one.

we need a new version of Dimension when the format of either the source or the target binary changes.


A .ne customizability level requires smart users because some details about the underlying infrastructure cannot be hidden anymore.

openNebula is more suited for private cloud where the entire environment is trusted and users have more skills.


If visitor #3 goes back and visitor #2 becomes reachable again, a new instance of the video service has to be deployed on visitor #2 s host.

if visitor #3 is near from video server and if it has enough energy, it is not necessary to use the visitor #2 as a relay and the platform can directly deploy the assembly and send a black & white video.


Indeed, the right granularity/precision of tracking varies, often within the same application [2, 19].

it appears to be a good idea to leave the choice of dependence checking mechanisms to the client (programmer and smart compiler) of the SMTX system.


To avoid double counting we use a polynomial algorithm to find the maximal partition of coallocatable objects that come from a coallocation set.

in Figure 2(a) a weighted miss reduction for coallocation set {A, E} only accounts for coallocating e6, a12, a14.


INTRODUCTION In the permanent ongoing production of Saarstahl AG, a variable set of uncertainties have a strong influence on the current planning.

flexibility and fast reorganization after such interferences at any point is needed to ensure a production without interruptions which still meets the needs of the customers at acceptable costs.


In order to enable a transparent nesting of patterns and services, we need to make sure that these interfaces match.

work.ow patterns also implement a start method.


Thus there could be a combinatorial number of mined LSCs.

it would be better to mine a representative set of LSCs.


For larger software designs, formal veri.cation using model checker often suffers from the state space explosion problem.

we need to use abstraction techniques in order to alleviate the burden for the back-end model checker.


The .nal property is that all objects in both models are identi.able.

each object has a locally unique identi.er, which is unique in the model that the object resides in.


The input and output streams of the adjacent Kernel1 through Kernel6 are conformable.

these six kernels can be fused to increase both the granularity and locality.


In order to attach reactive behaviors to context changes, in addition to the method isActive, a context has to declare the events indicating context changes in its interface.

for abstracting from concrete contexts we need a means to abstract from concrete events.


DCR: We examine how dynamic changes in the computational infrastructure a.ect work.ow scheduling.

the RSD parameters responsible for longterm changes in the performance of a VM was varied between 0, 0.125, 0.25, 0.375, and 0.5.


This knowledge helps to significantly reduce maintenance efforts for variability handling of Simulink models.

it helps to increase the maturity of variant-rich models.


This diversity can be highly complex as shown in the example in Figure 4.

we additionally proposed calculation algorithms and a possible approach for a largely automated computation of variants.


The code is generated by traversing the feasible .ring schedule found, and detecting the time where the tasks are to be executed.

the generated code can be seen as a cyclic executive, where the tasks are executed in accordance with previously computed schedule.


Then, for processes containing hiding and parallel composition, we show that using axioms as rewrite rules, one can eliminate these operators.

for each two PEPA processes p and q such '' that p .


As Table 1 shows, this is indeed the case even in our MI hierarchies.

a type eis allocated with an array rof size l e,v e,llb(eau taan c,e,sft oar stb(eau,t (in SI, l e,vee,llb(eau)==tatn c e,sft otr s/b(eau,t), with entries for each bbc aan c,e sft otr s/b(eaucb Speci.cally, bbsoeis stored in location l e,vee,llb(b{uin array r. checking whetherbas+ecan be carried out by checking whether b indeed occurs in location l e,vee,llb(b,uof array r. The encoding is optimized by not storing bitself in this location, but rather an id, which is unique among all types in its level.


Defining an annotation for feature dependencies As figure 2 shows, an annotation declares which elements it targets (A in the example).

this element (and all its subtypes) appears to possess the additional child r declared by the annotation.


But, C2 ensures that if such a situation were to occur, that C would have an overriding de.nition.

the .rst dispatch rule would apply and superclasses would not be considered.


1), since the previous call pro vided the question object containing a qid needed for activating a check_question link.

the exploring of the web service by the generic state machine is driven by acquiring more dynamic links.


For ontologies, the situation is similar, except that ontology languages and their semantics are, as a rule, alien to developers.

the tools have to go much further in organizing and presenting the information supplied by the reasoner and existing in the ontology.


Reliability it must always be possible to .nd needed components regardless of current location and system  state.

single points of failure are unacceptable in any design.


B enchm arks Figure 8: Energy, Performance and Code Size comparison using SO vs. SA algorithm trend of energy consumption values remains the same for all the benchmarks.

a comparison of the two allocation algorithms is presented for a smaller and .ner range of SPM sizes.


For each specific problem, an optimal configuration can be chosen as a solution.

the chain-of-configurators architectural style enhances the flexibility and increases loose coupling compared to the other styles where the monitor and configurator were fixed.


The last chunk can move within the kth sub-heap.

our algorithm needs at most nine additional entries outside the sub-heaps.


To avoid false negatives would require a much more precise interprocedural analysis that would be very costly, and itself might introduce additional false positives.

we chose to implement an analysis of practical cost, which identi.es, we believe, the bulk of the e-c chains of interest.


Finally, it classi.es the potential faults that become executable by applying our mutation operators as delaydependent potential faults.

jSPreventer provides developers with executable evidences of the delay-dependent potential faults which are not-easily-executable faults because they are not executed without subtle network delays.


This is obvious by construction, since the nature of immutability is such that the only writes are initializing writes.

there cannot be a write after a read (since this would imply a read of uninitialized data), nor can there be a write after a write (since this would imply mutation).


6http://www.eclipse.org/mylyn/, veri.ed 15/06/11 7http://www.eclipse.org/, veri.ed 15/06/11 3.2 Parsing Social NewsWeb Sites The intention of the second component is to characterize recent posts on social news web sites, such as digg, reddit and mashable.

for new article links8 posted on any of a user-de.ned set of social news web sites, our approach follows the link to the referenced article and characterizes the article using a simple heuristic that abstracts an article to the technical terms that occur the most frequent in each article.


The inner loop has a tight dependence chain as the XVector element written to in one iteration is read in every subsequent iteration.

the only possible way to parallelize this loop is to violate sequential semantics by not enforcing some of the true dependences.


fAllowedW checks if a process has exclusive access to a .le.

if we were to write defensive code, before attempting .le access we would .rst check that our process had access to that .le.


Due to noise in the mobile sensors, the dead-reckoned trajectories are accurate in the beginning, but diverge from the truth over time.

outdoor localization schemes like CompAcc [2] have triggered periodic GPS measurements to recalibrate the user s location.


As a result, the path numbering algorithm will not assign a number to paths that terminate at the back edge.

the instrumentation on cold back edges ignores the value of the path register and always records an execution of a cold path2 .


Law enforcement -- If we understand how multiple modalities combine during expressive behavior, improved methods for detecting lies behavior may be developed.

subtle inconsistencies between modalities may prove to be an important indicator of deceptive behavior.


An awareness computer needs to only run software that mirrors the display of the primary computer.

it does not need to access proprietary applications or access proprietary data.


This mechanism allows the resource contributors to quantify the percentage of his/her contribution for anonymous computing on Caravela network.

these capabilities of the worker and the broker servers implement a secure environment for GRID computing.


If a set of services is incompatible, the detailed measures and the mismatch list help to understand what parts of these services do not match.

the mismatches can be worked out using adaptation techniques, and service composition can be achieved in spite of existing mismatches.


Each combinator associates a particular type shape with an interference pattern.

a composition that does not meet the type shape required by the combinator fails to type-check.


This mapping is not exact, however, because neither the language nor TM system restrict exactly what memory can be passed into a method of an open atomic class, and the TM system performs a vanilla opennested commit for a nested transaction, not a safe-nested commit.

it is unclear what exact guarantees are provided with respect to serializability and/or deadlock freedom.


After Q Until P, which is concerned with the event sequence after an occurrence of the starting delimiter, Q, and before an occurrence of the ending delimiter, P. P is not required to occur for this scope to exist This scope may occur repeatedly over the course of the system execution.

with the restrictions noted above, there is limited interaction between the intent and the scope these restrictions allow us 17 to propose a rather straightforward way to apply scopes to property pattern templates.


The length of the preamble should be long enough for synchronization between the AP and all UWB devices in the network, i.e., the preamble time Ta of i-th device is determined by di.

tf rame and TAC K are obtained as Tf rame = Ta +(pl +RUIh)/Ri +(PHYh +MACh +HCS +FCS)/R0 and TAC K =Ta +(PHYh +MACh +HCS)/R0.


We studied the feasibility of using these algorithms in order to categorize the right participants in the same group to be further analysed qualitatively.

two issues have been tested in this research: a) does this method (the use of clustering algorithms) of data summarization work for this kind of research (i.e.


The containers will have a label with the corresponding abstract graph.

some containers will be considered as idempotent containers when they are labeled with an idempotent abstract graph.


The coin toss decides whether to move to a node or not.

successive sampled nodes on the random walk may be between 0 and B hops apart based on the outcomes of these decisions.


However, since the students in Hbg have participated in a course where they developed a requirements document for a taxi management system, they only had a brief introduction.

the general introduction Table 1: Schedule for the experiment.


In addition, we want to be able to work with possibly large instances, to measure how ef.cient is the transformation generated by a system.

we cannot rely on known tree-similarity measures, like, for example, edit distances [7], which are of high complexity and therefore would prove too expensive.


In this case, there is only one map block.

its shape is a single-level 3D shape of {[0 : M , 0 : N , 0 : K]}.


For example, Greenwald constructs a basic hash table implementation in which processes register operations in the header of the hash table.

every process wishing to insert an element must .rst complete any other active operation before beginning its own, even if the operations access distinct buckets.


I, do if A is an atom of a tabled predicate with mode last I0 + (I0 U {A}) - {A1 = I : K(A1 ) = K(A)} (*) else I0 + I0 U {A}; 3. return I0.

the .xed point semantics of P can be described as TP .


Since Pattern 8 a.ected the Feature Model, one may now look up, which pattern addresses change in Feature Models.

pattern 7 is relevant causing the existing Feature Model Con.gurations to be updated.


The data .ow analysis framework[24] of aiT hasbeeninstantiatedtoperform .xedpoint iteration on the symbolic representation.

the integra (.T.b, .b Algorithm 3: DoBlock+A.b ,b) the blocks correspond to the enumeration of the relevant instructions at b3 and b5 respectively.


(p(Base) .p(GetPop Base)) SAT solvers ef.ciently verify existential clauses for propositional formulas [27].

we transform constraint (2) into a theorem to be veri.ed by a SAT solver.


Also, the representation of a database-driven application must clearly indicate the coupling points between the program and the entities within the database [12].

the calculation of any test adequacy metric for database-driven applications requires a uni.ed application representation to select defect-revealing test cases from an input space that is essentially in.nite.


Moreover, memcached can also be distributed on several machines, so that request workload can be automatically distributed among all instances.

as one of our next steps we will test a parallel/distributed deployment MoSoGw and precisely assess its scalability.


The gray nodes can be eliminated safely because their children contain all information.

the actual, minimized footprint graph is only eight nodes in size.


movbe (move big endian) instruction introduced in the Atom processorfamily [19].

it makes sense to investigate further ISA extensions to support IA s breakthrough into these markets.


Through extensive Wi x=1 Pi(x)x experiments, we found that the quantity PWi is a good metric for measuring the uncertainty of task Ti.

we sort the tasks in increasing order of this metric before applying the algorithm in Figure 1 and execute the tasks in the same order during each frame.


Detail information on the fortress is also given at the fortress site such as the complete plan of the original fortress and some background history.

the experience of being at the fortress site provided better understanding of how the fortress might actually looked like rather than just looking at the pictures of the fortress.


Our experiment indeed shows that the majority of loads that can benefit from stride prefetching are inside loops with high trip counts (see Section 4).

restricting profiling and prefetching to in-loop loads with high trip counts does not impact the performance.


Likewise, given a TO instance t, we get its FROM instances via to(t).

from() enables forward traversal, while to() gives backward traversal.


It is now possible that both T3 and T4 read the old values of Y and X respectively (from their caches), violating sequential consistency.

while previously the read-others -write-early restriction appeared to have (acceptable) implications only for the main memory system and the cache coherence protocol, new SMT and multicore architectures move this restriction all the way to the .rst level cache and even within the processor core (if there are shared store queues).


For instance, caller plus web have composed overhead of (1.8 - 1) + (1.11 - 1) = 0.91 on average.

this composed method is 1.91 times slower than the baseline.


more than the number of cache regions in the LLC), in each time period, cache pollution is limited within a few cache regions because consecutively accessed blocks are usually correlated and are in same sequences.

most cache regions can still be ef.ciently used without suffering from cache pollution at any time.


The impact of position inaccuracy y is more severe in High Concurrency Protocols with Slow wdown (HCPS) of STIP protocols, since this group of f intersection protocols explicitly utilizes information rrelating to a vehicle's progression inside the intersection area.

a failure in locating a vehicle's current ce ell information correctly may lead to vehicle collisions insiide the intersection grid.


On the other hand, every node only receives O(EL) requests within 9 rounds.

the maximum rate that can be sustained is T(E/((1 - E)En)) = T(1/((1 -E)n)).


The same approach could be used by the sender.

send only the values of the data that has changed from the previously sent data values rather than all the data.


In distributed control systems, calculations are distributed to multiple processors.

if a parameter value is needed from another module, the engineer has to add an external data point symbol to the program.


Unfortunately, it has no replay facility.

when there is nobody home, messages are lost.


[42], we model loss using a two-state Gilbert model [17], setting loss rate to 1% and mean loss burst time to 100 ms. 7.1.3 Performance metric As discussed in §2.1, lag is the most important network factor that a.ects player enjoyment and performance.

the primary performance metric we measure is percentage of required updates that are received on time.


Preliminary evaluations on hundreds of fragments showed that if a fragment ever .nishes, it .nished within 0.2 second.

we set the limit to 0.5 second and kill the process if it exceeds that limit, and the output of the execution is marked as a failure for later use.


They typically use the EIP register to indicate where in the application should the kernel return control to.

when BIRD intercepts the return instruction of an exception handler, it uses the EIP register rather than the return address as the target of the return instruction and invoke the dynamic disassembler if the target happens to fall in an UA.


Functional languages allow a new function to be added to an existing datatype.

eML must allow a new function to be added to an existing class.


Our reverse engineering set of tools will be able to recreate the traceability links between the robustness model objects and the implementation classes, based on the execution trace that correspond to the steps of the scenarios.

our environment must support use-cases, scenarios and robustness diagrams editing.


In older schemes, which used heap based allocation of stacks [4, 14], the activation records are allocated on the heap, and explicitly deallocated when the procedure returns.

no task runs out of memory, unless there is no space left globally.


In experiment, each node represents one autonomous VO, in which 40 resource nodes and 40 kinds of application services are simulated.

the maximum identifier space is 25×80 (2,000).


2.1 Participants We focussed on organizations that potentially had the option and resources to conduct usability evaluations.

we wanted Copyright 2008 ACM ISBN 978-1-59593-704-9.


The main idea of Informatization is to set up government association and industry Informatization based on   ARP, instead of separated information.

there will be more solution in virtual governments; virtual enterprises unfixed enterprise link and virtual resource association.


It is '' '' possible to apply Avoine's scheme for UD(pcom,X ,Y '' ,f ) (which we call Avoine's dynamic scheme), but it cannot utilize the older result of pcom, and needs a heavy calculation as evaluated in Section 5.

to design a secure identifcation scheme with efcient update is a crucial challenge in largescale RFID systems.


Trapezoids are executed in the form of thread blocks whose execution do not interfere with each other except for device memory accesses; when multiple memory requests are issued in bulks by multiple thread blocks, the requests are queued in the device memory and a thread block may have to wait for requests from other thread blocks to complete before it continues.

the latency in the device memory accesses (MemAcc) needs to consider the joint e.ect of memory requests from all thread blocks, rather than be regarded as part of the parallel execution.


On the other hand, there are still only .nitely many choices for a node n, namely the number of members in the class of n, that is, |classn|.

to produce a new criterion for trivial colorability, we must .nd a measure of the constraints imposed on n by n s neighbors, and this measure must be comparable with the number of choices |classn|.


During its initialization phase, A builds a small set of information on connectivity parameters (e.g.

one-way delay) towards other peers, then it associates with an existing super-peer S, and upload this set to S. each SPAD super-peer receives and stores connectivity parameter (CP) information from its associated normal-peers.


As mentioned above, the capturing device needs a certain amount of time to process a tag.

if too many tags are required to present the required information, capturing the tags becomes less user-friendly.


The .rst is stored inside the containing entity s table, the second is stored in its own connection table.

acoda provides three dif ferent coupled operators for property creation: one for value prop erties, one for single-valued associations, and one for multi-valued associations.


Since the lock on writeLock is held by T1, it gets blocked.

t1 is waiting to be noti.ed by T2, and T2 is waiting for T1 to release writeLock.


To provide reproducible results, the traces must be run on a single .le-system image.

the iBench suite also contains snapshots of the initial directories to be restored before each run; initial state is critical in .le-system benchmarking [1].


This could allow the movement of one or both of the accesses mentioned in Section 3.1.1, into an overlapping region of execution.

the fewer the interesting synchronizations among Usync, the more the unaffected statements in user code, and so the less the chance of two procedures immediately interfering as a result of a data-.ow transformation.


Giventhe destructive potentialofbuggy.lesystems,itiscritical thaterrorpropagationpatternsbe carefullyvetted.However,failures in the physical layer, while inevitable, are rare enough in daily use that traditional testing is unlikely to bear fruit.

we propose a static analysis to identify certain common classes of error mismanagement.


Executing a plan means invoking each service that compose it according to the execution process defined in the workflow that have originated this selected execution plan.

openCOPI orchestrates the invocation of each service.


The decision table of the OSS algorithm contains 15256 elements, while the threshold table of the OSSL algorithm only has 4920 elements.

the OSSL algorithm runs much faster than OSS: less than 200 msecs versus up to 44 secs.


We added support in the front-end for generating call statements with non-contiguous actual arguments, sinceordinarilyonlyabaseaddressisused.Inthesecondcase,the front-endwillordinarilyrepresentallassumedshapearraysasdope vectors.

it will create a dope vector in the calling function, initialize it to point to the section of data that is being passed, and replace the actual argument in the call statement with it.


This information is suf.cient for our simpli.er to assert that ss is nonempty.

the calls (head_1 ss) and (tail_1 ss) are safe from pattern-matching failure.


Furthermore, a person may not know the email address for the individual he or she is seeking, since one purpose of an OSN is to reconnect members with out-of-touch acquaintances.

people need to rely on other biographical features to locate their friends, resulting in a search process that is much less precise.


Every path in G{ corresponds to a path in the burdened dag Gb, except that G{ omits overheads for continuations that are not stolen.

we have T8{= Tb8.Since we only have a migration overhead when a continuation is stolen, thetotal amount of overhead in G{ is at most dPT8{+ O(Plog(1/e)),from which it follows that T1{= T1 + dPT8{+ O(Plog(1/e)) = T1 + dPTb8 + O(Plog(1/e)).


In particular, it does not satisfy the third property because its value is dependent on the old values in the input buffer trans that were read in iterations prior to the current one.

without the declaration of balance as a global variable (which would cause it so satisfy the second property), the three .ner-grained services would be not identi.ed.


For each slot, the af.nity cost is assigned in a way that a higher cost is given as the distance from Y increases.

the scheduler prefers slots that are close to Y and (3,11) is selected.


Such an embedding would add expressive power but would arguably also forego separation of concerns, increase complexity, and decrease chances for automation.

this paper attempts to get by without a logical embedding approach by supporting common programming idioms directly.


Consequently, the total request rate experienced by the MDS depends on the meter reading rate on each individual concentrator.

j concentrators can deliver the same request rate q of j/2 concentrators where each deliver 2q request rate.


Finally, since AOSE methodologies often have to deal with many di.erent kinds of WorkProduct and relations among WorkProducts and actors, one further addition to SPEM could be a mechanism for the management of the representation complexity similar to the SODA layering principle.

in the future we also plan to test SPEM in other contexts, like for instance Aspect-Oriented Software Development [10], with the purpose of devising a possible SPEM extension that makes it general enough to potentially model any kind of process, independently of the computational paradigm adopted.


In DCAS, the primary focus of adaptation mechanisms is recovering from situations in which the system is running under the acceptable levels of performance.

in this case we identi.ed potential sources of system states in which anomaly rpsViolation holds.


22 These conditions guarantee that the data spaces of any two processes cannot overlap.

we think of programs in the universe model as a set of mostly independent sequential processes.


In the capability model, possession of a capability to some object is sufficient to use that object, and the reference distribution graph is at the heart of the security policy.

a permission is encapsulated as a capability, and the complete set of system permissions is given by the system s reference graph.


2.1 Property 1: Task-based An EPL representation must retain information expressed by many different programming models.

it must offer a universal mechanism for representing parallelism.


Let y .P be the head of the semi-strong path q.

we know that there exists a semi-strong path q from A to B such that the strong path from y to A (as well as the strong path from y to B)is honest if (any subset of ) the second set in Ais corrupt and is fail-stop corrupted if (any subset of ) the .rst set in Ais cor 4The exact probability analysis is easy and very similar to the one done for the Information-Checking Protocol of [11].


5.1.1 Form relations extraction The forms either permit the updating of relations in underlying database or represent a view that is often a joint of relations.

each field entry is generally linked to an attribute of one relation in the underlying database.


Viewing the operating system as an immutable object is clearly at odds with the bulk of operating systems research, which seeks to develop and integrate new ideas into operat- ing systems themselves.

to reduce the efforts required to change the OS, a large body of research has investigated how the operating system should be restructured so that it is eztensible [8, 13, 15, 35].


However, the efort of compiling a region of code is only worth if the code is frequently executed otherwise, the compilation overhead outweighs the reduction of the execution time achieved through the compiled code.

a technique known as Selective Compilation is employed in several Java Virtual Machines [11, 9, 10].


Our approach implies frameworks to have more entities, due to the existence of the specialization aspects.

one may be concerned with scalability issues when applying the technique to large frameworks.


However, both memory ports are used at modulo cycle 1 by the two loads of the original loop code iteration.

we have to move the load one cycle back in the schedule to cycle 9.


As all the semantic actions are introduced to the AST node classes, there is only one class hierarchy created.

during tree iteration, object-oriented polymorphism is sufficient to determine which node s processing method should be invoked at runtime.


Another major drawback of the if-solution is that the compiler cannot optimize away arithmetic loops.

we did not use it in our implementation.


On the other hand, if some node announces a mismatch in step 2, then Dispute Control will be performed, which will result in correct outcome for the broadcast of the k-th instance.

in all cases, NAB will lead to correct outcome in each instance.


Running Example The Comparison Component in this step is refactored to support annotations created by the application.

the application is able to create annotations related to its domain, which can also be used by other frameworks and components.


The compute time is almost completely consumed in the base blocks which is a generic multiplication on matrices of dimensions 32 × 32 or smaller.

these performance results show how their iterative algorithms could perform for small matrices if the Morton-indices would have been computed incrementally instead of by dilation.


Since L Pi Pi L Pi = Di, f monotonically decreases with L. Furthermore, notice that if L = Di, Ci(0,L)=0 because no job has a critical time earlier than Di.

it is suf.cient to con / sider the case of L= Di, where f =Ci Di.


Finally, in some studies the question was Not used directly to guide the search for primary studies.

the studies were also classified according to the use of the research questions as: PICOC, Search terms, and Not used.


Unless a proof of correctness is constructed, it is impossible to determine exactly how many faults exist within a program.

different tests have been developed to capture different tool abilities.


This behavior is explainedbythefact thatF-AODVminimizes the number of nodesthatparticipatein communications usedby F-AODV which in turn causes a low probability of contention.

f-AODVcanaccommodate morepacketdeliveryinthiscase by reducing the number of collisions using a low number of FNs.


Thus, there is a winner of chain 0 which is active at the end of o~m+l and has location 0.

there are at most k - 1 processes with locations 1,... , oo at the end of am+l and the claim holds.


The overhead due to the run-time checks is proportional to the number of invocations of overlaid functions.

to generate an e.cient overlay structure for a given memory size, we need to minimize the overhead due to the runtime checks.


However, for many e-commerce applications, content is created dynamically based on the current state of a business, such as product prices and inventory, rather than static information.

content delivery by most CDNs is limited to handling static portions of the pages and media objects, rather than the full spectrum of dynamic content that constitutes the bulk of the e-commerce Web sites.


Other iterations to step 3 of the above algorithm will further remove the layers, one per iteration, until it reaches to the top two layers wherein all interactions are identified.

the number of iterations required to identify all the interactions will be n-1 , where n is the number of layers.


Fortunately, inspired by Simon s ant[2], we also realized that though single node s intelligence is negligible, if nodes can be programmed properly, the intelligence shown by these collections of nodes is strong enough to accomplish some complicated tasks.

to addressing the self adaptation problem of whole sensornet, we can start with programming single node to enable it self adjustable.


In some systems faults may cause human injury, in others loss of money.

to increase understanding, analysability and testability of systems, simplicity and static solutions is prioritised in many design decisions.


Maximally-sharedgraphsprovide severalbene.ts: Node ni is reachable from node nj if and only if nj is datadependent on ni.

irrelevant sub-expressions are automatically sliced away.


METHODOLOGY OVERVIEW The starting point of the methodology is a system composed of a RTL IP-core (device) and the related testbench (see top of Figure 1).

the RTL testbench tests the IP functionalities: it is assumed to be correct and complete.


As a consequence of this synchronization, s is added to the set S of nodes logged in I and s ~ is replaced with $ within P. Operation Iogout(1) disconnects the executing node, say $, from £.

s is removed from the set $ of nodes logged in I and any alias for s is removed from the allocation environment of £.


In conclusion, none of the existing approaches meetallthree requirementswhich wediscussedinSection3.

wewillpresent ourapproach that satis.esthe three requirements in the following.


A model field is an abstraction of one or more concrete fields.

model states must be accompanied by a represents clause that defines whether the object is in that state in terms of concrete Java fields.


Con 2045 sequently, components are arrows between interfaces and so arrows between components are arrows between arrows.

three notions have to be taken into account: interfaces, components and component morphisms.


Visiting a point in the fault space incurs a certain cost corresponding to the generation of a test, its execution, and the subsequent measurement of the impact.

ideally, one would aim to visit as few points as possible before .nding a desired fault.


whose kth bit is set to1 if f accesses (a data element from) .k; otherwise, it is set to 0 (note that all iterations in an iteration block access exactly the same set of data blocks).

the tag associatedwith an iteration block summarizes the data access pattern of the iterations it holds.


Scalileo uses a bootstrap procedure to acquire new nodes.

no installation or con.guration is required on previously unused nodes.


µF negNorm = [trans]D Q0  2.5 In.nite State Space The Haskell representation of DTTs generalises the de.nition of DTTs as it does not put any restriction on the state space: the state space q in the type TransD fq g does not have to be .nite.

we can express transformations that go beyond DTTs in the traditional sense, e.g.


3 cannot change the nondeterministic behavior of the original program.

it does not include an abstract cost to measure the amount of nondeterminism.4 Due to this fact, the current RLNT calculus enjoys the following property: for each residual rule r, the associated costs in the original and residual programs, (k, k ' ), have exactly the same structure (i.e., the same number of alt constructs and in the same position).


3.1.2 Attribute De.nition A collection of synthesized or inherited attributes is an extensible record, too.

for each ATTR declaration in the .agi .le, a label has to be generated to refer to the de.ned attribute.


Here it has to know how much of the remaining code of the caller to copyback.

an address consists not just of an offset (relative to the startof the green zone)but alsoa sizein bases.


All elements, models, and transformations between these levels have been continuously and uniformly specified thanks to a single UIDL: UsiXML.

this transformational approach is superior to existing approaches in that all the design knowledge that is required to conduct the transformations is explicitly given in transformation rules.


Myriad techniques to decrease dynamic processor power are also emerging.

processor power may increase only slightly or remain stable over time.


Even though the recall measures were not 100% for all the features, they have presented high accuracy in the recovery of feature code.

it seems that our proposal for forward recovery provides developers with a reasonably-reliable way to understand the program family evolution (Section 3).


By having the product line mapping more fine grained this problem could be resolved.

we found the structural match between software architecture and the product line mapping result to be very good.


Then, the (.eld) referencing level from Oi to Oj is n, the number of .eld references needed to reach Oj from Oi, i.e.

oj is reachable from Oi at (.eld) referencing level n. in Figure 1(b), the referencing level from A to E is 2.


For example, in Figure 9(b), variable u and w have two different values in subspaces 1 and 2 respectively while v is only updated in subspace 1.

subspace 1 is the one that contains all the three variables, subspace 2 only contains u and w. Since the values of variables a and b are not affected by speculative values, these variables do not exist in any subspace.


The most important observation here is that: Having coring as post-processing to sk-strings removes not just erroneous transitions but also quite a fair number of correct transitions.

the accuracy of the mined speci.cation degraded.


In particular, feature models have been mapped to Core Components which is a prerequisite for deriving business documents utilizing feature models.

in the following we sketch our approach for deriving context-speci.c business documents while utilizing feature models, as illustrated in Figure 8.


Moreover, the parallel intermediate delay is equal to the minimum possible delay because an intermediate computer must transmit the command to the next destination, and the delay captures the time requires for the transmission.

overall, the model predicts that when multiple cores are available for scheduling, the parallel multi-core scheduling policy should always be used.


Because reachable memory usually grows more slowly than the allocation rate, allocations trigger more and more collections as memory .lls the heap.

we support two options: (1) moving to PRUNE when the heap is still 100% full after a collection and the VM is about to throw an out-of-memory error or (2) moving to the PRUNE state after .nishing a collection in the SELECT state.


We utilize the fact that we need to preserve the old contents of a .le only if they were read.

we update the PFile structure to track the upper and lower bounds of the .le positions that program actually reads.


In this regard, in order to reduce the number of tests cases and save time, we found that tests also should be oriented to features.

this would facilitate executions of test cases for both generative and runtime techniques.


One approach to improve the detection of redundant information for non-WinZip encodings is to reduce the average chunk size, but even using CDC with an average chunk size of 2 KByte, we have only been able to detect 51.3% of redundant information.

we have created an application-speci.c chunking method for zip-.les.


Blackscholes shows good scalability at least up to 32 threads and does not show variation in the right number of threads to run even during the course of execution of the program.

lIMO picks 32 threads this benchmark does not exhibit varying characteristics during its execution.


This change also influences the execution of Class B since it inherits the changed Class A.

all the methods of Class B are also marked as changed.