After issuing an attack command to the Stratagus engine, the attacking unit pursues the target until coming into attack range and then continually in.icts damage on the target.

the fundamental decision that must be made at each point in time is which enemy unit each of our units should attack.


The o.ered services include helping people to maintain personal pro.les, to discover potential acquaintances, to .nd interesting topics, etc.

social links in microblogging also re.ect users real-life social relations.


Meanwhile, the single administration web-service is shared by all PTA-enabled e-Payment applications through common SOAP/UDDI bus, thus new PTA-enabled e-Payment applications can be plugged into the bus and use the administration web-service.

the scalability of the administration web-services is guaranteed.


However, commercial compilers still cannot always use the opportunity to improve performance of an application on a SIMD processor by automatically generating SIMD instructions and permutations.

when code ef.ciency is required, it has to be written in assembly language or with compiler builtin functions.


Typically, the internal structure and the behavior of the components are hidden to the system integrator and the required component behavior is unit tested right after delivery.

an integration test of a telematics system is usually based on requirements documents that mainly describe the component interaction and communication and which are in our case MSCs of varying quality.


At the moment, the Contribution Patterns are work in progress.

in this section, we present them only as proto-patterns, with a name and intent.


For example, certain disassemblers make explicit the size of the various operands, while others do not.

we process the output of the various off-the-shelfdisassemblers through a normalization routine, to remove the aforementioned differences and to make their output easily comparable.


Let fBCD denote provability in the Barendregt, Coppo, and Dezani system [1], and Iel be the pure .-calculus term obtained from e by erasing all types occurring in it.

if fBCD m : t, then .e such that f e : t and Iel = m. this sub-calculus solves a longstanding open problem, that is the definition of explicit type annotations for .-terms in intersection type systems, without any further syntactic modification.


2.3.2 Star.sh Central Service The Service is a central process whose main responsibility is to memoize function calls for future use by the Star.sh Legs.

it is important to remember recently performed function call arguments and outputs.


Another essential part of templates is their ability to provide abstraction without performance degradation: templates provide suf.cient information to a compiler s optimizers (especially the inliner) to generate code that is optimal in both time and space.

templates have become the preferred implementation style for a vast array of reusable, ef.cient C++ libraries [2,6, 14,20,32,54,55,65], many of which are built upon the Generic Programming methodology exempli.ed by the C++ Standard Template Library (STL) [42,60].


These uncoupling e.ects minimize the expenses of sporadic unreachability or unavailability during data communication through wireless networks.

the e.ciency of the proposed mobile cloud computing architecture improves.


The remainder of the instructions are the ones that do not depend upon any updated value.


Hence in expectation at least 5c log n/9 players in A1 are assigned to probe object o.

with high probability, the majority of players probing o are in A1, and hence the dishonest players have no impact on the prediction.


Developers might discover some information but not realize it is important enough to read carefully.

in addition to studying what questions a developer seeks to answer, we can also study what questions a developer should have been asking to have more quickly focused on the necessary information to obtain.


5.2 Implications for research/practice (RQ3) Based on our review, we identi.ed the following implications for research and practice: More empirical research needed: Our review revealed that return on investment numbers for scenario-based methods and architecture-level metrics are currently missing.

one direction for future research is to conduct more empirical studies addressing this issue.


In the following, let n be the maximum number of honest nodes in the system at any time and let En for some E< 1 be the maximum number of nodes that the adversary can have in the system at any time.

the adversary has bounded resources, but apart from that the adversary can do what it likes, such as choosing any names it likes for the data items and the nodes.


The size of the large bufferis the sum total of the individual channel buffers, i.e., no sharingbetween channels is performed when allocating them in the same buffer.

the number of buffers in the StreamIt program tends to be less than the number of actors.


HAL API gives an abstraction of sub-system architecture to upper SW layer (application SW + SAL).

when exploring different sub-system architectures, e.g.


It merges channels with high frequent interactions into one overlay and builds bridges between the channels with less frequent interactions.

in successiveor multi-channel watching, nodes can stay in the same overlay or take the inter-channel bridges to join in a new overlay without relying on the server with high probability.


For example, B2 identi.es subscription  -3 si = [NO2 > 40µgmAND 45.81 < lat < 45.82 AND 15.96 < long < 15.98] as a subscription potentially matching future publications of P2 .

b2 sends a message subscribe to activate si on MB1 .


neededSyncs(c,v):- syncs(v),vPT (c,v,ch,h), escaped(ch,h) Notice that neededSyncs is context-sensitive.

we can distinguish when a synchronization is necessary only for certain threads, and generate specialized versions of methods for those threads.


* Coordination information is available to a developer only when they themselves: (1) attempt to lock an al- ready locked artifact, (2) must merge an artifact, or  (3) make an explicit request.

in- formation flow is irregular, limited to the particular artifact at hand, and typically out-of-date with respect to the actual state of the other workspaces.


In particular, the dynamic analysis tool has proved its value for system analysis and system understanding.

we are con- vinced that analyzing and visualizing the dynamic behavior of telecommunication systems is key to system understand- ing.


In the context of a representation system R, universal R-solutions are the preferred option as they are able to exactly represent the spaces of solutions of the source data.

to show that positive conditional instances can be used in practice, one needs to develop an ef.cient algorithm for computing universal Rpos-solutions.


Various modelers may have different ways to interpret a model.

different developers may program interpreters in various ways in order to achieve the same behavior.


The picture shows that the c part can be shared when computing d and i even if cx and cy are not the same constructor and copying is not possible.

we de.ne a table type DiffT where the cc always contains three subtables.


Attributes of MMElements are not mapped, because they are considered inseparable parts of MMElements, and are treated like that.

all types of rules used to transform MMElements have an option to include the attributes in one of the prede.ned ways (for example, attributes could be visualized in a rectangle which is connected to the node representing the mapped object, separated by horizontal lines and sorted by the name of the attribute).


Firstly, concerning the JML model class library, there are a large number of interdependent classes, which also contain a rich JML specification.

even if we make use of only the simple model class of this library, one typically ends up depending upon many others, and the verification conditions being generated by ESC/Java2 for the underlying Simplify theorem prover grows exponentially in size and complexity.


The drawback of this approach is the additional number of edges that a peer must support.

an alternative is to construct additional graphs for social structures such that only those members of the social structure are connected in the graph and the AOI of each member is suf.ciently large to cover the entire membership.


If a region is inside a loop body, then recompilation maybe triggered many times.

we only either include the loopas awhole in a region, or exclude it entirely.


In our case study, each object allocated in the base program is stored inabuffer.

deferred analysis may possibly increase the lifetime of each allocated object.


Predicated register files exist inside the RFU for storing predicated values.

loops containing conditional statements are supported by the CGRA template through the if-conversion process [16].


In any case, the phones retrieve the location information as needed by the application.

the global schema for this prototype contains the following two additional relations (which are also the only ones accessed by the application): Map (containing the map information)  Position (containing ID and position of devices)  The global and local schema for the map information are identical and there is no materialized local schema for the position information.


, c ' such n that the local states at cm and c ' are identical.

n ' .st the state c can produce unbounded send n E ' .st sequence for P and the state cn P of P cannot consume the ' .qu messages in its receive queue cn P , or can consume all the messages in its receive queue but ends up in a state which ' .st does not send-simulate cn P .


On the other hand, they usually rely on custom-tailored, verbose languages.


We assume that HASH_1 actually contains the bytes of INST_A, and the address speci.ed by SEQ_2 lies somewhere within the encoding of HASH_1.

transferring control to SEQ_2 should yield the execution path in SEQ2 on the right-hand side.


Ecore has been used since it is the prevalent meta-metamodel in MDE and since it comprises the core concepts of semantic data models [9], being classes, attributes, references and inheritance.

the proposed classi.cation can also be applied to other data models comprising these common core concepts, e.g., OWL4 .


UML2 meta-model -Class snippet The UML2 meta-model implementation, that we base our analysis on, is imple mented as an EMF Ecore model [9].

uML meta-model elements are Ecore EClasses and the meta-model relationships are represented by EReferences.


The allocator needs interference information for these ranges before it can safely allocate physical registers to them.

at the end of the spill phase, the algorithm rebuilds the interference graph, re-running the algorithm in Figure 4.


This example, orginally introduced by Lempia and Miller in the FAA Requirements Engineering Management Handbook [12], is also being used by Blouin to illustrate the AADL Requirements Annex [3].

the work in this paper contributes to what we hope will eventually be an end-to-end illustration of AADL-based development using the Isolette example.


The dynamic parts of the pointcut, the residue, may evaluate the pointcut to false at runtime.

aJDT might statically annotate operations in the code with advices while these advices might not execute at runtime.


In contrast, the transfer of real money is considered to be a critical action with high consistencyrequirements where no inconsistencies are tolerable.


By preventing the creation of NULL references, there is no need to perform a NULL check on the use of a reference.

unlike raw pointers, which must be wrapped using smart pointers, C++ style references are allowed in Ironclad C++.


The integration language supports heterogeneous composition of components implemented using Bond Graphs and Modelica.

it should characterize interfaces in terms of the commonalities between the supported modeling paradigms.


The only deviation is our treatment of external variables: when the type checker sees a free variable not found in the type environment, this variable is assumed as external and added to a special type environment Typing.extenv for external variables.

they need not be declared in advance: their types are inferred just as ordinary variables.


Thus, instead of randomly choosing replicas for transaction execution, we assign transactions to preferred servers based on the transaction types, their parameters, and their con.ict relation.

we reduce the number of certi.cation aborts.


E.ciency of a cache solution heavily depends on the context characteristics.

when a cache is needed, it is usually built from scratch.


Moreover, our helper threading is specially designed for loops with contiguous I/O accesses.

we do not require any support from a pro.ler or the operating system.


They are higher-level abstractions that combine mutual exclusion and synchronization.

it is not realistic to extrapolate the results of this study to other lock-based approaches.


Dynamic replication of back-end databases is an open research problem.

most dynamic replication techniques in the literature, including this work, assume that the database is suf.ciently well provisioned and does not become a bottleneck even during overloads.


Each of these actions is specified using one behavior diagram (which in turn may apply additional diagrams for subactivities).

within the resulting overall specification each aspect of the system is specified by exactly one diagram and it is absolutely clear how these different diagrams are related to each other and how they form the whole specification.


A .ow-insensitive analysis produces only may alias information and not must alias information.

an analyzer that directly uses the results of a .owinsensitive analysis must use weak updates to handle assignments and operations via a pointer.


Moreover, we need to adapt our approach to use other JVM-languages.

this allows us to go beyond the traditional refactoring approach in order to propose refactorings between languages.


The three Mozilla bugs can be triggered with the same input and source code.

we only present one number in the table.


If, however, a spill load is inserted, a new instruction de.ning T will be inserted just before I.In both cases, remember that our algorithm updates interferences before inserting the spill instruction.

since the algorithm adds all the de.nition edges of D to T, the absence of (T, L) and Invariant 1 implies the absence of  in the graph and that L was not live at the de.nition point of D. L must have been killed (i.e.


Such assignments potentially violate invariants depending on these .elds.

these invariants must be visible to the clients in order to prove that they are preserved.


Many such simultaneous tasks reading small amounts of data can exacerbate the e.ect of disk seeks on several hosts where its inputs are present.

taking care that a task reads large and contiguous chunks from every input source results in its total input size becoming large.


This example illustrates the design options that must be taken into account during the development of the game.

a methodology must be user-centred and incorporate design space.


Indeed, [4] established that t-resilience can be reduced to wait-freedom.

the two models are uni.ed with respect to task solvability.


Deliverable evolution reflects focus shifting against different perspectives with emphasis on different things.

we can write software documentation that accompanies computer software across the software development process so the staged products correspond to the document that describes the perspective view.


Its sheer volume makes finding important information about its behavior a difficult task: the IDA Pro disassembly of the worm contains 15,373 instructions, which constitute 350 pages if printed out single-spaced at 44 lines per page.

in order to exhaustively analyze the worm, the analyst must in theory undertake reading a full novel s worth of disassembled binary code!


According to some impression we acquired in the story telling session, we found female developers expressed more complaints at the beginning stage of penalty policy.

it may take longer time for the female developers to adjust themselves.


For example, in our RailCab use case, operating in a convoy requires 1http://www.railcab.de  one RailCab in the convoy to serve as a coordinator providing reference speeds and positions to the other convoy members.

this particular RailCab has to communicate with a set of other Rail-Cabs changing during run-time.


In addition, because they encapsulate the operating system (including compilers) on which the simulation framework runs, they may allow older codes to run despite updates to the host software environment.

a paper itself may survive decades of change to software encapsulated by the virtual machine, provided there exists a hypervisor to run it.


Following this, co-simulation and the support of reusabil ity seem to be two integral aspects in the automotive de velopment process.


Alternatively, the presenter can take screenshots and place edited pictures into the presentation s slides (or prepare a movie) to show only the relevant pieces of information to the audience.

the presenter must spend significant time and effort to prepare for a presentation.


Hierarchical Scheduling Because testing non-interference of tasks is a pairwise operation, scheduling n tasks can require O(n 2) tests.

a scheduler that must globally consider all pairs of tasks will be impractical for large machines and large numbers of tasks.


However, some nodes (volatile Loads for example) must never be in the intersection of overlapping patterns.

the pattern matcher has to reject such matches, if the critical node has multiple predecessors2 .


Units use identi.ers and names to distinguish internal and external names, similar to modules.

the a-relation for units renames imported and exported de.nitions inside of the unit by altering only stamps.


The long-running, asynchronous nature of SOA application processes exacerbates problems of multidatabase transaction management.

the traditional notion of transactions has been augmented to address problems of SOAs [18, 17, 8, 12, 4].


Significant over or under-estimates can be very expensive for a company.

it is paramount for the competitiveness of a software company to be able to effectively predict in advance the effort required to develop a software project.


No central list of potential con.icts exists, and these are only seen for the focused element.

tukan is better suited for .nding partners for collaboration while programmers are browsing the software.


The reason is the same for both cases: more time is comparatively spent on arithmetic operations.

compile-time specialization, which evaluates many .oating-point operations at compile time, simpli.es fragments of code whose execution would take a substantial portion of the execution time (compare the left and right columns in Table 2).


In fact, with the distribution of control among different classes, the object paradigm goes in the opposite direction.

an increasing number of developers have started to implement the control aspect within their applications with work.ow.


2.2 The Decoder Implementation While the denotational speci.cation makes it easy to reason about grammars, it cannot be directly executed.

we de.ne a parsing function which, when given a record representing a machine state, fetches bytes from the address speci.ed by the program counter and attempts to match them against the grammar and build the appropriate instruction abstract syntax.


= X:T and .i = X:i and S = T : * L G = i:*, 3:i, list: *r *,nil:.T :S.list(T ), cons:.T :S.T r list(T ) r list(T ) LL P = cons(T ) Xnil(T )and Pi = cons(i) Xnil(i) ' L P = cons(i)3 nil(i) denotes an applications of the polymorphic function (head) which takes as argument .rst the type i to instantiate into a list of integers, and then the singleton integer list (3) (denoted by the term P ) and produce as result the integer value 3.

the polymorphic pattern P denotes the shape of a singleton polymorphic list.


Figure 3 shows the structure of the network, with the two networks connected to each other via a serial RS232 link.

a mos_send( ) system call on the AMOS nodes causes the data to be transmitted over the radio.


Android apps, in comparison with desktop apps, have fewer GUI components on screen.

the probability of random testing to terminate an app, by accidentally pushing Back button or some other quit button, is relatively high.


We can see that if there is any change in mode (detected by the guard control connector), the control .ow .rstly disables the component corresponding to the old mode (the selector connector performs the choice according to the oldMode input).

the sequencer delegates the job to another controller pattern, called Strategy-ED-3.


Threats to validity: The selection process has been used in only one systematic review.

further replications are required to derive generalisable conclusions.


When a method is called, a phase change may happen while the method code is executing, and so after returning from the method, we may need to change the code version that is being used.

at the point after a method call, we want to make sure that we handle a phase change if one has occurred.


We would like to ensure that n1 s cost will not increase due to n s joining.

at the beginning of round t+1, both n1 s outgoing balance with respect to n and n s incoming balance with respect to n1 are set to B12.


(8)  If (Prl) is satisfied by any process in Y, then the theo- rem is clearly true.

we will assume, throughout the remainder of the proof, that there is no process in Y that satisfies (Prl).


The dataflow model has particularly managed to recapture the interest of the research community due to its ability to express parallelism efficiently.

a number of recently proposed hybrid parallel programming models combine dataflow and traditional shared memory.


The Global pop- ulation size is set to 200 and is kept constant as the number of processors is increased.

with an increase in the number of processors used, there is a respective decrease in the amount of work conducted per processor.


Li ai(t) = Li + t (4) Ti Moreover, according to the protocol, each type of traf.c has a dedicated window.

the service curve for each switch (SWk) is shown in (5), where the rate of the service is a factor of the network capacity C. The rate BW -I of the service curve is expressed as EC , where BW is the duration time of the dedicated window for the message, e.g., Local Synchronous Window duration time and I is the idle time that is used to prevent the overrun problem in the mentioned window, which is the size of longest packet among all messages in similar type as mi.


Third, not all tool downloads or usages are equal: downloads or usages by members of important customer companies are valued more by the target tool vendors than downloads or usages by others.

it is important to identify the organization af.liations of those who downloaded or used the tool.


for those prioritized via the sendAtFront API.

it is incorrect to assume that there is never any order between events.


Knowing the leader is a necessity, as the leader s virtual time will be progressing slower than any other process in the experiment.

we need to scale down the running time of other processes in the experiment accordingly.


Usually, such perturbations are not immediately recognized, hence resulting in severely increased runtimes.

in DynamicCloudSim the runtime of a failed task execution is determined by multiplying the task s execution time with a user-de.ned coe.cient.


Our debugging technique works at the system call interface layer.

we can only provide some suspicious system calls as the result of our technique.


Considering the number and type of events that can be requested and reported, the debugger interface is almost as powerful as the behavioral reflection mecha- n~r~ used in MOPs for Java [11].

one cou]d use this interface to implement more AOP features, for instance an equivalent of the cflov pointcut designator in AspectJ.


After an agent has found the initial set of cores for its application, it does not stop trying to increase the speedup of its application by acquiring additional cores.

at runtime of its application each agent sends requests for cores to nearby regions.


We specified a model to represent mapping guideline and mapping expression.

we tried to prove this model by the creation of a warehousing tool.


It will be invoked either from the DBChangesThread s run() method (see line 12 of Figure 3) or from the Java thread library, after a thread for an Examine job is started on line 21.

for purposes of our model, the run() method might be called from either a color environment including the DBChanger color or one including the DBExaminer color.


However, even then, ClientSetup is passed a window and a clock and, as noted in the description of Figure 2 in Section 2.2, neither of these can be null.

the needed methods are still accessible.


From the syntax q2 or q1 +of the constraint language, these constraints form a system of linear inequalities over rational numbers.

we can decide whether the constraints are satis.able or not.


3.2 Applications of LDA Once an LDA model is learned on a corpus, one can use the learned probability distribution over words ft to display a list of W words, sorted by decreasing probability, for each topic t. For instance, if topic 1 has high-probability words school teach student book , one can assume this topic to be about academics.

the semantic content of the entire corpus can be summarized by displaying these topics1 .


More importantly, the complexity of the two algorithms di.ers radically: RTA is essentially linear in the size of the program, while the points-to analysis is potentially cubic in the number of statements in the intermediate representation.

the techniques and results from [4] cannot be directly applied to the problem of estimating the run-time progress of the points-to analysis in Spark.


Furthermore, traces usually contain a special symbol, , to denote that some subexpression is missing because its evaluation was not required in the computation.

we will also accept expressions containing this special symbol (see below).


At the same time, some other node has a very high latency towards the event originator and this event is still in transit.

the joining node might receive a world state without this event from the high latency node without a chance to receive the event from its originator.


Postponing storage assignment to a later phase results in the scheduler making aggressive decisions about node placements on processors.


The run-time checks guarantee that even if a read-only reference .ows into a non-read-only reference, it is impossible for modi.cations to occur through the non-read-only reference.

javari soundly maintains its guarantee that a read-only reference cannot be used, directly or indirectly, to modify its referent.


Especially features like syntax highlighting and content assist are popular and expected by the users.

these features should be provided as early as possible in the process of sketching textual models (R2).


Observe that with the limitations of the mobile devices, it is not practical to run a testing tool directly on the mobile device.

the solution is to provide a strategy that allows the test to be executed cross-platform, i.e., in some way, the information about the execution of a given mobile application should be collected and provided to a testing tool which analyzes and generates reports about the coverage of the executed test cases.


Since in this experiment we are interested in how implementation structure a.ects MC/DC coverage, we are interested in a small test suite so that redundant test cases do not arti.cially in.ate the coverage measured on the inlined implementation.

in our experiments, we performed test suite reduction and we used a simple greedy method.


However, our model checking algorithm requires us to mark program states with necessary/su.cient conditions for di.erent initial states to satisfy di.erent initial formulae.

we extend their property automaton construction algorithm for our purpose as follows.


Arrays constitute an exception to this rule, as theydo not have a constructor and are initialized directly by the VM.

objects that are not passedtoanycallee depictedin Figure3areexclusively arrays.


Since, a vast number of equivalent mutants exist the application cost of mutation is escalated.

the criterion used to stop the testing process requires the identification of most if not all of the existing equivalent mutants.


However, in cases where a string literal was originally used to call a function with a Slice parameter, the Ironclad C++ code required more than the one implicit user-de.ned conversion allowed by the C++ standard [16].

we added an explicit conversion from string literals to aptr at each call site.


To determine the initial object, we use the coalgebra over algebra view, as categories of G-coalgebras have a trivial initial object: (0,0 G 0), where 0 is the initial object in the underlying category and 0 G 0 the unique arrow from it.

(in,µF,fan) with fan = N. in is indeed initial.


Currently, the Validation Framework is triggered manually from within the modeling environment.

the Validation Framework, calculates the changes and triggers the Validation Component of the framework.


(2) The admission control decisions made by ActiveSLA are steered by service-level-agreements and expected pro.t.

di.erentiated services, which are very important in the Cloud databases, are provided.


2.3.2 Operator Networks LUSTRE isa data-flow language: the input flowsofa program are transformed into output flows through a set ofoperators.

the most usual representation for LUSTRE programsis a directedgraph, calledoperator network.


When moving to such systems, resource allocation is no longer static and resources may not always be available for the entire lifetime of the job.

malleability [7], the capability to handle changes in the resources used during a computation, and fault tolerance are needed to successfully run parallel and distributed applications in these environments.


The abstract aspect, which can be reused being independent of applications, has to be specialized by concrete aspects in order to bind application classes to the roles of the intended design pattern.

at weaving time, an ad-hoc weaver can generate application classes that conform to the roles and behaviour de.ned by the abstract aspect for the given design pattern.


The scope of the core assets can and should be expanded after successful PLE introduction.

it is initially advisable to construct core assets for a limited number of features, for which earlier and higher results can be expected, in order to recover the initial investment as rapidly as possible.


Instead of using the actual garbage collection times, for both cases we idealized the garbage collector by using our lower bound on the last reachable time for an object as the time of garbage collection.

the bene.ts shown in the graph are independent of the garbage collection strategy (provided a tracing collector is used) and would apply even with a perfect tracing collector.


I for any given Herbrand interpretation I.

we come to a major result of the theory as shown in the next theorem.


It can be concluded, that the video content category also plays an important roll.

in football videos were obtained the lowest ratios, which mean the greatest di.erence, where ratio 1 and ratio 2 reach 70% and 54% respectively.


Even though not all departments have employees assigned, the IC only affects departments with employees (the others always evaluate the constraint to true).

we can use Employee as an alternative context for the constraint.


205 Instead of using predictive heuristics, existing compilers using iterative compilation optimize a program in many ways, mea- sure the quality of all the generated code versions, and then choose the best one.

iterative compilation allows for decisions to be made based on actual generated code rather than predictions of final code characteristics.


IDB and Rand each found 1 additional, distinct, bug.

these techniques performed similarly in terms of number of bugs found.


Information sufficient to make a learning order decision was not acquired; therefore, it was difficult to formulate the learning order.

we have proposed a method of extracting the depend-encies for any learners using sequential pattern mining.


As we seen, the application of Profile Analysis offers agent engineers an interesting tool to improve the comparison among different evaluations.

it facilitates the analysis of different evaluations looking for similarities which will improve the reliability of the results and thus make them more acceptable in the community of multi-agent researchers and developers.


On the other hand, using faster components or a larger number of resources may not be affordable due to cost constraints.

efficient design optimization techniques are required in order to meet time and cost constraints in the context of fault tolerant systems.


Also, they cannot provide real-time services such as intuitive route/shop navigation.

real-time and decentralized position estimation techniques that can work on mobile nodes would be expected.


We choose to not add peer testing to Assignment 7 because it is designed to evaluate all of the skills that each student has acquired over the course of the semester.

this assignment is completed individually.


In this paper we define a signal as a common concept for linking information between disciplines.

signals are not limited to electrical signal (wiring) in electrical engineering, but also in-clude mechanical interfaces in mechanical engineering and soft-ware I/O variables in software engineering.


3.1.1 Complexity In the following, we show that the decision problem that corresponds to the PSOOP is NP-complete.

we can conclude that PSOOP is NP-hard and it is sensible to apply heuristics to solve the problem.


Cloud computing platforms, both public and private, provide a new avenue for both small and large enterprises to host their applications by renting resources on-demand and paying based on actual usage.

a typical enterprise s IT services will be spread across the corporation s data centers as well as dynamically allocated resources in cloud data centers.


The remaining sum equals 0, by applying Theorem 1 to congestion games, which are known to possess a potential function.


Consider, for example, the following code:public class String { @Scoped StringBuilder data; int offset, length; @ScopedThis public String(@Scoped StringBuilder sb, int off, int len) { data = sb11.Our draft safety-critical Java API introduces a variant of StringBuilder that lacks methods to perform mutation on the contents of the character string array.

this implementation is valid as long as the StringBuilder argument resides at the same or more outer-nested scope level as the constructed String.


However, the ultrasound receiver and WISP platform introduce some error.

we use a linear model to correlate Sense WISP-to-transmitter distance dTi to ToA measurement results TRi .


Naturally, when .ltering a list, one expects to again receive a list.

list overrides filter to re.ne its result type covariantly.For brevity, List s subclasses, which implement this method, are omitted.For consistency, remove shouldhavethe same resulttype,buttheonlywaytoachieve this is by overriding it as well.


According to Tufte, only minimal contrasts between elements and ground are necessary to produce a visual hierarchy [16].

we have chosen 30%, 10%, and 0% tints to provide visual gradation in Figure 4.


Hence, a constant k> 1 would be suf.cient to prevent adaptive join-leave attacks of a constant fraction of adversarial peers.

it is remarkably easy to defend an open distributed storage system against even massive join-leave attacks.


In the scenario presented, the Use Google Maps is the most suitable alternative and, therefore, it is documented in the Decision field (see Table 1).

a design fragment for the Use Google Maps decision is produced and presented in the Design Fragment field of the documentation template.


AO-speci.c activities can be folded or completely expanded in the view of the history.

programmers can inspect the history in an appropriate intimacy levels.


Observe that the caseexpression introduced in the refocusing step (Section 5.2) is in lined twice in normalise4_cont.

the artefact obtained does not have the shallow inspection property because normalise4_cont pattern-matches on k at the inlining point.


Although collision detection does not involve the laws of physics, the collision resolution does.

collision detection is included as part of the COLLADA physics component.


It can be shown that f(x, y)= x/y satis.es conditions 1 and 2.

given any complexity measure with an upper bound, the measure ch(m)= cx(m)/cxM (m) is actually a cohesion measure, like the ones (NRCI, ORCI, PRCI) in [6].


Second, one crucial step in their proof replaces a recursive synchronous function with an equivalent automaton constructed using Parikh s lemma [26].

their analysis cannot be performed in an on-the-.y manner: the language-theoretic automaton construction must be performed on the entire exploded graph which can be exponentially large in software veri.cation.


This interaction pattern of splitting long-running operations into request and completion steps is typical for event-driven systems.

while current drivers do not fully exploit the advantages of the event-driven model, this style of programming is already familiar to driver developers.


As we will see later, this problem can be modeled with a quadratic function on binary variables.

it belongs to a broad class of problems called quadratic assignment problem (QAP) where the goal is to minimize the total pair-wise interaction cost [22, 24].


3.2 Relating Changes and Bugs Unfortunately, although bug information can be retrieved from bug databases and bug report mails as described above, there are only very few cases where the bug information contains exact speci.cations about which source code change is responsible for the respective bug.


This shows how to apply the extract method refactoring pattern directly on the code or on the model through the FiGA framework produce the same result.

the developers can modify class and activity diagrams to remove and add class and activity elements, and these model changes are producing .ne grain FiGA change operators that are capable of modifying the source code by adding and removing code elements at the level of single statements.


This capability of change is known as brain plasticity [15].

the proposed knowledgebased database system includes assessing the language network brain activation maps to track and document those observed brain changes related to language network activations.


General-purpose transformation engines, like the ATL or QVT transformation engine, do not support con.ict resolution.

different rendering alternatives can only be explored through manual modi.cation of the transformation rules by the designer.


If no template is available, the client library will autogenerate one based on the information that has been shown and listened.

client-side development only requires developers to create a template for the functions they de.ne in their program.


Thus, in each iteration of the parent scope °1, the loop node will be repeated 4 times.

the parent iteration ,2[0,2] itself must additionally be bounded by 1[1,2] (Multiple), 7Virtual unrolling is only feasible for loops that can be entered and left at all over feasible paths.


This decouples the service de.nitions and enables us to powerfully compose complex system behavior by joining separate, easy to understand services.

the join of the two services holds back the message m()until both messages m1()and m4()have been received.


When a user is about to install an app onto his Android device, this app will go through our bytecode rewriting engine (BRIFT) and be rewritten into a new app, in which sensitive information .ows are monitored by the inserted bytecode instructions.

when this new app is actually running on the device and is observed to send out sensitive information, this behavior (along with the program context) will be reported to the policy management service for decision.


Finally, in contrast to the previous studies that target multi-speed disks, our approach determines disk speeds statically for each application at compiletime.

it has practically no impact on reliability due to the frequent modulation in disk speed at run-time.


By induction on the thread evaluation relation (we only consider the most interesting cases): Case E-A: this rule is side-e.ect free so S l = S and T l = T .

it su.ces to show that E[pop.ae1[v/x]] is well-typed with the same e.ect as E[u], where u equals (vl v)seq(.a ) and vl is equal to .x.


Also indirect components of the prototype entity may be marked by "prototype parameter" attributes giving them identifiers which represent placeholders in the template structure and are translated to slot names when a prototype is instantiated.

in order to reproduce the template it s only needed to denote the prototype in entity structure and "fill in the gaps" corresponding to identifiers, thus avoiding the need to manually copy the template structure.


However, the synchronization overhead of this model can be signi.cant with a large number of threads.

an MT model with small number of threads should provide high throughput in SMP/SoC-based servers.


Model checking does not scale very well to large models.


With this pattern, the template compiles and can be maintained independently from the code generators.

the automation template developer can maintain the automation software without the need to work with MetaEdit+.


[17], who noted that a minimum number of points (i.e., flows) need to be sampled from each cluster in order for those clusters to be recognized by the clustering algorithm.

if the sampling rate is too low, then there is a high probability that an insufficient number of flows will be sampled from a small cluster.


The solutions occupy a narrow section of the solution space.

from the graph we predict that the requirements values for today and for the future graded by the stakeholders have a strong correlation.


Recording and replaying all of the messages provided by the loggable is not efficient, practically limiting the use of logging to short-term collaboration sessions.

we use a technique to reduce the log size (and thus the time to replay it) to order of the number of state objects of an upto-date software component [6].


Namely, by using f(·) instead of prime representatives, Equation 4 becomes ai-1 ai = f(ßi-1 mod N) (this is actually performed by cut ting the last 14 bits of ai and comparing the result with the ai-1 SHA-256 digest of ßi-1 mod N).

tverify =(o-1 + 1)(t1 + t4), (7) which is also not dependent on n. Table 2: Actual values of the complexity measures of our scheme (computed with the derived equations) for various values of o =0.1,0.125,0.3,0.5, .


Sensors: The N900, like all commercial mobile devices, tightly integrates its built-in sensors with the central processor (the OMAP3).

it is very difficult for a peripheral processor to access the built-in sensors without waking up the central proc-essor, violating the hardware requirements of Reflex as outlined in Section 3.3.


Though there have been advances on automated test case generation, tools remain unable to achieve high coverage in all cases [28].

we used the human-designed test suites (that are provided with the four programs we studied).


Using simplifying axioms alone on m produces only a 0.6% speed-up.

the optimizations learned from either training set lead the optimizer in the right direction, and the remaining axioms simplify the resulting expressions into the fully optimized m. These .ndings show that our technique can be e.ective at cross-training even on a small training set.


Any language used to discuss, describe and analyze another language is a metalanguage [8].

a metalanguage provides a formal structure for writing programs, called metaprograms.


For a smooth migration of ongoing connections between di.erent access networks, make before break scenarios in environments which are characterized by overlapping cells should be supported.

the use of multiple modems and network adapters in parallel is mandatory for such a scenario.


Additionally, such a tool must run with suf.ciently low overhead to be enabled during production deployment.

it is crucial to reduce overhead costs and in particular, it is vital to be able to obtain allocation context cheaply.


Moreover, as pointed out in [1], this is far too permissive and does not provide appropriate schedulability analysis techniques.

if the sporadic approach is notpossible or too pessimistic, the only remaining solution with RTSJ is to schedule the task in the background.


We show that the corresponding synthesis problem is NPcomplete in the size of the state space of the given model for adding fault recovery.

we propose a set of e.cient heuristics to cope with the exponential complexity.


(pc, pc ' ).l if l is written between pc and pc ' , equivalently, if l is written on some edge that is both reachable from pc and can reach pc ' .

we perform the following intraprocedural .xpoint computation.


RegionshavetwousesinZPL.Thefrstistodelarearrays.Forexample,thefollowinglinesdelaretwoarraysof integersovereahofthepreviousregions: arAB:Rintr A2B2:R2 intr TheseonduseofregionsistoprovideindiesforZPL's arrayexpressions.Forexample,onsiderthefollowingode fragment: R A:= R2 bin A:=Indx1 A2:=2A nd R B2:= Thefrststatementassignsthevalue0toelementsofA.

sineitispreededbytheregionsopeR,allelementsofA willbeinitializedto0.Thenextlineopensanewregion sopeR2,whihspeifesindiesforthetwostatementsthat itenloses.thenextassignmenttoAmodifesonly thosevalueswhoseindiesarespeifedbyR2.thosewhose rowandolumnindiesareodd.Thesevaluesaresetusing theimpliitarrayInd x1,whosevaluesequaltheirindies inthefrstdimension.Thenextstatementreplaeseah SimpleAssignmentPartialredution Transpose ZPL:RA:=B 1n1B:=+««RA RA:=B Indx2Indx1 doi=1n doi=1n doi=1n Bi1= doj=1n doj=1n doj=1n F77:Aij=Bij Aij=Bji Bi1=Bi1+Aij nddo nddo nddo nddo nddo nddo Figure2:AnexampleofthewayinwhihregionsemphasizediferentarrayaessstylesInZPLthethree statementslookquitedistint,alertingtheprogrammertothediferenesintheirparallelimplementations Byontrast,thestatementsappearmuhlessdistintinFortran valueofA2withtwieitsorrespondingvalueinA.Note thatthefnalassignmentisillegalbeauseitreferstoB2 usingindiesnotinludedinitsdefningregionR2.


But, our comparison is a first observation.


We traverse the cost graph from step 2 to step 4.


While these studies confirm that the integration of human factors in prediction models is worth studying, success in the use of some metrics was inconsistent among these studies.

we decided to investigate some of these inconsistent metrics and also to propose other metrics that have not been used in the context of issue lead time prediction models (i.e., developers past performances) to confirm (or not) their effectiveness.


First, we assume that application scheduling and submission of reservation requests are instantaneous.

the reservation schedule does not change while the application is being scheduled.


In those cases where the parameters of the system match the user s objectives, direct manipulation approaches with instant feedback may be the right approach to explore the space of options.

most of the systems, which can bene.t from AR NAU L D, use large sets of parameters, and the parameter semantics is often complex or unintuitive.


we proposed two formulas of moderate sizes that bound X from two sides.


Re-entry must still be disallowed until all threads exit once.

additional data structures record whether the trace belongs to the current generation or to the old generation.


However, the emergent ensemble of system components (software and hardware) cannot always be planned in advance let alone be subjected to traditional integration testing.

the question of how to make sure that interacting components actually fit together correctly at run-time becomes a crucial question for the whole paradigm.


In that type of implementation, it is very dif.cult to implement a roll-back approachfor transactions, perhaps impossible to do so without introducinglocking overheads that would substantially perturb execution predictability.

we have adopted a roll-forward approach inwhich a method that is reachable by ordinary threads must commit its changes explicitly in an epilog.


Not only is Mozilla multi-threaded, leading to non-deterministic allocation behavior,buteven slight differencesinmoving the mouse cause allocation sequences to diverge.

neither replicated nor iterativemodes can identify equivalent objects across multiple runs.


These two factors are directly correlated with VCPU credits and I/O blocking time.

they are used to derive the value for timeout t.  First, we de.ne credit-remaining ratio (CRR) for each group as credit remaining of each dom in the group CRR = .


Based on the analysis of this newly acquired information, a new generation of services and decision support systems can be realized, enabling more intelligent decisions, and ultimately a more e.cient energy system.

high-performance acquisition of smart metering information from large scale distributed infrastructures is of key importance for the upcoming Internet-based enterprise services and mash-up applications.


3.3 Policies Any scheduler that behaves di.erently based on whether a task is requested or disclosed is a batchactive scheduler.

there are many possible batchactive schedulers, such as using any combination of traditional policies separately for requested and disclosed tasks.


Many small files can be stored in place of one large file; therefore, the number of files stored increases as tpr~ decreases, but the utilization drops because large files are being rejected at low utilization levels.

when the storage utilization is low, a higher rate of insertion failure is observed for smaller values of t~i.


To effect the required controller interaction, we would modify this mutator method as follows: void setObjectname (String objectname) {  this.objectname = objectname; for (Listener l : listeners) { l.notify(obj); } } Notice that method setObjectname is automatically generated.

every time code re-generation takes place, this method will be created anew and any hand-made changes will be completely lost.


On the other hand, DR1 also states that the code artifacts contained in game.gui must respect some restrictions in order for the aspects in the screen size packages to work properly.

the three screen size packages package would depend only on DR1.


This is due to the employed tests which form a huge and comprehensive1 test pool [8].

it is expected that only a small number of killable mutants should be live after their execution with this test suite.


The row size of each cache and of each column is equal to the size of a memory burst.

con.icts may occur within the column but not between columns.


5.2 Organisational Changes As mentioned in section 3, one of the core motivations for taking a product line approach was the acute understa.ng of the two development projects.

the .rst step towards an SPL was to completely merge the two development teams.


Thus, properties event E0 and event E1 hold; which means that with probability p0 all correct nodes have rand = 0 and with probability p1 all correct nodes have rand = 1.

with probability p0 + p1 the beat is safe.


The same pattern as partial FCDG (a) t ..... Sapid ..... ./ ~ ..... 0 "-~ f ..... -7 dependence analyzer _~.Tlibr ary combinatian "1~ analyzer Ceaample searcher % J  FCDG DB Figure 2: experimental system exists mostly in the datab--qe.

the idiom (a) is a candidate of high level library [unction.


In our experience, PSE is not able to produce useful traces in these cases.

we limited each query to at most 50000 analysis steps (approximately 15 seconds of analysis time).


Even if this is the first remarkable example of this kind of development, it is an interesting change, particularly when bearing in mind that the Google Maps is the most popular service used in mashups, and it is widely utilized in other types of web applications, too.

this development may indicate a beginning of a new kind of emerging business model.


PRFJ detects this race condition by ensuring that whenever the .eld value is accessed, the lock on rootowner of this is held.

the access to value in the method setValue typechecks because setValue has a requires this clause, whereas the access to value in the method getValue does not typecheck.


A visible aspect is one de.ned by the weaving class loader or one of its parent class loaders.

advising a call made by b is allowed whenever la .lb .


This ADM process has allowed modernizing legacy systems such as databases to deliver its functionality in services manner.

databases can be integrated into SOA environments.


In particular, the styles and variants covered in the experiments remained simple in terms of declarative rules and classes in the associated framelets.

we envision that more styles could be added to ArchMatE without much difficulty in the future.


The running time of the two mechanism is configured the same.

39% more data can be accessed through TCNet.


An impacted method is a method where an aspect is woven.

a method is impacted if it includes a joinpoint shadow where an advice is woven.


grant or deny) and in a con.uent system this normal form is unique.

totality and consistency can be proved, for access control policies de.ned as term rewriting systems, by checking that the generated rewrite relation is con.uent and terminating.


In particular, any parameters to the algorithm are classical, as are the .nal outputs.

most quantum algorithms use some amount of classical pre-and post-processing.


Confusing inconsistencies and the feeling of losing control can lead to bad usability and low acceptance [34].

mechanisms to assure transparency and controllability of automatic interface adaptations are essential for the success of adaptive systems.


Figure 4: Overall branch coverage found by DART were spurious, i.e., false alarms.

in this experimental setup, at most one false alarm can be reported per unit.


This can be severe particularly for the arenas of variable length objects where reusing of deleted space is difficult.

during IELF writing, the live objects within an arena are compacted together.


Any descendent continuations from this stolen continuation that are marked as stolen in the template schedule continue to be treated as steals and get donated to the designated worker.

each overriding steal only modi.es, at most, one branch of the tree.


For all the queries, the coverage using the generated test database is always equal or higher than using the production database.

with less data (139 rows in the test database, 139,259 rows in the production database), the coverage is greater (an average of 86.67% and 57.33% with the test and the production databases respectively).


Moreover, this reinforces the fact that the distribution and persistence concerns are not completely independent.

careful design activities should have been performed before implementation, avoiding rework, although that was minimal in the reported case.


We want also to provide CHOReOS with the highperformance computing power available in Grid [7] and Cloud Computing [8] infrastructures.

the computationally intensive processes that will be required to serve millions of users issuing thousands of simultaneous service requests to thousands of services will be able to be processed by Grid and Cloud services.


However, in the past, the trustee team collaborated in another distributed project with another trustor team, which had been a failure.

they previously had a negative experience in such distributed collaborations.


While garbage collection was not a signi.cant factor in this study, it should be noted that these benchmarks may not be representative of typical Haskell programs.

it may be the case that other kinds of benchmarks would exhibit a larger performance gap between C and Haskell due to the differing approaches to memory management taken by the two languages.


For this reason, we add an extra argument giving its clock.

const# ic denotes a constant stream with stream clock c (clock(const# ic)= c).


Writing and reading requests are trapped by the hypervisors and properly handled.

this procedure introduces a delay on disk access causing additional processing overhead and memory page copies.


However, the service concept as it is used in service-oriented computing always represents an application service.

the first is more generic than the latter.


It has been shown that the number of affecting changes for each failed test can still be large in number [57].

various techniques have been proposed to localize failure-inducing changes more precisely.


For instance, an element of the type Software Element (from RefTEST) is Test Case .


From this point on, heavyweight lock will be used to synchronize this object.

the major cost of the subsequent contentions is the time spent on system calls to acquire and/or manipulate the heavyweight lock.


In order to facilitate information gathering, in Section 5 we described a scenario where the information was extracted from the version control repository, enabling the automation of this task.

future work will include automating this approach in terms of information extraction and PGT construction.


Si+1 means the behaviour of Si+1 contains the behaviour of Si.

before we discuss incremental construction in CBD, we have to .rst de.ne the behaviour of a system and the behaviour of an individual component.


If those effects were undone, the objects would have their .elds reset to the value before any initializers were run (i.e., zero).

an implementation must not undo effects on .elds of objects created since the action began.


The faster the fast variant and the slower the slow variant the larger the parallelization speedup.

we do not want to track any additional state in the fast variant.


Additionally, before performing an exporting write, register values are saved on the stack, and reloaded after exit.

as a part of .xing references to forwarding pointers from the stack, references from registers are also .xed.


Also, it is difficult to write code that can be interrupted at any time and saved to disk.

checkpointing is restricted to those points in the code where analysis can prove that saving and restoring will not cause problems.


Choices AC1 and AC2 guarantee the property P; AC2 and AC3 target the property Q; and R is achieved by AC4.


Moreover, we still have to pass the con.guration record explicitly from function to function.

there is still a danger of passing the wrong record in the middle of the code when several con.guration records are in scope.


Overhead computed for them is a penalty paid for having a secure platform and thereby a system-wide security guarantee.

it can be tolerable in situation where these criteria are of higher priority than efficiency of running programs.


Thus, our framework is based on the following assumptions: The composition is correct during design- and deployment-time.

development faults will not be taken into account.


This modi.cation ensures that any program path that contains XP is guaranteed to execute BBf and BBIPI , enabling the Value Modi.cation scheme.

if Nsucc is the set of successors of XP , the relationship is denoted by: pred XP --.


Thisprocess establishes a connection between the high-and low-level IR of the em-ployedWCET-aware compiler andtranslates worst-case executiondatafrom thelow-level to correspondinghigh-level constructs.

wCET information are made accessible tohigh-level analyses and optimizations.


A higher period will give the thread more time to do its work; at the same time, the higher the bulk size, the longer a request will take.

it is clear that the bulk size and the period are more correlated than initially thought, and as such, great care needs to be taken when con.guring (or choosing) the system components.


Although set-top boxes can store viewer-selected content through resources such as DVR (Digital Video Recorder), they are essentially largely under control of the system provider.

the system provider may use their resources as a way of extending the capabilities of the network.


In particular, EBNF can be seen as a DSL for declaring further user-speci.c language extensions.

we call such a language a meta-DSL [Erdweg et al.


Many of them index all N-grams in text up to a speci.c length and utilize them in their algorithms.

rapid access to N-gram frequencies has a signi.cant e.ect on application performance.


After the processing of Algorithm 3.3, we can obtain a retimingfunction, andthe minimum non-zero edge weight in the transformeddependencegraphbased onis equal to the cycle weight ..

the transformed loop is .-parallelizable.


The read or write speed of NFS is 15.2MB/s, GMFS is 26.9MB/s, and RAIF is 13.0MB/s when assuming that read and write are executed at the same frequency.

the throughput of the reading and writing of GMFS is 2.0 times compared with RAIF, and 1.7 times compared with NFS.


(Substitutability may be rephrased as reusability of contexts, in the sense that if some context is applicable to an object of one type then the same context is also applicable to any object of its subtype.)

design concerns about inheritance and subtyping relations are somewhat di.erent: it has to be taken into account, for inheritance, how new classes may reuse existing implementation and, for subtyping, how objects may be used in client code.


Additionally, it establishes a direct relation between an application de.nition and its OpenCL code.

an application may choose to customize and optimize its map and reduce functions further based on its shaping policy.


Additionally, the TraceabilityLink class includes another attribute for changing the default value of the link type (Value attribute in Figure 1), according to the value of the particular relation between two artifacts (SourceArtifact ID and TargetArtifact ID attributes in Figure 1).

if a value of a prioritized product requirement is assigned to a speci.c traceability link type,e.g.


This work can be an action or several actions to complete, this is uncertain.

no matter what kind of node in the process, we can regard it as a special kind of task nodes.


These operators can be seen as representing common faults usually found in software.

they are designed referring to the experience of using the target language and the most common faults.


A typical bandwidth contract is based either on average bandwidth usage over 5 minute buckets for the month, or on the 95th percentile peak tra.c usage in 5 minute buckets for the month.

depending on the speci.cs of the contract and usage in the month so far, it is possible to estimate the cost (in dollars) of sending additional bits across each link in the network.


It is not easy to change the habit or philosophy of these developers.

it is important to highlight how a new advanced technology relates to earlier approaches, emphasizing on complementary aspects instead of differences or total replacement.


We refer to all registers used exclusively by .oating point and SIMD instructions as FP-registers.

the value stored in an FP-register can only be moved to memory or a regular register by an FP instruction.


However, until now existing multi-agent frameworks have not provided the function to support a negotiation.

this paper has analyzed the attributes of a negotiation and then developed the multi-agent framework to facilitate the development of a negotiation system.


This is an assumption which is basic for the concept of incremeutal design.

we consider that, concerning the future applications, we know the set St={tmin,...ti,...tmax} of possible worst ease execu- tion times for processes, and the set Sb={bmin,...bi,...bmax} of pos- sible message sizes.


Such assumptions can be invalidated by subsequent changes in application behavior.

the runtime must be capable of removing graphs from the cache if one of their assumptions no longer holds.


Since we do not need thread stack, R1 is used to store the loop end condition in our code.

we are able to fully eliminate the register spilling.


[s](s) i. N [s]i(s) tions relevant to method parameters.

our tech [s* ](s) [s+ ](s) S nique is restricted to methods whose precondition has the .


One time unit corresponds to 0.5 milliseconds in the .negrained model.

10 milliseconds are captured as 20 time units.


The graphs compare performance of the SDT system by normalizing to native execution speed (i.e., no SDT system).

bars below 1 indicate a speed up, while bars above 1 indicate a slowdown.


By MPVD, each processor will be assigned 2 high-criticality tasks as illustrated in Figure 3a.

the Table I AN EX A M P L E TA S K SE T Task Ti Di .i Ci(LO) Ci(HI) ULO i UHI i t1 10 10 HI 2 3 0.2 0.3 t2 10 10 HI 2 3 0.2 0.3 t3 10 10 HI 2 3 0.2 0.3 t4 10 10 HI 2 3 0.2 0.3 t5 10 10 LO 7 7 0.7 0.7  low-criticality task t5 cannot be allocated to any of the two processors no matter how do we tune the virtual deadlines of the high-criticality tasks (since 0.2+0.2+0.7>1).


This in turn leads to broken edges when SplitEdge is retransmitted and causes two splits where only one can be satis.ed.

30 seconds after the congestion peak, Figure 6(h) shows a rapid increase in degree 9 nodes due to broken edges.


However, the evaluation of the described solutions provided by their authors is personalized and focused on the current context: the authors provide their point of view and outline the strong aspects of their solutions through a particular vocabulary/terminology.

it is di.cult, if not impossible, to evaluate and compare self-adaptive systems.


This evolved from the original desire to gain insight among several disparate information sources at a certain point in time, rendering an intermediary application into an aggregator of resources on the Web.

especially data-centric mashups provide realtime information at a single point in time, e.g., [29, 33, 36, 38, 41].


Eventual Strong Accuracy: For every execution, there exists a time after which no correct process is suspected by any correct process.

oP may suspect correct processes .nitely many times in any execution.


Instead, we employ numerical iterative methods such as gradient descent or Newton s method.

the attack begins with any random medium zs on the decision boundary (as in Kalker s attack) and calculates a start vector t0 = zs - y.


JSEF subclasses inherit the relationships defined in the par- ent class.

the Simulation class would maintain the re- lationship with the Dataset class it inherited from the Anal-ysis class.


There is still a need for programmers to understand what is happening in a three-tier program so that they can restructure the program to improve performance, either entirely by hand or just enough that the automatic optimizations work as intended.

our approach complements the work on automatic optimization of three-tier applications.


When broker Bi decides to add a new link connecting it with broker Bj, its decision is based on the last broadcast message it has received from Bj.

the recon.guration cycle R consists of the path the broadcast message was forwarded along and the new link that directly connects Bi and Bj.


Since the execution of the job set cannot be delayed over TB, the execution of at least one of the jobs that arrive before TB must be started before TB.

one intuitive method is to use the minimum of the latest starting times of these jobs as the LST for the job set.


But, statically locating all such updates requires precise alias analysis.

javaMOP only allows update events for variables of primitive types.


Each forwarding node sends its data to the .rst ancestor storage node on the path to the sink.

as our simulation and other previous research show, the radius (ri) of the area covered by the nodes that are i hops or less from the sink is proportional to i.Let ' ri this ratio be c= i , we can estimate the number of ' nodes whose distances to the sink are between (t -1)cand ' tc, i.e., the nodes with depth t.Let num(t)represent the total number of the nodes whose depth values are t, 2 '2 2 '2 '2 num(t)= .p(t c-(t -1)c)= .p(2t -1)c. For a node with depth of t,let s(t) be the expected hop distance to its closest storage ancestor.


The additional constraint corresponding to the id operator is thus simply: [ _* ] =.5 which is satis.ed by the same instantiation for .5 as in the original example.


In our traces, all objects that become unreachable between collection n and collection n + 1 die at the time when collection n+1 happens.

our traces are granulated: deathtimes are not precise, but rounded up to a multiple of the GC interval (rightmost column in Table 1).


In a case expression, the outermost symbol of the case argument is required.

the case argument should be evaluated to head normal form i.e., a variable or an expression with a constructor at the outermost position.


The behaviour of such systems tends to become very complex as more components are added.

while searching for errors, checking all situations that may possibly occur in the system becomes a formidable task.


Almost half of all requests to the Internet Archive are for ranges of data.

while we cache whole .les, we must assume that each request will perform a random seek to the beginning of the requested .le segment.


Within an active object, each do method thatis executedin a state,is encapsulated as a TBBtaskor aTBB taskgraphdependingonthe complexity of the method andits ability to beparallelized.

there arebasicallytwo sets of user-levelthreads, namelyPthreads andTBB threads.


The Metropolis-Hastings algorithm gives a higher preference to moving to nodes that have smaller degree (connectivity) than the current node.

this should balance out the fact that lower connectivity nodes normally have a lower probability of being accessed during a normal random walk.


But pure gossip protocols are inherently slow [4], which contradicts our low-latency requirement.

we designed a new gossip protocol, which exploits the fact that we have full presence information.


Speci.cally, if the number of observations at the .rst point is m, and there are n new n arrivals, the change in entropy is at most m log(2m) [2].

since we know the entropy (approximately) at the end of round i, and we wish to know if it changes by at most Et/2 (the minimum change needed to change the output of the coordinator), we can set Etm ti+1 = , 2 log(2m) where m is the total number of observations made at the end of round i.


Currently, we use the default First Come First Served (FCFS) scheduling policies for Torque/Maui, but the GRO C is empowered to set policies at its points of presence as desired.

the application manager is able to rely on the VO s GRO C to implement policies and preferences on how its available resources might be used by different members of the community, and to adapt these policies as the resource pool size changes.


The operation writePersistentObject associates an event stream with a location which is a path through the tree while readPersistentObject re.ects the values stored at that location into a stream.

referring to the draft-saver from section 2.3: writePersistentObject(draftBox.changes(), ["draft"]); saves drafts at the top-level .le "draft".


If s = 4, step 1 is performed on slice z, step 2 on slice z -1, step 3 on slice z -2 and step 4 on slice z -3.


Figure 5 illustrates the state of the history queues for such an example.

all of the tasks are in the barrier when the error becomes apparent.


Any relative URLs are converted to absolute URLs to ensure that links are not broken.

clicking of a hyperlink or submitting a form would take the user to the target web page.


CUMULUSGENIUS PROTOTYPE The complexity of the selection problem leads to the need of a software implementation that is fundamental to make CloudGenius applicable with acceptable e.ort.

we promote the CumulusGenius software tool [5] that fully implements the model of VM images, services and providers, as well as requirements and criteria.


5.4 Experiment 4 This experiment is designed to show how our trust framework can be used to improve download time when all three factors (speed, honest, availability) are considered.

we configure the data centers so that they have different speeds, with some data centres acting maliciously and others with a variable availability over time.


Fortunately, when b abandons c, the type-checker has access to the type of b.

provided the type of the adopter determines the type of its adoptees, this problem is solved.


The tag of the merged node is the bit-wise union of the tags of the nodes involved in the cycle.

the merged node (iteration block) may not exhibit very good data locality (in the extreme case, it can access all the data blocks manipulated by the loop nest being optimized).


Future Work required by each tool is not signi.cantly different.

we conclude that all the tools require equivalent user effort.


In the worst case, if there are no more iterations left to be allocated, then the thread Tj will keep spinning forever (in other words, it will enter a deadlock).

it is important to .rst scan the post wait array in the wait primitive.


tized, since it contains legitimate HTML syntax that should be written as-is.

the value of sms must be sanitized on line 4, just before it is pre.xed with the warning.


In contrast, entries in an event trace cannot be overwritten because all events from the beginning of execution are required for execution replay.

systems that collect event traces must use checkpointing techniques, which can introduce additional overhead [53].


This imprecise shape does not provide any information about the type of x or about the anonymous function s return type.

wob is unable to insert any coercion into the function.


Unlike the algorithm presented in the body of this paper, this approximation generates control values for individual function invocations fi.

the formal de.nition of control can be used to compute function averages.


The algorithms in Haskell stay close to their pseudocode counterparts found in literature, both in elegance and size, and even improve them with respect to generality.

the source code is considerably smaller than that of similar systems.


The constraint for each atomic operauser can return any value.

some of our tests may not tion of the trace is shown to the right of the operation; the be executable if the library calls always return values from TF is the conjunction of all constraints.


Note that this much bandwidth is also available between the L2 and L3 caches.

it is not necessary to block for the L2 cache to ameliorate bandwidth problems.


SYNCHRONIZATION IN DASA DASA [5] considers activities subject to step-shaped TUFs and concurrent sharing of non-CPU resources (e.g., data objects, disks) under mutual exclusion constraints and under the single-unit resource request model.


In trying to understand why agile is stuck, we first looked at the specific practices and concepts that made agile interesting, but now seem to be holding it back.

we think that it is now time to understand the underlying principles of Agile Methods, to determine the time, the scope, the means, and the extent of their applica-bility.


On the other hand the ditroff suite cost $4000 (a substantial sum at the time) but the software could run quite happily on the PDP 11/44 and PDP 11/70 machines we already possessed.

our decision in favour of the troff suite was con.rmed by simple economic considerations.


In most cases, there are an in.nite number of scenarios that require following a strategy to select the appropriate tests.

within the context of software development and testing, we extend the de.nition of con.rmation bias to include one or both of the following: (1) the tendency to verify software code and (2) the incompetency to apply strategies to try to fail software code.


A measure that agrees with the de.nition of the software attribute it purports to measure is said to be theoretically valid, and can be used and understood by researchers and practitioners.

only after rigorous de.nitions are available for software attributes will it be possible to run rigorous empirical studies that allow researchers and practitioners to assess the truthfulness of claims.


Tags nest using an acyclic parent-child structure.

a page s tags form a tree which is rooted by a top-level  node.


Many molecules contain cycles, which chemists call rings, and strings and trees don't contain cycles.

we took the unusual approach of evolving graphs.


embed t = Embed t unembed (Embed t)= t  4.5 Freshening and unbinding Unbinding is not quite as straightforward as binding.

given a term Bind pt, it is only safe to call open p t if none of the binding variables of p clash with existing free variables in t. before opening, we must .rst freshen p by assigning suitably fresh names to its binders.


have 10 attributes and to produce each entry of a publication record we encoded a message in a Bloom .lter of size 256 bits.

a message with a publication record of size 10 carries 320 bytes of extra information.


Another common vulnerability, cross-site scripting (XSS), is the second highest-ranked entry on the OWASP top ten security risks for web applications, behind injection attacks like SQL injection [29].

sQL injection and XSS have received a large amount of attention by the security community.


Finally, we assume that TrustGuard architecture is built on top of a secure overlay network.

the overlay network should be capable of routing messages despite the presence of some malicious nodes and ensure that all nodes can be identi.ed through some digital certi.cation based mechanism.


On average 41.3% of the sequences were detected as redundantly attempted, 27.0% were caught as redundant active sequences, 14.9% were discovered to produce identical code as generated by a previous sequence, and 1.0% were found to produce unique, but equivalent code.

over 84% of the executions were avoided.


Both are unde.ned behaviors and must not happen in a valid compiler test case.

for reducing compiler test cases, a delta-based reducer cannot rely on the compiler (the system under test) to detect when a variant is invalid.


A salient feature of our implementation is that it leverages existing technology for full-text search.

we are able to use any full-text search engine as a subroutine, to implement indexing and searching typed documents.


Data padding is applied in our technique to eliminate the cache interference, which overcomes the problem of cache con.ict misses arisen from loop partition.

our technique can be applied in architectures with low associativity cache.


These, however, are the bits that invisible watermarking algorithms seek to modify in order to maintain the imperceptibility constraint.

we can view the watermarking process in this case as the injection of noise into the data being analyzed.


asList employees) where (p(e)) [(name = e.name)]) A query expression query e asserts that e must be tame and must have .at relation type.

the predicate p which maps employee records to booleans must not have the wild effect.


In our factorial example, assume that the method is called to compute the factorial of 1.

the computation loop is not entered (the MUL bytecode is never executed), i.e., we have a sequential workload without any repeated execution.


An OS buffer cache keeps recently accessed .le system data blocks in memory.

future accesses to these blocks can be satis.ed from the main memory without long-latency disk accesses.


The MAP for Rocchio was 0.54 with a minimum average precision of 0.46 and a maximum of 0.66.

dQM provided 3% higher MAP, but again the di.erence was not statistically signi.cant at a signi.cance level of 0.05 with the t-test.


The domains of sum and product are 5 = sum = 195 and 6 = product = 9506.

the set x of PT is the union of binary coding variables of x, y, sum and product.


In addition, a string is very unlikely to be associated with an interactor if there is another interactor between them.

when building pairs of neighboring strings and interactors, the first rule checks for the presence of possible obstacles.


Similarly, when a method M has an event as a parameter, M is likely to be a candidate, since this usually means the method handles an event.

no-Parameter analysis for a given method M reports whether M has any parameters.


Except for scalar types, every object is declared to be of a type provided by an instance of a class template.

all components in the sys- tem have a uniform look and feel to the programmer, which is one of the goals of RESOLVE/C++.


Annotations represent a viable means to declaratively mark the data model in order to con.gure the collaboration engine.

the data model structure determines the quantity of required annotations.


If every tile in the assembly were represented by a different node on the network, it would be trivial to argue that the computation were discreet; however, since a single node on the network may represent several tiles, the argument has to take into account the fact that the node is not aware of its location in the assembly, and thus it does not know the location of the bits of input.

every node on the network may be aware of either some bits of the input or the solution, but not both.


After exploring the design space of the context modeling and making a balance between sensitivity, performance overhead, and robustness, we choose to model the context using parameterized source and sink pairs.

our approach ful.lls all the requirements: 1) actual privacy leaks are captured accurately at runtime, with the support of inserted taint tracking code; 2) the performance overhead of our approach is minimal, due to the static data.ow analysis in advance and numerous optimizations that are applied to the instrumentation code; 3) the deployment of our approach is simple, as we only rewrite the original app to enforce certain information .ow policies and no .rmware modi.cation is needed; 4) policy enforcement is context-aware, because the user s decisions are associated with abstract program contexts.


They argue that the model-based pointcuts de.nitions are less likely to break upon evolution because they are no longer defined directly in terms of the actual base code structure.

the fragile pointcut problem is transferred to a more conceptual (and probably more stable) level and turned into a synchronization problem between the conceptual model and the base code whenever this code evolves.


sound files, microphone, music CDs) through a Peer-to-Peer mode, or broadcasting on the network after trans-coding or compression [2] [3] [4] [5].

other users on the network can access and play shared audio-video files, without the need to download or store them [6] [7] [8].


However, providing access to these new features via the mobile, wearable user interface presents a major problem: the device was only designed to handle certain functionality.

the ability of the system to self-upgrade and self-evolve is severely hampered.


Thus we made the access to the contracted functions as cheap as if contracts had not been applied.

type checking with option contracts results in a reduced overhead even for type checking computationally intensive modules (on average less than 15%, see section 5 for details) while performing the syntactic, arity and dependencies checks that would prevent the discrepancies we discovered.


By nature, interrupt occurs at random time, and it will stop the current processing task and force the system to handle the external event at .rst hand.

it is hard to guarantee the real-time property when interrupt is extensively used because the property can be broken when an interrupt occurs during the time critical task is running.


Therefore, the relative order of the block frequencies in INIP(T) is usually not meaningful.

many of the well known techniques for comparing profiles that rely on relative order of the profile data, such as the weigh match and key match [19] and overlapping percentage [8], cannot easily be applied for comparing INIP(T) and AVEP.


However, there is no principled, general way to do so, short of revisiting the .rst design choice and involving the programmer.


Itis notpossible toinfer these valuesby either static ordynamic analysis, orby randomlyguessing.

our technique uses apre-speci.ed set of valuesfordatabase authentication.


It had soon become clear that in order to conveniently apply frame concepts to CAD product family, we need to decouple frame processor from COBOL and enhance frame concepts to address specific needs of our project.

we decided to implement our own language and tool, based on essential frame concepts, but free of COBOL inheritance and including extensions that we required.


Although concrete functional logic languages use sophisticated narrowing strategies to evaluate programs (Hanus 2007), narrowing derivations have a strong correspondence to rewriting derivations, i.e., each narrowing derivation usually corresponds to a rewriting derivation after applying the substitutions computed by narrowing.

if we approximate the call patterns occurring in all rewriting derivations (as done in the following), we obtain also approximations of all possible call patterns occurring in narrowing derivations.


The following is a sample optimal 2 × n matrix (i.e.

a sample numerically best real number erasure correcting code for 2 erasures) p 3p (2n-1)p cos cos ... 2n 2n 2n G = p 3p (2n-1)p sin cos ... 2n 2n 2n Note that when n is large, 1 + cos p f(2, n) = 1 - cos n p n 2n p the condition number of the worst conditioned sub-matrix of even the numerically best real-number codes increase to in.nite approximately linearly when the number of original data items (processors) n increases.


Moreover, the condition a = 1 and ß = 0 implies the system is always on the active mode.

in such case, the dropping probability PRED equals to the dropping probability of a packet in a TD router, PTD.


Furthermore, it supports variable values of k since it doesn t physically store the k-Buckets.

it always guarantees the probability to determine the user making the query is 1/k, even if the attacker knows the locations of all users.


Preemptive transactions resolve con.icts using LCM [7] (step 2).

fBLT defaults to LCM when no transaction reaches its d. If only one of the transactions is in the m set, then the non-preemptive transaction (the one in m set) aborts the other one (steps 15 to 26).


Round trip time over the Internet varies widely, but 80 100ms is typical.

sQL-CHECK s overhead is imperceptible to the user, and is also reasonable for servers with heavier traf.c.


(We also hope that reducing feature dependencies will make Grace easier to learn [21].)

in Grace it is possible to ignore static types completely, introduce them in the middle of the course, mix dynamically and statically typed code, or to begin with strict static type checking on day one.


Finally, it s possible for developers to unwittingly accept GET requests while thinking the data came from POSTs popular libraries such as Perl s CGI.PM module allow a developer to fetch a parameter without caring if it came in via a GET or POST request.

pOST requests could be converted to GET by the attacker, and the application action will still be performed [2].


In Atlantis, applications do not have to take dependencies on such opaque code bases.

in contrast to prior microkernel browsers, Atlantis is more accurately described as an exokernel browser [16] in which web pages supply their own library OSes that implement the bulk of the web stack.


For example, the concurrent execution of various processes can sometimes cause deadlock, and other times it does not.

in order to detect possible deadlock situations, it is necessary to explore all the possibilities that may arise during execution.


Given these requirements, we propose a set of benchmarks that investigate how decentralized monitoring mechanisms meet these nonfunctional requirements.

each developed benchmark consists of one or several workloads, which evaluate a speci.c non-functional requirement by a prede.ned set of appropriate metrics.


The architecture that governs the connections between components also depends on the application domain.

reuse possibilities increase when components are bound to domain concepts.


The tool proposes a randomly chosen PCM in a way to assure the global coverage of the 75 PCMs.

during the group session, no evaluator has the same PCM to evaluate.


killing the mutants) as its requirements are spanned across different program versions (one mutant per version).

there is a need for a unification of mutation requirements in a suitable way to be used by techniques, such as symbolic execution or a search based application, appropriate for test generation.


The goal of our study was to provide empirical evidence for assumptions made, not to eliminate assumptions by providing evidence that they would never be made.

while we may .nd further types of assumptions when studying additional projects, this would not invalidate the .ndings of the study presented in this paper.


This has the shortcoming of paging in a single page (typically few KBs) at a time as it is di.cult to speculate in the general case, which pages will be accessed in the future.

each remote page access incurs a network round trip, signi.cantly increasing the access time.


Intensive and iterative training on different sized networks is required in order to find the network architecture that provides satisfying results [1, 30].

applying dynamic SOM models to software repository organization seems to be a more promising alternative.


Then excess new particle values are communicated to the other PEs to ensure that all PEs have the same number of particles for the following iteration (intra-resampling).

in this case all communication between PEs is not-deterministic.


Then, to each ABO paper of our review referenced in each replication, we tried to understand how researchers used the information.

we could verify the impact of the ABO in recent research in the area.


At CSoft, these two high-level activities are brought together through the Evo process.

also gathering the innovation process and the development process into one where stakeholders, external to the organization, are a driving innovative force.


One of the bene.ts of basing the RMC type system on the RTG type system is that RTG provides built-in support for unit-style recursive linking.

i hope that RMC will serve as a jumping-off point for future work on synthesizing the functionality of modules and units.


In many cases they involve a certain order of tasks that are dedicated to particular participants.

these e.orts can be regarded as processes: a set of activities, performed in coordination in an organizational and technical environment, that realize a particular goal [39].


With eviction-based placement, it is essential to not miss evictions in the clients; eviction detection based only on I/O reads and writes can miss important evictions, leading to hit rates that are actually worse than simple demand-based placement.

the full set of techniques within Geiger should be used for buffer cache inferences.


The hypothesised cognitive processing of a UML-B model  4.3 Method The second experiment was a replication of the first experiment.

the nature of the notations (graphical and textual versus textual alone), the design of the experiment (cross-over trial) and the protocol used remained the same as in the first experiment.


Every thread is a member of a control group and a member of a share group and a member of a lockstep group.

three of these definitions mean all threads .


Branch instructions used to perform this check can be leveraged to check if a use is safe or not.

in addition to log the operations described in Figure 3, we also log the following branch instructions that test on object pointers: if-eqz (jump if a pointer is null), if-nez (jump if a pointer is not null), and if-eq (jump if two pointers are equal).


However, this cannot happen because the process UIDs are ordered and only the low-numbered process of a pair receives a request during the .rst phase.

there must be at least one process, the one with the highest UID in the system, that has not received a phase-one signal and is available for matching.


Each user-de.ned protocol needs to be incorporated into CapCheck.

this is a viable alternative only for a few well-known protocols.


In production rules, a variable can only be bound once.

if a single variable is used at multiple locations, it indicates that all these instances should contain the same value.


Due to nesting, most of the edges in an MM belong to multiple loops.

a transition count on those edges corresponds to a combined total count of many different loops.


However, our approach also makes patching more dif.cult by using the same bytes to encode two (or more) instructions.

attempting to tamper with a particular instruction may inadvertently alter other instructions, creating problems for a hacker.


Due to the second failure, we should allow certain exceptions to this rule; when the new process executing the Inc-Get-Dir procedure belongs to the current session recorded in S. Especially, in that scenario, things go wrong when (1) Qis currently empty, (2) S =(s,d), and (3) In[s]= d. When all the three conditions hold, the system is in an ambiguous stage, in the sense that the current session may or may not be about to change.

in this case, the new process of s executing Inc-Get-Dir should use extra information when deciding the side it is to join instead of only looking at the variable In[s].


For example, fork/join tasks never need to block except to walt out subtasks.

the overhead and bookkeeping necessary for tracking blocked general-purpose threads are wasted.


If, however, the user changes the priority, letting cost be a low priority item and further, in case of there being no emergency contacts nearby, for prompt response, then, calling 911 becomes the best option.

the alternative can differ based on the situation or context and user priority, using the refinement mechanism of this rational approach, as seen in Figure 3.


Even though the value of the variable is never sanitized, it is automatically set to the IP address of the client s machine by the PHP engine.

it only has a limited range 5All the experiments were executed on a Pentium 4 3.6GHz with 2G of RAM.


3.3 Dependency Pruning Lower minimum support results in more sequential patterns.

the number of extracted dependencies also increases.


In particular, BitTorrent communities such as Pirate Bay publish online statistical information about their network tra.c, dynamically.

these data can be obtained at a trace level, without actually obtaining and then aggregating data from the swarm and peer levels.


We demonstrate the usage of the method for modeling MAS, optionally, in conjunction with an existing MAS infrastructure.

our method enhances both the utilization of existing infrastructure and the development of agent-oriented models.


Design by contract (DbC) [30] does not enjoy widespread usage in industrial settings because it is quite burdensome to fully annotate a program.

contracts lend themselves very well to gradual strengthening.


Hence, decision-makers and policy-makers are facing serious challenges and various initiatives have taken place to address such challenges.

the EC has set a new strategic initiative to enable faster and harmonized adoption of cloud computing throughout all sectors of the economy as well as cut ICT costs and boost productivity, economic growth, and jobs in the EU region [12].


Usually, multiple (I,T )pairs exist for a speci.c D target but the framework chooses the pair that maximizes the overall amount of time in power savings S. The algorithm is based on two facts: (1) only idle intervals longer than I would be utilized for power saving, and (2) only busy periods that succeed idle intervals of length between I and I + T aretobedelayeddue to powersaving modes.

an important measure for the algorithm is E that corresponds to the probability of an idle interval shorter than I + T but longer than I, see Figure 1.


We believe, that for the support of group interaction, the status of the group itself has also be taken into account.

we have added a fifth contextdimension group-context, which comprises more than the sum of the individual member s contexts.


Text is the native format for interactions between the server and the clients in our framework.

representing the programs as text facilitates both their transfer and their execution.


We will show that in this case, a new connection (u, c) is proposed.

there cannot be both edges (u, c) and (c, v), otherwise the bridge would not be necessary, as the nodes must be in the same (s, 0)-pre-component.


In addition, we propose to use the same speci.cation for the automated generation of user interfaces for management by human administrators.

a smooth and gradual transition towards self-managed software systems will be facilitated, where the portion managed by human administrators becomes smaller and smaller.


If a method potentially reads a unique .eld f, all temporary aliases of f are made unusable before the method is called.

every .eld read by a method is effectively unique, including .elds that are read during callbacks.


Although we asked four questions (see section 4.6.2) in order to reach the right respondents, we did not record the answers to these questions.

we could not analyze the causes for the low survey response rate.


The important implication of our observations is that it is not clear that any current or future .xed standard with these goals would be .exible enough: The same factors and adhoc needs will likely lead designers to improvise around its restrictions as well.

instead of trying to improve collaborative OOD by attempting to .nd a perfect formalism, perhaps an investment in tools that are independent of speci.c notations may be more rewarding.