Servers can verify the integrity of the erasure coding as evidenced by the .ngerprints, agreeing upon a particular set of encoded fragments without ever needing to see them.

the two common approaches described above could be used without the bandwidth or computation overheads, respectively.


time (the minimum item interval length).

each of them must stay in bin b (Ii,j ) for at least .


The paramter p is initially set at Pmin" It is increased when for a user-given time of Tstag seconds the quality of the best solution in the solution candidate set has not improved (stagnation).

for each parameter a different number of iterations may be considered until the stagnation condi- tion is fulfilled.


In model-based testing the formal model of the IUT is derived from the speci.cation and it is the starting point of the automatic test case generation.

it should be possible to map the test purposes derived from the speci.cations of the IUT into test purposes de.ned in terms of the IUT model.


Given a program in C-FGSA form, optimizations may transform it into a state in which this simple procedure will not result in a semantically correct outcome.

given a gating function v = .G(D), the algorithm for translating out of FGSA consists of three steps: 1.


In all these studies, it is assumed that every node serves simultaneously as a source for a randomly chosen destination, a destination for another source, as well as a relay for all other S-D pairs.

the delay considered is di.erent from the latency for our (single-source) information dissemination problem.


Experts are by definition a minority, and issues of intellectual property and workload limit their accessibility.

effective study requires an approach that is sensitive to context and can make the most from small numbers, restricted access, and occasional phenomena.


As mentioned earlier, much of the HTML content on the Web today is ill-formed because it does not conform to HTML specifications.

the first step in data extraction is to translate the content to a well-formed XML syntax because this helps in subsequent data extraction steps.


Arrow notation is only active where the import is in scope, that is, in the current module.

it is possible to use competing syntactic extensions in different modules, but also to compose different syntax extensions in a single module.


Atmosphere manages the Virtual Machine (VM) lifecycle while maximizing the utilization of cloud resources for scientific workflows.

atmosphere allows researchers developing novel analytical tools to deploy them with ease while abstracting the underlying computing infrastructure, at the same time making it relatively easy for the users to access these tools via web browser.


This was because the MPICH implementation performs a lazy receive (still correct aspertheMPI semantics) where it starts receiving only when it encounters an MPI_Wait or MPI_Test or whenthe controlisgivenback totheMPI runtime that would force progress.

in the above example,processP 1would be stuck on the MPI_Wait ofline7.


In fact, this limitation hinders the comparison of modularity between di.erent speci.cations.

we adopted a suite of metrics for quantifying degree of scattering and degree of focus [13].


On the tinkering consistency measure (number of episodes) ANOVA analysis still showed a significant effect of treatment (p<0.01, F[1,72]=9.64), but did not approach significance for gender or for gender x treatment.

as the episodes rows in Table 1 show, the High-Support group had less consistent emphasis on tinkering as a problem-solving device.


As a result, this domain constitutes the root of trust from which all other domains can be bootstrapped.

it is an important requirement for the domain to have the highest level of assurance in any XtreemOS-based Grid system.


When the voltage is set to the new value, the converter responds with a Modbus acknowledgment message.

to maintain control of the three servos at 40 Hz each requires the Ada tasks to process 240 Ethernet messages per second.


Allowing a reference to an object in the GC ed heap to be transferred would violate the property that no processes contain pointers into any other processes heap.

enforcing this property statically is vital to the integrity of processes.


The top objective is to avoid reinvention, redesign and reimplementation when building a new product, capitalizing on previously done work that can be immediately deployed in new contexts.

better products can be delivered in shorter times, maintenance costs are reduced because an improvement to one piece of design work will enhance all the projects in which it is used, and quality should improve because reused components have been well tested [2, 3].


However, it required that the concepts associated with lists to be redefined from the new angle and also their properties to be established.

many of the operations on lists have been redefined and their properties were established by Tripathy along with several coauthors ([10, 11, 12]).


Because the Transfer stage time is larger than the Submit stage time, the Transfer stage time is the pipeline cycle time.

within DC2, 316 µsec is due to data transfer (Q2Q), 100 µsec is due to interrupt processing, and the remaining time (107µsec) is due to data transfer on the PCIe bus.


The prefix-sum operation that the threads perform in dbscan inhibit the conservative compilation scheme from extracting computation out of the cluster loop.

clustering does not improve performance for dbscan.


The former includes navigation links (e.g., button) to other pages while the latter serves as a container for the service frontends, which can be integrated and arranged within the frontend area.

the overall application design and layout is de.ned by the integrated frontends and simple page customizations (e.g., change background color, add image, position navigation area).


We then manually inspected the scripts and manually identi.ed the match.

we de.ned other templates that complement the already de.ned templates.


12 Otherwise, r1 = r2, since c1 = c2 and d1 = d2.


The topology in Figure 1 is of speci.c interest because it is representative of some of the key features of aircraft electric power systems in simpli.ed settings.

the hardware testbed was built based on the above mentioned topology.


When the system is running tasks that heavily use a device, TBPM will keep the device in the working state.


For vtopdown, there are O((#imm.2)2) table entries created for rel_bb, which is asymptotically larger than O(#rel)inthe worst case.

we have proven our theorem for space complexity as well.


However, we did not have enough groups to provide statistical analysis, we only used data of two groups.

we are planning to run the experiment again taking care of how the data will be collected allowing us to validate this previous experiment.


First, the assumption that most objects die young is no longer true in application servers.

the Generation Mark-Sweep technique used in the HotSpot VM does not perform well.


Consider fopen and fclose: calling free on the result of fopen is a partial resource leak.

functions returning managed resources must be identi.ed along with their associated resource .nalizers.


Furthermore, Lar keeps on providing Lae with high upload bandwidth for a few rounds.

lae adds Lar to its active peer set and changes the state of one of the existing leechers Lex from unchoked to choked.


We assume that each node in the cluster performs DVS independently to keep up with the request arrival rate [15].

we focus on the front-end algorithms, that is: how to estimate the system load, when to turn nodes on and off, and how to distribute requests to active nodes.


Furthermore, it blocks traversals that follow it in the logical time order.

the improvement of runtime results from concurrent read traversals of composite parts.


If the generated user pro.le contains too much noise, it will result in a lot of information being displayed that is of no relevance to the developer.

we suggest a user pro.le that has a limit in the number of words it contains.


IMPLEMENTATION The Spring framework [17] is becoming more and more largely adopted as a full-fledged component model that natively support Aspect-oriented Programming and Dependency Injection principles.

we implemented the component reconfiguration engine and all of the other kernel components by exploiting this framework facilities.


Each of these services calls other services identically.


In [2], we showed by extensive simulation experiments that CA-GREEDY yields higher revenue, Workload file (normalized load) Figure 2: Average pro.t per processor-hour by CA-PROVISION and CA-GREEDY vs. normalized load resource utilization, and percentage of users served than the .xed price-based mechanisms.

it is su.cient to compare CA-PROVISION with CA-GREEDY in this work to .nd the performance gain.


Consolidation of tasks for a GPU is a very different problem, because allocation of resources within a GPU cannot be controlled.

our focus has been on deciding when the workloads can share the GPU effectively.


It furthermore focuses on the in.uence of the MOM s implementation and con.guration.

the benchmark minimises the impact of other components and services that are typically used in the chosen application scenario.


(Dloglog D) to keep the ef.ciency constant.

it is not astonishing that the inef.ciency is slightly increasing with D. The matching algorithm always achieves much smaller inef.ciencies at the same buffer size and this gap seems to widen for larger D.  5.4 Mixed Traf.c We have seen that RDA works well both for continuous request arrivals and for bursty traf.c with bounded prefetching buffer.


We .nd that only less than 10% peers have the total playback delay larger than 0.3% of their duration, and these are mostly the low bandwidth peers.

we can claim that most peers have a continuous playback.


8.3.1 Control Flow Model The pointcut mechanism in AspectJ allows to select distinct points in the dynamic execution of a program which are interpreted as points in the dynamic call graph [20, 15].

aspectJ can be considered to realize a control flow-oriented conceptual model of join point selection (and it provides dedicated selection means to reflect on this conceptual model, such as the cflow pointcut designator, for example).


The ANTS mission details are still being determined and are changing as more research is performed.

the formal method must be .exible enough to allow for ef.cient changes and re-prediction of emergent behavior.


Initially, we don t allocate memory for ccStack (the pointer variable which points to the ccStack should be within TLS section).

if ccS tack is accessed for the .rst time, an access violation trap will be raised.


The Types.STRING and Types.INT are the runtime types for x10.lang.String and x10.lang.Int, respectively.

4.2 PerformanceOptimizationbyGeneratingBridgeMethods X10 allows specifying primitive types as the parameter types, butJava doesn t. primitive types for the parameter typesin X10 are translated to the corresponding wrapper classes inJava such as B (line 27) for B[Int] (line 7).


Recovery requires hardware rollback, which discards work, and redirecting execution to an alternate, often low-performance, implementation of the same code.

identifying unpro.table speculations and disabling them is critical to performance.


This is possible be- cause many of the words in the value returned by the LL operation are never used, and many of the words are never changed by the SC operation.

it is inefficient to require the LL operation to return all of words in the bank.


The axiom and all other rules are identical to the ones in Figure 4, using fs judgments instead of f. P, H f se : ck on w1 w1 <: w2 (SUB) P, H f se : ck on w2 P, H f se1: ck on w1 P, H f se2: ck on w2 w1 <:0dw2 (CTR) P, H f se1 at e2: ck on 0dw2 Figure 7.

the relaxed clock calculus starting from a standard clock calculus whose purpose is to reject non-synchronous program, we extend it with subtyping rules expressing that a stream produced on some clock ck1 can be read on the clock ck2 as soon as ck1 can be synchronized into ck2, using some buffering mechanism.


As shown in Figure 2, it cannot be extended and all of its .elds are private.

the check in Phase B only needs to be added to the methods in the String class and the JVM itself, where the value .eld (or offset .eld) is directly accessed.


While the data structure is static and is not modi.ed once constructed,itisheavily accessedforlookupssince every conversion of an image feature to visterm requires a lookup.

our .rst challenge is: How can we design a lookup-optimized .ash-based vocabulary tree index structure for sensor platforms?


It can be formally shown from the unit rule system that any reference from a range that occurs in a SUM formula would lead to a unit error.

the error message suggests to replace the reference by a value, which can edited within the error window.


First, level Li is smaller (in capacity), faster (in terms of access latency), and less dynamic energy consuming (per access) than level Lj if i < j.

the location of an accessed data item can make a huge difference as far as performance and energy consumption are concerned.


Since nodes are assumed to be .xed, the location of occurrence of an event is implicit.

spatial reasoningis hard-wired intotheapplication.


the privacy manager is also responsible for exchangingnon-assigned encryptedpartsbytemporarydummy variables or activities.


Also, degree(V (e1,k,S 1)):degree(V (e1,k,S )and degree(V (e2,k,S 1)):degree(V (e2,k,S )).

it follows from the induction hypothesis on U1 ,S 1 ,e1 and e2 that U1 !


4.2.. Register allocator and instruction scheduler Register allocation is already fully provided by CoSy.

retargeting the register allocator in our framework 1 Support for more irregular layouts, e.g.


The faces of the same person may be scattered in several clusters, and different persons may exist in the same cluster.

a number of operations (in addition to selection and annotation) were introduced, such as merging and splitting.


Physical registers holding architectural values are recycled when a retiring instruction updates the retirement map to point away from them.

once a physical register is allocated at renaming for an instruction, it remains "pinned" until a subsequent instruction super- sedes it at retirement.


Our results on the Eclipse dataset showed that defect categorization per se does not mean much.

a systematic approach for categorization is necessary to collect reliable data and hence produce meaningful outcomes.


For these two approaches, the spill candidates are chosen based on the same metric.

the spill instructions inserted are often the same.


The default behaviour regarding parameters passing for method call on a group, is to pass a deep copy of the group of type P to all members 3 .

in order to scatter this group of elements of type P instead, the programmer must apply the static method setScatterGroup of the ProActiveGroup class to the group.


Swift Fox programs are used to model the execution of multiple processes across a network of low-power devices as a FSM.

the whole network has a notion of state.


For each edge between actors A and B with production/consumption rates rA and rB respectively, initial tokens t, and boolean guard B (see Fig.

4), the following data constraint is generated rB · i - t Bi > Af(i) with f(i) =(2) rA rB ·i-t rB ·i-t If actor A has .redtimes, it has produced· rA rArA tokens, which is greater than or equal to the number of tokens required to .re actor B i times, that is rB · i - t. after f(i) .rings of A and i-1 .rings of B, there remains enough tokens in the FI FO to .re B for the ith time.


Consequently, test ampli.cation allows us to use a dynamic single execution over the con.guration to verify properties over a massive space of possible data inputs and thread interleavings that constitute the behaviors of the kernel.

next, we describe how our framework can be instantiated to verify CUDA kernels.


This script speci.es structural matching for state equivalence; this can undercount the network usage of the app, since PUMA would not visit similar states.

our results present lower bounds for network usage of apps.


All the cases in the sample for testing each hypothesis gave affirmative result.


Artur Hecker, Houda Labiod TELECOM ParisTech (ENST) 46 rue Barrault, 75013 Paris +33145817352, +33145817436  {hecker, labiod}@enst.fr corresponds to the set of identifiers x1... xf, then the identifier xj, (1= i.j = f ) corresponds to the identifiers x1... xf as well.

the identifier x is associated to the f identifiers given by the function h: h (xi) = (x + (i * N/f)) mod N. the identifier space is partitioned into N/f classes 3.


In the cloud, on top of latencies that can be caused by inadequacy of network bandwidth and other constraints, virtual machines can also introduce additional latency because of the time -sharing nature of the underlying hardware.

latency is a preeminent issue that cuts across computing paradigms and needs addressing.


After building the VM, addresses of native methods are read from the VM binary and patched into the method headers in the application classes.

the patching process interacts with our linker, which we describe in Section 4.3.


Asaresult, mostP2Papplicationswouldsaturatethe availableuploadingbandwidth when the channel has a large population.

this is also true inTVUPlayer.wewantto studywhetherthrottling uploadingtraf.cintheP2Pmobile streamingwouldreducethepower consumption.


The decentralized nature of the EDBO model avoids utilization of a centralized registry or repository.

the discovery of resources is achieved through a distributed query forwarding mechanism in which all biobots participate.


Collecting as much informa tion as possible on a given variable enforces the constraints on its domain and reduces the search space.

incon sistencies are detected as early as possible, and unfeasible 1SSA (Static Single Assignment) form is an intermediate representation used in compiler design: it is a semanticspreserving transformation of a program in which each variable is assigned exactly once [12].


Besides that, AUTOSAR provides the interfaces of the software applications (which are divided into Body & Comfort; Powertrain; Chassis; Occupant & Pedestrian Safety; and Human Machine Interface, Multimedia & Telematics); these interfaces refer to communication among di.erent software components that are present in these applications.

we can say that information C1 (communication required among internal modules of the systems and related protocols) is present in AUTOSAR.


We define a distributed aspect in Figure 2, and we explain each of its elements as follows: Source Hook: aspects do not require the use of remote interfaces.

distributed AOP provides a more versatile contract, since we can just invoke any of the entity s functionalities only establishing the necessary hooks (local pointcuts).


Failing to adhere to the programming model will trigger run-time exceptions arguably a different level of safety than most Java programmers would expect.

hard real-time GC although not being strictly necessary is still considered a valuable goal for designers of real-time JVMs.


Cost of Miss-Speculation  The cost of miss-speculation can be measured as the sum of the cost of corrective action with the cost of re-executing the work, added with the cost of acquiring and releasing locks for both the conflicted and re-executed iteration.

the cost of miss-speculation increases as the grain coarsens, as does the amount of wasted work due to rollbacks.


The code in .gure 4 is inserted immediately after the stack pointer is incremented.

the code .rst checks, if the over.ow has already started.


Second, we maintain a strong invariant that only the mutator modi.es the stack itself.

the collector can only read values from the stack, but it never modi.es it.3 whatever the collector does when encountering the above race, cannot affect mutator s execution.


Furthermore, each of the chunks can be mapped to many possible components.

the space of all possible mappings from an NL description to a set of components is large.


The assumptions we made in calculating the parameters for NOV analysis re.ect our design goals and how we value di.erent categories of modules.

the NOV for each design can be taken as a measure of its quality with respect to the design goals we have set.


For example, the cache line size for PowerPC is 128 bytes, while the average object size is less than 48 bytes.

one cache line could store two or more objects.


This is related not only to the service quality but also to the quality of the experience in the tourism destination [5].

wOM has been sought as a credible source of information for the destination choice.


ATK object for hypertext and hyperlink When focusing on a link, Mozilla A11y fires a focus event for the hypertext with the index of the hyperlink in the hypertext.

screen reader can inform the blind user that a hyperlink has been focused; When GOK grabs the UI elements of a webpage, GOK uses keyboard to represent each hyperlink in the webpage.


The other 7 students had no knowledge with the C programming language, but had at least basic knowledge in Java.

we can conclude that the students were on a quite uniform degree of experience.


Before-and after-advice can be considered as special cases of around-advices with an implicit proceed statement.

for each advised piece of Java code its control-.ow subgraph is replaced with the representation of woven pieces of advice called Interaction Graph (IG).


In this paper, we primarily focus on mobile networks.

we are interested in investigating the suitability of exhibited characteristics of EpiChord in applications scenarios of mobile networks.


The programming model of RPC makes remote calls appear as local calls.

it hides latency issues as well as partial failures.


If we include a node which is not actually in.uenced by the destructive merge in influenced nodes(m), then the restructuring will not enable any optimizations for that node.

the corresponding increase in code size will be unnecessary.


These direct address jumps load the next address directly from a register rather than computing the next address using an adder.

the delay of a direct-address jump is much shorter than a conditional jump, allowing the processor to operate with very small number of control .ow failures until the frequency reaches 2x.


The goal for video adaptation is to send the most useful data to the sink with minimum waste.

the metrics we use to  3000 2250 Part (a) end adaption end adaption with e2e reliability 25 30 end adaptation approach 1 20 Number of frames (for each priority and total) Number of frames (for each priority and total) fps fps fps fps 1500 approach 2 15 10 750 approach 3 5 0 0 20 40 60 80 100 0 4.2 3.6 3.0 1,8 0.9 seconds Bandwidth (Mbps) 30 3000 approach 1 25 Part (b) end adaption 20end adaption with e2e reliability 2250 15 approach 1 10 1500 approach 2 5 approach 3 0 0 20 40 60 80 100 750 seconds 30approach 2 0 25  4.2 3.6 3.0 1,8 0.9 Bandwidth (Mbps) 20 Figure 3.


Moreover, di.erent mappings of the library onto the target platform can give vastly di.erent speed-ups: a test program computing a hash (based on SHA-1) of 1KB of data took 87.8s, 43.4s, and 2.2s, for three di.erent mappings of the library onto the multiprocessor SoC platform used in this work.

e.cient security processing also requires optimized mapping of the security library to the target hardware platform, a problem that has thus far received little attention.


In the .rst case (line 9), (lx ly) is fully known as (Cons (v1, v2) Nil), in the second case (line 11), only lx is know to be One v.As (exit 3) on line 15 gets executed only when ly is not Nil, we can .nally deduce that the .rst case never results in entering trap handler number 3.

trap handler number 3 is executed in a context where lx necessarily is One v, the switch it performs is useless and line 16 can be simpli.ed into 3 .


IN:X matches the same tuples as RD; the tuple is also re- moved, and must be backed up.

iN:X is trans- formed to IN:X @ (X ® [w]) --~ X', OUT:(X' (D [r]) @ [r].


Each lab has an execution infrastructure that includes software libraries and codes for computations that are different from other labs.

even if a workflow is published in OPM and can be run in other workflow systems, it remains tied to the particular executable components used in the original workflow and therefore its reusability is severely limited.


The cognitive cost of a task depends on the background knowledge of designers, accessibility of pertinent information, and complexity of the task.

although it is customary to think of solutions to design problems in terms of a hierarchical plan since hierarchical decomposition is a common strategy to cope with complex design situations, in practice, designers have been observed to perform tasks in an opportunistic order.


Our results show that for the C programs in our benchmark suite, direct dependences make up a large fraction of all data dependences.

even our optimal (or optimistic) pointer information improved slice size only insigni.cantly.


Another problem with our approach is that it only ensures atomicity and isolation for domain objects.

any operations with side e.ects outside the domain objects will not be undone if the transaction aborts.


Instead, they are automatically and implicitly deduced from the actual aspect code during the synthesis process.

indeed, AspectLTL synthesis is very di.erent and complementary to these approaches.


Transient fault conditions guarantee that the medium loses at most npf - 1 subsequent messages.

count never reaches npf , so the precondition count = npf for transitioning to state SELF_TRIGGERED will never hold.


A Simple Edit-Time Metaobject Protocol Controlling the Display of Metadata in Programs Andrew D. Eisenberg Gregor Kiczales Department of Computer Science University of British Columbia {ade, gregor}@cs.ubc.ca Abstract I will present a prototype tool that enables Java annotations to serve as an extension point for making programs more visually expressive.

programmers can view and edit code in a way that more closely resembles the intention of the code, rather than the raw text.


However, what can be achieved with a constrained policy can certainly be achieved with a non-constrained, broader policy.

our simpli.cation does not restrict the competitiveness result presented in this section.


Blocking at the slowest frequency reduces the 117 watts to 110.

assuming no time increase due to frequency scaling, an overly optimistic upper bound on possible DVS energy savings on these nodes is 39%.


Let us suppose that there is an algorithm A that builds a failure detector of the class OSx from a failure detector of the class fy .

inany runwhere f= t-y, it follows from O1 that A can rely on fy only to know that the number of failures is = t- y.A can build a failure detector of the class OSx in a system ASn,t-y[Ø].


However, the tool does not distinguish aggregation from association relationships and does not consider composition relationships, although the authors mention that lifetime-dependency inference would be required.

with the two previous steps, we show that P is a minimal subset of all properties of binary class relationships.


Any block of code containing a critical instruction must then be either emulated or patched (to allow the host to intercept the critical instruction).

the identi.cation and handling of critical instructions requires a complex software component that resembles, in terms of characteristics, complexity, and proneness to defects, a traditional CPU emulator.


In the scenarios we are examining, decisions might have already been made based on incorrect information that are either very costly or even impossible to correct.

accurate information is needed at all times.


We cannot use linear regression to predict the actual number of faults in our data because of the non-normality of the predictor variables.

we use logistic regression to predict fault-proneness (a dichotomous variable) from our mostly non-normal data set.


The Red applications have low scalability and thus assigning a large number of cores will hurt system performance.

we can see if SBMP scheduler can accurately predict the scalability of the program.


We know at runtime (by looking into the virtual function table s open-method table (see §4) which branch of a D object (either B or C) is on.

we can .ll our dispatch table appropriately; that is, for each combination of types, there is a unique best match according to the usual C++ rules: A B C D/B D/C A AA AA AA AA AA B AA BB BC BB BC C AA CB CC CB CC D/B AA BB BC BB BC D/C AA CB CC CB CC This depicts the dispatch table for the repeated-inheritance hierarchy in §3.2 and the set of overriders above.


Now PC can be performed by a recursive traversal of the kdtree.

each point p starts at the root and only traverses a child if the bounding box of that child can contain points within r of p. large portions of the tree need not be traversed, reducing the overall run time.


However, the resulting constraints can still be solved e.ciently, for example, via a constraint solving framework such as BANE [1] or BANSHEE [13].

the Prolog encoding of the original syntax-directed type rules is quite .exible  in addition to functioning as an e.cient type checker, it can also (via appropriate partialevaluation) yield a constraint-generator for both base type inference and full type inference.


If some S j falls into the second case above, then the timestamp it returns (or a higher one returned by another correct server) satis.es the condition in lines 712 713 and so the client will sub sequently read at this timestamp (line 720) if a non-NULL block is not .rst returned from c_.nd_block (line 721).

for the client to never return a block in a c_read, correct servers must continuously return increasing timestamps in response to s_rpc_read calls.


Each subobject is lazily allocated upon its .rst write access.

the subobjects that do not contain any element actually used by the program are not heap-allocated at all, thereby saving heap space.


For each data vector, all their elements should be allocated to the same SIMD units.

we can use the .rst element of data vectors as the representative element to compute their data partition.


Because the main purpose of the N-Tree is to reduce communication and propagate events, leaves in the N-Tree are subdivided wheneverthe populationofaleafexceedsagiven threshold t. This thresholdisgame speci.cand dependsonthe communicationand latencyrequirementsofgame.Forexample,a .rst-person shooter typegame, whichhasahigh update rateandlow latencyrequirements, might have a lower threshold t to make sure that players are interacting with as few other players as possible tokeep from overwhelming their Internet connections.

when the leader of a leaf discovers that the population of the node has exceeded the threshold, the leaf is subdivided into N children and the peers are placed into the appropriate leaves.


In this step, under the use of adequate hash function, the expected time to search for a node in the hash table is O(1), and the time to remove a node from the maximum-heap is O(lg n).

the total cost is roughly 2×O(1)+O(lg n)=O(lg n) in the left merging.


To distinguish between base and aspect parts of the monadic stack, we .rst have to introduce a modi.ed AOT monad transformer that manages a splitting of the monadic stack into a monad transformer t that collects effects available to aspect computations and a monad m that collects effects available to the base computation.

we de.ne the data type NIAOT as follows (NI stands for non-interference): data NIAOT t m a = NIAOT {runNI :: AspectEnv (NIAOT t m) !


The reasoning behind this is that failure-injection points are typically built out of I/O calls, library calls, or system calls, and these calls can be used to approximately represent an execution of the system under test.


However, this kind of alarm is also of interest to the land-based ship maintenance organization.

an XML-formatted maintenance-request is automatically sent via email to a shore-based Industrial IT enabled system.


Taking the character / as a simple example, it might be valid for comment ( // ) or division sign.

function that tokenizes both comment and division sign are relevant to the character / .


We should therefore validate D and remove all cycles.

even if the input is a graph, we can still accept the original structure and visualize it as a tree.


Examining evidences for an individual C&A requirement does not guarantee overall system dependability; unless, these evidences are put into the context of the target system operational environment along with evidences gathered for other relevant C&A requirements.

in the operational context of the target system, we have applied Formal Concept Analysis (FCA) [10] to represent and systematically reason about arbitrary relationships between C&A requirements and risk factors modeled in the PDO [9].


However, in this model only a limited number of opcodes are available.

depending on the application, large sections of program code might not be implementable using rISA instructions.


The rank of a sample is always equal to the number of variables minus the number of linearly independent relationships that the sample satis.es.

if the rank has stabilized, the number of linearly independent relationships satis.ed by S has been stabilized, and so has the set of a.ne relationships satis.ed by S. We now state and prove the .nal result that bounds the probability of error in the operation of R.In particular, it also bounds the error probability that R does not reach a .xed point, or that the rank testing mechanism fails to correctly detect the .xed point.


An important goal in the design of rccjava was to provide a cost-e.ective way to detect race conditions statically.

it was important to minimize both the number of annotations required and the number of false alarms produced.


o On the other hand, the Completer-Finisher role is associated with a capacity to follow-through, perfectionism .

individuals occupying this role may pay attention to detail, unearthing errors, and ensuring software quality, functioning effectively as QASs.


The iteration is in reverse order so that all uses of a virtual register are seen before its de.nition.

successors of a block are processed before this block.


Although we could use the dependence information, what we need for the transformation is only the data .ow between kernels, which can be naturally represented by producing/consuming relations.

the analysis in the optimizer uses the producing/consuming relations instead of data dependences.


Integer mutation and crossover were applied which also produced infeasible sequences since the evolutionary operators were not aware of the call dependences.

our .tness function used di.erent penalty mechanisms in order to penalize invalid sequences and to guide the search into search space regions that contain valid sequences.


But testing is also an expensive process and changes to the system need to be tested thoroughly which may take time.

the quality of a software product depends on the quality of its underlying testing process and on the effectiveness and reliability of individual test cases.


In our example, there are potentially .ve preemption points in T1, corresponding to the beginning of T1 and the acquire and release operations in the two iterations of the loop.

our algorithm concludes that the release(lock) operation at E ® is the closest synchronization pointthatin.uencesx.the schedulerisinstrumented toinject apreemption right after thelock release.Bydoing so, the failureis successfully reproduced.


After structural analysis, only 6 to 15 candidate instances of the four patterns are discovered.

the search space of the behavioral analysis is reduced to the classes of these 6 to 15 pattern instances.


Our building blocks have previously proven to enable a high degree of reuse (see, for instance [4]).

the development of a system starts with the consideration of libraries of reusable building blocks for di.erent domains, as illustrated in Fig.


The state members in ReadStream are composed from two states, one from each dimension of ReadStream.

when the methods in Position and its children change state, they will change both dimensions of ReadStream.


The points in the transmission range of v that are closer to the source than v are those that lie both in the circle centered at point A and that centered at S.From simulations, we see that with a very high probability there is at least one node, say, w with H(w)= i - 1that iscloser to the source than v and is in the transmission range of v. Therefore, all nodes that are in the transmission range of w and v and are closer to the source must have a hop distance of at most i.

the nodes in the area common to all the three circles are some of the nodes that are expected to transmit to v under FTS.


Example 5: The noise values selected for mixing with RS are {mc,mi}.

after shuffling and translation, the corresponding NURZ contains {mc ,mf ,mh ,mi }.


Fourth, previously developed software modules like maps, localization, and path planners can be directly reused for new tasks or services by service robot developers.

a robot architecture, as well as systematic processes or methods, are required to support the implementation of the system, to ensure modularity and reusability.


In more than 80% of the cases the client is assigned to an edge SN in the same ISP.

most of the P2P tra.c in LiveSky is localized within the ISP and this ensures a network-friendly operation.


whether the input comes directly from a user or a technical sensor.

an interesting question is which aspects di.erentiate non-adaptive behavior from adaptive behavior?


The goal of our work is to develop implementations of function sheets and study their application to realistic examples.

we are also developing a simple yet comprehensive spreadsheet core implementation for experimentation with this technology.


When we release a LQ entry, we lose the ability to compare against its address (Figure 4).

we can only release a LQ entry when such a comparison is no longer needed because no replay trap can be triggered.


Generally, an automated reverse-engineering task can be considered as successful when it provides similar results to a manually performed one.

one way to measure the accuracy of our approach is to compare its result with the result from a developer.


Figure 2: The CAPA framework 4.1 Asynchronicity In context-aware systems, context changes in an environment are observed as external asynchronous events.

we designed the CAPA framework on top of the programming paradigm offered by the Actor Model [13, 1] and futures [12, 18].


Finally, the location-based reports while revealing that there were corrupt acts, did not automatically lead to corrective action taken just by knowing the transgressions.

the shift from paper to digital makes corruption more visible but doesn t necessarily curtail it.


One instance is shared for all iload instructions, another instance for all iadd instructions, and so on.

the minimal work is done at load time for instructions that never run.


When some faults are .xed based on assigned cases, some unassigned cases may no longer fail.

with R-Proximity,we identify groups of failing cases with clear indication of the fault location, and assign them to responsible developers accordingly.


Inspection of a stack is an expensive operation, which will drastically reduceperformance of our approach if performed on each static variables, strings and java.lang.Class loads.

we explicitly give the domain as an argument or as a local variable.


With the agreement of such a model the dependency on network performance increases because it is necessary to communicate a high volume of information between players in order to maintain simulations consistent.

techniques such as the extrapolation and interpolation of players movement, and event filtering based on the relevance of the information to the player s action context are needed to limit communication volume.


Signal reduction is OR-Knot preserving: for AND.OR WFGsG and G ' , suchthat G ' was createdby applying signal reductionto G, anOR-Knot existsin G ifand onlyifit exists in G ' .

if G has an OR-knot then its associated signal reduced graph has a non-empty arc set, so G is deadlocked and an OR-Knot in G is a su.cient condition for deadlock.


However, the con.dences on each of these component contexts are di.erent: whether this event occurs at a scheduled time in a scheduled location or all the attendees attend this event.

the con.dence on context from virtual sensors can be either the sensor con.dence or the conditional probability on the sensor con.dence (e.g., given that the scheduled event occurs, how often the event occurs in a scheduled location).


z3 [f .. z3 ]} Here, we have not successfully eliminated z1 from C{z3 } because it was a recursive constraint.

in some cases, our extraction procedure cannot be applied and we must reject the program (even if it could, in principle, be typed).


That will, in turn, initiate a call to triSolve that has the exact same processor allocation as the original triSchur.

the data doesn t need to be communicated because it already resides on the processor where it is to be used later.


The community topology may be extremely dynamic and change rapidly; however, the virtual environment is always up to date with respect to the composition of the community thanks to state information that Peers periodically exchange each other.

the infrastructure is able to autonomously react to host failures or disconnections (very frequent in case of mobile devices).


SOFTWARE VISUALIZATION Visualizing large-scale software to understand both local and global software properties is a very challenging task.

the more convivial, e.cient, .exible our framework is, the more suitable it should become to analyze, understand, and explain software properties.


A state transition to a .nal state means that the thread completes and is calling a .nalize run-time service, whereupon the thread terminates after the action of the state transition has been executed.

a BM of a thread component, in contrast to a BM of a subprogram component, expresses state transitions which are not relevant to the logical execution (such as initialization transitions).


Besides the correlation of workload events with their energy consumption, often, further result evaluation is necessary.

the framework should include basic statistical evaluation.


The last, particularly interesting for cognitive rehabilitation therapy.

a virtual world is an option to locate patients in that context in a positive way in order to stimulate memory to promote learning.


Service-oriented design: MoReCon provides its services via RESTful services.

any device/user context data can be accessed from other devices and platforms seamlessly.


Mace sstate-event semantics ensures thatanode sstate changes by processing a single event atomically, via a single transition.

the model checker need only considerevent interleavings across individual events at participating nodes, rather than, for instance, exploring all interleavings at a much .ner granularity or forcing the developer to manually identify appropriate transition points.


A simpler proof su.ces if we specify the makespan metric since then OP T has no idle time.

rsucc(i-m) = COP T = COP T and case 2 is eliminated.


Meanwhile, mobile processors are becoming more advanced and powerful but this leads to more energy consumption.

the tradeoff between performance and battery life remains critically important.


While our byte-level throughput control can address policy regarding a job s end-toend performance, admittedly it could be more complex and expensive to operate during a job s entire lifecycle.

we can envision a hybrid approach by which a proactive scheduler throttle up/down a job s dispatched tasks and our reactive, bytelevel throughput controller begins to operate when the system discovers that a particular job is consuming too much shared bandwidth and affects other jobs negative way.


So, at 150 nodes, not all free places on the three levels of the streaming tree are allocated.

the most intermediate nodes do not reach their maximum successor number and for this reason they have less DH operations as a node with the full amount of children.


However, the granularity of such elements in TOD is as coarse as in the other presented approaches for debugging woven code.

only T1, T2, T6, T7, T8 are partially supported in TOD.


Ehlers [5] discusses the synthesis of systems that are ro bust in the sense that after safety assumption violations, the system must return to an operation mode in which the safety guarantees are satis.ed again after only .nitely many violations of these.

such systems have a backup strategy for anomalous operating conditions without the need for the system engineer to specify one.


A trusted library provides combinators for copying primitive data (e.g., trPrim for boxed integers) as well as more complex data (e.g., trList n t for lists, where n is the maximum number of elements to copy and t is the transfer function to apply to items).

the correct version of our example looks like this: r <-forkRC rcset (withRC rc (... expr ...)) x <-copyRCResult r trPrim killRC rc Generally, one wants to take cross-container data (possibly very large) and convert it into a small result, which is then copied back to the original thread.


If we assume Q as the set of states and T as the set of transitions of the derived DFA, the complexity of the brute force algorithm is O(2|V| × (|Q | + |T |)).

algorithm 1 is in the worst case superior to the brute force algorithm if the number of identified contradictions in the variable DFA (|C|) is smaller then the size of the derived DFAs (|Q | + |T |).


Reimplemented versions of the said base formalism compilers within tools that support our approach to DSL design will be transparently usable for any DSM e.ort with no further attention paid to tool integration.

the potential for e.ort reuse and raise of abstraction under our approach is enormous.


However, no such limit occurs naturally, because population density in real games follows a power law [35].

game designers must arti.cially discourage player clustering, thereby precluding certain classes of interesting game play, such as epic battles [6, 40].


Presumably, since the companyis already using the existing technique, theyhave determinedthatitholds somelevelofvalueforthecompany.

weonlyneedtoshowthatthetoolhasat leastthe value as the existing technique.


Random testingdoes notexploit anyinformation about theSUT.

historically it was considered a naive testing strategy less effective than partition testing.


Our proposal is implicitly parameterized by the type instance relation and its corresponding uni.cation algorithm.

most of the technical details can be encapsulated within the instance relation.


As a result, model di.erence representations depend on the metamodel version taken into account.

retrieving a model version may involve the composition of model evolutions expressed in di.erent languages.


e It is preferable that the computation of PCOM is applied efciently as for time and memory, except for the case where they are done at installation.

it is a natural idea to store practically smaller precomputed f'-1 and to update it in the spare time apart from identifcations.


Finally, OpenCL only de.nes global synchronisation and memory visibility at the boundaries of parallel kernels (or kernel-like entities, like copy operations).

o.cially , global synchronisation is not possible inside kernels.


For the Trade benchmarks, between 25% and 64% of instances are captured more than 1 call away from their allocating method.

a local escape analysis (i.e., within a single method) is likely to be ineffective at identifying temporaries, even if one level of inlining is used.


Even more, SLICE* does not need to maintain an external con.ict database.

sLICE* performs better tham SLICE when the SUT or the test suite are updated during the development cycle.


while the runtime overhead drops off rapidly between 0.1s0.25s and then more slowly for successive increases in the sampling interval.

we select a sampling rate of one snapshot every 0.5 seconds as the sweet spot on the curve where the runtime overhead drops to 11% for any of the benchmarks but the latency remains well under one second (Table 4).


In so doing, the end user interacts with a portlet but the effects span along multiple neighbouring portlets.

it should be stressed that feeding is not a substitution for end-user interaction.


As all Entity beans in the tested application happened to be called by Stateful Session beans, any swapping operation needed to wait for at least the length of a client session before it could be executed.

the presented test-case represents one of the worst-case scenarios in terms of induced delays and throughput decline during the adaptation operations.


The most important bene.tof the former is their malleability.

interpreters are accessible for students and require relatively low engineering effort for experiments.


And, in terms of singleton .ow sets a heuristic metric for optimizability the fused analysis proves to be a betterthan-both-worlds combination.

we provide a sound, precise and polyvariant introspective pushdown analysis for higher-order programs.


Designing one model to emulate another is a challenging undertaking, forcing the designer to reformulate the model's semantics in abstract terms before it can be re-expressed in the target framework.

understanding or constructing a virtual machine is an excellent exercise in developing abstract thinking skills.


While the Bytecode Trace Analyzer is able to detect methods that include frequently executed loops, it is not really scan the bytecode trace information; compute loop repetitions L; if(L > High Threshold L) force JIT activation; compute method dynamic size M; if (M > High Threshold M) force JIT activation; else if( (L > Low Threshold L) and (M > T M) ) force JIT activation; else do not force JIT activation, wait next execution or activate Method Execution Counter; Figure 4: Bytecode Trace Analyzer pseudocode necessary to perform this tracing more than a few times.

after checking a method and fnding it not worthy for a few times, the Method Selector discards it, and a lighter methodgrain execution counter is activated, to keep track of the small but frequently executed methods.


An even stronger statement for problems satisfying the integrality property (such as s-t min-cut) guarantees that both bounds are equal.

solving the Lagrangian multiplier problem is equivalent to solving the LP relaxation but does not rely on linear programming and can often be solved more e.ciently.


While a subclass in many objectoriented languages explicitly declares its superclass, in mixinbased composition, a mixin does not know which superclass the mixin will be composed with.

when a user of a mixin (who will be di.erent from an implementor of that mixin) tries to compose it with some other classes, it is possible that a method declared in the mixin accidentally overrides a method declared in the superclass.


Web services are built on a foundation of openstandards, protocols, and universally-readable files that allow them to be implemented on a wide range of computer systems.

through the use of web services, the Aurora system can be adapted to fit most programming languages and the generated Aurora server and Aurora clients can interoperate with a variety of operating systems and hardware architectures.


The general SCP assumes that all elements of the given sets are independent to each other.

a collection of sets S = {{1, 2, 3}, {2, 4}, {3, 4}, {4, 5}} can be represented with less sets like {{1, 2, 3}, {4, 5}} without losing information.


For instance considering proprietary software developed for multiple devices using a MVC approach, wherein all applications regardless of device share the same Controller , or functional core.

the View is adapted based on the profile of the device, but the functionality of the Controller is maintained.


Our approach leverages scheduling heuristics in TinyOS to reduce infeasible interleaving in nesC applications.

our approach saves efforts in analyzing source code and generating tests compared with these concurrent testing techniques.


The alternative features can be annotated with the attribute rationale to capture the rationale behind a decision and support the decision-making process.

traceability between requirements in the problem space and architectural components in the solution space is achieved.


..R.. .= · ..h. (3) R.. ..h Rh.h..(R..) However, the iterative method of (2) can only be applicable to brute-force optimization.

we approximate ..Duringa R.. time interval of ...., the maximum workload generated by R.. and h..(R..) can be represented by: .


Our .CTL prover works by reducing the task of .CTL veri.cation, via a program transformation, to an interprocedural program analysis problem.

we can use known safety analysis tools [5, 11, 19, 26] combined with techniques for re.ning termination arguments [7, 8, 18, 22, 37] to obtain an .CTL veri.cation tool whose power is limited only by the power of these underlying tools.


Thanks to the distinctive characteristics of MEMS-based storage devices (see Section 4.1), no startup energy exists, so that the relative di.erence between the energy consumption when TTO = 10 ms and the theoretical minimum does not exceed 7%, leaving very little room for improvement to dynamic policies.

deploying a .xed-timeout Power Management (PM) policy with a PSM of one low-power mode is su.cient to achieve a near-optimal energy saving at low performance penalty.


Substituting the value of by1 from our .rst equation gives yb2 = bx1A1A2 +bb1A2 +bb2 .

the intuition is that the two-.lter sequence can be represented by matrices A ' = A1A2 and bb ' = bb1 A2 + bb2 , with peek and pop rates borrowed from A1 and the push rate borrowed from A2 .


We then feed this characterization along with the optimization sequences, and the model gives us predicted speedups for those sequences (c).

we are interested in kernel functions that can take discrete structures data as inputs, e.g., control .ow graphs.


To aid the reproducibility of our results, the fuzzer s random number generator is seeded with a constant value, offset by another constant argument that is incremented on each successive run and a hash value of the speci.ed fuzzing operation.

each time the fuzzer is executed with the same parameters it produces the same results.


Then revisers in authentication context are activated and in app context are deactivated.

sets of revisers are switched automatically without declarating explicitly context switches and activated multiple de.nitions can be avoid.


With the reduced workload, the amount is decreased to one afterwards.

the monitoring analysis scales with the workload on the monitored applications.


However, the p-values in the experiment provide little guidance toward raw or generic types (p-values = .234 respectively .645 for the Mann-Whitney-U-test), and as such, we are hesitant to make an argument either way.

we think a conservative interpretation would be that, if generics help or hinder for this kind of task, the impact is small.


Predicting the time and resources that a software project needs, even in isolation, is not an easy problem, and statistics show that a large percent of all software projects fail or are delivered late [3].

keeping software in a runnable state at all times during construction is a valuable asset and reduces the risk of a software .rm.


Note that compile-time checking of array bounds violations via static analysis is not su.cient by itself because it is usually only successful at proving correctness of a fraction (usually small) of array and pointer references [2, 6, 7, 8, 19].

such static checking techniques are primarily useful to reduce the number of run-time checks.


INTRODUCTION AND MOTIVATION In Europe, broadband network access is becoming more and more popular, as access methods such as xDSL and cable modems become cheaper.

online multimedia services like News-on-Demand (NoD), digital libraries and Learning-on-Demand (LoD) are becoming important elements of the information society.


For write operations, only valid pages with the up-to-date data are copied from the primary and replacement blocks to a new primary block.

there are NVp + NVr write operations in a merge operation.


Duringsimulation, the continuous state vi-1 hasbeen updated to v ' i-1 according to the continuous state evolution of qi-1, vi'-1 wasfound to satisfy theguard of a transition, and was reset to vi according to the reset map of the transition.

using the functions PreR and PreE described above, we can compute a set Bi-1 of continuous states such that Ai-1 = {(qi-1,w i-1): wi-1 .


You rather want the paper to be improved, because usually a reader of the paper cannot easily ask the author for clari.cations.


Bracha and Ungar have proposed a set of design principles for the design of a mirror-based metaobject protocol: a re.ective API which fosters a high degree of reusability, loose coupling with base-level objects and whose structure and design directly corresponds to the system being mirrored [5].

mostly in.uenced by Self s mirrors [1], we decided to redesign the AmbientTalk architecture in a mirror-based way.


This experience provided ammunition for the eventual removal of class Eval in Haskell 98.

today, seq is a simple polymorphic function that can be inserted or removed freely to .x space leaks, without changing the types of enclosing functions.


$5.00 number of small Internet enabled mobile devices are growing rapidly, not all web sites today cater to mobile visitors, instead, optimizing their content exclusively for desktop clients.

as W3C Director and Web creator Tim Berners-Lee said, .Mobile access to the Web has been a second class experience for far too long" [12].


An agent can commit to a new role, can cancel one of its roles, can temporarily stop playing a role (deactivating it) or can activate a role that it has temporarily stopped playing.

besides identifying roles while executing plans, it may be useful to relate the roles to the actions of a plan.


adjacent variables that are accessed frequently and tend to be accessed together should not be divided by padding.


Unfortunately, hardware-assisted breakpoints and watchpoints are limited in number (only 4) and shared between non-root and root mode.

they cannot be used simultaneously by the analyzed system and by the framework.


The assignments in lines (8)(9) and (16)(17) are both at most O(L).

the complexity of Algorithm 1 is O(LlogL), where L is the number of levels, which at most equals the number of tasks N when each task forms a level.


In [2], the WFMC (Workflow Management Coalition) has defined workflow as the computerized facilitation or automation of a business process, in whole or part.

technologies on workflow modeling and controlling are often considered to be critical in business management [2].


We make redexes that involve values with stacks of nonidentical owners stuck states, which makes violations of the single-owner policy manifest.

to differentiate between the latter stuck states and stuck states due to type errors we introduce error k,dynamictypeerrors.a contractsystem thatis a complete monitor renders states unreachableif they are stuckdueto a valuehaving multiple owners.


On the other hand, the design of an ETL process using a vendor-speci.c tool is usually performed through a Graphical User Interface (GUI).

the generated design tends to be proprietary since it can only be executed within the tool, and no available mechanisms allow to seamlessly generate its executable code for other platforms.


The FLcache maintains a cache of frequently used sizes, and for each size an accompanying free-list of objects.

fLcache would be the .rst place that the allocator would look for free a object.


Assume the current frame of reference is at time ti+1.

a value produced by s at time ti is viewed as the previous (most recent) value of s.Consequently, all variables in s of the form xr will be converted to xb,and x to x.


Because of the mapping between the feature model and the test model we obtain test models for each generated con.guration.

the Rational Rhapsody ATG plugin can be used to generate test cases for each con.guration.


Nevertheless, UML is a modeling language which does not provide support for performance evaluation of system s speci.cation.

mechanisms that allow the mapping of UML speci.cations to existing performance models are essential.


Introduction As more devices are packed in a smaller area with reduced feature sizes, the current density continues to increase in newer generations [6].

more heat is generated per unit volume, causing the operating temperature of the device to rise.


Such names are introduced by the lam constructor, whose single argument body is a .-abstraction.

object language binding will be implemented with .-abstraction in the encoding, in accordance with our higher-order encoding methodology.


The CRF s 4 abstraction levels are usually not integrated and considered in the design process, thus making it difficult for stakeholders to appropriately implement UIs for different contexts of use.

specific context of use constraints are not considered and often a one-size-fits-all approach is adopted.


The VSE inherits the .exibility of OpenBlocks with respect to the connectedness of blocks appearing on a page.

a page can have more than one toplevel block.


When the .le system recovers from this crash, it will not replay the transaction writing D (and C) because it has already been released and it will not replay the transaction containing B and M because it has not been committed; as a result, copy C will be unreachable.

the timing of the new transaction is critical and must be carefully managed, as we will see below.


By re.ning the notion of containment, Theorem 2 can be re.ned to disallow allocation in regions that are neither global nor present on the region stack, represented by the evaluation context.

starting with a well-typed valuefree program, evaluation introduces no dangling pointers and allows for regions to be allocated and deallocated in a stack-like manner.


However, when the number of erasures m = 3, the Grassmannian code is not optimal anymore.

we focus on the comparison of the numerically stability of these codes for more than two erasures.


However, the default binding cannot successfully invoke the operation setName within the current lookup type (Employee), since the module does not contain such an operation.

since the default binding is unsuccessful, the inheritance action selector is evaluated.


While TDD focuses on writing tests to verify correctness of the program before starting development, the basic element of software testing the Unit Test is typically a piece of software itself, forcing testers to attain certain programming skills.

it leaves test creation to technically skilled members of the project team.


ndnSIM is generally considered to be the most scalable ICN platform; e.g., as reported by Afsanyev [10] et al., CCNx, ccnSim, DCE, and mini-CCNx can only support ICN simulations with a few hundred routers, and cannot be used for our large-scale evaluation with 80,000+ routers.


In the FFT kernel, all accuracies below 70% occur when selecting the two smallest training runs.

in our analysis, training data sets must be chosen to be large enough to exhibit the characteristics of the larger runs.


We expect that this method could be widely accepted to those with limited time and resource for conducting a large scale user research, but have to capture quick glance of user needs.

we assume that his method would be effective especially for mobile UI which has a short developing period and frequent changes.


Even if the type checking code associated with statement ,5' were considered explidfly as shown in Figure 3, we still cannot hope to deduce useful type information, simply because the assertion may not hold immediately after statement R. That is, a may not be a scalar normegative integer between statements R and ,5" in Figure 3.

if a program is not given to be type correct to start with, no useful type information can be derived via a backward inference.


I feel that, with all the different standardization activities that are currently taking place, this kind of situation will present itself more frequently.

it will be essential to have a method that works even in these delicate cases.


The desired system can initially be speci.ed at a high level of abstraction, before precise implementation steps are performed.

uML provides appropriate models which hide concrete implementation details while being expressive enough to specify a complex system.


If there is at least one subderivation of the latter kind, then the corresponding extended syntax must already be part of the current subject e because base rules cannot pattern match on extended syntax.

by the de.nition of R the term e can be desugared.


By a one-tailed version of Cheby i 2 (ci-E(Yi)) shev s inequality, P r[Yi < ci] = V ar(Yi)+(ci-E(Yi))2 , when ci = ).i×V ar(Yi) E(Yi), and the minimal required ci = E(Yi) + 1-.i .

eBUA allocates ci cycles to each task Ti, so that the probability that Ti requires no more than ci cycles is at least .i.


Our experience shows that the de.nition of the minimal core is adjusted and re.ned gradually over time.

we continuously discover new aspects as our de.nition of the core architecture evolves.


time constraints and technical quality/fidelity of prototypes) may prevent both methods from being applied in the ideal conditions.

evaluators will have to decide which method to apply.


The de.ning characteristic of additive conjunction is that each component consumes all available resources.

a1 &A2 provides a choice of either A1 or A2 but not both.


Causal MSCs, therefore, ensure that the global communication patterns speci.edby MSCs is the composition of the local communication patterns accepted by the state machines generated for each role by our tools.

to have a valid composition, we require that the result of Match be causal.


An important issue in this process was to search for reviews and accurate analyses on the field, looking for current researches and open challenges related to the use of ontological resources in Distributed Software Development processes.

the following research questions were intended to be answered: Which tools, techniques, models and best practices that using ontologies have been proposed to support the DSD?


To derive the requested state for the mock object, the pre-condition of the method under test (which includes constraints on the mock object) is transformed, through rewriting of the speci.cation by following a number of rules.

for each method of the mocked object a subcondition of the pre-condition is extracted, such that the sub-condition constraints only the according method.


each node with probability at most 1.71 1 and at least 0.67 1 .

n n this is by far the fastest known sampling algorithm.


So, although both patterns are slightly di.erent, they exhibit a bisimilar behaviour, expressed in the RA model.

(rproactive .RA rdependent).s Note this would not be the case if CA was chosen as a semantic model.


To resolve a key lookup from an object at run-time, JavaScript transitively follows its prototype links until either the key is found or the root is reached without success.

unlike in class-based languages, inheritance relationships are computed at run-time rather than provided as declarative speci.cations.


According to the documentation of Texas Instruments DC/DC converter family TPS61000 [9] the total losses in the converter are less than 50 mW, what is anyway too expensive for a wireless sensor node.

this solution is acceptable if the converter is enabled only in case the voltage drops below acceptable level.


Finally, we recognize that modern operating systems replacedswapping withpagingfor agood reason, whichis that pagingis moree.cientin.ne-grained scheduling among active tasks.

rather than replace paging with swapping, we combine the bene.ts of both memory management techniques: weallowtheOS tocontinueusing normalpagingfor memory management of active tasks, and use swapping only to process application placement events, which are incomparably less frequent than scheduling events among concurrent tasks.


For a supervisor to support growth effectively, it is necessary to determine learning order.

it is im-portant to clarify learning order dependencies.


However, a large library of untyped modules is useless if each must be modi.ed to work with typed modules.

our implementation must automatically wrap imports from untyped code, and protect exports to untyped code, without requiring changes to untyped modules.


If P = 0 a node does not have a file, otherwise when P = 1 the node has the file.

pdetermines the number of queryhit responses for Gnutella.


One can observe from Figure 2(b) that, with our approach, the average energy savings for the simple, prediction-based, history-based and staggered strategies are 9.4%, 14.2%, 29.2% and 25.9%, respectively, which are much better than the corresponding (average) savings without our scheme in Figure 2(a), i.e., 4.7%, 6.3%, 15.6% and 9.8%.

we can conclude that our approach is very successful in practice.


Moreover, there can be relationships between the parameters that are not made explicit by the software documentation.

it is very hard (if not impossible) for users to completely understand the con.gurationhardware-workload-intensity-target relationships.


However, it is di.cult to reuse the bugs in sample set 1, sincethere are not statistically su.cient number ofbug.xes for these types of bugs.

we deliberately sampled morebug.xesfocusing onthesefourtypes.Speci.cally,we used all the related keywords to search for the bug .xes of a speci.c type.


For example, a source giving pictures could not be processing by a renderer only able to display textual informations.

some user choices must have an Figure 1: Global process impact on other FMs by reducing them to products that may be related: these restrictions will be driven by a model of the system representing the di.erent FMs, links between them, and restriction operations to do.


.. Where #Tp is the number of terms of the minimal ON-cover of partition p. The process of repair identification described in Section 4.1 can be applied individually to each partition.

generating the possible repairs for each partitioned tree Repairs for the non-partitioned feature model can be obtained by considering permutations of repairs of the individual partitions.


However, it is usually not available in practice.

is it really necessary to have a truly complete P Set when we apply the test procedures to localize buggy access pairs?


Nevertheless, they focus on services as core assets in SPL in which services handle variabilities and they address the relationship between SOA and SPL from a conceptual level but do not go into details about the implementation activities.

theydo notprovidedecisions for recommending speci.c variability mechanisms according to granularity, modularity and Separation ofConcerns(SoC) principles and do notprovide the relationshipbetween variabilityand technological concerns, neither address a quantitative analysis.


To bind two ports, one needs to be conjugated with respect to the other.

the unconjugated port sends the outgoing messages defined by the protocol and receives the incoming ones, while the conjugated port receives the outgoing messages and sends the incoming ones.


Although this is caused by a bug4, resolving the bug requires a major refactoring of the JBoss AOP class loader.

an interrupt action must ensure that the InvocationQueuingInterruptor aspect is woven at a join point where no other aspects are bound.


As denoted by the dashed arrow in Figure 2(b), the learner realized Ci5 without achieving Cj3.

a dependency can be extracted for a learner who moves directly from Cj1 to Ci5, even if most learners need to achieve Cj3 before reaching Ci5.


In the array-based code domain, most of the prior work on optimizing AGU usage concentrate on allocating address registers for a given code.

it is not possible to categorize them in group (I) or in group (II).


Code on demand the client can extend its functionality by downloading and executing code from the server as he needs.

the client is simpli.ed since it reduces the number of features required to be pre-implemented.


3.2 Nature of Cheats: Atomic vs. Complex The list given above attempts to be comprehensive but not necessarily disjoint.

a given cheat might fall into more than one category.


In the example of blackscholes, all array indexes used in the loop are i, which is the loop index.


This paper discusses strategies for supporting and executing 3D applications in DTV environments and exemplify its use applying them to Ginga.

we analyze the existing work with similar goals.


In particular, it ensures x.Global = y.Global and that y.Local is consistent with the parameters passed to the module of y when called from x.

to express such constraints, y.pc is not really needed provided that we can refer to the module of y.


A composition environment (Figure 1) shows the contents retrieved by querying Web data sources registered into the platform, and allows users to manipulate such contents to fill-in visual templates representing the user interface of the PIS under construction.

the user application dynamically emerges .


18 shows the execution time breakdown for ever, the node size is only 12 bytes.

the double pointer scheme and heap pre.x cause signi.cant space overhead, especially when more threads are used as shown in the .gure.


There was a reduction of 35,06% in the number of application modular units.

a significant reduction of 61,36% in the source code line number and finally a reduction of 23,07% percent in amount of hook methods necessary to be implemented.


In the CLI, an object reference can be obtained for any type, including what Java terms primitive types.

the primitive pointcut args(Object) matches all methods with a single parameter in Weave.NET, but in AspectJ it does not include methods whose single parameter is a primitive type.


Longer initial buffering delay may create users dissatisfaction.

we design startup request scheduling to reduce initial buffering delay.


Considering the net energy consumption of the experiment, the Capsule .le system turns out to be 8% more energy-ef.cient than Matchbox while taking approximately the same amount of time.

our Capsule .le system implementation provides rich additional features at an energy cost equivalent or less than that of Matchbox.


The schedule(t) instruction releases a task t. The call(dt) instruction reads the outputs of task t, where dt is a so-called driver that accesses the outputs of t; it thus provides a deadline for t and we say that the call instruction terminates the task t. The future(n, a) instruction creates a new thread of E code; it speci.es that the current thread continues at address a after waiting for n time units, and that a new thread is started immediately at the address that follows the future instruction.

future(n, a) is a real-time jump : the time o.set n is the trigger of the jump, and a is the destination.


Then, if the function symbol for the integer attribute totalCustomers used in this example does not occur in quanti.er bounds, we consider all possible 32-bit values of this attribute already in the .rst attempt to .nd a valid post-state.

even states with very large values for this attribute are not necessarily problematic for simulation.


One can easily see that the possibility of choosing k+1 stragglers in 2*k is much smaller.

collaborative probe and coordination among parallel I/O requests improve the response time.


A component is then associated with multiple services each service is a set of operations which correspond to the sets of operations of the service points on the service model side.

the concept of service, even if consistently associated with operations, is not exactly the same in both models.


Too denotes the time to complete the computa- tion's critical path of tasks.

as has been reported in the Cilk project: Tp ~ max{Too,T1/P} To ensure that Tp is dominated by the total work and not the critical path, we thus must have T1/P > To~:   3(~ 5 (1-'~-) n+l -- (~) n+l) -2 P 14.


Prioritizing executions with fewerpreemptions was veryeffectiveforfull-coverage searches us-ingDPOR.As the number ofpreemptionsgrows, theDPOR algorithmbecomesincreasinglylikely to swap con.icting accesses and return to an already visited state.Sleep setshelp combat thisproblem, but we cannot prune a portion of the state-space due to sleep sets withoutperforming atleast one redundant execution.Prioritizingbypreemption counthelpsdeferthese redundant executions.In addition, testers .nd preemption points useful for identifying the root cause of abug.Traces that containfewerpreemptions are thus preferable, as theymakeit easier toidentify the root cause.

the modi.edDPORpriority function alsoimproved the speed with which theDPOR search .ndsbugs.wecombined these heuristicsto .ndbugsevenfaster.TheBF(mdpor,pb)priorityfunction .rst prioritizes by the modi.ed DPOR priority function, and among executions with equivalent priority it chooses executions that contain fewer preemptions.


In this case, the context information model provides main vocabularies for the applications to collect the data.

when describing entities in disaster responses, these applications use agreed terms de.ned in the model.


Field access barriers do not exploit contiguity; they always perform n hops to get to the nth object fragment.

contiguity of plain objects is used solely for accelerating allocation and locality.


Different kinds of dependencies and constraints exist between the concepts of different models (see Section 2.3).

supporting collaborative modeling is a key requirement in this context.


According to Mono s project leader, this change was also required by HP as a condition for its participation as a contributor to the project [21].

.Net systems can use Mono regardless of their respective licenses.


The security aspect is propagated to all new procedural values as well, so the anonymous function passed to setTimeout is also considered potentially malicious.

using the pervasive scoping strategy, the security aspect prevents maliciousApplication from directly and indirectly accessing elements outside of its page area.


The threshold voltage (Vth) of the PMOS transistors increases as more traps form, reducing the drive current, which in turn slows down the rising propagation delay of logic gates over time.

the NBTI-induced performance degradation strongly depends on the amount of time during which a PMOS transistor is stressed, that is, when a logic 0 is applied to the gate.


Unfortunately, these browsers are specialized and limit ex- ploration to particular types of relationships.

when developers want to navigate the code across different kinds of relationships they are forced to switch between dif- ferent browsers.


Data dependences between statements restrict the reordering and optimization of performance-critical code fragments, such as loops.

data dependence analysis is the discovery of the partial ordering of program statements at compile time.


However, the existing BPEL4WS platform needs the orchestration server (typically called BPEL engines), which follows a server centralized architecture.

the existing framework cannot be directly used for implementing the proposed HNS-SOA.


incomplete requirements with a strong causal relation to 4 variables in RE, but also to 8 variables in the project dimension and even one in the overall company dimension), or, .nally, they 4. have no direct relation to RE (except over transitive and, thus, not empirically resilient relationships).

while we see good chances to use a substantial amount of variables for measurements in RE, we still have a large extent of variables that imply the need of further investigation on (1) means for accurate measurements and (2) extension of the variables themselves.


= For all source nodes in the network, their measurement (Sm) i=1 Substituting (10) in (11) gives and transmission speed (Sc) are constants.

(6) shows that the .nish time of each cluster depends on the sensing work load assigned to the cluster, which will be discussed in following sections.


These constraints guarantee that the injection of futures into an otherwise sequential program does not alter the meaning of the program.

these constraints must ensure that interleavings are benign with respect to read and write operations.


However, Figure 5 shows us that although Renewal Wait does have an impact on the amount of state a peer must store, this impact is limited.


The rebalance algorithm again guarantees that the density of every suf.x of the rebalanced region is at most .max <d.

since the invariant holds at slot s2 before the rebalance, and all extra dollars are moved to slot s1, we have that the invariant holds for all slots after the rebalance.


For this purpose, web consistency testing takes advantage of the way many developers approach web development: they write code and keep checking the effects in their favorite browser.

in that reference browser, it is guaranteed that a page looks and behaves as expected; that behavior serves as reference.


the condition check at e will stop the computation of the function right away if the value of isClosed is true).

we also demand that all other shared variable reads read the same value as they did in the original observed run, in order to guarantee that unobserved local computations will unfold in the same way as they did in the original run.


Finally, AxpectJhas other mechanisms with no analogs in the language of ABTs, including mechanisms to add state to class definitions end for short-circuit parameter passing.

we might reasonably expect that AspectJis strictly better for representing behavioral relationships as aspects.


The comments by the king offer little in the way of positive reinforcement, but as they do not affect the function of the game, they can be ignored.

from an instructional ethology perspective, the king s comments are irrelevant.


Based on this analysis, they consider combinations arising from these four dimensions to derive a universe of possible patterns in a bottomup fashion, without regard to whether these combinations are commonly used in practice and without providing a description of the workflow problems that the pattern might be suitable for addressing.

it is still left to the workflow designer to understand the mechanisms at their most basic level.


Recall that only call and return actions are visible for I/O re.nement.

the corresponding trace t has the property that for each thread t, t |t is a sequence of pairs of matching call and return actions.


As stated in Section 2, this research is focused on the exception handling subset of the ParcelCall case study.

the following use cases have been identified: monitor item location, generate alarm on item location, monitor item environment status, monitor temperature, monitor pressure, monitor acceleration, and generate alarm on item environment status.


For the sake of contradiction, assume that the barrier placement for a dependence subgraph of length l is not optimal but the .nal barrier placement for the dependence graph of length L is optimal, 1 = l < L. Let the number of barriers at length l be bl.

there exists another barrier placement for length l of size bfl such that bfl < bl.


However, some tasks posted directly or indirectly from the event handler would execute after the event handler exits.

an event is not deactivated when the event handler terminates but only when all posted tasks have .nished.


In our lambda example, one would de.ne an extension ExtendedTerm of interface Term that adds a print method.

all three variants have to be subclassed to provide an implementation for the new operation.


In A3, unlike the event order E1 depicted in Figure 3, we have possibly unbounded number of Check(false) events before Request, and these Check(false) events are ignored.

the bounds corresponding to (., [0, 1]), (., [1, 2]), (., [1, 3]), (d, [0, 1]), and (d, [1, 3]) in Figure 3 are removed from the set of enumerated bounds for deriving a constraint for A3, and therefore we cannot derive the same constraint as in Example 5.


Translating Curry into JavaScript An advantage of our design discussed in the previous section is the fact that it is not necessary to translate any Curry program into JavaScript.

this is also not reasonable since the advanced features of a declarative multi-paradigm language like Curry (e.g., higher-order functions, laziness, logic variables, constraint solving, concurrency) requires a complex run-time system that must be transmitted to the client with the HTML form.4 we de.ne a class of Curry programs that are easy to translate into JavaScript by omitting the more complex features of Curry.


At the time of this writing, Symfony and PRADO fell to the bottom of the ranked job listings.

the selected frameworks that were compared in this study are CodeIgniter 2.1.0 by Ellis Lab [11], Inc. and CakePHP 2.1 by Cake Software Foundation, Inc. [12].


An ideal idletime scheduler utilizes available capacities for background work (especially at low foreground intensities), but begins to starve background work as foreground intensities rise.

background performance decreases with increasing foreground intensity and preemption interval lengths, as illustrated by the gradient in the larger area in the right-hand graph.


The larger the di.erence between the two values, the larger the threshold is when .ipping occurs.

the larger the di.erence between the two values, the larger the amount of noise one can tolerate to d3 such that the computed position remains in a cluster around z.


It was shown in [6, 4] that, for conjunctive tree queries and mappings using nested-relational DTDs, computing certain answers fora given source tree T is solvable in polynomial time.

for the classes of mappings and queries we consider, there is no complexity mismatch between relational and XML data exchange.


To make this possible, we have provided a lock mechanism represented by a padlock icon, located in each resource window and in the PIS window at the left of the icon for closing the window.

tony clicks on the padlocks of the windows whose contents he wants to keep and then performs the new search.


The LLM Approach The Long Lasting Memories (LLM) consortium is a European effort comprised of twelve partners from six different countries aiming to support elderly people and their families towards independent living and active ageing.

a multidisciplinary team from various technological and service fields as well as with public authorities has been employed in order to provide an integrated and user-centric platform which may enable this population category to live in an autonomous way and to work or to interact with the society despite facing agerelated impairments.


As noted earlier, con.ict-serializability is inappropriate for concurrent data structures.

in this work we check for violations of linearizability.


Introduction In the last few years, the practice of implementing domain-speci.c languages has become popular again.

modular language development is a promising research branch that is trying to prove that modularity can be effectively applied in language development, and many frameworks have been proposed [2, 6 8, 10].


This observation is related to the fact that the model is non-compact, with respect to a metric that will be de.ned in Section 5.

our main theorem, which we call the generalized asynchronous computability theorem (GACT), is a generalization of Step (3) in the outline above, without relying on Step (2).


P is complete if it is not the pre.x of any schedule in P beside itself, and partial otherwise.

we represent a program abstractly by its schedules, and each schedule is simply a sequence of thread identi.ers.


DOR A s explorer outputs the replay it selects to a log .le.

dOR A can deterministically replay the original execution of the explorer using the modi.ed program.


For example, the pressure imposes by Bob, purchasing manager, can be considered as greater than the pressure coming from Bert, stock manager.

the global pressure becomes the sum of the weighted individual pressure of the dependers involved.


If a threshold is reached for the bu.er, it may be con.gured to back-pressure its predecessor.

if multiple transfers co-exist, a deadlock is possible.


This metric was previously used in other defect prediction studies [10, 13] and found to be significant indicators of software defects.

our hypothesis was: H2: As the number of edits increases on a file, it is expected that the file will have more bugs after beta release.


The rich interaction with a diversity of contributors and the specialization in determined parts of the code, lead a developer to gain adaptiveness which eventually will reduce the number of bugs [11].

the probability to harm the repository could decrease.


Note that the hierarchy which is built in this way will be the same for any ordering of the transformation rules.

controlling the order of transformation rules will not a.ect the result of the transformation, however, it may a.ect the time period which is used to build up the hierarchy and execute the composed rule.


Third, our main concern is that it is applied to all photos.

if a large number of photos of the same people have been taken in a row, they will incorrectly strengthen the links between these people.


Consequently, providing fault-tolerance and meeting timing constraints are two inevitable aspects of dependable real-time embedded systems.

it is highly desirable to have access to methodologies to formally reason about and, hence, gain assurance of these aspects during the design and analysis of embedded systems.


Note that we did not have to extend the LATEXML bindings at all for this extension.

sTEX+ gives us a generic TEX.RDFa translation, which works for arbitrary vocabularies.3  5.


is su.ciently small, then for node in C has been an inner node at the beginning of ,there is the round.

no .nal node becomes in inner C k every time frame F of size T and every node v atime step t .F at which et(v C ktC k ).


We relax the criteria for structural analysis in order to reduce the number of false negative cases.

the results of structural analysis may include a higher number of candidates.


Communication Architecture Automation Experiments As mentioned above, the choice of unicast or multicast communication is important when the cost of transmitting commands is high.

to study the effects of multicast on response times, we must consider large scale scenarios.


3.1 Variability in ACCs Following the derivation by restriction mechanism either no ABIE is derived based on the ACC or an arbitrary number of ABIEs are derived from the underlying ACC, as illustrated in Figure 3.

every ACC of a Core Component model has an implicit cardinality of .


Since y is dead after the assignment, if we can prove that y was unaliased before the assignment, we know that x is unaliased after the assignment.

starting from the non-unique base cases generated from ordinary assignments and native methods, we can propagate non-unique forward along the directed graph formed by last assignments.


However, weakening might allow us to type .x:t.e with a different portion of S than S0.

we know that any superset of S0 has bound no less than .0, and while a non-superset of S0 may have a smaller bound, we chose S0 so that only S0 and its supersets are suitable to type the term and then weaken to S. for a function in any given context, there is a least usage quali.er, and our implementation can .nd the least quali.er by considering only the portion of S that pertains to the free identi.ers of the .


5.3 Resource Limitations Because the instrumentation system and the application are running in the same process, they share the resources of that process.

any resource limit is a potential source of transparency violations if the resource usage reaches its limit earlier than it would if the application were running natively.


Speci.cally, in SX10 each place is associated with a security level, and a (completely static) security analysis ensures that each place stores only data appropriate for that security level.

all computation within a place is on data at the same security level.


3) Can estimate the trend of weights In a distributed environment, there are many problems in communication between nodes such as network latency and outages.

a good algorithm should be able to give a rough estimate of possible trends of the weights based on the current value and schedule accordingly, rather than rely entirely on the update from crawler feedback.


Note that pages cached by Content Cache are actually invalid in .ash memory.

in future work Content Cache could pass hints to notify the garbage collector or wear leveler, such that invalid pages and blocks can be reclaimed.


This de.nition simply states that every time any of the blocks B1 or B2 executes, the other block is guaranteed to execute as well.

the execution frequency (weight) of B1 and B2 must be the same.


VeriCon models the semantics of both controller events, such as the receipt of a packet from a switch at the controller, and switch events, such as executing a rule entry in a switch s .ow table and forwarding an incoming packet to a certain port (or dropping it).

sequences of events in VeriCon capture both controller-to-switch interaction and switch-to-switch interaction, making it possible to reason about SDN programs behavior for arbitrary sequences of network events (at both the controller and the switches).


The evaluation of the input size and the optimal number of nodes is important to understand how to con.gure resource allocation through speci.c MapReduce schedulers, such as Capacity Scheduler and Fair Scheduler [21], to avoid resource wasting with allocation of nodes that will not produce signi.cant gains [17].

the variation of processing capacity showed in our experiments highlights the importance of evaluation of the input size, block size, and cluster size adopted to obtain e.ciency in resource allocation [21].


Proximity It is rare that two nodes that are far apart in the constraint graph will have similar points-to information.

typically, approximately similar nodes have common ancestorsfromwhichthepoints-toinformationin-.ows.nodes with similar points-to information would often be in close proximity with each other.


Data-centers andthe edges of the wire-area networks, require a level of capacity and fan-outinIProutersthatisdif.culttoful.llwithcommodity switching hardware today.

expensive carrier-grade routers are still the only viable solution.


Virtualisation technology minimises some security concerns inherent to the sharing of resources among multiple computing sites.

we utilise virtualisation software in our system design, described in Section 4, because existing cluster resource managers relying on virtual machines can provide the building blocks, such as availability information, required for the creation of virtual execution environments.


For example, an assertion in Figure 8 encodes the assertion in Figure 3.

our language can support traditional assertions by providing syntax sugar.


STEREOTYPES FOR AN UPPER-LEVEL AI COURSE Successful use of this approach in CS1/2 means little if it cannot be extended to upper-level classes that require writing much harder programs.

the authors examined the use of this approach for developing puzzle-solving and game-playing software, typically done in an AI class.


The test reports a p-value = 0.7013 which is above the a threshold.

we cannot reject the null hypothesis, indicating that there is no significant difference of DD between the projects certified under CMMI and those not assessed.


Adding those requirements to the standard may either (1) offer only a limited return on the nontrivial investment of effort required to de.ne a detailed and consistent speci.cation of those requirements (due to the small number of use cases impacted); or (2) even prove counter-productive overall (due to the potential of those requirements to preclude otherwise desirable solutions for the majority of use cases that do not have those requirements).

approaches are needed that can cover those requirements without entangling them directly with the core of the standard itself.


The acknowledgment packets are not assigned sequence numbers and their loss is not tracked.

after sending the .nal ACK packet, node A assumes that the negotiation is complete and it attaches the negotiated transport to the connection.


Besides, the pattern for align() can be translated when the amount of shift in DIMM is known at compile time because the value in DIMM must be encoded into an instruction word.

using such a pattern matching method to generate align() is often very tricky.


After the treatment, the doctor may need to access the patient health insurance record or to send the bill to an insurance company.

we need to choreograph several external services and actors based on the current situation.


Since the execution order is explicitly speci.ed in the code, a thread can know which thread is waiting for it at runtime.

after a thread .nishes a subregion, it can send signal to the waiting thread.


[6] provide a constraint satisfaction problem interpretation of the feature model con.guration, in which the relations between one or more attributes of a feature are considered, in addition to the model integrity constraints.

based on such an interpretation, their proposed method not only is able to check whether a given feature model con.guration is correct, but also to recommend the best product according to a criterion.