Instances that are added to the source code steadily over time (over a large number of CVS transactions) may indicate a very important, frequently used pattern or a pattern that causes confusion among developers.

these rules may describe how functions interact in the code, how data is to be validated or how an API is to be used.


The .rst class status of signal functions in combination with powerful switching constructs make Yampa an unusually .exible language for describing hybrid systems [13].

[1,n] are the points in time at which the generalized signal or its derivatives have discontinuities.


It is a very lightweight piece of code that performs only the following operations: 1. it pushes the values of the CPU registers into the stack area associated to the current task (lines 1to18); 2. it polls the input port nextSWTask containing the task identi.er of the next software task to run and that is sent by the HW-RTOS (line 19) andthenitsetsthe new process control block currentPCB (line 20); 3. it restores the context of the next software task to be executed (lines 21-26).

it has two components that run concurrently: a CPU and a Real Time Unit (RTU).


The repository of courses is restricted to a few users with a specific profile inside the Public Administration so it has to be controlled.

sMTP to use the mail server located in the infrastructure layer of the knowledge management ecosystem.


[2] R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. W. Reps, and M. Yannakakis.

kleene algebras are algebraic structures with operators +,·, *, 0, and 1, with certain properties.1 1In regular expressions, operator + representsas | , and · is usually omitted.


Scalability and performance of cutcp implemented in different languages.

no copying overhead is introduced in inner loops since data sources are used in-place and an indexer s functions are typically inlined into their use sites.


PERC Pico builds on the notion of the Real-Time Specification for Java s (RTSJ) ScopedMemory.

three types of configuration artifacts, the Platform Definition File (PDF), the Service Definition File (SDF) and the Application Requirements File (ARF), describe the system at platform and application level and describe the available services such as data converters, remote logbooks, or system health monitors.


Conflict Detection and Resolution for Product Line Design in a Collaborative Decision Making Environment  Xiaoqing Frank Liu Eric Christopher Barnes Juha Erik Savolainen Missouri University of Science Missouri University of Science Danfoss Power Electronics and Technology and Technology Gråsten, Denmark Rolla, Missouri Rolla, Missouri JuhaErik.Savolainen@ fliu@mst.edu ecbyt7@mst.edu danfoss.com ABSTRACT Ensuring that the non-functional requirements (NFRs), of a system are satisfied is an essential task in software development.

the voting process took place for a period of 1 week and the results reflect the knowledge base of participants before argumentation.


In the PCM, no object-oriented detail is currently available, because it is not included in the current abstraction level.

rcy whose Active Ressourcesoftype t are less utilized in comparison to the ones of rcx.


We would like to apply a transfer function on the edge from the call site in foo to the associated return node in foo.

aas takes a set of symbolic states and groups the elements of the set based on the property state.


Figures 6a and 6b considered each .eld individually.

while this setup isfar simpler than the generational collectors found in production JVMs, it nevertheless gives a good initial intuition of the garbage collector workload posed by the different benchmarks.


[16] N. Hunt, T. Bergan, L. Ceze, and S. D. Gribble.

achilles can have both false positives and false negatives and is therefore not guaranteed to be sound or complete.


In the second phase (Derive Models), we generate models that summarize andgeneralize the observedexecutions.

thisinformationis correct and useful,butitdoesnotfullyexplainthefailure.Onthe other hand, if we look at the anomalous events, i.e., events that arenot usuallyobservedinlegalexecutions,wecandiscover that the defaultFactory attribute is exceptionally null in thefailingexecution, and that theinvocation of the static constructor of class JspFactory has been unexpectedly anticipated.


The result is variational abstract interpretation a compositional and systematic approach for the derivation of variability-aware product line analyses, with the following distinctive components and properties: A scheme to lift domain types, and combinators for lifting analyses and Galois connections.

we follow the calculational and compo sitional approach advocated by Cousot [12].


It is not necessarily easy to deal with this kind of crosscutting in the open module-style mechanism.

adopting this approach, an unexpected weaving does not occurbecause programpointsthat are not exposed explicitly are not selected by cflow.


Thus, the RUM represents in an abstracted form at least all execution sequences of the actual implementation, and possibly more behavior.

for example, when developing an application for playback of media from the Internet, the Network Manager component may already exist while the player is to be newly developed.


As already mentioned, in this case we stop the check and yield Nothing.

it restores the state before the check and yields Nothing.


The left screenshot shows the initial situation.

there is a Safe to which the coin will be passed, once a co.ee or tea is dispensed.


In each case, the property on hd(n1) added to the formula WWmight be different.

this unfolding/folding mechanism reduces the initial problem (of inferring universally-quanti.ed constraints implied by the con junction of the inputs) to the problem of inferring quanti.er-free constraints implied by the conjunction of the inputs.


The maximum number of modules that can move in one round is k¼nJ.

in [9], the distance between configurations is defined as a metric.


Remarkably, this simple algorithm provides strong guarantees on waste and performance.

a-GREEDY can be combined with prioritized task schedulers to produce adaptive task schedulers that are provably ef.cient with respect to time, space, and waste.


In [14], a warp is used handle one job instead of one thread so as to reduce control divergence.

to differentiate the original threads from the newly added ones, we refer to the original threads as master threads and the newly added ones as slave threads and we use master_id and slave_id as their thread ids along different dimensions.


Once, a host is infected, the worm will create communication channels with both its known neighbors at that time, as well as with any o.springs that it successfully generates.

in simple terms, it has two main functions: that which propagates and that which does other things.


To make sure our students can lead the trend of computer sci- ence in the foreseeable future, we need to introduce them to this important technology.

in what follows, Section 2 reviews previous work related to ours; Section 3 provides a brief system overview; Sec- tion 4 presents the user interface; Section 5 discusses the thread status and history windows; Section 6 through Section 9 cover various supported synchronization prim- itives; and, finally, Section 10 has our conclusions.


As we can see, without QoS Control both servers are overloaded during the .rst half of the experiment exceeding their targeted maximum utilization.

conference on Autonomic Computing, 2006.


Compared with them, our proposal differs in that (1) there is less boilerplate code to write recursive interfaces because MyType automatically supports covariant change of 2 Actually, Bruce once pointed out this idea as a solution to extensible parameterized visitors [5].

f P[I] ok and .,This <: P,X <:J f S0 <: U0 and .,This <: P,X <: J f S0 ok and .,This <: P,X <: J;x : U,this :@This[I] f e0 :S0 and .f [N[H]/This]U0 ok.


Thismethodiseasier than the previous one and seems to be a good solution to the problem.

in MCML, a monitor(var) in the command section tells SoftMon to monitor aglobal variable.


Di.erent con.guration variable settings, or con.gurations, result in di.erent executables, all from the same C sources.

when considering the 50th and 80th percentiles, both tools perform reasonably well.


For the tracking of a single person 500 particles are used and eight parameters, two for position and six for appearance, are used to describe the state of each object.


A classical approximation algorithm [5, 6] for the minimum set-cover problem uses a simple greedy heuristic.

this may not be the case in general since the next step that uses greedy heuristic would be applied if the table is not empty and none of the above reductions are present in the lattice, namely an interfering lattice.


In GluonJ, only the within predicate is available to provide the capability of the within/withincode pointcut of AspectJ.

this featureisnecessarytoimplementanumberofcrosscuttingconcernsrepresented by a famous logging concern.


MOTS CLES : Modèle de documents, modèle d'intéraction, composants logiciels, boîtes à outil ABSTRACT The concept of document usually refers to data that documents contain, but rarely with actions that documents can handle.

toolglass Main Palette de couleurs Formes géométriques Figure 3: Application d une couleur à des formes géométriques La figure 3 représente les différents composants interactifs utilisés dans ce scénario.


Further details of this case study can be found in [12].

he will then examine the source code and decide what pieces of the source code belong in what parts of the conceptual model.


accelerate no t~ s limit no  sensor yes Figure 1: Complex-Choice Petri Net (CCPN) Model for Part of an Automatic Cruise Controller the domain of applications that can be modeled and synthesized.

the details of our proposed EQSS algorithm are as shown in Table 1.


Accessed at http://victoria.fciencias.unam.mx/ MoProSoftV1.3/espaniol/MoProSoft.html [13] Oktaba H. et al., Software Process Improvement: The Competisoft Project.

the hard part was to make a decision about which people should be assigned to which area , i.e.


If we follow the argument in this paper, then we think that we can afford to spend more on I/O bandwidth per server (as we will have signi.cantly fewer servers) and we conjecture that we should aim at at least 2 4 10 Gbps Ethernet ports per server or 1 4 SSDs (at 300 MB/s each) if using local storage.

we conjecture that, in terms of hardware and programmer time, this may be a better option for the majority of data processing jobs.


Tests compare failure-free HdpH runs with HdpH-RS runs in the presence of random failures.

well-formedness guarantees that all rputs .nd their target IVars, that all gets .nd their source IVars, and that these source IVars are hosted locally.


AUC estimates the probability that a random selected positive instance gets higher probability to be classi.ed positive than a randomly selected negative instance to be classi.ed negative.

in the .gure, we use two thresholds that correspond to two a posteriori classi.cations.


Furthermore, any type that belongs to both the Show class and the Read class can be transported without involving FFI, as long as read .show is equivalent to the identity as usual so that we can serialize the data thus.

let a = M 3; b = M 5 in unM $ add m (mul m a a)(mul m b b)) to get the result 2.


A(P1)n· · ·nA(Pn) in order for the trace to satisfy demand(r).

standard techniques expect term, rather than constraint, representation of LTSs.


Research into investigating a template for security patterns that is tailored to meet the needs of secure system development has been reported in [18] and [19], where the UML notation is used to represent structural and behavioral aspects of design, and formal constraints to the patterns are used to enable verification.

in this example we assume the user connects only by means of wireless connection.


of the Fourth International Joint Conference on Automated Reasoning, IJCAR 08, LNAI to appear, Springer-Verlag, Berlin, 2008.


As an example, branches with many edits will have more influence on total delay just because of the high number of edits.


Yukiyoshi Kameyama, Oleg Kiselyov, and Chung-chieh Shan.

the rebuild rules capture binder frames.


Proceedings of the 8th European Software Engineering Conference Held Jointly with 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering.

very little has been done to Idaho Falls 83415, Idaho, USA improve the reliability of software offering these kinds ronald.boring@inl.gov of interaction techniques.


The case combinator takes a sequence of pairs, where the .rst element in each pair is a value, and the second is a quotation to be called if the top of the stack at run time is equal to the value.

the names are for documentation and do not affect the meaning of the program.


It actually specifies the semantics of a common behavioral category that captures the reactive computation behaviors.

the reactions of these components then produce new events.


Recall again our example idea: (( ((  (be, predicate), ((element, first, (row, second, (matrix))), subject), (smallness, comparative),  ((three, than), object)), statement) (( (writing, predicate), (you, subject), (string, object)),  command), condition) The idea (element, first, (row, second, (matrix)) is expressed in English as: the first element of the second row of the matrix, since in English additional descriptive ideas like (row, second, (matrix)) or just (matrix) are usually expressed using genitive phrases.

1.3..3 The Natural Language Problem Today, educational institutions as well as companies work together in worldwide collaborative networks carrying out long enduring projects.


[7], [8]) but little work has been dedicated to integrating such ontologies into an engineer s desktop and make use of inference services.

given a current maintenance context a developer is guided in his specific task by making knowledge available when needed.


These parameters lead to a cluster utilization of 56% in Hadoop, which is substantially higher than those typically seen in the small and medium-sized datacenters that we target [25].

the majority of the energy consumed by datacenters is actually due to countless small and medium-sized ones [31], which are much less ef.cient.


Similar efforts, directed at the needs of end users, could help to improve the quality of the software developed by end-user programmers.

unfortunately, if either the suite of test cases or the program source code changes, the testing and execution slicing information would have to be recreated.


Additionally, new editors that are about to appear can be positioned in a more predictable manner for programmers.

reproducible results rely on deterministic tests.


For instance, the feature Performance is added and, consequently, its subfeatures Time and  Space .

[8] Czarnecki, K., Helsen, S., Eisenecker, U.


To completely (but manually) inspect Web projects could take faculty tremendous amount of time.

[11] jvmenen@users.sourceforge.net, WatiN: Web Application Testing in .Net, available at http://watin.sourceforge.net/documentatie.html, retrieved May 1, 2007.


These differences may be a reflection of true differences in the population from which the samples were taken.

the rationale of this investigation is twofold.


in fact, GN contains all worst-case generators in G. the set of possible branch policies for a program P is .nite because P contains only .nitely-many conditional branches.


Categories and Subject Descriptors D.1.1 [PROGRAM-MING TECHNIQUES]: Applicative (Functional) Programming; H.3.5 [INFORMATION STORAGE AND RETRIEV-AL]: On-line Information Services; I.1.3 [SYMBOLIC AND ALGEBRAIC MANIPULATION]: Languages and Systems General Terms Languages, Web Applications, ComputerAlgebra, Symbolic Computation Keywords mathematical encyclopedias, quotations, antiquotations, metaprogramming, web services 1.

so, for some services and typicallythose that generate a whole web page rather than a sectionin a web page, obj is just OCaml s unit.


Both of these enhancements signi.cantly complicate the design of the interpreter.

we run all con.gurations on the 64-bit Java HotSpot server VM of the JDK 7 update 2.


This macro simply indicates that we should perform the self-callouts in sequence.

buffer_eqc:put([0]) -> ok. Reason: {postcondition, {failed_to_unblock, [{buffer_eqc, put, [[0, 0]]}]}} The reason for the failure is explained to be that the second call to put did not unblock when it was supposed to.


Moreover, an analytical cache model provides deeper insight into the behavior than what may be learned from simulation.


A top-down algorithm for clustering in large-scale distributed networks.

when an unclustered node timeout expires, it creates a new cluster with its own id.


Arrows indicate where a .deposit(m) and log .add(c,d,n) can be interleaved, assuming that a and a and log and log may point to the same objects, respectively.

a data race is said to occur when two threads concurrently access some data, where one of these accesses is a write, and where no synchronization exists between the * This work has been supported in part by the Defense Advanced Research Projects Agency (DARPA) under contract No.


The probability that the contact information in the reference is valid, is the higher the more recent it is.

we have an adapter implementation that integrates FT.ex in Java RMI using customised stubs using the same approach as Jgroup and Cazzola et al.


Secondly, the hierarchical clustering does not perform global optimization (cf.

we opt for the second representation because it allows verifying completeness and consistency properties more e.ciently (cf.


Upper layer protocols point the address of this container as well as addresses of mbufs (data) into DMA descriptors.

it is a dynamic parameter for system tuning, rather than a static parameter for system design.


This does not mean, however, that the class containment graph should be acyclic as well.

if one thread changes the object containment graph while another is traversing that graph to look up an acquired .eld value, the results are unde.ned.


Background information on the proposed solutions can found in the recently published paper [4].

for more complex and security concerned Copyright is held by the author/owner(s).


Moreover, there are various techniques, which are used to handle missing data in software cost estimation models such as mean imputation, list-wise deletion (LD), kNN, and Expectation Maximization (EM) algorithms.

data mining static code attributes to learn defect predictors.


The management part is further composed of two modules.

declaring the method as static prevents it from directly accessing the initial knowledge represented by the class fields (which are non-static).


3b), which only uses Core SCCharts features.

it is quite restrictive due to the only one value per reaction requirement.


However some alternative features are de.ned not in domain levelbutin implementationlevel.

it allows a sub-aspect only to give concrete pointcut de.nitions.


Similarly, nodes in a lower row of the routing table are likely to be further away.

this technique exploits the property of the Pastry routing table, whereby nodes in the top row are most likely to be closest proximity-wise to the multicasting node.


All the students had experience with software development in industry.

in addition, we provided UML+ design diagrams, where information about composition properties is explicitly represented.


The need to run satisfactorily on different platforms may very well impose different performance requirements, but there is a more fundamental need for the system to interact with its users differently on different platforms.

formally and precisely de.ning the variation relations that de.ne each of these kinds of families is important, and a key goal of new research.


Participants reported appreciating the instant feedback alongside the code they were currently working on.

the current prototype, Application Security in the IDE (ASIDE), is a plugin for the Eclipse Java development environment.


PhD thesis, University of Illinois at Urbana-Champaign, 1992.

features in this study represent selectable development steps.


These proofs are speci.ed using about 2500 lines of Coq code.

all the material described in this paper is available online at http://coqcots.gforge.inria.fr.


[5] proposed an optimal of.ine low power scheduling algorithm that assumed a processor with continuous voltage/ frequency scaling.

dynamic voltage frequency scaling (DVFS) [1] and dynamic power management (DPM) [2] have emerged as two primary systemlevel optimizations for low power design on embedded processors.


scheme period MAXSAT + TSP %> %= 1 14% 36% 15 64% 78% aOpt 30 78% 100% 45 71% 100% 100 14% 14% 1 21% 21% 15 64% 71% abestF S 30 71% 86% 45 78% 93% 100 21% 28% 1 7% 21% 15 21% 36% stdDev 30 28% 43% 45 28% 36% 100 14% 21% Table 2: Overhead provoked by the di.erent periods 1 15 30 45 100 58% 11% 6% 2% 1% while the abestF S also o.ers quite good results and it has the advantage that it does not require any additional information of the problem.

most of the proposed techniques in this domain change their dynamics using the current status of the method and some historical data.


For example, pattern variables may replace any subexpression of an expression or of a statement; the then or else branch of a conditional, etc.

using algorithm ES(1), the pattern from our running example has to be written %x = %y -%z , using no meta-parentheses.


Scope markers play nicely with all existing effect handler frameworks and can piggyback on existing optimizations and convenience infrastructure (e.g., Template Haskell macros).

prog sig a parse [ ] (Return a) = return a parse (x : xs) (Return a) = fail parse [] (Symbol c k) = fail parse (x : xs) (Symbol c k) | x c = parse xs (k x) | otherwise = fail parse xs (Other op) = Op (fmap (parse xs) op) This handler also fails if the input is not entirely consumed, or if the grammar expects more symbols.


(If C had been .nal, dynamicTypes C would have expanded into the empty set).

another analysis may compute this failure reason: failed (DoesNotModify, T::x, x = f ()) and failed (DoesNotModify, T::y, x = f ()) This means that the analysis failed because the statement x = f() might modify both T::x and T::y.


In either case, our dynamic partitioning algorithm is locality aware.

cittaTron [7] is a multiple server game with load adaptation mechanisms.


Each program split includes all code reachable from a single entry point.

their malware detection was based upon the structural similarity of callgraphs, while DroidSIFT relies upon more robust, high-level (API) program semantics.


In general, we consider that .nding the right technique(s) and adapting them to our problem is an open issue.

aPPROACH Fundamentals: We start by formally de.ning the involved concepts.


Using our proposed algorithm for the selector function, we will consider general purpose and I/O registers our input components in this order.

we .rst experimented with different widths ofra *.


Unfortunately, the CPS transformation is not modular; the entire code-base, including libraries, must be transformed.

we leave the actual set of constructors unspeci.ed, though we assume it contains the standard list constructors cons and nil.


Because of the way that we de.ne the operations on traits, the semantics of a method is independent of whether it is de.ned in a trait T, or in a class (or a trait) that uses T as a component.

note that this is quite different from using a loop, where one must know whether students is an array or a linked list before the loop can be set up.


This code is also usually very short, as the use of OCaml functions allows to reuse a lot of code.

the .rst one consists in viewing the sending of a Web page by the server as a function call, (a question asked of the user) that will return for example the values of a form or a link pressed.


For each metric, we show the inter-request metric variations and the metric variations when intra-requestbehavior .uctuationsarealsoconsidered.

on Computer Architecture, pages 336 349, San Diego,CA,June2003.


As established in the original CRQ algorithm, only dequeue operations can change the index of a given ring slot, allowing it to be reused for a later element in the logical sequence of data .owing Figure 3: Performance on hot potato benchmark (second processor engaged at 13 cores)  through the queue.

based on these tests, we recommend using the MPDQ in any application in which dequeuing threads need to wait for actual data.


This is a large exponential,but nevertheless terminates.

label types, a , are three-tuples ( S , F, A ); S is a set of secrecy labels for the current object, F is a record containing sets of labels,representing the internal .elds of the object, and A is an .-type, atype representing the concrete class of the object, explained below.The type de.nitions are summarized in Figure 3. a ::= ( S , F, A )|t types S ::= {¯l}|sa|S .


Our approach also assumes that the number of really spawnedtasks(andsteals)isvery small.Thisassumptionjusti.es our approach, which accepts higher work-stealing(backtracking) overheads in order to achieve lower serial overheads than more conventionalLTCsuch asCilk.

the former allows easy support for various platforms with existing C compilers, and the latter providesahigherperformanceby using assembly-levelimplementationtechniques.


Using logical locality would be awkward because logically related data are not necessarily modified at approximately the same time.

lFS insists on using fixed-size segments with no regard for disk utilization or fragmentation.


The experiments and results described in this paper are relevant to these systems and could be repeated on systems with quad-core or newer processors.

these techniques could be used to validate safety-critical guest device manipulations in virtual machines.


At the end of the graduate coursework, a two-semester software studio provides a graduate capstone experience similar to the undergraduate senior project sequence; however, the software studio focuses more on research- oriented projects, and provides more interaction between the project teams.

(unlike the RWL, the Texas Tech process was developed with an entire curriculum in mind.)


This is made even more complex by the fact that, apart from the microcell itself and its data, the connections between the microcell and its neighbors need to be moved, as well as the connections between the microcell and the players in the microcell, or rather between the ActorController of the microcell and the players.

the goal of the test was to have an indication of the performance impact of using JMS for the communication between MicrocellControllers.


The test results for the sample data sets show that the mechanism can ensure the upper users accessing the file systems transparently, reduce more than half of the data storage costs during protecting process, and greatly enhance the efficiency of service application data.

cONCLUSIONS Continuity of service applications is related to the service security of many important industries and fields in the network environment.


As mentioned above, each device may need to use a specific protocol to communicate with the DHG.

for instance, a light might be registered as the 11-th device within the driver that controls its domotic system (and which is presumably connected to its main control device), while its type is a light, supporting on and off events, and the location is the kitchen (Figure 3).


Backend .c .cgd Generator IR front PE code register sche code .edl emitter end Engine selector allocator duler Target dependent backend engines Figure 2.

support for PE in retargetable compilersis ofhighinterest.


In this case, the producer epoch should still signal the consumer epoch by sending a NULL value in the address .eld, so that the consumer does not wait inde.nitely.

in another prior work we explored the compiler s ability to improve scalar value communication, and showed that compilers can communicate scalar values ef.ciently between epochs [32].


Enumerate the design options available and the associated trade-offs in implementing web services, indicating the most suitable choices for sensor nodes, and 3.

our work focuses on the low-power sensor nodes and uses XML to support web services, enabling a very different set of features compared to [9].


DISCUSSION AND CONCLUSIONS In this paper, we have studied whether the analysis of the structure of the labels of biomedical ontologies might play an important role for the axiomatic enrichment of existing ontologies.

[4] P. F. Brown, P. V. deSouza, R. L. Mercer, V. J. D. Pietra, and J. C. Lai.


The average population size shows the average number of objects that are live at the same time.

there are two metrics: global reachable liveness, wlg,r(k) and global actual liveness wlg,a(k).


Notice that playing the sequence of operations twice allows the observation that playing it successfully once have no side e.ect on replying itin adi.erent context(whereit couldpossibly fail); * 0..1 we have bounded opas op; GC,EA GC,EA * we have bounded GC as GC 0..2 .


Postmark: 5,000 .les and 20,000 transactions.

neither of these approaches are as modular as a monitor framework, be cause developers must implement all of the protocol s methods.


Recently, it has been shown that dynamic slicing based techniques are quite effective in locating program errors [19, 20].

we conclude that there is a dependence between S4 and S6.


Invariants are not always readily available: they must usually be speci.ed manually at some point in the design process, which is time-consuming, and most commercial software is therefore not annotated by invariants.

to answer this question, we used µJava with its default settings to generate Traditional Mutants (method mutations) of the 7 Gries examples, giving a total of 310 compilable mutants.


We also used the message stubs and a simple Table 1: Interface Veri.cation Performance Peer Time (sec) Memory (MB) CustomerRelations 8.86 3.84 LoanApprover 9.65 4.70 RiskAssessor 8.15 3.64 driver to enclose the environment of the application threads in a peer implementation.

otherwise, the LoanApprover service sends a check message to the RiskAssessor service.


A means for communicating the constraints and opportunities of the interaction space to the user is recommended for mid-air gestural interfaces.

as the quantity and complexity of gestures in the interface increases, this approach results in a high number false positives in gesture recognition due to intermediate movements intersecting hotspots.


This high variance makes it di.cult to autotune well, especially for GPEA which only runs a single test for each candidate algorithm.

scheduling FFT computation on SMP and multicore systems.


2006-04-06. http://www.tucs../magazin/output.php?ID=2000.N2.LilDeEmPy [23] H. Liu, T. Roeder, K. Walsh, R. Barr, and E. G ¨un Sirer.

flexCup [27] or diff-based approaches require the usage of specially crafted utilities to produce meta data or diff scripts required for uploading software.


For example, someone might call save-fish with "../../passwords" as the second argument.

dynamic checks must not only ensure that fish contains a canEat method of one argument, but also that an integer is allowed as the argument, and that the result is a boolean.


Since the scheme connects different users directly, this can considered as a peer-to-peer system.

this way application developers may implement their web applications in a more natural an concise way and not worry about the networking details.


Process s a: transform a parsing process by pre-computing all the intermediate parsing results available.

it is impossible to write left-recursive parsers, because they cause a non-terminating loop in the parsing algorithm.


code review), and 2) using SNA techniques for measuring developer reputation.

second, we used the single-core LibreOf.ce (left side of Figure 2).


We argue that reasoning about programs with instance chains is simpler than reasoning about programs with overlapping instances despite the additional syntax.

gcd m n p both GHC and Hugs reject this trio of instances.


Of course, a higher number of systems and versions is always desired.

this can also foster the tool integration with other programming languages as we can develop translators to represent architectural relevant information as Prolog facts.


An around partial method can execute another around method or the original method by calling the proceed pseudo method.

the result of the run method changes with respect to the user s surrounding environment; when it is used out of doors, the GPSNavi layer is active and the run method displays a map of the area obtained by the GPS; when it is used inside a building, it displays a .oor map of the building, because the WifiNavi layer is active; when the user is boarding the plane, both the GPS receiver and wireless LAN device are automatically switched o. because both WifiNavi and GPSNavi become inactive.


This shows that at least for these programs, automatic garbage collection comes with a price in both space and speed.

the overhead for malloc-table storage is one word (four bytes) for each used/unused chunk, or hole in the heap.


The Events Data source repository contains the consolidated transaction data previously extracted from the multiple original repositories.

a lifespan can be initiated by an event, at startup, or at a specified absolute time.


Posting Data We have shown our system s ability to create applications that pull data from a web data source.

both NoPumpG and Forms/3 have unconventional spreadsheet designs that may not be intuitive for end-users.


An edge detector is however quite a small example.

g e n s y m t e l l [ v + + " = g e t c h a r ( ) ; " ] return (Var v) compCMD (Put a) = t e l l [ " p u t c h a r ( " + + c o m p E x p r a + + " ) ; " ] The compCMD function generates code for a single instruction, and is lifted for compilation of whole programs: c o m p i l e : : P r o g a .


we can utilize even more sophisticated approaches (e.g.


Hence, understanding, adding and removing messages is always realized using the regular object s virtual method table (VMT), as desired.

layers allow context-speci.c behavioral variations to be composed based on the execution context.


This is indicated by the dotted arrows between the SW processes P1 and P2.

greenBus -A Generic Interconnect Fabric for Transaction Level Modelling.


The C674 implements an EQ register latency model, has variable length instructions to reduce code size, and a modulo loop buffer.

in the process of searching for a valid schedule, slack scheduling has a backtrack function that ejects previously scheduled nodes.


Introduction Today s embedded applications are very different from those in the past, in terms of both application complexity and dataset sizes.

[4] M. Kandemir, G. Chen, W. Zhang, and I. Kolcu.


pointcut clientStringOrigin() : call(String Request.getParameter(String)) after() returning (String o) : clientStringOrigin() {...} pointcut clientStringModifications() : call(String String+.*(..))

they do not need to be invoked by the same object that already sent the delete method (indicated by the interrupted lifeline).


This makes sure that errors such as the goto fail can be avoided.

the code tries to validate an SSL certi.cate using the multi-step error checking idiom where di.erent kinds of validations are performed in a sequential order and the .rst failure will result in a jump to the error-handling routine (marked with the fail label here).


The block contains 2 elements and 6 bytes of remainder area.

this makes it harder to compile the large programs used in the real world.


XQuery 1.0 [16] and XSLT 2.0 [7] share a lot in common: they share XPath 2.0 as a common sub-language and have the same expressiveness.

in Section 4, we focus on the most complex detailed issues that must be addressed to support the complete language.


the decoration proceeds backwards as follows,beginning with level k, the largest level: For each message m1 at level k - 1, and for each message m2 at level k, calculate the hash of each sequence consisting of message m1, followed by message m2.


This histogram can be generated for a speci.c task by pro.ling methods and can be updated during run time if necessary.

the remaining unused time (slack) would be 0.4 time units and the second job could reduce the frequency to C2 d2-d1+0.4 0.81.


In this way, one processor cycle can be saved for each execution of _L3.

thebranch targetisfetchedin advance as nextinstructiontobe executed.


Of course, these design decisions are all quite sensible, they were simply taken to meet different requirements.

this .eld stores an instance of a once-unrolled version of the recursive type.


The _Tag method builds an Event, which is an object with the parameters of the call and other pertinent information including, for instance, a timestamp and process identification.

the C-Broker may be simply monitoring the application for profiling or for the Actuator to do some action, without blocking tasks at each event.


We explore the design alternatives that have been considered in order to achieve performance levels approaching those of more primitive message-passing mechanisms such as MPI.

publishing and subscribing processes communicate with process 0 in order to create new topics or query information for a topic via a simple MPI messaging protocol.


ACM Transactions on Graphics, 26(3):88, July 2007.

to enable realistic, high resolution 3D object in NVE, it is not feasible to render a 3D object only after it is completely received.


applications because they usually have resource constraints, such as a limited amount of memory.

for each optimization, we show both the incremental improvement obtained from adding that optimization to those listed above it in the table as well  Kernel con.g.


5 Using the Simulator The simulator can be used to illustrate different aspects of monitors and monitor solutions to the dining philosophers problem.

in the traditional algorithm, if one of P2 and P4 are always eating, P3 will starve.


This enables the runtime to dynamically coarsen the tasks and improve performance without impacting load balance.

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


PROTOTYPE ARCHITECTURE OVER-VIEW The prototypeis splitintwo main applications: .rstly the graphical user interface (the so called frontend), with whom the user can interact in the car and secondly a web service and a database (backend).

most of the recommender systems need a lot of user interactions to produce suitable results.


Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features Concurrent programming structures, Patterns.

they fail to eliminate the problems associated with crosscutting.


Let wk,j denote the number of execution cycles allocated to the jth coreduring the execution ofjob Jk.

figure2 shows the simulation results for platforms equipped with 2 and 4 DSPs, respectively, where MaxSpeed denotes the results by setting the operating frequency as the minimum one that satis.es the timing requirement of the given video bitstream without dynamic adjustment.


Typically, in timed SDF models the time domain is the non-negative reals or integers.

a characterization of the minimum cycle mean in a digraph.


In order to generate ef.cient code from Koala speci.cations, partial evaluation techniques are employed.

cODE GENERATION: FROM COCO TO C++ AND JAVA CoCo can be used to specify a system using the Pecos model.


One might think that name-swapping only occurs in the dynamics of nominal metalanguagesand notin thesemantic speci.cations writteninthose meta-language.


qoS-compile determines the amount of throttling down statically.


Here, the result of many remote accesses can signi.cantly harm the overall system performance.

they have to take samples and to learn from previous runs.


For a certain B1 value, the smaller B2 is, the higher its hit ratio is.

the more files accessed from flash memory are, the more energy efficient the secondary storage system is.


He still wanted the tree structures, but at each level of the trees, the elements should be laid out from left to right according to a special criterion.

acknowledgement The authors thank the contributions of the data from the OpenOME development team, including Xiaoxue Deng, Neil Ernst and Eric Yu from University of Toronto, Canada.


These values seem a feasible time for models with more than 1000 events.

in addition, the development or purchase of the new system might exceed a company s budget.


By using a suf.ciently constraining kind system and incorporating techniques from typed compilation into the type-level language directly, the global safety properties of the language and compilation process can be guaranteed.

extracting a compiler from a declarative language speci.cation (e.g.


The speci.c data types usually serve for the identi.cation of interesting cases in a generic algorithm.

6.1 An aside about types It is worth noticing that the type of everywhere could equivalently be written thus: everywhere :: (forall b.


ScopedMemory is an abstract base class for memory areas having limited lifetimes.

they leave options open late in the development and testing cycle, rather than making early (and sometimes regrettable) commitments that can only be changed at great cost.


Spec also follows the lead of Glamour [17] in favoring an event-based .ow through the widgets.

add:withSpec:origin:corner: add the model provided as .rst argument using the selector provided as second argument for retrieving the spec.


In a there can be any number of frames, from one single frame to na frames (in which case each frame carries one single message).

we considered two-cluster architectures consisting of 2, 4, 6, 8 and 10 nodes, half on the TTC and the other half on the ETC, interconnected by a gateway.


de Computadores e Sistemas Operacionais Universidade do Estado da Bahia Salvador, Bahia, Brazil muriloboratto@uneb.br Marcos Barreto Laboratório de Sistemas Distribuídos Universidade Federal da Bahia Salvador, Bahia, Brazil marcoseb@dcc.ufba.br ABSTRACT Auto-Tuning techniques have been used in the design of routines in recent years.

architecture of an automatically tuned linear algebra library.


These models are used to enrich the source data with multiple-level or multi-faceted information.

due to the continuous growth in network speed, petabytes of data may be transferred through a network every day.


Section 5 discusses related work, and Section 6 concludes.

[1,m])all the Body i, and Handler j are comma-separated sequences of one or more expressions, and the Pattern i are arbitrary patterns.


The Case for Power Management in Web Servers.

model Adaptive may decide to change the con.guration completely, by turning several nodes o. and several nodes on.


This approach avoids the elaborate probing mechanisms or explicit waits-for graphs common to distributed deadlock-detection algorithms.

each thread can store this quantity in a single 64-bit word.


In order to achieve this robustness, two classes of failures need to be taken into consideration: On the one hand, communication failures are frequent in ad-hoc networks, on the other hand, the lack of a central control in such a network encourages deceitful behavior.

the concluded contract between the involved parties is logged within the SLS and thus can be used by the reputation system to prove one s fair behavior.


DEFINITION9.Considertwoomposableinterfae automataPandQ.Apair(vPu)EVpxVQofstates isompatibleifthereisanenvironmentEforP®Q suhthatnostateinlllegal(PPQ)xVEisreahablein (P®Q)®Efromthestate(vPu)}xVinit .Wewrite E Cmp(PPQ)forthesetofompatiblestatesofP®Q.


Test Ontology We here present concepts used in the usability test process of SE integrated with UI models, followed by an example of the automatic generation of test cases from the AUI model, in order to show how it is possible to define usability test earlier in a SDP.

figure 3 shows the test process ontology of SE related to a complete interface evaluation (usability, interface and functionality tests), using the UI models and our proposed method.


We then show how it can be extended to produce a possibly quali.ed access as its result.

in Workshop on Partial Evaluation and Program Manipulation.


Furthermore, even in the absence of network partitions, data replication based high-availability systems require a tradeoff between consistency and latency as stated by the PACELC theorem [1].

it is worth to take a look at how these problems are solved in database and distributed systems research areas to evaluate whether the same solutions apply or how they can be adapted in the context of RESTful services.


The .rst pass computes the total size of the resulting native code, by adding up the sizes of the templates for each bytecode instruction in the unit.

our VM, with large opcode bodies, encounters major I-cache stalls on many benchmarks.


Here the two possible call sets (traversal orders) are {leftChild, rightChild} (lines 15 & 16), and {rightChild, leftChild} (lines 18 & 19), and which call set a point will take is decided before any recursive calls are made.

prior work introduced point blocking as a method for improving locality for tree traversal codes when traversal sizes attenuate the bene.ts of sorting [19].


An important parameter in such systems is the monitoring interval.

in this paper we explain our adaptive system built on the Intel® IXP2400 network processor.


To relieve this problem, it is reasonable for page replacement algorithms to grant higher priorities to those pages from compressed file systems.

write I/O time is not relatively large compared to read I/O time as shown in Figure 7(d).


Given x AFs, the maximum number of superstates in the ADD graph is x +1, in which case, all sets of cAFs of each superstate have the minimum number of cAFs, i.e., 1.

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


Often, a specification-based test suite is constructed from an EFSM model to fulfill some pre-defined coverage criterion such as a control-flow or data-flow coverage criterion [2, 10, 17, 21].

here, we correct their definition of activation [data] dependence, and introduce a new CD type as activation control dependence.


To minimize the gap between software designs and SCM, the SCM research community has investigated ways to provide version control for software objects and structures.

when the current version is set to a captured version, the state of the whole project is set back to that version.


As environmental scientists strive to prioritize the clear statement and communication of the semantics of natural systems in favor of understanding software implementations of their models, Domain-Speci.c Languages may come to help, offering the option of truly declarative environment for environmental modeling.

without suitable tools and languages, the paradigm shift required would carry a cost too signi.cant for widespread adoption.


We model the house offline with FDS and compute fire and smoke data for the entire house volume at one-second increments.

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.


Effect systems have been conceived for functional languages [19] to describe and infer the scope of side effects, with the goal of detecting parallelizable code fragments and improving memory management.

the path-based semantics requires time linear in the number of installed contracts for each read and write operation, whereas the installation of a contract takes constant time.


The decision model for bounding specific services of a domain to a product may be in a tabular form or a more comprehensive tool based on the feature types and composition rules.

[5] Buschmann F., R. Meunier, and H. Rohnert, 1996, Pattern-Oriented Software Architecture:A System of Patterns.


All control .ow is in this .le and is immediately visible to the programmer.

the SLEEP statement is followed by an expression indicating how long the mote is to sleep, given in milliseconds.


Wormbench: A con.gurable workload for evaluating transactional memory systems.

sTAMP applications are implemented in C with pthread.


Hence, any solution will be tolerable although one with higher utility is obviously preferred.

in Figure 5 we show the runtime for three different COPs, with varying energy constraints (set as a percentage of the maximum energy required for the most resource demanding state).


Due to the low performance of atomic memory operations on the NVIDIA G200 architecture (and their non-existence on the G80 architecture), the limited performance of scattered writes to global memory, and the limited amount of shared memory available, an efficient histogram updating algorithm supporting an arbitrary number of bins is infeasible.

we can take advantage of workload balancing schemas appropriate for each individual kernel: the bin assignment kernel runs on a 2D grid of thread blocks, whereas the histogram kernel runs on a 1D grid of thread blocks.


1B-to-2b maps 1 byte of application memory to 2 bits of shadow memory.

if we restrict the shadow metadata unit size to be a power of 2, this equation can be optimized using a shift as shown below, which is a faster operation than multiply on most architectures: addrshd = addrapp « scaleshift + offset (2)  2.3 Instrumenter The instrumenter inserts the metadata tracking (i.e., metadata mapping and updating) code into the application code stream.


We describe hooks that OC T E T provides for building new analyses and show how the dependence recorder implements these hooks.

a responding thread responds to requests by increasing its resp counter; in this way, it can respond to multiple requests simultaneously.


Research Perspectives in Self-Healing Systems.

it examines how well the architecture supports the following modification scenarios: Adding a new monitor necessitates adding a new configurator.


As .is a constructor symbol, for every pattern l,the terms lX and l. are also patterns.

the function abs of Example 5 has the following parallel de.nitional tree:  abs(x1|x2,x3) abs(x1|x2,x3) abs(x1|.,x3) abs(x1|true ,x3) abs(x1|x 2, true) abs(x1 |., .)


Inference rules are if-then type and used to represent facts and required conditions.

the GridManager returns back the EPR of a newly created Seller/BuyerResource to the GridManagerClient.


The first four elements each have HTML tag names (such as IMG) which our application uses to identify those elements as content while traversing a webpage s document tree.

we chose to make the web browser part of the application.


[0,µ-1]2 to be the (i, j) th sub-grid, for i,j <m.

from point cloud to grid DEM: A scalable approach.


when we turned to real benchmarks (such as jess), we found overly conservative solutions from using logical bitwise or as the meet operator.


This prede.ned time varied between di.erent test candidates, since they di.er in their complexity and required input data.

the approach is implemented as a tool, RuTeG, in and for the dynamic programming language Ruby.


Greater menu depth promotes a process known as funneling, which reduces the total number of options that have to be processed.

success was also due in part to Henter-Joyce's efforts to make JAWS for Windows work with these popular applications.


it has only a partial model of the complete system.


GENERALIZING THE PUZZLE We showed in the previous section that solving k-set agreement among any given set of k +1 C-processes requires an 7A black-box simulation of Ax using (.C ,x)-set agreement objects is presented in [17].

by outputting the identities of the (n - k) S-processes that were last to receive turns in the current run we emulate the output of ¬Ok: we output sets of n - kS-processes that eventually never contain some correct process.


Natural language programs on the contrary, especially multilingual natural language programs, have the potential to be much easier and quicker to understand.

like with try-catchfinally in Java and C#, programmers could be forced via call backs to explicitly deal with possible exceptions: Have you taken into account, that the hard disk might be full when doing this?


The framework encapsulates communication channel specifics within the respective channel managers to hide them from application and sensor driver developers.

since each sensor is isolated in its own framework thread, the effect of a misbehaving driver on the framework will be minimal as the framework can handle such drivers with a timeout or exception.


It is not clear how that expressiveness would be useful.

given an a, we would like to be able to determine whether it is an instance of this particular data constructor, and if so extract its arguments.


ACM Computing Surveys, 43(4):1 66, 2011.

among those described in [14], the following are the reasons for adopting the GORE approach: Figure 1: The Needs Graph.


A prototype of the distributed FScript interpreter has been implemented and experiments involving distributed recon.guration have been performed.

if necessary, the action is automatically loaded in the remote recon.guration controller (loadScript primitive).


InC++, objects whose types are type parameters can be used in any operation; type checking of generic de.nitions is delayed until after concrete types have been bound to type parameters.

finally, member types may give better protection against changes in interfaces.


Scrap more boilerplate: re.ection, zips, and generalised casts.

smash your boilerplate without class and typeable.


It allows designers to integrate goals defined by the experts, with the preferences of children [6].

structure of the treatment plan  In order to design a game capable of performing as a mediator of social communication we decided to structure the design methodology by involving different stakeholders during different stages of the design process.


bar tially, we consider only two types of statements: assignments and assume statements.

the SMASH implementation makes the rules given in Figure 10 deterministic as shown below: must 1.


The result of transformation and compilation is a set of related state machines mapping both architecture and behaviour model transitions as a system.

section 4 describes an approach for engineering services with modes and in Section 5, transformations from modes to models are speci.ed.


The information that our visualization presents is obtained from EPTOOLS, a program-analysis tool that gathers exception-related informationforJavaprograms[Sinha andHarrold2000].

jexVis: An interactive visualization tool for exception call graphsinJava.


The di.s column indicates the number of lines added or changed in porting from C to Cyclone.

current version at http://www.cs.cornell.edu/projects/cyclone/.


map g (name f) And the second component is the singleton list containing the expression: .f .

bernouilli The benchmark on which we do worst is bernouilli.


Filinski also showed how to implement monads in a composable way [9]: given implementations of individual monads, and an order in which they can be layered on top of each other, he gives a semantics to their compositions.

3.5 Syntax-directed type inference Figure 6 presents a syntax directed version of the declarative type rules.


This limits their applicability to systems for which an extensive modellingprocesshasbeenperformed.

eTT measurements require synchronised clocks, and all measurements rely on the existence of a TransmissionID .eld to distinguish retransmissions of a message.


4.3 K-Normalization (195 Lines) type KNormal.t (* K-normalized expressions *) val KNormal.f : Syntax.t -> KNormal.t val KNormal.fv : KNormal.t -> S.t We stated that compilation is about bridging the gaps between high-level programs and low-level code.

we need to save the values of all registers that are live at that point, as implemented in an auxiliary function RegAlloc.g call.


In Proceedings of the 11th European Conference on Object Oriented Programming (ECOOP 97), Jyväskylä, Finland, 1997, 220-242 [3] Vdovjak, R., Frasincar, F., Houben, G.J., Barna, P. Engineering Semantic Web Information Systems in Hera.

furthermore, this support is often intertwined with both the original application design (most often in the form of adaptation conditions spread over the different models) and its corresponding implementation.


[4] With the expanding and development of application field, the traditional campus card cannot satisfy requirements in higher safety and more complicated application requirements.

a Solution of Wisdom Campus Based On RFID-SIM Xia Wei School of Electrical Engineering and Information Sichuan University No.24 South Section 1, Yihuan Road Chengdu, China +8613666160897 xiawei9033@163.com Liu Nian School of Electrical Engineering and Information Sichuan University No.24 South Section 1, Yihuan Road Chengdu, China +8613981935993  liunianis@gmail.com ABSTRACT In this paper, a solution of Wisdom Campus based on RFID-SIM is proposed.


Katz approach is very similar to ours but does not specify the addition and removal of unit tests by aspects.

v e r i f y P a s s w o r d ( " b a r " ) ) ; } It is also common that, for security reasons, passwords do not get stored in clear text.


Initially, the two CSW employees collected the data.

there is probably, implicit guanxi in many Western countries that might help researchers improve their data collection efficiency.


Geno [9]) and related, but white-box, testing tools (cf.

a code generator s input and output are complex objects having not just syntactic structure but execution semantics, too.


Cross-layer transformation approaches, however, are limited to transforming XML documents into object models, which have to conform to a UML model.

aiming at a precise definition of sourceElement link targetElement tuples in the WebML metamodel, we introduce the LinkableElement concept (cf.


And just like join points in AspectJ, control passes each communication link in the UML two times, once the conUrol is passed down to the called instance, and once conurol flows back up again.

nor is it the duty of the base classes to implement this feature.


Experience indicate that distillation at the enterprise level is hard, why is trading more core than supply operation?

in the next two sections distillation and large scale structures will be briefly touched.


Rather, by launching VMX modes, the execution environment is extended with the two aforementioned operating modes; the running operating system is then associated with non-root mode, while the VMM is associated with root mode.

functionEntry Breakpoint on function entry point FunctionExit Breakpoint on return address SyscallEntry Breakpoint on syscall entry point SyscallExit Breakpoint on return address v IOOperationPort Port read/write IOOperationMmap Watchpoint on device memory  Table 2: Techniques for tracing events might notify the analysis tool (i.e., the entry point of the event gate).


The way how to identify relationships will immediately determine how the states in general and common states in particular are de.ned, and will therefore determine the size of the state space.

in 8th European Software Engineering Conference/9th ACM SIGSOFT International Symposium on Foundations of Software Engineering (ESEC/FSE-9), pages 74 82, New York, NY, USA, 2001.


in Problem Frame terms, it assumes that a particular frame always applies, in which there is a machine, an input device domain, an output device domain, and a domain of controlled and monitored phenomena.


[13] M. D. Bond, G. Z. Baker, and S. Z. Guyer.

figure 8: Execution speeds applying PCC, DeltaPath without call path tracking (wo/CPT), and DeltaPath with call path tracking (w/CPT), respectively.


An exploratory study of the impact of antipatterns on class change-and fault-proneness.

while it is possible to show, for instance, that the presence of some antipatterns in source code is correlated with a high fault-proneness, whether the high presence of faults (and thus repeated maintenance tasks) cause the introduction of smells, or whether there are other factors in.uencing these variables.


The major advantage of IG CGC is that if an IG is a comparability graph, then the optimal allocation is guaranteed regardless of what its node weights are, and in addition, even when an IG is not a comparability graph, IG CGC can still achieve nearoptimal colorings as proved in Theorems 6 and 7 and con.rmed by the experimental data in Table 2.

in CF 06: Proceedings of the 3rd conference on Computing frontiers, pages 9 20, New York, NY, USA, 2006.


Our goal, in fact, will be to provide a general means that can be used across the framework, regardless of the monitoring approaches being used.

we will now discuss the three main pillars upon which the uni.ed framework stands: the separation of concerns between data collection and data analysis, a common management infrastructure, and a common recovery framework.


[9] U. Foschi, M. Giuliani, A. Morzenti, M. Pradella, and P. S. Pietro.

in a model that strictly follows the structure of a physical system, as we have observed on the railway case study, typically only neighbour components interact, hence the size of the generated model may not explode.


[3] Arias, T. B. C., Avgeriou, P., America, P., Blom, K., and Bachynskyy, S. 2010.


The compiler then only needs to insert an over.ow check if a computed integer value may exceed p and if, furthermore, it is used before being stored in a variable with type annotation [%].

agat proposed to use transformation as a tool to remove timing attacks.


the number of replicas that can be run without delays, as computation is relatively expensive when running under the emulator.

other work on smartphone security includes VirusMeter by Liu et al.


It can process the request/response in real-time and send malicious activities for tracking and more processing functions to the central part.

4.3 Operational Phases The run time of the system is based on three different phases including: (1) configuration and initialization, (2) training and verifications, and (3) detection.


The moving speed of an avatar was randomly generated from a uniform distribution between 0 and 0.4 distance units per frame.

since AOI(G) s apart relationships with entities A and C 2Any movement of an entity must cause it to cross some cell borders, since the cells at the bottom level of the hierarchy are minimum distinguishable units of the VW.


The LEIRIOS Smart Testing solution is currently successfully deployed on large applications in the domains of Enterprise IT information systems (web-based, client-server, SOA and ERP applications) and eTransactions systems (banking, ticketing or e-Admin applications).

this solution encompasses the processes, tools and best practices to improve conformity, traceability and risk management.


All user queries are still evaluated on the server side and the results are downloaded onto the client for display.

section 2 describes our client-server approach in more detail.


Computing and Communicating Functions Over Sensor Networks.

consensus algorithms are iterative schemes whose convergence relies on properties of the 1-hop adjacency matrix of the graph.


We believe that the answer is simple: the rules for optimizing accesses to volatile variables are quite unlike the rules for optimizing accesses to non-volatile variables, but are similar to the rules for optimizing external function calls.

the rshift_s_s function (right-shift, signed, signed) checks the values of its arguments.


The core composes these uniaddresses into a single Proteus multiaddress.

we identify this higher-level information with a provider descriptor.


Currently, mobile software lifecycles fail to establish an environment-specific measurement plan that links the overall quality goals of the mobile software market, the processes that have to be conducted to develop applications that fulfill such expectations, and the metrics that have to be calculated to quantitatively assure such compliance.

after combining the custom attributes with the core standard characteristics, a robust, mobile-specific quality framework will be available to define quality metrics that can be calculated directly to analyze the mobile software application.


In fact, term is a complete generalisation of chan.

encode :: (L,P a) .P (L,Act a+ Probe) encode (l,C) = { (l1,Act a) | ll1,a .


They could potentially use a different queue priority, make reservations, and even modify their work.ow.

a parameterization with advance notice of the upcoming spike in BlueGene s wait time should be able to correctly rank these two cases.


We would expect these overheads could be signi.cantly improved using a bytecode weaver customised for the JQL system.

[2] G. Bierman, E. Meijer, and W. Schulte.


Improving the accuracy of data race detection.

aVIO-S is a pure software approach which is more accurate than AVIO-H but incurs larger but still moderate overhead.


PPOPP 01, June 18-20, 2001, Snowbird, Utah, USA.


The intersection of MSR and software evolution when studying libre (free /open source) software has raised some controversial results, like the study by Godfrey and Tu [4], that was labeled by Lehman as an anomaly [13].

there is no mechanism to recover all the activity of a developer across repositories, or to recover all the activity with regards to a particular artifact, not to mention to track software artifacts or developers across di.erent projects.


This is a fairly complex process which requires some knowledge of NWScript and the game file formats.

there is presently an artificial limiter on the plot events which children can create using the toolset GUI.


For a buffered channel of size n, introduce a chain of n single-place buffer processes that repeatedly read a value from an input channel and immediately write to an output channel.

many interesting embedded systems are non-terminating, so we wish to consider them in more detail.


It evenly divides work-groups to all CUs (e.g., CPU cores) in the multicore CPU compute device.

figure 10 (b) is the case when the number of data TLB misses dominates the kernel performance.


Home page with downloads, documentation, wiki.

so far, we have implemented an interprocedural c.ow analysis and a thisJoinPoint escape analysis, but the approach is general; other analyses (and corresponding optimisations) can be added to the boxes labelled Analyser and Optimiser in Figure 1.


the Modern Language Association, the American Historical Association), and the increasing number of submissions to the international conference of the Alliance of Digital Humanities Organizations[1].

a large subset of digital humanities work takes the form of projects , which typically involve the curation, annotation and/or encoding of disciplinary material to facilitate discovery, analysis and/or visualization using newly-developed or existing tools.


This, of course, requires the system to provide support for some caching policy.


This explicit representation makes it straightforward to track information .ows and to enforce the key correctness property of noninterference [Goguen and Meseguer 1982].

this proof is similar to the proof of Theorem 2, shown in the appendix.


In a DHT, where every query and datum is mapped to a key, the node responsible for the matching key performs the evaluation.

the latency of query and topology operations are measured, as are the percentage of nodes with full or nearly full degree this helps measure peer assimilation rate.


FIELD STUDY We conducted a .eld study to help us understand the causes of window clutter, or why some users leave large numbers of windows open between work sessions.

the number of leftover tabs does not show a corresponding increase (p < 0.3, r2 = 0.22), implying that tabs are more likely to be reused than left over.


The de.nition of equivalent transitions above admits closure property: If two transitions are equivalent as de.ned by sharing the same set of su.xes, then each of the transitions in the su.x-set is also an equivalent transition.

the probability attached to a transition indicates how likely the associated method call will be invoked from that source state.


Unlike Metis, Psearchy is ultimately limited both by lock contention between mapping operations and by lock contention within glibc itself, neither of which we address.

3.1 Approach The design of the BONSAI tree is inspired by persistent data structures from functional programming.


(1) We propose the design for a set of robust, reusable components that facilitate the development of a wide variety of MAC protocols.

the CC2420-speci.c portion of SCP contains only 8 lines which declare constants derived from experimental data.


When MULTI detects a change in link state on a multihomed client (for example using Linux RTNetlink library), thelink module eitherrequestsanIP addressusingDHCP or reads it from a pre-loaded con.guration.

challenges still include handling of network outages, moving into and out of networks and determining which video quality to use.


Figure 8 focuses on the performance effects of return address prediction with the RAS as described in Section 3.2.

we highlight the design decisions that are geared toward the space and processing limitations of embedded systems.


For each node n (a block of consecutive statements) of the CFG, IN[n] and OUT[n] denote the set of data at the program point before and after the execution of statements in this node, respectively.

iNDICATOR alleviates this issue by ensuring that test cases of a candidate conform to all the other candidates in the same operation.


Further, elasticity could allow variable infrastructure size as a result of the availability of discount resources, or the sudden unexpected needs of the service in response to, e.g., .ash crowds.

this game can further scale up by splitting the buildings into rooms and hallways, and delegate the requests to more machines.


The model has no standard implied scenarios.

the rationale for rejecting or accepting implied scenario is currently not explicitly recorded.


we propose here to extend this result by extending the property preserving morphisms in a way that it becomes possible to strengthen guards without loosing previous behaviors.


More sophisticated approaches that permit development of systems to allow parameterization and choice of implementation have been proposed [1, 21].

to employ a component in RESOLVE, a client programmer needs to instantiate the corresponding concept by supplying appropriate arguments and then needs to pick one of its implementations.


DROP: Detecting return-oriented programming malicious code.

this could be easily .xed in practice by also diversifying the C library code.


The goal of InvTS is to allow a programmer to write straightforward queries, while InvTS automatically generates sophisticated code that incrementally maintains the values of the queries.

the "if" clause is used to check that the pattern that we matched is actually an instance of a Set.


Bug .nding for distributed memory programming models is made scalable by using a distributed analysis, but the current approaches illustrated by DAMPI and UPC-Thrille track only the calls into communication libraries.

using this we can eliminate the overhead introduced by looking up the physical memory layout inside the language runtime.


the manager provides a set of services for storage resource scavenging and data accesses: global free space management, space reservation/cancellation, data striping and metadata serving in the process of dataset store/retrieve operations.


Tracking in.uences for multiple values has a higher overhead in space and time than tracking the in.uence of a single value.

the value in.uence tracking approach can be applied using combining operators other than the average operator.


For our approach using a two-step process (collect + analyze) for dynamic analysis, this is less important.

for the less precise static analysis, we should have been able to exclude at least half the tuples with maximum coverage.


A much more desirable approach would be to simply unplug the error handling strategy associated to the constructor and plug the new one using only language-provided constructs for exception handling.

the implementation of echannel attempts to locate methods that raise the exception supplied as argument and considers them raising sites.


Using model 4 in Table 7, we can see that for TLOC , TPC and PRE the odds ratios suggest an increase in the likelihood of a postrelease defect.

initially, we build a multivariate logistic regression model using all 34 metrics as the independent variables.


The latter means that each CID represents exactly one code entity to avoid confusions.

the same applies to JavaScript functions on the client side.


The default AM that is assigned to the default FM is re- sponsible for sending a request based on the information in IRIS.

hence, its extension into the wireless and mobile en- vironment has to be carefully designed.


Suppose RT(x, y) = c. Then there exists a closed tour C of length c containing both x and y with w on the portion of C from y to x.

o We make use of Proposition 6.1 in the proof of the following theorem, which shows our routing algorithm results in pack- ets reaching their destination in finite time.


Last use location: the location in the code where a pointer tainted with tm was last used (i.e., the location where it was last dereferenced to access m, passed as a function argument or return value, manipulated using an arithmetic or bitwise operator, or copied using an assignment operator).1  Note that the allocation location and allocation size are immutable, whereas the deallocation indicator, pointer count, and last use location are mutable; they are updated by the technique as it propagates taint marks (see Section 3.3).

unlike their technique, SWAT samples accesses and uses a user-provided timeout value to detect leaks; if an area of memory is currently allocated and has not been touched by an observed memory access within the length of the timeout, a leak is reported.


the current state of the target model), and the execution of a phase changes the current state by applying the rules.

each phase de.nes a new rule scope, that is, it is possible to have a rule with the same source pattern and the same target patten in two di.erent phases without any collision because the execution context in which such rules are evaluated is di.erent.


Here select event task is modeled as of Receive Type, which bears semantics that it waits for the incoming message before executing.

vIP business modeling framework and extended modeling pyramid at the bottom of the diagram, we show system design models.


Directly using latency as the metric represents the ideal case.

we make the best use of SSDs in storage systems by achieving a set of optimization objectives from both system deployment and algorithm design perspectives.


In the simulations, transient faults are assumed to follow Poisson distribution with an average fault rate of .0 = 10-6 at fmax, which is a realistic fault rate as reported in [18].

international Conference on Computer Aided Design (ICCAD), 2004.


This eliminates the slowdown for supporting self-modifying code almost completely.

given the fact that VTune relies on sampling it is questionable whether this allows for .ne-grained pro.ling information with little overhead and perturbation of the results.


The more dynamic instances a static instruction has, the more likely an interleaving would occur.

some potential unserializable interleavings can never happen during execution due to synchronizations.


In 31st International Conference on Software Engineering, ICSE 2009, May 16-24, 2009, Vancouver, Canada, Companion Volume, pages 295 298, 2009.

threats to internal validity, asthiskind of impact analysis (Granger test and its combination with as   Figure 3: Excerpt of impact graph sociation rules) is only able to identify the presence of a signi.cant correlation between a change occurring to a .le and future changes occurring to other .les.


For example, application of MIL-STD-1679 led to higher effort estimates in embedded and real-time system type of projects, lower schedule estimates for information technology type of projects.

groups submitted a total of 54 documents.


Others secure determinism even in the presence of data races and this stronger guarantee is therefore named strong determinism [33].

our study is the .rst to measure the extent to which they make executions internally or externally nondeterministic and to identify nondeterminism due to lazy binding, initialization of C++ static variables and compiler auto-vectorization in  Record-Replay.


FILE SYSTEM XML File system structures are based on some concepts which are shared among a large number of .le system types, and other concepts which are speci.c to a certain type of .le system.

only XSLT 2.0 adaptors are supported, which means that the adaptors can only work on XML and text-based .les.


Even for client-side Java systems that load code dynamically, a large body of the Java code is statically available, and, again, there are strong restrictions on which classes can be subclassed, which all lead, again, to static information which, if collected and presented to a JIT, could result in better compiled code.

*; The class statements together constrain the class archives speci.ed by the pathstatements.


This approach is popular in complex multi-service applications as in Figures 7(c) and 7(d).

then the node calculatesits own expected invocation ratio: ' w EIRj = j wj For example, in Figure 6(b), node 4 s expected invocation ratio is: ' w4 w2 + EIR3 * w3EIR4 == w4 w4 The concerned node j forwards its expected invocation ratio EIRj to its children, then calculates its own expected performance under its expected workload intensity.


still, there is a qualitative di.erence in how Cascadia supports seamful design for developers and how it is done in model-based translucency.


Although they can support partial matching, active patterns support exhaustive matching particularly well, because a single succinct pattern function matches and destructures every alternative, returning a result indicating which case of the pattern is matched.

a type pattern may thus be used either to test for a particular method, or to distinguish between several objects with different types.


Still more fundamental: what ends are served by certifying (or developing trust) in these properties?

the concrete objectives for the workshop are to: Define the problem space, for example software properties amenable to compositional analysis, measurement, and prediction.


The next wave of convergence will bring even tougher integration challenges.

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


If they were made part of a Pin container, the feature of Pin that allows a developer to exchange containers and components would be broken.

22 &message , da t a Siz e , &a nsw e r , In this component, other types of messages such as timeouts are ig 23 &a n s w e r Da t a Siz e , IPCPORT WAITFOREVER, 0 ); nored.


Resum´e (a private e, a job-application manager: Resum´system developed by one of the authors) manages submission and review of applications for faculty positions.

usable security the application of human-computer interaction to security, especially to the design of interfaces has become a signi.cant area of study.


supplemental information to Analysis Pattern, Addison-Wesley, 1997.


If the software must meet hard real-time constraints, as in case of safety critical software, dynamic binary translation is unsuitable since the temporal behaviour of the translator is not predictable.

first of all, embedded software often involves real-time constraints that must stillbe met after translation.


Synchronous variables require no visibility guarantee, and racing variables have platformdependent behavior.

adding memory barriers to nesC s atomic intrinsics actually reduces code size slightly, on average.


This is formally de.ned by the following tlabelling procedure De.nition 10 (t-labelling).

first, as we decompose a type in a .nite union, we apply the same .lter to each type of the decomposition (f1 and f2 in the (t-prod) rule are typed many times, against different input types) and recompose the result in the output type.


Related Work Accuracy/Performance Tradeoffs.

dubstep explores a larger optimization space that includes non-deterministic execution and data races.


Therefore, b can be changed between such local iterations.

actor A .res only twice and its scheduling function can be inlined and simpli.ed into A1 = 1 and A2 = 2.


[3] Daneva M, Engineering the Coordination Requirements in Cross-organizational ERP Projects, In: Enterprise Information Systems and Implementing IT Infrastructures (ed.

level 1 represents the least challenging coordination scenarios and the least complex alignment requirements, while Levels 2, 3, and 4 successively progress to more and more challenging coordination processes and more complex alignment requirements.


Contextual Insights Ariel Fuxman , Patrick Pantel , Yuanhua Lv , Ashok Chandra , Pradeep Chilakamarri , Michael Gamon , David Hamilton Bernhard Kohlmeier , Dhyanesh Narayanan , Evangelos Papalexakis *, Bo Zhao {arielf, ppantel, yuanhual, achandra, mgamon, dahami, dhyann, bozha}@microsoft.com {pradeep.chilakamarri, bernhard.kohlmeier}@microsoft.com, epapalex@cs.cmu.edu Microsoft Carnegie Mellon University ABSTRACT In today s productivity environment, users are constantly researching topics while consuming or authoring content in applications such as e-readers, word processors, presentation programs, or social networks.

the annotation was done by an independent vendor, who was provided with the appropriate guidelines and a user interface designed for that purpose.


3.2 Measuring Player Intensity The .rst metric applied to the recorded data is player intensity, which is measured in proportion to the amount of health lost per unit time.

the player intensity in Figure 3 (b) shows that Orunjs session throughtheheroicversionofUtgarde Keep matchesthe level of intensity recorded by Aid s group in Figure 3 (a).


They sum up to 1 and serve as weights for the single terms.

this technique allows events happening in a future point in time to be taken into account such that when this time becomes current, all events of interest are already within the current viewing frustum of the camera.


Instead, the public key generated from a seed that is private in the target ambient is used for constructing the capability.

the process Mergechild,c, invoked in DoOpen, extracts all elements of the child s queues and merges them with the parent s queue.


The available program termination provers can prove the termination of this program also.

d Now by induction over the length of the sequence pc we can prove that the transition relation of the sequence A * d p1cA * d ...


This feature allows SHOCK to function as a way to send computational email over the ordinary email transport.

neither of these systems has the flexibility of SHOCK in designing forms and collecting data.


By making more e.ective use of cache resources, the PDF scheduler also broadens the design space for microprocessor designers potentially enabling the inclusion of more cores at the expense of cache resources that are less critical given PDF.

our work focuses on promoting constructive cache sharing among cooperating threads that share an address space.


The question is then if existing software management tools are supportive.

this is a problem since development of an ERP is not a single project event.


However, unlike SandyBridge that supports very few outstanding software prefetch requests at the L2 cache, each core on Xeon Phi supports a much larger number of outstanding software prefetch requests at the L2 cache.

unlike software prefetching, it is not lim ited by the small size of the Line Fill Buffer at the L2 cache that allows very few outstanding prefetch requests, but can effectively prefetch data for 32 streams.


In: Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR 12).To appear.


In contrast, in the heterogeneous architecture, each node of the IG may belong to different register files.

also devise a similar heuristic technique based on the squeeze in their algorithm.


If there are no recursive functions in our program, there will be no cycles in the call graph, and thus we can easily bound the maximum stack size for the program at compile time by .nding the longest path starting from each thread s entry point.

this paper provides additional evidence for that claim by demonstrating Capriccio s performance, scalability, and ability to perform applicationspeci.c optimization.


[25] P. Ye, E. Entcheva, R. Grosu, and S. Smolka.


The nodes under a coalesced node in the stack might be pruned from the IG as their degrees were decreased after coalescing.

as can seen in Figure 1, two register classes {X0,X1,Y0,Y1} and {A1,B1} (see Figure 1(b)) are dedicated to instruction I5, respectively at s1/s2 and at d. From this, we see that unlike in the case of add, not all registers in DSP563xx are equally usable by instruction I5.


As constraints, they are preventative measures.

while this is a clear definition, in some cases it may not result in precise enough requirements.


Here, one manually re-works the test suite for each individual product and de.nes the applicability and expected outcome of each test case on an ad-hoc basis.

test cases and test suites are crafted and maintained in a different process.


As future work, we plan to investigate the representation of antipatterns in di.erent modelling languages in order to gain experience for a more general framework, independent of any modelling notation.

concurrent Processing Systems is an antipattern whose solution looks at restructuring software or changing scheduling algorithms [23].


The leaf tasks are executable activities.

for example the tree structure produced by the association has can be expressed by invariants.


A User Profile-based Approach for Personal Information Access: Shaping Your Information Portfolio Lo Ka Kan Xiang Peng Irwin King Dept.

recent successes in search engine technologies have provided some new research directions and insights in solving some of our information need problems.


The intuition behind the deferred typing problem sets P is that, no matter which individual quadruples such a P may contain, these quadraples have to form valid typing judgements; we return to the details in Section 5.5.

in the case of annotated bindings (rule ABIND) we solve the constraint, providing as given constraint the Q from the type annotation and equating the type of the annotation (t ) to the type that we have inferred for the expression (.).


Similar to other debugging tools, our tool is also equipped with a source code viewer that always shows the current rule applied to the outermost function of the expression under consideration.

we can do better and process each event as soon as its exact structure is known but before we know its exact position in the complete sequence.


4.1.3 Construct Validity Threats to construct validity are concerned with whether the measurement in our study re.ects real-world situations.


The latter includes reports on mapping the cultural classification of Hofstede [7] onto user interface design: several studies have shown how his five cultural dimensions, which classify a person's cultural background into certain scores, relate to certain aspects of a user interface [3, 8, 11, 17].

an additional aspect is that the vast majority of answers from respondents with similar dimensions lay within two neighboring answer possibilities.


eCOSMOG: an E.cient COde for Simulating MOdi.ed Gravity.


In addition, we describe distributed data memories within a multicluster processor and an overview of compilation strategies for these architectures.

in addition, each node in the graph that accesses data memory is marked with the id of the data object or malloc() call site, and the size of the merged data object.


SecVisor : A Tiny Hypervisor to Provide Lifetime Kernel Code Integrity for Commodity OSes.

the raw data for all experiments is available from our website at http://csng.cs.


Actually, checking symbolic equivalence between sets of constraint systems is quite ef.cient.

aCM Transactions on Software Engineering and Methodology, 12(2):222 284, 2003.


Nevertheless double crewing will considerably speed collection because the second crew member can assist in getting bins to the vehicle s rear bin-lift  a speedup of approximately 40% per visit on average.

the problem for the standard VRP formulation without orders, is that the best solutions may require some co-delivery and some separate delivery of the two streams.


Also, recall that these are actually all possible paths for these test suites under any settings of the symbolic con.guration options, given Otter s simulated environment.

our mock library functions are written in C and are executed by Otter just like any other program.


The decision to have a low level interface is a sound decision for e.ciency purposes, in order to render large numbers of polygons.

its reduced size makes it easier to understand than more complex frameworks such as Croquet.


Extensibility Because the architecture of the tool abides by AMD [10], which specifies a mechanism for defining modules and asynchronously loading its dependencies, if we want to include a new kind of diagrams in the tool, we only need to define the tracks, notations, and relation rules of modeling elements based on our pre-defined code templates.

although Collaborative Multi-Touch UML Design Tool supports both track input and touch input, but cannot combine the both input means, and the touch input only is competent to pick up objects similar to mouse click on table platforms.


In the first iteration, only instructions guarded by p16 execute.

each instruction group can execute in one cycle and each iteration produces another quotient result, yielding throughput of 4 cycles per value.


The second author also verified the efficacy of the RTS process by examining the failure records of retest-all black-box testing.

most change identification approaches utilize the source code of the old and modified programs [2, 13, 19, 20, 23, 24].


Categories and Subject Descriptors D.2.6[Programming Environments]: Programmerworkbench; D.3.2[Language Classi.cations]: Domain speci.c languages.

there is a uniform carrying syntax for all the DSLs.


The PPE has two levels of on-chip cache and also supports IBM s VMX to accelerate multimedia applications by using VMX SIMD units.

the design and implementation of a .rst-generation cell processor.


The structure of OSS development communities has often been described as a core-periphery structure [12, 28, 40], with a small number of core developers and a larger set of peripheral developers.

threats to conclusion validity are minimal.


More speci.cally, COMMA works in two stages.


Proof: Before the start of any round CQi =0.

constructing such models is dif.cult for a single drive, let alone multi-drive disk arrays that are commonplace, and it is not clear how they handle devices with controllers that support out-of-order service.


[3] M. Cadoli, D. Calvanese, G. D. Giacomo, and T. Mancini.

current tools are either not fully automated or they work on a restricted subset of the UML and OCL languages.


SAC 11 March 21-25, 2011, TaiChung, Taiwan.

our hybrid extension is started from HVM, importing a component based paravirtualization feature selection such as paravirtualized halt, paravirtualized timer, event channel and paravirtualizeddrivers.


Guarded actions have already been used in the compilation work.ow of synchronous programs.

in addition to parallel execution (which is only allowedin HDLs), a moduleinstantiation can alsobepart of sequencesorconditionals.Furthermore,it canbelocatedin any abortion or suspension context, which possibly preempts its execution.


a backfilled job could transit from shadow load to sunny load during its lifetime.


p (Missed Local Group) (Missed Global Group) missed missed D, i, d group sync local seq .

therefore, the grammar presented in Section 2.1 can be represented by the declaration of an inductive type (given in Appendix A).


3.2 Process-NFL Language Parmenides adopts a strategy in which NFRs are treated during the entire software development process.


It also shows the fastest and slowest execution we measure, as error bars.

each CU contains a set of 16 Stream Cores (SCs) that have access to a shared 32KB local data storage.


Property E1 says that if y is inside the encapsulation boundary of z and x is outside the encapsulation boundary, then x cannot access y.

ownership types provide a statically enforceable way of specifying object encapsulation.


If the chunks are too small, there will be too much overhead in managing them; in extreme cases, the bene.ts of parallelism will be obliterated.

nDP languages provide language features favoring the NDP style, ef.cient compilation of NDP programs, and various common NDP operations like parallel maps, .lters, and sum-like reductions.


In this paper we therefore present an approach for automatically identifying the relevant code for a concrete product variant based on con.guration settings made by developers.

the CSDG built by our tool chain also supports CIA and we intend to address this in future work.


Three of those are introduced here: Smart Archive, RapidMiner and KNIME.

the devices in DBSA carry a large quantity of state information with them.


Using our approach, organizations can leverage failure history to build good predictors which are likely to be accurate for similar projects, too.

again, our approach focuses on post-release rather than pre-release defects; it also goes beyond the work of Ostrand et al.


[6] M. Fluet, M. Rainey, J. Reppy, and A. Shaw.

it is possible that before the cancelation occurred, other threads concurrently running were able to read the contents of this IVar.


However, in our opinion, it has a very important drawback: it is not intuitive, as it states that software projects evolve like long term correlated processes.

the ninth section discusses the conclusion based on the empirical .ndings of this work.


One case is when the element x exists in the predictor and its count number is already at the maximum log N. The other case is when element x is not in the predictor and there is no free cell space for the element x.In both cases, we remove the element with the lowest priority (pointed to by the tail pointer) instead of increasing x s count number or creating a new cell.

our next round of experiments on larger data sets is to be run with the objective of speeding up inserts in the cache-oblivious B-tree.


In[15],a modelforsynchronouscomponentsisproposed wherestepsaredescribedby using automatawith.nal states.

if the behavior is con.uent then the order of execution is irrelevant.


Peers also need to send out file chunk requests to retrieve missing streamingdata chunks.

such a high upload peer changes dynamically and could reach a veryhigh throughput, ing throughput clearly consumes more battery power.


At the end of our analysis, each UVT is output to a separate .le.

for each un-pruned value, we also identify under what condition this value would be meaningful, writing this as [C]:V, indicating value V is meaningful under condition C. Our runtime recording will .rst check C before recording V. (3) Liveness Checking and Equivalent Value Identi.cation (EVI): A value can also be dead (overwritten or gone altogether along with its stack frame) prior to a given log point and we cannot delay the recording until the log point.


Of course this approach is not new and people have been enabling this direct link for years using address tags providing contact details.

we implemented the EPCFind backend as a Java Enterprise application interfacing with Accada, an open-source implementation of the EPCIS standard as shown in Figure 3.


G2 Allow model extensions: In the .rst place, extending models becomes increasingly important to produce valid results during merging (e.g., resolving inheritance cycles).

basics of Qualitative Research: Techniques and Procedures for Developing Grounded Theory.


Forces are goals and constraints, which occur in the context.

the di.erence between the anti patterns in [2] and Oversized Information Model presented in this paper is basically the extent of its descriptions and that Oversized Information Model subsumes the two anti patterns by Ambler [2].


[-1, 1] is a monotone rep increasing function.

aCKNOWLEDGEMENT The work is funded by 973 Project of China(2002CB312002, 2006CB303000), NSFC(60403014) and NSFJ(BK2006712).


Enforcement of KM practices in RE RM compliments the repository of documentation about the system and the business processes it supports: it is a central record of process specific reuse information.

it revealed that a larger number of benefits were related to the quality of the deliverables and the KM practices.


FUTURE DIRECTIONS We continue the roll out of the senior software architect program, and have just started the fourth run of the program.

those persons are recognized as certified senior software architects which means that it is recognized Siemenswide that they have acquired a set of specialized, unique skills, know-how, and experiences; furthermore they have demonstrated that they can apply them successfully in practice.


In proc of ACM/SIGSOFT FSE San Francisco, October 1996, SEN, Vol.21, No.6, pp.

we often need to establish and handle these correspondences between the elements of different domains, each one defined by means of a model.


Therefore it allows signi.cant amount of computation to be reused during recovery while at the same time it lends itself to an ef.cient implementation.

if these two iterations are speculatively executed in parallel, the thread executing the second iteration will throw a .oating point exception, which will terminate the program.