Due to the state explosion problem and the resulting limitation of the state space, a model checker cannot take into account the internal state of the involved components and services.

it could happen that, although the model checker returns a certain sequence of architectural recon.gurations steps in order to prove the reachability of a given con.guration, this sequence is not feasible according to the speci.c requirements of the actual application.


This evaluation has used symbol to declare its recommended or not recommended that language regarding their factors and requirements.

in tab 2 we provide some high factors of these languages and their evaluation as the following: .


The inclusion property states that at any given time, the contents of a cache of kblocks is a subset of the contents of a cache of k+1 blocks for the same sequence of accesses.


It means that the limit of 63 registers per thread still exists.


If quantum q - 1was ef.cient and satis.ed, the job effectively utilized the processors that A-GREEDY requested on its behalf.

a-GREEDY speculates that the job can use more processors and increases the desire (line 6) in quantum q.


There are no techniques or proverbs, all moves are natural, becoming one with the spirit alone without clinging to forms; transcending the physical [Shu-Ha-Ri, Wikipedia].

learners had better obey its patterns to be able to apply techniques that he/she has.


This assumption is reasonable since the output signals shared by normal agents are continuous.

it is feasible that normal agents could use discontinuities in the output signals to detect adversaries.


It is easy to see that once the property enters a trap state, it is violated and, unlike other non-accepting states, there is no way to recover from the violation.

if there is more than one trap state in a property, these states can be combined into a single trap state.


Nevertheless, there is no single prefetch- ing policy that is best for all situations; good performance requires using a prefetching policy targeted to characteris- tics of the Web application and of the client.

a Web cache should be extensible and provide the ability to load and unload new policies at run time.


It means that with probability at least 7, either the colors of PTokl and PTok~ get altered by a break during the stage, or PTokl and PTok2 merge during the stage.

the average number of consecutive pairs which get altered by a break or which merge is at least 3" x (p - b)/6.


A sections directive takes the form: //omp sections [nowait] { /lomp section  [//omp section ]... }  The sections are allocated to threads in the order specified, on a first-come-first-served basis.

code in one section may safely wait (but not necessarily busy-wait) for some condition which is caused by a previous section without fear of deadlock.


In our approach, users are expected to think in terms of goals but finally they are suggested a number to patterns to apply, those tied to the selected goals.

these questions concerning patterns usage are directly addressed in our approach by the way information is organized and presented in the VEISIG.


The underlying philosophy of our online adaptation approach is to achieve e.ciency by remaining as lightweight as possible.

to achieve the tasks of online adaptation, observation and adaptation, with minimal application interference we use the following approaches to the three design goals mentioned above: 1.


In organizing this paper, we have faced the task of linearizing a two-dimensional matrix of principles and structures into a onedimensional narrative.

after giving some background, the paper delves into the principles to which we aspire, then explores each subsystem, calling out the connections to said principles, explains what is actually working at this time, compares this system to others, and finally concludes.


To reconstruct the transmitted data, it is needed to line up grouped packets following the original order.

the packet assembly module is necessary to line up the packets through packet ordering.


In fact there is an opportunity cost in cooperating with it: missing out on a sustained relationship with another slow peer.

in order to account for this fact, we modify the payoff structure of the BitTorrent Dilemma according to Figure 1(c) so that the dominant strategy of both slow and fast peers is to defect against each other.


m is a name variable, and matches any identi.er.

this block iterates over all public methods of X that take any number of arguments, and have nonvoid returns.


between replica availability and consistency cannot be con.gured in such systems.

the very speci.c aspect of relaxing constraint consistency to achieve higher availability is only poorly researched.


This default executes for a node of type T if no other clause speci.es T in its type list.

the following code: 1 2 3 4 will execute the clause s body on line 2 when traversing nodes of type Project, CodeRepository, or Revision.


Finally, while the main focus of CQ systems is to define a window over the streams, in VANET applications the performance is a more important requirement.

it is fundamental to define functions associated to aggregation of beacons in an incremental way, in order to avoid to newly evaluate the function at the arrival of any new beacon, since they must continuously provide results.


The per-item .delity metadata consumes O(R) bytes, where R is the number of replicas in the system.

.delity metadata adds a small bandwidth cost every time the item is transferred over the network assuming that the number of replicas is small.


An architectural style is defined as a context-free language.

an expression in STSA defines a collection of graphs in a visual notation, such as Figure 3.


Also,the majorityofbugs were arti.cially seeded and are not representative for realistic bugs.

it is dif.cult to argue that results obtainedforSIR canbetransferredto realprojects.


Determining a speed schedule on-the-.y involves only a binary search through the table.

pPACE is very suitable for dynamically discovering the close-tooptimal speed schedules.


Here, the returned expressions must not only be assignment compatible with the declared (type and) static multiplicity of the method, but also no collections representing any multiplicities must be returned (since this would create aliases).

if the method m has declared multiplicity any(C) and type T, and if e has multiplicity option, bare, or null, return e is translated to {C l = new C(); if (e != null) l.add(e); return l;} Else, if e has multiplicity any, return e is translated to {return new C(e);} For instance, the return statement return new POP3(); in line 47 of Figure 2, right, translates to {ArrayList l = new ArrayList(); POP3 n = new POP3(); if (n != null) l.add(n); return l;} where n caches the new instance of POP3.


This ensures that any variable in xk is known before ei.


It would provide support to implement this proposed middleware.

to achieve that, the OSGi implementation in use must take advantages of such VM specific behavior for class loading.


Figure 4-(c) shows a fragment of the con.guration knowledge with these transformations.

theproductderivationprocess appliesthetransformations that are related to the valid expressions for a product con.guration.


Even with behavior based scans, it is still not possible to detect the malice in software, only the recognized behavior.

no solution exists to the problem of detecting all malicious software.


The placeholder main method presented in Sec- tion 3 is essentially a placeholder driver that models these features.

in addition to testing of polymorphism, our approach can also be used in tools for dataflow-based test- ing of individual classes and collections of classes.


"Forimplementingthis,whenthefrstpremise A0 fails,whatwehavetopasstothesecondpremiseistheoriginalsetofassumptions,notwhatthefrstpremisewould returnasanoutputsetofassumptions,"whichmaycontainwrongassumptions.ifweusedahashtable for;,wewouldhavetocopythewholehashtableevery  0fail 1 !


Results of Defect Type Distributions   The error values are also fluctuated, but the proposed model yields PRED(30) of 67% in requirement analysis phase, PRED(30) of 67% in design phase, PRED(30) of 83% in coding phase and PRED(30) of 83% in testing phase.

the proposed model yields overall PRED(30) of 75% for all phases and all defect types on average.


Further, according to the previous research [4], moving vector operations from the CPU to the integrated GPU can obtain both performance improvement and energy e.ciency.

in this paper we focus on utilizing GPU-style vector processing but not SSE/AVX instructions.


Unfortunately, mainly due to the pressure of short time-to-market and extremely high competition, such development methodologies, as well as good software engineering principles, usually are not applied in the practice.

analysis and design documentation in existing WAs is very poor, if not completely absent.


Additional type information reduces the set of call graph branches to the possibilities actually assigned in a speci.c context [10].

the developer s static source code navigation can be improved by selecting only those sender and implementor methods that relate to a speci.c type.


This explains the overloading context restriction of doTask.

an iTask always has a value, just as an iData element.


In [6], we used Higher-Order Transformation (HOT) to synthesise default copy transformations in QVT-Relations for a given metamodel.

the Frame is a transformation that copies unchanged parts of a model.


We found out that a Systematic Review of Studies proposing a formal model for controlled experiments became necessary to proceed with our domain model.

we are now intended to start a Systematic Review of Studies to provide the deeper rationale that is needed.


However, many student developers have never produced a signi.cant technical document like a thesis before.

the discussion becomes .xated on .ne and subtle implementation details, which, although true, could also miss the forest for the trees.


As shown in Figure 1, however, test case prioritization is prior to test case execution, so that it is impossible to obtain the number of faults detected by each test case during test case prioritization.

test case prioritization in our study is not equivalent to that in regression testing.


We followed his approach, but leveraging the well known connection between functional programming languages and C++ template metaprogramming [1, 2] we implemented the parser generator as a C++ template metaprogram library.

the full parsing phase is executed when the host program is compiled.


When working at the level of atomic blocks, the programmer should only be aware that the blocks run atomically and in isolation: the programmer should not see implementation details such as exactly how atomic blocks are built over TM, or the internal algorithms used by a given TM implementation.

when a breakpoint .res in an atomic block, the interrupted thread will be the only one in any atomic block.


DETECTING NON-CONFORMANCE Software systems evolve over time as the system is constructed from scratch and then as the system goes through a series of release versions.

any system which purports to help with the management of software documents must support this evolution.


This situation is discussed in [1] although the expected behaviour of a contractor that receives the message is not speci.ed.

we decided to treat such an occurrence as an inferred decision of type de.nitiveReject in order to avoid more than one contractor inferring an acceptance status.


In this situation, there is no interest in properties of the graph s structure.

register constraints were represented as interferences.


This is fewer moves than if each S-token had to move from its position in C to the position in C of the X th S-token in front of it, which would make each process transmit X messages (one for each of the first X S-tokens behind the process).

there are R x X transmissions of type 1.


However, in Scala it is hard to make transformations for typed ASTs type-safe.

aST transformations in LMS are often not fully typechecked, preventing bugs from being caught early and without extensive testing.


An incorrect GUI state can lead to an unexpected screen, making further execution of the test case useless since events in the test case may not match the corresponding GUI elements on the screen.

the execution of the test case must be terminated assoon asan errorisdetected.


It randomly selects all the following: a name for the function, the names of variables and pointers, and the data type .of the variables and pointers.

the software is capable of generating a combinatorially explosive number of un-identical problems based on the 21 templates, and a user may rarely, if ever see the same problem twice.


When dealing with the put use case, we pretend to avoid any data storage problems which may be present in such dynamic environments as large-scale networks.

data is not only stored on the owner s node, because if this host leaves the network for any reason, its data disappears.


From this point on, threads 2 and 3 get continuously scheduled until S2and S3 catch up with S1.

although thread 1 has the same weight as thread 3, it starves for 900 quanta leading to unfairness in the scheduling algorithm.


As with n, the maximum required k is use case-speci.c, but decided at design or con.guration time of applications (given by the maximum of all .k operators).

to make the rule evaluation tractable in general, k has to be bound platform-speci.cally, too.


Range compression encodes each type bas an integer ibda, with its ordinal in a postorder scan of a certain spanning forest of the hierarchy.

then, the set ibb(b{uof ibd s of the descendants of b, ibb(b{ue=={/ibdtteacEdae,sdc,e n d aanIt s{b(b{u(11) is represented by an array of consecutive disjoint intervals raa@e dra@ ]/raa@2{ra@2]{b b,b, {raa@kab(b{uc dra@kab(b{u]b eah-bpiff paa@iibdra@i (12) holds for some i, ikab(b{u.


For example, if we want to call the method add for an object of class DoubleList, then we shall .nd the method body in class List and will need to convert the context parameters of class List into context parameters of class DoubleList.

we look up though MBDoubleList(add), giving {owner .o,data .d1}as its third component.


in V (w) corresponding to S(w), the step of both paths at which their signatures di.er corresponds to the di.erence in the views.

the sequence S(u) can be treated as a compact representation of the view V (u).


and also makes products by orders on a small-quantity basis.

contracts are generally being made through negotiations between a seller and an order-placer.


This is due to the fact that when a control is degradated during a long period of time, Enterprise.

our methodology tries to avoid to depend only on the periodic audits (e.g.


However, ratings of the game playability and interestingness depend more on subjective factors and there lacks a quantitative criterion.

30 volunteers are invited to attend user studies on the interestingness of the game, naturalness of the automatically generated gaming images and how challenging the game is.


Bottom: for the test period with RMSE = 0.091 and R2 = 0.948. we also wanted to characterize the in.uence of uncertainty in the output of the model, the zone temperature, on the accuracy of the model.

in addition to the 9 aforementioned model inputs, perturbations were also introduced in the output training data-set i.e., in Tz.


Bitdifferential offset assignment involves assigning offsets to variables such that consecutive accesses to memory generated by the program differ by only 1 bit.

very compact prefetch instructions can be generated by using this differential bit.


However, given a change set, they provide no support for determining which dependent change sets are required for the software to function properly.

it is impossible to determine which changes are to be propagated when copying a functionality from one branch to another.


Theorem 1 Two channels a and b can share buffers if, .p, at most one of d(p,a)and d(p,b)is de.ned, but not both.

pRO OF Suppose a and b can rendezvous at the same time and if p1 represents the state of the program counter just before the rendezvous, then by Lemma 4 we have two outgoing arcs from p1: d(p1,a)=q1 and d(p1,b)=q2 for some p, both d(p,a) and d(p,b) exists.


Selectors declared in the Object class, can be sent to any Smalltalk object.

those selectors carry no useful type information.


The real-time task scheduler must be aware of the RTGC so that each execution of the RTGC performs enough work to ensure availablity safety.

adding garbage collec- tion to real-time systems introduces new facets to the schedulability tests that must be em- ployed: the time taken by the GC itself must be accounted for and proof must be provided that memory will be available when needed.


Annotations: Size (if not readily encoded) and fuel information need to be attached to the tree in an annotation run.

some strategies are de.ned over an annotated tree type (AnnTree), which is the same as Tree, except with an added type constructor on the node of a tree, as opposed to adding another .eld in its de.nition.


They influence value though collaboration and interactions [21].

this research stream argues that customer experience with the entire service network should be considered and studied for service designer; a conceptualization that maps well to ideas related to digital era governance [9] in the context of citizen services in smart cities.


AM and PP are supplements to other methods.

in the case of AM and PP the lack of a process perspective seems reasonable.


So, this research starts from requirements specified in RSL-IL, and not in natural language, because the challenges to produce RSL-IL specifications from natural language specifications were already discussed and proposed [6,7,10].

the main contribute of this research is to propose and discuss that, with proper tool support, we can increase the overall quality of SRSs as well as the productivity associated to documentation and validation tasks.


According to Section 3.1, there exits an implicit function relation between air.ow speed U and the harvester output voltage V .

if we could experimentally obtain this function, our harvester may also serve as an air.ow sensor.


Note that UA algorithms that maximize summed utility under downward step TUFs (or deadlines), meet all activity deadlines during under-loads [5, 11].

uA scheduling algorithms timeliness behavior subsume the optimal timeliness behavior of deadline scheduling.


It is worth noting that most existing traditional centralized technologies are not suitable for massive trajectory data over large clusters.

they are not suitable to compare with PRADASE in terms of performance.


In particular, Figure 7 shows that approximately 100 datapoints with 10 bits of metadata provides high reliability of recovery of a 32-bit provenance mark.

one-bit and blind checking could be implemented ef.ciently for large datasets by sampling a relatively small subset of datapoints.


Longer runs mean additional memory page flushes, which translate into more writes, which involve more reads and erases as well and lead to even longer running times.

minor optimizations can improve performance significantly.


Most importantly, it supports additional synchronization primitives, including wait and notify, volatile variables, and barriers.

fASTTRACK models a wait operation on lock m in terms of the underlying release and subsequent acquisition of m. no additional analysis rules are necessary.


As a result, the number of defects that can be detected by the MBR method was 10, while the one by the ordinary review was 5.

one can see that the reviewability of the MBR method is higher than that of the ordinary review.


2, in our framework we used the Extended Backus-Naur Form (EBNF) for de.ning the OMB and C# grammars.

the OMB grammar de.nes the syntax structure for valid OMB statements.


Therefore, the post-copy adaptive scheme experiencing many page faults performs like a full-bandwidth post copy scheme, whereas it performs like the guide-copy adaptive scheme s lightweight background copy for infrequent page faults using 10% of network bandwidth.

both adaptive schemes provide more silent migrations than their baseline schemes at the cost of decreasing page fault prediction accuracy.


The above examples would require existing MD simulations to be modi.ed signi.cantly in order to utilise particular simulation packages or to execute it on a Hadoop cluster, due to necessity of using provided Application Programming Interfaces (API) and programming libraries.

porting the existing simulations that run on the HPC cluster to the cloud would be a challenging task.


The closest technique is used by Software Dock [4] but, as all other proposals, it deals with monolithic software systems, distributing complete applications even when users require just a small portion of their functionality.

in a context where producers are spread over the Internet, transferring enormous applications strains storage and communication resources, even more severely so when dynamic management of updates is required.


From empirical studies on the four projects used in our experiments, we find that usually a suitable value for Cache Period ranges from 1 month to 3 months.

in order to practice FixerCache efficiently, a developer group/software community should have at least 1 month s bug fixing records for caching developers activeness.


In both designs, the pointer-like iterator operations that are exercised N times are identical, as both directly utilize the native set::iterator without abstraction layers.

the advantage due to the one extra virtual call quickly becomes negligible as N increases.


All Steamloom data structures, such as aspects, pointcuts and advice, are inherent parts of the VM.

a call to an aspect s deploy() method is not a simple application method invocation, but a direct call into the VM itself.


3.1 Pseudonym Processing Policies SAML v2.0 enables both IdPs and SPs to define pseudonyms for a given user at the time of federation.

for each IdP-SP pair, a user may have two different pseudonyms.


A bu.ermap, for example, is a set of chunk IDs encoded normally as a bitmap, just as a chunk request is usually a set with only one element.

gRAPES provides a Chunk ID Set datatype that can be used for storing the IDs of the chunks owned (or needed, or o.ered, or accepted, ..., depending on the required semantics)by apeer.


We show that these coupled constraints make permutation schedules scheduling co.ows one after another without interleaving their .ows suboptimal.

centralized scheduling becomes impractical, because the scheduler might need to preempt .ows or recalculate their rates at arbitrary points in time even when no new .ows start or complete.


For every thread pair (t, t ' ), there can be a maximum of two non-overlapping regions between t and t ' .

to identify the boundaries of the non-overlapping regions, we maintain an ordered pair of timestamps.


This point of view is also of interest to testing managers, who plan testing executions, and to project managers, who can use this information to identify appropriate development or support teams.

the feature model in Figure 1, which represents the variable actions in e-shops, may be suitable for those tasks.


(p), L(p, x) and M(p) are translated by applying rule p.1~p.3; and, o (ii) for all t in T such that, R(t) is translated by applying rule t.1~t.4.

the process N( ) covers all syntactic and static semantics definitions of a net entity N. Lemma 3.


Recall that f.PB is the position-independent byterepresentation of a function f. The functions were clustered into equivalence classes induced by the re.exive-transitive closure of the following relation R: f1Rf2 .. f1.N ame = f2.N ame .

f1.PB = f2.PB we assume that if f1Rf2,then f1 and f2 are provenance-similar.


Note that an alternative solution to the careful software approach could be if the hardware provided the right capability to invalidate TLBs on multiple CPU cores, such as special instructions for altering TLB contents on a set of CPU cores.

although we do provide an OS level solution in this paper, we would encourage hardware vendors to put a stronger focus on TLB invalidation methods for many-core CPUs.


Reaching this step indicates that we have collected enough free space so that the gap between the compacted area and the uncompacted area is larger than a page.

in the following steps, we are able to compact the live ob jects to the target page P directly, without using the bu.er page.


Until now, the analyzing tools do not give information about the root causes.

the reviewer has to .nd them by manual examination.


We consider these aspects of the activities to have played a decisive role in determining the success of the sessions by providing useful information for the context and the content of the product to design.

the reflections achieved by discussing the methods used should provide helpful inputs for other designers willing to apply same or similar methods.


The decisions are taken and related to corresponding architectural decisions.

selecting the variants constraints the architectural decisions through the mappings achieved in S5.


Additionally, complex software systems are cooperatively designed in distributed environments.

the interaction among such manipulations inevitably involves con.icts which must be reconciled.


Second, Legion creates new subregions, one for each color, with each region element assigned to the subregion of the appropriate color.

the programmer expresses the desired partitioning of a region, and Legion provides the mechanism to carry out the programmer s directions.


Edges whose tails originate from a rectangle indicate that the oval at the head represents the step that generated the artifact.

note that Figure 5 documents that Add to Dataset produces an artifact, annotated P , by taking as inputs two artifacts, each the output of a different model (a DDG documenting the application and consideration of more than two models would be analogous).


All subgraphs having the same vector are considered as isomorphic.

they are the occurrences of the same candidate pattern and are collected into the same set.


Consequently, the boundary of which the design of the application is considering is fixed.

the Voronoi diagram will now be employed to divide the entire boundary into appropriate disjointed data points (nodes) and sites (regions).


Thisisbecause ||(n,0) - Xv|| = 1 (n is the 2 1 ( closest integer to x(v)) and ||(n,0) - || = Xn is the Xn2 closest node to (n,0)).

t0,n - T( Xn,Xv) = T(Xu,Xv) = T0,n + T( Xn,Xv)sothat - T( )) Xn,Xv) T0,n Xn,XvT(Xu,XvT0,n + T( == .


The second set of constraints aims at modeling the data-.ow of the program.

we translate the PUV into a passive program using dynamic single-assignment [13].


In contrast, the memory locations of short-lived objects can be randomly changed within the survivor area during every minor GC.

the remote access penalty is more critical for long-lived objects.


The sizes and shapes of the clusters are dependent on variations in ground cover types, systematic noise, topographic e.ects, etc.

a pixel labeling image analysis step is typically used to assign clusters to particular ground cover classes.


Since every possible permutation of the labels of a regular structure results in a distinct labeled structure, there are always exactly n!

times as many labeled as unlabeled structures of size n. a method to enumerate all unlabeled structures of a regular species is easy.


The responsibility of the broker is to purchase the books needed by the library, with optimal terms of trade for the library, while maintaining strong relationships with suppliers.

the broker has to assess the value of each transaction to the library (not just the price).


With only 7 registers in IA32 [16], registers are considered precious resources.

we avoid optimizations that are expensive and more likely to increase register pressure, such as code motion and partial redundancy elimination, because it is hard to justify that the optimizations can provide substantial performance speedup.


However, once one packet in a .ow has been handled by ruleset 2, all subsequent packets will be handled by ruleset 2.

for each .ow, determinacy and causality is preserved.


Evenbetter,wecanexploitan ideaofHughes(1986),andrepresent the list us by the function h =(us++).

we make the speci.cation, prod :: [[a]] .


This may be unnecessary, since many policy analysis problems require computing only a few authorizations or resolving only a few names.

we use specialized extended Datalog rules for the specialized analysis problems; these specialized rules can be used to generate an ef.cient algorithm for each analysis problem, and infer only the authorizations and resolve only the names needed for that problem.


Before looking up the BTB, if the RTL value is not equal to zero, then the currently fetched instruction is within a taken trace and is not a taken branch.

the BTB lookup can be skipped for energy saving.


Importantly, socket locking happens on the sock data structure directly, and does not invoke a protocol-speci.c function pointer; for example, the networking code often grabs the sock lock, calls a protocol-speci.c function pointer, and then releases the lock.

changing the locking policy on sock objects would require changing the locking policy throughout the entire Linux network stack.


RMI-QoS is designed to be more .exible than current RMI and will provide con.gurable quality of service to method invocations made to real-time remote objects while maintaining current service to remote ob jects.

there will be three types of transactions according to their QoS guarantees and the real-time characteristics of the remote ob ject: Transactions without QoS guarantees to non real-time remote objects.


biner, perform local spinning and cause only a constant number of RMRs.

the amortized number of performed RMRs is O(d).


The basic idea is, that the variance is an indication of the information content of a variable.

the .rst principal component generally carries a major part of information while the following components carry less.


Remark that all proofs which rely on the previously established guarantees of theprovided method remain valid.


In our previous evaluations discussed in Section 3.1, we found that in Moodle and Apache Roller, the vast majority of code annotations occurred within the same function or file as the security-sensitive operation.

we will also explore providing a short list of potential Boolean statements, or highlighting Boolean statements in the function or file to allow developers to more quickly spot the relevant code and make the annotation.


Building tools comes with a subjective trade-off between utility and usability.

programming tools are likely to exhibit de.ciencies during actual usage.


Voting machines disable smartcards once a voter submits his/her vote.

if an attacker is able to reprogram a smartcard to ignore the disable message, s/he could reuse the card to cast multiple votes.


As described before, for an operator with k inputs streams, the directory is organized as a grid with k-dimensions.

for each operator instance, the key is hashed using the node information:  getOP(): Key=hash(15,0,2)  Figure 5: Operator Instance Lookup through Chord.


The points-to analysis of the C program shows that no location in the example procedure can alias the address of the global state variable.

none of the assignment statements in the example procedure can a.ect the value of the predicate (state==Locked).


The instance model is traversed exhaustively, and a check is performed on each node that has a correspondence speci.cation.

there is a speci.c context in which each condition is evaluated.


Since the q.A.D accounted quanta are those for which uq =dLpq,wehave T1 = uq q.A.D = uq q.A = dLpq q.A = dL |A|PA .

the total number of accounted quanta is at most |A|=T1/dLPA.


Finally, based on the determined behavior, a query is generated to retrieve an adequate video segment from the video database.

video agents portray a variety of behaviors based on environment variations and interactions among agents and with users.


Indeed, as the scope is increased, bounded veri.cation is able to .nd errors that were not detectable at smaller scopes, and bounded test generation is able to produce more interesting and complex tests (or test inputs) whose generation was infeasible with smaller scopes.

incrementing the scope in bounded exhaustive analyses has desirable effects on bug .nding, test generation and coverage.


Unlike l2 processing, l3 processing contains function calls in the normal case.

in the normal case, Strategies 3 and 4 achieve better performance than Strategy 2.    cess instructions can be eliminated when the virtual data path technique is used.


To prove that a solution to a recurring phenomenon is a pattern, Appleton [2000] suggests the rule of three,i.e., the solution must be applied at least three times.

there was the possibility of publishing theguidelines defined in Arimoto et al.


By the de.nition of erase, M dominates N. Hence, from part (d2) it follows that M dominates MI in rows iI,...,j.

for any two matrices in {M1,...,Mk+1} it holds that one dominates the other in rows 1,...,j.


In the migration of a legacy system, the application logic is preserved.

the target system, i.e., the new system, must provide the same functionalities and services as the legacy system, i.e., the old system.


However, our implementation of DE semantics presupposes that unless an actor has previously called .reAt, that it will respond to absent inputs by producing absent outputs.

actors with absent inputs are not invoked at all.


In this example, a data dependency exists between both pipeline stages, since T2 processes data generated by T1.

both tasks cannot be executed fully in parallel.


4.7 Experiments with More Cores When more cores share the same cache, more applications may access OS buffer and pollute the cache.

application performance is degraded more seriously.


The rest of this paper summarizes our experiences and .ndings in formalizing a core of OCL 2.3 in Isabelle/HOL.

this paper serves as an extended abstract of the detailed documents that are available at http://www.brucker.


If the user specifies the object to shift to a less detailed that they were very similar in terms of how the designer went backward or forward among the different granularities of representation.

there is no need for individual support for each component.


The main reason is that these compute memory directly if the buffer was created with the CL_MEM_USE_HOST_PTR intensive kernels have smaller working sets, which makes the ex.ag.

our baseline does not include data transfer time.


Instruction counts of all the other programs are stable with respect to the number of cores.

iPS is a perfect indicator to measure the scalability of a program.


In Case 1, the link location of interest does not appear in the diff file.

the new location of the link is calculated by finding the distance to the closest change chunk.


It will support developers of systems with embedded components in design decisions regarding the most suitable solution in the available hardware and software design space.

this security engineering process will help to significantly increase embedded systems development.


In a parallel scenario, since Charm++ is a distributed system, the memory in each processor is independent from that of other processors.

the overhead each processor incurs depends only on its allocated memory and the average computation time of the entry methods it executes.


In the C1 8-reduced instance (right), the second asynchronous call results in the counter for client is increased to 8.

in this instance, the second dispatch to client yields a non-.


We also calculated the heart rate and heart rate variability.

we processed the .ltered data further in Matlab.


Synthesis is a challenge,and it stems from both the challenges in performing synthesis as such, but without having high quality primary studies the prerequisites for conducting synthesis is not really in place.

it can be concluded that higher quality primary studies are indeedneeded.


Another problem is that the traditional notion of refactoring applies only to a single product rather than to a SPL, thereby not taking into account transformations involving more than one product.

the standard de.nition of refactoring needs to be extended for SPLs, taking into account their speci.c characteristics.


In other words, N clients append to M shared .les simultaneously where both N and M are in the dozens or hundreds.

the chunkserver network congestion in our experiment is not a signi.cant issue in practice because a client can make progress on writing one .le while the chunkservers for another .le are busy.


This corresponds to a greedy step towards the goal of minimizing the estimated latency of the task graph.

the processor selection is determined by the location of the tasks parents in the task graph as well as the communication time of the corresponding data.


S.St A.At We observe that for any A .At we have c(A, S)=1 for at least one S .St because of the impossibility of deterministic wait-free implementations for TAS.

by choosing Dt to be the uniform distribution over St, we obtain that for any A .At, E[c(A, Dt)] = 1/|St|.


4.1.2.2 Software size, Test Cases and Effort For software size, test cases and effort, we did correlation analysis between NOD and test cases and effort and we found that the NOD had stronger correlation with Test cases, while ln(NOD) had stronger correlation with ln(size) and ln(effort).

we selected size, test cases and effort as factors of the proposed prediction model.


This result holds for the data from all three interaction intervals.

even though subjects differ in the systems on which they are working and their tasks, the range of DOI values is similar.


Furthermore, an IC denotes the type of the associate activation function.

it allows the generated code to be both prescriptive (guiding the developer) and restrictive (limiting the developer to what the architecture allows).


Canonical software engineering models for component composition and syntactic service interfaces can hardly tackle the openness and dynamicity of such envisioned pervasive communication services.

this paper proposes an innovative ecology-inspired composition model for pervasive services.


A store instruction can be issued each cycle and the load-store data dependency is hidden by the instruction schedule (load from scratchpad).

little overhead is added to the critical path.


Dependencies among themselves and with other documents (e.g., test artifacts) are maintained in the library.

it was not difficult for us to collect the data of requirements dependencies for running the experiment.


The overall MMU is calculated by taking theminimum MMU across the benchmark suite.

the benchmark with the worst MMU determines the value reported.3 As expected, using a high compilation thread utilization lowersthe MMU for short windows (100 300).


Furthermore, the time tchecking for type checking can be reduced by using caching, as we will explain in Section 3.6.

the performance of the family-based strategy is setup checking t = t+ t(Family-based)  2.6 Summary For a better overview, Table 1 summarizes the properties of the three strategies, regarding performance, optimization, the ability to .nd errors and to blame features, and the possibility to reuse offthe-shelf tools.


Often, the structure of a monolithic system makes it difficult even to rigorously specify isolation.

drawbridge avoids a monolithic organization in favor of a library OS design, which lifts much OS functionality into the application s strongly isolated address space.


Join point interfaces (a) without and (b) with advice application, in UML ball-and-socket notation [25] application, and thus rely on the original join point interface for their interaction with the advice (see .gure 1).

the advice interface (AI) is provided where the join point interface (JPI) is expected, and the join point interface is provided where the proceed interface (PI) is expected.


From our inter-arrival delay model, we know that all interarrival times are independent.

we can present the probability density function of Yi,j as the convolution of the inter-arrival times of response pairs from i to j.


Furthermore, Mann-Whitney U Test shows that defect types are signi.cantly different in terms of medians and they are not correlated with each other.

we built separate prediction  Table 5: Results of Different Types of Defects Algorithm: Bayes Net, 10-Fold Cross Validation No Resampling With Resampling Prediction Type General Defect Prediction FT Defect Prediction ST Defect Prediction Field Defect Prediction Combination of Defect Category Based Models pd 0.64 0.64 0.54 0.43 0.71 pf 0.27 0.17 0.21 0.06 0.28 pd 0.62 0.69 0.66 0.67 pf 0.25 0.17 0.25 0.25 models for each release by taking into account a) only pre-release defects, b) only post-release defects, and c) all defects.


Since EP requires a large private memory space for each work-item in the kernel, both of the OpenCL frameworks give a build error for EP.

we do not show its performance in Figure 13.


The latter usually cause many test cases to expose them.

each of the considered coverage criteria typically has no problems to cover the errors.


In our particular example, DIDUCE signaled an anomaly on line 19 in Figure 2, which is the immediate infection point of the defect on line 18.

we consider it a successful detection of the bug.


Since the collector is copying, invoking it at the end of cj will rearrange the heap, invalidating measurements for fi and its other children.

to compute escape(fi), we can afford only one garbage collection during the execution of fi,atthe end of fi.


Applications must call the system calls such as open, read, and write, to access files.

all accesses including cache hit accesses can be captured at the system call level.


Researchers are becoming better educated about empirical studies and how to conduct them.

we are seeing increasingly more comprehensive studies conducted on increasingly realistic programs and processes.


Traditionally, encapsulation is used to prevent this situation from arising, by requiring all updates go via a controlled interface.

updates to a collection can be intercepted to ensure any cached result sets are updated appropriately.


As time series pattern extraction and processing is a very complex process [16], it could be simpli.ed by a Service 8http://www.foaf-project.org 9http://www.sekt-project.com Oriented Architecture approach for sensor networks (from which time series currently originate in general).

the data model would be enriched with semantic concepts, and complex decision support systems could be implemented [1].


Our OSGicompliant OSGi4C service tracker enables a seamless integration of service-containing bundles without any OSGi framework modi.cations.

it uses the OSGi4C services(seeSection6.2).


Note that we use the same scheduling policy in both IPS al- gorithms to select an instruction to maximize the ILP.

when the number of available registers is sufficient for a given program, the results of HRB and BTL are equivalent.


A method-atomic state transition system is deterministic if whenever two atomic fragments of any two runs have the same starting state and the same method execution signature, they have the same .nal state as well.

every trace of a method-atomic and deterministic state transition system is produced by a unique run.


In the example, the programmer would have to assert that uinfo is owned exclusively to allow reads and writes during request processing.

our tool would prevent user A from exploiting this error by signalling a policy violation when the user starts the second session.


; T f M : Te(X) and suppose that rds(e)nwrs(e) = als(e) = Ø.

m reads and writes on disjoint portions of the store and makes no allocations except possibly in the silent region.


Industry is facing challenges in capturing, curating, managing and processing large amount of data.

exceptional technologies are required to process large quantities of data e.ciently within tolerable elapsed times.


Such information is, however, necessary in pondering which parts of the previous works have a truth in them, and to decide to which extent future research can be based on existing wisdom.

more empirical work is needed to study the implications of the different agile methods in different organizations and situations.


The current version of Pesto uses no-argument constructors to create ob ject instances and directly assigns values to .elds.

any class which is to be specialized must contain a no-argument constructor and must declare its .elds as public (these limitations are however not intrinsic to Pesto, as described in Section 7).


It may not be worth to improve the embedded systems just to execute some computation-intensive applications for extreme cases.

computation of.oading, as illustrated in Figure 1, can be adopted in the embedded systems with constrained resources by moving a task from a resource-constrained device (here, we call it a client) to one or more devices (here, we call them servers).


Uses Description: When building a solution for the problem addressed by pattern A, one sub-problem is similar to the problem addressed by B.

the pattern A uses the pattern B in its solution.


Of course, controlled empirical experiments would have a higher validity, but are practically hard to perform due to the high e.ort for the participants.

i plan to perform studies, where participants (students and researchers colleagues) have to do only speci.c subtasks in existing documents, such as .nding ambiguities or lacking requirements.


However, in the current Microsoft Windows architecture, no general solution for this issue works for any application [24].

dWF takes an approach that each application running on DWF sends messages of opening files and closing files to the DWF manager.


Even though less bene.cial, standard embedded processors like ARM[12] or con.gurable cores[11] are equipped with this feature, too.

support for PE in retargetable compilersis ofhighinterest.


There is currently no other tool available to automatically verify the results obtained from our algorithm.

in the .rst evaluation part, we use programs of limited size to illustrate the di.erencing results.


In other words, in practice, programmers do not aim to reproduce a bug on the .rst replay attempt.

a natural question is: is there anything in between the reproducing it after thousands of reruns reality and the reproducing it on the .rst replay goal that existing research ideas are shooting for?


For example, in the context of our case study in Section 4, the default component would be one that provides no recovery for lost messages.

removal of a component is equivalent to replacing that component by the default component.


Recall that the input arguments of the constructs are always AccelArrays with their type information explicitly stored.

the type information of the function input arguments can be directly obtained from the input arguments of the construct.


BPMN does not support the speci.cation of all required aspects for SAMProc-based UbiComp applications.

we are investigating an extension of BPMN to ful.l our needs.


This requires experience with refactorings and with the implementation language, in the sense that the reverse engineer must be well aware of how the refactorings interact with the coding idioms in the particular implementation language.

the heuristics should be applied in a semiautomatic setting, where a tool signals potential refactorings but where a human expert takes the actual decision.


The other type meta-variables range over both read-only and mutable types.

a type is a pair, ML B, consisting of a mutability and a base type.


Indeed, the different interaction mechanisms and the interface both have to be evaluated.

prototyping and evaluation become basic activities in the development process of any hyperdocument.


In addition, the RMI- JRMP protocol exploits the Object Serialization protocol to format the invocation arguments and returned results.

the "parsing" of TCP/IP messages involves identi- fying the specific JRMI implementation model that gener- ated those formats.


Moreover, auto-completions should be adjustable by the user, requiring to recompute completion actions and their interdependencies instantaneously after each modi.cation.

we developed an approach that computes auto-completions based on activity patterns, enables their preview and adjustment, and executes them within the modeling environment.


That is, if we apply FM elimination to the matrix [BPI~IBP'IbIB], taking care to adapt the matrix BP to the desired form, the matrix BP' can be simul- taneously adapted.

the procedure of generating tiled code becomes much more efficient.


For example, a synchronization operation performed on a client proxy of a remote object does not get propagated to the actual remote object on the server.

maintaining the centralized semantics of Java built-in concurrency constructs requires special handling, which can be nontrivial [21].


Since the filter (figure 2) is not yet automated, generation of mbcfgV2 is done in its integrity from umlV2.

we currently do not use the traceability information (traceUmlToMbcfg) to reduce the effort of transforming UML into model-based control flow graphs models.


The kind of changes that must be support on-line are, we believe, similar to those that can be observed off-line in the program source tree.

to motivate our approach to DSU we describe the results of a small study we did on the source code evolution of some long-running services.


When a user writes things on paper with a digital pen, the handwriting is automatically digitized and added to the paper document information.

the system manages information while users do not need to bother with data registration.


Even a long distant flight will not last longer than some ten hours, while a software project will last for a couple of months or years.

we compress the time scale, simulating a project in a couple of hours.


Since the least .xpoint contains all approximations of result values, one can infer unsuccessful computations only if the bottom element is maximal.

we de.ne the notion of maximal elements of an interpretation.


Thus, they are not willing to pay for this extra feature.

and based on our cost savings model, inserting this feature into Product 1 will add extra costs on the company.


Idle processors consume considerably less power than even processors running cool tasks.

a system with some idle CPUs tends to show greater thermal imbalances that can be taken advantage of by energy aware scheduling than a system with all CPUs busy.


Notice that the C++ class M is aimed at fast simulation, whereas MC is aimed at state space exploration and veri.cation.

reducing the memory footprint of MC is more important than reducing the access time to each of its .elds.


These different actions, namely starting the oscillator and the voltage regulator, are performed via speci.c CC2420 con.guration registers, which are accessed through an SPI bus managed by the MCU.

the program should ensure a reliable SPI communication through which correct con.guration commands are performed.


A recent Cisco report [1] says that nearly 90% of all the consumer IP tra.c is expected to consist of video contentdistribution,including web videolikeYouTube[2],P2P (peer-to-peer)videolikeBitTorrent[3] andPPLive[4], and so on in 2012.

achieving high-quality video content distribution over the Internet is of great signi.cance for both academia and industry.


7.7.1 Space Cost In the CT algorithm, each object has a reference count, and space is required for recursive traversal by the tracing portion of the collector.

the space cost of CT is M-D V(CT)= (24) 1+ 1 m M+D s(CT)= (25) 1+ 1 m 7.7.2 Time Cost In order to evaluate the performance of cycle collection, we de.ne c =a, the rate of generation of cyclic garbage.


To carry out Web service invocations the Daios framework integrated in the VRESCo client library decouples clients from the services to be invoked by abstracting from service implementation issues such as encoding styles, operations or endpoints.

clients only need to know the WSDL interface of the target service, and the corresponding input message; all other implementation details are handled transparently.


For large theatres, this approach is not feasible due to the combinatorial explosion of the number of alternative configurations.

we have to go beyond a global adaptation approach.


The minimum penalty of a mispredicted branch on the Intel Pentium 4 is 20 cycles, but the maximum penalty is much higher due to wrong-path effects such as cache pollution and resource contention with right-path instructions.

it might be more important to predict certain branches correctly than others; we plan to research this issue in future work.


In their example this works very well, because assertions and adaptations are tightly coupled.

they can use a single aspect to handle both.


Using JFFS2 on RAM disks would require an intermediate driver and introduce unnecessary performance overhead resulting from .ash-speci.c journaling techniques.

it is desirable for a memory compression technique to support the compression of RAM disks used for .lesystems in addition to the compression of data in main memory.


These annotations usually must be supplied by the programmer, a task that users .nd tedious, dif.cult, and unrewarding, and therefore often refuse to perform [FJL01].

users seem to view the cost of annotation as greater than the bene.ts of static checking.


More precisely, for each increment in the rank of required suggestion, we decrement the precision by 1%.

precision is 100% when the required suggestion is at the .rst rank and is 0% when the required suggestions is listed after 100 suggestions.


Any C# programmer will be familiar with the foreach loop and the iterator will provide a simple and convenient way to access the elements.

instead of being an advanced topic, iterators become an early topic and an idea that is integrated into the language itself.


It helps in defining the plasticity domains of presentation and appreciating the appropriateness of transitions when the context of use changes.

the following advantages of our approach are not provided by any other tool or method so far: (i) it supports designing multi-presentation UIs by specifying the different presentations and a mechanism for switching from one presentation to another depending on the screen size in a logical way instead of programming everything by hand; (ii) the tool automatically generate (X)HTML or Java (Swing) code corresponding to these UsiXML specifications, which could be reused in other tools of the UsiXML suite; (iii) the code generated intrinsically supports the adaptivity property; (iv) instead of designing all presentations in isolation, it is possible to copy/ paste a presentation for one resolution to get a starting point for another resolution, thus encouraging reusability; (v) the tool provides the designer with a graphical mechanism to design what kind of presentation is adapted to what kind of resolution.


RESEARCH METHOD The main objective of this study is to examine whether twosystematicreviewstudieswouldprovidethesame result whentheapplied.rst stepinthesearch strategyisdi.erent.

we planned two separate literature reviews.


To provision additional capacity, the LS has the ability to easily add new regions, new locations to a region, or new stamps to a location.

to increase the amount of storage, we deploy one or more storage stamps in the desired location s data center and add them to the LS.


Ioannis Parissis Laboratoire LSR-IMAG BP 53 38041 Grenoble Cedex 9 +33 4 76 63 55 71 Ioannis.Parissis@imag.fr modifiedcondition/decision coverage).

code-basedtesting, including test coverage analysis, without clear relationshipswith the requirementsisnot relevant.


As an example, the tcas program had 12 1st-order versions.

we 1 excluding those edges that can be exercised only by the occurrence of malloc faults.


If there don t exist constraints from Entry to R_A, the EMFG is simplified as Figure 1.

if the data flow from Entry can reach R_A, but cannot reach R_F.


Finally, the primary database is generally unsuited for complex querying due to the data integrity design principle s requirement of eventbased storage.

many applications may process the raw data into secondary data warehouses so data is more readily queryable.


Currently, the application does not allow individual activities belonging to a single image pair to leave a machine, as that would require transferring a large number of temporary .les stored on the machine s local scratch disk.

for a single image pair, loadbalancingisonlyperformedbetween thecoresofa single machine.


From multi-core, which become common even in our laptops, the HPC systems evolved towards manycore architectures.

software developers have to expose suf.cient parallelism at all levels, from the operating system to applications.


RELATED WORK Within the context of End User Development, Fischer, Giaccardi, Ye, Sutcliffe, and Mehandjiev [5] implore the benefits of graphical languages over textual ones by stating: Text-based languages tend to be more complex because the syntax and lexicon (terminology) must be learned from scratch, as with any human language.

languages designed specifically for end users represent the programmable world as graphical metaphors containing agents that can be instructed to behave by condition-action rules.


Our proposed solution is similar to the adaptation operators that have to be de.ned for speci.c systems in Rainbow [10].

for target models conforming to the metamodel depicted in Figure 4, we de.ned the following actions or changes.


The design of the framework was in.uenced by the way Interoud Innovation test web services in practice using property-based testing.

the steps they follow to test a web service consist of implementing a QuickCheck state machine, in which each API operation to test is a command of the state machine, and a WS connector module that allows the operations of the web service to be invoked from Erlang.


We showed that automated addition of fault recovery to cyber-physical component-based models augmented with faulty behavior is NP-complete.

we introduced a set of heuristics to cope with exponential complexity.


Additionally, a transformation specification may be reusable across similar domains.

it is essential to ensure the correctness of the transformation specification (i.e., the consistency and completeness, as validated against model transformation requirements) before it is applied to a collection of models.


In the case of the write performance, the Petri Net models the simulation consistently and underestimates the performance of the actual file system throughput, again by less than 10%.

the model is a very effective tool for predicting the expected performance of the real file system with sequential workload.


For example, the initial clause in the loop form (loop ... (initial (i 0 (+ i 1))) ...) initialises loop variable i to 0, and then increments it on each following iteration.

it introduces the expression 0 into the loop s prologue and the expression (+ i1) into the loop s update section, which occurs at an entirely distinct position in the expanded code.


However, the Global strategy obtained the best effectiveness.

there is no clear determination of which model is the best.


Moreover, this phase corresponds to the peak bandwidth achievable using P P Q.

we see a negative impact on the energy metrics (about -25% on CPU and -125% on DRAM) and the latency (25%).


Note that as Miniweb is a web-server, it will keep on running and generating a lot more system calls.

to successfully conduct this case study, we have to manually kill the process after it has started successfully.


In their case study, both LSI and LDA are performed on the same software systems using the same set of queries.

the processes for each case are virtually identical other than interchanging the black box module performing LSI or LDA [5].


In fact, a plethora of NLP techniques exists and different NLP perform differently in different contexts [7].

it is important to characterize them according to the provided level of support.


Nodes with multiple labels indicate models that are observationally equivalent.

note that models A, B, C,and D have the alphabet X. they cannot be related through observational re.nement to models with an augmented alphabet Y, i.e.


As before, we can show that Inequality (5) is satisfied at node 9.

if V is not, Z, e,(~ _< ~-~( tribally follows from Equation (7).


[15] did not considered a scenario where model transformations are fragmented.

a speci.c solution for this reuse technique is necessary.


There is no publiclyaccessible record of the commitment, since the tuple is no longer present in the shared space; so the agent would need to utter n out locutions, each with a version of a tuple which contained a proposal to amend or revoke the original commitment.

for a proposed commitment which was accepted by all agents, and then revoked by all, Tuple Space theory would require 4(n-) utterances.


4.4 Logical Volume Managers We found that supporting logical volume managers and software RAID implementations is relatively straightforward: Not too many of them exist and are commonly used, and they have standard commands to list their con.gurations.

all that is required to support LVMs and software RAIDs is per-software sensors.


In particular, the platform provider should not stop essential services like security services that must run continually.

the problem addressed in this paper is as follows: The Home ICT Platform cannot guarantee the amount of memory that the SP bundles require .


Guidelines L2, L5, and L7 mean that non-public methods cannot be invalidated by subclass invariants.

in all cases, superclass methods are not invalidated and can be called.


Each variable access (read or write) has a con.ict tag, which is if that access may be involved in a race condition on a stable variable, and is E otherwise.

all accesses to unstable variables or correctly synchronized stable variables will have con.ict tag E. Existing analysis techniques [4, 11, 20, 36, 14] can be used to infer these con.ict tags.


Faults are caused by defects (e.g., software or hardware error), and are abnormal conditions that may cause a reduction in, or loss of, the capability of a functional unit to perform a required function.


Xscale is a single issue, in-order pipelined processor.

our simulation framework preserves the original program behavior.


We use the RFM ListLlist of Figure 3 as a running example in our discussions: ListLlist renames class List into LinkedList.

listLlist requires that List exist and LinkedList not exist in all legal compositions immediately before feature ListLlist.


Another feature is allowing citizens to easily inform the police that something wrong has happened at a specific location.

the police could arrive faster at the place where the event has occurred.


The rules in these two grammarsarenumbered and ruleswithidentical numbersmustbe simultaneously executed.

as a precondition both rules must be enabled, in order to apply a production rule.


and number is computed, which is number.


The evolution of the continuous state and the discrete state transitions are deterministic.

for any initial state, the simulation trajectory is uniquely de.ned.


The algorithm divides processes into batches of size n and labels the batches even or odd, alternately.

the .rst batch of processes acquiring tokens of 0, 1,...,n - 1 is an even batch; the next batch of processes with tokens n, n +1,..., 2n - 1 is an odd batch; the next batch with tokens 2n, 2n +1,..., 3n - 1 is an even batch; and so on.


Reasoning about a controller is simpli.ed, if we know, whether the control subject isastructure or aparameter.

thepro.le allows to annotate a property named control subject toacontroller.


(7)fp Pp.HPl Since Ll (represented by HT Gl)isnestedin Lj (eventually L0), and HT Gl is associated only to one task vl .

vj ,the contribution CCj,i,l (line 16) is then updated: CCj,i,l = CCj,i,l + HT Cl (8) the analysis can recursively continue until the computation of HT C0, associated to L0 and representing the estimation of the parallelized speci.cation, has been completed.


Each developed application needs to be tested on its target mobile phone before it can be accessible to final users.

specialized skilled teams test every application on hundreds of devices.


However, with the increasing complexity of software, developers are likely to design more informative and discriminative log messages to help them diagnose problems encountered by their customers in order to retain their customers.

approaches such as SherLog would be able to help in more cases.


We expect that those analyses will .nd clusters of false positives because those analyses do make mistakes, and some of them [11,12,15,23,24] went so far as to classify the false positives into several groups.

those analyses could leverage clustering in the error report inspection process.


The Barnes-Hut algorithm essentially depends on barriers that separate tree construction, force calculation and advancing of the bodies in each iteration.

dataflow implementations apply the fork-join approach similar to the task-based shared memory implementations.


In all versions of Surge, the routing protocol parameters were set as follows: sensor sampling happens every 8 seconds, parents are selected and route updates broadcast every 5 seconds, and link quality estimates are calculated every 25 seconds.

upon bootup, a node will have to wait at least 25 seconds before it performs the .rst link quality estimate.


The aim is also to show how it could be implemented.

the design and implementation of a prototype, where the concept is applied to home automation devices, is described.


Here SCM Pattern 1 corresponds to Producer/Consumer, Pattern 2 corresponds to Mainline, and Pattern 3 corresponds to Singleline.

two patterns: TPR MR and TPR SR Producer-Consumer pattern, which handles minor Top-Down modifications most cost-effectively, should be the most cost effective for reuse governance.


by interacting with the application, they can select the car of interest to rent, set the period for the rental (begin and end dates, in hour, day, month, and year), specify details about the car (preferences, requirements, constraints, etc.).


2.3 ServiceDescriptionandDiscovery An adaptive environment requires .exible service description and discovery mechanisms.

before each request the client gathers dynamically compiled metadata on the currentfunctional(FP) and non-functionalproperties(NFP) to update its view.


While the radio and MCU together may draw up to 23.4mA, the MCU alone already needs 8mA.

only shutting down the radio during Tsleep is not enough, we have to shutdown everything except the oscillator, which leads to the sleeping mode shown in Table 2.


As shown previously, validity condition is satis.ed as well.

the proposed algorithm is correct, and n = (d +2)f + 1 is su.cient for approximate consensus in asynchronous systems.


One bene.cial approach may consist in reducing the pipeline s activity while achieving acceptable performance.

we present a recon.gurable architecture that may dynamically adapt itself to an application s bitwidth behavior.


Conventional memory controller s scheduling algorithms (e.g., FR-FCFS [15, 33]) favor processing those memory requests with good row buffer locality in order to improve row buffer hit rate.

memory intensive applications, which have better locality can obtain higher priority than memory non-intensive applications.


The resource behavior of the overall system is determined by the composition of all the separate RUMs.

the designer can analyze the combined RUMs to understand the resource consumption of the system.


The di.culty of Java, compared with other main stream programming languages, is that several threads can be running in parallel and more than one can access the array indx.

it is possible for the elements of indx to be modi.ed before the statements with the comments are executed.


For example, in the case of a 483 × 64 lattice (see below for details) the norm of the residual as a function of iteration count di.ers by less than 0.14% between single-and half-precision in the preconditioner.

we use this mix of single-and half-precision throughout the benchmarks presented in this paper.


A signi.cantly more ef.cient .ow-sensitive pointer analysis algorithm would improve the practicality of such techniques, making .ow-sensitive pointer analysis even more useful.

we conclude that there are many reasons to seek a more scalable interprocedural .ow-sensitive pointer analysis.


Since a method that is moved from one class to another will no longer have access to private members of the original class, those members must be made public.

delegation can require the public interface of a class to change.


A wrapper function has only one argument (an array of void pointers) and is responsible for dispatching the kernel s arguments as the corresponding function parameters, as well as for invoking the function.

work-task descriptors only need to contain the address of the corresponding wrapper function and a pointer to its argument.


This is needed because the SMR algorithm scans the hazard pointer array in ascending index order, non-atomically, i.e., one hazard pointer at a time [17].

the indices of *hp0, *hp1, and *hp2 must be in ascending order, respectively.


The systems can be legacy or new systems with operational and managerial independence.

two levels may be considered in a SoS representation: the SoS-level and the CS-level (Constituent Systems level).


However, care must be taken to simply generalize those positive reports to the domain of agents, because multi-agent systems have speci.c properties that should be re.ected in the methodology.

a theoretical assessment of whether and when XP is suitable for multi-agent systems should be derived from the speci.c attributes of agent systems.


Declarative languages are more abstract than their imperative counterparts, since it is not necessary an algorithmic description of the application, but rather the description of the author's final intention.

development approaches for these languages also tend to be more abstract, using a conceptual model suitable for application authoring.


It is the most complex case, because we need to .lter the tra.c in the intermediate hosts and analyze the transient messages.

since the intercepted distributed aspect must remain untouched, we need to natively provide a way for distributed meta-aspects to invoke any existing remote method or advice.


For example, if we increase the snapshot interval from 10 to 60, the SCT Max/Avg ratio decreases from 3.0 to 1.9.

the total update throughput increases by 10%.


Finally, the company has decided that external employees should report to managers too.

the merge between the two branches for internal and external new employees has moved up , in between the  Figure 2: Versions 3 and 4 of the hire activity interview and the report nodes.


Since InputStream is not a subclass of Stream, it cannot call its constructor.

there is no constructor invocation problem: InputOutputStream does not inherit two different calls to Stream as before.


Therefore, if Q1 * Qn is in a normal end component then we can .nd a subset of fullpaths starting from states in Qsuch that it has a non-zero probability of not containing failure event.

the P-diagnosability of a system Mcan be decided by the following algorithm.


This was particularly problematic for loops: If one pushes the arena declaration inside the loop then a fresh arena is created and destroyed for each iteration.

no data can be carried from one iteration to the next, unless they are copied to an arena declared outside the loop.


Our definition of a cloud is not limited to a single data center, but covers the spectrum from smartphones and laptops running VMs to dedicated local infrastructure combined with shared resources rented from utility providers.

our proposed system supports both strict and eventual consistency models, to allow consistent periodic o.-site backups, long-distance VM migration, and o.-line use of VMs running on disconnected devices such as laptops and smartphones.


If program D checks whether the sequence of bits belongs to p[S] outputting 1 in that case and 0 otherwise, then its results would always be 1 with p, but only half of the time or less with fully random bits.

any pseudorandom number generator p can be distin guished from a fully random choice of bits in the sense of informa tion theory, that is when the distinguishing program has unlimited re sources.


Nevertheless, there has not been any attempt to derive structure correspondences from the element correspondences, as we do in this paper.

editing view structures is not permitted in semantic bidirectionalization, while our approach only optimizes a given put function instead of creating one.


Consequently, the algorithm may choose to postpone the servicing of real-time requests and serve best-effort requests instead, if this serves the overall optimization goal (throughput or latency) better.

disk scheduling algorithms of this class are insufficient for our purposes.


Since the director is decoupled from the workflow structure, a user can easily change the computational model by replacing the director using the Kepler graphical user interface.

a workflow can execute either in a sequential manner, e.g., using the Synchronous Data Flow (SDF) director, or in a parallel manner, e.g., using the Process Network (PN) director.


There is no type statement, but there are both of the required properties.

a program may miss citizens, if it quanti.ed data on the grounds of the nominal citizen type.


Our exploration heuristic is designed to operate on static program models, which may be inadequate to represent all the dynamic relationships found in code.

for our approach to fully explore the code relevant to a maintenance task, the user must add seed methods that are not connected by statically available edges.


INTRODUCTION Flash memory has strong points: non-volatility, fast access speed, shock resistance, and low power consumption.

it is widely used in embedded applications, mobile devices, and so on.


Our system model is not tied to any particular domain and its entities do not contain version numbers since all objects share a global version space.

this enables the reuse of our product versioning SCM infrastructure (see Section 7).


we want a model whichperforms well forvariousoperatingpercentage of SLOC.


There is a trade-off between the performance of resource and the resource purchasing cost.

many previous researches have been focused on finding the optimal point between the performance of VM instance and the allocated resource cost in accordance with the cloud service users' requests [2,3,4].


In addition, the simulation results show that the utilization of block ACK can be increased because, in case of stations having large MSIs, TXOP allocated at each SI is possible to be increased.

the total transmission rate and the number of stations served by HCCA are increased.


They also provide primitive recursion at the type level.

they can de.ne new kinds within their calculus and directly encode type analysis operators within their language.


The original study involved only subjects with a high proficiency level of English, thus suggesting that the usefulness of MT would improve when used by individuals who are not able to communicate in English as in their mother tongue.

in the replicated experiment, we only involved subjects with a low proficiency level in English.


In these handlers, SpecFail .ag of the corresponding parallel thread is set to true and recovery point is set to the beginning of the task.

during the recovery, the parallel thread can reexecute its task with the latest values of all live-in variables and exceptions will not take place any more.


Even when a match with expression with many cases (i.e., pairs of a pattern and an expression), it creates only one join point.

there is no direct means to advise in the middle of pattern matching.


Compared to full-.edged computation nodes, cheap microcontrollers su.er from an adaptation overhead that stems from their hardware technology in terms of adaptation time or memory wear: dynamic provisioning of component types requires writing a program in .ash memory.

implementing Kevoree concepts for microcontrollers nodes relies on a precise trade-o.


following a model-based development approach these existing tools quickly become incapable to supply information to the developer he can work with.

the developer needs adequate possibilities to view and control a modeled system during runtime using views as close to the modeling notation as possible.


Our registry description and organization is based only on implicit knowledge using existing advertised service descriptions.

our approach is self-contained within the web service discovery process, independent from any explicit or human centric or error prone knowledge.


Such fixed-time constraints actually do not need to take any checkpoints.

the verification of them is unnecessary, which can severely impact the efficiency of overall temporal verification since there are normally a large number of fixed-time constraints in a grid workflow.


Many of the issues encountered by weaving aspects for HILA also apply to the implementation of semantic aspect systems for concurrent, state-based languages in general.

the techniques presented in this paper are not only a description of the implementation strategy we have used for our current HILA system, they can also serve as guideline for implementors of other aspect-oriented languages.


Objects, however, are shared among all inlined methods and must be reallocated exactly once during deoptimization.

the debugging information speci.es separate scope entries for each inlined method, but only one set of object entries.


As the development of cloud-based services increases, so will the need for testing their applications.

this paper presents the development proposal of a Cloud Testing framework capable of testing cloud computing applications.


However, the restrictions on hardware may prevent all tasks from existing in hardware simultaneously.

some expert must .gure out which tasks should use a software con.guration and which should use hardware for any given system state.


(Nk' , Tk' ) can exist, k"" " = r((Nk' , Tk' )) is always maximal with respect to the upper bound k" .

we compute the optimal pro.le for a given k" .


(Simon A.H (1995): The Scientist as problem solver, cited from [30]).

technical designers used to rational thinking can represent the design process itself as a welldefined algorithmic structure.


VPAL allows the specification of modifications using a simple yet powerful syntax.

vPAL is a language with no data type declarations, procedures, control flow, loops and classes.


The main problem associated with this type of degeneration is that the modified framework code might not be compatible with the code of certain family members anymore.

the code maintenance tasks for both framework and members become cumbersome to maintain.


To limit the amount of sampled data and to shorten the time required for the temperaturesimulations,wetooksamplesonlyevery100th second.

during a test run, the programs ran 99 seconds without sampling, then, during the following second, we took 1000 samples, let the program run for 99 seconds without sampling again, and so forth.


Even though some existing work has addressed scalability problems related to analysis of FSAbased properties for large programs (e.g., [10, 8]) as well as handling of dynamic features (e.g., [24, 16]), the current state of the art does not provide enough evidence that static analysis of patterns in EJB application can achieve correctness and precision at a practical cost.

we believe that for such applications the use of dynamic analysis is a more natural choice, at least until more advances are made in static analysis research.


Our research group is mainly interested in human aspects of the software development, and has conducted systematic reviews in areas such as personality of programmers [12], motivation of software engineers [13], distributed software development [14].

we decided to run this worked example on software development teams performance.


A contribution network is composed of binaries and the developers that contributed to those binaries.

a node representing a developer is connected to all binaries the developer has contributed to and a node representing a binary is connected to all developers that contributed to it.


However, a second order operator, the map, is used to distribute the jacobi_helper over the elements of the matrix.

one must know how this specialized operator works and work through the i,j manipulations to be certain that indeed the two functions implement the specified equation.


Not only are they becoming more widely used, but they are also becoming more advanced, more complication and diversification .

the importance of the quality of the software increases more and more.


It is worth noting that while some inspector-executor schemes seek to parallelize and preserve data dependences in sequential user code, ZPL s statements are explicitly parallel and have clear data dependences.

our inspector is concerned with maximizing performance rather than preserving correctness.


For example, the Data Compression components calculate a minimum, average, and maximum value for their respective channel (i.e., Sensor).

they need to know the userspecified interval length of the appropriate sensor, which thus has to be passed as a parameter to the component s template.


Each thread that wants to execute OMI and its corresponding SMIs atomically, grabs the lock associated with the memory region and releases the lock at the end of the atomic block.

this approach only serializes original and shadow instructions that operate on the same region; the size of the region is a trade-off between space and time.


A and A ' could be similar because A ' is modi.ed from A.


Computer hardware is constantly evolving and new languages are being developed in order to make good use of new hardware architectures.

we hope that by comparing these two models we will be able to establish whether certain scenarios tend to be more appropriate for actors rather than agents and vice-versa, both in terms of naturalness of the paradigm for the development of those scenarios, and in terms of actual performance.


It dominates the implementation of many modules, including many of them not located in the system s business layer.

developers are not able to fully understand in a short time frame all different facets of Business, such as Complaint, Health Unit, Disease, and so on.


Please note that each branch has a different type and the return type of generic add depends on the type parameter t. MetaML does not provide computation over types and it records the type of a code fragment in the meta-level type of the code, i.e., code T instead of just code.

applying a MetaML-style type system to a re.ective metaprogramming language, like Garcia s calculus, would restrict the set of metaprograms we can write.


Input quantities are re.ned to concrete sensor inputs for the system, and system outputs are abstracted to output quantities in.uencing the environment.

the set of interaction points is the set of all but the hidden quantities.


6 Conclusion and related work In o'7r, objects of different components may interact (via channels) without a priori knowledge of the internal class structure of the component to which the other object be- longs.

one component can be replaced by another, provided that they both exhibit the same communication behavior.


As described in Section 4, any technique for test case selection the testers may decide to apply can be supported by on-line execution with OCT.

in terms of future work, a detailed investigation of test selection strategies for on-line testing is of orthogonal concern to OCT.


In all design models, each probe sweeps over a bounded area of the media sled, called the probe (storage) .eld as sketched in Figure 2b.

seek times shorten and a relatively high (aggregate) data rate is attainable by operating many probes simultaneously, so that each probe accesses a small part of a sector, called a subsector.


The energy cost varies every hour in reality.

the group is recon.gured every onehourbased ontheenergy cost.


This implies however that either v or w is in V ' , once again covering the edge.

we have demonstrated a vertex cover of size at most t. Theorem 4.


Note that this does not say that for every linear code the Johnson bound on list decoding radius is the correct one rather, it says there exist some codes for which this is the case.

indeed it is known that for most linear codes, the Johnson radius is not the best possible bound on the list decoding radius.1 purely as a function of the distance of the code, the Johnson radius gives (asymptotically) the best possible bound on list decoding radius.


However, a comprehensive experiment is necessary to evaluate its effectiveness in an independent environment.

our future work will focus on the use of different viewers to judge the logical areas of the sample spreadsheets; inclusion of large spreadsheets into the samples; assessing the degree of disagreement between logical areas and clusters when a node/cell is allowed to belong to more than one logical area; modification of the MCL algorithm to handle the possibility of a node/cell belonging to more than one cluster; and experimental comparison of the different visualization techniques.


We do not just send the data any time the logging bu.er .lls up because this can happen very quickly in some software monitoring scenarios.

to limit monitoring overhead, we restrict sending data to at most once per con.gured time interval.


In this case, the button and continuation store form is not used.

we put initForm at the corresponding argument position.


For example, the XML .le for class ManagerEJB does not work with any other class.

the knowledge about persisting ManagerEJB cannot be reused even for the classes in the same application.


Therefore, every actioninthe second versionof inc is both a right and a left mover.

the entire loop is reducible to a single atomic action.


in the following we will use the number of views as the measure of video popularity.


is the set of links instantiating the associations.

d represents the space de.ned by all instances of ..


For example /a/ is a phoneme, which can be spoken in various ways.

if a recognizer is able to divide each word into its phones and to assign the phone to the adequate phoneme, only one representation model is needed for each phoneme.


In particular, the through at least one Ne edge, we can conclude that there are no paths from states in .0 to states in .k.

we can add a not-may summary between these two sets of states after quantifying out the local variables that are irrelevant to the calling contexts.


None of these studies, however, look at the characteristics of individual application behaviors; instead, they analyze trends seen in prolonged usage.

our study complements the breadth of this research with a more focused examination, providing speci.c information on the causes of the behaviors we observe, and is one of the .rst to address the interaction of multimedia applications with the .le system.


Example automaton tomaton versions consistent in all the parameters bound by the transition statement change state; if an automaton version is inconsistent in any parameter, its state remains the same.

for the automaton versions that change state, the new map is computed by replacing each m(f) with the meet m(f)no, where o is the object bound to f by the transition statement.


In contrast, our approach first inserts a sign extension (5) and next eliminates sign extensions selectively starting with the most frequently executed region.

if the compiler judges that (5) is more frequently executed than (3), the sign extension (5) will be eliminated.


In some settings unique names are available, but come from a very large, practically unbounded namespace, which reduces their usefulness.

the renaming problem, in which a set of processes are assigned distinct names from a small namespace, is one of the fundamental problems in distributed computing, and a signi.cant amount of research, e.g.


The origins of the present approach are due to the utilized dynamic fitness scheme and evaluation.

it becomes possible to effectively direct the search process towards killing the targeted mutants.


Most template-based 3http://qt.nokia.com/ 4http://msdn.microsoft.com/en-us/library/ dd940543(VS.85).aspx  gesture recognition solutions perform an of.ine gesture detection which means that the effect of the user input will only be visible after the complete gesture has been performed.

template-based approaches are not suitable for a number of multi-touch gestures (e.g.


Second, if a continuation is embedded in a URL and given to the user, then it is possible to manipulate the continuation in its serialized form.

the environment and Web cell contents are not secure when handled directly by users.


Ifso, it will call the replica method for the variable s object; if not, it will report that no replica method could be found.

thecompiler considers the statement s := t to be special syntax for s := t.replica().


A modi.ed trace replays part of a previous execution to a speci.c point, then runs nondeterministically from that point onward.

it is di.cult to control which interleavings are discovered and tested .rst.


Therefore, in this loop nest, an array element has a degree of sharing of either 1 (for x and y) or 8 (for z).

ideally, we should replicate an array element either in all processors or in no processor at all.


Improvement of RNFTL over Original NFTL (%) Improvement of RNFTL over Revised NFTL (%) 128MB 96.75 48.04 256MB 96.77 48.24 64GB 96.77 48.39 is relatively close to that of NAND .ash with size 128MB and 256MB.

in the experiments, we choose 128MB NAND .ash memory to evaluate our RNFTL scheme.


The alternative would be to keep the application live and .x the bug later by risking a lack of payments.

on-the-.y updating is a required feature for maintaining end-user satisfaction due to more frequent patches and regular maintenance.


Second, PCA and Vivaldi try to represent non-linear relationships using linear ones.

the process of accommodating these discrepancies causes the dimensionality to in.ate.


1 Scriptable compile(Object[] args) { 2 String s = ScriptRuntime.toString(args[0]); 3 String glob = ScriptRuntime.toString(args[1]); 4 re = (RECompiled)compileRE(s, glob, false); 5 lastIndex = 0; 6 return this; 7} Intuitively, the call on line 4 is very important towards achieving the intended functionality of compile.

in a summary of a method, M, we include the same-action s units.


Thus, int x; has a similar identi.er than int a=0;, and may be placed after.


To construct a system that satis.es all its requirements is often not possible.

architects have to come up with several design alternatives.


Flow-chart nodes sion e. Hence, for any af.ne combination of two symbolic states S EwS ;, one can easily verify that V (e,k,S EwS ;)wXV (e,k,S )+ (1 -w)XV (e,k,S ;).

if V (e1,k,S )V (e2,k,S )and V (e1,k,S ;)V (e2,k,S ;), then V (e1,k,S EwS ;)V (e2,k,S EwS ;).


Since OpenCOPI represents an additional layer between ubiquitous applications and services provided by many platforms, it is expected that the use of OpenCOPI increases the overall processing time and therefore the response time for users.

it is important to measure the impact of OpenCOPI in the application execution time and if this impact is either significant or negligible from the point of view of the user s experience.


This tool is mostly intended for interactive use: distributed machines administration and parallel applications development.

it has to minimize the time required to complete the whole deployment process.


All the following ZEND SEND operations and the function call itself use this index to identify the function and its format parameters.

this index must be stored in memory in a location accessibleby these operations.For this purpose, we use a third stack, the function name stack.


As modal speci.cations, timed modal speci.cations admit a rich composition algebra with product, conjunction and residuation operators.

a natural direction for future research would be to unify timed interface automata and timed modal speci.cations.


When our processor is applied, Spoon automatically removes the Bound annotation from the processed program, since Bound is defined as a consumed annotation.

the generated code for our stack is: public class Stack { public void push(T element) { if (elements.size()>=5) { throw new RuntimeException("overflow");} elements.add(0,element); } public T pop() { T element=elements.get(0); elements.remove(0); return element; } } CT reflection is a very flexible technique.


When the query dom(o1,o2) isevaluated, the thread thatinvokes it is the current thread ct, and it has at least one stack pointer tothe object pointedtoby o2,namely the argumento2 of the query.

the object pointed to by o2 is not dominated by the object pointed to by o1.


However, a small feasible value set is not on its own a guarantee that no attack is possible, for instance if an attacker is able to .ll most of a program s memory with copies of malicious code.

we expect that in general the in.uence of an untrusted input over the program counter will be nearly 32 bits in the case of a control-.ow hijacking attack, and nearly 0 bits otherwise, with cases in between being relatively rare.


On the other hand, excluding one release from the training set affects the model very slightly.

we decided to use the overlaping approach.


Note that we found that some grammars (notably the Java grammar of [6]) use kernel syntax for LAYOUT productions to more precisely control how comments are parsed.

we consider both lexical and kernel syntax for the commentterminating rules.


As shown in the .fth column of Table 5, the number of writes conducted in slow mode is very small.

both code size and runtime overhead are very small.


branch coverage, or path coverage), and identifying inputs that cause a path to be triggered.

a path partitions the input space of a sequence diagrams into test case data inputs.


L is initialized to amin,where amin · n 3 > mini(fi + cij ) for every client j.

if client j were to run k1 iterations of the Primal-Dual Algorithm, then its aj value 3/k1 )k1 3 would grow from amin to amin · (n = amin · n> mini(fi + cij ).


In case of NAND flash based file system, this problem will become more severe, since free log blocks are consumed fast and thus should be preserved by heavy garbage collection which is a serious burden on the FTL.

to relieve the FTL from such problem, it is critical to maintain files defragmented.


with smoke tests which can be regarded as the simplest partial oracle.

partial oracles can be implicitly combined with such smoke tests, for instance by means of an adequate exception handling, or smoke tests can be used as a .rst step to reveal invalid indexes or references.


The latter three analyses identified only a few changes and no function in Application A calls any affected functions in the components, although the changes did affect some exported functions in the components.

we achieved 100% regression test case reduction for these three comparisons.


The enlargement process tries to expand the window in order to include as many points from the current cluster as possible.

the range of each window is enlarged for each coordinate by a user defined expansion threshold, proportionally to the number of previous valid enlargements.


For each their origin in the split structures).

the data can split structure, the pool meta data is passed in to the func be reordered in memory by applying a permutation to the tion as a pool descriptor.


This di.erence is explained by the performance characteristics of the storage media: While the random access performance on the HDD depends directly on the distance of the accessed data to the current drive-head position (as well as hits in the drive readahead cache having a huge in.uence), the SSD performance is mostly independent from the data position.

the e.ect of di.erent allocation strategies becomes very obvious on the HDD.


This is due only to implementation deficiencies outside of the transactional sub-system and is transparent to it.

these data or-gunization problems lead to numerous large files, which could easily be avoided through metadata reorganization_ we believe it is fair to evaluate transactional performance using the real cluster size and not its date content.


However, thisapproachisnot alwaysapplicable, especiallyoutsidethe server domain.

we have to deal with situations where a considerable number of computers runs at a low or medium utilization.


Instead of computing transitive closure for all local variables, they restrict the computation to procedure parameters.

the complexity to compute summary edges is O(pn 2 ) as opposed to O(n 3 ) for Warshall s algorithm, where p is the number of procedure parameters and n is the number of variables used in the procedure [13].


However, having to upload audio-video files to the website server via the Internet, users are unable to share real-time audio-video files (TV and radio programs), and the download speed may slow down or the bandwidth may be insufficient when the number of hits are too high.

this study proposes a dynamic audio-video sharing platform system, which allows users to share audio-video files through USB port, DVD reader, or commonly available interface.