Replaying audio data on embedded systems is one of the most popular applications.

we want to find strategy to save the electric power in the audio decompressing process to prolong battery life, and thus enhance the operational period of the embedded system, which is the key component of mobile and ubiquitous devices.


This kind of schemes is focusing on the capability of detecting forgeries.

this type of watermarks is usually fragile and is expected to be sensitive to attacks [8, 9] or even to incidental manipulations in some cases [10-13].


Compromising such a trust authority will reveal the real identity and its associated pseudonyms to the attackers.

all the transactions performed by the user will be disclosed.


In fact, the remote machines contacted by malware are volatile by nature, often hosted on other compromised computers, or taken down by providers and law enforcement when the malicious activity is detected.

the malware infrastructure required to properly run the sample is normally available for only a limited amount of time.


(It is easy to see that Bs is an m×m matrix.)

the attacker needs to .nd an attack vector a such that Bsa = y where a =(a1,a2, ..., am)T and ai =0 for i/.Im.


circuit or software) to understand the primary user beyond the physical layer.

the authentication has to be done at the physical layer.


In an analogous manner, we have come to view our laboratory modules as a succession and combination of activities involving each student over time.

the lab structure aims to optimize learning by engaging the students in the appropriate succession and combination of learning activities over time.


For di.erent feature elements, we may have partitioned the N feature vectors di.erently.

we partition the N feature vectors into the least number of consistent training groups so that for each feature element, all feature vectors within a training group belong to one minimum variance partition.


At 0% hardware, 0 this effect is reversed, and the hardware foundry is irrelevant.

hW1/SW1 and HW2/SW1 will meet and HW1/SW2 and HW2/SW2 will meet.


Many distributions come standard with an array of security tools.

they require less lab support than a conventional dedicated security lab.


Such databases contain information about employees entering or leaving the company and data such as employee number, organisational unit, location or job description.

the provisioning process encompasses two steps (see .gure 4): 1.


i .µWt() (2) ii i M-LWDF algorithm has to combine with a virtual token bucket control for providing users minimum throughput [10].

in a virtual bucket control, tokens arrive in bucket i at rate r. Wt ii()is shown as following Eq.


The relatively small code size of researchhypervisors [31, 43, 47], combined with the recent breakthrough in formally verifying the L4 microkernel [27], raiseshopefor similarveri.cationofhypervisors.However, commodity hypervisors often contain several thousand lines of code (e.g., 150K LoC in Xen 4.1) and are not yet within the realm of formalveri.cation.

researchershaveproposed architectures that completely eliminate thehypervisor [26].


The secret in this case is the location of a single user.

differential privacy would require that any change in that location should have negligible effect on the published output, making it impossible to communicate any useful information to the service provider.


Therefore, the expected time to defeat integrity by a parallel attack is also a for large a large number of attackers n. 3.7.3 Availability As above, the .rst time at which n monoculture components can be compromised by multiple, parallel attackers is also the 1st order statistic of n independent samples of a random variable distributed according to f(t)because,as above, once one node is compromised, n can be quickly compromised as well.

the expected time to defeat availability in a monoculture by a parallel attack is also a for large a large number of attackers and nodes, n. 3.8 Multiple, Parallel Attackers againstNatural Diversity The analysis gets interesting because with parallel attackers, the time to defeat one of the CIA security goals depends on when the .rst, half, and last of the attacks are successful.


These entities are primarily vehicles, RSUs, and backend ITS authority/server.

despite original motivation to address a wide range of usages, the currently defined security mechanisms solve problems mostly related to active safety class of usages.


The concept focuses on the user and user installable applications.


Authentication tracking: HTTP is a stateless protocol.

there is no protocol-level mechanism to promote a usage session into an authenticated state, as there is no inherent session concept.


After that, intents saved in the mOrderedBroadcasts are processed one by one.

we can change the position of a specific receiver on the list regardless of the priority values by adjusting the result of the prioritization right before the object that has the intent and the list of the receivers is enqueued.


In addition, as the candidate identity of the validation process, the victim may be added into SIL and need to be verified.

the genuine identities may be asked to validate too many times, which is inconvenient.


does not affect the unlinkability of any pseudonyms since the tunnel brokers only see that traf.c is coming from our gateway servers.

each client effectively has a single private address assigned by its ISP, and many public IPv6 addresses assigned by our gateway servers.


Networks were expected to either be cliques of at most several dozen nodes or, if needed, composed of such cliques with multiple bridges between them.

basic network membership and acceptance of long-term keys were still assumed to be based on outside communication.


Additional policy enforcement mechanisms, such as group management and key distribution center, are required to handle situations and their changes.

the research challenge is how to integrate policy enforcement and key management to improve the trust establishment performance in a highly dynamic communication environment.


As can be seen in Figure 3(c), these categories have a much higher ratio of photos that contain other faces compared to the di.cult category.

while photos might not contain any faces, the content can assist the user in inferring the correct answer or excluding suggestions until left with a plausible one.


First, both Bluepill/Vitriol and SubVirt/SubXen are virtualizationbased rootkits that subvert third-party virtualizations.

they must carefully avoid detection by the virtualization.


As indicated earlier, the Core analysis represents a conservative bound where the number of pairing is restricted to (n-1) per x-on scenario.

a chip with n SMCs can produce 6*(n-1) unique response bits, assuming the delta entropy goes to zero for more than 6 enabled SMCs.


The easiest way to achieve this is to employ standard tools such as the widely used SSL/TLS suite [13, 14, 15].

we assume that the TAs support the means of establishing secure channels via SSL which the contributing patients can use.


A key insight of this analysis is that, the harvesting antenna cannot be reused by the NFC transceiver, due to the con.icting requirements of the Q-factors.

to support e.cient energy harvesting and reliable NFC communication at the same time, a dual antenna con.guration (one high Q-factor antenna and one low Q-factor antenna) must be adopted.


However, there are only a few functions in which people who handle unauthorized smart phones are punished.

malicious people do not hesitate to handle smart phones of other people without any risk.


With a second Feistel round, PSEP is a versatile padding scheme capable of achieving optimal bandwidth in all of our constructions, even when used for plain signature or encryption applications (i.e., it is also a universal padding [6]).

our suggested padding scheme is truly applicable for any TDP-based public-key usage.


While qa -pa 0 for all ratios of 0.1 = m = 1(seeFigures4, n m 5 and 7, 8), it also holds for all ratios but n =0.1, that qa - pa = 0.

setting qa - pa = 0 slightly decreases Ei and gives us a lower bound on Ei, and therefore also a lower bound on the agility of our scheme in the analysis at the end of the section.


Thus, the primary goal of secure communication is to provide authentication and/or encryption between neighbor sensor nodes.

the most important information that can bene.t key pre-distribution is the knowledge about what nodes are the neighbors of each sensor node.


We also consider Babylon, since users can purchase items without creating an account with Babylon.

by tampering with the purchaser s email in the browser, an attacker can have a software license purchased by a legitimate user, but delivered to the attacker s email address.


However, with only one non-linear equation, we are not able to solve for both variables Leff and Vth.

we must .nd a way to add additional variations to the leakage power model so that a system of equations can be obtained.


The analysis revealed that only 3% of the apps access user s location while running in the background.

location coarsening in the background has little effect on the functionality of most apps.


by Histograms of Role Entropy per JC 500 #(JCs) 400 300 200 100 0  Figure 5: Analysis of the job code distribution over inferred roles.


In general, its priority value is not designated.


In 2000, Hwang and Li [2] pointed out that Lamport s scheme suffers from the risk of a modified password table and the cost of protecting and maintaining the password table is large.

they 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.


V , the set of leafs in T that are also leafs in the ORAM tree.

the expectation of the usage of T is at most E[u(RL(Z)[s]; T )|a(s) = a] = E[#Yj .


As the PHS is part of the Constroid system image it is protected by the certi.cate of the manufacturer.

the PHS can only be updated or replaced if the new application was signed with the same key.


These restrictions hinder the applicability and popularity of ABE to secure cloud storage.

it is necessary to develop a more user-friendly security mechanism for data security in the cloud.


To realize the trusted path, they use a trusted mobile phone.

they use physical isolation to separate the browser from the authentication part.


A recent survey [15] found that one of the main factors that frustrates SPs is wasting time and that they need better planning and organization.

it is important for tools to facilitate the process of planning and prioritization.


It assumes that individual password characters are chosen randomly and independently from one another.

the metric does not account for user-biases towards English words, predictable character positioning, or relationships between adjacent characters.


They however take more time and are sometimes insu.cient because application user interfaces have complex requirements such as login credentials for Internet services.

we also need to intelligently drive the user interface to exercise code implementing interesting and dangerous functionality.


However, this secure element is locked and cannot be used for custom applications such as our immobilizer system.

we use a Giesecke & Devrient Mobile Security Card 1.0, which is a microSD smart card that allows installation of custom applications.


Considering discrete logs to the base g, we get the following equation: v v £=1 g=l that can be rewritten as: : A(0)-o- ~=1 £=1 As we argue below, the probability that the coefficient of w in (t) take the value 0 is negligible.

w.h.p, we can recover the value of w. To complete the argument, we now show that: Pr [~ + ~=~[B(ze)'ye] -B(0)=0] =Uq" Consider the matrix whose generic row is (A~0,..., A(~0), and distinguish the following two cases.


This may result in 119 perceptual distortions such as pre~echos.

an ad- ditional scale parameter a and gain function g(n) are intro-duced to refine the watermark in the temporal domain: v(n) = ~(n) + ,~g(n),,,(n), (2) where ¢x is the global scale parameter, g(n) a data dependent gain function with values between 0 and 1, and y(n) the watermarked audio.


Supersingular curves have extra endomorphisms in their endomorphism ring, and these endomorphisms map points de.ned over the ground .eld to points de.ned over an extension .eld.

given an endomorphism F, t(P, F(P )) .1, and we do not = have to worry about the points in the pairing being linearly independent.


The timings in Table 2 can serve as benchmark for the .eld arithmetic and show a di.erence by a factor of roughly 2.0 between our OPF library and the .eld-operations of TinyECC.

the .eld arithmetic contributes a factor of 2.0 (or 71.94%) to the overall performance gain of 2.78.


Query Qi with L(OPi) = C can write a data stream x only if L(x) = C.  Note that, for our example, a process executing at level [5, ., T ] can execute streams belonging to Company 5 in COI1 and all companies in COI3 and also streams derived from them.


In existing secret question based authentication systems, the correct answers need to be speci.ed by the user prior to the challenge phase.

intuitively, short-lived questions may require frequent manual updates from the users in order to install their correct answers.


However, the current state-of-the-art language, XACML, suffers from some design .aws and lacks important features, such as those that characterize the RBAC model.

we propose an access control language that combines the bene.ts of both XACML and RBAC while avoiding their drawbacks.


On the other hand, the detector was indeed active, because we were able to analyze benign PDFs7 as well as malicious PDFs taken from the Contagio repository [1].

we speculate that Wepawet was unable to analyze our attacks due to some parsing error caused by our deliberate PDF manipulation.


We draw an edge from one node to another, if the source nodes CFW has the target node in its list of allowed successors.

a CFW can be seen as a node of the CFG with its outgoing edges, as illustrated in Figure 1.


low, medium, and high, represented by +1, +2, and +3).

the result has to be mapped by determining the lower and upper bound of PPVi (PPViLB and PPViUB ).


The boot loader, kernel, initrd, and the entire file system as a loopback device are loaded from CDROM.

checking the each file in the CDROM at bootstrap time can reasonably assure the integrity of the entire system, and the attestation can be very simple.


From the view of an adversary, the tra.c in the network is as same as in the naive algorithm and the globally optimal algorithm.

the compromise probability of this heuristic greedy algorithm is still 1/n.


(Li+1) to auditor A, without revealing the information within Proof(Li+1).

along with the segment of the hash chain, the user U presents the unique key Ki, Enc[Ki, Proof(Li)], and Enc[Ki, Proof(Li+1)].


However, if the SP3 PTEs P bits are not cleared when SID changes, the other domain will access the old page, which can possibly contain decrypted image.

this SP3 PTE invalidation ensures the access permission of SP3 pages to be reevaluated.


At the end of the k rounds, A and B share a k-bit long secret key.

if a 60-bit long key is required, the protocol should contain 60 rounds, i.e.


We focus on 50 SNPs of chromosome 1 and assume one genomic-privacy constraint, including all the 50 SNPs for each family member.

we have a total of 11 privacy constraints, which represents more constraints than other generic experiments in the optimization literature that included up to 5 or 7 constraints [19].


Nonetheless,itis still possible for an adversary to launch parallel interception attack if all of the tasks assigned to a computing unit .nish before the end of the initialization process of the secure execution environment.

we need the last property, full coverage property, to achieve the full-occupation condition by ensuring that all available computing units .nish their tasks after the initialization process of the secure execution environment.


For example, the semantic representation level of location described using GPS coordinates (longitude, latitude) is smaller than using the standard notations IETF RFC 4119 (Country, A3, A6-STS, HNO-HNS), which results in di.erent algorithms to measure the location precision.

we can conclude that the representation format of context information directly in.uences the QoCI measurement algorithms.


This would result in a sudden spurt of timeout transitions being taken in the IP state machine.

the statistics on the frequency of timeout transitions from the PKT RCVD state can serve as a reliable indicator of the IPsweep attack.


It needs to build mechanisms for querying, learning and most importantly maintaining this user intelligence, without which it may not be able to deliver a personalized experience.

a lack of standard mechanisms to capture relationships between di.erent user identity data, forces a SP to digress from its core competence of providing a service, and start making sense of this additional user intelligence.


Thus, the adversary can simply determine the complete execution .ow of the cipher process by continuously performing the above very simple spy strategy, i.e., just executing spy branches and measuring their overall execution time.

the spy process will see the complete prediction/misprediction trace of the target branch, and is able to infer the secret key.


integrated into a .rewall), it reads the data .eld and validates it and forwards the SYN packet only if the signature is valid.

in both cases neither the routing protocol nor the application server need to be altered.


To sign a long message m, we first need to compute the hash of this message.

the first critical decision is for the output length of the message hash.


Total-CFI considers a module unloaded/modi.ed only if the code pages of the module are overwritten.

if an entry is created in the write cache of the TLB that also exists in the code cache of the TLB, a module is said to be unloaded.


Since y > Yo, x(y) is decreasing with respect to a for all y.

as seen in Section 4.3.2, the predatory rate should be as large as possible.


Furthermore, enabling an attacker to replicate 50% to 100% of known sequences likewise produces unacceptably high FNRs.

the attacker s knowledge has been restricted to that of 5% to 50% of known sequences.


D The two lemmas imply that, for any (F,P), the conditional expectation E[Xj |Fj(F,P)] is at most the product E/f(N) f(N)/|N| = E/|N|.Since |N|is necessarily k -j + 1, this implies E[Xj ] = E/(k -j +1).

the large items cost in expectation at most k k E[Xj] = E/(k-h+1) = EHk.


We currently set the interval to be one second; this is long enough to produce no measurable load, but shorter than the time to protect the laptop in the worst case.

it does not contribute substantially to the window in which an attacker can work.


Since array C appears in both R and V5, when loading V3 into SRF, it can guarantee a maximum overlapped size in the next step to leave C unreplaced.


During the implementation of Relation 1 in PI N O CC H IO, we observed that comparison operations (=, =) are much more expensive than addition and multiplication.

in the case of a unitweight graph, we replaced the second constraint of Relation 1 by an equivalent equality constraint with an additional input auv, i.e., S[v] - S[u] - avu = 0, where avu .


Moreover, an optimized antenna makes the maximum stealing distance much longer.

the result suggests that the EM display stealing by our setup can be applied to other touchscreen devices.


In our approach, the behavior of a policy model is attested rather than a software or hardware platform.

the attestation feature is not tied to a speci.c software or hardware platform, or to a particular remote attestation technique, or to an individual type of security policy.


While drand is random in all ROs and chips, the dsys component is a function of the RO s location on the chip and is the same for each chip.

in instances where |.dsys | >> |.drand|, each response r is biased towards one value on all chips.


It is clear that the point-wise in.mum of a family of functions satisfying requirement 1 will itself satisfy requirement 1, and similar for requirement 2.

there is a smallest function s * satisfying both requirements.


NORMS AND SOCIAL ORDER Even if one attempts to manage enterprise security as if it were a police/bureaucratic state, in practice, the cost of gaining a complete understanding of all the components and operations of a large system is likely to be prohibitive.

security tends to focus on those activities perceived to be critical, with an assumption that the other unregulated activities, known or unknown, are not signi.cant.


If a malicious program is installed on the platform, the CM would not recognize it as member of the ERM application domain.

communication between the malicious program and the ERM applications would fail.


It is unlikely that the user s position will change within a second, even Figure 5: The displayed prompts to set the global (left) and per-place (right) rules with speeds up to 100 mph.

lP-Guardian only communicates with the anonymization service once every 750ms.


Each default O/S install has a unique collection of open ports.

this information may also be used to fingerprint and identify a computer s operating system.


This number µ has to be stored and used throughout all the modular reductions.

to exchange for faster computation, Barrett reduction requires more ROM and RAM than the traditional divisionbased modular reduction.


This cost reduction is simply based on the observation that the auxiliary coordinate T1 of P1 is only used in the point addition, but not in the point doubling described by Equation (5).

the computation of T3 in Equation (5) can be omitted if a point doubling is followed by another point doubling.


For example, www.bestbuy.com redirects to www-ssl.bestbuy.com for user login.

pinning the WebApp to www.bestbuy.com will not allow the user to log in, because the authentication cookies will be stored in the phone s browser.


Tokens do not contain an identi.er for a speci.c patient record; in fact, the LSP implements a protocol where a request or query regarding a speci.c BSN and information category is forwarded (replicated) to all information systems that contain a patient record of the BSN and type that matches the query, and have the LSP collect the results before returning them back to the requestor.

a single token can theoretically be used to request all records of a given patient (BSN) and information class in a single operation.


Selecting a cost function that better .ts the needs of an organization is a completely separate subject of research.

due to the page limit, this problem is only partially addressed here.


Optionally, a ringtone may be rung after delivering a beverage.

a ringtone must be present in all products o.ering cappuccino; 5.


For example, a {read, write} sequence over a variable is not idempotent.

a {write, read, write} sequence is idempotent due to the initial protecting write.


The approach has polynomial time complexity and is practically ef.cient.

the presentation of the work indicates that some manual steps have to be used to properly handle scenarios where issues of tiling validity arise.


This service is not able to capture CPU usage with granularity at the level of microseconds, since it relies on software level times maintained by POSIX compliant kernels.

gVT recalculation in optimistic simulation platforms typically occurs according to periods on the order of tens of milliseconds, or even seconds, in order to keep the overhead of the GVT protocol low.


The only major difference between this mapping and the mapping above is that the remaining expression E is executed without waiting to receive the new PID fpid along p, since the evaluation of Edoes not depend on the PID fpid.

case studies have shown that in both cases the use of f res can be omitted with no effect on the translated system.


At the beginning, support technicians were part of the development department.

in 2007, few additional support technicians were employed and they were all moved to a newly formed knowledge management department.


[45] also aim to address this problem, but use taint-tracking analysis within a browser to check for sensitive data released via XSS attacks.

deDacota simply prevents any XSS exploits that could enable such leakage.


2 Our goal is to construct a smaller version of Havlak s forest by eliminating some loops in the forest using the above lemma.

rather than merge any two loops that satisfy the conditions of the above lemma we will only merge loops that share a common entry vertex, as this is easier and turns out to be suf.cient for our purpose.


x -x abs(x1|x1 = 0,x1 < 0) Hence, one can apply both the weakly needed and parallel narrowing strategies to RJ .

the narrowing relation computed by these strategies might not be complete for RJ w.r.t.


Since not all architects will have a similar background, we have little evidence that the architecture technique could be learned and effectively applied by other architects.

we did provide some indications that inexperienced architects bene.t from using the technique.


One way to express the data distribution among the threads is the declaration of smaller datasets using !$OMP THREADPRIVATE.

two main reasons make us reject this approach: 1) e.cient interthread communications require threads to read (or write) their neighbors datasets and 2) the way compilers handle threadprivate datasets may be ine.cient.


Example 2.2 (Introduction of hashes) Let us take the .rst implementation of an abstract Counter seen above.

if we have as an expression the following well-typed term: (fun x:Counter.t -> ()) (Counter.init) Then, if we write h for the hash of the module Counter, the compilation will lead to: (fun x:h.t -> ()) 0 this expression is not typable since h.t is an abstract type and its real implementation cannot be revealed outside the Counter module: we cannot prove that 0 of type int has type h.t as supertype.


This allows allocation of a budget for searching, with the budget being used to check the best candidates .rst.

we assume that we have a best guess m for the provenance mark, and for each i, con.dence ci in the ith bit of m. Con.dence ci may be derived from the suggestions of datapoints, for example, using the average of con.dences of suggestions used to compute the ith bit of m. other measures of con.dence are possible, such as using the entropy of the suggestions for the ith bit.


In shared-memory programs, CU s from different threads execute concurrently.

correct and incorrect program executions differ in whether CU s are serializable.


Such a sequence detector needs to check the call-stack for the possible occurence of each pattern at every pro.le event, thereby causing the regression passes to be signi.cantly slower than the corresponding pro.le passes (Table 1).

the techniques we proposed for the actual runtimedetection ofpatternsin applications(seeSubsection 3.3) are quite lightweight as they require the instrumentationof only thefunctionsand call-sitesthat occurina pattern.


The module invariant is valid in the initial environment E.  When checking the body of the module function, Finv is assumed initially and proven upon exit.

finv does not appear in s, meaning it is hidden from module clients.


Consequently, the efforts required for the selection of work.ow activities is reduced, and the process of Grid work.ow composition is simpli.ed.

the selection of abstract activities is still a challenging and time consuming process for domain scientists especially when there are hundreds or thousands of such abstract activities that are available for selection.


On one hand, making smarter decisions on the scratch/cache allocation may allow us to decide on which L1 con.guration is better.

considering other memory levels like texture caches into the optimization process may improve the overall compiler behavior.


This allows the use of dynamic properties for cost computations, e.g., concrete values of immediates.

the additional .exibility is traded for a small penalty in execution time.


The deliberate creation of intense discomfort in teams may appear to be contrary to positive psychology theory that posits the maximisation of .ow experiences [5].

it should be noted that these potentially negative experiences are applied in small bursts and are coupled with structured norming opportunities.


Fast path allows all inter-service traf.c to directly use DIPs, instead of using VIPs.

this negates the bene.ts of the VIP indirection.


FrontPage is clearly targeted at Class 1 Web sites, those that are primarily static and client-side intensive.

microsoft does make FrontPage applicable to Class 3 Web sites by providing the ability to develop sites with server-side database access.


In principle, two objects now have the same type if their primary TIB .elds match.

this requires an extra level of indirection as we have to index the TIBs to obtain the pointers.


Search [11] can help a developer identify similar bugs from the archived repository.

the developer still needs to follow the tedious process of going over each of the recommended bug and identify if the bug report contains any information of interest or not.


3.4 Discussion Even though centralized approaches lack of the known problems, like containing a single-point of failure and lacking scalability, they could be judged to be suitable for ALM.

some further problems occur: There is no central point in a peer-to-peer live streaming scenario, except the source of the stream, which should not be burdened with the role of a central coordinator in key management for all streaming members.


el =(.l x. eli )  5.3.5 Call Site Monitoring The processing rules have been given for all the demands.

we add here the description of the monitoring of call sites.


To help and assist them, different kinds of systems have been developed, for example, to detect and alert falls.

the acceptance of such systems requires on the user part the belief that the system uses the collected data properly and not cause any harm.


ma This works well, because in an expression like e1 mplus e2 the two expressions may take inputs from environment variables bound in ordinary ways.

we cannot in general factor an arrow type as a function from inputs, so an arrow combinator must route the inputs of the composite expression to each of the arguments.


So thereare n evaluations system-wide of f over the most recent estimate (approximation) of the state immediately following e. Globally for all np sensing events, there are n 2 p evaluations.

due to asynchronyin message transmissions and race conditions, the n evaluations may not see the same state.


Therefore recovery is fast: it takes only a few seconds to read this metadata from diskbefore the server is able to answer queries.

the master is somewhat hobbled for a period typically 30 to 60 seconds until it has fetched chunklocation information from all chunkservers.


This has the bene.t of allowing us to work with a reasonably simple language while at the same time supporting full Haskell.

gHC does change the program structure in ways one might not expect, which may complicate the reasoning later.


In order to ensure single access to the community, a community uses a common interface that acts as a proxy and selects other Web services in the community.

web services adopt di.erent semantics for representing the data they receive and send.


Finally, the bookmarking collector presented here is a stopthe-world garbage collector, where all mutator work stops for garbage collection.

server-based JVMs typically collect the heap concurrently while running the application.


For instance, the operations "return- BookEarly()" and "returnBookBeforeDeadline()" are unnecessary because the system cannot execute these operations.

since we focus on supporting modelers rather than completing the diagram, the modelers can add and delete elements to create a completed class diagram.


This can be achieved with relatively small implementation e.orts due to the relatively small size of collaborative functionalities compared with conventional single-user functionalities.

this approach is not applicable to many widelyused commercial o.-the-shelf single-user applications based on proprietary source code.


Our de.nition of context is open and pragmatic, in that it treats any computationally accessible information as potential parameters for in.uencing the behavior of a program.

the widely cited de.nition for context of Dey at al.


It is wishful thinking that one can create a small set of universal interactive units to cover the entire spectrum of possible objects an assembly can morph into.

covering this entire spectrum is of a very high dimensionality and  poses engineering challenges; even Lego® constantly creates new units to provide richer assemblies.


This way, the client tier does not have to halt its execution while waiting for the server to communicate an answer.

asynchronous communication brings about the problem of ensuring that the result of a call has been received at the moment it is required.


This led to a mean number of editions and compilations higher than in the UDC session.

as with Stencil, some participants could get to parallelize this code quite quickly.


So the parentofa feature thatis visiblein the con.guratormustbe visible.

if the parent is not selected, a feature can stillbe selected automatically, unlike in other known feature modeling languages.


Linux, probably the most-con.gurable piece of software ever, employs more than 10,000 preprocessor variables for this purpose.

this de-facto variability tends to be hidden in the code ; which on the long term leads to variability defects, such as dead code or inconsistencies with respect to the intended (modeled) variability of the software.


Standardization seems to be a very efficient approach to achieve cloud portability.

for reasons not necessarily related to technology, it is very difficult for all cloud platforms to eventually agree on a common set of standards.


An aspects typically selects its join points according to their structural properties, like their name.

a CoCons selects its constrained elements (=join points) according to their context properties.


Our Merge operator can handle these features as long as they are non-shared.

it currently does not provide explicit support for these features.


Based on the predicted results they aim to select a minimal number of mobile users, expecting to cover a certain percentage of the target area in the next timeslot.

both [37, 38] focus on the mobility model and coverage probability prediction.


The algorithm presented in [27] can handle strati.ed negation by only exploiting call dependency to re-evaluate calls to update tables.

the call graph based algorithm does not present great incremental ef.ciency[27].


The mechanisms are simple and convenient.

it is not always straightforward for the users to select the right scaling indicators and thresholds, especially when the application models are complex, and the resource utilization indicators are limited and very low-level.


Similarly, writes to .elds of this in the atomic version of constructors need not be logged since the new object will be unreachable (garbage) after rollback.

to create atomic and non-atomic versions of each constructor we cannot follow our instance-method approach of giving the atomic version a different name.


They are mostly useful when users visit web sites and download free digital products.

in a superdistribution system, the consumer has to submit to the key server his/her identi.cation or authentication information (e.g.


One possible requirement in this example context is to produce a wooden container with removable lid to hold pens and pencils, while another may be to transform the timber into a big pile of wood shavings for combustion.

requirements in terms of the machine in this example could be a series of detailed steps that tell you how to hand-saw and plane the constituent wood pieces, and how to use nails and glue to best hold the box together.


As a rule, an AbstractOnePassKeyedTask requires its input to be sorted on its input datasets keys.

once in puts have been sorted, a parent task of type AbstractOnePassKeyedTask does not need to have its output re-sorted before feeding its out put to its children provided that it has not altered the alignment of the keys.


Indeed, Martin Fowler s book [11] contains quite detailed recipes.

the big advantage of having a precise, formal description such as the parameter de.nitions above is that they provide a sound basis for rigorous reasoning.


Nowadays, user altruism is common since most users are connected to the Internet using static machines via ISPs with a .at pricing model, and hence sending a packet does not incur a cost on its sender.


From Figure 8 it is clear that the dependable trust models (TrustGuard-adaptive in .gure) performs better in terms of cost to be paid by the malicious nodes than the non-adaptive trust model (recall the cost model in Section 3.1).

this does not entirely maximize the cost paid by malicious nodes.


This iterative process might be viewed as an example of the Shewhart or Deming plan/do/check/act cycle, with the simulation model providing the plan for a specific experiment (the do ), then a checking of the experimental results followed by action both to improve the simulation model and, if justified, to improve the real-world situation being studied.

in order to maximise the benefit from this approach we strongly believe that appropriate weights be given to both simulation and experimental aspects, and not to weigh one unduly at the expense of the other.


.xed systems have reached su.cient maturity, in wireless and especially in mobile ad hoc environments, where no backbone network is assumed, many issues and questions are still open because of the recent establishment of this research area and its intrinsic complexity.

for the same reasons, the design of systems for mobile scenarios is, at the same time, challenging and stimulating, since you have to cope with an extreme setting characterised by high degrees of changeability and unpredictability Developing applications for mobile computing is extremely di.cult and challenging, since designers have to deal with many aspects such as unpredictable disconnections and topology variability.


Most security applications are already designed to handle public keys (e.g., X.509 certi.cates), while other applications can leverage public keys to setup shared keys or passwords within the group.

for ease of use, some applications may want to share additional information (e.g., email or IP addresses to simplify contacting other members or sharing data within the group).


Hadoop jobs exhibit a greater difference of ... between the two distributions showing greater sensitivity to loss of locality (Figure ..b).

thedifferenceinadvantage betweenthetwodistributions are negligible at small replication budgets.


operating system or hypervisor) to provide intelligent co-scheduling decisions.

note that smarter replacement policies do not eliminate the need for intelligent scheduling decisions.


We did not expect our forward-search to be a serious contender.

our results show that, unlike UCPOP and GraphPlan, forward-search s performance improves rather than degrades when faced with the more highly-constrained classes.


(6) can be solved in O(n) time through dynamic programming [5].

the dynamic programming approach requires the samples to be sorted, which in itself requires O(n log(n)) operations.


A program can generally have multiple aspects with dependent advice.

since the semantics of dependent advice in one aspect is de.ned independently from other aspects, in the following we assume one .xed aspect A, without loss of generality.


Introduction Model-based design represents the future of systems design, due to the ability of models to scale to complex systems, and the practice to synthesize large portions of a codebase.

for someone just learning to leverage model-based approaches for their own domain problems, there is a pivotal question that must be answered early in any system s design: Do I design a domain-speci.c modeling language, or take advantage of UML pro.les?


Their system requires modi.cations to the applications involved, and provides a centralized server process which controls thread allocation.

their method for maximizing accumulated speedup depends on signi.cant of.ine analysis of the applications for determining their speedup behaviors, parallel runtime components, and management/ communication overheads.


AcademicMindTrek '14, November 04 - 07 2014, Tampere, Finland Copyright 2014 ACM 978-1-4503-3006-0/14/11 $15.00 http://dx.doi.org/10.1145/2676467.2676495 drink together in the street or spring cleaning , during which inhabitants were asked to clean their street together.

there were next to no attempts to give such activities a digital component, which is surprising, as a substantial part of people s lives these days is technology-mediated.


This approach discovers fan-owner interactions from the owner side and provides timing information.

it is ine.cient and slow it requires a separate queryfor individual photos, even though a majority of the discovered photos do not have any fans.


Testing is a widely used approach for identifying bugs and for providing concrete inputs and traces that developers use for .xing bugs.

manual testing requires extensive human e.ort, which comes at signi.cant cost.


This gave us some control over the students environment, as we could collect data on the remote machine.

we could not collect data if the students worked on a local machine (e.g., serial program development, editing source code, etc.).


JTS is a more viable option: since JTS allows the Java grammar to be extended and reinterpreted, it is certainly powerful enough to express Multi-Java.

one would have to implement Java s standard type checking rules along with MultiJava s rules, since JTS relies on javacfor its type checking.


One solution would be to recognize all elements at .rst and later analyze the AST to discover wrong nesting.

this leads to another problem: If, for example, the enclosing link is reinterpreted as plain text after discovering an internal link inside its title, other parts of the a.ected Wikitext may need reinterpretation as well: [[target| * item 1 * item 2 [[other link]] ]]  Lists (in bold) are not recognized inside a link title.


, all replies of groups using VO LT RO N -LI B point, in a way or the other, to concurrency handling.

no one makes a concrete proposal about how to improve this aspect, indicating that the issue might not be too trivial.


These attributes are obtained from dynamic QoS measurement as describ ed in section 2.

the user task description is given in the form of an abstract OWL-S process with QoS requirements.


An attacker location mechanism is described too.

to make this procedure possible, visited hosts must store a certain amount of information about all the visiting agents.


OpenCL Kernel Shaping Glasswing is responsible for invoking OpenCL kernels and managing synchronization.

it delegates the responsibility of shaping the kernel invocations to the application.


One can ex- trapolate the pgpdec ratios for pgpenc as a good approximation.

a Raw machine has an architectural configuration differ- ent than the traditional VLIW design used in this paper.


Excess space saved for cooperative swap in the form of page repositories has very few constraints on placement: there is no requirement that swap pages are stored on the same physical machine, nor do the page repositories need many other resources, like CPU.

excess space saved for migration has more constraints: there must be enough resources to support a full VM co-located on a single physical machine, including memory and CPU.


Ranking is critical in complex queries with large lineages, and in the case of error tracing it serves as a comparison metric of the likelihood of the various error sources.

determining causes and responsibility was shown to be NP-hard in general [14].


= n in order to get a depth and query time of O(£).


The difference in throughputs between the concurrent collector and the single threaded generational mark-sweep (GenMS) can be as high as 40%.

comparing the degradation rates of the three GC techniques, dCM S , dP arGC , and dgenM S , shows that both CMS and ParGC did t exhibit signi.cant different on degradation rates.


Subsequently, it has been shown that this bound also holds if all messages arrive instantaneously, but an adversary can determine when synchronization messages may be sent [16].

fan and Lynch treated the maximum hardware clock drift e as a constant; taking it into account as a parameter reveals that b .O((log D)/e).


However, speech synthesis generally generates inaccurate pronunciation.

recorded words may be too slow in reaching the users of the system over the internet, which will have disastrous effects on the usability of the system [5].


The content of the individual sections is then extracted and summarized.

this proposal has yet to be implemented.


An intermediate solution, called Network Embedded FEC [29], is possible by placing FEC operations only in a subset of the nodes within the overlay network.

such approach still presents some drawbacks and open issues that need to be carefully investigated and resolved.


This program then appears to be amenable to Section 3 s probing and tracing.

consider a physics simulation of one thousand frames (events), where traces are overwhelming with lots of poorly organized or rarely changing trace entries that are re-printed on every frame.


Abstract component type is abstract component type which just describes the required interfaces of this component in this software system.

all of these Adls include concrete component type descriptions, which are suitable for traditional development.


Here, it is interesting the work has been done in the area of formalization of federation cloud speci.cations, that is: Federate Security, Federate Resources, Monitoring Resources and De.ne Scalability Rule.

xI-FI Federation maintains a static approach for making up the early phases of federation.


the high overall productivity in case two results at least partially from reused code lines (i.e., 550 physical and 300 logical lines), which have been included in the code line counts and thus affect the productivity calculations.

the productivity metrics do enable to analyze how the productivity of pair and solo programming evolved in the successive iterations of the case projects.


Strathcona Example Recommendation Tool Reid Holmes & Robert J. Walker Department of Computer Science University of Calgary 2500 University Dr. NW Calgary AB Canada T2N 1N4 rtholmes, rwalker@cpsc.ucalgary.ca Gail C. Murphy Department of Computer Science University of British Columbia 201-2366 Main Mall Vancouver BC Canada V6T 1Z4  murphy@cs.ubc.ca ABSTRACT Using the application programming interfaces (API) of large software systems requires developers to understand details about the interfaces that are often not explicitly de.ned.

documentation about the API is often incomplete or out of date.


Snippets can be implemented using imperative or functional programming languages.

snippets in a harmony-oriented program do not own anyvariables(data).Anyvariable declared inside a snippet is created and instantiated inside the .eld (or .elds)ata locationnexttothe snippet during runtime.Inaddition, every access to a variable inside a snippet results in an accesstotherelevantvariableinsidethe .eld.Apartfrom indirectly producing data in the .eld by declaring and modifying variables, a snippet can scan its immediate vicinity in the .eld for additional variables and announce its desire to consume speci.c data.


Frequent pattern mining is a data mining technique used to extract frequently occurring combinations of items from a database [5][6][7].

it does not consider the order of occurrence of the items.


Our solution was to create just one non-functional defect category in our new categorization scheme.

for some of the analysis, we had to exclude this category because it dominated the combined dataset.


CMS 1 is similar to SS in that it is non-generational and is divided into two sections.

cMS is a hybrid approach in which the .rst section is managed via bump-pointer allocation and copy collection and the second section is managed via Mark-sweep collection (and uses free-list allocation as described above).


This intuitive observation suggests that traditional scheduling approaches such as round-robin or proportional assignment s will not fare well, which is what we observe and discuss in Section 4.

an exhaustive search of all the possible assignments will .nd the best schedule, but the computational complexity is prohibitively high.


They can also be used to determine the change impact on other features.

propagating a bunch of feature changes requires computing the di.erences between two interfaces.


Li and Malik [13] follow a similar approach with ILP.

they use the CFG as the basis to build the ILP problem.


Control of DVFS can be done in the operating system (OS) kernel or .rmware (e.g., BIOS), and it works well for stable workloads for which the need for adjustments arises infrequently [13, 20, 31].

there are important classes of applications that have bursty workloads and computing infrastructures that should run at high utilization levels.


Nevertheless BPELUnit does not focus on test cases derivation.

there were several di.erent e.orts to obtain veri.cation of compositions.


In attack resistance, the simulation will stop as soon as an attack pattern is matched.

in fault propagation, as the real fault is still propagating in the physical layer, it is possible that when a propagated fault is predicted in the simulation, the fault has already happened in the real system and is of no use for SCADA system to apply preventive actions.


For example, the di.erent instances of a container structure that are used by di.erent threads to store di.erent objects cannot be distinguished, a context insensitive analysis cannot detect that thread local objects stored into a thread local container are not accessible by another thread that uses a di.erent thread local container instance.

context sensitive analysis keeps too much information.


Both perform experiments and apply statistical methods.

in contrast to the stochasticexperimental approach, the experimenter cannot in.uence the data used within the experiment the benchmark is typically an external factor.


That is, after the execution of an arraylength instruction, we introduce a new symbolic value, vk,to the frame state to represent the length of this array if the length of this array is unknown before the execution of this instruction.

if the reference to this array is not stored in any local variable, there is no need to create a new abstract value.


For example, in energy-rich environments such as deserts, users can set a smaller Ttarget to consume energy aggressively.

inenergy-poorand unpredictableenvironments, alarge Ttarget isdesired to ensure the aliveness of sensor nodes.


Operations de.ned by class instances are considered open the programmer can add instances for new types without modifying existing code.

the operations must be extended with specialized code for each new type, and it may be tedious or even impossible to add extensions that apply to a large universe of new types.


Hence, in theory a distributed system is not necessarily a concurrent one.

even in the extreme case where both communicating devices run a single threaded program, their autonomy implies that the resulting task is a concurrent one.


Towards the high expressiveness of UML constructs, we formalize their semantics in terms of a logic belonging to Description logics.

in our opinion, Description logics s constructors are not suf.cient to express contextual knowledge, we propose a reference metamodel that offers contextual primitives.


On the other hand, if the instruction references memory, we can calculate the address using the register values being maintained.

if the status of any of the registers required for the address calculation is EXPIRED, the correct value has to be read from DEPM before address calculation can proceed.


Many textual differencing tools share the approach of diff [11] and related tools, determining a set of additions and deletions to change file A into file B [10], [15].

extensions to this have been made to support binary and, more recently, XML file differencing, such as the IBM and Stylus Studio XML Diff/Merge tools [12], [19].


On one hand, it is usually too expensive to implement all the requirements for this software company.

every customer may request a fraction of those candidate requirements and provides a potential commercial profit for the software company.


Result Presentation: In this paper, we conclude the agile solutions for each embedded software development issue.

the issues are not simply independent with each other in reality; as a consequence, there is a mutual influence between the agile solutions for each problem in an actual project with numerous issues to address.


This type of concurrent initiation leads to DC tree formation for EM in the network.

the message complexity would be more than nlog2n messages as we do not assume formation of binary-DC tree and we have allowed concurrent initiation too.


In actuality, there are numerous ways to estimate the operational reliability taking into account runs which are partially successful or situations where faults are removed and the system operations are continued.

in this experiment there was no requirement for demonstrating improvement in reliability (reliability growth) by the developers as a function of software evolution (calendar time).


This technique has been shown to .nd the optimal fusion schedule for small benchmark programs through iterative search.

we observed that the iterative compilation framework fails to build the search space for even moderately sized programs because the search space grows exponentially with the size of the program.


When creating a new (zero-initialized) variable V of type t,new byte locations initialized to the value (unsigned char, 0, 0) are added to B.

deleting a variable V from a memory state M is more complex.


C. Computing Page Lifetimes with Reduced Overheads The proposed method of hot/non-hot separation requires checking page-level lifetime information.

storing such all pages lifetime information requires a large amount of RAM space.


Similarly to existing frameworks, the analyses that can be built on top of our framework include pro.ling and tracing of the kernel and user-space applications, interactive debugging, or even extension of system features.

di.erently from existing frameworks, ours is fully dynamic, transparent, loosely dependent on the operating system, and fault-tolerant with respect to possible defects in the analysis code.


According to Figure 3, survey respondents concurred that having too many reassignments (> 30) is detrimental to the chances of a bug being .xed.

they also thought that even having a few reassignments (1 5) would be detrimental, which is contradictory with our data.


However, porting our approach to a new type of middleware requires new stub generators.

porting to a new implementation (e.g., another ORB) is much easier.


The .rst strategy is sound, in the sense that it doesn t introduce a potentially wrong construct.

it potentially introduces many unknown parts of the code, losing useful parts of the program.


This extension could seem to be of little signi.cance.

the spectrum of computational kernels that can be detected by the compiler is extended considerably.


If the server has another send transition from its new state, then it can send another message before client receives the .rst message.

the client will not be able to send a message before it receives all the messages sent by the server.


MPICH-GQ: Quality-of-Service for Message Passing Programs Alain Roy * Ian Foster * William Gropp Nicholas Karonis Volker Sander § Brian Toonen Abstract Parallel programmers typically assume that all resources required for a program s execution are dedicated to that purpose.

in local and wide area networks, contention for shared networks, CPUs, and I/O systems can result in signi.cant variations in availability, with consequent adverse effects on overall performance.


Many studies have been proposed to improve the video quality under different considerations.

little work has been done on transmitting SVC-encoded video based on P2P mesh topology.


This makes it possible to map the C declaration: struct T_Data { char *name; union { float f1; int f2; }; }; ...into the following Ada 2005 type: type T_Data (Discr : Boolean) is Name : Interfaces.C.Strings.Char_Ptr; case Discr is when False => F1 : Float; when True => F2 : Integer; end case; end record; pragma Unchecked_Union (T_Data); It is clear that the use of such types can lead to erroneous execution, because discriminant checks cannot in general be applied.

in order to preserve as much type safety as possible, AI-216 introduces the notion of inferrable discriminant: the discriminant of an object may be inferred from its declaration, or from some default initialization, even if not present in the run-time representation of the object, and the inferred value can be used to verify the legality of some operations on such types, thus providing some additional type safety that is completely absent from the C model.


The potential for legitimate peripheral participation [16] is high in this kind of environment, supported by an improved awareness (over-hearing and over-seeing) of the activities of others [4].

the envisioned potential for increased learning was not realized in the companies studied, and the authors found patterns of conformity and anonymity rather than cooperation and creativity.


Canonsketch applies the WISDOM approach to UI patterns, easily expressing containment relationship, while the Canonical representation is much closer to the concrete representation of the identi.ed pattern.

support for contextaware and multi-device user interfaces using the Canonical notation is not obvious and is therefore not being considered by Canonsketch.


System Service Architecture Architectural Description Languages (ADLs) [10] have been shown to be effective in modeling the crucial characteristics of a software system that determine its ultimate capabilities, properties, and qualities.

a traditional shortcoming of ADLs is that each is specialized to a particular type of concern (e.g., structural vs. behavioral, dynamic vs. static, computation vs. interaction).


In the negative side, expert function point counting requires considerable training, such as required by the IFPUG certification, which would not fit in our course time budget.

quite good approximate counts may be done by non-specialists, following predefined model mapping rules.


This matches our estimation because this component is complex and the developers tried to maintain commonality.

we can notice that the type 2 clone coverage is around 35% for this component.


He also claims to be doing as much exercise as he can fit in with his busy life.

nothing seems to be able to stop him gaining weight.


The results indicated that such a tool could be very useful to someone who had a clear idea of what a Docu- ment Type Definition was, and had a strong idea about how they wished to order their documents.

results confirmed that those with a fuzzy idea about what they were creating would still be unable to create an accurate DTD.


The synchronous model has the minimum veri.cation complexity.

it cannot effectively handle PAEs, because they are naturally asynchronous and require timely reaction.


Each local view of community change re.ects a community membership change.

expiration of membership, membership refresh, or change of roles within a community is not yet completely managed.


DAOP-ADL defines a new XML element -a set of aspect evaluation rules - where the composition is defined.

we argue that existing SA abstractions are enough to model the composition.


Most other host languages for internal DSLs are dynamic languages and therefore do not provide static validation for DSL code.

there are exceptions to the rule, such as typed Scheme [32] and typed Prolog [26], which both imple ment custom validation through their respective language s macro expansion mechanisms.


CONCLUSIONS The digital fountain approach provides a powerful abstraction for loss-resilient bulk data distribution in which packet transmissions act like drops of water: any suf.cient combination of unique erasure-coded packets suf.ces to recover the original data in its entirety.

for on-demand media streaming, a digital straw abstraction is preferable in which the original data can be consumed progressively even as further transmissions arrive for later consumption.


Those prevent them from exploiting parallelism beyond a single wavefront.

after two wavefront steps, we could start the following wavefront.


Like polymorphic embedding of DSLs [16], Polymorphic Identi.ers allow a single syntax to be used with multiple, pluggable semantic interpretations permitting composition of functionality [6].

polymorphic Identi.ers are applicable to general purpose programming languages, not just DSLs, while at the same time restricting their focus to the identi.ers used.


Unfortunately, such a good management is neither intuitive nor easy to most programmers.

without an effective use of it, long memory access latency will be a critical limiting factor to overall applications [13, 20].


PEER-TO-PEER NETWORKING The networking layer is based on the notion of network overlay introduced in JXTA [8].

jXTA s rigid architecture, text based messaging and lack of QoS support make it inadequate to be considered as starting point for an implementation.


Since using the dynamic loading and re.ection APIs incurs a relatively high constant cost (§7.1), the query object may be cached between invocations.

by integrating Steno with DryadLINQ, this cost can be eliminated by performing Steno code generation in the initial DryadLINQ code generation process (§6), and generating static code that sets the captured variables.


Hedin and Sabelfeld [11] develop a dynamic type system that enforces termination insensitive noninterference.

note that a monitor that immediately stops any program will also enforce this.


1 and 2 is that the mapping from aspect abstractions to base classes by means of the declare parents construct works only when each aspect abstraction has a corresponding base class to which it is mapped directly.


Sucha resultis worrisomebecause mosttheoreticians andpractitionersassumeasequentially consistentsemantics.Indeed, some researchers believe that compilers should perform only those optimisations that do not break the sequentially consistent semantics (see §7 for more details).

designers of common languages and hardware do permit and implement aggressive optimisations that can exhibit surprising behaviours for multi-threaded programs, but they provide mechanisms for recovering a sequentially consistent semantics.On multi-processors,programmers can constrain optimisations using memoryfenceinstructions, which often have intricate semantics [3, 11, 20] and high run-time costs, usuallyin the order of tens tohundreds of cycles.


One could consider de.ning the set of captured events implicitly as all events matched by symbols that occur in the regular expression (as opposed to all symbols de.ned in the tracematch).

with this de.nition, it would notbepossible to explicitly exclude certain events from the trace.


We believe the pattern should be concrete enough to provide clear guidelines to how the software developer should design a software using the pattern.

the design pattern should be generic enough not to be tied to a single design.


In theory, the more benign apps that the database collects, the more benign behaviors it covers.

in practice, it is extremely dif.cult to retrieve benign apps exhaustively.


From a design point of view, optimization of the logical ordering of a single-threaded software system (software design), can be done independently of the design of the physical system (processor design) upon which it will ultimately execute.

optimization of concurrent software executing on concurrent hardware requires the software design to be considered with respect to its underlying architecture.


According to Kwon (Kwon et al., 2006), the methods based on the Voronoi graphs are robust for several environments and they can be extended to greater dimension spaces.

the maps generated by these methods can create some nodes and lines of trajectory that are not necessaries for the navigation.


In the worst case, a wait() at the start of sum_head2 () and a grant() at the end of sum_head1 () enforces sequential order.

by reasoning about the structure of the manipulated list using the safety proof given in Fig.


Serializing the running state of a Windows process would require the careful cooperation of each of these components, and significant changes to the OS.

with Drawbridge process isolation, a process s transient state is either confined to pages in its address space or can be reconstructed from data maintained within its address space.


Note that missing these races is a limitation of our prototype, not a fundamental limitation of our IFR-based approach.

in the real application benchmarks we used, IFRit s coverage is nearly identical to ThreadSanitizer s coverage.


Symmetric dispatch is seen as more intuitive and less error-prone, since possible ambiguities are reported, rather than being silently resolved in potentially unexpected ways by the runtime system [3].

the high interaction level that is characteristic of ambient computing makes it very dif.cult if not impossible to foresee the ambiguities that could happen in practise, since methods can be exchanged in unanticipated ways between devices.


represents a barrier, often insolvable, for the adoption of the product lines development approach in many organizations.

and this is a more important aspect, the variants in UML models can be distributed among several points.


Researchers have created point designs [4] and infrastructures [6, 7, 10] for divisible interfaces.

the questions of whether users are really interested in dividing interfaces, how they might want to divide them, and why, remain largely unanswered.


Outsourcing in emerging countries reduces costs but it also imply that applications are often evolved by non native English speakers.

software manuals, design documents, requirements are likely, if they exist, to be written in English.


FRP has been applied in problem domains including robotics, animation, games, web applications and GUIs.

the expressivity and apparently simple semantics of the classic FRP model come at a price.


e.cientes de distribuic¸ao de conte ´ access, have been proposed and evaluated, indicating signi.cant server bandwidth savings even under highly interactive scenarios.

considerando acesso seq ¨uencial por parte dos usu´arios, ou seja, one of the most promissing class of optimizations may o acesso completo do in´icio ao .m da m´idia sem interrupc ¸oes, send extra streams through the network during inactive client pe-dois protocolos de distribuic ¸ao sob demanda de m´idia cont´inua riods.


The .rst approach demonstrates the advantage of verifying real-time temporal properties in C program using the microprocessor clock as a timing reference.

we had an overhead of simulating the microprocessor model.


We have seen that converting Multirec to make use of better kinds brings considerable changes to the library.

the changes are mostly mechanical, cause no loss of functionality, and result in a properly kinded library.


One node u is placed at the center of two concentric circles of radii 2/3 and 1; a second node v is placed at the intersection of the outer circle with a vertical line f passing through u; and the remaining n -2 nodes are uniformly spaced along the arcs delimited by a central angle 2p -2arccos(1/3), symmetric with respect to f and opposite from v. This ensures that, for any t =1.66, the only path from u to v of length at most t ·|uv|is {u, v}, so this edge will be added to EL.Since {u, v}has highest interference in the graph, all edges of equal or lower interference (that is, all O(n 2)edges of G) will be added to L (conform Step 2.2 of the Lise algorithm).

there exists a 1.65-spanner of optimal interference with only a linear number of edges and O(1) degree (Figure 3b).


A trivial approach might be to let old continuations expire once a certain time or memory threshold has been reached.

any such arbitrary technical limit would ignore the structure and semantics of the application s dialog .ow.


E.g., inlining add() in Figure 2(c) reveals the fact that def(b) = string( ), which justi.es the application of the rule R3.

too early inlining may lead to the loss of rewriting opportunities.


make a thorough study on several efficient hash lookup implementations [10], including Indirect Branch Translation Cache (IBTC) [26], and SIEVE [27].

even a carefully handcoded hash lookup routine like IBTC takes approximately 17 instructions [10].


hiCUDA: A High-level Directive-based Language for GPU Programming Tianyi David Han The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto Toronto, Ontario, Canada M5S 3G4 han@eecg.toronto.edu ABSTRACT The Compute Uni.ed Device Architecture (CUDA) has become a de facto standard for programming NVIDIA GPUs.

cUDA places on the programmer the burden of packaging GPU code in separate functions, of explicitly managing data transfer between the host memory and various components of the GPU memory, and of manually optimizing the utilization of the GPU memory.


6.2.4 Specializations and Templates In order to derive a complete code selector, each operation of the IR has to be implemented by at least one rule.

in general the instruction set will not directly match all the required operations in the IR.


Model Scalability Using a Model Recording and Inference Engine Yu Sun Department of Computer and Information Sciences University of Alabama at Birmingham Birmingham, AL 35294 yusun@cis.uab.edu Abstract Model scalability is traditionally supported by manual editingor writing model transformation rules.

this process presents challenges to those who are unfamiliar with a model transformation language or metamodel definitions.


INTRODUCTION The supportfor variationpoints enablesproductcustomization from a set of reusable assets [25].

variability management, due to its inherent crosscutting nature, is 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 madeordistributedforpro.t or commercial advantage and that copies bearthisnoticeand thefull citation onthe .rstpage.Tocopy otherwise,to republish, topost on servers or to redistribute tolists, requiresprior speci.c permissionand/or afee.


We can use their AOP extension with dynamic weaving instead of AspectScript to extend TAE-JS to support declarative enhancement of dynamically modi.ed code.

in PHP, transformation have been applied as a preprocessing step [25].


After non-dominated sorting, all acceptable front members and the last front Fl that could not be completely accepted are saved in a set St. Members in St/Fl are selected right away for the next generation.

the remaining members are selected from Fl such that a desired diversity is maintained in the population.


This scheme is faster because re-scheduling is performed only once.

it over-spills (that is, it introduces more spill code than it is really requiered) so memory traf.c increases signi.cantly.


But the developer working on the real Address-Book implementation hasn t .nished it yet.

following traditional formal methods, she has written a speci.cation for it .rst (Listing 3).


The results of building, testing and releasing were presented to the whole team through a Web-based dashboard.

users started to learn from the dashboard which version of the system can be used to choose a stable version of higher quality or to choose a development version of more functionality.


For this reason DS has in general the best performance with respect to communication.

sCL which focuses mainly on balancing the processing load shows the worst performance with respect to communication.


In addition, our approach provides for more exotic forms of user-de.ned binding, including pattern-matching binding forms.

name-free or higherorder abstract syntax techniques provide no special assistance for this kind of binding.


It is wellknown that the tests we perform are undecidable in the general case.

we have proved [10] that our method always terminates if there is a finite example or if the tested property does not hold.


These successive transformations require processors at various abstraction levels, which can lead to a high cost development environment.

the approach allows for having target document in different languages, simply by adapting the step-by-step processors.


2.1 Product or Service According to many successful case studies at embedded systems, product line community seems to focus on productivity for multiple products within short period time.

our domain problem primarily comes from the time dimension as shown in Figure 3.


Therefore, on one hand, multiprocessor embedded systems seem to be capable to meet the demand of processing power and flexibility of complex applications.

such systems are very complex to design and optimize, so that the design methodology plays a major role in determining the success of the products.


In version 10.7 the user interface had a navigation sidebar permanently visible on the left side of the screen.

version 11 removed the navigation, and the user interface became modal with different available actions depending on the type of content being viewed.


Next,we present a similar de.nition for the alternate semantics by a LOOM.

the claim we made above that a LOOM determines an alternate semantics is not completely accurate.


The same is AB|B AB+C|B true in the resulting states sand s .

in 2 2 AB|B AB+C|B , .m.AB+C|B the following round in states sand s 3 1 cannot match .m.AB|B s move of executing transition B{t}.


It .lters the package explorer view with the context of a task, reducing the amount of displayed information.

all of these approaches take only one aspect of information as the base and overlay other aspects on top of it.


We refer to this procedure as token update.

availability of tokens is not the only requirement for serving a request.


However, an overly general DSL tends to be ambiguous and type unsafe.

a specialized DSL can avoid ambiguity and type unsafe but specialization leads to lacking extensibility and versatility.


This did not appear to be the case from looking at code being analyzed as non-trivial expressions were visible like method calls and binary operations in method argument positions.

the decompiled code looked different across projects (speci.cally, some projects had local variables with names like local0 while others had actual names), so there may be some compiler-dependence involved.


Hence, a solution to the relative containment problem based on comparing the datalog programs created for the two queries will not work, since containment of datalog programs is undecidable in general [14].

we show that relative containment is decidable in this case.


Our technique is based on dynamic control dependence detection.

as our goal is to index program execution, which has a different set of applications and higher requirement on runtime overhead, we focus more on de.ning the concepts of execution indexing and optimizing the algorithms.


Although iDTV represents an evolving technology and has yet to gather a critical mass of users, several hardware [17, 21] and software [11, 13] products are already available.

there still are discussions about standardization of devices, operating systems, execution environments, languages, services and APIs.


ricardo Bianchini Rutgers University ricardob@cs.rutgers.edu Large Internet companies (e.g., Google and Microsoft) have signi.cantly improved the energy ef.ciencyof their multi-megawatt datacenters.the majorityofthe energy consumedbydatacenters is actually due to countless small and medium-sized datacenters [33], whichare much lessef.cient.


University of Minnesota staats@cs.umn.edu ABSTRACT The effectiveness of the software testing process is determined by artifacts usedin testing,including theprogram, the set of tests, and the test oracle.

in evaluating software testing techniques, including automated software testing techniques, the in.uence of these testing artifacts is often overlooked.


In their work, the cost of finding cy- cles was non-trivial and so completeness of cycle detection was sacrificed in order to contain its cost.

cy- cle detection is essentially free in our setting during graph teachability computations.


In contrast, if the length .eld reported alonger value,thepacketpayload would stillbe correctbut withgarbage bytes appendedfor the extralength.

in this case, theRSSIreadingfrom the radiois usually0xFF, which means invalid.


Unfortunately, Gill s original approach (1) rei.es the abstract syntax in graph form and (2) it assumes an untyped syntax representation.

accelerate is based on a typed tree representation using GADTs and type families in conjunction with type-preserving compilation in most phases.


Both of themprovide a mzero operator for modeling failure.


As one would expect, the .gure shows that GreenHadoop increases green energy consumption by a smaller percentage when there is less green energy.

its brown electricity cost savings remain high (> 13%), except when there is almost no green energy and the prediction is inaccurate.


Conventional compilers can treat generated code purely as data, since execution of generated code is not done during compilation.

jIT compilers switch between execution of static code (the compiler) and dynamically generated code; hence some data needs to be treated as code.


It either outputs a web form and terminates or it invokes one of the continuations in its form.

ask s type says that it returns an action of type cgi () so that the return type of the transaction is .xed to ().


This allows characters to classify one another in non-direct ways.

sophisticated learning mechanisms can produce bizarre behavior when left unchecked.


Their approach would certainly protect applications against a vulnerability scanner such as SecuBat.

the problem of their approach is that it is a tedious and error-prone task to create suitable policies.


Terms that serve only as retyping operations are pervasive in typed intermediate languages, and are usually described as coercions that can be eliminated before running the code.

applications of these informal coercions cannot in general be erased if there is no way to distinguish coercions from ordinary functions by their types; this is a problem especially in the presence of true separate compilation.


This can be attributed to the lack of experience in project planning and estimation and the fact that in many of the courses students used technology that was new to them which makes effort estimation inherently difficult.

a large number of student comments on the planning game were more positive than the quantitative data leads us to believe: 4 N=113, these statistics reported are only based on the data of fall 2003 and winter 2004 semesters since the earlier data was not collected.


A Web-based CVE can be constructed using VRML/X3D.

due to the heterogeneous nature of the Internet, system scalability in delivering virtual world database and maintaining consistent world states across all participants in a Web-based CVE become more challenging issues than with its non-Web-based counterpart.


The traditional type checking method is to derive the minimal type of M. Thus the information of the type A is not used.

we check M : A, but not ensure to derive the minimal type for M. Strong Typing System (STS) True G true : Bool False G false : Bool x : B1.···.Bn.A.


For example, 3G networks have relatively low bandwidth, causing long communication delays for computation of.oading [11].

although WiFi networks have high bandwidth and are free to use in many cases, their coverage is limited, resulting in intermittent connectivity to the cloud and highly variable access quality even when connectivity exists [8, 12, 24].


The reason for this is that if the coalescing phase does not fold any copies, the interference graph is correct, and the remaining phases of the allocator then use it.

if the coalescing phase unions any live ranges,  Algorithm First Pass Second Pass Briggs.


The existence of such a framework might be an advantage, since the openness of these tools allows for integrating project control functionality easily.

the necessity of an underlying framework often seems to be ignored.


Due to space restrictions the objects of the self-test subsystem have been omitted from Figure 4 and represented by the package labeled ajsSelfTest.

the details of the self-test component are described in the next subsection.


Another advantage of this new component model is that component developers are still able to guarantee QOS for their components.

the dynamicity and flexibility gained by using this new component model comes with a price.


' If ann(t,t )is not explicitly de.ned, t may inherit an annotation from t or may gain an annotation according to some default ' policy.

if ann(t,t ) is explicitly de.ned, it cannot be overridden with a propagated annotation.


Integer) can be passed to the untyped scheduler and then passed to the typed collection method inject:intoSafe:, because no wrapping is necessary hence performance is unaffected.

if the block was expected to have a different return type, wrapping would be necessary, and a runtime error would be raised to prevent the implicit creation of the wrapper.


Since it treats all fixed-time constraints as a whole, it can claim that all checkpoints selected by it are necessary and sufficient .

those fixed-time constraints whose consistency can be deduced from others do not need to take any checkpoints.


Other than null related comments, we have not found many memory management related comments.

even if memory management is easier in Java, the more general problem of resource management (such as who must close/dispose a stream)is still presentin Java.


With this scheme, work-stealing achieves good load balancing [4] [10] [3].

there are still problems in the current work-stealing techniques.


Similarly, the part (b) led to triggering of winhit again.

it is transition (14) that is triggered after (b), leading the execution towards the subsequent execution of transition (17).


We do not want to go here in the details of the modeling notation that was developed, as it would go beyond the scope of this paper.

there is one aspect of the modeling notation we want to highlight here: All systems that were expected to be developed share a lot of commonalities.


Risk-based checkpointing did well under all distributions and was therefore demonstrated to be more robust.

figure 7(b) looks very much like the saved work plots for every other distribution, suggesting that the metric lacks some crucial information that is needed to accurately identify the merit of a checkpointing algorithm.


To put it boldly, our approach addresses known unknowns , not unknown unknowns .

even if the two conditions are partially satisfied (i.e., only some sources of uncertainty are identified and estimated), POISED produces better results than the traditional approach by incorporating the known uncertainties.


The XACML option for returning a single decision for multiple Resources corresponds to EPAL's handling of multiple data-categories in a single authorization decision request.

in EPAL, in order to obtain a separate decision for each data-category, a separate request must be made for each datacategory.


We did .nd 4 tests that would require multiple event occurrences, but changing the language to supportthem(e.g., adding event counters orloop indicesto events) would add alayer of complexity thatis notjusti.ed by the small number of cases.

as we apply IMUnit       Subject Tests Events Orderings   Collections [4] 18 51 32 JBoss-Cache [18] 27 105 47 Lucene [6] 2 3 4 Mina [7] 1 2 1 Pool [5] 2 8 3 Sysunit [11]  9 33 34 JSR-166 TCK [17] 139 577 277   198 779 398 .


This implies that a query can read di.erent database states according to the node it is sent to.

since queries are not distributed, they always read a consistent (though stale) state.


We summarize an alternative, automata-based, formalization inSection6.

5.1 SpeculationPhases Wenow consider concurrentobjectsimplementedby several speculationphases.Clientsuse a speculationphasebycallingthe object s invocation functions and the invocationfunctions return outputs to the clients.a speculationphase also acceptsinitialization callsfrom clients andit may switch to another speculationphase.


Recent Focus+Context UML visualization, in which A class is displayed at a particular level of detail using a degree of interest (DOI) function based on the frequency of access to a particular class and its distance from the current object in focus , capture a notion of interaction [14].

we make tasks a first class part of both interaction and context, support direct and indirect interaction for both artifacts and tasks themselves, and enable novel operations such as propagation, prediction, slicing, and projection.


It is likely that further improvements to the performance of the bridge would .x this issue.

the vehicle is still capable of safely following the given trajectory.


We have done some investigation of older processors, which have less dynamic scheduling (reordering of execution in the hardware), and static scheduling does give bigger percent improvements on such architectures.

we still see useful improvements for some programs on more recent machines.


Being an ordinary assumption, it can be used at any point in the proof script.

once the proof is .nished, Coq runs a syntactic check on the proof term and accepts it only if the use of the coinductive assumption is guarded [3].


This enables di.erent parts of neighboring splitjoins to be combined.

it implies that a Stream might have a di.erent width at di.erent points (since neighboring splitjoins could have di.ering widths); this necessitates the addition of the width array to the algorithm.


We intend to choose g from a family G that has the same communication cost.

it is very hard (if not impossible) to come up with a right measure of the communication cost that both is mathematically sound and allows the above minimax problem to be solved exactly.


This left us with an uncertainty about the directness of evidence for other agile methods.

since most of the studies regarding XP were performed with student subjects or professionals who had little or no experience in agile development, this also raised an issue regarding the directness of evidence for XP.


Most of the time the data exists, either in memory, on disk, or somewhere on the Internet.

sometimes an iterator will work with an enumerator that actually generates values (for example, random numbers).


Notice that because of an overhead of our approach (recording of the execution trace); the analysis is typically performed on relatively short program executions to identify performance deficiencies.

the experimental results have indicated that, the performance improvements on short executions may scale also to long executions.


Example 5: Similar to Example 4, suppose the selected variants are v1 , v2 , v2.1 , v2.3 , v2.3.1 , v2.4 ,and v3 .Initially, neither v1.1 nor v3.2 is selected.

there is inclusion dependency between v2.3.1 and v1.1 ,and between v2.4 and v3.2 and the dependant variants are not selected.


There is a basic product version that contains all common functionality for applying at a university.

all product instances which are in use online11 are customized to a wide variety of usage contexts: On the one hand there are different types of universities, from full universities to small art schools.


For example, our empirical foundation allows us first and foremost to identify the perceived obstacles, but leaves us with no means to clarify whether these seemingly perceived obstacles are actual or not, because it would require a more in-depth organizational analysis.

one actual obstacle that was evident for the nonevaluating organizations in our study was the decision not to conduct usability evaluations.


Although we did not have significant difference between the development times, we believe that the extended RUP has more advantage since: (i) it provided a better quality work products; (ii) the basic RUP did not support fault tolerance satisfactorily.


In permitting benign executions, on one end, we could enforce a strong non-interference property (in the computational sense [28]) on all computation in the VM.

many practical programs we study leak some information, via control .ow channels, but the information leaked is small.


This approach provides an upper bound of an application s performance after optimization orchestration.

its complexity is O(2n), which is prohibitive if a large number of optimizations are involved.


Zhong et a1 [23] use the elegant concept of reference afinity to arrive at precise data transformation decisions, split structures in multiple parts, and achieve impressive performance results.

their approach is based on program traces and therefore not applicable for commer- cial compilers.


It is a complex task and there are many CM systems that aim to support it.

generally, these systems work in isolation and there is a need for integrating them.


12, 13] and accounts of their adoption by governments.

this literature is concerned rather with standard-setting and the degree of adoption.


Discussion Itis desirable thatdevelopersdo not need to master sophisticated theories or technical details underlying tools when using thetools.For example,ratherthandemandingdevelopers to write algebraic speci.cations[12]in aformal way, Pex allowsdevelopersto writeintendedbehavior ofthe code undertestintheform ofPUTs(simplytest methods withparameters), whichinfact encode algebraic speci.cations.The internaldetails ofdynamic symbolic execution as wellasits underlyingconstraint solving andtheoremproving ofZ3[9] exploited by the Pex tool are also not exposed via the tool interfacetodevelopers who are usingPex.

no state-of-the-art tool including Pex can deal with all complicated situationsin real-world codebases automaticallywithouthumanintervention orguidance.For example, sometimes atool couldfailtogeneratetestinputsfor covering a branch for one or more reasons.


Dom µ In the constructors of Ton, we can see that TonMaj, corresponding to speci.cation 4, is only available in the major mode, while TonMin is only available in minor mode.

all the constructors of Dom are mode-agnostic.


Therefore, programmers need not decide between datatypes and classes up front; both are embodied in the objtype construct.

oML still maintains a distinction between methods and functions, which have different bene.ts.


The spirit and the design principles of the test harness, which we developed during the course of the various projects and proofs of concept, were unashamedly copied from the open source JUnit package [10].

following a belief that tests should be coded in the same language as is that used for development, the test harness was coded as Goals and Plans using the AESS.


These subcharacteristics are Contents Verifiabiliness, Media Management and Agenda Management.

subcharacteristics which provide some functionality of an CMS that operationalizes some non-functional aspect, therefore they could be classified in both parts of the catalogue.


6 There exist more clever encodings for database values and it would also be desirable to have a fully typed and type-safe database interface for a language like Haskell.

these matters are orthogonal to the topic of this paper, so we stick to the simple, general Maybe String type.


Automatically adding @override annotations to the manually implemented equals methods would allow the compiler to detect these incorrect override errors.

if the methods themselves are automatically generated instead, then this problem is not only detected but resolved.


As a consequence, OpenVZ performs similar to native Linux.

xen hypervisor statically allocates memory areas to each virtual environment.


That is the system may consider pitching too soon.

if the history window size is set too large, the system may never pitch as there is no visible trend that the sJIT rate has slowed down.


The fuel ef.ciency was calculated based on the In- As shown in Figure 15, the prediction mean absolute error for Dover traf.c signals is half when compared to the error for Bugis traf.c signals.

note that the average phase length for Bugis is 47s whereas for Dover it is only 28s.


For example, in Figure 2, x and y will be considered live through Line 7 when no information about the locations pointed to by p is available.

if the RC updates on Lines 2 and 8 weren t present (on the presumption that y is RC subsumed by x ) and the store operation on Line 7 overwrites y , then the reference count of the object targeted by x could prematurely fall to zero after Line 6.


As long as the tasks are feasible in [0,L], by replicating the schedule, the timing feasibility of the real-time system is guaranteed.

when the execution of the real-time tasks are further constrained by a maximal temperature, is this approach still feasible?


Fortunately, there are e.cient algorithms for segmented scans [28] [7].

the segmented scan operation requires as input an array of .ags, whose elements designate the beginning of each row of the matrix.


Doing the benefits analysis by the architect is always simpler and faster.

having  process owners takes more time and agony, yet directly encourages communication and promotes eventual implementation of the metrics data usage patterns.


H(..g)= H ' (..g) Since H ' is exactly the same as H except for the monitor of ., we can deduce: H(..g)= H ' (..g) as required.

(31) From (30) and (31) we can deduce: P(H,[xj ..j ],(*A ' j )) H ' from (G1) and the de.nition of Ver(Prog) for each of the invariants we can deduce: SF(Aj) (33) From (33) and lemma 8 we have: SF(Aj[xj/this]), that is: SF(A ' j ) (34) From (34) and property P8 we have: SF(*(A ' j )) (35) From (35), (32), (27), (28), (29) and the de.nition of self-framing assertions we have: H ' , . '


We use it as a means to improve understandability by reducing complexity and to support reuse of the artefacts developed.

the e.ects of the abstraction and hence the abstractness of artefacts is rarely discussed and not well understood.


The second is a functional interface, SymCall, that allows a symbiotic VMM to invoke the guest synchronously, during exit handling or from a separate core.

these invocations have considerably higher costs compared to the passive interface.


These numbers match our expectations of the optimization: The overall number of traces increases because many workload loops are traced instead of the interpreter loop.

the workload loops are much simpler and less branchy then then interpreter loop, so the average complexity of the traces decreases.


Then, we are able to develop new applications rapidly by combining a suitable set of available services with flexible service composition.

service composition in wireless sensor networks is faced with more difficulties [6][7].


Individual disk drives consume moderate amount of power when compared with other components in a computer system.

disk drives tend to be more idle than other system components.


Recently, real-time garbage collectors have been developed that provide a guaranteed fraction of the CPU to the application, and the correct operation of those collectors has been proven, subject only to the speci.cation of certain statistics related to the type and rate of objects allocated by the application.

unless those statistics are provided or estimated appropriately, the collector may fail to collect dead storage at a rate suf.cient to pace the application s need for storage.


In their approach, they provide impromptu service discovery which automatically discovers locally available services and service provision module to provide appropriate services to the right person based on context.

service functionality is hard for a user to understand and it makes difficulty for choosing a service.


The greater difficulty faced was the textual description as a way to gather the requirements.

the author proposal is focused in the integration of different professionals, not having an approach focused in the development of applications and their peculiarities.


For weak-scaling applications, where problem size is .xed for each processor and the sequential computation 1 Because Message Passing Interface (MPI) is the dominant programming model in large-scale high performance computing, we use parallel applications to indicate parallel applications written in MPI in this paper.

our approach is applicable to other message passing programming models.


This means that the three categories, which we selected and did a short analysis of, from the INCOSE survey, are important.

some additional categories are needed to be able to state something about future requirements management tools for ERP systems.


T (sj ) |C| n These n packets are transmitted repeatedly on C. Theorem 2 Broadcasts = PET [8]: This scheme represents a priority encoded |si| transmission with Pi = and rate T (si) for segment si on C. ni *We assume a dummy zero-sized segment s0 exists In principle, the above-mentioned scheme implements a lossresilient broadcast using PET.

for large media .les, using traditional MDS erasure codes can result in prohibitive encoding and decoding complexity.