Abstract Military surveillance, home health care or assisted living, and environmental science are three major application areas for wireless sensor networks. Revolutionary changes are possible in these areas by using wireless sensor networks. To show the breadth and advantages of wireless sensor

This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet

scalability together with a random access property. The algorithm has modest complexity and is extremely well suited to applications involving remote browsing of large compressed images. The algorithm lends itself to explicit optimization with respect to MSE as well as more realistic psychovisua1 metrics

important uses are the creation of yardsticks for research and the anticipation of needs of future HPC technology. The main thesis of this paper is that there is a dire need for basing such assessments on realistic computer applications. While the use of metrics that rely on measuring the behavior of simple

sets of the applications, we describe which operating points in terms of cache size and problem size are representative of realistic situations, which are not, and which re redundant. Using SPLASH-2 as an example, we hope to convey the importance of understanding the interplay of problem size, number

applicable in path-dependent and multifactor situations where traditional finite difference techniques cannot be used. We illustrate this technique with several realistic exatnples including valuing an option when the underlying asset follows a jump-diffusion process and valuing an America11 swaption in a 20

In recent years research in the planning community has moved increasingly towards application of planners to realistic problems involving both time and many types of resources. For example, interest in planning demonstrated by the space research community has inspired work in observation scheduling

demonstrate a few applications of having high dynamic range radiance maps, such as synthesizing realistic motion blur and simulating the response of the human visual system.

example. Using our algorithm, textures can be generated within seconds, and the synthesized results are always tileable. Texture synthesis is important for many applications in computer graphics, vision, and image processing. However, it remains difficult to design an algorithm that is both efficient

syntax: program ::= type-def decl fun-def + program type-def ::= struct id f decl + g type definition decl ::= type-spec id declaration type-spec ::= void j char j int j . . . base types j * type-spec pointer type j struct id structure type fun-def ::= type-spec id ( decl ) stmt function definition stmt ::= lexp = exp assignment j if ( exp ) stmt else stmt conditional j do stmt while ( exp ) loop j f stmt g block j id = id ( exp ) function call j return exp return lexp ::= id variable j lexp.id structure select j * exp dereference exp ::= const constant j id variable j lexp.id structure select j & lexp address j * exp dereference j exp bop exp binary expression Figure 3.1: Syntax of C subset Binding-Time Phase 51 to that type. Notice that associating locations with structure components on a structure type and field basis allows different components of a given structure to have different binding times but forces the same components of different structu...