In International Conference for High Performance Computing, Networking, Storage and Analysis (SC 10), Nov. 2010.

if the scheduling decisions were made at the point at which expiring timers hit .rst, then the scheduler would be able to control and adjust all timer based events in the system based on the scheduling policy and other tunables suitable for di.erent platforms such as laptops,desktops,smallclusters,andHPC environments.


Even without going to the lengths of partial correctness proofs, we have found that the level of static analysis supported in minimal SPARK to be very useful in protecting the integrity of large systems during significant refactoring efforts.

now we have enough information to make a static refactoring work.


TECHNICAL OVERVIEW GUIGraph presents the user with a graph editor with which they create a UML-like object diagram.

[9] Pinheiro da Silva, P. User Interface Declarative Models and Development Environments: A Survey.


Another issue was consistency throughout the various parts of the experiment.

in our experience, one of the biggest stumbling blocks to the use of formal specification languages in industry relates to readability.


General terms The general terms are these terms: Management, Documentation, and Design.

the time complexity for our framework will be O ( T T ) in the worst case.


The MK4001MTD has low active power consumption 3.8 times and low standby power consumption 2.1 times as much as the Travelstar 80GN, but its access time is 1.27 times longer than that of the Travelstar 80GN.

if the frequency of file access varies significantly with time, PDC may cause a lot of file migration, which itself uses energy and also limits the possibility of energy saving by idle disks.


When node A leaves and rejoins the network, all 4 nodes have the ID space of the same size and 2 neighbors eventually.

the ID space transformation makes the distribution of ID Covers near-uniform.


This framework is validated against Orion [32], which is a cycle-accurate network power-performance simulator.

4.3 Example In this section, we present a simple example to demonstrate how the proposed compiler-based approach works in practice.


N, ci(v) = 1 if v is contained in SI G(si), otherwise ci(v) = 0.

indeed, there already exist some commercial products involving Web applications, so that the users can con.gure and control the product from PCs through a Web interface (e.g.,[17, 21]).


The handlers of a mission are assumed to be scheduled using their release parameters from a common initial time point.

we investigate an automated schedulability analysis of programs that use .nalizers in a setting with a disciplined use of scoped memory, for instance as we propose in Predictable Java [2].


Just as call/cc affords one the power of explicit continuations while allowing one to write in direct style, map-closure affords one the power of explicit closure environments while allowing one to write in higher-order style.

one bookkeeping issue relevant to our purpose does arise.


They are not quite Graphlab s style as distribution introduced large amount of extra message passing.

mizan: a system for dynamic load balancing in large-scale graph processing[C]//Proceedings of the 8th ACM European Conference on Computer Systems.


To compile the clusters found by our clustering technique into sequential loops, we use data .ow fusion [12].

for example xa,A = xa,b means that nodes a and b can be no more fused than nodes a and A.


We have previously discussed merging feature models from alternative suppliers for a particular feature area [15], while maintaining the links to the development artifacts.

they do not consider the creation of glue components.


Glb(v) n Exc(r) m (exception3) * | v vglb(x)(next-fail) .

4.1 The Membership Algorithm First, consider a sequential algorithm for deciding membership of akey in atree.


It also computes the (message) complexity of the stabilization period of the original algorithm, which is O(N3), and the improved ver-sion, which is ®(N 2 log N), where N is the number of pro- cesses plus the number of messages in transit.

with prob- ability at least 3/4, E2 occurred, where E2 is the event "the ratio is less than 8".


Asynchronous I/O (AIO), which issues multiple requests in a single thread, provides a better option for accessing SSDs.

experiments use the con.gurations shown in Table 2 if not stated otherwise.


The above algorithm and parameter values are intuitively decided on the basis of the results of objective sound quality measurement, not on auditory theory or human perception.

several improvements on values of the parameters and the decision algorithm of AM depth by considering modulation masking are implemented.


These patterns are re.ected in the compiled code through additional information that is used by the other framework components in the adaptation process.

when several adaptations have an equal goodness value, the choice is delegated to something else.


The local line-of-sight communication is addressable to a given neighbor cell, but the global communication is a broadcast and is not addressable to any given cell.

multicellular organisms are built from independent hardware units, or cells.


Charmdebugisagraphicaltool thatallowsprogrammersto debug large scale parallel programs.

it a.ects the time taken by last level charmruns to startup the clients.


another motivation for them is in terms of implementation, since a prompt limits the amount of control information that can be manipulated by call/cc, thus facilitating stack allocation.


For the design of our algorithms we employ new techniques which we have combined with existing ones (or with extended versions of them); the proofs of our results are complicated.

we now prove that SCANS return consistent vectors.


Note that for the UDP implementation the set of parameters (interval, readPort and writePort) are different.

such heterogeneity makes it hard to build truly reusable computation units.


In the synchronous model, the computation proceeds in rounds, and all messages sent to a process s in round i are delivered simultaneously in round i +1.

the basic idea is to analyze the sequence of graphs Gt derived from the neighbor lists Nu at each time t.We use M for the time to perform a merge operation and D for the maximum message delay; note that since the nodes in the protocol may in fact be trees simulating single supernodes, D can be as large as the depth of the tree.


the space requirement for these pointers is not very high, since there is only one code pointer per stack frame.


2.1.3 Real-Time Server Component The real-time server component is responsible for the real-time propagation of any changes on a document done within an editor to all the editors who are working or have opened the same document.

a special communication protocol is used: the update protocol.


Thisprocess, constrained by the limits of modern optimizing compilers, yielded a speedup of 454% on these applications.

alias  (a) 256.bzip2 (b) 255.vortex (c) 253.perlbmk (d) 181.mcf Figure 4.


We separate the problem into two cases, mostly for e.ciency reasons.

we form clone pairs into clone clusters by .nding groups of clone pairs that have similar normalized instruction sequences.


7 03700 Denia, Spain Campus da Penteada 7491 Trondheim, Norway +34 966 435555 9000-390 Funchal, Portugal +47 73593443 +351 291 705150 hal@idi.ntnu.no pjmolina@care-t.com njn@uma.pt ABSTRACT Model-based IU is an established discipline.

iUI 04, Jan. 13 16, 2004, Madeira, Funchal, Portugal.


We are currently extending the monitoring support of GUMSMP to provide per-thread statistics.

speci.cally, we ensured that we sent out at least n sparks to other PEs, before other capabilities on the main PE are permitted to pick up work.


A small hypervisor ensures proper isolation of the software domains and lets them run on one system in parallel.

with this TCM setup, execution times in the range of hot caches can be achieved.


Specific research efforts involving integration between BANs and Cloud computing include a Cloud-enabled system based on an integrative gaming paradigm [10], a Cloud-based ECG data analysis service [11], and BodyCloud [3, 4].

users can create new BodyCloud services by defining the aforementioned entities: groups, modalities, workflows, and views.


Java is targeted to be one of the most popular execution environments on such systems.

we checked the most common classes like java.lang.Object, java.lang.Class, java.lang.String, etc.


Our results found that object pools are a powerful abstraction for guiding exploration, orthogonal to the path-bounding approaches used by tools such as Pex.

for example, getInt(int lo, int hi) returns an integer between lo and hi, inclusively; and getBoolean() returns a boolean value.


Essentially, with dependency injection, a multi-tenant application is designed as a software product line with run-time binding of software variations [27].

take the case of a particular travel agency that wants to be able to o.er discounts to their returning customers or during the low season.


For strings it is either possible to randomly generate a random string bound by a maximum length, or to randomly pick one or more items from a userde.ned list (e.g., a dictionary).

bindings are chosen using optimization approaches, such as those proposed by Zeng et al.


ACKNOWLEDGMENTS This work is partially supported by the 7th FP EU project 4CaaSt (Building the PaaS Cloud of the Future) with grant agreement no.

in Section 2 we review the solutions and proposals of context-aware P/S models.


Studies [13, 16] have found that the energy consumption in memory can be up to 200 times higher than the consumption resulting from cache hits [13].

we then analyze a suite of benchmark programs representative of current embedded applications, measuring several metrics that include reference behaviors of Java objects, reference count, cache behaviors, instruction count, and garbage collection invocations.


It illustrates that as sum of variances (x-axis, normalized) decreases, so does the 99th percentile of latency (y-axis, normalized).

due to the non-convexity of (3), our algorithm has no performance guarantees.


Morespeci.cally, Container isa type parameter that itselftakes one type parameter.

adhoc polymorphism also allows types to drive the selection of functionality as demonstrated by the selection of (implicit) instances of Buildable[C] in our Iterable example6.


This is done via two additional components the orchestration interpreter, and the service dispatcher in the following sequence: 1.

a caller is only aware of the service contract, and not the actual service implementation itself.


Once again, the Comet program associates a queen with every column and it uses queen[i] to denote the row of the queen on column i.

comet supports a layered architecture cleanly separating modeling and search aspects of the programs, constraints encapsulating incremental algorithms, and various control abstraction to simplify neighborhood exploration and meta-heuristics.


Our protocol allows the aggregation of sensor readings while maintaining end-to-end privacy of both individual sensor readings and the aggregate result.

a single link failure in this model leads to the loss of all data from the subtree connected by that link.


Is itpossible for entities in a LBS system(mobile user, LBS provider, mobile operator) to encode and exchange information they possess, in a manner that removes the need for a separate matching service?

in this paper we outline an architecture for a structured overlay DHT [6] based decentralized implementation of such a service, and argue that with this approachitwillbeimpossibleforanyparticipating parties to recreate the crucial information about users.


Unfortunately, mesh re.nement involves modifying several data structures by inserting new mesh objects and altering their relationships.

a data remapper uses the computed partitioning to distribute the cells and their corresponding particles, thereby creating a cost balanced local tree on each processor.


The content of context is very subjective to a particular application.

a taxonomy of variability realization techniques: Research articles.


Respondents were then presented with a list of characteristics which could be used to describe a defect and asked to select those which they felt caused the most problems.

the danger is that an asneeded approach will force inspectors to make unverified assumptions that lead to the kinds of defects illustrated in the experiment.


Uncoarsened groups of operations are considered for movement across partitions when they appear favorable in terms of reducing schedule length or resource saturation.

distributing data across these simpler memories and then taking advantage of it in the compiler is not a simple task.


In Symposium on Theory of Computing (STOC), pages 459 468, Portland, Oregon, United States, May 2000.

no tile can attach at a nucleation site unless  GGGG 1,1 1,2 1,3 1,4 G G4,4 2,4 G G G1 4,3 2,3 G4 G 2G G 4,2 2,2 G 3G G 4,1 2,1 8 7 6 7 3 4 5 6 2 3 4 7 1 2 3 8 GGGG 3,1 3,2 3,3 3,4 (a) (b) Figure 1: (a)The structure of 4x4 block.


THE STATE OF PLAY Changes to the urban fabric share some of the same characteristics as new software applications, whether at the relatively small scale of a new public sculpture or the very large scale of new buildings, parks, roads, or entire new districts.

the development of the mobile application on Android offered a good complement to jMonkey.


finding of the research study on usability impact of small displays for retrieval tasks that users of the small screen were 50% less effective in completing tasks than the large screen subjects seems obvious [14].

2002, "Usability for mobile commerce across multiple form factors", Journal of Electronic Commerce Research, vol.


We focus on the mobl language, which has a complete syntactic and semantic language de.nition for Spoofax.

we are con.dent that by implementing a Spoofax project compiler which is optimized for producing JavaScript code we can positively affect the JavaScript implementation s performance to a signi.cant degree.


This problem is known to be undecidable [15].

ageneral overview of the structure and functioning of the S Bestie architecture is provided in Figure 1.


Column 1 shows the di.erent bad smells introduced in Section 4.

however, the subsequent iterations also improve the reengineer s understanding of the system because they reveal a clearer, albeit reengineered, architecture.


The virtual triplines scheme[12]proposesaway to determine when it is safe from the standpoint of privacyfor a vehicle to reportits position using sucha quanti.cation.

we chose to use the .rst metric, as it more accurately re.ects the road segments that drivers view as hotspots.


Our original intention was to fix our test recall level at 90% (325 out of 361 correct links retrieved).

the analyst always correctly identifies the nature of the observed link, and 2.


On one hand, runtime transitions between FTMs are performed with a minimal set of changes.

note that this stage preserves the separation of concerns as the deployment architecture allows runtime adaptation of the FTMs without impacting the functional components.


EventCJ manages active layers based on events that trigger transition of layers, instead of controlling the layer activation on the basis of the dynamic scope of executions.

for example, in the pedestrian navigation system, activation of the WifiNavi layer may be triggered by the following event handler onStatusChanged that handles an event detected by a change of the GPS system status indicating the entrance of a building: 1 void onStatusChanged(...) { 2 overlay.onProviderDisabled("gps"); 3 wifiManager.setWifiEnabled(true); 4 // WifiNavi shall be active, but... 5 } the onStatusChanged method itself does not call the run method, which should exhibit context-dependent behavior.


In a dynamic environment, the convergence procedure repeats every time when the ground truth status changes.

the trust value Tij](t) is a real number in the range of [0, 1] where 1 indicates complete trust, 0.5 ignorance, and 0 distrust.


CAs are used for a wide range of purposes in Coven.

clearCase has no notion of a consistent subproject, which prevents or re- stricts the use of the flexible coordination mechanisms similar to those provided by Coven.


For other query types, such as metadata retrieval or multimedia authoring, a best-effort service may suffice.

categories and Subject Descriptors D.4.7 : Organization and Design; D.4.8 : Performance.


If result is not an exception, it is returned (line 14).

aspect) : Undeployer) 10 (result <-(do body ...) : Any) 11 (remove-dynamic!


before the insertion events) 1-utilized nodes, and the remaining nodes were originally 1 -3E-utilized.

gPFS: A shared-disk .le system for large computing clusters.


Thus, in these applications, the semantic locality (i.e., query similarity) is employed as the basis for cache replacement strategy, and the cache not only stores the results of the queries, but also stores the semantic description of the queries.

since in these caching schemes, the aim is to bring relevant set of data into the cache to satisfy the future requests.


As a result, we must map a negative index expression to a page that is guaranteed to be unmapped.

our implementation signi.cantly reduces the internal fragmentation of the directories, leading to a reduction in memory usage by processes using ICRs.


In most cases, one and only one mapping with a high confidence level will be found, and thus the mechanism will be transparent to the user.

automatic identification of such structures is done using name-based heuristics and by examining instance characteristics for consistency with the expected structure.


The criteria for choosing the criteria list are: they should targeting both traditional computers and small screen devices.

there is a risk that practitioners (or other users of criteria) are unaware of the existence of levels.


But this implies a full sequence coverage of T rans, which would lead to an excessive and possibly in.nite number of test cases.

this enables our approach to increase test signi.cance by testing whether a valid target state has been reached and whether a guard was blocking correctly or not.


Here each element of the toplevel list is flattened into a table row, with the table titles indicating the hierarchy.

if it, in addition, uses information provided by the end-user and/or programmer, then it supports semiautomatic generation.


java Resources for Computer Science Instruction.


bj (x))) (5) j i This test still requires a runtime of k2 · i · j, with k as the maximum number of intervals of a predicate.

2.1 Restrictions on Predicate De.nitions To guarantee decidability we have to bound the complexity of testing the implication between single predicates.


Table 1 illustrates that in order to adhere to medical device guidelines that both of the activities required for CMMI® SP 1.1-1 (Determine risk sources and categories) are necessary.

the RMCM may then be adopted by medical device companies to improve their software development practices by providing them with a SPI model.


In the case of the Trending application, the following alternative solutions were evaluated Alternative 1: Limiting the user from querying large amounts of data in a single request.

when a user wants to search for relevant past experience for a current project, he has to manually look up the performance repository, open each document for perusal, and then figure out whether the data in the document offers insight towards solving the current problem.


Turning to individual programs, consider the formal and global dependence bubble charts for the programs copia and prepro.

also, as can be quickly seen, this bubble is considerably larger than the others.


The node manager assigns the CPUs comprising an execution object when creating the object, and does not choose from available CPUs when dispatching a thread.

if the tax rate is 1, then task A receives all of its  Figure 3.


During some phases of execution, function calls are frequent; in other phases, calls are much less frequent.

among the ARM binaries, on one end of the spectrum is vpr where, on average, one must wait only 84 dynamic instructions until the next possible transformation opportunity.


The motivation to provide open access to such data will involve a combination of requirements prescribed for data delivery, and the provision of support services and financial rewards, in particular changing the views held by the professional scientific community about the benefits of open data for research activities.

narrow professional fields are the most important when it comes to defining and following high quality measures.


BdHCO-tree with order of Hibert curve being 2 The order of the Hilbert curve can be changed when the density of moving objects changes.

in PAD system [10], the authors proposed two algorithms to generate dummies based on Virtual Grid and Virtual Circle, which are illustrated in Fig.


Categories and Subject Descriptors E.0.e [General]: Knowledge and data engineering tools and techniques; I.2.4 [Arti.cial Intelligence]: Knowledge Representation Formalisms and Methods; I.2.13 [Arti.cial Intelligence]: Knowledge Reuse Permission to make digital or hard copies of all or part of this work forpersonal or classroom use is granted without fee provided that copies arenot made or distributed for pro.t or commercial advantage and that copiesbear this notice and the full citation on the .rst page.

this process relied on manual intervention.


In contrast, although method cold func is called from a hot method it is not itself hot since it is not called from any loop, and does not contain a loop in its body.

in section 5.3, we study the feasibility of determining loop iteration bounds early at runtime.


The puzzle editor tool can also be used to construct an undirected graph representing a map of areas the player can explore.

the way the generator bases its generation on trial and error can also be a problem when generating larger games, so that certain puzzle maps can take longer to generate.


While Figure 10(a) shows a large bene.t of batching for null requests, Figure 11 depicts a similar experiment with a request execution time of 5ms.

we still must show that once f replicas are shutdown that the system will continue to function properly even though newly awoken replicas may not yet have the full application state.


But through the use of Tree Executor model, the Executors can be arranged in an optimal order to leverage the query optimization techniques used in relational databases.


Then execution stops at the point where the invalid access occurs.

since these trees have only so far considered object construction, there is still the need to integrate regular method calls that potentially a.ect the state of an object but do not necessarily contribute to object construction.


As part of this approach, we proposed the FraMES framework which provides mechanisms to control the event .ow.

this analysis results in inferring the modal behavior of the Track components (Track1,...,T rack10).


We do not break such statements and hence obtain exact solutions.

by de.nition, such a sequence cannot make p point to q.


The second column shows the same statistics for the opti- mizing (Opt) compiler.

if one set of inputs is used to generate profile data off- line and another set is used for program execution, profile- guided decisions may be incorrect and hence, be ineffective or possibly cause performance degradation.


Direct and gestural interaction with relief: a 2.5D shape display.

a designer usually faces this problem, which is further compounded by Changibles where each unit can morph on their own.


Because software model checkers use conservative abstractions, a non-spurious counterexample can be produced from even a very coarse abstraction of a program.

the approach can be generalized to apply 10In such a tool, SSA would be applied to the abstracted program, A(P) to generate a BMC instance, in place of the current direct unwinding of the transition relation.


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.

moreover, our ARP strategy can also be more time-saving than traditional interaction test suite prioritization strategy, while maintaining similar e.ectiveness, according to combinatorial coverage.


5.3 Host network queueing delay For host network queueing delay, our setup is similar to the testbed experiment in § 4.2.

the average throughput loss for large .ows is less than 3%.


We ex- ploit synchronization specifications to construct hybrid models that blend synchronization behavior from the coarse-grain solution with the behavior of the functional core application code.

figure 2 illustrates that the coarse-grain solution also contains notification information.


The server would inherent from this base class and implement the required functionality.


The touch events optimisation modi.es the way applications are noti.ed of touch events .nger-presses on a touch-sensitive screen.

pattern matching by itself is unsuited to .nding data-sensitive optimisation candidates.


Enriched models are better suited to .nding errors than initial models.


In this script, leader node sends heartbeat message piggybacked with EM to all the nodes in the network.

in this paper, we only review extrema finding election protocols.


: The behavior of a component is based on stimuli and responses.

[5] Ivica Crnkovic and Magnus Larsson, editors.


Such 3D languages arise from di.erent modeling domains that make use of three-dimensional representations, e.g., the ball-and-stick models of molecules.

the interaction tasks are automatically tailored to the needs of the representation of a visual pattern.


Just as in Twenty-Policy, we see the need for the driver to search for dead connections as a point of inef.ciency.

short-term connection stealing temporarily violates Af.nity-Accept s goal of connection af.nity, in hope of resolving a load imbalance.


7.2 Lessons from the Reference Graph Our reference-graph approach is orthogonal to the problem of performing garbage collection on the GPU: we assume that in the near future, GPUs will be capable of mapping the entire heap, perhaps even cache-coherent with the CPU.

only one of the linked lists is traced by the mark phase.


w] indicates that memory m is updated to a new one that is equal to m except that the value stored at address a is w. Notation r[R .

the techniques presented in this paper can be easily adapted to reasoning about other isolation mechanisms [4, 8, 17].


As a result, the requirements for a real-time Java were published in 1999.

they require more advanced development and execution frameworks that includes features such as platform independence, .exibility, QoS and resource management, etc.


when comparing documents in different notations.

it is important to bring comprehensibility, along with other communication qualities, to the forefront of the modelling language debate.


GENERAL trace is obtained from a 5-day long general PC usage and SYSMARK trace is collected from SYSmark 2007 Preview.

the total write number and the hit ratio are similar to the conventional method.


1 http://www.dependency-analyzer.org/  4.3 Data Collection Each configuration (C1, C2, and C3) of the NSGA-II algorithm was executed 30 times for all instances.

using EVM as part of the multiobjective search does not seem to reduce error ratios on average.


In addition, it covers the team s experiences in using Sun s JINI to provide a robust distributed infrastructure for RACD.

prototypes are easily distributable as scanned images or  photocopies.


Test cases, contained in nonleaf nodes that are included in the path between the modified node and its reachable leaves are excluded, because they are already covered by the leaf notes.

the Use Case Maps notation is a high level scenario based modeling technique, to specify functional requirements and highlevel designs for various reactive and distributed systems.


Presentation given at the 1996 USENIX Annual Technical Conference.

sEDA and Haboob are implemented in Java.


Note that there is no speci.c detector for the observers role .eld since we found that it has no su.ciently selective characteristics that are independent of the way how it is used by the method roles.

the numbers in Table 2 are reported for the CTC/JT combination.


First, it is imperative to measure the performance of content replication strategies over the time scale in which changes in popularities occur.

we characterize the performance of any scheme that separates learning and placement (i.e.


18.3% of the data concerned itself with the notion of the availability, fault tolerance, and reliability of a cloud service.

the perceived notion is that the tooling supporting the software development on a platform remains still quite limited.


this has constrained the peer data exchange among themselves while the server often has limited amount of bandwidth allocated for an unpopular channel [8].


Previous data-parallel streaming architectures have focused on designing a special memory hierarchy to support this communication [18].


The loop combined fragment (loop) is used for specifying repetitive sequences of message exchanges.

a smooth integration with exploration tools, and the toolindependent configurability of the DSE.


Inc., Sunnyvale, CA 94089, USA {kamrul, angeloh, mhb, mchiang, sms, cpeters, anew}@yahoo-inc.com Alejandro Abdelnur Cloudera Inc, Palo Alto, CA 94306, USA tucu@cloudera.com ABSTRACT Hadoop is a massively scalable parallel computation platform capable of running hundreds of jobs concurrently, and many thousands of jobs per day.

retrieved from http://blogs.forrester.com/srm/2009/11/cloud-securityfront-and-center.html [22] Brodkin, J.


A secondary and more exploratory goal is to support activity knowledge in order to improve orientation, reduce omissions, and offer traceability.

among the detailed knowledge and speci.cations that clients may actively seek, however, there may also be details of which clients should be made aware even if they were not planning to actively seek information about the artifact.


This will lessen the problem of coupling and improve the .exibility of our software.

4.3 What: relations, not scripts or circuits Research work has proposed several new integration domains: coordination languages [Arbab and Mavaddat 2002], delta languages [Keller and Holzle 1998] and semantic patching tools [Padioleau et al.


When a is called, the .lter s state advances from Start to Expecting c .

when mainline programs do not expose a particular value through a convenient abstraction boundary (as with the aURI.spec variable in the Speed-Dial example in Figure 2), extension authors must resort to abstraction-violating patches to implement their features.


(cons a b) (cons a b) The values of the expressions below are also equal: (cons (cons a b) (cons a b)) (let ([x (cons a b)]) (cons x x)) even though the former consists of three pairs while the latter consists of only two, as illustrated in Figure 1, because anycomposition of car and cdr performed in parallel on the two values yields the same (equal) structures.

it performs well on large and small, cyclic and acyclic inputs by interleaving a low-overhead algorithm that terminates only for acyclic inputs with a more general algorithm that handles cyclic inputs.


Early Calculation of Defect Levels: Early after the release of a version we have been able to estimate the defect level of the version.

the model and the parameters must be tailored according to the actual context.


The is due to the fact that the total number of scheduling points arising in the exact rate mono tonic has a pseudo polynomial complexity.

a constant slowdown for all tasks guarantees deadlines.


The users should be able to make informed component selections.

this is an attractive feature in that the integrators can choose the services that they want from a large component to be included in their integrated system, and discard unused services.


The TinyOS Editor provides syntax highlighting for nesC code as well as code completion.

furthermore, it includes an additional set of tools which are designed to ease the TinyOS development process for both newcomers and experienced developers.


Given the similarities between server directories and Napster, we believe that it is bene.cial to learn from the research in peer-to-peer networking when developing new server discovery mechanisms.

as can be expected, however, the unreliable nature of UDP and created its own problems, which we have described here.


The higher this ratio, the less capable is the server to serve high priority pieces.

in case the deadline of a certain piece cannot be met, a quick decline message is sent to allow for fast request retry.


This ob ject-as-person metaphor [23] supports the kind of object thinking we want to teach our students.

aN EXAMPLE SESSION Let s take our example scenario John Doe borrows book 1984 from section 4.4.1.


This is done in conjunction with cache allocation to regions.

using the term memory region to denote the current set of physical memory pages actively used by an application, this paper presents and evaluates region-based scheduling methods for multicore platforms.


Work.ow and application adaptations in mobile environments.

if a company needs to manage customization and privacy protection for every mobile user, this usually implies a very high development and maintenance cost.


this comes with an increase in the complexity of the translation mechanism, yet is not more complex than using recursive functions.


Mitigating Risks The risk management process seeks to ensure that risks in the portfolio are mitigated or avoided.

a predictable and repeatable process to mitigate or otherwise close out architecture risks serves to build project confidence for key external stakeholders, and drives approval of the architecture.


The assignment of data items to non-local memories can be formulated as a generalized assignment problem, where jobs must be assigned to different machines for minimal total cost.

as discussed in the motivating examples, this results in the best possible throughput for a single threaded application.


IEEE Transactions on Software Engineering, 1(4):425, December 1975.

for suites with def-use coverage, fault detection is often independent of operational coverage (only 2 programs had statistically significant co- efficients).


8.3 3D FFT on Clusters of Coprocessors There are no known multi-node 1D fft implementations on coprocessors.

for larger 1D ffts, even achieving but communication-to-computation ratio is much higher within a compute node, where additional computation of soi is harder to be compensated.


The multi-choice paradigm combines the bene.ts of hashing with those of directory-based systems.

as larger datacenters support more services, practical issues about data collection and privileges across administrative domains will a.ect resource management goals and tools.


Figure 4 shows that in classical desktop 3D applications, calls to the low-level rendering API are made by the application at the server (which is also the client).

if larger updates are necessary, the changed GL calls are generated within the Update stage on the server and sent to the client.


Modularity and reusability in attribute grammars.


These methods may maintain large intermediate results for long periods of time.

it takes an object o and an obligation v as arguments.


o The change of one purine/pyrimidine for another occurred in the sequences is called transition mutation whereas the change of a purine for a pyrimidine or viceversa occurred in the sequences is called transversion mutations.

the ribosome serves as a platform for the transfer RNA (tRNA) molecule which holds the amino acids.


We have currently set this value as a future goal for our optimization efforts.

this is just for an example: our technique, as well as those in most other reports, can support various word widths such as 32 and 64.


Rules with higher salience values will be executed prior to rules with lower salience values (ties are broken arbitrarily).

r contains every positive restructuring and no more.


The empirical results show that the algorithm is both practical and accurate.

figure 4 describes a typical class test process: a sequence of CUT (i.e., the class under test) methods are exercised, the .rst of which is a constructor.


Finally, an orchestrator for an online banking account is given in Figure 7, which exhibits the internal behaviour of the online banking service.

we can label the transitions in a constraint automaton for the internal view of a web service by the pair (N, g) where each element in N is a pair (W, n) as given previously, and g is a data constraint.


For semantics that are directly expressed in the high-level source code (such as new()) this is achievable through careful coding.

sPIN: an extensible microkernel for application-speci.c operating system services.


lengthL = lengthL_aux lengthL lengthA = lengthA_aux lengthA Using this technique, we can reuse existing functions de.ned for less constructors.

(overloaded functions must have type a .


Yesterday s Weather: Guiding early reverse engineering efforts by summarizing the evolution of changes.

these two hierarchies should be further inspected and, in case, merged and moved to the appropriate module.


A partition of the points is initialized (Algorithm I, line 04) so that it classes each point as distinct.

in our paper general symmetry groups are considered.


There are a few additional special case situations that are more fully described in [22].

of course this solution may not work for simulation models with tight causal relations.


An e.cient and resilient approach to .ltering and disseminating streaming data.

this parameter identi.es the popularity of the stored objects among speci.c peers.


But, as we already explained in paragraph 2, the criteria that lead to the static structure of the code are usually not based on the working of scenarios.

since we focus on application classes i.e.


If there is some available friend, Alfred accesses the friend s current location and goes to meet him.

whenever a service of an execution plan fails or the actual provided QoC is lower than those requested by an application, the mechanism can replace the execution plan by another that meets the same requirements and provides all services needed by the application.


He found that the migration policy that causes thegreatest reductionin work(measured as takeover time, that is, the number of generations required to converge to the best individual from the initial population, by applying selection only) is to choose both the immigrants and the replacements according to their .tness, because this policy increasestheselectionpressureandmay causethealgorithm to converge signi.cantly faster.

the same problem tested with the GBX crossover operator yields the results shown in Figure 5.


SafeJava allows programmers to specify this locking discipline in their programs in the form of type declarations.

well-typed programs in SafeJVML are free of deadlocks.


REFERENCES [1] Alessandra Agostini, Claudio Bettini, and Daniele Riboni.

in cases where the number of clients is small and their requirements for a minimum QoS is smaller than what the system can provide the system can optionally offer an even better service by allowing them to access more data.


The above three phases produce compilation units that bear little resemblance to procedures.

the Journal of Supercomputing 7, 1 (January 1993), 229 248.


In order to be e.ective, such tuning hastopreemptany otherpossible moveofthewhole system, and this amounts to importing a notion of priority within theprobabilistic model.

indeed, one con.guration is reached from the other one at in.nite speed.


4.1 Reuse by Inheritance We chose as an example the UML concept Classi.er.

we propose two main types of elements: Vertices to represent complex elements of diagrams and edges to represent links between complex elements.


Function main passes the values of four global variables to variadic function callee, which checks that it indeed receives the right values.

a slightly more complicated code generation scheme could trigger a compiler to emit di.erent code and is therefore planned for future work: Simple values could be passed as literals, without storing them in a global variable .rst.


Compared with FAST, KAST can effectively improve the worstcase merge time.

considering the sequential-page-write constraint in MLC NAND .ash, when a page is written into a block, it can only be written to an empty page whose block offset is bigger than that of an existing page written before.


due to malfunction or 6adobe.com/products/.ash 7gesturepak.com 8gesturestudio.ca  devices being shared between users).

these two techniques interact with a variety of user interface paradigms to visualize and manipulate mid-air gesture information [2].


Each functional service implementation uses   discover required services not available discover required services not available discover required services all required services available Figure 3: Application Service Modes for Dynamic Integration  the software platform in consideration of the hosting hardware components.

the mechanism of adding extra descriptive information to the interface while registering with the lookup is limited in comparison to other interface description techniques like the CORBA interface description language (IDL).


A scalability benchmark suite for Erlang/OTP.

the table lock in this library is used for safe memory reclamation as described in Section 4.


Our work is different from theirs in that the focus of our work is to minimize the cache misses among the data elements accessed by different processes in an embedded MPSoC based system.

if Ar r a y K Ar r a y K Ca c h e 1 2 Pa g e  (a ) ½Page (b ) Figure 4.


concerns were expressed that the ACVC should not get much larger.


In a commercial system, business rules can make associations between documents and business data.

document Management is a huge industry, served by many vendors.


In Wiselib data types like Node Id or platform speci.c characteristics like maximum packet length are de.ned during compilation target platform and applications are developed in a generic format disconnected from the actual deployment platform (i.e., using make isense or make tinyos-telosb we compile the same application for iSense or TelosB devices).

wiselib: A generic algorithm library for heterogeneous sensor networks.


The compiler used for GODSON-2 is based on the open-source ORC2.1.

on microprocessors with less efficient data transfer paths, the performance gain is limited.


This process can be expensive if many bytes are identi.ed as potentially corrupt, because it involves one solver query for each such byte.

all of the candidate documents seem to be printed out correctly including some text that we later added after the changed byte.


These Java-based projects have interesting approaches, design decisions, results, and a common concern to isolate applications.

the root JR also enables the platform administrator to have a global representation of all applications running inside every local JR.


Never before had so many vulnerabilities been followed in a matter of days by exploits that brought many college campus networks to a screeching halt.

local IT units had devised many strategies to manage the University owned computers used by their faculty and staff.


The new process defines in detail the phases where COTS-based development is most challenging: requirements, design and project management.

requirements for the project are sketched out in little detail.


Besides, after the correlation validation process there might be a loop back to the dataset for correlation mining again, depending on the mining situation.

there might be absent features which are not defined in a corresponding product, and it is unclear whether there exists an exclusive correlation between an absent feature and the other defined features in the product.


New techniques are needed to collect relevant Web search results and to extract knowledge of the APIs from the noisy data.

basically, the higher frequency a API candidate is, the more likely it is relevant to the API query.


[10) J. Dongarra, V. Eijkhout, and H. van der Vorst.

replicated is more suitable for an ULMT implementation because providing the larger space required in hardware is expensive.


With the inputs of the responsive  Pattern  Static Runtime Code Extraction Analysis Cure Refactoring Domain Event Responsive & Hang Bugs Knowledge Traces Blocking Patterns (ranked) Figure 3: Architecture of the hang analysis system.

similarly, we estimate sets in the form V ×C for other properties such as may-nonzero and may-null listed in Table 1, and evaluate corresponding blocking conditions.


In the outer loop, re.nement between Cabstr and Cp is checked by the RCP routine.

the ultimate objectiveis to be able to infer global properties of complex systemby appropriately combining local properties of componentsand their environments.


[36] promotes the use of runtime executable megamodels.

ptolemy focus rather on simulation of the executable models and their transformations to the embedded systems.


Block and expression annotations can be also employed to provide a .ner-grained join point selection mechanism in as AspectJ-like AOP framework.

the granularity of annotations extends to the statement and expression level and does not limit to class, method and .eld declarations.


In Proceedings of the Joint SERC/Chalmers Workshop on Declarative Programming, University College, London, UK, 1983.

various examples of this cross-fertilization can be found in the literature [21, 6, 16, 8].


In case of absent real-world datasets, developers often assume some statistical data model and generate corresponding synthetic data that is used for performance testing.

think about modeling user preferences when generating orders for a retailer domain model (as the one presented in Figure 1).


The rest of this paper is organized as follows.

overall, the model predicts that when multiple cores are available for scheduling, the parallel multi-core scheduling policy should always be used.


In Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI 98, pages 313 323, New York, NY, USA, 1998.

the OGI inserts this immediately after the instructions where it is safe to deallocate all the objects grouped by the given tag.


Consider an intelligent agent application, that makes inferences on the basis of police records.

in a negotiation a bid does not need to correspond to the actual reservation price of the agent.


E.g., this would allow the location  Categories and Subject Descriptors of services to be changed according to host load conditions.

amano and Watanabe [1] propose to perform adaptation by selecting a known component that best .ts environmental conditions.


They were provided with an aerial image of their location as well as the location of buildings and enemy and neutral forces in the area.

based on our interviews and test scenarios, we determined that many military personnel have not memorized all COA symbols.


Critically, these predictions only use EEG data recorded before the students even saw the cloze question.

like Chang et al [2], we chose to undersample from the majority class as a conservative way to prebalance.


This is quite significant in BitTorrent-like systems where users can only fetch resources from portal web pages.

for the first generation P2P file sharing protocols in which Napster [11] and Gnutella [3] are the representatives, Sariou et al [7] conducted an in-depth measurement of the end user hosts in the networks.


In this paper, we propose to combine the best of both bottom-up and top-down detections, i.e., automated algorithms and human analyst to improve the accuracy of detection.

the method by which important data is presented to a user is critical; the data presented to the user must be filtered down to only the essential information and presented in a format that is easily interpreted and sufficiently relaxed (i.e., not mentally demanding) such that the user can keep up with the real-time processing of the computerized front end and maintain this pace for the entire length of the surveillance task, which might require hours of attentiveness at a time.


The object invoking an operation (caller) of another object (callee) is not taken into account for the execution of the method associated with the operation.

we show, .rst, that the notion of role is more basic and involves the interaction of one object with another one using one single role, rather than an association.


For even though there may still exist many possible executions of the model due to the interleaving and bu.ering choices allowed by MPI these executions must all be the same in certain signi.cant ways.

by Corollary 11, there is a synchronous .nite execution pre.x S with the property that any synchronous extension of S is compatible with T .


Several operations (e.g., barrier code, stack scanning, and object copy)need to be performed atomically.

in ISMM 07: Proceedings of the 6th international symposium on Memory management, pages 159 172, New York,NY, USA, 2007.ACM.


Using the collected data set, we created an SVM classi.cation Figure 4: Transitions made by the smartphone among the three phases.

those sensors are usually limited in range to line of sight, di.cult to install especially on existing vehicles and exhibit a tradeo.


(includes attributes such as availability, reliability, and integrity) [2];  Safety: Capability of the software product to achieve acceptable levels of risk of harm to the environment, i.e., people, business, software or property.

besides their popularity, engineering of these systems is still particularly challenging.


The guard [idrid] on RcvAuthRsp indicates it can be enabled only on receiving a non-duplicate Authentication Response Message.

the RFC only provides Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


International Conference on Software Engineering (ICSE), Orlando, Florida, May 2002.

step 1 is the application of d1 and d2, as discussed before everything .ne so far.


code Optimisation Techniques for Lazy Functional Languages.


small percentage of bucket values tested).

while values for input variables can be easily specified in test matrices, output values across a specific domain are much more difficult to produce.


Regarding the first two steps, developing or borrowing theories of human problem-solving in software engineering and then basing tools on those theories, an obvious objection arises: most researchers in software engineering are not trained in social sciences.

this objection may be one reason progress in this area has been so slow, but it is not a good argument against the need for this step.


SSIML: Designing structure and application integration of 3d scenes.

de.ning a colour in the HSB space is often considered to be more intuitive than de.ning it in the RGB space.


Unlike a machine equipped with Intel Pentium IV processor, a sensor node is severely constrained in resources in terms of memory and processing.

sensor nodes are only able to generate new keys; keys that have been used and discarded cannot be regenerated at the sensor node since the node does not know the seed used to kick-start the key generation.


most of the previous work do not explore trade-offs systematically.


Thereisno reasonto believethat .le system designers are running outofideas or thatthe technological changesthat motivate new .le systemdevelopment are slowing down.

most Linux run-time errors are represented as simple integer codes.


Current algorithms are based on measuring the number of cycles spent on useful actions [2, 9].

regarding performance we judge based on the ability Figure 9: Two di.erent allotments on two architectures, classi.ed as per the DVS rules.


It should be noted, that the number of prefetches that are initiated is not necessarily indicative of the performance of the scheme.

we also present one set of execution cycle results for one billion instructions with five of the applications with high TLB miss rates to compare DP and RP using sim-outorder (as can be imagined, these experiments take an excessively long time).


Figure 5 shows theperformancedi.erencewithETagainst search spacesize for all branches considered in this experiment.

theimpact of their removal from the search is much less pronounced.


In the case of 2D Torus graphs (shown in Figures 7 and 8), we observe that with more than two threads, the application does not scale.

capacity: integer tasks: array of Task constructor LifoIwsq(integer size) { anchor := .0,0.; capacity := size; tasks := new Task[size]; } void put(Task task) { Order write in 3 before write in 4 1: .t,g.


It is possible to construct a sequence such that fails.

results of our tool are presented for two small example codes and a real-world application.


exploring inter-procedural paths may be considerably less ef.cient, and we could not yet prove experimentally that this would lead to an acceptable overhead compared to compilation times.


INTRODUCTION The ubiquity of computation and communication capability nowadays has driven information technology and its applications into a data-centered era.

when the client receives a frame buffer size update message, the processing algorithm is as follows: 1.


The tool is flexible and expandable for simulating and evaluating various hierarchy generation and maintenance approaches or combinations of them.

[2] Manousakis K., McAuley A. J., Morera R., Applying Simulated Annealing for Domain Generation in Ad Hoc Networks, International Conference on Communications (ICC 2004), Paris, France, 2004 [3] Manousakis K., McAuley A. J., Morera R, Baras J.S., Network and Domain Autoconfiguration: A Unified Approach for Large Dynamic Networks, IEEE Communications Magazine, Feature Topic: Advances in Self-Organizing Networks, August 2005 [4] Manousakis K., McAuley A. J., Distributed Active Hierarchy Maintenance in MANETs, IEEE International Conference on Communications (ICC 2006), Istanbul, Turkey, June 2006 The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied of the Army Research Laboratory or the U.S. Government.


The o.sets of the truncated cone have been carefully selected such that the entire space can be tiled using a single shape.

hence, we can unroll the point loops within the tile to create straightline code.


Instead of identifying each step according to the agent's role, he/she should define each step according to the agents' plans.

run-time overhead: The Agents Monitor aspect inserts additional code in agent s platform, in order to monitor specific events.


In D. Garlan and D. L. Metayer, editors, Proe.

a bid-tuple made by a provider p for a service request by client c should behave like a secure message (in the sense of Section 2) from p to c.  Such secure bidding is supported under LGI by law £sB in Figure 2.


in parallel with our formalism, we have been developing a tool suite called 4ml (pronounced formal)thatinterfaces with GME, MetaGME, and the graph rewriting tool GReAT.


The total probability is the product of the probabilities of being allocated in the same miniheap (the left-hand term below), times the probability of itfalling on the left side of the corruption (the right-hand term).

once it reaches the malloc breakpoint, Exterminator triggers another heap image dump.


This low precision led us to further investigate the intermediate changes by taking the weekly snapshots between two major releases 0.9.16 and 0.9.17, which resulted in 12 snapshots from January 9, 2004 to March 26, 2004.

for the case of systems that consist of a set of subprojects, such as a set of related plugins within the Eclipse platform, it is straightforward to incorporate an additional subproject layer between the virtual root and package layers in algorithm 4 and thus enable the identification of the moves of packages.


the array reference C [ i, j ] is reused.

these Arrays share memory storage with the original Array, but may not share any data elements.


[7] Maximilian Stoerzer and Juergen Graf.

to be widely adopted, AOP is in need of mechanisms to support separate development in a well-de.ned manner.


So, a reconstruction technique that has attracted a lot of attention is choosing x =.

many coe.cients are quantized to zero (i.e., to the cell centered around zero), and imposing sparsity in our case must be con.ned to the subset of such coe.cients.


This would not change the computation but only where a value is computed.

then we want to investigate the addition of a certain performance monitoring function.


However, limited resources reduce the number of goals attainable.

for example, the use of mnemonic strategies (i.e., memory aids) is an example of a psychological compensatory effort.


face-to-face meetings) to create strong rapport between team members across sites.

strategic level, operational level [59] etc.)


The start tag of a runnable thread is computed as max(Fi)if the thread just woke up si =Fi if the thread is continuously runnable (6) Initially, the virtual time of the system is zero.

we then ran two thttpd web servers and assigned them different weights (1:1, 1:2, 1:4 and 1:7).


Other classic analyses, such as reaching de.nitions and dead-code analysis, can also be formulated easily as parametric regular path queries.

to copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior speci.c permission and/or a fee.


an entity that participates in a n-ary ER relationship is connected to the node representing the ER relationship via an edge.


Here I knew what I ought to do, but I wrote something else that was syntactically correct a sort of mental typo.

does their claim that the proportions of faults falling into the various categories is similar for di.erent projects hold for other software?


Automatic parallelization of map tasks must rely on an ef.cient parallel runtime to execute them.

hJ-Hadoop achieved 8% 16% speedup with 4 JVMs through improved load balance across cores.


In the following sections we introduce the key concepts to specify performance properties.

a good scaling behavior does not guarantee good ef.ciency.


Here we wish to determine all methods M that write a .eld of a particular type, say T .

it is rare for code queries to build up intermediate data structures such as lists.


Unfortunately, transient faults often occur in long-running server applications that are inherently multi-threaded but which must nonetheless exhibit good fault tolerance characteristics; capturing global program state is costly in these environments.


Second, for a (transitive) owner object o of the current receiver.

methods that do not perform transfers, such as reverse, can be written like in standard Universe Types.


A more .exible notion of immutability based on existing work [14, 11, 15] is planned for the future.

its state consists of a map, which maps song IDs to corresponding SongStatus objects.


3.6 Evaluation semantics The evaluation semantics is fairly straightforward except for its handlingof marking.

usingthe standard conformance relation of types (i.e., a value v has type T ), we say that a type S is a subtype of T if and only if every value of type S is also of type T.This way of de.ningsubtypingis quite powerful, and known to be useful in particular for exploiting.exibilities of XML data in processing programs.


Technical Report Technical Report DCS-TR-528, June 2003.

n/K is the total number of stripes and arrays U1  and U2 are of the same size, 2N ×2N.


The approach can achieve optimal results at the basicblock level.

the algorithm uses an analytical model to predict CPU and GPU performance, based on emprical measurements on sample data sets.


The approach is demonstrated with detailed examples of designing one particular API subset for Mixed Reality annotations.

creating, retrieving, modifying and deleting Annotations are handled in the obvious way.


Towards .exible code clone detection, management, and refactoring in IDE.

[29] Y. Ueda, T. Kamiya, S. Kusumoto, and K. Inoue.


But this is not tight, since the fact that routing between the points u,v is per- formed in this level can be used to deduce that the distance between them is at least 2 I-2 hence allowing us to bound the resulting stretch more effectively.

for every cluster S~ E ,.gl we first build a spanner Hi t with bounded degree A(H~) < k. We can use the 0-graph spanner described in Section 3.1 as H with stretch factor c(k) as in Prop.


A Robust Component Model for Consumer Electronic Products, volume 3 of Philips Research.

this analysis is based on the EFPs of the associated elements depending on the platform selected in each case.


Our analysis determines this by analyzing the .nalized access paths of each function: if a .eld of the argument of a .nalizer function is .nalized, that .eld is owned.

we describe our ownership model for C resources and present algorithms to infer the ownership semantics of C libraries.


Models are built using active objects (called capsules) that interact with each other through signalbased boundary objects called ports .

as the research progressed it became increasingly apparent that tool support can also be beneficial for describing the inter-relationships between patterns.


A branch predictors must supply its prediction within a single clock cycle [14].

conclusion This paper has introduced a technique for pattern history table partitioning for reducing branch mispredictions.


Lack of a coherent, unambiguous scoping principle is not acceptable for a programming-language construct.

before .nishing, we should present at least one real example of the toplevel loop language in use.


[9] Tensilica Inc.: http://www.tensilica.com/ [10] W. H. Press, et al.

for a DAG G with n nodes, there will be 2n candidate sub-graphs.


The couple (xi,xj ) has a strong cohesion when xi et xj are often represented in the same concept with regard to the times they appear in a concept.

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


Limitations of the prototypes prevented us from investigating these questions through a long-term deployment that may have provided strong qualitative and quantitative evidence.

in the initial concept, the user would be able to replay, at any moment in time, sounds heard in the recent past, up to a defined maximum time span (for example, up to one hour in the past).


3.2 Experiments and Results The ORL face database [8] is created for face recognition related research studies and as a result, differences of facial expressions of the subjects are more than acceptable limits for a biometric authentication system.

information Theory, A. Lapidoth and E. Teletar, Eds., 2002, p. 408.


In the following, we analyze this solution with respect to the requirements de.ned in Section 1.

even though di.erent SPL instances provide a similar interface there is no subtyping relationship between them.


[5] V. Chippa, A. Raghunathan, K. Roy, and S. Chakradhar.

11: end procedure 12: procedure LAT I N HYPERCUBE SAMPLING(H[n],dim,k) These are small hyperboxes obtained by discretizing the edges, and 13: for i =0 to k do selecting only a subset from among them.


We did not examine all possible combinations of the available metrics for analysis constraints (combinatorial explosion of various possible combinations).

higher WMC and RFC were found to be associated with fault-proneness.


In fact, regular expressions, based on identifying keywords as bug, .x and so on [1][5][2], can have environment-dependent performance.

this work tackles the problem of commit classi.cation, highlighting aspects not considered in previous works.


As the autonomy of UAVs increases and interfaces improve, switch costs gradually become the bottleneck which limits the number of UAV's that a single operator can manage or be aware of [4].

the 'Castling Rays' (shown in figure 2), enable the operator to view on the video stream window, at a glance, which UAV has the optimal line of sight to his/her target.


BACKGROUND The author taught the first two courses of the sequence in Fall 2010, and winter of 2011.

most of the students were not familiar with the pair programming.


2 to state that class N inherits from class M and that class M aggregates class Q.Equivalently, one could have reversed the relationships (and, graphically, the arrows) by saying that M generalizes class N and that class Q is aggregated in class M without in.uencing the structural complexity of the system.

the intersection of modules m1 and m2 (notation: m1 n m2) is the module .


It is very important to mention that the three tasks of our service selection process are not perfectly independent from each other.

the physical architecture presented in Figure 5 requires that each hardware component executes a Java virtual machine to host the service implementations.


a reconciliation between the two leads to identical replicas (the starting state or the convergence state), with a reported conflict.


Handling crosscutting constraints in domain-specific modeling.

the code that is generated is written by experts and thus, performs more optimally than code written by normal programmers.


It involves numerous software components from various vendors that may all add their own pieces of data into the document.

the embedded headers are not converted to PDF metadata, though, because those values are taken from the main document.


Advances in the data.ow computational model.

the fact that using any combinations of the techniques does not degrade performance as shown in Figure 5 suggests that users should exercise these optimization techniques when writing a query.


Assuming that the fully installed application runs in a production-like environment, all the identi.ed input values are true positives, they are security test cases that should guide security patches.

expert review is the most reliable approach to reveal and .x vulnerabilities, however it is time consuming and expensive.


Uni.ed assign and schedule: a new approach to scheduling for clustered register .le microarchitectures.

the whole process of invalidating all entries on an N-clustered machine has a complexity of N-1, a small single-digit integer.


We compared the performance of the CrowdWatch framework with that of traditional approaches where there is no coordination between the participating nodes and all nodes use the Wi-Fi or the cellular network infrastructure to directly upload sensor data.

as the number of nodes increase, which is the intended scenario for CrowdWatch, this ine.ciency is resolved.


We will present the provided visualisation techniques and will explain, how the tool can be used to create concrete products of a product line.


As part of this implementation we are implementing a highly scalable navigation server that can assist many clients and keep track of a large number of traffic incidents.

the remainder of this paper is as follows.


This framework takes a multi-faceted approach under the rationale that ERP adoption will have significant impact on the organizational, technological, and behavioral aspects of the company.

permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


The agreement is an XML document based on WSAgreement [20], which has to be signed by the two parties and the federation because it is responsible for all the relations among its members.

[10] The open source, open standards cloud, innovative, open source cloud computing software for building reliable cloud infrastructure.


There are two pipes added that connect filters and ports that define the filters roles: PutNewNextBlock that transfers the new types of block generated from NewBlockGen into TetrisCore through the 1111 port, DoMakeNewNextBlock that sends a request message to NewBlockGen through the 4444 port.

13 shows the architecture of the LE-Tetris.


[4] suggests that there are limitations of current approaches for supporting adaptive applications.

all messages received by the thread SendMessageLS will be sent to the Local Server, which executes the operation and returns a result.


To preserve the invariant that no speculative state is written to disk, we initially decided to block the commit of a compound transaction until all of its operations became non-speculative.

because .le systems that we have not modi.ed do not set either .ag, operations in those .le systems block speculative processes until their speculations are resolved.


In the three next cases when small single ob jects were serialized, the serialization time for the most complex objects was the longest, which is similar to the behaviour observed for RMI.

results were presented for three distinctive design patterns: Fa¸cade, Command, and Combined Command.


Other tools like gnuplot [12] also o.er simple real-time commands to generate charts into images as well as HTML.

most of these web applications use charting tools such as d3 [2], googlecharts [3], primefaces [10], highcharts [1, 4] which are open source charting tools based on JavaScript and jQuery and provide excellent visualization of the data.


there is a total of 28 · 28 · 62 = 4,187,046 inputs representing valid strings of size 1.


When talking about the expected convergence time of ss-Byz-2-Clock, it is convenient to think of an in.nitely long coherent interval T =[r, 8].

set save := 0; (d) u.clock(A) = 3: if received n - f 1 in previous beat set u.full clock := save + 3; else if received n - f 0 in previous beat set u.full clock := 0; else if rand =1 set u.full clock := save + 3; else if rand =0 set u.full clock := 0; .


The result is a mixed feature-product-based strategy [30].

it does not induce the overhead of feature-based type checking (i.e., repeated instantiation of data structures in each run) in the setup step.


The recent book The Elements of UML Style by Scott Ambler [1] offers one starting point for graphical documentation.

the book s focus is on UML for software design and development.


DEMO CONTENTS In this demo, three or more laptop PCs (including servers), wireless headphones and wired headsets are used.

the participants can talk each other with small end-to-end latency (less than 200 ms) and will feel the atmosphere of the virtual market place.


This reduces the number of symbols (variables) a decision procedure needs to remember or maintain.

now, suppose that DP indicates that PC .¬C is satis.able.


Boyapati and Rinard propose a system of type annotations for Java that ensures a well-typed program is race-free and allows the programmer to write a generic class and subclass it with different protection mechanisms [5].

a happens-before detector would recognize that globalFlag = 1; in Main.executemust happen before the child thread is started, and therefore before the test of globalFlag in method childThread.run, and therefore there is no potential race there.


The data that we shown in Section 2 is a testimony of this fact.

[27] Marcos Rodrigo Sol Souza, Christophe Guillon, Fernando Magno Quintao Pereira, and Mariza Andrade da Silva Bigonha.


Figure 2: Implementation of UCCTrInc changed among the parties.


Virtual patterns can be very useful as superpatterns for this kind of composite method construction, but BETA does not support virtual superpatterns.

8 and from that pattern, a new object is created.


Korat [5] generates all (up to a small bound) nonisomorphic method parameter values that satisfy a method s explicit precondition.

18th Annual International Conference on Automated Software Engineering (ASE 2003), pages 40 48, Oct. 2003.


The in.uence of the Problem Frames approach and related work is spreading in the .elds of domain modelling, business process modelling, requirements engineering, software architecture as well as software engineering in general.

they consider the synthesis of the SysML and Problem Frames approaches and argue that the synthesis can help the transition from the requirements to the design stage.


We created an algorithm to translate the ordered list of relative magnitude of relationships into a weighted expression, shown in Algorithm 1.

applying Scrum on a software development pro ject does not guarantee increased -compared to applying a traditional approach -project s chances of success.


In testing terms, we may say that the sum of the collection of .rst order mutants is more demanding to test than the union of its parts .

in Proceedings of the 8th International Working Conference on Source Code Analysis and Manipulation (SCAM 08), pages 249 258, Beijing, China, 28-29 September 2008.


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

the SPE is a domain-speci.c programmable processor on which security computations are performed once they are o.oaded from one of the host ARM processors onto MOSES.


We use the Trident framework to generate an optimized hot trace.

in 33rd International Symposium on Microarchitecture, 2000.


Although, the contacted node may not have links towards some globally overloaded nodes, however, we will show that the resulting load imbalance factor is constant and very small [12].

because the randomization does not preserve the spatial locality of data items, the resulting DHT schemes are generally not efficient to support complex queries such as range query.


http://dx.doi.org/10.1145/2660252.2694749 Walter F. Tichy Institute for Program Structures and Data Organization Affiliation Karlsruhe Institute of Technology (KIT) tichy@kit.edu  1.

wolf is a principal designer of the performance-analysis tool Scalasca, which is installed at numerous HPC centers around the world and which has been successfully applied to optimize academic and industrial codes.


Figure 3 shows the code that CUTE adds during instrumentation.

theprevioustechniques[5,27] take O(N2) steps as they search for the value for each pointer, trying .rst the value NULL, then a pointer to the head of the list, then a pointer to the second element and so on.


This will be significantly less than that for the region-based approach.

if the regions do not overlap, the federate (if present) leaves the corresponding multicast group.


The two major flaws of this solution are the use of a non-open language (far from a standard especially) and the absence of commonality/variability and genericity of scenarios across devices.

the issue is that such systems do not have the same technical characteristics.


After lot 1 .lls and lot 2 begins to .ll, which generates implicit searches in lot 1, the availability probability of lot 1 drops.

in each case, the monitored fraction estimator uses Figure 6: False positive and negative rates as a function of detector duty cycle.


DSM 12, October 22, 2012, Tucson, Arizona, USA.

technology transfer is hard to achieve and empirical studies tries to help in moving technology from academy to industry [2, 12, 15].


This applies not only to slicing but also to any data .ow analysis.

having a threaded witness l =( c1, , ck!


MansOS architecture Key features of the MansOS: Easy, plain C programming.

this requires steep learning curve for the new developers.


Queries are sent to any node that is fresh enough with respect to the query requirement ; we allow for propagating a sequence refresh transactions (called a refresh sequence) on any stale node such that it will become fresh enough for processing a query.

we choose to rely on a DHT [15] deployed over several SD nodes.


They constantly go into and out of (played) context of use and make reflections in a setting that closely resembles a real work situation.

while only physicians can prescribe medicine, nurses are actually allowed to make choices about medicine in certain situations.


In fact, the elapsed time serving each physical I/O request can be measured online.

for writes, and, this behavior paid o. here, because physical writesarenowmuch more expensivethanphysical reads.


The same composition algorithm as before is applied.

the overall objective of the paper is to identify and present some issues related to model-driven behavioural product derivation.


Overall, the combined optimization effect is signi.cant (comparing Opt.1+2 with No Opt.

as a result, our CFPmeasurement optimization does not help Mozilla as much as it does for some other benchmarks.


For example, Tsao [25] or Baudisch [3] facilitated portals based on VNC4 , which was originally designed to transmit screen captures on an event triggered request mechanism.

to address these issues, we have implemented a software framework called Environs aimed at alleviating the development of MDE applications.


not Pi+j stand,respetively,forthelause'sidentifer,the"negationasfailure"operator,therule'sonsequent,andtherule's anteedent.Ifi =j =0thelause(rule)isalled"fat"and representedasrk :P1.


Systolic algorithms currently exist for a wide range of dense matrix problems commonly found in scienti.c computing and digital signal processing [18, 2] as well as some sorting andgraphproblems [21].

these architectures share several characteristics which make them a tempting target for systolic designs: multiple processors connected by high-bandwidth, low-latency networks.


(36) At the embedding stage, the host interference h should be removed in order to improve the robustness of a blind detector [16], which is called ISS operation.


The tooling and set of rules applied in the existing product line are therefore provided to application engineers along with the modules.

the services are either healthcare domain specific (e.g.


Intuitively, there is only one grouping method when there is one host, where all the VMs would target one host; the same is true for 12 targets where each VM targets a respective host.

we also evaluate the three metrics under Sysbench and TPC-W workloads.


The join points that can be expressed with FOAs are limited to individual method calls: A feature can join the execution by overriding method calls.

some aspect-oriented approaches like Prose [26] support asynchronous dynamic activation of aspects but we believe that it is very hard or even impossible to reconcile these approaches to dynamic aspects with multi-threading.


For all the 12 modules, the engineers removed 24 defects, in which, 10 defects were removed by reading.

to what extent the original goal of inspection (better quality of software artifacts) is satisfied by CBR for novice inspectors and whether it could support improvement on inspection well are still unclear.


The importance of modularity to design quality is best articulated by David et al [1]: perhaps the most widely accepted quality objective for design is modularity .

software modularization based on these clusters should provide a good initial design.


Although these evolutions de.nitely have their merits for themediaconsumer,theyalsointroduceissuesinthe .eldof user interactivity.

the latter identi.es the user wholastlyin.uenced or modi.ed thestateof the media sharing session.


Comparison with code search Code search typically occurs within an Integrated Development Environment while working on the source code for a single project.

searches for code tends to rely on the comments and the text surrounding an excerpt of source code.


Concept maps de.ne views that are only active when requested, which is a desirable trait for adaptation and library composition.

in POPL 05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 1 13, New York, NY, USA, 2005.


[9] Andreas Gal etc, Hotpath VM: An Efficient JIT Compiler for Resource-constrained Devices VEE 06, Ottawa, Canada, ACM, 2006.

this method can t be used on standard Java environments, so that their application is limited [8].


Students are expected to use these in their assignments; thus the toCelsius() method listed in Figure 4 might be implemented something like what is shown in Figure 5: public Temperature toCelsius() {Temperature r = null;double m = myMagnitude;switch (myScale) { case 'C': r = new Temperature(m, 'C'); break; case 'F': r = new Temperature((m-32.0)/1.8, 'C');break; case 'K': r = new Temperature(m-273.15, 'C'); break; default: System.err.println("toCelsius(): " + "myScale is invalid: " + myScale); } return r;   } Figure 5.

without a path to a solution, they may end up lost.


Any instance which isin oneof IA or IB, but not in the other, is in only one possible state: its state in A,if itisin IA, or its state in B, otherwise.

any instance Ii, which is active in A but not yet ready to terminate in A, is in one possible state: its state in A.If Ii has already terminated in S1, then its current state is its state in B. Finally, if Ii is in a position to terminate in A, then it may choose to continue in S1 (if possible) without terminating, or to proceed as in B.


The work in [61] applies real-time techniques to web servers in order to conserve energy while maintaining quality of service.


As Table 1 shows, message sizes near 50KB approximated the maximum throughput reasonably well.

these functionalities are implemented in the strategy level of our ATS system architecture (see Figures 1b and 1c) by the Signal, H-Signal, and Trader agents, which we use for decomposing the trading strategy problem in signal generation and trading subproblems.


Because scoped promises derive their effectiveness largely from stylized naming conventions, the degree to which they reduce annotation density varies from one system to another; these results are typical within our case study experience.

to address these complications, we build a call graph that includes all known overridings of (or implementations of, in the case of Java Interfaces) the statically-apparent invoked method.


From the partition size found by the algorithm, decreasing the partition size will lead to the longer memory schedule than the ALU schedule.

each node in the MDFG corresponds to a computation.


Finally, we have created a Hegelian synthesis of the best UML/real-time UML and co-design concepts, to propose a new merged Embedded UML profile.

until recently, these worlds have remained separate.


(We do not assume the software developer is necessarily using the bug-finding tool.)

[21] N. Rutar, C. B. Almazan, and J. S. Foster, A Comparison of Bug Finding Tools for Java, Proc.


The reader is referred to [12] for further details.

uML-PMS enables the modeling of the relevant concepts related to mobility, such as: the modeling of logical and physical locations, the dynamic association between a mobile entity and its location, and a set of primitive operations that can be combined to model arbitrary mobility patterns and adaptation strategies.


In many ways our approach resembles the methods presented above, where a reflexive relationship between ethnographic researching and in-situ appropriation of technologies in situations of use engages in co-realization.

in these last minutes, the design researcher intervenes and connects Karl s and the cardiologist s discussion around Furix (bloated stomach) to an experiment of participatory design and performative ethnography: Could Karl and the cardiologist possibly want to collaborate in new ways?


Note that while engines are internalized as symbols, a separate engine table is kept, providing the roots for the GC process.

assert/retract operations and .ndall/bagof/setof operations bene.t signi.cantly from the presence of symbol GC, to the point that overall execution time improves.


Squeak is a highly-portable, open-source Smalltalk implementation with a modest memory footprint and an easily extensible virtual machine.

bugBoms is a fairly complex game with several screens and many custom widgets; most applications are made up of Sprites from a small library of reusable widgets.


The cosine angle between two row ' vectors of Xre.ect the similarity between two terms.

4.3 Large Case Study: Toll System Our largest case study was of a set of Toll system requirements from Siemens AG.


More recently, however, work has been split among five or six different authors, as indicated by the different colors in the right side of Figure 5a.

note, again, that this is not a distinction between degrees of participation, but between forms of participation, as characterized by the interdependencies of the work.


These traces can be used to decide whether the execution of a testcase (on the implementation of the system) behaves as intended.

technical Report SCE-10-04, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada, 2010.


2.3 IMC IMC is a conservative extension of classical process algebras which separates action transitions from rate transitions.


[20] H. Masuhara, G. Kiczales, and C. Dutchyn.

the target application of KLASY is pro.ling and debugging, which do not need precise selection of join points according to our experience.


this connects to the hypermedia concept of simple nodes and complex links.


For architectures without available hardware parallelism (e.g., ss1), highly optimizing compute-limited applications can cause pipeline backend structures to .ll, resulting in longer delays and higher error rates.

other possibilities include optimizations to overlaps errors in a single cycle to reduce the e.ective errors per cycle and optimizations to redistribute errors in the processors to reduce the e.ective error recovery overhead.


[11] review key enabling technologies in M2M architecture such as SWE (Sensor Web Enablement) and semantic web technologies (RDF, OWL).

home m2m networks: Architectures, standards, and qos improvement.


Since their total stack size is now bounded, scratch-pad allocation is easy.

the allocator must know both the size of each allocated variable as well as the total amount of SPM available.


In short, formal, semi-formal, port the complexity associated with SoS software architec-and informal representation were found.

currently, semi-formal ADL, in particular, UML and its derivations, have been a trend; however, considering critical characteristics of SoS (e.g., emergent behaviour, evolutionary development, and geographic distribution), formal techniques and languages must be widely introduced in order to adequately represent SoS architectures.


Each benchmark-collector pair was run re- peatedly until the standard deviation of the average elapsed time was nominal.

most non-heap time is elided to the left of the figure.


[10] M. Harrold, G. Rothermel, K. Sayre, R. Wu, and L. Yi.


In fact, they focused only on the definition of the security rules at the implementation level and neglected the design level of WS, which can induce important added values.

in addition, several researchers believe that the agent paradigm is the best way to solve efficiently distributed problems.


By analyzing users verbal and behavioral data using Schön s reflectionin-action design model and the notion of ideations from creativity literature, we discovered insights into end-user programmers problem-solving attempts, successes, and obstacles, with accompanying implications for the design of end-user programming environments for mashups.

our work makes three contributions: 1) the methodology of applying a theory-based design perspective to programming, 2) evidence of the usefulness of using this approach through insights gained, and 3) the insights themselves into end-user programmers problem-solving attempts, with implications for design of end-user programming environments for mashups.


MPP (N, N ' )) if all the following conditions hold: Firing conditions are preserved;  Places are preserved, meaning no new arcs are added to mapped places;  fT , fP and fS are injections, and fS is persistent, meaning S ' is a correct extension of S;  N ' embeds N, meaning all arcs are mapped, more precisely, there can be more places in the pre and post domains of a mapped transition than in the corresponding domains of the original transition;  A ' is merely extended for new parts in A by fA, or it is merely renamed.

for now, any Mls Fs model (like the one depicted in Fig.


2.1 Smart City In the conventional power distribution systems, the customer (e.g.

some authors consider the use of ontologies in context aware environments to be very sensitive to the size of the dataset and unreasonable to use for time-critical applications [8].


Although the equivalence relation between OP and wait-free contention management happens to be true, the reduction used to establish the equivalence is actually .awed, as is the related proof of correctness.

the time to convergence may be unknown and may vary from run to run.


Those skipped log records are left in the physical log (shared by all sessions).

[8] B. Hines, T. Alcott, R. Barcia, and K. Botzum.


We do not claim that our theoly clarifies all those compficated, intertwined relationships, but we do believe that it creates a better theoretical understanding of OSS from a new analytical angel, and provides practical guide to the management and development of OSS projects.

they start with peripheral participation by, for example, reporting and fixing bugs.


[5] E. Glynn, B. Fitzgerald, and C. Exton.

for example, the features of the software are the very reason customers are interested in using it.


[3] E. B. Fernandez, D. L. laRed, J.Forneron, V. E. Uribe, and G. Rodriguez.

the case blackboard receives changes for the casedocumentswhichget storedin speci.c classes.


There is also a safe and lightweight mechanism to access device registers from Java code without a.ecting the typesafety of the program.

the VFB speci.cation does neither tell when nor how to apply implicit operations.


Secondly, we want to argue that an efficient im- plementation of NICI can also be discussed by referring to the semantics.

a "compilation-oriented ~ seman- tics is not just inappropriate for a fundamental definition of concepts, but it us also not suggestive for actual language implementation.


The average number of Vars per file is 3.91, which also indicates a low complexity level.

grouping of VP nesting levels in the last version Nesting Level (M1) 1 2 3 4 5 VP Count 7988 5082 833 64 2 there are a few VPs with a high nesting level (up to five), and maintaining such code is very expensive.


2.3.1 Audience Features The audience of an IDE refers generally to the target populations for which the IDE is intended.

reducing complexity refers speci.cally to decreasing the level of diagrammatic complexity while maintaining information transfer to the user [12].


The experiment results in this chapter relate to the framework for evolutionary white-box testing1, developed by DaimlerChrysler and described in [3].

in the case of not achieving a test goal, it is not known whether this is due to non-executable program code or a problem case.


This way, although the platform has been almost exclusively used with the open source DBMS MySQL [7] from the beginning, systems of other vendors could also be used without having to adapt the platform software.

the highest administrator status cannot be assigned via the web interface at all, but must be configured by a system administrator directly within the database.


Motivating Examples 2.1 K Nearest Neighbor Join K Nearest Neighbor (KNN) Join takes in two data sets R (Query Set)and S(Training Set).

i use it to show the performance bene.t from the load balance optimizations.


no object reallocation code is speci.ed.


As already mentioned, along with agents, ob jects are the other .rst-class computational abstraction, representing the set of (possibly shared) resources and tools that agents can use/observe as well as dynamically create in order accomplish their tasks.

a big gap still exists between such existing proposals and the programming level, which typically relies on pure OO frameworks and technologies.


In the program, crosscutting implementation concerns are separated but this separation makes it di.cult for the users to understand how to use the framework or library.

these parameters restrict the range of the selected execution points.


The Compare-Select is one of the essential operations in the Viterbi kernel, so a specialized max instruction is available: in addition to selecting the maximum value, it also keeps track which of the two operands is larger by setting a bit in a Vector Mask (VM) register.

traditional Single Instruction Multiple packed Data (SIMpD) instructions that operate on vector registers are supported as well.


Overall, only a small portion of our implementation of prefetching relies on the AspectC extensions, the rest is ordinary C code from the original implementation.

the functionality within each layer primarily deals with controlling resources in terms of its own set of abstractions.


It would be possible to translate XML document schemas into such a hierarchy of attributes by using some attribute naming convention, which would then allow EPAL to express a rule such as permit access to all nodes below node X .

the following differences fall into this category.


this new application development brings new challenges to the design of system software.


The root cause or a sufficient subset of the causes can be identified using, for instance, a fault tree analysis, but any hazard identification method revealing the path to the hazard is applicable.


The heuristic will report that only String is in con.ict with Integer and Number, even though Comparable will also cause a con.ict if the programmer decides to replace Integer with Number.

replacing Number on 5:13 with Integer may solve the type conflict.


RELATED WORK Dynamic program invariants have been subject of study by many researchers [8, 9, 22].

the performance for the bitmask screener varies between 60% and 70%, for the range screener it varies 76% and 81% (meaning that 30-40% and 19-24% of the code has to be inspected on average to .nd the fault, respectively).


[5] R. Alur, P. Cern ´y, P. Madhusudan, and W. Nam.

swiftHand uses a heuristics that .rst tries to merge with an ancestor.


Average cost of a single memory management operation in live VM migration on Xen using PMigrate without optimization, PMigrate with read lock and PMigrate with range lock in microsecond.

[10] S. Boyd-Wickizer, A. Clements, Y. Mao, A. Pesterev, M. Kaashoek, R. Morris, N. Zeldovich, et al.


As in R2, the existence of appropriate method implementations to handle the abstract classes is ensured.

for example, in Figure 5 the abstract Picture class may safely omit an implementation of the internal similar generic function.


We assume processes do not su.er Byzantine failures.

our algorithm does not make any assumptions on the pub/sub network diameter.


Many real-time programs can now be written as simple Java programs where developers pay attention to the timing properties of the application logicwithout having to be overly concerned about interference from thevirtual machine.

we adopt theRe.ex terminology in calling a Flexotask s heap-allocated classesstable, although they are not invariably long-lived as in the Re.exmodel.


This is because the superblock scheme shares D blocks and U-blocks among several logical blocks and orga nizes all physical blocks with an out-of-place scheme, which increases the chance of the switch merge.

for example, if the superblock size is four, four logical blocks whose logical block numbers are 0, 1, 2, and 3, belong to the superblock 0.


Automatic Support for Testing Web-Based Enterprise Applications Arturo Sanchez Brandon Vega University of North University of North Florida Florida CIS Department CIS Department 4567 St Johns Bluff Rd S 4567 St Johns Bluff Rd S Jacksonville, FL 32224 Jacksonville, FL 32224 +1-904-620-1314 +1-904-620-1314 asanchez@unf.edu vegb0001@unf.edu ABSTRACT In this paper we consider the problem of automatically generating test suites associated with web-based enterprise systems.

the Eclipse Platform architecture is comprised of several layers.


FDPR was also used to collect the profile information for the optimizations presented here.

[41 R. Cohn, D. Goodwin, and P. G. Lowney, "Optimizing Alpha Executables on Windows NT with Spike", Digital Technical Journal, vol.


[13] Evans, A., France, R., Lano, K., and Rumpe, B., The Unified Modeling Language.

for example, the IEC 61508-3 International Standard on software requirements with regard to the functional safety of safety-related systems covers software design, development and verification [23].


INTRODUCTION Software engineering educators face many challenges in delivering the course materials as well as in providing the students with the required skills.

in this project, the students were asked to contact the registration office of the computer technology department at the Riyadh College of Technology to understand the problem they face in preparing the students' schedules, distributing courses on the faculty members, and assigning the courses' sections to the classrooms.


Figure 4 illustrates some schedules commonly found in scienti.c problems.

for example, we may repeat computations unnecessarily when two di.erent calls depend on the same computed value.


Figure 3: Jumpshot visualization of the Floyd s algorithm in multi-computer platform   Figure 4: Speed-ups and average running times of the matrix-vector multiplication algorithm in multi-computer platform.

the performance gain of parallel I/O is limited by the underlying algorithm ic structure.