Furthermore, if m = 0, no storage node is used in Ti and if m = 1, at least one but no more than m storage nodes are used in Ti.

en(k, 0) is the minimum energy cost of T with up to k storage nodes to deploy, assuming n is the label for the root.


So we create a unique canonical runtime object for each type in each domain declared in the program.

the object representing QuadTree in domain OWNED must also represent the child object of type QuadTree in the OWNED domain of the parent; it is therefore its own parent in this representation.


The second principle of our approach states that overloading the cross-chip interconnect with too many remotely executing processes must be avoided.

if the pressure on the remote cache is above a threshold, we do not re-map processes for remote execution.


We call these subgraphs forests.Naturally, it is desirable for there to be only a single forest that contains every node in the network.

another useful metric is the largest forest size, which is the number of nodes in the largest forest.


Reversely, SOPs of kind (iii) never affect the checker behavior in case of two-railed input words.

they cannot be detected and the checker is not ST with respect to them.


The downside of this scheme is that a knowledgeable adversary might be able to detect these checks and disable them.

to obtain a robust defense mechanism, a probabilistic mix of both schemes should be employed.


It is important to nnote that there are different configurations and profiles inside the J Java ME platform, featuring several groups of devices.

the configuration and profile to satisfy this requirement are CL LDC (Connected-Limited Device Configuration) and MIDP (M Mobile Information Device Profile), respectively.


Because the airline and the bank do not trust the customer, their workers will reject remote calls from the customer the customer s worker lacks suf.cient integrity.

this scenario requires the customer to .nd a trusted third party.


Byadaptingtobothdelay andloss, we achievelowloss rate upon convergence as compared tothe case when onlylossistakeninto account[25].

6.1.2 CrossTraf.c Between the 300th second and the 500th second, we introduce an80kpbs cross-tra.cfrom node E to node F. the available bottleneck bandwidth between E and F decreases from 480kbps to400kbps.


If the implementation does not introduce problems to the restofthecode,itisincorporatedintotheproduct.

agreement is obtained implicitlyfromaworking implementation.


The fact that the Root CA operates as the trust anchor means that it provides a point of reference to the system whenever other services are compromised and their certi.cates need to be reissued.

it is important to ensure that the Root CA is highly protected from unauthorised accesses and is running on a highly secured machine, hence it is usually operated in an o.ine mode.


Discovery is the phase that interests us in particular for our work.

we explain its principle in the following paragraphs.


ithastobe addressed at all system layers: Without appropriate operating system and application support, hardware means to reduce energy consumption might fail or even increase energy consumption.


Instead of building a new sales or-ganization, the existing infrastructure (branch offices) should be used.

the POS system should enable finance people and bank clerks to offer and sell life insur- ances to bank customers.


The former replaces the vertex V with the vertex W , while the latter introduces a new local variable named N of type T .

the overall propagation rewrite can be de.ned as follows: propagate rewrite(replace vertex(N , M ): nil):- propagate(N , X , V ), build(N , V , X , M ).


Semantically then the output node of the neural network must then represent the likelihood that a request occurs within the sliding window length after a request or particular pattern.

simply, the target value of the neural network is 1.0 when there is in fact a request to the same object within the SWL afterwards, and 0.0 otherwise.


Figure 9: BPEL code snippet of Hospital protocol message is processed by the adaptor.

the adaptor is less e.cient in terms of process complexity and the adaptation leads to more messages exchanged by the composed services at run-time.


occurs, the subsequent instance of SS is subject to a budget reduction of ..


In fact, that is precisely how I will present the rules in this paper, leaving most of the details of evidence translation to the companion technical report (Dreyer 2007a).

rMC s formalization combines the bene.ts of both de.nitional approaches.


Ballooning cannot be a complete solution, because, inherently, hypervisors cannot exclusively rely on any mechanism that requires guest cooperation, which cannot be ensured in any way.

for correctness, host-level swapping must be available to forcibly reclaim guest memory when necessary.


We have enhanced the Squid cache server by adding POST message parsing capability.

in our system, POST messages are parsed and used in conjunction with URL string and cookie to uniquely identify users requested content.


If all of them are outside extended code regions, we can guarantee that none of them again enters such a region before the version change.

we can guarantee that we can .nd a corresponding bytecode position in the new program for all methods active on the stack and can safely perform the update.


Files are selected on the basis of their extension.

for example, .java, .xml, and .jsp .les are included in the study, while .doc .les are not included since they are not executable, and .jpg and .wav .les are not included because they are not produced by a programmer.


ContextDroid.s expression-based interface, however, is tightly coupled to the environment.s host language Java, as the platform is Android.

in order to create new expressions, developers are required to instantiate the classes provided by the framework and articulate the expressions using the instantiated objects.


Although we could use Haskell s type families and other features to make a type-safe solution, its complexity would detract from the point.

to keep the types simple, we will make use of Haskell s Dynamic data type to store arbitrary state information from individual delay functions.2 Also, rather than use an auxiliary option type to represent a default state or an absence ofstate(as we didinthe settableDelay function in Section 4.2), we will build this directly into the type.


E(B[i]) = pti where B[i] denotes B at ith iteration.

the vector of probability functions for the set of points-to relationships INHeader at at the entry of the header node will be P(Headerin, INHeader) = P(B0out, OUTB0) .P(B[1]out, OUTB[1]) .


Unlike many recognition systems that detect trajectory at the end of the gesture [29, 38], Proton++ continuously tracks the trajectory as the user performs the gesture.

developers can provide continuous feedback.


It was particularly useful to know that a layer of subtraits could be introduced or eliminated without changing the semantics of any of the methods.

we could consider our refactoring task as simply grouping the existing collection behavior into coherent traits.


The MESH model predicts an optimal speci.c combination of .ve design modi.cations (Fs) which is one of the two optimal design change sets found in the detailed, low-level model (Es, Fs).

the MESH model correlates to the underlying system that it represents, giving designers the ability to manipulate the coarse-grained, heterogeneous design elements in a broad design space in order to achieve a system with optimal performance.


[25] also describe the need for client-speci.c customization.

they offer extensions that can be selectively integrated into the core system to achieve the adaptations.


Since c.next is an n-DAC object, it satis.es the non-triviality property, and so the crash of q can cause only a .nite number of operations applied to c.next to abort.

in this case, the crash of q can cause only a .nite number of operations on O (which attempt to thread their cell after c) to abort.


This discussion highlights another common feature of complex matrix operations: the non-trivial interplay of phases of high parallelism and low parallelism.

in Cholesky, the diagonal and panel tile updates have low parallelism, and the same is true in later iterations.


Knowing the data items key, the query compute the item s position.

the query is forwarded from its source to a node which is not farther away than r/2 from the data item s position.


4.1 A Non-descriptive Method Revised Attempt The programmer wants to understand the rendering system of Seaside and hence the way how HTML code is generated.

she browses several identi.ers of class categories, classes, and methods with the package viewer (A).


As scalability does not depend on large deployment units such as virtual machines, it is quite .ne-grained and thereby very agile.

it becomes possible to adapt applications in real-time to changes in load, infrastructure and objective function.


We include the normal behavior as an error mode without any deviation.

a component enriched by an error mode speci.cation can switch between erroneous behaviors as well as the correct one.


Eric s implementation of reliability on top of UDP strove to reduce the number of network messages to the absolute minimum.Weusedjusttwo Ethernetmessagesfora remote invocation: the acknowledgment message, whichwas necessary for reliability, was piggybacked on the next interaction.

a series 100 remote invocations to the same destinationwould require201 Ethernetpackets:100invoke-request packets, 100 invoke-return packets, and, after about1 second, a single acknowledgment packet the remaning 199 ACKs would be piggybacked onto the other packets.


For the representative Poisson problems used in our numerical tests, the iteration number for convergence does not increase significantly when the mixed-precision solver is employed.

single-precision arithmetic enhances memory performance and accelerates the AMG method.


C3: In either case, the next insertion below any f/f* node is going to be at level for less.

there is no leaf at level f+ 1 or above, w.h.p.


Weight-Based Question Generation Our weight-based ranking algorithm applies to any application that can enumerate the space of queries.

when applied to SU P P L E, AR NAU L D enumerates all pairs of different renderings of any single element in the interface speci.cation of an example (i.e., varying either a single widget or the layout of one portion of the interface).


A. to express that the method requires the source state A and produces the destination state A. .


The principal side effect of a Csmith-generated program is to print a value summarizing the computation performed by the program.1 This value is a checksum of the program s non-pointer global variables at the end of the program s execution.

if changing the compiler or compiler options causes the checksum emitted by a Csmith-generated program to change, a compiler bug has been found.


Bidirectional transformations -Model transformation is intrinsically dif.cult, and its nature poses a number of obstacles in providing adequate support for bidirectionality and change propagation [11].

despite a number of proposals, in general they impose relevant restrictions of the characteristics of the involved transformations (a comparison is discussed in [11]).


Moreover, since the server is continuously backlogged in[t1,t2), the last time it becameActive was earlier than t1, and all recharging times are again set to a time <t1 + Pi.

also in this case, the server will be able to contend for the execution of Qi time units within time t1 +Pi <t2 +Pi,potentiallyproducing a larger workload than in the non-backlogged case, and leading to a contradiction.


Furthermore, we can adapt our governor to processors with di.erent characteristics.

with these basic de.nitions, we are able to de.ne the event sets THi and TLo based on the known event sets TLoad and TIdle.we makeuseoftwotypesofhelperfunctions prev and next.


Transparent Replication In pervasive environments, the services provided by a component can become unavailable due to host or network failures, lack of resources (e.g., battery power), or software errors.

to provide continuous services, support for failover facilities through the replication of service providers is necessary.


3.1 Datasets We exploited data from the PROMISE repository [18], which contains several datasets for fault prediction and we chose among them the software projects with more than two releases, in order to perform the inter-release analysis.

we retained 5 datasets for a total of 18 releases: Log4j (vv.


On the other hand, online players usually do not know each other, and they are often scattered across di.erent physical locations.

the social structures preventing or discouraging cheating in the non-electronic world are no longer in place for online games.


In addition, L1 cache miss rates and data element size per cache block size can capture how long the latency of each data element is on the find operation.

they can quantify the cost of data accesses involved in find operations.


Learning how to build good solutions is the goal, not memorizing patterns Teachers need to learn both the content of the approach as well as how to present it effectively [13].

we believe that an appropriate scaffolding teacher- training is necessary in order to achieve the adoption of the pattern-based instruction approach by the CS teaching community.


However, 37 disabled operations are detected by executing the operations as they appear without altering the internal order provided by different developers.

we reduced the number of disabled operations by 70% (1 - 11/37).


Valid artifacts in turn enable execution of model operations.

the next build step inspects operations for valid input artifacts and performs precondition veri.cations.


WPS operates in following four phases: Sampling WITs of practical interest are too large to examine exhaustively.

in phase 1, WPS selectively processes only unique items in WIT to create a sampled tree (ST).


This query is not strictly necessary from a functionality perspective, since the Collection interface is already suf.cient for performing this operation (via explicit enumeration of elements).

the major purpose of including this query is to enable optimisation; in particular, the ArrayList implementation is able to provide constant time access to elements via this query.


Rather, they are fairly general ideas about how to write programs.

for any given pattern, the variety of programs that can be said, correctly, to employ that pattern is very large.


In contrast, SpecNFS is much less a.ected by network latency since it does not block on most remote operations.

it runs the PostMark benchmark 24 times faster than NFS without speculation.


new primitives go 1arJal JaL channel endpoints grams are written entirely in a standard linear .-calculus augmented with the go and yield operations and elaborate to processes at run time.

our type system isolates the classi () inti .t (e, e) JaL v values .x:t. e1ar (v, v) ::= ::= v cal multiple-conclusions judgments (captured by our typing rules for processes) so that they are not needed to type check source Jal  E; e program expressions.


The application code is simple, hence easy to fully annotate for the purpose of operator overloading.

access trapping in DMV is performed through operator overloading for both read and write accesses.


Even if GUI or other interaction technologies are supported, we are especially interested in supporting user interaction through everyday objects.

in order to facilitate the development of FIOs that implement the concrete logic required to interact with those kinds of devices.


If entity A moves to its new position as shown in Figure 2(c), AOI(A) becomes overlapping with RC1(G).

a sends its new AOI position to entity G. Then, entity G calculates its new relationship with AOI(A)  (a) (b) (c) Figure 2: An Example of Relationships between Entities and AOIs as an apart relationship described by RC2(G)=C2,(1,1) and informs entity A of the new relationship.


It keeps track of the nature and type of the subgoals; if the subgoal in the current resolvent is a variant of a former tabled call, tabled answers are used to resolve the subgoal; otherwise, program clauses are used following SLD resolution.

a tabled Prolog system can be thought of as an engine for e.ciently computing .xed points.


When the delegate is set, it runs through the cache, initializing all of the cached continuations appropriately.

a suitable mix of buffering and mutable state allows cyclic structures to be built which give the appearance of pure functional .xed points.


Given this additional information, we can demand further results until we obtain the desired coverage.

we need to be able to compute the result of encapsulated search lazily.


The remaining cases are just sanity checks.

in contrast to Mozilla, Monotone only supports unidirectional schema migration.


However, it allowed BBCS to make use of multiple windows for the same procedure.

the overall number of access of each register is diminished, which results in a signi.cant reduction of the hotspots.


THEORY AND PRACTICE OF WHOLENESS: THREE PERSPECTIVES ON EDUCATIONAL SCENARIOS Our aim is to contribute to the development of an educational taxonomy.

we argue strongly that Alexander s fifteen fundamental properties showing the vitality of centers are very helpful because they identify the character of living systems.


But other applications, such as automotive control, or information management systems will most naturally be represented using quite different style, and associated repair policies.

our framework augments the traditional notion of style with: 1.


in its lifetime, Peer pi must take the costs costs(i)= q·.i + f ·.i +w·fi +c·.i ·ri.


As BaseHTTPServer handles all the requests by using a single thread, we use ThreadingMixIn, a mixin class from the standard library that transforms BaseHTTPServer such that it spawns a new thread for each request.

it will be possible to suspend a thread to delay a request.


As a part of the future work, we intend to redesign the Quantitative View in such a way that it clearly indicates what information it provides.

the study results of the visualization indicate that such a visualization would be helpful for developers whose work is focused on exception handling.


Hence, p all the poles are in the negative half-plane of the s-domain.

the stability of the above system is ensured.


If a winning strategy is not found, we know that it does not exist, that is, that no system exists which is based on the base system and can adhere to the speci.ed LTL aspects in all environments.

lTL aspect composition and synthesis is sound and complete.


This specialization can occur either via a general-purpose partial evaluator or via program generation.

according to this view, program generation is an alternative to partial evaluation and it is entirely about code specialization.


This maintains strong isolation between the kernel instance and the page while allowing Atlantis to sandbox individual kernel instances.

unlike a Gazelle kernel subverted by domain X,asubverted Atlantis instance kernel can only tamper with data belonging to domain X.


8.1 Generality 1000 2000 5000 10000 20000 100 200 500 1000 2000 (a) Client packet count (b) Trace time (sec) As bots cannot actually watch screens, they perceive Burstiness magnitude Pacing the environment by inspecting the information conveyed by server packets.

the design naturally leads to that, whenever a bot receives a change of the game world, it will take some reactions immediately by sending back commands to the server.


The explicit PIC code has extremely simple .eld solver and almost all of the computational e.ort is handled at the particle level.

the parallelization of the grid data poses little challenges.


A model provides guidance about which artifacts to collect and which relations to establish in order to meet the traceability goals.

the cornerstone of traceability framework is a traceability model.


Most of them have, e.g., only a very limited amount of computational power, small memories, and are obtaining their energy from a small battery.

multiple objectives have to be considered at the same time during parallelization for resource-restricted systems.


Some problem reporting systems include the one or the other, or even do not distinguish between these.

the severity field may be set by the reporter and later changed by the maintenance engineer.


5.1 The Algorithm to Solve SIDVS 5.1.1 On Step Functions From Section 4 we can see that step functions play an important role in our approach.

being able to represent step functions effectively and manipulate step functions ef.ciently are crucial for the viability of our approach.


Conversely, there are techniques that are not risky (such as adding calls to sleep()), but that do not guarantee they will solve the given bug.

once we are about to use a certain healing strategy for a certain speci.c case, it is desirable to check whether the chosen strategy will be e.ective and safe (i.e.


The insertion and removal of other nodes between *prev and cur never causes the ABA problem in D5 and D8.

by preventing cur from being removed and reinserted during the current thread s execution of D3 D5 or D3 D8, SMR makes the ABA problem impossible in lines D5 and D8.


6.4 Strategy The idea used by this pattern is to simulate the join point within the test driver and, therefore, allows the advices to be tested together with the implementation of that driver.

the dependence between the PCD used by advice and the original join point is transferred to the test driver.


mFit) into a single task, mDiffFit, and they omit the final mAdd phase.


The MODIQUITOUS workshop is intended to provide a basis for discussing the adequate solution space.

it aims to bring together researchers and practitioners focused on different challenges of IUS, including: .


In our experiments, we double when the array gets too full.

before doubling, the array has density over 0.7 and after, the array has density over 0.35.


The aspects are woven into an abstract test case.

each entity in a test case is a potential join point.


The small panel charges a small capacitor(C1, whichis47µF) and keeps the voltage of C1 higher than 2.5V so as to power the Schmitt trigger, which is an extremely low power device with power consumption less than 10µW.

even with a low environmental energy supply, the smart control circuit can still work.


In our model, the DBN is unrolled for two time-steps, which is referred to as a discrete-time, two-slice, temporal Bayes net (2TBN) [33].

n1 t-1 and N1 t represent the two states for the node N1, as illustrated in Figure 2(a).


Our approachisinspiredbypriorideas on cooperative scheduling[4,7,9] and automatic mutual exclusion[29], withthedifference that we use yield entirely as a speci.cation construct.Thatis, we assume programs usetraditionalsynchronization constructs(such aslocks) and we verify that the resulting thread interference satis.es these yieldspeci.cations.

theyieldannotationsin aprogram are correctif any arbitrarilyinterleaved execution trace is cooperable, that is, equivalent to a cooperative trace in which context switches happen only at yield annotations.although theprogram can execute withpreemptiveinterleaving(andtrueconcurrency onmulticoreprocessors), yieldannotations allow us to adopt the simplifying assumption that threadsexecutecooperatively and thatthreadinterferencehappens only atyield annotations.


In contrast to our approach, it provides no means for modeling advice-speci.c behavior.

aspect weaving and respective behavioral adaptations at model level cannot be supported by this approach.


2.1 PerformanceEngineering and MobileSystems In the area of mobile devices, developers have a bigger in.uence onhardwaredetails thanin thedevelopment ofdesktop and server software systems.

the application of this approach raises the following questions: How does the processor rate change when an additional cache level is introduced?


Since dynamically generated with statements are in string arguments of dynamic code generating functions at static time, rewriting such static occurrences is the same as rewriting dynamic code generating functions, which is impossible in general.

the dynamically generated with statements are not statically rewritable.


For example, project definition deliverables must be reflected in project planning documents, which must be reflected in design, then implementation, and so on.

the order that deliverables are approved is as important for ISO compliance, as the content.


The de.nition of a service is therefore more general than the de.nition of a Web Service , but a Web Service is included in this service de.nition.

the results are applicable for Web Services as well as for other kinds of services.


Appropriate means that help them document, communicate, and abstract their ideas especially in respect to the modelling of processes (and not only of static products), are missing.

we have developed a modelling tool to support kids better in the design and implementation process.


By contrast, we are interested only in program generalization, opening it up for wider reuse, increasing decoupling.

we do not introduce new concrete classes, nor do we touch instance creation; points-to analysis is therefore (and because our target language is statically type checked; cf.


Thus, the total work for moving the blocks in S2 over 9 rounds is at least ((1 -E)n/3)L ·2En.

on average we need T((1 -E)En) data movements per node for the requests to maintain a consistent data placement.


1 machine on Top500 in 1997 to 0.01 for projected exa-.op machines [3].

more and more memory is needed for the computation itself, leaving little extra memory for other operations.


This is related to the circumstance that external users from cooperating organizations have to be granted access to local resources while preserving the autonomy of the individual federation partners.

the design and evolution of such systems calls for models that give an overview of the federation structure and reflect the technical details of the various accesses.


In Ovm/Minuteman, the object header includes the type informationword (withGCbits),a lockword,a pointer forRTSJ scopes, the forwarding pointer, and a hash word (except in handle con.gurations).

without handles, scalars have 20-byte headers, and arrays 24-byte; the hash word is initialised when the object is allocated.With handles,thehashcodeisthe handleaddresssothehash word is redundant and the headers are4 bytes smaller.


Note that the management strategy in [12] targets chip multiprocessors (CMPs), but this work focuses on micro-controllers (MCUs).

thesimulator targets one-level data cache insingle-core processors, and thus the inter-core migration strategy in [12] is not included.


The development centers involved in our study had been assessed to be operating at the CMM and People CMM (PCMM) level-5, and had won several awards for superior quality management practices.

this setting provided an ideal environment for conducting our study on development process choices.


However, we have deliberately avoided providing dedicated monitors for speci.c NF properties (however common they may be, such as performance), so that the system is general and .exible enough to support anynon-functional property the designer may be interested in (such as the aesthetic quality of a GUI component).

the designer is permittedto provide the semantics for each non-functional propertybyidentifyingabespokemonitor componentthat observesthe property sactualvalueat runtime.


It is often useful to specify that type parameters are of a speci.c kind (e.g., that a parameter is of kind Dimension).

we extend MixGen syntax so that we can specify a type parameter s kind as well as its bounding superclass: kind parameter extends bound For example, we de.ne generic classes for both units and measurements.


As a new edge (w, x) was found, the loop in Algorithm 2 will perform at least one more iteration.

in the next iteration againstTheGrain will be one break closer to Lemma 1.


Given that the most powerful web search enginehasjustdiscoveredless than1%of allthethings existing in theInternet[40], itisimpossible to tell a user whetherhis requested video can be obtained at last if we keep on trying.

we have to tell the user his video request is judged to have failed atthe right time.


On the other hand, rightinversecomputationissuitablefor applicationsinwhichonewants toinvert non-injectivefunctiontoenumerateallthecorresponding inputs, suchasintest-casegeneration[6,29].Itisworthnotingthat checkingtheinjectivityofafunctionisgenerallyundecidable.

for parameter-linear MTTsin particular,theinjectivitycheckis undecidableeven ifithasnooutput-variables[14] orithasnomultiple data traversals (we can reduce the emptiness check of the intersection of two context-free languages, which is known to be undecidable[2],totheproblem).anyleft-inverse computation method essentiallyhas a function writteninparameter-linearMTT that cannotbeinvertedbyit.


As a result, there is a natural code-coverage overlap across test inputs.

cFP-coverage overlap and bug-report duplication naturally exist among test inputs.


This kind of information is useful in predicting the structure of log messages.

it is reasonable that some NLP techniques can reveal structure of system logs in the same way as for natural language.


D. According to the idiom4 de.nition, we need to make sure that there is no other access to the same locations that A and D access in between them.

after AX is executed in this example, we enter the watch mode.


For JTidy, 5 distinct defects were identified, where 2 of them cause failures only in combination with another defect.

in our analysis of the JTidy profiles we treated each distinct combination as a defect on its own.


However, if we were to undo only the instructions within the dynamic slice to reverse execute through that slice, we would not have retrieved the value of r2 at point P1 because r2 is overwritten by the fourth instruction which is outside the slice.

while trying to obtain the values relevant to the instructions within the slice, we might have to undo instructions that are outside the slice.


Also, the complexity of current hardware has made it impossible for compilers to accurately model architectures analytically.

empirical search has become essential to achieve portable high performance.


Intrusiveness It is important to stress that the primarily role of users is to use the system to solve their tasks and not to develop and maintain it.

a major challenge for a continuous and context-aware user input model is of not being intrusive to users.


While an XML stream must be decompressed and recompressed at any router that wishes to do query matching, a router that passes all packets to every client can bypass the XML switch component entirely, and no decompression or compression need be performed.

routers can include a fast-path for clients that subscribe to the unfiltered XML stream.


In addition, among the eligible cells, some cells may not be actually used to describe any apart relationship because there is no remote entity located in these cells.

to make ApartEntityTree as space e.cient as possible, we include in ApartEntityTree only a subtree of the full cell hierarchy induced by the cells that are actually used to describe the apart relationship between the local entity s AOI and at least one remote entity.


Such work.ows supporting the same BP can potentially comprise variable activities and/or transitions between activities on the crossenterprise scale.

we capture in the BP view those features, which change the structure of work.ows, whereas the Feature view accommodates additional features for hybrid MBAs, such as work.ow constraints or native features on the application layer (AL) as well as various back-end entities for productive data on the data layer (DL).


This roughly means that if a thread holds 1 For simplicity, in the examples of this section, we assume that there is one (implicit) lock for every shared program variable, which is used to avoid data races when this shared variable is accessed.

by x we denote both the shared variable x and its implicit lock.


However, because design decisions can be needed by subsequent maintenance and evolution processes, one of the main benefits of having AK available is the chance of using it again.

convincing users to employ such AK might be based on empirical results able to demonstrate the practical utility of design rationale in the long term.


Atthepersonality level, SCA elements(e.g., wires, properties, hierarchies) can be modi.ed at run-time.

sCA applications are able to adapt themselves and to .t the context-aware and autonomic application requirements.


di.erent terms for the same thing, and terms with more than one meaning -may be overcome by using ontologies [26]: as stated above, ontologies serve to de.ne and disambiguate the meaning of a vocabulary.

using an ontology helps avoiding semantic heterogeneity.


At the end of 2001, the fastest Crusoe CPU (i.e., TM5800) at load dissipated less than 1.6 watts with a 366-MHz TM5800 and less whereas a Pentium III (and most de.nitely, a Pentium 4) processor can heat to the point of failure if it is not aggressively cooled.

as in our Bladed Beowulf (24 CPUs in a 3U), Transmetas can be packed closely together with no active cooling, thus resulting in a savings in the total cost of ownership with respect to reliability, electrical usage, cooling requirements, and space usage.


This is not a problem for static compilers, that can spend all the necessary time during the compilation phase applying the algorithms producing the best results, but has many drawbacks in Just-In-Time compilers such as ILDJIT, where the compilation takes place at runtime and competes for resources.

a di.erent approach had to be used, involving the choice of suboptimal but faster algorithms, carefully balancing compilation performances and execution performances of the produced code.


Although these speci.cations are from different vendors, yet the extracted rules are substantially analogous.

if it is possible to build a tool to extract rules from AVR microcontrollers, the tool should be able to extract rules from other line of microcontrollers with small or no modi.cations.


One of the biggest bene.ts CBSE promotes is reusability it should be possible to reuse a component across di.erent systems.

employing CBSE should: shorten time to market systems are built by connecting existing components;  facilitate management of complex systems by dividing them into smaller, less complex components;  increase the quality of the software since a component is intended for reuse in multiple systems, it is repeatedly tested in various contexts;  simplify maintenance improving existing or adding new functionality to a system is done by replacing existing or adding new components.


In case more than one pattern can be applied at a given node, we select the type rule which occurs .rst in the .type .le.

nested patterns should be given before patterns that are more general.


LiteFS Throughput dle of a .le with the help of the fseek API.

we performed both sequential and random reads and writes.


Linear virtual instructions are dispatched with native calls and returns, aligning the hardware and virtual PC.

sequential control .ow is predicted by the hardware return stack.


On the other hand, the scenario-based speci.cation miner needs more information pertaining to the caller and callee of method calls.

we employ a converter to extract caller-callee information based on the method entry and exit entries in Daikon trace.


Each DAG starts with an initial node and a final node, which are nodes that not represent services, but are used to indicate the beginning and the end of the DAG.

each complete path between the initial node and the final node represents a possible execution plans in the workflow, so that the DAG represents the workflow with all possible execution plans.


This is achieved by using stereotypes such as sensors or actuators for these speci.c roles as well as concepts to capture the dependencies between them.

it supports designing control loops as well as the interplay of multiple control loops explicitly.


If we keep separate interesting property lists, no individual retired property value can exist in the MEMO structure.

this approach tends to underestimate the number of plans.


This means that the expected output is one common ontology, which contains both vocabularies and has the whole power of expression.

the two ontologies need a common domain of discourse.


As the purpose of our models is performance prediction, we designed a suitable abstraction .lter based on the Pipes & Filters pattern to produce performance models of connectors.

we need to characterize only a small set of compositional and reusable transformations.


(new state,output) where old state, input, new state and output are .nite sets.

the above Mealy machine has transitions: (ZERO,0) -> (ZERO,ERROR) (ZERO,1) -> (ONE,OK) (ONE,0) -> (ZERO,OK) (ONE,1) -> (ONE,ERROR)  Note that both the diagrammatic and state transition characterisations are slightly misleading.


4.3 Applying Matchers in MatchBox The matchers of the core(AMC) operate on theinternal data model(schema).

theinformationprovided by theschemacanbeusedfor adeterminationof correspondences(matches).


This is caused by two factors: .rst, the amount of duplication is low (10 and 12%, respectively) and both scenarios dirty many pages and generate a lot of I/O requests.

these two scenarios also perform worst when it comes to the total migration time (see Figure 6).


We further observe from above that n(v)= a(1/p(v) - 1).

we can compute the projected value n(v)ofthe stored counter value v directly from p(v), without knowing v (in fact, it turns out that doing so is about 5 times faster than computing n(v)directlyfrom v).


We have implemented SAO and OABAS by a semantic web language called OWL-DL.

so, each of our proposed ontologieshasauniqueURI.each of themhas a namespace.


In addition, we need to .lter explanation-based comments and concentrate on speci.cation-based comments.

we consider only comment sentences with imperative words such as should , must , need , ought to , have to , remember , make sure , and be sure and their variants.


is switched to signify sequence relationship.

the syntax structure for a workflow process model is changed into the following form.


We emphasize that completion noti.cation packets are sent to each target epoch as soon as the last RMA transfer meant for the target is ful.lled.

the various target epochs linked to the same origin epoch can complete at noticeably different times.


This type of instrumentation is completely decoupled from the underlying code (source, byte, or machine code), but current AOP frameworks take a code-centric view of the weaving problem.

for the full domain of runtime monitoring to be supported, we believe that AOP needs extended to support both more detail in weaving, and to o.er new dimensions of weaving that break away from the code-centric view and support other dimensions, such as time.


(Contrary to the standard formulations of bisimulation on graphs or Kripke-structures, the successors in Flowchart programs are ordered.

the standard algorithm for computing bisimulations [13] does not apply.)


Attack trees do not differentiate between states and events (actions), and are both represented using nodes.

one node in an attack tree might refer to a state occurrence while another node might refer to an event.


Specifically, our VM model assumes the existence of eight virtual memory segments like local and argument, each being an indexed vector holding all the variable values of a certain kind.

instead of writing, say, push x , as we have done so far, we write push argument 0 .


Measurements from P2P streaming systems like CoolStreaming show that most clients observe startup delays greater than 30s [27].

is clear that the hybrid system architecture provides significantly faster startup performance.


The following table summarizes the memory allocation for these different query processing implementations.

query Style ROM RAM SNACK Queries 30,460 1731 Monolithic Query Engine 30,226 1731  using the SNACK services results in identical functionality to the monolithic style, an identical RAM allocation, and only a slightly worse ROM allocation.


Similarly, all paths that access f2 and then reads f1 will also contribute to C ycleGain(f1, f2).

this can be realized by using graph clustering algorithms that maximize the intra-cluster edge weights and minimize C ycleGain(f1, f2) = inter-cluster edge weights.


Maintaining anonymity of crowdsourcing submissions towards the crowdfunding servers is of imperative nature, as well.

any write-access to the crowdfunding servers is not only be proxied via the SANE, but also re-signed and re-encrypted, ensuring that any submitted data is traceable from the crowdfunding servers to the SANE, only.


The number of key/value pairs is fixed to two times the core number of map tasks for both of Hadoop-PSA and Hadoop-MI-MDS.

the data distribution time of Hadoop-pipeline remains around 65 seconds.


Thus, a hybrid approach where automated refactorings help with initial structural changes coupled with expert manual intervention is the most likely approach that would yield finer results.

this is not an attempt to take the human out of the loop, but instead to ease the burden on the human in the first place.


We believe this setup represents the typical workload for a database system with mixed random and sequential accesses.

all our experiments use this setup or its variants.


All secondary and tertiary models are derived completely from data in the primary model.

throughout this paper, any discussions on evolutionary aspects of software systems refer to the systems evolution as captured in the primary model: When we talk about new and deleted elements, new and deleted refers to the previous version stored in the primary model.


This means that each e-service sees only a local view of the global conversation.

mealy implementations in the composite e-service will also include conversations that whose projections to individual e-services are consistent with the local e-services.


1n(oCdand mehtpohns, -PRACE (d m r n1x aim(oCd.

pre.x-race freedom describes a weaker model than race freedom, where a vertex is only guaranteed to not to con.ict with the vertices of transaction that appear before in .


However, it may be challenging for them to implement qualityreport formatting because report formats may be hardcoded with a specific programming language.

the report designers may desire a DSML that can customize a report format through a WYSIWYG editor.


First evaluation results on this prototype show weak performance behavior that questions scalability for complex adaptations.

there is a need to think of a better method that comprises certain optimization strategies.


The set of IDE interactions is a moving target, so at any instance in time, especially when a new plugin gains traction, IDE++ will fall short of this goal.

iDE++ has been designed to make it easy for programmers to extend it to new classes of interactions.


error printing aspect Gui library procedure aspect class component applicability very high medium medium high medium low functionality very low very high low low medium very high We define reusability as the product of applicability and functionality.

a module is most reusable when both its applicability and its functionality are high.


Each team selected different tools on different occasions, to meet their immediate needs most closely.

synchronous media such as telephone, IM, remote access or webcast were used when immediate feedback or conversation was needed.


On the other hand, a re.nement system accepts good.

here, + s type exactly captures its behaviour into the logic: (+) :: x:Int -> y:Int -> {v:Int | v = x + y} we can conclude that the divisor z is a positive number.


Strategies are explicit knowledge, i.e., stated in a format usable by a general problem solving method.

they are easily changeable, which allows to adjust D&C without changing the underlying reasoners and the underlying partitioning machinery.


The purpose of the BTB is to provide early branch identification and its target address before the instruction is decoded.

traditionally, the BTB has to be always looked up during instruction fetch stage.


This .exibility supports more than simple tuning of program variables or strategy selections [9].

the platform should enable dynamic recomposition of software during execution.


However, as the number components traced increase, many patterns appear in the trace making TinyTracer s compression largely ineffective.

this result substantiates the claim that many patterns need to be stored to get effective compression and since data memory is precious, program memory needs to be used.


If dynamic profile infor- mation is too expensive to collect, then a static compilation policy heuristic might be more appropriate.

for an online profile-directed dynamic compiler to be feasible, it must be possible to collect, organize, and analyze online profile information efficiently.


Specifically, closing over p allows us to prove that permissions are preserved.

if a block of code is encoded with a set of initially full permissions, it will .nish with full permissions, allowing conversion back to isolated if necessary.


Many companies only use one source control system in house.

a thing that can be done is to create a homogeneous abstraction layer for the team provider functionality and demand that there has to be exactly one team provider available.


This aspect is also bound to a role Logger to specify that the weaving of the aspect implies the weaving of a port Linto the Controller.

in a similar way to [11], we enforceseparationofconcernsby isolatingthe aspect Logging i.e., the pieces of code to insert into the Controller from the Logger, which implements the logging logic.


This encapsulation only has value for the maintainers, since it offers a staged approach to the video manipulation that is easier to understand.

it is possible that the encapsulation was broken because the developers did not know how to implement it, and they did not want to spend resources on finding out how to do it.


7.1 Methodology It was not our goal to exactly follow the SWSC guidelines since we are not submitting our solution to this challenge; the actual competition was held a few years ago.

we did not extend the capabilities of our prototype in order to provide every aspect of the benchmark.


Then they would also be non-congested when ignoring the request for d. In this case, the probability that index i of the p-get request hits a node in some level e that is neither blocked nor congested is at least 1/3 at any time.

when de.ning the binary random variable Xt as being 1 if and only if the p-get(d) request hits a node that is neither blocked nor congested at time t (or level 0 has already been reached successfully), then Pr[Xt =1] = 1/3.


Programming languages do not have a proper mechanism to handle such variations at adequate (that is a sufficiently small) granularity level.

the impact of a small variation on a program solution is often not proportional to the size of the variation.


2.2 Structured Layer As we have noted above, the unstructured layer is able to create neighboring relations among nodes that have similar resources available.

when searching for resources, as soon as one .nds a single node with the desired resources, one can expect to easily .nd other nodes with similar characteristics in the unstructured overlay vicinity.


For example, in a producer-consumer relationship, an object is .rst private to the producer, then protected by a lock, then private to the consumer.

sharC s second key feature is a sharing cast that allows a program to change an object s sharing mode: int readonly *y; ... x = SCAST(int private *, y); SharC enforces the soundness of these casts by nulling-out the pointer being cast, and by using reference-counting to ensure that the pointer being cast is the only reference to the underlying object.


Furthermore, short fictional scenarios or user stories as derived from interviews illustrate the impact of the system on ethical values.

benyon s layered scenario based design method [1] is utilized to bridge the gap between values and requirements elicitation.


In Rule 2, a token represents an occurrence of an message of speci.ed type, and the direction of a message is speci.ed by the place containing the token incoming or outgoing.

the mapping in Rule 2 conserves the main structural features of ports/roles and related protocols, and the reverse mapping exists, which ensures the correctness of the rule.


Its purpose is to provide cloud customers with fundamental security principles that are aligned to the CSA guide s 14 domains, and documents the security controls that exist in all delivery models.

the CSA has developed the Consensus Assessments Initiatives Questionnaire (CAIQ) [7], Identify applicable sponsor/s here.


The relational structure of a RDBMS, does not closely follow the object-oriented structure of an application-level model.

where model migration does not need to cover the gap between de.ned structure and implemented structure, our work covers the mapping between object domain and relational domain: the ORM.


In(for1),variables intID and start areassignedvaluesto,andthe both variables are referenced in (if2).

it is dif.cult to extract them as different methods, they has a strong horizontal coupling.


If we just change N to NProxy in X s code, but not let NProxy extend class NParent, the casting operation will fail.

the proxy generated by DPartner will have the same program structure as the proxied class.


From the measured change of real time behavior e.ects of DoS attacks can be measured.

the results of a normal load without attacks canbe compared with the results made during attacks.


This approach has the following merits: For the class of allocation sites that create predominantly long-lived objects, the space occupied in memory by objects from this site is likely to grow monotonically over the course of the program s run.

total memory requirement, and hence the savings potential due to sharing, peaks at the end of the run.


We target our reference counting algorithm for use with big heaps.

we used a 1,200MB Java heap for the JBB server benchmark.


But even with an appropriate framework at hand, the reality of a flexible architecture and a distributed multinational development team had influence on how this framework was used.

we had to provide a domain specific API to raise the level of abstraction used by developers.


Otherwise, we can infer that there is a cache miss.

we update the cache miss counter and set the thread s bit in the shadow memory bitmap for that cache line using an OR instruction.


Giving everyone a little of what they need now may help them.

in each iteration, break up the velocity into individual budgets for each stakeholder that must be satisfied.


To compute the upper bound of the number of points in Ei,we note that after the trimming procedure, the energy components of any adjacent points differ by at least a factor of d. Let the leftmost Figure 4: The SIDVS scheme; Line 8 is only for the approxima tion algorithm point in Ei be denoted by Pl (which is upper bounded by the energy consumption when all tasks use the maximum speed) and the rightmost point in Ei be denoted by Pr ( which is lower bounded   5.1.3 Applying Function Approximation by the energy consumption when all tasks use the minimum speed).

we have The time complexity of the optimal algorithm for the SIDVS problem depends greatly on the size of functions Ei.


Design by contract is a common technique of specifying the behavior of methods and classes formally by means of method contracts and class invariants to increase the reliability of software [19].

design by contract can be used to specify programs.


The customization settings are used in the user interface profile in a 1:1-manner without transformations.

no specific patterns are needed for customization.


The tile style achieves this by leveraging the property that all NP-complete problems can be transformed into one another.

a tile system that has been proven to solve a known NP-complete problem is used as a starting point.


These smart antennas provide degrees of freedom (DOFs) that can be used to suppress co-existing communication links, thereby increasing spatial reuse in the network.

the communication problem comprises of not just determining a channel access mechanism to be used by the communication links, but also involves the determination of the communication pattern (usage of DOFs) to be used by each node during channel access.


If N >N2, then R2 is triggered instead of R. If N = N2, then the choice of which rule to trigger, R or R2, is made nondeterministically.

the smaller the priority value of a rule, the higher its priority.


ART-B and ART-RP cannot avoid nearby test cases being selected one after the other.

it was proposed to use the neighboring previously executed test cases to constrain the selection of the test cases from within the subdomains (according to D-ART resp.


provided TP API class as follows: val pobj = TP.getModel().getModelObj(latestCheckID).

our approach shields the programmer from the idiosyncrasies of platform-speci.c NFC implementations.


On the other hand, by using Hilbert Cloaking algorithm [7], the reciprocity is guaranteed because any user in k-ASR (k-Anonymizing Spatial Region) has the same blurred region.

the BdHCO-tree increases privacy protection.


Coding standards in professional literature are not necessarily framed in a way that is useful for introductory programming courses, even when we constrain the selection to strictly relevant topics.

we will establish the relevant aspects of code quality in teaching practice: 2.


Our key insight is that although most programs have races, these races tend to occur only within minor portions of an execution, and the majority of the execution is still race-free.

we can resort to a mem-schedule only for the racy portions of an execution and enforce a sync-schedule otherwise, combining both the ef.ciency of sync-schedules and the determinism of mem-schedules.


by using its eval or link procedure), this manager is inherited by all components that are directly or indirectly requested by the .rst one.

if the manager restricts access to critical system libraries, none of these components can gain access to them.


Because of the DFS traversal, each such call can only follow immediately after a sequence of calls and returns a.ecting the previous records at k -1, k -2, ..., k -h,for h =1, ..., k. But these records belong to the local block K0.

no call to the non-head node [k]of K0 requires an I/O operation, for all k =1, ..., B-1, and so P1 holds initially.


But, the functionality the implementations offer is different.

one have to supply one test suite per provider, and that is also what is done in the Eclipse project.


The weaver takes the introduction module and the target class and weaves them together.

all elements of the introduction module become members of the target class A.


The median value v has at least 2f +1 values that are lower or equal to it.

there are at most f faulty nodes, and thus there are at least f + 1 correct nodes lower or equal to v. vlow = v. For the same reason vhigh = v. the calculated median is in the range [vlow,vhigh]; in other words, v .


Programmers often create clones for experimental purposes, which they remove shortly after creation [11].

daily, weekly or monthly snapshots can be too frequent to capture stable changes in the code base.


The SNB method takes advantage of the fact that the coverage of the super block is determined by anyone of its nested blocks.

super blocks do not need to be instrumented, which is different from domiantor method.


Furthermore, Volcano has been originally created for Tmote Sky nodes while the prototype implementation of Levels assumes the Mica family of sensor nodes.

we ported the application to this hardware family.


If the constraint is unsatis.able, then the exception that is raised (Unify or Cycle) carries a decoded type, so that (once again) the decoding process is transparent.

in the implementation, we rede.ne Unify and Cycle: exception Unify of O.ty × O.ty exception Cycle of O.ty and implement solve as follows: let solve rectypes (rc, k) = begin try Lo.solve rectypes rc with Lo.Unify (v1, v2) .


Velodrome does not suffer from this limitation: if Velodrome observes a subsequence a. of the actual program trace a,then if a. is not serializable it follows that a is also not serializable.

uninstrumented libraries do not cause Velodrome to report false alarms.


gene ), while the latter indicates the entry of a function, where the ns denote a unique function number in base-3 notation.

these RNA sequences reveal the dynamic call graph within Endo s DNA.


The community grids, however, have a low preemption rate and frequent hardware and software failures.

any solution for BOT execution will have to be optimized to handle job failures.


In Figure 1, the method add_fuel has been called from the module level frame and the body of add_fuel is being executed.

there are two frames: one for the module level and another for the method call.


Usually, only the presence or absence of an attachment was logged regularly by the metrics team.

in some cases teams would resort to scripting (i.e.


However, design patterns are usually given in terms of structured, informal descriptions.

a method is needed to validate an application model based on a particular design pattern.


We extend the C language to have an array section of the following form: t array name [lower bound : upper bound]  Either the lower bound or the upper bound can be omitted in the index range of a section, in which case the lower or upper bound defaults, respectively, to the lowest or highest values taken by the index of the array.

a[:] is a section containing the whole of A.


In the fault-free case, C shrinks in every step, as long as C is not empty.

this holds because, in each step, the current graph contains an edge that connects some node of the current C to some node outside the current C. in case of random edge-faults, in each step t in which C = Ø holds, Pr(C does not shrink in step t) = p. Pr(C = Ø after c(kf - 1)steps) = Pr(There are at least c(kf - 1) - (kf - 1) steps, in which C = Ø and does not shrink) a c(kf - 1) c(k1-1)-(k1-1) = · p c(kf - 1) - (kf - 1) = (c · e · p c-1).


No service ever compresses data with web browser s. Further, we observe that the 10-MB text .le can be compressed to nearly 4.5 MB using the highest-level WinZip compression on our desktop.

for Dropbox and Ubuntu One, the compression level with PC clients seems moderate, while the compression level with mobile apps is quite low.


Technically, if an update process is scheduled to run and the versions do not match, the process suspends.

the next-in-sequence update process gets a chance to run.


Because Cell is DSM-SIMD architecture, there are no constraints of shared data bus and limited register number.

the optimizations to solve the problems of shared data bus and limited register number are not considered in their algorithms.


What makes a good trigger for it depends on the comprehension template.

we specify no trigger, which puts us at the mercy of the SMT solver s heuristics to select a trigger from the body of the quanti.er.


For example, a timer interrupt would initiate the round-robin scheduler in the kernel, which in turn would schedule application-level tasks determining the progress of each task execution.

we could reproduce the same software schedule by regenerating timer interrupts at the same moments.


On the other hand, Mallory managed to collude with the cloud provider after the attack.

while providing the logs to the investigator, the cloud provider supplied tampered log to the investigator, who had no way to verify the correctness of the logs.


For example, it is perfectly okay for a work.ow not to have the control aspect, but only to have the information and the organisation aspect; in that case, it works as a kind of ad-hoc work.ow.

our approach does not weave all the information from the di.erent aspects into a single class; rather there will be di.erent classes that contribute to the overall behaviour dynamically.


In PHP, not only do many library functions take arguments of one type and return values of another, but the runtime system itself readily performs many di.erent dynamic type casts.

subexpressions of the constraints we generate may be over other types including numeric types and arrays.


Note that instances of Foldable are already automatically derivable in the same fashion using Data.DeriveTH as instances of Traversable are, or alternatively can be obtained from Traversable instances using the kind of default de.nition seen earlier in this section.

all the remaining effort required to make b. , b.Eq, and b.Ord successfully deal with a new data type on both the input and output sides of get-functions is to provide an appropriate Zippable instance.


In general, we keep heap space only the amount we need.

the changes in heap usages enable us to share heap space among multiple tasks.


Given that, the available attacker classi.cations do inadequately suit our kind of architecture.

we propose a suitable attacker classi.cation for automotive systems, which is a combination of the above with additional objectives.


While most software DSMs are designed to back user applications [16, 30], the K2 DSM backs OS services.

we carefully construct fault handlers and coherence communication to avoid interference or lockup with other OS components.


Even if applications are willing to pay for maximum consistency and minimal latency, current operating conditions may prevent the storage system from providing ideal service.

applications also want to express less favorable but acceptable latency-consistency combinations in their SLAs.


Thus, it becomes an imperative that we behave as both independent specialists and as teams with a singleness of purpose.

team learning is the ability of each team member to envision an alignment between individual ability and the team s vision to produce greater results than can otherwise be delivered.


From SADF models t o analy s is T -transitions.

as a result either a state has only outgoing T -transitions or outgoing Markovian transitions.


So there is no straightforward relationship between the quantity and the quality of a change.

any method using either quantity or quality of changes can bene.t from using the other variable as well.


Now, a software tool provides the expert with information about concepts or properties that exist in ontology repositories, which could be re-used because the label of such ontological entities matches a particular lexical pattern of our ontology.

the current method makes re-utilization easier.


It performs a memory test during initialization to exclude corrupt memory locations.

the bu.er is .lled with random data and afterwards it tests whether the correct data can be read from it or not.


Invalidations, updates or collected update acknowledgements lost at the crashed redirector could prevent the garbage collection of pending invalidations at the servers or the vcache in the clients.

servers detecting a redirector crash retransmit unacknowledged invalidations and commit replies.


they permit to reuse existing query specifications in different application areas and permit to refine them in order to cope with new requirements or incremental software evolution.


BeaconPrioritizationFurthermore, our analysisinSection5.3 showsthat closerbeaconshavegreaterin.uence on localization accuracy, especially when the information is incomplete.

when deploying a robust location system, one should bear in mind that the density of beacon nodes wouldhavegreatimpact onlocation estimation.


Because systems of Testbed A are 2 processors per node with single-core only, the percentage of IVC communication is small compared to inter-node communication through the network.

iVC and No-IVC con.gurations achieve almost the same performance here and the No-IVC con.guration is omitted for conciseness.


WE B LO G also checks those constraints on the server when data is submitted.

the developer only writes a single validation code base, and WE BLOG duplicates that validation code wherever it is needed.


Then, it is possible to reach the state ( p2, p ' 2, x = 1, y = 0) since it is possible to update the variable x before the variable y.

loosing the operation w(y, 1) does not lead in this case to an unsound state.


an edge represents the characteristics of the step between actions such as actions performed non-interleaving (atomic), sequential, parallel or external choice (alternative), which may further be executed after a .xed amount of time delay.


First, a transaction which composes web services is usually long-running it takes a substantial amount of time to complete, because of asynchronous interactions across many systems, possibly requiring human intervention.

the holding of locks and tight coordination of the participating systems is not feasible.


The important point is that eventually we will substitute d1 by a ground value.

the translation function [["]]con will not get stuck and will work correctly.


This theory naturally arises when the abstract generals denoted by the variables are terms themselves.

let C = S ;we havethat Z « pAtM * (A M)t .


This might be due to a constraint in the feature model or by them being alternative features.

we discard data.ows containing both features.


On the other hand, our algorithm is based on a dynamic-priority policy.

our algorithm outperforms prior works by considering runtime situations better as will be shown later.


Following the derivation by restriction mechanism, ABIEs are based on ACCs, BBIEs correspond to BCC, and ASBIEs are based on ASCCs.

aBIEs are comprised of di.erent BBIEs whereas ABIEs and BBIEs represent restrictions of the underlying ACCs and BCCs.


IN T RO D U C T I O N The steady desire for new applications, augmented reality, and higher display resolutions drives the development of embedded platforms and the need for faster, more powerful processors at the same time.

today s mobile platforms found in smartphones and tablets host multi-core Central Processing Units (CPUs) and even programmable embedded Graphics Processing Units (GPUs) to deliver the demanded performance.


For testing a cluster, based on the consideration that the time cost to test all classes in a cycle increases as the size of the cycle increases, we as-  sume that the cost is a linear function of the size8.

given a class dependence graph, by condensing each strongly connected component into a single node, the time cost for testing each class and cluster can be shown in a DAG with weighted nodes.


5.2 1st step: Pruning users by single decoding The algorithm starts using an accusation scheme which is a modi.cation of the single decoder in [13].

from now on we only consider the .ngerprints whose accusation sums exceeded the threshold of equation (1).


The shu.ing, which is executed in alternation with the MI computation, turned out to be very time-consuming as well.

we used a highly GPU suitable algorithm: the butter.y network [16, Sec.


From Corollary 2, under conditions (1) and (2), EUA can meet all task termination times; i.e., all the allocated cycles can be completed before their termination times.

for task Ti, EUA can meet at least .i termination times and accrue at least .i utility.


The attacker may use several techniques to access the ongoing transaction, such as, man-on-the-middle attack, eavesdropping, manipulation and more.

a system where UI migration is supported has to deal with the common security threats related to internetworking.


Furthermore, a substitution network is not deployed directly for customers but it is used to help the existing .xed network to provide services to customers.

a substitution network is not, by de.nition, a stand-alone network.


decreases, the completion time increases and the waste decreases.

reasonable values for the utilization parameter d might lie between 80%and 95%, and the responsiveness parameter .


This function .rstly performs the usual operations of allocating memory in GPU and uploading data from the CPU to the GPU kernel.

it is supposed that arrays A, x and y have been previously uploaded into the card s global memory.


LCM is an interesting challenge for validation because it is a global optimization that moves code across loops.

care must be taken not to move computations that may fail before loops that may not terminate.


Since SSDs use the out-of-place write approach (see §1), a write to a logical page may re.ect on any physical page.

sSDs implement address mapping to map a logical page to a physical page.


during Tsleep , the clock cycle of the reference clock is not counted between two calibrations.

the measurement of the reference clock at the j-th calibrations, T j can ref not be directly measured.


Since Paths contribute to improve the effort estimation, it is reasonable to guess that they take into account the amount of data manipulation.

in COSMIC context, Paths could be seen as the ideal complement of the measure of data movements to provide a complete measure of functional processes.


Using sensitivity class lists it is easy to see that the directory inode has three authorizations (exec, write, unlink dir) and the inode being removed has one (unlink .le) because they are object-sensitive and placed in different classes.

for the .le system and the task operations we have examined, authorization graphs and sensitivity class lists have been suf.cient to verify authorizations.


It is visible in every created artifact, such as an IT application, a building, or a costume in a film.

patterns could be identified from the existing solutions rather than in human memory.


The analysis can be modeled as an iterative computation in which each iteration starts with a partial points-to graph and then adds new edges according to the semantics of program statements.

for the assignment p = q , new edges are added from p to all current successors of q; for the statement p = *q , new edges are added from p to the successors of all successors of q;and so on for other statements.


An LP solver solving the original LP formulation (Section 3.2) without the additional constraints could still discover a feasible solution.

we fall back on LP whenever our above approach leads to underflow.


Some of the respondent even criticized them by saying fickle minded, when it comes to the software quality, certification, process improvement issues and so.

adoption of SPI program is slow in the local software organizations of Bangladesh.


Although a sequence of pivots already de.nes a .xed route, it is insu.cient for use in aircraft navigation, since it does not account for its maneuverability.

the .nal representation of the route the tra jectory is built by reshaping the sequence of straight lines in such a way that it can be directly used for the guidance of an airplane.


These disconnections during recon.guration may impact the consistency of the recon.guration actions, the source variant, and/or the target variant.

the re.ective application must be able to correct recon.guration actions, or in the worse case, recover from failed recon.guration.


The .rst architectural decision to be taken when building a multilayer application is to determine the layers of which it will be composed.

the .rst criterion used in analysing the development frameworks was to determine the layer or layers in which they are used.


In order to show that a program contains a detector component, we are required to show that the corresponding timed guarded commands satisfy the Progress condition of De.nition 5.1.

we assume that programs need to satisfy the following fairness condition.


Defining all possible solutions and draw the trade-off regions in a dependability multidimensional design-space in many cases will be useless or impossible.

providing translucent methodologies, application design will be a trade-off itself.


This turns outtobea problem, mostly becausethe abstractionofthekernelisoftentooaggressive,and manyre.nements are needed to re-introduce abstracted details.

we propose an improved approach, thatexploits the intrinsic structure of SystemC.


FRAMEWORK OVERVIEW Commonly, scenarios are described by using natural languages.

due to the ambiguity of such languages, misinterpretation can happen and the assertions and stimuli de.ned by the veri.cation engineers may di.er from the intended ones.


For a task with a downward step TUF, (a) ReUA (b) LaEDF Figure 4: AUR and DMR vs. Load of G1 under E1 As Figure 4(a) shows, with ReUA during under-loads, all tasks accrue 100% AUR and DMR, except task T1, whose AUR and DMR is 99.23% at Load = 0.3.

reUA delivers the statistical performance assurance of being able to accrue 100% of task maximum utility with a probability at least 96% for all tasks.


Inaddition, the API provides a dump(onst har *) method that can label the reported section.

cilkview can generatereportsformultiplesectionsofcodeinanapplicationbyreusingthesame ilkviewobject.


BPEL does not have a built-in mechanism to model these three requirements.

complex while loops, flows and sequences had to be used more than 15 nested layers of sequences, flows and while loops were required.


It would require a great deal of work if their enthusiasm were lost in the beginning.

we have tried to put every important aspect into the first lecture.


The presented analysis of composition rules/operators is only the first stepping stone for a more in-depth analysis that seeks to discover identical or near-identical composition rules/operators across two or more modeling approaches.

groups of commonly used and model type-specific composition rules/operators could be established.


There will be no user to prompt for information or to dismiss a message box.

message boxes informing about errors or general events, dialog boxes asking for user input or any other form of interaction with the user must be eliminated from the portion of the code that will be executed in the grid.


y * where x * is the principal eigenvector of AT A and y * is the principal eigenvector of AAT [10].

the HITS algorithm converges and could, in fact, be implemented using any standard eigenvector .nding method.


The more it has the small update size, it has more copy overhead.

we propose a last block logging mechanism for reducing data copying overhead.


Finally, to ensure that all data accesses are non-negative, we add m to the new index, such that the final transformation is from A[i][j] to A[2 * i -j +m].

we have reduced storage requirements from n * m to 2 n + m. The modified code corresponding to this mapping is shown in Figure 6.


Even the relevant metrics are typically not needed for all entities in the system.

instead of computing all metrics for all entities at once, our infrastructure allows for lazy computation of the metrics.


But EIOP was not especially developed for Real-Time CORBA.

eIOP currently offers not translation between the priority handling of CAN and Real-Time CORBA.


Since requirements typically change during the software lifecycle, the artifacts need to be adapted to stay consistent to the current requirements.

a major challenge of QA is continually representing the stakeholders value propositions and checking their consistency with artifacts of the software development process [9].


These might involve multimedia or even functional application prototypes, as can be the case for user centered design[10].

given pieces of software cannot uni versally satisfy every inquisitive requirement on the part of researchers.


Note that, with such an assignment, the contents of a TR are updated only for the initial loads.

the total cost of such an assignment is s. A TR is said to have completed its chain when it reaches the end node of the chain.


Under these conditions, the erroneous output must have been produced by a fault in form of a computational error in one of statements whose computed value is related to the output value through a chain of dynamic data dependences.

the faulty statement will be present in the data slice in this situation.


It is very important that the programs run fast in order to achieve a huge number of frames per second.

the GPUs have dedicated .oating point processing pipelines in these processors and GPGPU applications make strong use of these processors.


Moreover, since the client reads and writes sensitive data, it needs to hide both the data content and access pattern.

the client needs low-latency, private access to this remote disk.


The key difference between Frenetic and all of these systems is that they are limited to a single device.

they do not address the issue of how to program a collection of interconnected switches.


, q. sin(.j t) cos(.j t)  4.3 Network Robustness Network robustness formalizes the notion of suf.cient redundancy of directed edges between subsets of nodes in the network.

this property is useful for the study of resilient distributed algorithms that use only local information.


Atomic increment and decrement are used to modify data tile ref-counts, and a compare-and-swap to update data tile buffer pointers.

the whole implementation is thread-safe and lock-free.


To find out the time cost of methods by measuring time according to events of each unit test helps to improve performance of program by eliminating unnecessary codes or objects generation to find methods called intensively, and to find the bottleneck.

we have developed the tool that supports the automation of unit test creation and performance with a research on the method to test the performance of mobile applications in the unit test environment.


Thirdly, we observe that the interest (number of queries) in travel time decreases at a slower rate with distance for highways than that for other types of road segments (e.g., road segments inside a residential complex).

one can cut down on bandwidth requirement by varying the geographic scope in which travel time information for a road segment is disseminated according to its interest gradient.


This is because all intervals have the same amount of bandwidth available for every request.

every feasible schedule will have the same total time taken to transfer data for all reservation requests.


Therefore, the protocol itself can only increase the time di.erence between agreements.

the minimal di.erence is achieved when a decision takes place right after the termination of the Initiator-Accept primitive.


We used the upper bound of the 95% confidence interval of the time lag, which was 12.0 months (mean was 9.2 months).

for a given failureper-hour measurement, we examine what happened in the team in the prior 4-12 months.


Finally the test case t4 will get selected to cover the requirement r6 .

the minimized suite generated by this heuristic consists of 4 test cases t1 , t2 , t3 and t4 .


We observe, based on this reduction, that our problem is the Knapsack problem with the added restriction that for any item to be selected, its ancestors in a provided tree must be selected as well.

we use an ef.cient approximation of Knapsack, discussed in the context of inlining in Arnold, et al.


the term ..| .... .1. identifies the scheduled start time of The CP constrains are expressed differently than the MILP task t, which is at time i. constraints, but perform the same role as the constraints for the Constraint (3a) ensures that the reduce tasks are scheduled to MILP model.


For Web IM components, we are also able to reach a finer level of adaptation, exploiting the management capabilities built into the BEA Weblogic application server via Java Management eXtensions (JMX -see http://java.sun.com/products/JavaManagement), which we have integrated within the probing and effectors layers of our platform.

workfiakes can decide to intervene also in response to variations in the size of the queue of pending requests, and manipulate the details of the threading model of the Web IM application.


We assume the program creates two list objects x and y and two iterator objects a and b.

there are four possible ways in which these objects could be bound to the parameters, which correspond to the four automaton versions shown as columns in Figure 3.


A better approach is to implement the integration software for each vehicle type or model as a component (i.e., plug-in).

one can independently add the specific software component for new sensors and actuators of new vehicle models as needed, and even do this dynamically during the application´s execution.


JakartaFtpMonitor de.nes fileTransfer, but also uses the monitorBegin / monitorEnd mechanism of AbstractMonitor.

jakartaFtpMonitor makes an assumption that Abstract-FtpMonitor uses monitorPoint to implement fileTransfer.


[18] In the first step, before defining the transformation models, we identified the source and the target metamodels.

on the left side of Figure 1, the OWL TS box contains OWL DL source model corresponding to the OMG Ontology Definition Metamodel (ODM) specification.


Parameter Value page size 4KB # of pages per block 64 # of blocks per package 16384 # of packages per SSD 8 SSD capacity 32 GB read one page 0.025ms write one page 0.2ms erase one block 1.5ms transfer one byte 0.000025ms over-provisioning 15% threshold of triggering GC 5% and write back the smallest number of pages.

the cleaning cost of the greedy algorithm should be the smallest among all algorithms.


The effort and costs required to adapt the softwarefor new core upgrades will increase.

non-invasiveness is crucial and the software shouldbeabletointegrateanextension without any modi.cations to the core.


The checkpoint .les are written to the local disk and transferred to shared storage in the background by a dedicated thread.

we did not include the time for transferring checkpoint .les in the checkpoint overhead.


The reason is that each encoded block is unique and useful to any node.

newly arriving nodes can easily obtain useful blocks that in turn they can exchange with other nodes, and nodes at the end of the download do not need to wait long periods before .nding their missing blocks.


When Pmin is 0, our streaming strategy exhibits the same performance as the strategy of streaming both layers.

tuning Pmin adjusts the streaming performance for di.erent scenarios.


The QoS broker collects information from QoS enabled Grid Information Service like resource attributes, current status, resource availability, usage models, capabilities and pricing information from the respective resources and use this information source in the QoS oriented scheduling process.

broker coordinate with local schedulers to compute an overall schedule fulfilling user QoS constraints and take care of overall load balancing of the system.


predicted to rise from 7% of the global power consumption to more than 14.5% in 2020 [14].

optimizing the energy consumption of ICT, or Green IT, is an economical necessity and a technological challenge.


large, and linked data endpoints may also be added to existing applications with little efforts [4].

the approach presented in this paper is a valid approach for building integrated information systems with valuable support for information workers.


However, when a client starts playing S1 m as soon as the client receives S m 1 (m =1, ··· ,M ), the client cannot always satisfy the continuity condition.

the client has to wait without playing the data after the client receives S m 1 to satisfy the continuity condition.


These results reveal the best compiler policy on single-core machines with multiple compiler threads.

we can see that the more aggressive thresholds perform quite poorly in relation to our selected baseline (with any number of compiler threads).


However, d1(S) of new live data is copied into the survivor space from Eden.

the amount of data in survivor spaces after the major GC would increase as follows with each minor GC: d1(S),d1(S)+ d2(S),d1(S)+ d2(S)+ d3(S), and so on, until it reaches N gN (S)= dn(S), (7) n=1 where N is the tenuring threshold.


Table 4 demonstrates that the condition numbers of all 10 worst-conditioned 3×3 sub-matrices of the numerically best code are much smaller than that of the other two codes.

in the worst case scenarios, the numerically best code is numerically much more stable than both the Gaussian random code and the Grassmannian code.


Note that the total charge accumulated on the sensing regions of all the sensors in OP T is equal to number of sensors in the solution returned by the algorithm.

the total weight of the solution M returned by the algorithm is at most r(1 + log d)|OP T|.


The Voronoi diagram V (S) is disconnected if all point sites are collinear; in this be created within the perimeter and the all the nearest neighbors case it consists of parallel lines [23].From Figure 5, the Euclidean of each node within.

this will be denoted as follows: distances between one node to another is represented by the red  n 1 line, when we refer to node A and B, the distance d between Let the set :.


In addition, in order to avoid misunderstandings, we discussed the questions with several colleagues.

we consider this threat to have been minimized.


Secondly, as analyzed in 4.3, the achieved embedding e.ciency is not satisfactory.

steganalytic results in 4.4.3 demonstrated that the security level is a.ected to a certain degree.


On the other hand, in the declaration of Graph, Node is instantiated by assigning Graph to the type parameter.

the following subtyping relation must be satis.ed: Graph #E,Graph#N> Actually, Graph#E is the same type as E, thus the above subtype relation is satis.ed in SJ.


The time required to build this large sequence of J-Expressions, together with the time required to marshall it onto the network connection as a byte stream, can cause a noticeable delay in starting an application, even if the other buffering techniques axe used.

it makes some practical sense to devise a way to store this 'compiled" byte stream, so that, in a production setting, it can simply be transmitted to the Java Engine.


The traceability of an event through a dynamic multipath event network can be difficult.

event-driven architectures are best used for asynchronous flows of work and information [6].


In some embedded processors such as ARM10E, Analog Devices ADSP TS201S, Motorola M-core MMC221, Renesas SH-X3 and TI TMS370CX7X, SPM is used as an alternative to hardware cache.

an approach for effective SPM utilization is essential for the ef.cacy of SPM based memory subsystems.


With pushing mechanism, the data was prefetched in the local buffer of the client, and the need of exchanging invocation request and response messages was greatly reduced.

no matter which size of the read block was, the total overhead was nearly the same and minimal.


At the same time, we argue that the e.ort exerted in implementing the TDD practice in the developers work.ow does not yield a viable return on the investment, at least in the short term.

we intend to replicate this study in two respects: we aim to investigate more deeply the impact of TDD as a whole, and not only as a practice that reinforces the writing of tests before implementing a feature, while leaving out the prescribed refactoring phase.


C (m, r)= g mhr.Since g and h are both gener mhrators of the group, for any m, g is a random group element when r is chosen at random.


Their objects are reallocated into suitable objects of class Sub.

the recon.guration is enabled when there is no running method invoked on an object instance of class ExpScanner, Add or Neg.


Prior Research Pan and Spafford [9] developed a set of heuristics that identify a set of suspicious statements in a program, but provides no ranking of the suspiciousness of the statements in the set.

the user has no information about where to begin the debugging process within the set of statements.


Similarly, the optimized composed invariant rule for computing total does not introduce maps maintaining the union and peer selection.

the optimizations eliminate four maps, each of size O(S + R).


But writing large straight line code is time consuming.

the code generator approach to building the codelets is an efficient way to address the prob- lem.


That is, the pixels in a satellite image are often grouped together according to some similarity metric during analysis, and classi.cation is often based on the results of this cluster analysis [19, 20].

this workwas motivated by the concern that image watermarking may a.ect GIS classi.cation methods that serve as the basis for analysis and decision making.


An intermediate trace is then executed to validate that it is feasible and exhibits the bug.

the Tinertia algorithm applies a purely experimental approach in the spirit of Delta Debugging [4] to the problem of trace simpli.cation.


Therefore it took too much time to be able to construct local defect prediction model.

our next plan would definitely be initiating an automated bug tracing/ matching mechanism with the company.


WSCCT ARCHITECTURE Initially, it should be noted that we are interested in this work to perform unit testing of Web service compositions.

the composition is isolated from its partners to be tested as a separate unit.


The computed summary of getResource consists of the following edges: (LO,0,0,(0,0)) (L8,2,0,(0,0)) > (LO,0,0,(0,1)) (L5,1,0,(0,0)) > (LO,0,0,(1,0)) (L5,0,0,(0,0)) > (LO,0,0,(1,1)) (L5,0,0,(0,1)) > All edges in this summary begin at the label L0 and terminate at one of the two labels L8 or L5 both of which are labels at which getResource returns.

the summary matches the intuition that the procedure body is just one transaction.


By virtue of residing in the data region of the process address space, only a single copy of each global and static variable is shared among all threads in a multi-threaded process.

depending on their purpose and use, each static or global variable in a multi-threaded program needs to be assigned separate threadlocal storage, or its use needs to be guarded (typically by using semaphores or mutexes) to enforce synchronized and atomic access by each thread.


However, depending on the number of allocations considered and the size of the job, these simulations could takealongtime and addasignificant delayto thecontrol loop.

we develop a method that only uses the simulator offline, precomputing all information necessary to accurately and quickly allocate resources.


This is mainly because this benchmark has long transactions with a large number of loads.

the traditional STM performs poorly due to the high overhead of transactional loads and it can hardly achieve speedup over sequential even with 8 cores.


In practice, traces tend to be huge; [23] reports experiences in dynamic slicing programs like gcc and perl where the execution trace runs into several hundred million instructions.

it is necessary to develop a compact representation for execution traces which capture both control .ow and memory reference information.


Benchmarking Decentralized Monitoring Mechanisms in Peer-to-Peer Systems Dominik Stingl, Christian Gross, Sebastian Kaune, Ralf Steinmetz Multimedia Communications Lab TU Darmstadt Darmstadt, Germany {stingl,chrgross,kaune, steinmetz}@kom.tu-darmstadt.de ABSTRACT Decentralized monitoring mechanisms enable obtaining a global view on di.erent attributes and the state of Peer-to-Peer systems.

such mechanisms are essential for managing and optimizing Peer-to-Peer systems.


However, despite MOON s scalable I/O scheduling design, the limited I/O bandwidth on the dedicated nodes could cause an extra delay in the task execution.

the dedicated resources should be provisioned such that a good balance is achieved between the saving of Map task re-execution and the extra write delay on dedicated nodes.


If all integer variables are initialized to some default integer value, say 0, then all satisfying assignments of the SPof a trace will be integral even if the SPis interpreted over the rationals.

if the trace is infeasible, our proof system can derive the unsatis.ability of the strongest postcondition.


0..(n - 1), either Si .a Si+1 or the pc at Si+1 is one of the allowed successors for the pc at Si according to the given CFG.

despite attack steps, the program counter always follows the CFG.


The setup involves placing the NetPerf sender Dynamic Ballooning Effects on Completion Time inside the guest VM and the receiver on an external node on the Kernel Compile, 439 secs same switch.

regardless of VM size, post-copy ac-50 tually does perform slightly better and reduce the degradation time experienced by NetPerf.


Whilethetask-levelparallelization approach canbe applied to each hierarchical node of the graph, the pipeline parallelization approach is limited to loops.

as soon as a node representing a loop is reached in the parallelization process, the correspondingprogramdependencegraphis extracted and the genetic pipeline parallelization approach is executed.


It doesn t need to write the packet to the kernel and using the user mode libraries to communicate directly.

we are now working on this and trying to port the kernel module to user mode.


At the same time these classes are composed of domain objects that normally represent business entities.

it is wrong to associate a DAO only with the persistency layer, since they also belong to a distinct business domain in the application itself.


Since we re.ect aspects as services, the reasoning process uses the planning heuristics provided by the planningbased adaptation middleware in order to score the alternative aspect and service realizations.

the integration of aspects and the associated dependability mechanisms within the reasoning process can be achieved implicitly or explicitly.


Customers treat WebArrow like a telephone, and demand similarly high availability of service.

a critical part of WebArrow s infrastructure is its support for detection and recovery from failure in computer hardware, software and network infrastructure.


Here are the di.erences between the two: First o., .xture sets are sets of .xtures: 1 1A.xtureset := P (A.xture ) Cue abstraction extracts the .rst component from a cue: .

a0 (F, p):= F The complement has the set-theoretical interpretation: 1 F := A.xture  F subtracting the complement of c, c, works like applying a stencil.


However, transaction is managed by the AP server.

which case should be used depends on the Web application especially the balance of computation and communication of the application.


also indicate that mean response time is by far the most commonly used QoS measure in the computer systems literature [13].

a gap exists between theory and practice, as the upper tail of the response time distribution is of greater interest to operators [15].


The number of times it is hit during analysis is irrelevant.

we only allow each point in the CFG to make exactly one contribution to a lock count.


Overall, the Specula PSE tool is a prototype.

there is a lot of improvement potential with respect to the general ease of use of the tool.


Recall that the smallest rectangle embedding our given polygon P call it R is of dimensions xmax ×ymax, where ymax and xmax denote the maximum vertex coordinates in y and x respectively, and ymin and xmin denote the minimum vertex coordinates in y and x respectively.

we can accept crudely that an arbitrary point (a,b) propagate to the next iteration if it belongs to R, or that a =xmax and b =ymax.


Both HDFS write and sort involve transmitting a signi.cant amount of data over the network.

the additional work of compression balances out the bene.t of transmitting less data.


For example, one code fragment from the non-recursive merge sort in our benchmark looks like the following: for(s=0; s < ArrayLength-b; s+=2*b) { ... } Since the variable b is identi.ed as an input variable, random values will be fed into b.If 0 is used, the increment statement in the for loop will never change the value of s and cause an in.nite loop.

we imposed a limit on how long each execution of a code fragment can take.


The challenges may come in di.erent .avors, and at di.erent points in time, but there is de.nitely a potential to learn across industry domains.

we characterize the research with respect to the industry branch(es) in which it is conducted.


The main reason for this is that many embedded applications execute in environments that are shared by several other concurrently-executing applications.

these applications share a lot of resources and resource availability to a particular application depends strongly on memory demands/occupancies of other applications as well as the global (e.g., OS-directed) memory management policy employed.


(5) h.H We already know the request arrival rate for each data center .n = NC xn.

from queuing theory results [13], the average time that a request stayed in the system can be given as 11 Dn == t (6) µn - .nh.H µhxnyh - NC xn Equation 6 suggests that an increase in the request rate will result in an increase in the time spent by each request in the system, which is intuitively correct.


As a result, neither node changes its velocity before the link between them breaks.


We did not further differentiate API behaviors based upon constant values.

we cannot distinguish the behaviors of Runtime.exec() calls or network I/O APIs with varied string inputs.


This implies the impossibility of the edge routing in case where covering relation is used to optimize the dissemination of subscriptions, which has also been implicitly shown in [14].

we propose to use a dual routing strategy: (1) edge routing can be used when covering relation is not optimizing the subscription propagation, and (2) fast content-based matching is performed when the subscription tra.c is limited by the covering relation.


These automata are obtained from the rewrite rules, but the rules themselves do not play any explicit role.

whether to include or omit contexts in the rules becomes insigni.cant.