In our experience, for well-designed systems, the interfaces between components are small, and the generated assumptions are much smaller than the component models.

it is more e.cient to check the assumptions than to check re.nement directly.


Good practice is to keep the amount of data that is passed to and kept within business processes as limited as possible, as BPEL engines hosting long-running business processes typically store this data in a process database.

we recommend limiting the data held within business processes to a minimum.


As mentioned in Section 4.2, the number of turning points in the functions may suffer exponential growth.

we propose a function approximation technique to limit the number of points.


Loads that frequently cause violations are delayed until the producer epoch commits rather than until the desired value is produced, due to the dif.culty in identifying dependent store-load pairs.

this dynamically inserted synchronization tends to serialize parallel execution more than necessary.


Note that our protocol enables the distribution both in the negotiation level (the algorithm) and in the physical level (the distributed algorithm can be incorporated into each of the network s nodes, rather than placing all the agents in a central location).

our algorithm can be used in a spectrum of applications.


The templates are based on the business models of the IBM Websphere Commerce product, which are part of the product s documentation.

we believe that the templates are representative of practical business templates in terms of their structure.


de.ned) between T s and D s de.nition points in B.

but, we know that D is the .rst de.nition of a register in block B while iterating backwards from I and that L is not D. we reach a contradiction.


INTRODUCTION Developing a software system s user interface is a time and resource consuming task which takes up to 50% of the system s total development time [8].

reusing existing components is an important topic in UI development.


In this situation, if any single block is updated among the striping blocks, a corresponding parity block should also be updated.

the number of P/E cycles of flash memory increases rapidly and the lifespan of flash memory can be shortened.


However,its attemptstojoin each of themfailedbecause no candidate could accept another peer.

the node waited 5 secondsfor RANSUB todeliverit a set of newpeers.


The mentioned examples uncover another reason why traditional approaches poorly scale with the size of the di.erences model the traditional approaches use only one visualization technique.

approaches that aim to provide a visualization of model di.erences that scales well, have to combine multiple techniques.


Both, SD and TD are the graph shown in Figure 3.

s and T are equivalent according to D. If D = ., then all shape graphs are collected in one class.


This could mean that the classes which communicate by the this transfer object are also part of the component although they are not linked otherwise.

the transfer object should be excluded from the clustering in future iterations of the reengineering process.


Consequently, there are .nitely many schema mappings M/ = / (S,T,S)speci.ed by a .nite set of s-t tgds such that S=S/.Let M1 =(S,T,S1),...,Mk =(S,T,Sk)be an exhaustive list of all (up to logical equivalence) such schema mappings.

for each i =k, wehavethat S|=Si or Si|=S.


For a method that does not access static .elds, the prestates it can reach are the objects reachable from the actual arguments and the method receiver.

if any of the formal parameters of m or implicit parameter this, is inferred as mutable by reference immutability inference, m is impure.


These simple test inputs exercised most of the methods, but did not necessarily achieve high branch coverage.

in our experience, the result of the type discovery algorithm is mainly a.ected by which methods are exercised by the test inputs, and is otherwise mostly insensitive to the choice of inputs.


In addition, unit annotations, similar to data types of program variables, are relatively stable to program re-organization: structural changes will not require annotation changes as long as data in the program have the same semantics.

annotations for legacy code can be reused because retro.tting legacy code usually changes program organization, not the algorithmic/data aspects of the program.


However, our main aim is to improve the evaluation performance of a constraint checking environment.

we should consider not only general optimization techniques, but OCL-speci.c ones as well.


A user might perform two operations o1 and o2 where the inputs to o2 depend on the results of o1.

a discrepancy in the execution of o1 affects the execution of o2.


In such case, the corresponding indexing tree (for the empty set of parameters) is actually a list instead of a map.

even if all parameters die, the monitor will still be kept alive because there is a reference to it in that list.


In contrast, SCA always loads the same data center to maximum capacity before using the next.

the second and third data centers may incur low peak power costs (because they are never highly utilized).


MICRO 11, December 3-7, 2011, Porto Alegre, Brazil ECE Department School of Engineering Boston University Brown University Boston, MA 02215 Providence, RI 02912 acoskun@bu.edu sherief_reda@brown.edu * [10, 5].

it is critically important to plan and manage facility power and cooling resources.


Grace s types are primarily structural, and it takes a little more effort to rule out something that is structurally a Contract, even through it was not created by the class contract  4.1.3 Pol A3: Contracts may only be obtained through calls of getSellerContract or getBuyerContract Pol A3 guarantees that the only way to obtain contracts encapsulated in a module M is through the call of the functions getSellerContract or getBuyerContract.

this policy forbids the addition, of, say, a public method getContract accessor that returns a contract, and which would make it possible to leak a contract to a malicious third party.


6.1 Predicting By Queue Name and Processor Count With scheduling improvements such as back.lling [18], dynamically changing user priorities (often at the behest of besieged system administrators or center personnel struggling to meet the requirements of an important demonstration), and statically de.ned priorities based on job size, users of modern batch systems have come to expect that processor count affects queuing delay.

a common user desire is to be able to predict, at any point in time, an upper bound on delay for potential job submissions of different job sizes in a single queue.


we have developed a preliminary implementation of Madeleine on top of VIA.


B is itself described by a process (child) composed of two activities, C and D linked by a .nish2start dependency.

c has to be .nished in order to start D. The transformation translates each process and work de.nition into a dedicated pre-de.ned Petri net template, and each work sequence into an arc.


A simple computation shows that the simple randomized algorithm will sample the .rst interleaving with probability 0.5, the second interleaving with probability 0.25, the third interleaving with probability 0.125, the fourth interleaving withprobability0.0625, and the .fthinterleaving withprobability 0.03125.

onepartial orderwillbesampled withprobability 0.96875 and the other willbe sampled with probability 0.03125.


Proof The proof proceeds by induction on the derivation of f f e : L. Case x: Thenthe derivation ends with TV AR followedbyan application of subsumption for the re.exive case.

by the premise of TV AR, f(x)= L, and thus by de.nition of r µ(x)= v(x).


Second, a non-SCexecution might enter a non-terminatingloop that is not possible in an SC execution.

the hardware eagerly performs con.ict detection if a region has executed for more than some constant C cycles.If a con.ictisdetected, anMM exception is thrown.


Given that the objective of this study includes understanding whether the students comprehend the essential concepts discussed during the coursework and do not merely memorize such information, the manual could be used during each tests, including the final inperson evaluation test.

if a student does not adequately answer a question, it is more likely that the problem is not a failure in recognition or memory.


However, as Figure 1 shows, SDT overhead is directly related to the rate of execution of IBs.

most graphs report results (theSPEC number for 3 runs) only for the SPEC benchmarks that execute a significant number of IBs, namely: 177.mesa, 176.gcc, 186.crafty, 252.eon, 253.perlbmk, 254.gap, and 255.vortex.


Although the patch contains some lines of code from the document as context, the containing method of a modification is often not deducible based on the patch alone.

the original source file is needed to infer the affected method.


Unfortunately, the model of types does not include higher-kinded types.

to ensure full interoperability with genericity in other languages on this platform, compilers for languages with type constructor polymorphism must resort to partial erasure, as well as code specialisation in order to construct the necessary representations of types that result from abstract type constructors being applied to arguments.


For this reason the communication cost is a key factor in the WRF performance.

wRF is considered a tightly coupled communication application.


Fj) /* to eliminate redundant checking problem */ break; /* state s has already been checked.


Additional, the second test case must not lead to that defect.

the difference between those two test cases leads to the root cause.


These languages typically only intercept messages between objects.

it is likely that join points can be represented by graphs as presented in this paper using frames for those messages since the join point models of these languages are similar to that of CF.


However, when we enable two cores that belong to same physical core, the execution time is similar as if only one core is enabled.

when three cores and four cores are enabled, we get the same execution time as if only 2 physical cores are enabled.


In this example, the exiting-loop branch of E1 goes to node H without any statement on the branch.

it is expanded into a dummy node, I2, which can not be further expanded.


The second insight is that for a given value of interest, most branches in a program do not impact its value alias set, even though they a.ect the concrete execution state of the program.

we can use the selective merging technique described in [10] to design a scalable path-sensitive analysis that tracks only relevant branches.


In this case, violations were introduced because the implementation of synchronizedMap guards each operation by the object s lock while the implementation of ConcurrentHashMap has internal locks which are different than the object lock.

two of the methods are built by a set of collection operations guarded by the collection s lock.


Each binary is assigned the lowest level in the hierarchy from which at least 75% of the commits were made.

if engineers residing in one region make at least 75% of the commits for a binary, but there is no campus that accounts for 75%, then the binary is categorized at the region level.


If it is compute bound, then we consider unroll factors that provide increased operator parallelism, in addition to memory parallelism.

we .rst look for a loop that carries no dependence (i.e., .d.Ddi = 0).


(Note that the entire function body is pure and local, after register promotion of local stack variables.)

the tool would present to the programmer the subset of the body of the function that is used to compute the return value in the failing run, i.e., lines 6, 8, 9, 10, 13 and 14.


To this end, random products, sets of random products and the initial population can be produced e.ciently [12].

the search space is reduced to only include valid products.


Copying a permission for an object x means that x may be shared: it may be used via different pointers, or by different threads simultaneously.

a duplicable permission does not represent unique ownership; instead, it denotes shared knowledge.


To simplify notation, in what follows we shall equate guards up-to commutativity, associativity and idempotency of 1, and up-to absorption of -conjuncts.

every CDC if 9then cin Vwill be considered in a normal form like ffff if 1 BEAr1jK B'EtAjr'then cin n1j'jV for .nite (and possibly empty) index sets Iand J, with 9logically ffff equivalent to A BEAr1jK B'EtAjr'.


1(b) with a dimension of 15.4× 2.8× 2.7 (in meters).

a freight train can be 1,000-meter long.


Although there is little information available yet, it seems to rely on the construction of a graph of functional dependences (i.e., only function names and their dependences are considered).

in principle, it should produce bigger less precise slices than our technique.


Hence, the total number of inference rules used in the derivation of the reduction is O(m + n).

the proposed reduction algorithm is in P. Moreover, this formulation renders it directly amenable to being implemented in a logical framework which we discuss next.


Simulation runs are terminated by meeting one of the scenario, and it variable Success can be determined based on application requirements.

we classify success as follows: f<i: dpq(tend)is less than initial dpq(0)  f< 0.5i: dpq(tend)is less than half of initial dpq(0)  TCap: target is captured by pursuer  f <g: dpq(tend)is less than the distancebetweenpp(0) and pq(tend)  where dpq(t) is the distance between pursuer and target at t, and tend is the simulation end time.


The Domain Abstract Representation (DAR), located on the logical layer, represents a DSL program .

it is based on the DSM, edited by using the DIM notations and stored in an XML document.


1http://www.jhotdraw.org/ JHotDraw is an especially good candidate for a training program because it was designed and implemented intentionally to be an example of good object-oriented code, using the latest design patterns and coding standards.

there should not be many cases where code needs to be refactored in an object-oriented manner, but instead only cases where object-oriented solutions did not succeed.


For some loop-nests, opportunities of pipelined parallelization might be masked due to the presence of mismatched loop bounds.

as a preliminary step, we employ loop alignment to extract loops with similar bounds.


The effort and change need to be controlled by the team leaders in order to assess dependencies and relations among other development tasks.


For instance, the sqlite and memcached bugs are relatedtotheinternal stateof theprogram(inparticular,the cached values in memory).

it would not be possible to replay such bugs simply by recording incoming requests.


CYCLE COLLECTION One of the primary disadvantages of reference counting collectors is that they do not .nd cyclic garbage.


m. Since p1 sends m1 in round r1 - 2D, Lemma 5 tells us that p2 must have received a message that is at least as great as m1 before round r2.

p2 cannot pass Line 16 in round r2 by receiving m. (Case 2c) r1 - D<rv: We know that rv <r1, which means that rv .


So, by the de.nition of A0, c(A0) = c(A ' ) < 8.


These theories change on the basis of new decisions or new interpretations of those decisions.

i believe it is a useful abstraction to equate theory and requirements, models and implemented systems (with out stretching Maibaum and Turski too much).


The inductive annotation is a correctness proof for the counting automaton, which shows that every trace accepted by the automaton satis.es a given speci.cation.

we may prove the correctness of a program P by exhibiting a counting proof such that all traces of P belong to the counting automaton associated with the proof.


The obtained number is then multiplied with 1000 in order to obtain the relative number of defects per thousand logical lines of code (KLOC).

relative defect density for programming style N is .NN %i i DN = ×1000 , (5) C L N where i is the index variable denoting each found defect, NN%i is the relative amount of effort spent with programming style N in the task where the defect i has been made, and L CN is the number of logical code lines produced with programming style N. Relative defect density is calculated from the final source code for both pair and solo programming.


In contrast, Bn has worse goodput since the server penalizes Bn to download worst-seeded segments (from near the end of the .le).

bn s goodput is adversely affected leading to increased average buffering times and low playback rates.


Several realistic design scenarios requirea designer to constraininteractions between objects (see Sections 6.2.3,6.2.4).API designers need to design and customize object protocols according to the needs oftheAPI(see Section5).APIclients commonlymake mistakes in followingthese protocols (see Section 6).

we believe that it is important for API designers to state object protocols and enforcethat API clients follow such protocols.


As an example, we created a version of the output operation that does not support Barat s Cast and Instanceof nodes, representing Java s run-time cast and instanceof test, respectively.

the output operation is only well-de.ned on the subset of Java programs that do not perform explicit run-time type manipulation.


The exit condition for the merged loop is the same as that for the original outer loop, which gets evaluated at line 9.

a temporary variable outer cond is introduced to store the result of outer cond expr; it is then checked at line 133.


Such advanced computational architectures are raising new challenges related to an ef.cient exploitation of the available processing resources.

platform resources usage optimization as well as application boosting are goals which cannot be considered independently any more.


Additionally, Java arrays have an additional word devoted to the array length.

a zero-length array will require a total of three words of memory, while an object with no .elds will require two words of memory.


Due tothedistributed natureof thesystem,each componenthas only partial information about the state of the system, raising the complexity of providing correct interactions among the concurrent, interacting parties.

the ASD technology was used to develop the control part of the FEClient unit, and the external interfaces of the components on the boundary.


Both types of tasks have a deadline equal to their period, and their density is at least 1 on a unit-speed processor by the de.nition of a heavy task.

for the remaining n < tasks: 11 1 nn n tt t Ci Ci = = .i = .sum = (m - k) (3) Ti Di i=1 i=1 i=1 We need to show that these remaining tasks are schedulable on m <(= m - k) processors of speed ., where .


Consequently, there is no upper bound on the response time of a multithreaded realtime job.

considering threads priorities and using of a single deque per core would require, during stealing, that a worker iterate through the threads in all deques until the highest priority thread to be stolen was found.


Atthe extreme, if several processors share the same set of ready tasks,the contentsof their readyqueues isidentical, and so they can be viewed as sharing one ready queue, and can be implemented that way.

the dispatching model covers multiprocessors where dispatchingis implementedusing a single ready queue, as well as those with separatedispatchingdomains.


Doing so creates the constructor pair(const A Iter1&, const A Iter&), which is invoked by the return statement.

by instantiating class templates with archetypes, ConceptGCC is able to type-check function templates such as mismatch() that use class templates.


In addition, in part II of the study, we not only had a period of discussion among pairs of judges, but we also reviewed each paper for a second time without a time restriction.

the more favourable results with respect to reliability may be due not only to the discussion, but also to the additional time spent on reviewing the paper.


Once a paper is submitted to a journal or conference, those involved in the evaluation of the submission should have synthesis in mind.

editors, conference program chairs, and reviewers should as part of the evaluation consider whether or notthe paper provides sufficient details, use a correct terminology and is presented in such a way that the paper will be useful for otherresearchers conducting a systematic literature review.


Because of the asynchrony of the system, however, this information is not necessarily useful.

e.g., it might be that p becomes aware of q but then p is delayed for a long period of time and q proceeds further in the computation or even terminates without being aware of p.if p waits for q, it might wait forever.


5.2 Discussion Our evaluation has shown that MatchBox leads to an average of 54% mappings found.

our system constitutes a suitable approach for semi-automatic meta-model matching.


Just as measurements are de.ned with respect to a particular unit, scales are de.ned with respect to a unit and origin.

we de.ne a class Point as follows: class Point { private final D _distanceToOrigin; Point(D distanceToOrigin) { _distanceToOrigin = distanceToOrigin; } D getDistanceToOrigin() { return _distanceToOrigin; } D distanceTo(Point p) { return _distanceToOrigin -p.distanceToOrigin(); } } Unlike Units, we do not require all points to be instance classes, so we do not de.ne Point as having kind class*.


When a topic is clicked, the components associated with that topic are highlighted in the topic s color.

it is easy to determine the topical makeup of various sections of the architecture.


Thus, we collocate replicas on nodes as much as their resources permit it.

the nodes processing capacity and the virtual links network bandwidth ultimately determine the minimum number of nodes that can be used for placing replicas in practice.


However, as our experimental results in Section 4 will show, the always-hit model will fare poorly when we estimate the spilling cost to determine whether to apply the IRE to candidate value ranges.

we define a term, ld_cycle_irem, to be used in the cost model such that the spilling effect before and after IRE are both accommodated.


Actually, an XML schema de.nes the meaning of the different elements of an XML language.

we would have to annotate the XML schema directly.


Recalling the fact that the service integrator has indicated that with very high probabilities the system will avoid the user taking a taxi and booking a hotel far away from the attraction, it is possible to derive that some paths in the work.ow are more likely to be followed than the others.

a service integrator might decide not to bind the entire work.ow before the execution, but to leave the less likely paths unbounded.


According to the specifications, we can decide to compose information units by one, two or three images, etc.

data flows are composed of sequence of information units.


We have opted for the simplest possible implementation of constant propagation, to reduce the time overhead that our optimization imposes on the runtime environment.


Since our language is completely defined by formal semantics, conceptual drawbacks have been avoided and complexity has been reduced.

static type checking could easily be provided.


In the general case, producers and consumers do not obtain any direct bene.t from transferring or receiving the value.

we need to assume that they bene.t from participating in the system indirectly, by receiving some form of reward whenever they perform their task as speci.ed.


The mapping section introduces methods into the hypermodule classes by associating a hypermodule operation with a set of hyperspace realizations (method-body expressions) and a class.

a composition clause de.nes a hypermodule unit as a combination of speci.c hyperspace units.


In this case, no node in U can be mapped to the data node m. However, there might have some other currently existing nodes that are dependent on m and they could be mapped back to U.

sAM could use those ' nodes as referenced nodes for mapping between U and U in the case of newly added nodes.


The framework is built upon an open-source performance evaluation tool.

software merging tool developers will be able to evaluate and select the best merge procedure for their needs.


Our architecture of a centralized system executes all important functions and applications.

the centralized system will be the main target for an attacker to get access to a speci.c function.


Finally, since all program variables are bounded integers, we can convert the program to a purely Boolean program through bit-blasting.

in this paper, our static code analysis method is concerned with only the bit-level representation of a branch-free program.


Both the packing code and the unpacking code traverse the iterations executed by a compute device, and the .ow-out set of each iteration in the same order.

the offset of an element in the packed buffer of the sending compute device matches that in the received buffer of the receiving compute device.


Although voice browsers that can read HTML documents exist (e.g., [2]), they do not adequately convey to users the logical structure and semantics of content in Web documents, nor do they provide users with easy ways to select which parts of a document to listen to.

users who are visually disabled and/or mobile waste a considerable amount of time and attention listening to irrelevant information.


As future work, we intend to apply the proposed method to process sensor streams along the routing task and in clustered networks.

not only the data from a source can be reduced, but also similar data from different sources can be reduced, resulting in an ef.cient WSN.


Spatial Decay: Devices performing coordinated sensing are primarily interested in the spectrum usage of their local neighborhood.

we recommend the use of spatially decaying aggregates [6], which limits the impact of an update on more distant nodes.


For example, a page that has been recently read as well as written is kept in both R and W. In this case, the page data is in one page frame, and the page descriptor is linked to both R and W using different link pointers, in order to manage the areas independently and accurately.

|R|+|W|+|C| can be larger than S, and the number of ghost pages can be equal to or less than 2S.


In reality, this costs no precision, as any universally quanti.ed proposition ranging over the empty set would have been both vacuously true and useless.

the Partial Preservation Rule (5.2.4.1) applies.


Such a subgraph may occur more than once in a graph and all occurrences might be created at different times.

the clock has to be added several times to the same graph (once for each subgraph it applies to).


By asynchronous accumulative updates, we need less number of updates and as a result need less amount of data to transfer.

maiter-RR and Maiter-Pri signi.cantly reduce the transferred data Figure 7: Communication cost.


To evaluate it, we must convert x to a function of type Value -> Value.

we must also simultaneously de.ne an inverse to evaluation, called uneval, such that eval .


3.3 Factors Important for Maintaining Trust A vendor needs to not only maintain the trust that a client has put in their capabilities but also to work to strengthen that trust for ongoing business relationships.

a vendor can greatly benefit from focusing on measures that are important in maintaining trust in an ongoing relationship; hence our goal of identifying critical factors for strengthening trust between a client and vendor.


Hence, creating a new mutable variable requires spawning a new thread.

in our implementation, we give newTVar the type a -> IO (TVar a), which is a consequence of the fact that forking a thread must occur in the IO monad.


There are a lot of parties interested in time series data and all of them have certain tailor-made solutions for their speci.c problems.

we have developed the Time Series Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Suppose we wish to build a machine with a particular peak performance of Rpeak .ops per unit time.

given a node of peak Cnode, we will choose the number of nodes P = Rpeak/Cnode.Tmem from Equation (2) becomes, in the limit of large n, ( ) 1 Cnode 3 Tmem O ·· n logZ n. (6)Rpeak ßmem Note the factor Cnode/ßmem.


The template formulas are evaluated during preprocessing.

they do not appear in the actual generated code.


Using the sum of probabilities as an upper bound, the probability that at least one job n2 2k 2 is left for Phase 3 is upper bounded by = = k2 .

k3 k3 with probability at most 1 - k2 2 , the algorithm does not reach Phase 3, and thus, the overall running time for Phases 2 and 3 is at most 2k ·l3 log2 kl.


The pointcut description language cannot pick calls or methods that do not exist.

it is difficult to statically express conditions such as if a method is not called, do that.


However, addEventListener creates an internal reference from elt to callback.

as long as elt is reachable, the event stream .res in perpetuity.


In fact, these values are estimated to 640 mW for Tx and 432 mW for Rx for the time an average web page needs to be transferred [1][2].

the utility loss of a user for sharing k chunks, U(L(k), is estimated in terms of watching time by: tk UL(k)= aenergy × y × k × L aspeed(t) (14) ( t=t1 where t1,t2,..., tk are the time instants where a user broadcasts.


After the page fault is handled and the process accesses the virtual page again, the MRC monitor observes this access and notices that the corresponding entry is invalid.

the stack distance for this access is in.nite and the last two entries in HitCtrs is incremented by one.


Two valid solutions can be achieved via two di.erent feasible sequence of rule executions.

we may de.ne objectives speci.c to rule execution sequences to evaluate the cost incorporated in achieving a valid solution along a speci.c path.


However, the optimization can be performed for each computation separately, achieving the same final result.

to simplify our exposition, we detail the PRE algorithm for just one computation e and we refer to it as the computation.


4.2 Micro Benchmarks For evaluating the approach, not only the functional properties of JCop for Android, but also non-functional properties like performance and memory consumption have to be considered.

we conducted micro-benchmarks to compare JCop/Android method dispatch throughput with plain Java.


The results indicate that the system can accurately detect important windows as the main files a user used for projects, and it can detect files associated with the main file without detection omission errors.

we suggest that our proposed method is more suitable than other methods.


Nevertheless, the benefits of our tertiary models need to be evaluated systematically.

we will perform an industrial field study to assess the usability and usefulness of our approach and collect user feedback for further improvements.


They also show that using the other policies we can obtain higher energy savings (up to 45%) but at the cost of higher time penalty.

policies allow users to de.ne their energy/performance trade o. goals.


It is prohibited to assign a new value to a method parameter.

if the initial value of a method parameter of class type X is an instance of a subclass of X, the value of the method parameter is never updated to an instance of a different subclass of X.


It must be noted that they also stated that their experience in the current project acted as a source of new knowledge that feeds the architectural knowledge available in everis.

explicit feedback was applicable to the everis reference model and architectural knowledge in 3 projects, e.g., there is another SRA that thrives in much of what we did on this SRA project.


As software-based fault tolerance does not come for free in terms of runtime overhead and different hardware also differs in the failure rates, it is necessary to tune the fault-detection or -toleration technique towards the safety requirements and also the hardware features.

a separation of the functional code and the non-functional property fault-tolerance is desired.


UML extensions to deal with the fundamental MAS characteristics neither define nor clearly represent the elements they identify, nor their relationships.

we felt the need for a new approach to extend the UML metamodel so that it could incorporate all features of multi-agent systems.


Re-authoring techniques apply a set of transformations to a user interface.

their output is necessarily a user interface of the same type as the input.


JNI is well speci.ed and completely hides VM implementation details from native code.

native interfaces of guest languages that expose VM details are dif.cult to implement.


Note that the lower bound encompasses algorithms that use comparison primitives, in addition to read and write operations.

one question (raised by Anderson, Kim, and Herman [3]) is whether we can improve the upper bound by employing algorithms that, in addition to read and write operations, also use comparison primitives.


Xmodules have methods to provide services to other higher-level Xmodules, and Xmodules maintain their own data in order to provide these services.

a higher-level Xmodule can pass its data to a lower-level Xmodule and ask for services.


The explanations of confirmed and unexpected results are made in terms of the maturity of the product and the presently most emphasized life cycle.

an anatomy and a list of CSPs need to be accompanied with information of what organization to consider.


The interface includes a function wrap that lowers the priority of the current search, which is inserted to the case partitioning operator and the de.ned function introduction operator in order to avoid in.nite loops.

3.1 Generation of es According to the grammar de.ned in Table 2, generation of e generalizing the I/O example set d involves generation of e',where recursive calls to the function e itself are additionally available within e. the Fix rule in Figure 3 holds. '


VPj is the document standards and EMi is the actual design requirements .

all requirements in RS(i,j,k) should conform to those standards.


Allthreadsinthe sameblockexecute onSPs ofthe sameSM.

threads within ablockcan communicate with one another through the shared memory space in the assigned SM.


As stated in section 2.3, however, it is not adequate to exclusively consider the length of pauses to evaluate real-time performance.

we will now study the distribution of read barrier faults over time in order to determine their actual in.uence on mutator progress and utilization.


Replacing a critical edge with a tail jump edge requires creating a function call with at most ML(P ) arguments, requiring O(ML(P )) time.

it takes O(n + n · ML(P )) time to process all the units.


The storage placement does not reduce the loads on those nodes since all the responses have to be sent through the nodes around the sink.

even though lifetime is an important metric, it is not a good metric to guide the storage placement design.


Overbooking techniques always exposes the cloud provider to a risk of resource congestion and consequently of SLA violations.

we need to establish a trade o. between improving the resource usage and exposing the infrastructure provider and customers to the risk of resource congestion and performance degradation.


Framework overheads In the tests performed with no adaptation, the average time of all the processes was 121 ms, of which 103 ms corresponded to the response from the origin server, 17 ms to the adaptation policy and only 1 ms to delivery of the content to the user.

the delay introduced by the inference mechanism (17 ms) is relatively short and is considered satisfactory for this application.


But estimating the memory working set size of guests is a hard problem, especially under changing conditions [27, 35, 45], and the transfer of memory pages between guests is slow when the memory is overcommitted [17, 31, 36, 46].

upon change, it takes time for the balloon manager to adjust the balloon sizes and to achieve good results.


For instance, if we try to apply an escape hatch inside of some secret computation, it will have the type Sec H (IO (Maybe (Sec L b))) for some type b. Declassi.cation is performed inside of the IO monad and it is not possible to extract IO computations from the monad Sec H unless than another escape hatches is declared to release IO computations.

escape hatches must be introduced to release pure values rather than side-effecting computations, which seems to be the case for most applications.


After Zhou Lin came, he decided that SDB should establish the new generation of integrated operational system, at the same time he pushed on the thorough business transformation for deep development.

in 1998, SDB set up big central IT infrastructure as its three years development strategy.


The min-cuts between s and t1 and t2 are all 2.

the maximum achievable multicast rate is 2.


For example, a business organization involved in banking performs a set of connected business activities which are not performed by a business organization which is in the production of furniture.

the business sector classifies business activities.


This is the current program version P , for which CIDs are calculated and for which logs are created.


The reason for low coverage is that neither Randoop nor Pex could satisfy the requirement of AddEdge to successfully add an edge to the graph object (Branch B3 in Statement 12 of Figure 1).

neither Pex nor Randoop could generate a sequence that helps cover Branch B6 in Statement 2 (Figure 2).


The join and meet of the lattice elements are given by U and n respectively.

given these conventions, one can also visualize this lattice with the least restrictive policy at the bottom, the most restrictive policy at the top, and view the join operation as moving up the lattice and the meet operation as moving down the lattice.


Arithmetic computations on rationals are exact, which is a requirement for proper dimensionality checking.

a rational arithmetic package is provided in GNAT for GeoDesiC use.


The rapidly increasing number of ECUs and bus systems leads to signi.cant problems with respect to wiring, complexity, and scalability.

car manufacturers are striving towards a consolidation of µ-controllers; they want to switch from the high number of individual ECUs (mostly 8-and 16-bit) to a small number of more powerful 32-bit ECUs running multiple applications.


For that reason, and avoiding dirty cross-layer solutions, we decided to implement unicast (OLSR) and multicast (OMOLSR) MANET protocols in the application layer.

our middleware directly benefits from the topology information of the protocol and we avoid unnecessary traffic at a higher level.


As mentioned before, the most expensive execution path from the entry to the exit node of the loop s PDG should be minimized like de.ned by Target (V).

additional constraints are added which statically set the entry node to be a predecessor of all pipeline stages.


The main formal problem is that the Network Code formalism does not de.ne a global time reference for the distributed platform.

the development of a running TDMA distributed system using Network Code necessarily passes through the de.nition of a clock synchronization mechanism.


Improved load balance can be achieved based on an approximation of which nodes have surplus work and which ones are starved and can process arriving task.

the approach presented in this paper relies on a simple heuristic to detect load imbalance in the system and to initiate the work-dealing load balancer.


However, with today s high-end network products like Citrix HDX (High De.nition User Experience) combined with today s server, desktop and application virtualization it is possible to run basically all the applications in the cloud that are to date installed distributed on the enterprises desktop PCs, and this is even also the case for applications that experience high-end interaction and data transfer rates like 3D rendering.

major CASE tool vendors simply can Figure 2: Mainstream cloud computing technologies and software engineering.


The average execution time of the Lua version was 8 µs, which is 0.04% of its rescheduling interval.

we did not introduce a measurable overhead using a CPU frequency controller implemented in Lua.


As explained in Section 2.2, the type conditions on a subclass method must be weaker than the type conditions guarding the method it overrides in the superclass (this restriction is formalized in the override rule, which we explain later in this section).

if method m s type conditions in C cannot be satis.ed by the assumptions in ., then its type conditions in the superclass of C cannot possibly be satis.ed.


2 · .f itnessk(.x) volume(.x) = (7) ref erent f itnessk k=1 where d is the number of objective functions.

all our .tness values lie in a normalized unit space.


RELATED WORK This work is the .rst general study of analysis and optimisation strategies for aspect-oriented languages in general, and for AspectJ in particular.

the amount of related work is rather sparse.


is that out adds the closure of P to the tuple space located at l, while eva/ sends P, not its closure, for execution at I.

if node st perfmms an out of P to node s2, when P is executed at s2, ee].f will actually refer to Sl.


The task of implementing new DSALs remains outside their scope.

also here, due to a tool gap, it is dif.cult to implement a DSAL mechanism [4].


To this aim he/she selects the logical units from the Logical structure view and activates the check-out function clicking on the button to subscribe a contract.

the plug-in shows a form where the developer can de.ne the contract properties.


To handle that case, we compute the minimum ratio of each input s Vnorm and the available input volume for each constrained input once the volume is measured.

nodes and edges are assigned volumes by scaling their Vnorm with this ratio.


Different systems have different number of files.

to compare all the studied systems in a single plot, we used the percentage of files and percentage of points are close to a single straight line thereby confirming that the data approximates Zipf s law [20].


The models of both specification and realization potentially contain variability.

we refined and extended the decision model created as part of the domain analysis and architecture creation activities.


When a function f is called asynchronously, the instrumentation checks the size of ts.If ts is full, the function [ f] is called synchronously.

otherwise, the function f is added to ts.the maximum size of ts determines the number of possible executions of the original program that can be simulated by the translated program.


This usually results in hundreds or thousands of extra instructions and potentially excessive cache misses.

hash-based pairwise dependence pro.ling is often slower than the original program execution by a factor of hundreds or thousands.


Their context does not include unchanged code on which the edits depend.

when there is no deleted API method invocation, the extracted context cannot be used to position edits in a target method.


While Matlab is a good language for prototyping algorithms, code written in Matlab is usually an order of magnitude slower than code written in C, C++, or FORTRAN.

matlab is generally used to develop and test solution algorithms.


Calendar items may include user s private appointments (e.g., family events or a doctor appointment) that should be displayed only to the device owner and public items (e.g., workplace meetings or bank holidays) that can be visible to everyone.

when the owner is not the one using the device, it can dynamically adapt to show only the calendar items that are public.


(b): Suppose q does cover p in some round i of E. Then at the end of round i process q is added to set Gi,1 and p to set Gi,2, and .rst Gi,2 and then Gi,1 are pushed on the stack.

p won t get popped from the stack until q has become inactive.


And the eventual slippage of project milestones for a wrong estimate has an impact also on the product value as perceived by the customer, eventually generating a reduction of the features delivered or maintaining all the requested functionalities extra-costs.

a clear definition of what measured using EAM (Entity-Attribute-Measure) analysis can help in building balanced measurement plans driven by the needed information goals, taking care of the relationship between a software product and its project.


In terms of synchronization between SW and HW simulation, the processor interrupt is modelled by the events propagated from HW to SW simulation.

the emulation of multitasking and synchronization between SW and HW simulation are closely related with each other via the simulation of processor interrupt.


Objects in a child scope are deallocated before objects in a parent scope.

the speci.cation introduces the following annotations, see Figure 5: Figure 5: Memory Safety Annotations.


Also because the specifications and the design options involved in the development process turn to be unidentified, especially when it has to cope with the selection of what modality for which part of the interaction.

motivations for a Type C method for MWUIs include: the need for a systematic approach for developing such interfaces in forward engineering, to maintain high level models that have been used in non-multimodal Type C approaches constant and consistent for the new possibilities [13], to explore different design scenarios based on use cases [16], to support user-centered design by anchoring the approach in task and domain models, to deploy a wide array of MWUIs with different modalities, different properties [5] and design options, to accommodate the approach to various contexts of use.


The remaining 5% of the test instructions were not exhaustively explored because we either hit the limit on the maximum number of paths or because of a limitation of our current concretization strategy.

for the exhaustively explored instructions, our system generated test programs that covered all the possible behaviors of the Hi-Fi emulator that can be triggered by varying the symbolic machine state.


First, when distributing n tickets from one source, only a limited fraction ofhonest nodes(~ 60%in simulations[2]) receive some tickets.

it will fail to admit a large fraction of honest nodes.


To make error messages useful, checkers must report not only what the error was, but also why the error occurred.

all of our checkers track the calculations that found each error.


In our user study, most test subjects indicated that examples help them to understand a new language.

we propose the concept of archetype templates.


The rule for 0 is unchanged, and if no hidden path exists a process can decide on the minimal value it has seen.

a process decides v when it knows .v and that correct processes will never see a smaller value.


The agreement is an XML document based on WSAgreement [20], which has to be signed by the two parties and the federation because it is responsible for all the relations among its members.

the federation manager is noti.ed when the agreement takes place and is over, as well.


This meant that clusters with one member were not desired.

it did not make sense to have more than four clusters because most of the clusters would definitely include only one participant.


After the .x, the tester can again use ReproLite to ensure that HBASE-6070 has indeed been .xed.

the RTscenarios can serve as regression tests.


Note that an entry for v is stored in the invalidation cache, regardless if the node stores any index entry ()kv for v in the index cache.

every ,node will contribute to the propagation of invalidation messages, so that distribution of information and invalidation messages is separated.


Our evaluation shows that HPC applications can achieve almost the same performance as those running in a native, non-virtualized environment.

our approach holds promise to bring the bene.ts of VMs to HPC applications with very little degradation in performance.


However, the practical di.erence between the two techniques is small, ranging, on average, from 7% in the worst case (for Jaba-long-v9 ), to 3% in the best case (for Jaba-long-v9 ).

we can conclude that CollectEA is practical for most programs, especially programs that run for more than a very short period of time.


INTRODUCTION With the application of model-driven development, models become the main artifacts in the software development process constituting the single speci.cation of the software.

the quality of the models in.uences the quality of the developed system signi.cantly and, as a result, a.ects the success of the whole software development process.


Which runtime context needs to be collected for each event is still part of future work.

the event-model presented above is subject to further extension.


However, despite the complexity such a federated environment allows CSPs to make new business leveraging their internal infrastructure, but also external renting resource.

each CSP is able to satisfy their customers demands and making pro.t of unemployed resources by providing them to other CSPs.


The goal of the .rst phase (Phase 1) was to test the effectiveness of the mFerio user interface, and to .x anyde.ciencies found before investing the effort to builda full system.

webuilta complete user interface that followed the exact sequence of steps detailed above, including exchanging information using NFC.


Energy consumption remains a paramount concern.

phase-change memory (PCM) has been suggested for main memory to increase capacity, provide non-volatility for suspend/resume and decrease energy consumption.


It reads in UML models represented as XML .les that can be generated by modelling tools such as Rational Rose.

the ICER tool is not restricted to IBM Rational Rose.


As we assume discrete load, the minimal unit of load is 1.

there might still be an imbalance if wj < wi = wj + 1, resulting in further unnecessary balancing operations.


It is obvious that FMI has a lot of strengths and weaknesses which need to be carefully analysed and put into a strategic framework for long-term growth and better integration into the EU research, innovation and education areas.

a proposal for named SISTER: Strengthening the IST research capacity of Sofia University was developed and it was approved under the FP7 Capacities Work Programme[ 39].


By approximation, f = a×Vdd, where ais Cef constant.

pd = a2 ×f3 = S3 ×f3, where S3 is constant.


However, instead of pre.xing the struct with that of its parent, we omit the parent s layout altogether, and just include the .elds immediately declared in the class itself.

unlike the horizontal object model, inheritance is not encoded within the struct itself.


Furthermore, the design, implementation, development, and maintenance of CS&E applications can differ in significant ways from the systems and development processes more typically studied by the software engineering community: The requirements often include conformance to sophisticated mathematical models.

the requirements may take the form of an executable model in a system such as Matlab, with the implementation involving porting to proper platform.


As a majority of bidders generally places bids shortly before the auction deadline and as the set of bidders is prede.ned for each auction, node churn during this critical period is typically smaller than in comparable application scenarios if not non-existent at all.

our distributed feedback channel is not speci.cally adapted to high node-churn scenarios.


Requirements of anonymity and possibility of temporary disconnections (unreliable communications) imply in the need for decoupled interactions.

alternative coordination models are needed.


The following selection of tools and methodologies has been kept very general.

the selection hopefully .ts most work.ows used to test native C++ code.


It may also be utilized to restore the system code from a secure source to eliminate potential transformations carried out by an adversary [11, 3].

proactive recovery has the potential to support the construction of exhaustion-safe intrusion-tolerant distributed systems.


Hence, the monitoring process for parametric speci.cations is divided into two parts in MOP: the logic-speci.c monitor (generated by the logic plugin) and the logic-independent lookup process (synthesized by the speci.cation processor).

given any logic-plugin, MOP allows one to write parametric speci.cations using that logic with no additional effort.


processing power, memory capability) of mobile devices restricts the usability and quality of services in the composition.

the design and implementation of pervasive services and pervasive applications will be a more complex and challenging task.


50% of the queries in CoDoNS are answered immediately by the local CoDoNS server without incurring network delay, since proactive replication pushes responses for the most popular domain names to all CoDoNS servers.

coDoNS provides a signi.cant decrease in median latency to about 2 milliseconds compared to about 39 milliseconds for the legacy DNS.


In the Type II IRM, the sending model may transfer entities into a bounded queue or a workstation with limited capacity in the receiving model.

entities can be transferred only when the sending model is sure that the destination side is not full (queue) or blocked (workstation).


Once this process has .nished, it will steal another spark.

the spark thread will fully evaluate sparks to weak head normal form (WHNF) sequentially until no more sparks are found.


As explained in Section 2, one iteration of the loop consists of three main steps: waiting till duration [in ms]  the next serverframe starts(NET_Sleep), processing of the game state(G_RunFrame), andthe update of the game state tothe clients(SV_SendClientMessages).

the active time of the server during a tick can be measured as the duration of the processing and update step.


This conclusion can be reached even before the unavoidable overhead of visualizing such nodes is taken into account.

any tool (visualizer or not) which is based on collecting, storing and manipulating execution nodes must reduce the number of events processed as much as possible.


When a source code entity is changed, it produces two kinds of influence: forward influence over source code entities that it uses, and backward influence over source code entities that use it.

our algorithm traverses the dependency graph in both directions in order to calculate these two different sets of influenced source code entities.


Furthermore, the use of reflection is costly.

we need scoped reflection on demand [22] to control when and where and for whom reflective services should be available.


Each peer is expected to perform TCP-friendly congestion control.

throughput from each sender peer can co-exist in a fair way with other outgoing traf.c from that sender (e.g., providing different contents for other peers).


showed that 2-Consensus can be implemented from 2-DAC and registers.

2-Consensus and 2-DAC are equivalent, and the two hierarchies effectively coincide at level 2.


Arguments needed by the processors are given either as attributes or child elements of the processor.

certain elements of an XML document no longer describe data, but functions whose data is other elements and attributes in XML.


The Professional depends on the Older Person to Obtain (Older Person) OP Information, however one of the most important and delicate matters for the older person (as with any patient) is the privacy of their personal medical information, and the sharing of it.

most of the times, the Professional is imposed a constraint to share this information if and only if consent is achieved.


The lack of precision implied by the strokes seems to increase the tolerance of the initial estimate of shape.

sketching has been identified by this research as an important tool for communicating ideas and concepts.


Note that at each data point, the read and write operations are dependent on SPECJbb behavior under that memory pressure.

this benchmark is a representative of varying read/write percentages and parallelism.


For example, a high value for project size can indicates a higher value for manageability of complexity.

the relationships among these elements should also be modeled.


One respondent said that the range of options is wide, nothing more would be added .

we believe that we o.ered a representative set of strategies to be ranked in the survey.


We designate a program transformation rule for each model primitive transformation.

each transformation applied to a model indicates the sequence of transformations to be applied to the program.


This figure shows the turnaround time at each displacement from center given that the sled is moving at the access veloc- ity in the positive direction.

the springs hurt the turnaround time for the negative displacements and help in the positive.


The ideais to penalize arcs that, if cut, will require additional branches tobecome relevant to Tt.

we add to each arc A in Gf the pro.le weight of each currently irrelevant branch to Tt that will become relevant if communication is placed on A.


This leads to a nontrivial description where errors can easily arise.

researchers started the investigation of appropriate veri.cation techniques.


The implementation of each instruction that is available for different types inspects the type of its operand as part of the stack type and generates the correct instruction accordingly.

for most instructions the handling of category 2 types is transparent.


However, PVF does not distinguish between different types of errors that appear as a result of faulty ACE-bits.

our IVI metric incorporates the ACE analysis in conjunction with the knowledge of critical/non-critical instructions and varying probabilities of failures and incorrect output in order to quantify the vulnerability index of a function.


The language encourages the compositional construction of complex components, in contrast to the assembly language spaghetti style used with direct calls to Swing.

subcomponents are subexpressions, and are not added afterwards.


By adding metadata to a datapoint, the value of a datapoint can change by at most 2Lmd - 1.

the mean over the dataset changes by at most 2Lmd - 1.


Two state transitions can take place from any of the states.

the number of parameters which have to be computed is 2m+1.


A conventional branch-coverage prioritization technique may simply order them randomly, and thus ignore much useful information that potentially helps prioritize test cases to achieve a higher fault detection rate.

we introduce how XPath and WSDL can be used to address the challenges.


id User Action System State System Response CM.1 The subscriber selects one Request a confirmation of DRM restricted resource sending a DRM restricted content CM.2 Confirms the attachment The selected resource is operation attached to the multimedia message Figure 2: Examples of scenario composition  For instance, Figure 2 depicts that the behavior of Insert a DRM restricted content in warning mode crosscuts the behavior of Include a multimedia content after Step A1.1 (from step clause) and then returns to Step 4M (to step clause)of Create and send a multimedia message.

after weaving the scenarios showed in Figure 2, the following sequence of events is valid: < 1M, 2M,3M, A1.1,CM.1,CM.2,4M, 5M, 6M> The third weaver is responsible for binding parameters embedded in scenario speci.cations.


In addition, since open source is an intrinsic feature of Android, many researchers are also conducting their studies based on the Android system, e.g., some researchers are focusing on designing middleware in Android, so as to support the mobile social ecosystems [13].

considering the open sourced nature and friendly application development support, e.g., the sufficient SDK support for the real-time connection between the OBD devices onboard vehicles and mobile devices, the current version of Social Drive is developed based on the Android operating system.


This process often takes a considerable time to perform manually, as the length of a real-life requirements document can range from a few pages to hundreds of pages containing numerous words, phrases and sentences, where each can potentially be wrongly interpreted.

checking for errors manually, although the most common way of doing so, is also one of the costliest phases of RE.


Becoming more powerful requires a lot of time and e.ort.

there will be some players trying to break the game rules to cheat.


For example, if the debugger were to ask for the value of the application register %eax in the trace from .gure 6, the PinADX agent needs to know that the application %eax really resides in physical register %edi.

the agent needs this register mapping information whenever the debugger is stopped and can ask for register values.


Beside those methods a lot of visual modeling annotations are developed to form an abstraction from the source code and to illustrate the systems.

it helps to manage the complexive structures of information systems.


In a transactional adaptation, the update command generates a second command, commit update.

in the first phase, MNs inform whether they are able to update the component s instances and, in the second phase, they conclude the update process by committing all changes.


As further detailed in Section 2, this protocol is tailored to providing reliable transmission with minimal recovery latency while minimizing feedback to the sender for greater scalability and resilience of market systems.

the coarse granularity of subscriptions and upfront redundant data transmission cause a large bandwidth overhead.


objects and the objects inside the membrane on the right are the target objects of the proxies.

our implementation logs all access paths to wrapped objects in their handlers.


A static program example presented in a textbook reveals nothing about the process of developing the program.

students get no insight into how problems can be broken down and solved.


Furthermore, in the general case, the detection of contradictory preferences is an undecidable problem.

we only focus on those well-de.ned preferences whose relations are strict partial order.


When a pub-sub system aggregates multiple variables, it only aggregate variables with the same timestamp.

if each publisher pi for i = 1 to n publishes a variable vi, a subscriber who subscribes to the P n sum of those variables will receive i=1 vi(t) at each time step t. 2.2 Con.dentiality policies Each publisher pi can de.ne con.dentiality policies to limit access to the variables that it maintains.


This enables a completely di.erent construction process (Figure 4), which makes it possible to have a compiled de.nition of the semantics of a core language and to introduce relative small extensions to it later, without neither the need to reconstruct the whole compiler, nor even requiring the sources of the core language to be available!

for example, a core language compiler and a set of optional extensions can be distributed (without sources), such that the user can link his own extended compiler together.


This approach involves the creation on the heap of representations for all the new structures that appear on the right hand side of a rule immediately on the application of the rule.

suppose that at a certain point in computation, we use the rule [[(t1 t2),ol,nl,e]] .


The difference of our page allocation algorithm to the default buddy s is we restrict the pages of every thread required into its rank group, not spreading among whole memory.

our algorithm prolongs more idleness and retains enough parallelism.


It also affects the transmission range of nodes.

the dynamics of RSSI are also concerned with the accuracy of virtual-hop localization.


Up to now, all previously published pipeline parallelization approaches are only optimizing a single-objective which limits their applicability to embedded devices.

to thebestof ourknowledge, thispaperpresents the .rst multi-objectiveawareparallelizationapproach which is able to extract pipeline parallelism from sequential embedded applications.


Cheating by collusion, by abusing the game procedure, and by exploiting machine intelligence can all be ultimately a technical design failure in the game system: they arise due to the inability to foresee all the situations of the system will be faced with during its operational life, or the refusal to consider some of them [12] for reasons such as a concern for time-to-market.


Wrap-subclause constraints are inferred for modify-subclauses containing original, while replacesubclause constraints are inferred for modify-subclauses not containing original.

a set of delta clause constraints D can be understood as a mapping from class names to delta clause constraints, and a delta modi.es-clause constraint can be understood as a mapping from method names to delta subclause constraints.


Although block statements are convenient to represent when a context in the problem domain is active during particular method calls in the implementation, they are not suitable to implement context activations that are triggered by events (such as entering a building from out of doors, or moving a cursor from a GUI component to another), which can occur at any time during the execution of a program.

in such languages, programmers have to declare an event handler for each event and write context activation code that may crosscut whole the program.


Let us informally explain how this function computes the cost associated to a residual rule: the cost structure is the same as that of the cost k, i.e., there is the same number of alt constructs and in the same position;  trivially, the number of steps is always one;  the number of case evaluations (C) coincides with the number of residual case expressions;3  the number of applications is equal to the size of the entire right-hand side of the residual rule.

for each residual rule r, we have an associated pair of costs, (k, k ' ), where k is the cost of the RLNT derivation which produced r and k ' = cost rule(k, r).


Unfortunately, concurrency bugs widely exist in multi-threaded software [20] and have caused severe damages in the real world [28, 45, 52].

effective bug-detection and testing techniques are needed to expose concurrency bugs before software release.


However, this task is easier said than done because of the VANET s speci.c characteristics, such as highly dynamic topology, short intermittent contacts, di.erent density scenarios, and large-scale, to name a few.

one concept that seems to be of great help is that of Content Delivery Network (CDN), in which strategically nodes are selected to act as servers and to help on the delivery process.


It is vital that energy resources are used e.ciently, especially when data stream sources are energy-constrained mobile devices and the amount of the users in participatory sensing systems depend on their costs.

a fundamental question is how to de.ne a suitable subset from the available data, to provide results of high quality, with small cost.


Channel (B, C), which has the largest communication overhead, is not placed across processor boundaries and hence does not incur any data communication overhead.

the total workload of 20+15+4+6 = 45 and 10+10+6+4 = 30 time units are assigned to processor 1 and processor 2 respectively.


Until 2007, testing was done only by the developers and the quality of the product suffered greatly.

the developers had to solve about ten emergency problems per week.


Subject to these constraints we minimize the cost of the overall allocation, expressed as a weighted sum over all allocations.

cjt captures the cost of assigning capacity to job j at time t. controlling the assignments of cjt allows us to: 1) prioritize jobs, and 2) make certain time periods more expensive.


A role in VBAC thus corresponds to an actor, which expresses a set of functions as a set of UML roles.

for the Role Model of the calendar application we can identify three access control roles in the use case diagram in Figure 4: Staff, Manager and Secretary.


In the Core Component model, the BCC has a lower cardinality of  as well as an upper cardinality of .

the feature LowerBound represents a grouped feature containing sub-features corresponding to the possible variants of the lower cardinality.


This group has a high average of references to verbs.

this group corresponds with traditional y identified crosscutting concerns, sothisgroupmust beiconsddereas candidtae.


The coverage matrix and the result vector are binary such that each entry (i,j) in the matrix is 1 if test case i covers statement j, and 0 if it does not; and each entry (i) in the result vector is 1 if test case i results in failure, and 0 if it is successful.

each row of the coverage matrix reveals which statements have been covered by the corresponding test case, and each column provides the coverage vector of the corresponding statement.


This allows the programmer to think of each phase in terms of the expected input-output relationship rather than worrying about the computations within each phase.

the number of statement instances to be investigated is signi.cantly reduced.


The Test Inventory provides a set containing all-possible-tests that can be elaborated to the component and a system under development.

the precision of the metric Relative Test Coverage will depend on the completeness of the test inventory.


If a virtual machine running on Platform A migrates to Platform B, then the binaries in the migrated virtual machine can be translated to the instruction set of Platform B via the dynamic binary translator in the virtualization layer on Platform B.

this design makes it possible to migrate a virtual machine to a heterogeneous platform.


In order to identify possible weaknesses and misunderstanding in the approach, and to define improvements, it is necessary to identify and analyze the difficulties found by users using the approach.

metrics related to difficulty will measure this issue: DCP: %Subjects that had difficulties to accomplish the activities of the workflow at component producer side and the difficulties distribution.


Users with high-speed connections can promptly upload content to the FHS and distribute the URLs on the Web.

the FHS content is ready for consumption sooner when compared to BitTorrent (BT).


Cached results generated from a prior evaluation of this query can only be reused in an evaluation where the values for these variables match.

the cache manager maintains a cache map from concrete queries (i.e.


Similarly each original instruction that loads a value from a memory location to a register is accompanied by an instruction that loads the corresponding taint value from shadow memory location.

monitoring requires that loads and stores present in an application be accompanied by shadow memory loads and stores.


For example, the Rename Method RFM GetPop does not change the identi.er of class List.

getPop adds two children to node List in Figure 4a but both have the same identi.er as their father node.


This situation occurs independently of the concrete approach [2][3][4] used for representing the rules.

when the current business rules change and they need to be integrated in the existing application; or new business rules are added which need to be connected at unanticipated events of Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


For example, by tagging di.erent supervision rules with the same supervision priority, it is possible to de.ne groups of rules.

through this recovery action we can decide to disable or enable entire groups of rules.


All these approaches use formats that may be suitable for their domain, but cannot be used for storing traces of general P2P systems.

our work complements these approaches for the broad area of P2P systems.


As with the problem of ordering, existing systems are designed for volatile memory only; there are plenty of mechanisms for enforcing atomicity with respect to other threads or cores, but none for enforcing atomicity with respect to power failures.

if a write to persistent memory is interrupted by a power failure, the memory could be left in an intermediate state, violating consistency.


$5.00 Tim Deegan XenSource, Cambridge tim.deegan@eu.citrix.com  core applications, I/O could also be far better scheduled by the application itself (20).

execution environments for HPC have to bypass OS algorithms, for instance by pinning threads on processors, locking memory, or using O DIRECT operations.


In the encoding above, the codes Age and IntCode are different codes,but their interpretations are equal types.

we use this idea in FC2 to de.ne roles, which support different notions of equality for the same data.


Although commercial speech recognition tools available today claim to achieve a word recognition accuracy as high as 99%, they have been developed for dictation rather than to produce a transcript 1 https://dvcs.w3.org/hg/speech-api/raw-file/tip/speechapi.html from a continuous and unbroken stream without any punctuation [2][3][18].

we refine our general research goal as: RQ1 How well does speech translation work for continuous speech in global software projects?


The second consequence is that, if the target level is in the low-leakage mode, such a transfer transitions it to the high-leakage mode, thereby increasing leakage consumption.

both these effects should be accounted for by an energy-aware memory hierarchy management scheme.


Inheritance relationships and object representations can change during execution, so the simpli.ed code requires guard instructions that ensure theobject representationisthe same.InTraceMonkey,objects representations are assigned an integer key called the object shape.

the guard is a simple equality check on the object shape.


Thereis ahighdegree of variationin the size of each subtree rooted at any given node in a UTS tree.

if each node is taken as a task in a UTS execution there is a high degree of variation in the amount of work contained within each task.


However, as there is no path from node 8 to node 5, p.x in the last occurrence of node 8 does always access the same location as q.x in node 11 when the control flow is from node 8 to node 11.

must alias  will remain alive at the entry of node 11.


Doing so, the modi.cations in the design decisions that might impact on the architecture are not tracked down.

this work explores how design decisions can be documented, and how they affect the synthesis architecture.


In an AER image sensor sensitive to motion, only pixels that see a change in light intensity will generate events [10].

aER image sensors can provide compression and reduced latency of response of a recognition system by transmitting only the relevant information and ranking it so the most interesting data will be prioritized.


Additionally, we face enhanced reliability needs.

to cope with this intricacy it is necessary to divide the design process into di.erent steps which enable a stepwise modeling from an abstract point of view on the system to a concrete one.


In accordance with the policy of strict two-phase locking, all locks are released at the end of atomic sections and not before (ch 17.1 of [29]).

autolocker guarantees that data remains consistent at all times.


However, recent studies quantifying aspects overheads in AspectC++ show that the resource cost is very low.

operating system development may benefit with the modularization of crosscutting concerns and system specialization offered by AOP.


5.2.2 Potential Program Evolution The .NET applications from Figure 1 have fewer unit tests than the Java applications.

the .NET applications have understandably fewer VDFs.


IA has a larger scope than systems engineering as it extends beyond systems engineering to include the day-to-day operation and maintenance of the system.

information assurance is not a process, methodology, or technology.


Those expressions can use the formal parameters of the event.

in the sendTo clause, we can specify instances accessible from the execution context of the join-point when the event is triggered.


For example, from Table 4, we can see that the use case Using a static map, which is implemented 8ServalCJ (and EventCJ) only supports the layer-in-class style.

the same layer may be scattered across multiple classes.


These action plans become the guideline of the process improvement.

more resource should be assigned to those actions with high priorities.


An open procedure does not make antici- patability known to the call sites.

we can consider a call graph to be acyclic.


Pessimistic abstraction ensures that the best solution for a given scheduling instance is at least as good as the best solution for any other instance that abstracts it.

in theory our algorithm guarantees that the quality of the produced schedules improves monotonically with each iteration of the re.nement loop.


In order to enable formal veri.cation, the SE model .rst has to be translated into a formal model.

a formal speci.cation is derived from UML model representing the functional layer of the system, which models the part that is relevant for expressing the recon.guration on the formal level (1).


It is also hard-to-compress and exhibits compressibility characteristics similar to most scienti.c datasets discussed in [30].

it is a good representative for a large number of scienti.c datasets under consideration.


EXAMPLE Consider the following three patterns of repetitive instructions while add , sub , mul , load , store , mov , shr , and shl are instruction names: Pattern A (occurs 3 times): add sub mul load store mov shr shl Pattern B (occurs 5 times): add sub mul Pattern C (occurs 5 times): store mov shr shl Conventionally, the saving of an abstraction of a pattern is calculated as saving = N * C (N + C + 1) (4) where N is the number of instructions in the pattern and C is the number of occurrences of the pattern.

the savings of A, B, and C are 12, 6, and 10, respectively.


However, because DML is phase-sensitive, the index language L is not the computation language, and is not computationally relevant.

there is no analogue of Property IsEqBeta for the constraint relation as the index language is never evaluated.


A dummy-read operation invoked by Ci causes an update to Version[i] at the veri.er, even though no operation is invoked by the application at Ci.

clients that repeatedly request the version of Ci from the veri.er see an increasing sequence of versions of Ci.


Different inputs to the program induce different heap con.gurations.

several heap con.gurations are possible at a single program point.


Different failing runs may be caused by different faults.

a conservative way for fault localization is to use only one failing run at a time and analyze it with the help of multiple passing runs.


In an attack tree, the main purpose is to depict the decision making process of a malicious user while undergoing an attack.

it is hard and confusing to represent the collaboration of two (or more) attackers using this type of representation.


responsibilities will be formalized as sets of atomic-actions.


Work-stealing has proven to be e.ective in reducing the complexity of parallel programming, especially for irregular and dynamic computations, and its bene.ts have been con.rmed by several studies [37, 36].

it has been widely adopted in both commercial and open-source software and libraries, including Cilk++, Intel TBB, Microsoft Task Parallel Library (TPL) in the .NET framework, and the Java Fork/Join Framework.


Moreover, there is no evidence whether or not developers know the concept of module cohesion as it is in software engineering theory.

the main goal of this paper is to provide empirical evidence about how developers perceive module cohesion and assess at what extent such perception associates with structural and conceptual cohesion measurement.


Let us start with the information in the second half of the log.

in this case we obtain: 9, 061, 128.5seconds pspn = =0.99928 9, 067, 628.5seconds in terms of availability, using only the data in the second half of the log we obtain a probability of downtime of the provider that is 1-0.98838 .


Then, it is recursively called for each instance i of ainst and a result ri is obtained.

we need two versions, one for architectures (15), and one for element instances (16).


We call ve global because it is a single, shared component of machine state, while the local ß environments are what we .nd in closures, where .used to be.

instead of accessing a variable s value with .


Moreover, one CIF frame (352×288) for HEVC intra encoding takes about 1.5 seconds and 6.94 Joules on an x86 core running at 2.66 GHz.

workload balancing and power reduction is a fundamental requisite of HEVC.


The microcell migration process is largely independent of lower-level aspects of the platform.

a conceptual overview of the migration process is provided here, without mentioning JMS.


It is important to notethatMaRTEOSprovides ananosecondgranularity for time types.

blocking-time clocks and timers in our implementation has a nanosecond granularity.


A problem of imperative approaches is that it is not possible to model all meaningful alternatives in one work.ow or imperative description of another form [4].

impera tive approaches do not allow unforeseen deviations from the control-.ow.


Homomorphic mappings between Meta-models and models An homomorphic mapping [17] preserves structural relationships between two entities of two different systems.

it enables semantic preserving mapping from the source language to the target language and to preserve the consistence of transformed meta-models.


However, as the next example reminds us,there is a penalty to pay for using compound interest: the convexity of the graph of the compound interest accumulation function implies that for time int~rals less than one interest period, the compound interest is ks.r than the simple interest.

a company charging compound interest for short time intervals "will be cha~ging less interest than if they use simple interest.


They are supposed to documentbusinessprocesses.

theyhavetotransform existing process models into documentation.


In this example, all those .elds get the value d which is constant with respect to the loop.

the summary generated in this case is the full speci.cation of the procedure s behavior.


With respect to the extended LCIM, current data interoperability approaches address integration and interoperation dimensions, i.e., technical, syntactic, semantics, and pragmatic aspects of data interoperability.

most of current data interoperability approaches provide capability to achieve before the fact interoperability.


We propose an elegant policy composition abstraction based on a transactional interface with all-or-nothing semantics: a policy update is either committed, in which case the policy is guaranteed to compose consistently over the entire network and the update is installed in its entirety, or aborted, in which case, no packet is a.ected by it.

the control application logic is relieved from the cumbersome and potentially error-prone synchronization and locking tasks, and control applications are kept lightweight.


Without SRM-buffer, the data set in the .le can .t into the last level cache.

accessing it does not incur last level cache misses after the data set is loaded into the cache during the .rst scan.


Note that in this execution the initial and .nal states are the same as before.

the sequence of operations performed by the .rst thread constitute a transaction.


For instance, considering remote assisted living applications, the environment where they are usually deployed can often change: sensors or new medical equipments can be added, removed or may fail.

these applications need to gracefully adapt to cater for: resource and context variations; specific features required in the particular application; and the operational quality (regarded to nonfunctional requirements) expected by the application.


However, the number of possible values of Si(·)is only M. If two adjacent line segments in Si(·)share the the same Si coordinate, they can be combined into one line segment.

the number of turning points of Si(·) is usually much smaller than that of Ei(·).


Adaptable Service Composition for Very-Large-Scale Internet of Things Systems Kashif Dar , Amirhosein Taherkordi , Roman Vitenberg , Romain Rouvoy and Frank Eliassen University of Oslo, Department of Informatics, N-0314 Oslo {kashifd,amirhost,romanvi,frank}@i..uio.no University of Lille, ADAM Project-team,INRIA Lille  Nord Europe romain.rouvoy@inria.fr ABSTRACT The (future) Internet of Things (IoT), with service composition point of view, raises additional challenges especially with respect to handling the scale, dynamicity and heterogeneity of the target networking environment.

the services o.ered by IoT resources can not be composed by simply extending existing Service Oriented Architecture (SOA) approaches, since it requires the integration of a huge number of real world services that demands for the user-centric and a situation-aware composition process.


Problem formulation We have observed that a client which is far (in terms of network delay) from its target server will degrade the interactivity of the whole zone.

in order to meet the interactivity requirement of the application, we must seek some client assignment mechanisms that satis.es the delay bound D, and at the same time, avoids server saturation, i.e.,: DS = D .


Both of the states in the selected column are sources of a single a-labeled transition.

there is only one way to expand C1 by label, and the result of this expansion is the residual con.guration C2.


But if T1 read value 5 from y, then opacity would be violated, because T1 would observe an inconsistent state of the system (x =0 and y =5).

letting T1 read 0 from y is the only way to prevent T1 from being forcefully aborted without violating opacity.


(The number of memory transfers for the PMA insert is O(1+(log N)/B), which is dominated by the cost of a binary search, O(log IN/Bl), as well as the optimal external-memory search cost, O(1 +logB N).)

our next round of experiments on larger data sets is to be run with the objective of speeding up inserts in the cache-oblivious B-tree.


6 i=1 i=1 i=1 6 i-ß for all i, pi = p2 .


Let us consider a .nite Plus computation evaluation context C as follows, where m represents a computation and v represents a value: C::= |Bind C (v .m) |Bind m (v .C) |Plus C m |Plus m C In most of these contexts, the computation in the hole does not affect the choice of the .rst evaluation transition.

for example, the context Plus C m is always evaluated using case 7 regardless of what is in the hole inside the context C. without loss of generality, we can let the evaluation proceed until the computation in the hole directly affects the choice of the evaluation transition.


All interviewees (also the practitioners) have connections to research and have an awareness of research publications and hence the needs of the research perspective.

they are not fully representative in their views of the general practitioner, even though they have substantial experience.


However, the e.ect of using RETRO in a speci.c traceability recovery task is not that clear, as our pilot experiment suggests.

our future work aims at moving closer to research about information access, especially to the subdomain of enterprise search, where more holistic approaches are explored.


In the absence of elasticity, frameworks balance utilization and e.ciency using the following techniques: (1) Cap the number of slots utilized by each job based on others SLOs,possibly leaving someidle slotsfallow.

some tasks arequeued even though slots areidle.


on arbitrary XML input based on context information maintained in its adaptation context data repository.

it is ideal for adding adaptation to the hypermedia presentation generation for XML-based content.


THE PROPOSED IDS FOR WEB SERVICES The most applied web service types, which is facing to business is the request/response type [28].

in this section, we concentrate only on request/response web services.


MESSAGE QUEUE Nodes communicate asynchronously and the amount of messages that can be simultaneously processed is limited.

the rest of the messages have to be queued.


Our work can be adapted to more ef.cient solutions as one reviewedin[16,2].

our work focuses on on-chip shared memory multicore systems withNoC and caches.


This placed them outside the so-called instrumentation scope of our tools: they would not have been among the quantities generalized over by the Daikon tool.

we placed these quantities the number of allies nearby, the amount of ore carried, and whether the robot was at the base in variables to make them accessible to the tools.


The formula, if applied to a geosensor network, has the intrinsic bene.t that it requires the use of only coordinates at the region boundary.

it does not require coordination among all nodes in the region; only nodes at the region boundary need to be involved.


3.3 Performance All these additional run-time checks are expensive.

we implemented a staged approach: Instead of capturing all intra-component interactions directly, we add an intermediate phase.


Thus, the policy to reject all refactorings with name binding violations is in fact too restrictive, preventing refactorings that only require a small modi.cation to be applied.

a demanded feature for refactoring tools is that they are able to restore violated name bindings by creating quali.ed names.


This has an important impact on the binary occurrence of the classes in each segment hence the corresponding occurrence vectors.

the correlation between Class1 and Class2 would be 0 in the situation represented on the left but 66% on the right.


In fact, there is one more pitfall of allowing the map implementation to discard branches at unde.ned times: One cannotrelyonaniterator s hasNext() methodtogivetheright result, since all remaining key/value pairs could conceivably bedroppedbeforethecallto next() evenif hasNext() returned true.

another contract modi.cation is necessary: we allow next () to return null if there is no further element to iterate.


Its associated scion is then marked with the maximal mark, colored in gray if the marks have different generators.

if a generator receives its mark, and the mark is white, the generator must be included in a free cycle (see Figure 2 for a basic example), since it can not be re~.hable from any local root nor other generator.


Observe that REP messages are also enqueued by the new front-end broker in order to be replayed again in case s migrates before the replay is completed.

all of the pending events will eventually be delivered to s in FIFO order, completing the migration process triggered by s. 5.


The guest state may have a structure such as an array, which is inef.cient for runtime checking.

the guest state is not stored directly in the code table.


Thus, for each element contained in the PLA for instance, software and hardware elements, and internal and external communication (i.e., interfaces) illustrated in Figure 7, an analysis is performed in order to identify which elements will vary for attending the di.erent PL members.

pL requirements and other sources (such as variabilities in the PL members) could be also used together with such elements.


However there is still much to be done in order to obtain a genuinely flawless Web Service, and current market implementations still do not provide adaptable Web Service behavior depending on the service contract.

our approach considers Aspect Oriented Programming (AOP) as a new design solution for Web Services.


Context activation scope can be nested so that multiple contexts can be activated at a time (section 2.4).

it can be said that NextEJ satis.es all the requirements of COP mentioned in [14].


When the main document is printed, the EPS is simply copied into the output .le.

any metadata in the EPS .le will also be in the output Postscript.


Templates have generic preconditions and postconditions that are concretized during instantiation.

the composite components obtained by the instantiations of a template can be extremely di.erent.


On-the-.y customization seldom requires the relocation of a running component with its execution state.

it is achieved more easily and ef.ciently by relocating only code, leveraging either the code on demand or remote evaluation paradigm.


Once the user clicks on the link and enters the Website, if the content is nicely organized with headers then it will be easier for users to scan and read through the content.

it might be important for NTB to make effective use of title, description and header tags.


A correct function implementation must guarantee that the post-condition will hold upon function exit so long as the pre- condition held upon function entry.

specification by abstraction simplifies the problem of reasoning about the effects of calling a function because only the specification, and not the implementation, must be examined.


When a peer refuses to serve a request, another peer has to serve it, or the .le has to be retrieved from the outside.

when a peer is using the over.ow approach, the load on other peers increases and/or the hit-rate goes down.


Over the past decade, the software and hardware of embedded systems have faced an increase in complexity due to the use of techniques such as multi-threading, power and memory optimization, and so on.

the size of the execution traces of applications running on these systems has also increased, and we can only expect an even bigger increase with the introduction of many-core processors in embedded systems.


For instance, each stack object o.ers push and pop operations, but the latter requires the non-empty state as a pre-condition.

when a stack s actual representation state is unknown, clients may rely on an isEmpty function, which performs a run-time test on the representation, without exposing the representation to clients.


On a cache with lines of size 64 bytes, one such table would thus take 16 cache lines to be stored.

the cache line ambiguity is given by d = 16.


Since the instrumented design patterns have supported the required changes, the subjects using the refactoring approach saved more time when collecting the codes to be modified to perform the change tasks.

the observation from our manual inspection is consistent with our experimental results regarding the shorter time spent on using the refactoring approach.


C4 in table 1 says that validatePin(accNum, pinNum) returns true if there are account and pin in the set of predefined valid accounts, where account and pin match the accNum and pinNum received as argument.

what is needed as input to test this path is a combination of valid account and matching pin.


Similar to Java, static code contained in ActionScript classes is executed when the class is .rst used.

the Jangaroo compiler wraps all static code into functions that are collected by the runtime to execute when the class is initialized.


Dave Ungar s dissertation research at Stanford was investigating how hardware could help overcome the inherent costs of supporting objects[102].Oneof ourgoalswastoshowthatop erations similar to those found in a low-level language likeCcouldbeexecutedin Emerald with comparableef.ciency.

we wanted the cost of incrementing an integer variable to be no higher in Emerald than in C. Of course, the cost of invoking a remote object would be higher thanthe costofaCprocedure call.An important principle was that of no-use, no-cost: the additional cost of a given functionality, e.g., distribution, should be imposed only on those parts of the program that used the additional functionality.


Semantic Objects are a conceptual and programmatic abstraction of spatial objects in the visual space of the IRVE that carry associated information along with their geometric and appearance information.

information layout locations for Semantic Objects can all be described as object-fixed.


Luckily, type parameters are mostly syntactic sugar for type members.

our encoding desugars them to type members[32].


This requires the ability to make modifications to the model.

eCL supports an imperative transformation procedural style with numerous operations that can alter the state of the model.


Note here that the distributed algorithm includes optimizations mentioned in Section 4.1.

the optimizations introduced in the distributed algorithm to reduce communication cost do not impact the m/mc ratio, which remains close to the ideal.


Before presenting the detailed recursive divide-and-conquer algorithm, we transform the equation 1.Assume (i, j) is the original coordinate in the original domain D = {(i, j)|0 = i = j < n}, where n = |D| is the original problem size, (i' , j' ) is the new coordinate in the transformed domain ' ' D = {(i' , j' )|0 =i' = j' < n ' }, where n = n + 1 = |D ' |is the new problem size.

the iteration domain transformation is de.ned as follows: (i ' , j ' ) = f (i, j) : i ' = i, j ' = j + 1 in the transformed domain formulation 1 is rewritten as the new formulation 2, where a(i) is the known initial value (the values on the new diagonal also can be any values).


Django support involves 37 resources, of which 14 are speci.c to Django applications.

engage allows the following (independent) con.guration choices for Django applications: OS: MacOSX (two versions) or Ubuntu Linux (two versions)  Web server: Gunicorn or Apache HTTP server  Database: SQLite or MySQL  Optional components: RabbitMQ/Celery (message queuing), Redis (key-value store), and memcached (caching)  Optional monitoring: Monit   we currently support 256 distinct deployment con.gurations on a single node.