The analysis proves that multiplying the median by 2.1 is suf.cient to ensure a collision probability of 95%, regardless of n. Note that when B is itself a sybil node or the random route from either A or B enters the sybil region, the adversary controls that particular sample.

using the median sample to estimate w is much more robust than directly using the 95th percentile.


From a constructive perspective, design is a mapping from functionality to structure under a set of constraints [8, 9].

design can be formulated as a search problem, in which the designer navigates the space of possible components and their configurations [4, 10].


Furthermore, we introduce a syntax sugar for writing the Each (co-)capability action is translated to a tuple constandard if construct: taining the constant value indicating its type in its .rst eldef ement; for example, open M is translated to (open, [ M] ).

if M = N then P else Q = let x = eq(M, N) in P else Q M.P is executed by .rst checking [ M]] s type at runtime.


If the program misuses the liketyped value, a runtime error results.

a like-typed program delays errors until the program would produce nonsensical results.


3.5 More Improvements Someimprovementswereaddedtothebasicalgorithmtoenhanceitsperformance.Welisttheseimprovementshere.

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


The CDA serves several purposes: First, it acts as the online certi.cate distribution frontend to the o.ine Root CA.

one can achieve a separation of concerns between the management of the Root CA s security and its online certi.cate distribution functionality.


if the heart could be monitored constantly in daily life, the unexpected heart diseases would be more easily predicted not only for patients with heart pathologies but also for healthy people who exercise daily.


Each element of an unbalanced projection matrix is generated by a symmetric Bernoulli distribution of ±1.

a balanced projection matrix also consists of ±1 at equal probability but in addition we require that each row must contain equal number of 1 s and -1 s. the sum of the elements in each row of a balanced matrix is always zero.


3.2 Support for data-dependencies Our checking system is path-sensitive, and will suppress many common infeasible paths [4].1 However, in general pruning all false paths and resolving all data dependencies are undecidable problems.

we allow programmers to provide help when calculation fails using a built-in predicate to express data dependencies: expr ==> annot Here expr can be any valid C expression and annot any 1This implicit pruning obviates much of the need for explicit data-.ow .ags introduced in the Vault language [5].


Due to the shared nature of .le system, the underlying system is continuously under contention.

it becomes more dif.cult to expose the underlying raw capability directly to the scienti.c applications.


UTF8symbols may be shared across class metadata in different metaspaces, and may survive the class metadata they were initially created for.

our implementation always allocates symbolsinthe boot metaspaceforsimplicity.


For example, achieving high throughput via concurrent job execution causes issues of fairness and increased latency for interactive jobs.

advanced algorithms take multiple metrics into account.


The decreasing utilization task ordering is an effective way to avoid the above situation.

we choose to use decreasing utilization to order tasks in the allocation of high-and low-criticality tasks (step 1 and 3) respectively.


Another point to consider in the design of the test database is that applications do not have only one statement.

the data should be useful for the greatest possible number of statements, as loading a test databases with different information for each query would have a very high cost.


PQ-trees p and piare equivalent (p=opi) if pican be reached frompiby a series of these transformations.

c,otn sdi sft e,nIt/b(puu)=={efer oenIt i e rab(pou)tapo=opa}(14) The universal PQ-tree, denoted pu , has a P-node as a root and a leaf for every member of U.


This null hypothesis could not be rejected neither by a two-sided T-test nor a two-sided Wilcoxon rank-sum test with a=0.05.

there were no statistically signi.cant di.erences on the engineers accuracies of traceability recovery when supported by candidate link lists from di.erent tools.


Procedure addSuperTypes also inputs an IRG G and a type e,and returns the set of all types that are super-types of e.The procedure identi.es super-types through reachability over inheritance edges, starting from e. Complexity.

algorithm buildIRG makes a single pass over each type t,toidentify t s direct super-class and classes referenced by t. the worst-case time complexity of the algorithm is O(m), where m is the size of program P .Algorithm computePartition performs reachability from each changed type.


As a result, such services cannot host themselves the widgets whose life-time spans multiple requests handled by di.erent services.

widget instances should be maintained in stateful widget container service(s) with longer life-span.


Similarly, DO R A has dif.culty with applications that use green threads as small code changes may result in radically different schedules.

there are some types of changes for which DOR A will not .nd the d-optimal replay.


The 2-category Ps-Tsm-Alg has objects given by small symmetric monoidal categories, maps given by strong symmetric monoidal functors, i.e., functors together with data and axioms to the e.ect that the symmetric monoidal structure is preserved up to coherent isomorphism, and 2-cells given by all symmetric monoidal natural transformations, i.e., those natural transformations that respect the symmetric monoidal structure.

ps-Tsm -Alg is the 2-category SymMonstr and Tsm(C) is the free symmetric monoidal category on C. Taking C = 1, it follows, up to equivalence, that Tsm(C) op is the category lof .nite sets and permutations used by Tanaka [23].


Additional instructions for packing and unpacking of data incur a performance penalty in addition to a relatively higher IVI for ALU.

this overhead needs to be amortized by the IVI reduction due to reduced number of executions of load and store instructions.


It would be possible to carefully construct a mechanism for determining whether a message has been sent to the invoker or not and then sending it from the signal handler using asynchronous-safe system calls, but it presents too large a potential for introducing bugs.

we spawn a new thread and have it execute the section.


It should be emphasized that data tiling is required by our implementation of memory compression, not by the logic of the application.

we do not require the programmer to be aware of data tiling.


The specification of COTS components in XML allows us to store COTS component specifications in a local or remote XML database as a directory.

we can take advantage of the searching and matching facilities provided by the database.


Yet, ASICs are extremely inflexible; once the device is fabricated, the functionality can never be changed.

as design standards and protocols evolve, embedded ASICs must be thrown away, and new ones built to meet the new demand.


was not enough experience with using concepts to resolve these doubts.

the committee has reluctantly decided to remove concepts from the upcoming standard [16, 21, 31, 33], with an intention of revisiting concepts for the next round of standardization.


However, M-Metric for this research really served more as a lower bound to test NNPCR-2 against and as a way for us to validate our own implementation.

we expected M-Metric to have the worst performance metrics in all testing simulations.


Then the first estimate has a relatively loose intrinsic confidence bound, and the second estimate has relatively weak credibility, so each of these has a relatively looser adjusted confidence bound than does the third estimate.

the synthesis of these three estimates will be higher than the first synthesized estimate (94%).


If a trap occurs due to a watchpoint, Kivati records the identity of the remote thread making the triggering access in the watchpoint s metadata.However, at thispoint, the remote accessis not an atomicity violation until the matching end atomic of the AR is executed.

kivati also notes down whetherthe triggeringaccess was a read or a write.


One possible conclusion is that the High-Support females did not perceive tinkering as helpful for understanding how their debugging environment worked.

the more they tinkered, the more they reinforced their perception of their inability to understand what was happening in the environment.


Recall that (m, 32m, 1, m, 4m)-range detector is a circuit computing a (1/32, 1/8)-good code.

the previous two lemmas give the following corollary.


Also, our automatic parallelization system [4] could notbe simulatedbecause it is based on the JikesRVM, which cannot execute on SPARC.

we were unable to simulate the execution of an automatic trace-based parallelization system on HTM.


Additionally, our algorithm considers the migration of tasks only to neighbors and not to all computational nodes or partitions, respectively.

we allow for migrating tasks even if the migration makes the task binding worse.


However, this choice basically implies that we only consider built ( buildable ) projects, which may result in a bias.

we also incorporate an additional token-based (as opposed to ASTbased) fact extractor into the architecture so that some more basic analyses are still feasible.


4.3 Increase Customer Satisfaction The implementation of the three process areas guaranteed that the deadlines of the pilot projects could be better established and maintained.

in project 4, the customer attributed value 5 (highest grade) for his satisfaction with the project and stated: Things are going really well.


Any type of packet drop will degrade the accuracy and integrity of network monitoring applications [2, 5].

avoiding packet drops is a fundamental design goal in packet capture tools.


FRAMEWORK Our procedure for deciding symbolic equivalence between sets of constraint systems requires a slightly different setting from the one introduced in Section 3.

we adapt and generalize several notions and de.nitions.


Delay/Distance 30 Delay/Distance 2  1.8 25  Appendix 1.6 1.4 20 6.1 Proof for Lemma 2 1.2 15 1 Proof of Lemma 2: Denote by A(x,r) the circular region 0.8 centered at x with radius r.Note that any two nodes i 10 0.6 and j can communicate with each other directly at time t 0.4 5 if and only if dt(i, j) < 1, and nodes i and j can appear 0.2 (0) (0) 0 0 only within A(X,a)and A(X,a), respectively.

0 20 40 60 80 100 120 140 0 2 4 6 8 1012141618 ij Distance from the source Distance from the source if d0(i, j) = 2a +1, then dt(i, j) = 1 for all t = 0.


The worst case recover y cost, corresponding to all k faults occurring during checkpoint saving, includes k re-executions, kCi/(mi+1), and k checkpoint savings and state restorations, k(Cs+Cr).

total worst case cost of task ti with fault overheads is given by TCi=Ci+kCi/(mi+1)+miCs+k(Cs+Cr) (2.4) Of this, the first three terms are frequency dependent while the last term is frequency-independent according to the assumptions made.


We emphasize that there is an interval where fopt is neither U nor fee, but f * , in the above results.

the optimal scheme (OPT) is more than just determining at every point the better frequency in the set {U,fee}.In fact, there are regions where both of these well-known frequencies fail to minimize the system-wide energy consumption.


It occurs because the text approach processes each line of change independently, whereas our approach considers the relations among the statements in the PDG.

in cases where the modi.ed statements were related, our approach computed fewer bug-introducing versions (at most, one version per modi.ed method), whereas the text approach could identify one version per modi.ed line.


If the jobs are executed in the context of the server process, there will be two issues: 1) fewer jobs could run simultaneously due to limited resources in a server process causing significant penalty in scalability and 2) the user application could directly impact the Oozie server performance.

in Oozie, we opted to execute actual jobs on launcher machines that are managed by Hadoop.


After the occurrence of an ETP, the program may continue to run but produce incorrect results, or may be terminated prematurely due to faults.

the tail of the buggy access pair may not show up after the ET P .


Ourbenchmark results showthatM-taskshavetobe executed across multiple nodes of multi-core clusters to obtain high speedups.

these heterogeneous schedulingalgorithms are notsuitablefor multi-core clusters.


Whereas those works assume the observability of inter-personal interactions within a software development organization, and more importantly - a task-centered view of the development process, the tools most commonly employed in today s practice are artifact-centered.

we introduce a measure of socio-technical congruence that compares the structure of the software organization directly to that of the software product.


This may cause the construction of many states that are not relevant to check the property.

the tool can be improved by first statically identifying the relevant execution paths on the control-flow graph of the program, and then by building only the symbolic states for selected paths.


However, using Hadoop s Java interface for programming mappers and reducers requires programming concepts that are beyond the experience and comfort of many first-course students.

we created WebMapReduce (WMR), a web-based interface for Hadoop designed to enable introductory and advanced students to program mappers and reducers in several commonly used programming languages.


The put operation on Map objects returns the previous value associated with the given key in the map, or null if there was none.

the onabort handler for put must either revert the map to contain that previous association if there was one, or simply remove the new association.


This technique empowers automotive engineers to verify the fail-safety of the specified system from the early stages of the development process onward.

with the proposed approach, it is possible for OEMs to create precise end-to-end specifications of how the various components must react to failures and provide them as part of the specification provided to suppliers.


The design point for the Jikes concurrent collector was for one collector CPU to be able to handle 3 mutator CPU s, so that for four-processor chip multiprocessors one CPU would be dedicated to collection.

when comparing to the Jikes concurrent col- Throughpput ratio: Sliding views/Jikes concurrent 1.7 1.6 1.5 1.4 1.3 1.2 1.1 1 lector in this subsection, we also let the collector run on a separate spare processor and the results show mainly the ability of the concurrent collector to run concurrently without interfering with mutators work.


Interaction a is enabled when ports p1 and p2 are enabled and the value of n1 (in B1)isgreater than the value of n2 (in B2).

the composite component B sorts variables n1 ··· n4, such that n1 contains the smallest and n4 contains largest values.


(X, N ), it means we only need X part to recover the value.


Most modern processors are equipped with complete hardware-based support for performance monitoring in the form of performance counters.

modeling power by using performance counters includes the bene.ts of low overhead and high-accuracy measurements.


Hence, in order to come to a reasonable conclusion on what a translation should look like and what language features of the target language should be used, guidelines must be found that help to determine under which circumstances one mapping is considered better than another.

in the following, we discuss a couple of sample JPDDs with corresponding alternative language mappings, and we elucidate why we consider the one mapping better than the other.


Path pro.lers overcome this problem by using a hash table of counters instead of an array, relying on the fact that only a small number of paths are traversed during any given execution.

a combination of a suitably sized hash table and a good hash function almost always guarantees the absence of con.icts.


The coe.cient matrix can be any sub-matrix including minor of G. It is well known that in order to get a numerically good solution, the coe.cient matrix has to be well conditioned.

in order to be able to recover from all erasure patterns, the generator matrix G has to satisfy any square sub-matrix including minor of G have to be well conditioned.


we conclude that the deferred data synchronization is not triggered by a byte counter or an update counter.


Unfortunately, as described in Section 2.3, the use of the around() advice compromises comprehensive aspect weaving.

in general, the aspect in Figure 1(a) cannot be used to capture eventsin classes of theJava classlibrary.


We can then verify easily that the resulting state at the end of the procedure satis.es the .rst assertion but does not satisfy the second.

in one run of the procedure we have noticed that one of the (potentially) exponentially many paths breaks the invariant.


When implementing service-oriented systems one major issue is that the quality of various services used in a process cannot be controlled since they are hosted by some external provider or business partner.

the Quality of Service (QoS) is an increasingly important aspect to determine the wellperforming services from services with a poor performance.


Sources of inaccuracy When a program is deterministic, a program s work and span asdetermined by a serial run equal those of parallel runs, moduloscheduling overheads, caching effects, and the like.

cilkview can collect the work and span information during a serialexecution and infer that the work and span will not change substantially during a parallel run, except for these overheads, whichcan be shown to be minimal if the application contains suf.cient parallelism [5].


That research study demonstrates the existence of a relationship between player emotions, physiological signals and camera parameters.

in the light of these results, it appears important to further investigate the relationship between camera and player experience to automate the generation and selection of the virtual camera parameters.


Necessarily the quality of an identi.er name is related to the context in which it is found, particularly where identi.er names are chained as in object oriented languages.

we propose to develop a metalanguage to describe identi.ers in situ and their relationships with other adjacent identi.ers and programming language elements, such as operators.


Since a live-in has no .ow dependence, overwriting a live-in must occur after the point of the use.

an overwritten live-in has an antidependence after the absence of a .ow dependence.


Imagine refactoring the above play track concern into an aspect by removing the play() method from the Player class creating a Player that has no independent ability to play.

refactoring the scattered concern play track into an aspect may not be appropriate.


This can be simply implemented with an array mapping method id of secondary methods to the corresponding delegate.

the primary methods contain the following jump_to_ext code (where FlexSwitchCase is the type of delegates for secondary methods): // jump _to _ext FlexSwitchCase meth = method _map[methodid]; blockid = meth(blockid , ...); // execute the method goto dispatch_block ; Each secondary method returns the block id of the next block to be executed; therefore, after the secondary method has returned, the dispatcher of the primary method will be executed again to jump to the correct next block.


For sequential workload B, the merge overhead is reduced because of higher number of switch merges as compared to full-merges.

fAST is able to endure the increase in request arrival rate, much better than its own performance with random-write dominant workload A.


n(x) : 2, where n(x) is the cardinality of x, and P(O) is the power set of set O. p is a partial mapping p : N P -P(O), where N P = {O = R = X} is the set of non-property types A method is a set of techniques.

for Rossi and Brinkkemper [23] the model of a method M is .


Stepopositive  Stadd ep1  ///////  Step2coin t Figure2:Snapshotofaomputationofterm thislassforeahappropriatetypeofterm.However,thisis inonfitwiththefatthataordingtothefrstpriniple ofourimplementation,atermisamutableobjet.InJava, thelassofanobjetannothangeduringexeution.


Thus, with proper management of state, we should never be creating new signal functions while others are left for dead but stranded in memory.

though our system will always use at least as much memory as a version with switch and often times more, it should be capped by the maximum amount of memory that a comparable switch-based version would use at any one time.


Other techniques, on the other hand, are limited to only identify symptoms of drift in system implementations.

developers can introduce unacceptable dependencies between components (Section 2.2).


This method for representing class hierarchies also pushes the changes in class hierarchies to the locations where the a.ected classes are instantiated.

our technique can be very precise in accounting for such changes.


Ideally, information about accepted clones could be fed to the Clone Miner for further processing, in order to find higher-level clones based on lower-level ones.

the clone detection process that we envision would lead from simple clones to structural clones, possibly at a number of abstraction levels (up to the level of software architecture).


That is, the API candidates for a API query should be in the list of all APIs in the targeted library.

we extract all APIs in the targeted library, e.g., .NET Framework, as the dictionary.


To build f, we associate habort to each aborting and init request; to every committed request r, we associate the pre.x of habort up to r. It is straightforward to check that the resulting mapping veri.es the Abstract properties.

we have veri.ed the safely composable properties in each case, and therefore module A1 is a safely composable implementation of test-and-set under V and M.  6.2 The Wait-Free Module The wait-free module A2, whose pseudocode is given in Algorithm 2, uses a hardware test-and-set T , whose value is initially 0.


Note that this bound counts cache misses, each transferring lines of size L, hence the additional factor of L in the equation.

for some constant A and su.ciently large n,the time spent moving data between main memory and the processor is n 2 A × n(max(logZ n, 1.0)) Tmem 3 ×· , (2)Pßmem where ßmem is the node s memory bandwidth in words per unit time.


all calls to its advised function are made with a positive argument.

lower layers with the same effect cannot be accessed and pcCall is a prede.ned pointcut that matches all open applications must be explicitly lifted.


AugIR The Conceptual Design and Evaluation of an Augmented Interaction Room Markus Kleffmann University of Duisburg-Essen, Germany markus.kleffmann@paluno.uni-due.de ABSTRACT It is often di.cult for stakeholders with heterogeneous backgrounds to maintain a common understanding of the most important risk and value drivers of a complex software project.

i propose the concept of a so-called Augmented Interaction Room, i.e.


In this case, all threads except the main thread are idle (often equal to OMP_NUM_THREADS).

we expect MPI to be able to bene.t from a large number of idle threads.


We do that as follows: abelian class (*,^)  Dimension This> implements* DimensionI {...} Our instance classes of Dimension now need to instantiate this parameter with themselves: Dimension Length {...} Dimension Time {...} The tight bound on parameter This ensures that each instance class of Dimension must instantiate This with itself.

it is straightforward to introduce syntactic sugar that implicitly includes a type parameter This on every class of kind class* or abelian class and on every class that includes an extends* or implements* clause.


Let each server consume energy E. Energy consumed by group i, Ei is given by, Ei = ni × E (2) Energy consumed by group j, Ej is given by, Ej = nj × E (3) When the proposed solution is not applied, there is no rescheduling ofthe requestsbased on energy cost.

total cost of operation across all groups, Ctotal is given by, Ctotal =(niCi + njCj) (4) As group j is the receiver chosen, operating cost of group jis lower than that ofgroup i, i.e., Ci >Cj.


Since the data is distributed in advance within HDFS, the default task assignment may not allow parallel processes to fully bene.t from local data access without considering data distribution.

we need to intercept the original tasks scheduled and re-assign the tasks so as to achieve maximum e.ciency on a parallel system with a high degree of data locality and load balancing.


Bit b3 is required to work with b2 in a second instance of the Equality behavioral relationship.

if any of the first three bits are Set or Cleared, the others will be, too.


Figure 6: Example of remapping exceptions EJFlow uses declare einterface to enforce the exception interface.

a huge amount of code dedicated only to implement such handlers can be replaced by two lines of interface declaration.


The power function is de.ned as the probability that the null hypothesis is rejected when it is false.


VeriSoft s analysis is only complete (up to the given depth) when the analyzed program uses VeriSoft s IPC objects.

it is necessary to replace the IPC objects and their operations used in the input program by the corresponding VeriSoft IPC objects and their operations.


For example, querying any interface in a connected component for an IUnknown interface need not always yield the same interface as a result, violating the IUnknown property of COM components.

we enforce statically the COM conformance of components in our type system, by identifying a speci.c interface as the of.cial entry point into the component.


If the value of Focus of the Capability of Object x is higher than the value of Nimbus of the Capability of Object y, Object x can be aware of the Capability of Object y.

object x can initiate an Interaction with Object y via the Capability.


As demonstrated in our previous work [25], assigning the Unit Image Rendering service of this application to a processing node N1 can adjust both the parameters error tolerance and image size to larger values, which leads to more application bene.t within 20-minute time limit, than executing it on node N2.

in a reliable computing environment, an effective resource allocation scheme is critical in achieving the maximum bene.t within the time interval.


However, there is no guarantee for that because subsequent changes can overwrite preceding ones that would not be processed by the engine.

the engine might miss intermediate changes that are however relevant from the perspective of a managed system.


implementation of the algorithm that uses, for example, the transition to the new coordinate system needs only to add the class with a description of the corresponding transformation, while the use of a particular subset of concepts is performed dynamically by means of a "key" assignment.


Thus, only this chapter and its sections are considered as important zones to vfcBOX server.

on each update, only the modi.cations to this speci.c chapter are transferred, avoiding to transfer updates over the rest of the chapters.


The una algorithm, however, will generate the following sequence of points: 00000 , , , , ,... 10101 According to theorem 1 a feasible solution cannot be found, since una will end up in a loop just examining the two points () () 0 and 0 .

una is also incapable of 10 .nding mixed integer solutions.


Democratizing the writing of scienti.c adaptation functionality: By exposing the adaptation functionality as standard AOP code, our approach increases the population of programmers who can write and maintain such code.

while adapting scienti.c applications still requires expertisein the scienti.cdomain athand, implementing the functionality no longer requires intimate knowledge of the intricacies of Fortran.


However, the need to intercept well de.ned points in the execution of a program to check design constraints makes the enforcement of contracts a crosscutting concern.

contract enforcement code is interwined with the business code, hindering maintenance.


This feature is used by the piping replicas to forward calls to the session server.

when the translator program is run by a piping replica, ButtonSelector.createButton() returns an instance of ForwarderButton, which forwards setActionListener() and other calls to the session server.


In that way we are able to connect the contributions of the individual over time, and to block malicious individuals.

explicit registration at a community site is not absolutely necessary to its goals.


A toolchain depicted in Figure 11 consists of three tools: AlloyAnalyzer,RAEandRASS.Wehave enhanced the constraint editor in RAE to support the transformation from RCL2000 to Alloy.

the policy designers are able to specify RBAC constraints with RCL2000, and then convert RCL2000-based constraints to Alloy expressions in RAE.


The checksum code computes a .ngerprint of the veri.cation function, i.e., if even a single byte of the veri.cation function code is different, the checksum will be different with a high probability.

a correct checksum provides a guarantee to the dispatcher that the veri.cation function code is unmodi.ed.


REFACTORING-BASED ADAPTATION A software framework [7] may evolve considerably due to new or changing requirements, bug .xing, or quality improvement.

existing modules (plugins) * The presented work is funded by the S¨ achsische Aufbaubank, project number 11072/1725.


SWAT [3] is a memory leak detection tool that also uses sampling it samples code paths at a rate inversely proportional to their execution frequency.

rarely executed code paths are sampled at a greater frequency than frequency executed ones.


However, in the absence of an oracle trace which we never have in reality heuristics like instruction pointer ordering are almost impossible to use.

we are motivated to create an algorithmic process that will guarantee a correct trace when it is .nished.


we model a relational database as a record where each label is a table name, and each value is a tuple of a table and the list of constraints of that table.


We assume by induction that by time ck log2 k2kl, every processor has identi.ed each good predecessor in Pl so that by this time, it has identi.ed the more than 5k/6 processors in the core of C which have sent it messages upon completion of the election.

when a processor hears from5k/6 processors, at least2k/3 messages are from processors in the core.


That is, the failure of software as a control or monitoring mechanism can itself be a software cause of a hazard.

close to 60% of all hazards were software-related.


Especially the code required for graphical, interactive widgets overshadows a tool s purpose, which is often primarily about accessing domain-speci.c data.

two di.erent roles emerge: the role of a tool builder and the role of a user.


This is a direct consequence of TAWD s workload-skewing nature and the possible underestimation of the arrival rate .m.

the dispatching algorithm is con.gured so that, as long as the observed arrival rate is less than the estimated arrival rate (meaning that TAWD does not overload thermally e.cient servers), the dispatcher can dispatch jobs according to the TAWD policy, otherwise it dispatches jobs according to LB (UPONJOBARRIVAL in Alg.


As we have seen, in a higher-order aspect language, an advice is a function that receives, amongst other arguments, a proceed function used to either call the next advice, or to run the original computation, if it is the last advice in the chain.

simply shifting the execution level of one advice implies 6The idea of level-capturing functions is directly inspired by the re.ective language Blond [7], which supports two different kinds of re.ective procedures (more on this in Section 7).


Krishnaswami observes that allowing negative, guarded occurrences enables the de.nition of guarded recursion.

this triggers a collapse of (guarded) µ and ., so negative occurrences appear incompatible with our goals.


However, (not only) in the context of the impacts of software models on security, does it seem reasonable to precisely define what open source software is and whether we can identify several categories which need to be treated differently in the security context.


We observe that the MM and HH events have a much higher probability than the MH and HM probabilities.

in the random variable pair X1X2, X2 is strongly correlated with X1 .


Hence, the reason for this difference on modularity stability is that the number of components included over the releases is higher in the AspectJ version, as discussed in Section 4.

the number of components where, for instance, LABELMEDIA and PERSISTENCE are, increases more in the AspectJ version than in the Java one.


From our initial set of 20 participants, two did not install the keyboard in a timely manner, and we have excluded them from our results.

our reported results from the initial study are from 18 participants who installed our study keyboard on their personal Android smartphone for a period of three weeks during November and December, 2012.


For instance, targeting all elderly people in a particular building on a street or all elderly people on the entire street.

the more .ne-grained the data, the better.


The points-to sets computed for each pointer constitutes the pointsto information for the example program.

the .nal set of points-to facts computed using this inclusion-based analysis is: a, b, c, e, x, y .


This increases the degree of coupling for modules.

the number of disconnected relations impact criterion independence and selfcontainment.


Obviously, looking only at the same day would not be suf.cient.

we decided to use a longer time window of n = 5 which roughly corresponds to a working week.


Time to Each Bug Find and Fix Spreadsheet debugging is often a time-sensitive activity, whether a trained accountant does it [21] or a young clerk as was the case in the Lehman-Barclays mix-up.

another important measure of debugging success in addition to the number of bugs found and fixed is how long it took participants to find and fix those bugs.


6.2 Effectiveness of the ArchDefault tool Using ArchDefault in the beginning helped the extractor start with fewer warnings to manually resolve, then reach an acceptable level of warnings more quickly, in order to extract initial OOGs then re.ne the OOG with the maintainer.

it was possible to use a tool to propagate many of the annotations automatically.


However, all of the states created in the loop at line 8 during the same iteration of the outer loop differ only in ''' '' ' ),c)+ ß ·q(e,c)+ c(e,e) instr(e ' )= if(e) goto e ·q(succ(e instr(e ' )= halt ' ),c) otherwise 0 q(succ(e .. the value of the temporary variable i, which is never used again in the program.

merging these states does not increase the cost of subsequent feasibility checks, yet it cuts the number of states after the outer loop down to the number of states before the loop (2 in our example).


Construct: IDEs and Metrics Because CodingTracker is implemented as an Eclipse plugin, all developers in our study used Eclipse IDE.

our study results may not hold for other IDEs.


On the other hand, if the write event is a user input or a local computation, the MH first forwards a copy to the MSS to be logged and does not apply it locally until an acknowledgement is received from the MSS.

logging is also an activity that the MH and MSS execute during normal operations.


For example, it is di.cult to extract the layout of each GUI component from the image.

it is not easy to change the layout according to the characteristics of output devices or a user s preference.


The most used algorithms in this process are the mechanisms of hashes.

if a single bit is changed, the whole hash is generated again, and a completely different output is returned.


Moreover, the task dependencies hinge on the node to task mapping.

the paths can change dynamically, if a node is moved from one to another task.


In terms of the doesReference graph, reference information is mapped to the vertices of that graph.

a reference from an object xto an object yis mapped to an edge from Xto Yin the graph, where Xand Yare the vertices corresponding to the allocation sites of xand y, respectively.


In comparison, linear maps are a somewhat simpler, but lower-level abstraction.

formulae involving linear maps may be interpreted as ordinary .rst-order formulae without the need for any translation.


Forces: The contracts that have to be compared might be de.ned by the development teams independently.

it is likely to have different representations of contracts, at least for data values used in patterns.


Hence, the FDX performing the call-back invokes the operation by sending the context to the invoke operation implemented at the subscribers.

(4)  <xs:element name="Location" type="xs:anyURI"/>    the subscriber must implement the STAIVE interface as well, if call-backs are required.


The copyunit needs to redirect access from all processors during thecopy.

partofthe functionalityhastobeplacedafter the memory arbiter.


C language has both advantages and disadvantages in compiling and computer software development.

it is necessary to select appropriate software type and language class through certain method and strategy, thus improving the existing compiling predicament.


In d2 and d4 the GS outperforms in 42 and 41 times, respectively.

based on the statistical tests, we can state that the GS is clearly the best algorithm.


Additionally, transformation speci.cations used for generating transfer syntax artifacts based on business document models may be subject to evolution themselves.

we are facing the need for dealing with the matter of evolution and co-evolution within Core Components [15] and business document model variants.


agents that use newly created items cannot be moved to a position before that item was created.


Many proteins share the same types of secondary structures, and therefore, will have dominant coe.cients that are almost identical.

we must also take into account the relative position and location of the secondary structures.


We thought that generic mailing lists would reach a large audience, but might also generate too much spurious data.

we decided to directly contact potential participants based on our networks.


EUGÈNE EHRHART (1906-2000) In 1991, I was recruited as an assistant professor in a business school where students did not have much interest in pure computer science and mathematics, and teaching them word-processor tools was pretty straightforward.

this professional context provided me some time to meditate.


Since these variables are known to be new (and thus they do not appear in Old1), the extension operation in our domain is trivially de.ned as the identity.

from now on we will simply disregard the extension steps required by HAL s analysis framework.


The quali.ed types of Foster (2002) en compass a variety of .ow-sensitive, invaluable properties: Zero or more quali.ers, under a partial order (reminiscent of datasort re.nements), may appear with a type.

foster s quali.ed type annotations are of two forms: annot(e, Q), which adds the quali.er Q to the type inferred for e (a kind of cast), and check(e, Q), which directs the system to check that Q is among the quali.ers of the type inferred for e. as with dimensions in our system, quali.ed types are based on annotations provided by the user and cannot be checked at runtime.


The second step would be to re.ne the proposed economic model for software.

the data collected among the participants and situations will be classi.ed and introduced into our economic model.


Apparently, dreq and dbm are independent, and their average values are both t/2 if the packet rate is invariable.

the total average latency for a packet transmitted in one hop T1hop can be approximately computed as d d t+ - d+3 =3 / 2 +d , where + dt 3 bm req ( req )EED EED is the average end-to-end delay between nodes.


The actors may be in the roles of services and/or consumers interchangeably but both roles have their willingness, goals and a degree of ability to interact.

two actors may have different willingness to interact.


The cognitive radios and possible existing legacy infrastructured or ad hoc networking devices can form a general cognitive radio network (CRN).

the critical task for a cognitive radio terminal in CRN is to identify its best way to complete its networking functions beyond the link level.


Cloud environments present these systems with the possibility of scaling up or down in a very straightforward manner.

a well designed middleware for these environments should be able to react to the infrastructure and system conditions.


Our results in the earlier sections suggest that the relatively poor performance achieved by the aggressive JIT compilation policies may be an artifact of the FIFO compiler queue that cannot adequately prioritize the compilations by actual hotness levels of application methods.

in this section, we explore and measure the potential of different priority queue implementations to improve the performance obtained by different JIT compilation strategies.


Either from the properties or from the state machine modelling the web service, QuickCheck derives the speci.c test cases, and then, using an HTTP adaptor (generated from the WSDL speci.cation), we feed the SUT.

using our framework, the testers do not need to know any speci.c details about web services implementation languages.


Because both file specifications have evolved with different background and technologies, APIs cannot be matched to each other for the same functionality.

the API abstraction layer provides the same functionality independently from the specific scientific file API.


Such polymorphic let-generators are hardly ever used in practice, and experience suggests that there is almost always an obvious way to rewrite the required polymorphic bindings using an explicit let-expression, avoiding the whole problem.

we believe that the simplicity of this design far outweighs any generality that might be obtained by more complicated translation schemas.


Tasks are larger in size and fewer in quantity than traces.

scheduling can take less time and can be performed less frequently.


This interest, however, comes after a lengthyperiod in which the U. S. developed no new reactors.

the level of modeling and simulation used in the nuclear energy industry had largely stagnated.


The four subprocesses described in section 2 can all be identified as loops in the DFG shown in Figure 2, but the nature of their interactions with each other is hard to determine precisely.

for example, the DFG suggests that many different instances of Revised Data can be generated by executing this process, but the diagram makes it hard to determine whether or not the scientist may wish to restrict which selection criteria are to be applied to which Revised Data under which circumstances.


We show that nondecreasing CGLFs do not, in general, admit a potential function.


is the type of a function that takes an input integer and returns an integer greater than the input.


During a performance, actions related to an instrumental event are executed when the event is detected.

a score is a sequence of instrumental events and for each such event an associated sequence of electronic actions.


The host VM cannot eliminate this load without support from the guest VM because the host VM cannot distinguish between data structures of the guest VM that are immutable and data structures of the guest workload that are mutable.

the guest VM needs to specify which regions of the memory contain the immutable bytecodes.


However, the JFlex solution was both complex and not easy to extend.

we respeci.ed the lexer using MetaLexer, in order to get a cleaner and extensible solution for our McLab toolkit.


{u.ks,v.ks}{-8, 8} if and only if k = v.ks.


The performance of MIPS16 code is, on average, 6% lower than that of MIPS32 code, with the worst case being 24% lower.

our technique was able to reduce the code size using rISA with a minimal impact on performance.


To improve runtime performance it is sufficient to parallelize only loops which contribute significantly to the overall runtime.

profiling is utilized to discriminate between loops which are worthwhile parallelizing and the ones which are not.


We first define the periods inductively as follows: for the root node J0 we define T(Jo) = 1, and for a non-root node J we define T(J) = r(J') d(J').

by definition, for a leaf J, 7"(J) is the reciprocal of the weight of J.


We will try to move d...c ' to the point right before a1, respecting intrathread order.Ifthe moveis successfulit violatesthe minimality of tr ' ,hencethe movemustbeillegalbecauseit violates some property of CR or of the de.nition of a trace.

the move mustbeillegalfor either of the usual two reasons: 1.


v2(EPS ) and '' location(alice, bldg12 ) ./v2(EPS ).

we can clearly see that the other eventlocation(alice, bldg12 ) ' in Ei satis.es the three conditions with the same event sets EPS and E '' the system in this example is safe, and this PS .


Dually, our system infers that the no-duplicates invariant holds on p :: us as p (whose bit is unset in m) is different from all the elements of us (whose bits are set in m).

our system automatically veri.es: alloc :: RES=.


Instruction packing with an IRF is limited in the number of RISA instructions available from a single MISA instruction that is fetched from memory.

there is an approximate lower bound of 21.5% for fetching with an IRF as at least 1 out of every 5 instructions (assuming all tight packs) must be MISA.


Consider the following erroneous let term: (let ([a 1][2 b]) (* ab)) The named-let clause fails at the second sub-term with the progress string REST · FIRST: (let ([a 1][2 b]) (* ab)) The normal-let clause, however, fails deeper within the second argument, at REST · FIRST · REST · FIRST · FIRST: (let ([a 1][ 2 b]) (* ab)) This second sequence denotes strictly more progress than REST · FIRST.

the second failure is selected, and the macro reports that it expected an identi.er in place of 2.


First, in our particular application, all writes can be tagged with a globally unique identi.er, typically consisting of the local time of the client issuing the write followed by the client s identi.er.

this assumption does not incur any loss of generality.


In particular, in relation to the digital economy therefore seeks to "develop an ecosystem that contributes to a prosperous Mexico, through assimilation of ICT in economic processes, to stimulate productivity growth, economic growth and formal job creation".1 Within the framework of the secondary objectives of the digital economy is projected to develop the market for digital goods and services; promote the development of e-commerce; stimulate innovation in digital services; and ensure financial inclusion through mobile banking.

on the lines of action of these objectives is considered to encourage innovation and competitiveness of micro, small and medium enterprises through the adoption and use of ICT.


Having done all steps recommended in the guidelines would undoubtedly mean that more papers would be included and if the searches being perfect they would end up with exactly the same set of papers.

we wanted to compare the .rst steps in the di.erent guidelines, since it is reasonable to believethatif theseproduce similar enough results,then alarger sample ofpapers wouldjustincreasethe similarity.


But two methods of framework provide the legal issue which conflicts with privacy.

the enterprise wants to use this framework will solve this problem with the part of the employee and management.


JavaFX has adopted a radically di.erent strategy for de.ning bindings: rather that proposing a bunch of binding artifacts, such as with Flex or WPF, JavaFX introduces new language keywords dedicated to the definition of bindings [10].

javaFX bind ings are clearer than that of Flex or WPF since they are based on very few constructs, while Flex and WPF bindings use many di.erent artifacts that often require low level ad hoc programming.


Since m agreement replicas that are part of the mismatch matrix are faulty, that means that at most g - m of the remaining 2g +1 - c replicas can be faulty.


Similarly, when developers only inspect up to 10 program blocks, the best variant that does not use technique selection localizes a smaller number of bugs than the number localized by the best variant that employs technique selection (i.e., 87 vs. 91).

applying technique selection can improve the performance of Fusion Localizer.


However, Planetlab lacks means to control experimental conditions.

it may be di.cult to apply results obtained on PlanetLab to other environments, as pointed out by [7].


5.3.1 Performance The main purpose of these experiments is to evaluate the performance of our scheduler governor in comparison to the ondemand and the performance governor for di.erent degrees of parallelism.

for each of the four possible con.gurations (two machines with two timer tick con.gurations each) we executed a series of experiments with a growing degree of parallelism up to 1.5 times the number of cores.


Therefore, one of the main challenges is the partitioning of the heterogeneous platform resources between the applications in a way such that the different objectives are optimized while ful.lling the requirements, involving a dynamic resource allocation problem.

assigning resources to applications is a multi-objective optimization problem, commonly handled by optimization techniques at design-time [1] for obtaining highly optimized design points.


when the .rst S chunks have already been created and transferred to nodes at level 1.

at instant tS each node of level 2 will open S connections to download the .rst S chunks from the S nodes at level 1.


The priority of a transport depends on the kind of transport, the pending time since its creation, and the nature of other transports in the system.

transport agents interact with other related transport agents to determine the correct priority over time.


Objects must be added one-by-one by using one of the following methods: boolean add(object o) void add(int index, object o) This design forces the caller to add objects individually even if all objects to be placed into the vector are known at the time of the construction of the vector.

the cognoscenti will argue that the Vecto r class provides constructors and methods of the following form: vector(Collection c) boolean addAll(Collection c) boolean addAll(int index, Collection c) it appears that a Vecto r can be initialized or extended by using a Col 1 ect i on so that one-by-one addition is not required.


To collect these traces, we ran 1000 DHT nodes with randomly-chosen IDs, and logged all DHT put messages routed to our nodes.

our traces show all downloads for those .les whose identi.ers are close to Figure4: Decentralized optimization, contentplacement scheme and uniform-slot policy, under parameters C =1000,D = 10,B =1000,U =3,M =4.


Beside the information list in Ghana Essential Medicines List, we also put the potential side e.ects corresponding to each drug.

patient can easy fetch the drug information and check for symptoms of the side e.ects of the drug.


Interestingly, these include many places which were missed by programmers who were providing manual annotations.

it is a reasonable conjecture that the precision trade off of our proposed analysis is not a signi.cant liability.


It shows that MPEG-4 has higher end-to-end delay for most of the frames (average = 0.4428 sec) because it generates larger frames which require more time to transmit through UDP packets on the network.

h.264 is more efficient as it gives lesser endto-end delay for most of the frames (average = 0.0659 sec).


For gzip, although the mis-speculation ratio is almost 6%, the total number of check instructions is nearly negligible compared to the total number of load instructions.

there is little performance impact from the high mis-speculation ratio.


If the outcomes of the two runs are not coherent with each other, then we can be sure that some erroneous behavior occurred.

this happens, for instance, if the second run needs to recover a diskthatwas successfullyrecoveredinthe .rstrun.we can checkforinconsistentbehaviorsby runningthe checker twicein succession and comparingthe two results.


The main issue in combining Zyzzyva s speculation with Aardvark s robustness is that Zyzzyva relies on clients to trigger slow-path processing when responses from replicas don t match, but Aardvark warns against allowing potentially faulty nodes to unilaterally drive the system to expensive execution paths.

instead of relying on clients to trigger full agreement among replicas as in Zyzzyva, UpRight s agreement protocol discovers and corrects divergence among replicas when the order nodes communicate to checkpoint their state.


Note that the SQL extension s inner productions do not reference Id t but SQL Id t, which has lower precedence than (submitsTo) all host language and SQL (sql kwd)keywords.

the string SELECT will not be recognized as an identi.er in the context of an SQL query and is disambiguated by precedence.


However, no existing tool-environment covered the wide range of documentation needs the situation required.

simply buying another tool wouldn t do the trick, but the tool had at least to be adapted to the speci.c company situation.


Existing research approaches address flexible thread allocation per SMP node for a single application [13][14], whereas we coschedule multiple jobs on the same nodes / CPUs.

our main new contributions are: Unified framework for scheduling under different types of resource sharing: space sharing, standard time-sharing, and node / CPU hyper sharing  Support of a new resource-reservation type  Option of trading time vs. space by time/space adaptation  Each local machine consists of a number of SMP nodes Each SMP node has several CPUs Each CPU may be hyper-threaded (2 logical CPUs L0 and L1)  Figure 1.


MVCpattern facilitates the separation of control .ow logic(controllers),business logicanddata (model)and user interface logic (view).

mVC web applications break the concrete link between a URI and a speci.c resource residing on the server.


As discussed earlier, the Daikon-inferred invariants are used by ESC/Java as both requirements (statements that need proof ) and assumptions (statements assumed to hold).

the assumptions limit the space of possibilities and may result in a certain false property being proven.


If the concrete value of size() was used to characterize the state of a vector, the resulting model would have at least as many states as the maximum size of the vector.

we use abstractions over the return values of inspectors rather than the concrete values themselves.


(Note that in this de.nition, we do not require the homomorphisms to be constant on adom(K).)

since chaseM(I) is a universal solution for I w.r.t.


2 Partially supported by Ministerio de Ciencia y Tecnología under TIN 2011-24747.  the best encoding we know of produces an exponential blowup in the size of the boolean formulas.

such an exponential cost in the reduction would defeat the purpose of using a SAT solver, since the bottleneck would be the reduction itself.


The metrics of each VM are aggregated by the vgpolicy to construct the top level or node level metrics (nMPC, nIPC, nutil) as shown in Figure 3.

the knowledge of both the node level and VM level metrics allow the vgpolicy to understand not only the overall power and performance pro.le of the whole vgnode,but also .ne grained knowhow of the breakdown at VM level.


Note that we are dependent on the quality of the test suite for both the generation of invariants and for checking the validity of the invariants.

our technique is neither sound (spurious invariants may be reported) nor complete (we may miss invariants.)


Proof-Carrying Code (PCC) has a code producer generate not only the code but also a proof that the code is safe.

verification of the safety of untrusted code can be carried out by a small proof checker.


In Figure 1, NMC(ki+j) denotes the number of modified components in commit ki+j of project i, and ANMCCi denotes the value of ANMCC during release i2 (i.e., between releases i1 and i2) ANMCC value by dividing ANMCC with the number of the ...... of project i.

we use formula (1) to calculate ANMCCi: ..  .


Specifying for instance complex mathematical calculations by means of an action language such as fUML in the course of the semantics de.nition of a DSML is just out of scope of the language speci.cation process (if the language is not about complex mathematical calculations).

a semantics speci.cation language needs to provide means for integrating other  Figure 1.


By the application of our rules, the number is the numbers of activities and the events are equivalent at the different levels.

the event-B Machines, obtained by the application of our design approach have the same order of complexity of the source UML AD models.


dst was additionally propagated from src to dst.

i and D differ in iteration it with respect to the node src being in the worklist (Lines 22 32) in D and not being in the worklist in I.


For instance, the latency of the network in-creases the messaging overhead of the parallel application which will increase the total elapsed time of the application processes.

each specification could be analyzed with respect to the de-fined functional and non-functional requirements.


On the contrary, a convenient way to model HTTP resources involves the use of as many triple spaces as resources are being modeled.

these resources would not be static shared spaces, but they would be created after POST operations and destroyed with DELETE operations.


A subtype may add further features (variability extension) and bind existing or added features (specialization).

we can use SPLs polymorphically: we can provide subtype P .


6.3.5 DetailsLifelong  learning  mustberegarded  asworkinprogressandisthereforelimitednotonlto  learning  informaleducationalcontexts.Muchofthe  learningtakesplace  outside  ofeducationalinstitutionsininformal(learning)contexts.Comparedwithreflectiveportfolios  (especiallylearningproductandlearning  processportfolio,seeREFLECTIONPORTFOLIOdevelopment  portfoliosillustratehigher  levelsofacquiredknowledgeandcompetencedueto  thegrowingmaturityand  expertiseofthestudents.Baumgartner[2009,p.35]arguesthat thelearning  goalsarenotsetupcompletely  freely  orvoluntarily  by  thelearning  individualhimself,butareorientatedaroundbundleofoperationalizedgoals[ ].Althoughthebreakdownofthesegoalsisself--determined  and  self--organized,thegeneralobjectivesarepredetermined  externally.

substantialpartsoftheportfoliowhichprovespecificcompetenceofstudentmay  aswellbeused  forassessmentand  incorporated  intoapresentationportfolio(seePRESENTATION  PORTFOLIO).


More speci.cally network coding provides the following bene.ts: I-The capacity of the seed server is fully utilized by constantly serving innovative information: This is a critical point; at time zero the seed server is the only node holding a copy of the full .le.

the download time achieved by the earliest .nishing node is lower bounded by the time that it takes to put a single copy of each block in the network.


FP and thereis some non-interleavedexecutionof P from input s that ends in state t. Our intuition is that assertion violations resulting from illegal inputs will often manifest in non-interleaved executions.


Several DDRD techniques already exist; however they are usually focused on maximizing the consumer benefits rather than minimizing the producer effort.

people involved in the documentation and maintenance activities are supposed to spend a lot effort recording and documenting the rationale.


In the previous problem, we assume that the data exchange setting M and the query Q are .xed.

we are interested in the data complexity of the problem of computing certain answers.


We de.ne turning points as the points in the curve with considerable slope change, which are used to decide the start and end points of line segments.

thewholeleakage model canberepresentedbyaset oflinear functions, as shown in Eqn.(7).


The true cause of such an error cannot be determined with con.dence by the security server, and in any case we lose the ability to further replay execution.

devices exhibiting such errors are treated as potentially compromised, and the user needs to be noti.ed and his device restored to a clean state (Section 2.5).


The ability to supply web service is important to evaluate a web server.

we use some benchmarks to test the performance of TCNet.


In this case, a combiner thread pj has served reqi before the execution of line 11 by pi.

pj has executed line 17 for ndi at some iteration l> 1 of its while loop (lines 13 - 19).


A test program that has such bugs is di.cult to use, because the error may manifest rarely and only under speci.c conditions.

test programs should be deterministic even those with nondeterministic bugs.


We believe that trace-based aspects have a more intuitive representation in a sequence diagram than in an aspectoriented implementation.

we propose to express trace-based aspect using UML sequence diagrams, which can be mapped to a Java implementation.


We can see that the Statistical scheme is very close to IDVS, which is guaranteed to be within (1+5%) of the optimal and many times is in practice better than the guarantee.

we conclude that Statistical is very close to the optimal even though it is not provably optimal for either the ideal or realistic model.


However, recursive disassemblers are based on control-.ow with tracking branch instructions.

our obfuscation utilizes trap codes for deluding the disassemblers.


There is lacking of the existence of refactoring patterns based on the detail categorization of code clone characteristics.

we suggest a method to create such refactoring patterns.


Value .ow escape graph for CaseWalkerInit in .gure 5  Figure 7.

value .ow escape graph for CmpIgnoreCase in .gure 5 .gure 5 calls CaseWalkerInit, which we already established allows its src argument to escape into w. the value .ow escape graph of CmpIgnoreCase, shown in .gure 7, has edges from s1 to w1 and s2 and w2.


In all the experiments presented in the study, NTGen generated enough traf.c to saturate the network processing machine.

in all experiments, the performance bottleneck was the speed at which the packets were processed, which is determined by the performance of the selected task assignment.


With n optional and independent features, we have to repeat the type-checking procedure for each of the 2n products.

the upper bound for the performance is 2n setup checking t = ti + ti (Product-based) i=1 The reason for the poor scalability are redundant analyses made in every step of the type-checking procedure (Figure 3).


Parallelization seems facile, as there is no data dependency between OCL expressions, however, the evaluation language does not have this property, thus, validation is needed to prove the equivalence of the evaluation of OCL and POCL fragments.

cSP de.nitions of OCL and POCL constructs have been given to provide a common formalism.


Without such relationships one may question the foundation of modeling since there is little or no value in using a software model that does not consistently represent the real software system [4,6].

what is needed is trace information and the lack of it constitutes a severe problem also known as the traceability problem [6,8].


Notice that only Byzantine nodes situated at distance at most 2R from p can cause p s messages to be delayed.

the total number of adversarial broadcasts that delay p is bounded by 4ß.


For each QPS, Sequential becomes a baseline run to compute the response quality of Adaptive (which is the test run).

if Adaptive returns better relevance scores of search query responses than Sequential under a QPS, the .gure will report a positive value at that QPS.


Our code generator derives these two steps, automatically.

a single holds link from this to g suffices.


Multiple clients can send updates to the server regarding the same set of parameter values.

the server needs a way to integrate the di.erent updates in a consistent manner.


Note that a value that remains in a particular .eld of an ob ject for longer than the sampling interval may be observed multiple times.

the number of occurrences is determined by both the number of objects that contain the particular value and the duration of time that this value remains in each ob ject.


In order to resolve not only textual and syntactic con.icts, but also semantic con.icts [3] composite operations must be detected.

we distinguish between local and global con.icts in model versions.


Dealing with these issues for complex XML data can be quite time-consuming.


As a .nal remark, we would like to emphasize that our project de.nes a programming framework that .ts naturally into the architecture [6] that is coming out from the most recent activities of OPES Working Group.

an important future work will be to lead our project into the OPES standard once it becomes an accepted standard, in order to develop an Edge services overlay network of intermediary entities distributed on wide area networks.


Ops 4, 5, and 6 each have node weight of 1 and a slack+1 of 2.

ops 1 and 2 each contribute 1 to the cycle weight while ops 4, 5, and 6 each contribute 0.5, which forms a cycle weight, Cwgt1,1,of3.5.


Now, if no explicit termination metric is given, by default LI QUI D HA S K E LL assumes that the .rst argument whose type has an associated size measure decreases.

in the above, we need not specify metrics for fac or map as the size measure is automatically used to prove termination.


However, it seems that no reports of observations of the comic design process have been published to date.

it is still not clear what activities a comic designer performs during the early stages of design.


Our .xpoint semantics is based on interpretations that consist of pairs or equations of expressions describing the computed input/output relation of all functions.

the base domain is the set of equations .


Then node n blocks the 1Hop-Protocol initiated by the other node, by broadcasting during veto rounds.

we can be sure that data is propagated only when every node in a square has committed to it.


Figure8illustrates the ReductionOperation delegate and its use in Allreduce.

mPI.NET s collectives provide more functionality than the native MPI collectives, despite MPI.NET s simpli.ed interface.For example, the native MPI Allreduce cannot support concatenation of strings, because it supports neither serialization nor reduction withvarying amountsofdataprovidedbyeach process.each of the MPI collectives must be reimplemented within MPI.NET to support serialized data types.


In particular, since the new processing architecture redefines which users process input commands, a previous multicast architecture may distribute input commands to new slave computers, which is inconsistent with the notion of collaboration architectures.

when changing the processing architecture, the system changes the communication architecture to unicast.


In the effective SINR method, as in [11] and [12], we use the following information measure function I(x): x () =exp( (2) Ix - ) .

the inverse function of I(x): -1() =-.ln() x (3) Ix .


It does not require complex human interaction to direct the correctness proof.

industrial application of model checking is growing and a number of successful cases have been reported.


State about the necessary number of to-be-sent -1 packets is kept in the event that the SPB algorithm triggers the next +l burst before all -1 packets necessary for compensation are sent.

seen over time intervals which are long compared to the +1/-l burst times, the mean loss for the flow will be equal to the best effort case (Eq.


Since computation grows exponentially as one descends levels in the tree of recursive calls, however, it is important to stop slightly short of the scalar case; taken to the extreme of scalars, recursion will lose much e.ciency to stack manipulation.

high-performance recursions do not descend to the 1 × 1 cases, but rather switch to iterations on blocks small enough to be local, but large enough to take advantage of hardware support like pipelines.


Related Work There are many security policies enforceable by execution monitoring [16, 22, 32], but non-interference is not one of them [25, 32].

monitors often enforce properties stronger than non-interference [1, 3, 4, 29, 31] losing precision, and hence raising false alarms.


As canbeseen in theinstrumentedslowpath, thecountdown is reset once it reaches zero.

we consume nextsample countdowns gradually over time.


Basically, this interface contains, besides the getter and setter for .elds, the signatures of all the method declarations of the traits (i.e., both provided and required methods).

the interface also implicitly contains all the requirements of the corresponding trait.


Indeed, the patient s re.ective methods could themselves be the subject under surgery.

to support re.ection, we implemented a mirror-based architecture [1].


Each new pass, however, incurs overhead as the AST is traversed multiple times.

any overhead introduced by a generic-programming system is paid multiple times and should be minimized.


No matter what SP-HYBRID(right[X],Ui(4)) returns, SP-HYBRID(X,Ui) does not return Ui(4); it returns Ui(5).

the only threads that can be inserted into Ui(4) are descendants of right[X], which matches the semantics of U(4).


Subtyping As already commented before, the nature of support sets makes it natural to pass a type with a smaller support annotation when a type with a bigger support annotation is required.

we provide a rule that explicitly coerces terms We de.ne two new operations on contexts, G8 and G',which, together with the already de.ned G ' , will be important for stating the substitution principles for our language.


Out of the total 11.7M clients, we have .agged only 686,651 (5.87%) clients who fall into the above category.5 However, 51,864 clients among them were from the Self-Served LDNS group, out of the total of 166K such LDNSs.

the multi-host behavior is much more prevalent among self-serving LDNSs than the general client population even though our technique misses single-host NAT ed networks (which constitute a majority of NAT networks according to [4] although not according to [14]) and NATs whose all hosts have the same platform.


However, for this same reason, it is more di.cult to reason about the order of events in programs that follow a relaxed model.

adopting SC should improve the programmer s productivity.


This increased e.ort for the compilerleadsto reasonable compilationtimesinthecase of linear andquadratictest and trialfunctions only.

full iterated symbolic integration of element matrices at compile timedoesnotlead to reasonably shortcompilationtimesfor polynomial order larger than two.


The goal in using the classi.er is to label the supplied clusters according to what has been learned during the training process.

clustering algorithms are critical to the creation of training data during the learning process, and as a preprocessing step during the classi.cation process.


Inadequacy ranged from 12 to 86 percentage points for the di.erent systems.

we conclude that the MC/DC metric can be highly subjective as a test adequacy metric.


Moreover, while video streams will generally eventually use all blocks of the stream, we have found that only a minority ofVAblocks(e.g.,10%)areneededtosupport usertasks(e.g., manyprograms,drivers,and.lesarenever usedin the average execution).

vMTorrent consults a set of schedulepro.les associated with eachguest VM to determine the optimal streaming order -dependent on the expected execution pattern.


For example, while Boston Marathon explosions were going on, in April 2013, users rush to Twitter seeking tweets from the marathon location [2].

within a large project called Taghreed for comprehensive real-time and o.ine analysis and visualization for Twitter data (see www.gistic.org/taghreed), we are working on a module that aims to semi-automate the task of visually analyzing event-speci.c tweets, for arbitrary events, over the spatial and temporal dimensions.


This .ltered set is referred to as Pf (C) and represents every possible combination of services that suf.ces to restore the original data.

the minimal availability of data is the probability of at least one subset of services Sj .Pf (C) to be available.


n. Thus, MScala.React ~ u + u = 2u, MS I D-U P ~ c and MELM s ~ n. (b) Propagation phases that leave many nodes in C C unchanged are rare, meaning u .

c. (c) Propagation phases that affect the entire graph are rare, too, so c « n. usually, MScala.React .


|Tl| We de.ne the probability pl = n as the probability that the publisher lies in Tl, and p¯l = 1 - pl as the probability that the publisher lies outside Tl.

the probability .l(e) that a link at level l is traversed by an event e is n-|Tl| |Tl| .l(e) = pl(1 - µ¯) + ¯pl(1 - µ¯) (7) being µ the probability of a node to be a receiver for e, as we de.ned in Section 2.


If negotiations are active in the e-commerce, numerous negotiations will be made explosively and simultaneously, and so people won t be able to handle them.

to perform this task on an ongoing basis and efficiently, an automated negotiation system is absolutely necessary.


Hence, there is no way to know when to enter the epilog and begin draining the pipeline.

to consider an irregular loop as a software-pipelining candidate, the compiler must preprocess the loop so that each instruction can be safely over-executed.


That is, rank statements (for inspection by developers) in nonincreasing order of tls,s.

here treatment means executing a test that covers statement s, and control means executing a test that does not cover s. the linear model for statement s is Y = as + tsTs + ßsCs + es (6)  The coe.cient ts is the average treatment e.ect, that is, the average e.ect on test outcomes of covering s.Hence, it makes sense to use an unbiased estimate of ts such as tls,s as a suspiciousness value for s. Recall from Section 2.2.2 that model (5) is intended to include a set X of covariates that block all back-door paths in the causal graph between the treatment indicator T and the outcome variable Y .


FORMALIZATION OF THE RGPS FRAME In this section, a formal description of the RGPS frame is given.

rGPS-based requirements models can be represented in an unambiguous and machine-interpretable form, so as to promote tool support of the models.


In baseline Hadoop, the Reduce phase is much shorter than the Map phase for most of our MapReductions except ranked-inverted-index, kmeans, term-vector, and multi-word count.

pLB s contributions to Tarazu s speedups are less than those of CALB Shuffle-critical Map-critical and CAS.


For instance, as we show in Figure 4, we have one update in example.c with the syntax error (commit #2), and developers update this .le four times (commits #1, #2, #4 and #5).


In particular, some of these steps are complicated shuf.e operations, which can deteriorate performance considerably.

one of the keys to obtaining high performance is to merge these iterative steps to improve data locality and reuse.


(define cust (make-custodian)) (define (lots-of-work ) .... ) (parameterize ([current-custodian cust ]) (spawn lots-of-work )) (custodian-shutdown-all cust ); stops lots-of-work When a thread is created, it inherits the current custodian from its creating thread.

assuming that lots-of-work is not closed over the original custodian, (custodian-shutdown-all cust ) reliably terminates the task that executes lots-of-work no matter how many threads that it spawns, sockets that it opens, GUI windows that it creates, or sub-custodians that it generates.


Observe that this function can be freely used by attackers since it requires to provide the right constructor for some security level s and only authorities at that level must have it.

assignments of authorities to pieces of code must be clearly part of the trusted code.


Finally, there were a total of seventeen engineers that made commits to the binary.

our met rics for example.dll are: Metric Value Minor Major Total Ownership 12 5 17 0.41 4.


JPF drives the symbolic exploration of the execution space by trying to produce a string that matches the target searched sequence.

when the string variable added to the program does not match the pre.x of the target sequence, JPF can immediately exclude the corresponding portion of the execution space.


Nowadays, an increasing number of companies and organizations implement only their core businesses and use other application services over the Internet to support their needs.

how to ef.ciently and effectively select and integrate heterogeneous services on the Web is an important problem in the development of web services applications.


Instant messaging teams added their counterparts both on the remote team as well as their main team to their IM friends and used their tele-presence in ways similar to both of the above.

the students adapted and used the same communications tools they used regularly in their personal lives.


The different kinds of inheritance bring about the flexibility to reuse codes in classes, and make many previously designed codes easily usable in new software.

this methodology is welcome by many users who have already designed much code.


For example, a study on post-adoption assimilation of XP practices found that tool support facilitated sustained use of XP [27] .

the findings of this study could be interpreted in the following ways: (1) the purpose of this construct was to measure whether the use of tools (Agile project management tools, release management tools etc.,) had an impact on effective use of AMs.


In this work, we are interested in the design of fast hibernation and resuming schemes by exploring the system and application behaviors and the usage patterns of memory pages.

a classi.cation-based prefetching scheme is proposed to jointly consider the system/application behaviors and the usage patterns of memory pages, so as to minimize the time delays on system hibernation and resuming.


Throughout the prefetching, the rate can fluctuate as a result of an increase or decrease of the available network bandwidth.

the Prefetch WatchDog has to take care of the fluctuation in bandwidth.


Moreover, sensors and actuators are instrumented in the software system for adaptation.


In Figure 5, the .eld g has type D, and it cannot be shared, because in the A2 family,g might store an object of class E. When a view change is applied from the derivedfamily to the basefamily(for example, from A2!.C to A1!.C), an A2.E object stored in g would nothavea view compatible with the basefamily.

j&s requires that .elds with unshared types are masked in the sharing declaration.Aduplicate .eld with the same name for the shared class is also generated automatically in the derivedfamily.Forexample,in Figure5,itis asifthe class A2.C has its own implicit declaration of .eld g: class C shares A1.Cg { D g; } An instance of A1.C and A2.C contains two copies of the .eld g, each appearing as a new .eld to the other class.


The closer the value of Pcorr is to 1, the stronger is the linear correlation between the two variables.

pcorr =+1indicates perfect positive linear correlation between x and y.


The stochastic nature of the system and also all of the progeny simulations cause a severe load imbalance when each processor simulates many hundreds or thousands of runs in parallel.

dynamic load balancing strategies are needed to improve the parallel e.ciency.


Then, a redeployment action is needed in order to support the new session con.guration, and new .ows have to be set up.

the main problem addressed in this work is the lack of a generic conceptual framework for the design and the implementation of software architectures for collaborative ubiquitous systems.


Keeping track the private information .ow that could leak by code review takes a lot of e.ort, and prone to overlook.

we propose a testing tool to automate this tasks.


Even crashing is not guaranteed: out of 320 runs in which sampling spotted indx > a_count at least once, 66 did not crash.

c programs can get lucky , meaning that this is not a strict overrun =.


If t26 is fired, r5 and r6 are entered and the default state s17 in r6 becomes active.

we can say that s17 has t26 as an implicit incoming transition.


Since graphical layout information of SysML models is not standardized, maintaining this information requires a SysML tool-specific transformation.

our Java-based implementation used MagicDraw as a SysML modeling tool.


That is, we .rst compute a product of A and B to obtain a specialization C of the target B with respect to the domain A.

the automaton C behaves exactly the same as B except that it accepts only marked values that are also accepted by A.


However, JSPreventer may not easily execute Ajax applications on the faulty interaction sequences because a speci.ed environment does not meet speci.c conditions to reveal actual errors due to the potential faults.

we assume that an unexpected network latency [13] may make the potential faults executable.


However, these features were related to system speci.cations and system test items, and did not imply creation of concrete artifacts as core assets.

the project excluded the features of this layer from the scope of core assets.


Moreover, both coalescing and spilling can invalidate the live sets.

the interference graph builder must rebuild live sets before rebuilding the graph.


For the last constraint, we must encode the fact that we cannot add a pointer and a variable, thus v3 must be a scalar.

if p1 is de.ned as p1 = p2+v, then its region is given by the admissible region of p2 added to all the possible values of v. That is why we must consider the interval range of v. Before moving on, we draw the reader s attention to the abstract semantics of the free(v) instruction.


The average seek time is smaller at higher 10 concurrency levels since the disk scheduler can choose from more concurrent requests for seek reduction.

the run 8 time competitiveprefetching depth shouldbelowerinthese cases.


When we implement new language features, the (pre)compilation process we make becomes responsible for static semantic analysis of the new feature.

transformation modules need to perform checks and report static semantic errors if the new language element is improperly used by the programmer.


HC .state HA =.HC |complete .HA|complete .

for our programming language, the opacity relation implies observational re.nement with respect to traces or states, and either of these implies that the complete subsets of the transactional systems are in the opacity relation.


It is straightforward to check that the signature computed at line 3 belongs to [0, p · q - 1].

no reduction modulo N is necessary before returning S. Algorithm 1: Unprotected CRT-RSA Input : Message M, key (p, q, dp, dq, iq) Output: Signature Md mod N 1 Sp = Mdp mod p // Signature modulo p 2 Sq = Mdq mod q // Signature modulo q 3 S = Sq + q · (iq · (Sp - Sq) mod p) // Recombination 4 return S  2.3 The BellCoRe Attack In 1997, an dreadful remark has been made by Boneh, DeMillo and Lipton [BDL97], three sta.


Usually, a shape cannot be reconstructed from such a pattern.

a new technique that reconstructs the grid pattern using coplanarity constraints [Furukawa and Kawasaki 2006] is presented.


With the original implementation of FM, the aggregate would need to be discarded and a new one recomputed every time an update occurred.

delete vectors provide a low overhead alternative for applications whose data changes incrementally, such as signal level measurements in a coordinated spectrum sensing environment.


We improved this code generation process to be able to generate hierarchical architectures such as ARINC653.

this new code generator creates code and con.gures each level (partition and kernel/module).


Handling the .lesystem is important to allow a test generator to cover code dependent on .les, but that is not the only reason: In our past experiments on SF100 [8], we had incidents where several parts of the hardrive were wiped out during test generation by unfortunate sequences of calls and inputs.

we added a custom security manager that allows .les to be read, but not to write, delete or execute any of them.


For capturing each ontological model, SM uses the ORB bus, through IDL retrieve_Ontology() interface method (Schema 2), to access the specific mediator, retrieving its ontological terms.

the ontological model provides the main structure for dealing with domain ontology relationships.


Now, suppose that an atomic action comm is the result of the simultaneous executions of these actions.

communication between P and Q can be achieved as follows: () (P | Q)= send(1) |receive(d)= comm(1), d.Nat where .


Furthermore the outcome of our design process is focused on the definition of a high-level roadmap rather the technical implementation, which is a major concern of ArchPad s final stage ( Performing ).

we propose an adapted design process with focus on the roadmap definition as major concern and final outcome of the process.


In the preceding step, Algorithm 1 cached a True answer for the question of subtyping of the f and r types, which are essentially the declaring types of the f and r constructors in Algorithm 4.

if Algorithm 4 will check for co-variance of the objects generated by the constructors it will get the inevitable (tentative) True answer from the cache.


But if we set T to Double, then we have two con.icts: Integer ;: Double and Number ;: Double.

instantiating T with Number will satisfy more constraints than instantiating T with Double will.


Recursive Functions Concord and OpenCL do not support recursive function calls, and it is neither easy nor likely to perform well to work around this restriction.

we should reject any recursive functions that might be directly or indirectly called by code executed on the GPU.


The link must be removed if found to be stale.

a trace moving from the inactive to the active state must re-register its outgoing links, in case they have been removed as stale.


Without union, it would appear that there are multiple unrelated conflicts between the same characteristic comparisons.

the rule leads to a smaller conflict set and may point to relationships among conflicts.


FEATURE-BASED RE PROCESS FACTORY It should be noted that developing RE processes may not be targeted at just one software development project; organizations can use it to develop their own adaptive processes.

reusability and flexibility are the most prominent requirements in RE process development.


3.4 Call Node Recall that each node in the DIR is an instruction specialized to a set of local variable types.

call nodes represent a call site and a known set of parameter types.


The next statement TW := (TW & NN = 2) | (NN = 3); applies the Game of Life rules to create the TW Boolean array for the next generation.

any position where a cell exists in the current generation and has two neighbors, or the position has three neighbors, becomes true in the next generation.


However, they can be applied regardless of the way in which the three operations map, .lter and enum are intertwined.

they are applicable in numerous cases where the context imposed by Eq.


These functionalities do not use any module/kernel service and remain internal to the partition.

a failure on an intra-partition communication cannot affect another partition.


Consider further, a different method x2, which has the same identi.er x in another con.guration, is in a class without superclass.

x1 may capture a different method but x2 cannot.


Later on, as the meta-model evolved, it became apparent that the import/export service should be orthogonal to the meta-model and most important that the environment should support meta-model extension.

a .rst, extremely simple metameta-model was implemented, which, at the time, could represent entities and relationships (1998).


Moreover, each application may have distinct notions of what tracks they want captured.

starTrack lets applications running on a device indicate when tracking is desired by calling the StartTrack and EndTrack operations.


As a result, IR-based trace retrieval produces a list of candidate links, which has to be reviewed by a human who decides if a candidate is really a link or not.

the effort of retrieving traceability links can be postponed until they are actually used.


For the code sample shown in Figure 1, each iteration takes 0.26 µS and 0.33 µJ when executed at (1.55 V, 624 MHz).

dVFS cannot fea sibly be applied on a per iteration basis.


In VecImp, functions are also polymorphic in the context they are called in.

the signature of this dot instance is: float block [4] dot( bool block [4] current _mask , vec3 block [4] a, vec3 scalar b); As a more sophisticated example, let us reconsider the introductory example in VecImp (Figure 4).


Indeed, two advices executing proceedWithSubst clearly have a semantic interference since one of them will have its intended substitution overwritten by the other.

such cases automatically trigger an error.


Although the GPU takes advantage of multithreading to hide memory access latencies, having hundreds of threads simultaneously accessing the global memory introduces a high pressure on the memory bus bandwidth.

reducing global memory accesses, by using local shared memory to exploit inter-thread locality and data reuse, largely improves kernel execution time.


It is, however, not a simple task to build low power consuming applications because of the heavy use of many power consuming features of mobile devices such as the screen to display maps, the radio to receive and send data, or a built-in GPS receiver for positioning.

to minimize the power consumption, an application has to take great care in how it uses a devices features, especially if the application is to run continuously.


Instantiations, as well as modi.cations of instance values, are also indicated by the fUML virtual machine using dedicated events.

when an imported class is instantiated (or an existing instance is modi.ed), the integration layer may instantiate (or modify) an existing instance using the actual external library accordingly.


However, an actual re-engineering of the systems towards reusing subsystems still seems di.cult.

the focus of reuse opportunities in this domain lies more in guiding current and future development towards a better alignment and systematic reuse of subsystems.


Since bound variables are visible throughout the entire body in an mdo-expression, allowing repetitions is much more likely to cause confusion.

we disallow shadowing in mdo-expressions.


The revision #148 was also committed on Jan 22, 2008 by the author srowen .

it is likely that the revision #148 is linked to bug #18 (we also checked the source code and confirmed this link).


2agnostic regoins for data-parallel sections of code once and share the compiled region with all threads that pro.led the code region (see 3Our approach builds on @ and extends it to compile thread @ in Figure 1).

the pressure on the underlying JIT compiler is reduced and translations become available instantaneously to all threads that execute the same region as soon as the .rst of a number of identical regions has been compiled.


However, in a related technical report [Barth 2008], we .nd that over the past year, the rendering engine components of popular browsers contained more complexity and had twice as many vulnerabilities as the browser kernel components.

tolerating failures in the rendering engine will likely provide much of the potential value.


A garbage collection may be triggered when the buffer overflows.

using an SSB write barrier introduces additional garbage collection points at pointer stores into heap objects.


State-of-the-Art: Utilization-based Modeling The large body of work on power modeling for desktops, servers, and more recently for smartphones are based on the utilization-power-state correlation assumption stated in Section 2.

their designs all use the notion of utilization of a hardware component as the trigger in modeling power states and state transitions.


If the quality of the generated trace links is low then the quality of the results produced by applications consuming these links is also reduced.

an important value consideration is how much is good enough [3]?


the RAM consumption for the ELF cleaner is fairly low: typically fewer than 10 bytes without defragmentation, and fewer than 40 bytes when defragmentation is required.


In addition to all of the above, Flash devices map reads/writes from the OS to read/erase/program operations that are supported by the Flash chip.

the timing of OS read or write operations varies signi.cantly from request to request depending on the size and the address of the request.


For other programs, the misspeculation rate is less than 1%.

misspeculations have little impact on the performance.


In particular, first cs represents the .rst element and is demanded twice, each time giving the same result, but no other element is demanded.

dup_first_coin produces two results, [0,0] and [1,1].


Alternative access patterns, such as a shared .le pattern, may alleviate metadata bottlenecks but inject arti.cial synchronization into the application.

a unique data organization is desired that exploits the log like I/O behavior of performance analysis tools, allows for uncoordinated access to a shared .le from multiple processes, and tolerates lazy I/O semantics.


Therefore, both the LSVMs and NLSVMs sharing a physical core will still obtain the same amount of CPU time thus ensuring fairness; but an LSVM will be scheduled more frequently albeit with a smaller time slice, resulting in shorterCPU accesslatency forthe LSVM.

for an I/O-bound application, vSlicer gives thecorrespondingLSVM morefrequentCPU accesses each forashorterduration toprocessitspendingI/O activities, resulting in better application-level performance.


Because explicit substitutions have a delimited scope, they can only represent non-destructive update.

the obtained system models dynamic binding.


For example, more .negrained and frequent scheduling could bene.t a tcp extension by enabling prompt reaction to protocol state changes.

extensions encourage introduction of new hypervisor scheduling entities, whose resource usage must be monitored and accounted for.


Timing JavaScript applications in actual webpages is not trivial, because too many factors, mostly related to I/O operations, have an impact on the runtime of these programs.

we chose to use three well know benchmarks: SunSpider, Kraken and V8 in our experiments.


Consequently, the read-before-write rule doesn t work: because most writes to a page don t fully overwrite the page, the program can read data from the page that isn t satis.ed by a recorded write.

memory is pruned slightly more conservatively: all accessed (read or written) pages are included in the initial snapshot for the VM or process.


A foundational aspect of reliability is proper functioning of the services, i.e., lack of failures and behaviour according to the speci.cations and published policies.

trust assessment must also be based on dynamic assessment [9].


In the third option, the local bid is the lowest bid.

the number of the used VMs by the locally running applications is reduced and the new application runs using the local-vms.


In all cases, except one, we were able to prove exposure (the case is described in detail in [16]).

on our code base, the analysis achieves almost perfect precision.


This is a time consuming task as it takes an unpredictable number of turnarounds to re.ne parameters and run the test iteratively.

a desired functionality is automatic parameter tuning, which could enable processes to autonomously perform decisions on parameter tuning based on a given set of constraints.


Likewise, any node having only weak incoming links will phantomize.

all nodes in a garbage graph containing cycles must eventually be phantomized.


The tasks defined in the architecture specify run-time characteristics that can be used to evaluate availability on a task-by-task basis.

the availability RF depends on having an existing performance architecture analyzed by the performance RF.


They rather describe general rules, with constraints controlling when they can be applied and effects that specify, what will change once they have been applied.

declarative approaches can be used to automatically generate a plan from an initial state to a goal state.


When such a plan schema does not exist, a bottom-up strategy is taken, and as a result a new schema is built and stored in memory.

a plan schema is developed in the context of a speci.c programming language and paradigm, and is therefore based on some underlying assumptions about the decomposition method, the execution model, and so forth.


This conflict implies some code clones have a deleterious effect and others not.

the following question naturally arises: Which kind of code clone has a deleterious effect on maintainability?


Furthermore, the reference implementation [8] is limited to one PAP, PDP and PEP, making distributed evaluation and enforcement di.cult.

in this paper, we enhance the existing XACML reference implementation [8] by adding a collection of tree-structured PDPs to evaluate distributed policies.