text:
|Publication number
|Publication type
|Application number
|Publication date
|May 7, 2002
|Filing date
|Jun 5, 1998
|Priority date
|Jun 5, 1998
|Fee status
|Publication number
|Zhimei Jiang, Leonard Kleinrock
|Original Assignee
|The Regents Of The University Of California
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (10), Non-Patent Citations (3), Referenced by (175), Classifications (10), Legal Events (10)
|External Links: USPTO, USPTO Assignment, Espacenet
1. Field of the Invention
The present invention is in the area of computer software and more particularly involves software to minimize user waiting for information transmitted over computer networks by anticipating user requests.
2. Description of Problem and Related Art
Due to the rapid growth of the World Wide Web (WWW), there has been a large increase in the amount of information transmitted over the Internet. However, the growth of Internet capacity is not keeping pace so that users often experience long delays in retrieving files from remote machines when running network related applications. Among these network applications, the most popular ones are web browsing and accessing email and news groups. Sometimes, the waiting does not end even when the files have been transferred to the local computer. For example, after an access, the client machine may need to decompress the received files, compile Java programs, etc. On the other hand, during the time interval between two network accesses users will be viewing the information just downloaded and the local computer is generally idle. The key idea of prefetching is to take advantage of these idle periods to fetch the files that will very likely be requested in the near future, so that the user's average waiting time can be reduced. More specifically, if we add some intelligence to the network applications so that whenever the user requests a block of information (a file, an email message, etc.), the system can estimate what additional information (files, messages, etc.)1 will be needed in the next few user accesses and transmit some of them to the local computer beforehand, according to certain criteria. If the prefetched information is indeed requested, the user can access it with negligible delay. In addition, prefetch allows more time for sophisticated processing including encryption, compression, and compilation to be carried out at both server and client sites, so that data can be transmitted more efficiently and securely without increasing the delay to the user.
1 For simplicity, in the rest of this specification, we use the term "file" to represent a block of information whether it is a file, directory listing, web page, or other information requested by the user.
The idea of prefetching stems from the fact that, after retrieving a page from the remote server, a user usually spends some time viewing the page, and during this period the local computer as well as network link is generally idle. If we can take advantage of this phenomenon by fetching some files that will likely be accessed soon using the otherwise idle system, in other words, prefetching them to the local computer, then there will be no transmission delay when the user actually requests these files. In addition, prefetched files can immediately be processed if decryption or decompression is needed, or if any Java applets need to be handled. This allows further reduction in the delay of loading a page. These are some of the benefits of prefetching. However, the problem is, since the prediction can not be perfect, some of the prefetched files are never used and prefetching increases the system load. At some point, this increase in load may increase the delay of normal (nonprefetching) requests significantly and may eventually cause the overall system performance to degrade. Therefore, the key challenge in prefetching is to determine what to prefetch so that improvement in performance will occur.
If we knew exactly which files a user needed next, we would retrieve only those files in advance. Assuming that the prefetch operation always finishes before the user requests the next file, then we would enjoy zero latency with no extra bandwidth consumption. Unfortunately, in reality, some prefetched information may never be used resulting in wasted bandwidth and increased delay to normal (nonprefetch) requests. This indicates that the prefetch problem has two aspects. The first one is how to estimate the probability of each file being accessed in the near future. In general, this probability changes with time as the user issues new requests. The second aspect is how to determine which files to prefetch so that the overall system performance can be optimized relative to some criteria. Previous studies on Internet prefetch focus only on the first aspect of the problem and either use a fixed threshold or prefetch a fixed number of the most popular links on a page [2, 7, 8] In the prior art PeakJet prefetching software for web browsers all available links on a page being viewed are prefetched [9]. If everyone were to employ this method, there would be unacceptable surges in network traffic. In fact, prefetching without caution could be disastrous to the network.
The prefetch scheme of the present invention consists of two modules: a prediction module and a threshold module. A simplified flow diagram is shown in FIG. 14. The complete scheme works as follows. After a user's request for a new file is satisfied, the prediction module immediately updates a database of history information if needed, and computes the access probability for each candidate file, where the access probability of a file is an estimate of the probability with which that file will be requested by the user in the near future. Different applications may use different prediction algorithms in this module. Next the threshold module determines the prefetch threshold for each related server, which contains at least one candidate file with nonzero access probability. The threshold is determined in real time based on then current network conditions. The algorithm used in the threshold module is independent of the application. Finally, each file whose access probability exceeds or equals its server's prefetch threshold is prefetched. When prefetching a file, the file is actually downloaded if and only if no up-to-date version of the file is available on the local computer; otherwise no action is taken. Although web browsing is an important application for prefetching, the prefetch scheme of the present invention may be advantageously applied to any network application in which prefetching is possible. In general, for different applications, different prediction algorithms may be developed, while the same threshold algorithm can be employed throughout, with the same prefetching criteria always achieving the optimum performance.
To achieve high efficiency with prefetching, in the prediction module, one uses an algorithm to predict the access probability of each file as accurately as possible. In the threshold module, the prefetch threshold for each related server is computed. We have derived an upper bound for the prefetch threshold that is a function of system load, capacity, and cost of a time unit and a system resource unit to the user. Files with access probability greater than its server's prefetch threshold are prefetched. By doing so, a lower average cost can always be achieved. We tested the performance of our prediction algorithm for web browsing by setting the prefetch threshold at various values. The results show that generally, using the access probabilities from the client can ensure that a large portion of prefetched files are used, while the access probabilities from the server can help improve the number of user requests satisfied by the prefetched files.
Prefetch is a good approach to reduce latency for network applications. However, it must be implemented in a way such that the overall system performance can be improved, and the tradeoff between saving user's time and the bandwidth usage must be considered. Applications of this approach go beyond mere prefetching. In the case of a push server or push caching it is important to study overall efficiency. This means not only the percentage of the pushed files being used, but also, and more importantly, the impact of pushing on other users who are sharing the same network but may or may not be able to use these pushed files at all. As in most of the other prefetch algorithms, most commercial push servers use fixed (possibly customized by the user) values to determine what and when to push, without taking into account the network conditions at the time. This will almost certainly not achieve the best efficiency for the overall system. Clearly, the solution to this problem is adaptivity:—adaptation to the user's behavior and adoption to the network conditions. This is also a goal of our prefetch scheme. In fact, we can use the same kind of approach for the threshold algorithm to analyze the push server or push caching problem. As more functions like prefetching or pushing are added to the network applications, it is very important to consider the tradeoffs involved as we have shown here.
The objects and features of the present invention, which are believed to be novel, are set forth with particularity in the appended claims. The present invention, both as to its organization and manner of operation, together with further objects and advantages, may best be understood by reference to the following description, taken in connection with the accompanying drawings.
FIG. 1 shows a diagrammatic representation of a prediction algorithm optimized for web browsing;
FIG. 2 shows a plot of prefetch threshold H as a function of system capacity in a single user system;
FIG. 3 is a diagrammatic representation of multiple users linked to a single server;
FIG. 4 is a diagrammatic model of a prefetch system;
FIG. 5 shows a plot of cost for user requests as a function of prefetch rate;
FIG. 6 shows a plot of prefetch threshold H as a function of system load;
FIG. 7 shows a plot of average cost C as a function of prefetch threshold H;
FIG. 8 shows a plot of prefetch threshold upper bound and the prefetch threshold versus system utilization
FIG. 9 shows a plot of successful prediction rate using a prefetch threshold algorithm on a teaching assistant (frequently updated) page;
FIG. 10 shows a plot of successful prediction rate using a prefetch threshold algorithm on a university department (slowly updated) page;
FIG. 11 shows a plot of hit rate versus prefetch threshold on the teaching assistant page;
FIG. 12 shows a plot of hit rate versus prefetch threshold on the university department page;
FIG. 13 shows a plot of the average number of files prefetched for each user request on the teaching assistant page;
FIG. 14 shows a simple flow diagram of the operation of the present invention;
FIG. 15 shows icons used in the prefetch program with a web browser; and
FIG. 16 shows a sample page to demonstrate the use of the icons.
The following description is provided to enable any person skilled in the art to make and use the invention and sets forth the best modes contemplated by the inventors of carrying out their invention. Various modifications, however, will remain readily apparent to those skilled in the art, since the general principles of the present invention have been defined herein specifically to provide an improved prefetching method and device for use on computer networks.
The Prediction Module
The task of the prediction module is to keep track of the user's access history and to compute access probabilities to determine which files to prefetch. Different prediction algorithms can be designed for different applications. An application that handles email may assign each message a probability based on certain criteria, for example the latest/earliest message has the largest probability, or messages with a subject similar to the one being read have larger probabilities, etc. Thus, while a user is reading an email, the messages he might read in the near future can be prefetched. When a user logs in to a remote machine and switches to a particular directory, the files and subdirectories in that directory would be assigned certain access probabilities, and some of them would be prefetched since the user might need them soon. Web browsing is an application where sophisticated prediction is especially necessary. We derive an algorithm particularly suited to web browsing by defining the access probability, p(B|A), as the conditional probability that page B will be requested by the user in the near future given that page A is currently being viewed. Our prediction algorithm is based on the fact that typical web surfing involves a sequence of clicking and downloading operations. Namely, first the user clicks on a link, and a new page is downloaded. After viewing the new page, the user usually clicks on a link on this page to download another new page. Sometimes, the user may use the back or forward buttons on the browser to go to some previous page and then click on another link on that page. Rarely does the user type in a URL (Uniform Resource Locator) to switch to a new page. We take advantage of this feature by only keeping track of the click (link selection) operations and assuming that p(B|A) is zero if no link exists on page A to page B. In other words, whenever a new page is displayed, the candidate files we consider include only those which are directly linked to this page. In our current algorithm, the access probabilities for embedded images or programs have been set to zero, but they could also be prefetched when the page that includes them is prefetched.
Previous workers [2, 8] have studied prediction algorithms for the WWW. Parameters roughly similar to access probability are defined in these works. However, algorithms used by these workers apply windows to the access sequence, windows either in terms of time or in terms of the number of requests. Files within the same window are all considered to be dependent on each other. Since the content of each page varies greatly and how pages are browsed differs from user to user, it is difficult or impossible to adjust the size of the time window. In the WWW, after an html (hypertext markup language) file is downloaded, images embedded in the file are downloaded immediately. Therefore, the request window includes both html files and embedded images, which also makes it difficult to determine size of the request window. Since both algorithms keep all access pairs that are in the same window for future prediction, the memory space required could be as large as the square of the total number of files requested.
Our scheme operates differently and is similar to using a request window of size two after removing all the requests that were not sent explicitly by the user (for example, those for embedded images, etc.) from the request sequence and eliminating all the unrelated pairs of requests. The latter can be accomplished because we keep track of each request as well as the page from which the request was initiated by selecting a link. It is easy to get this information at the client site. Note that the page from which a request is initiated may not be the previous one in the request sequence, since the user can click the back button on the browser to go back to an earlier page. Assuming the number of links on a page is bounded, our algorithm requires memory space linear to the number of pages on the server as opposed to the square of the number of files as in the prior art.
The details of the prediction algorithm are as follows. For each client, in order to collect the history information for prediction, the algorithm maintains two kinds of counters, the page counter and the link counter. More specifically, each page A is associated with a page counter CA. In addition, if page B can be accessed directly from page A, namely there exists a link on page A pointing to page B, then and only then is there a link counter C(A,B) for the pair. Whenever page A is downloaded, CA is increased by one. In addition, if page B is accessed by clicking on the corresponding link on page A, C(A,B) is also increased by one. The access probabilities are obtained in the following way. When a page, A is being viewed by the user, for each page Bi linked to A, the access probability of Bi is computed as
for CA≧5, and 0 for CA<5. All files which are not linked to the page being viewed have access probability zero. The values of the counters are based on the access history during a certain period of time, for example, the last 30 days. The algorithm is also illustrated graphically in FIG. 1. Note that for a page A with k distinct links (B1, B2, . . . , Bk),
can be greater than one. This is because a user may click link Bi on page A and come back (back button) later to go to another link Bj through A. Therefore, while page A is retrieved from the server only once, more than one file might be accessed from page A.
The prediction algorithm described above is intended for the client site browser. The same algorithm can also be implemented at the server site, where each server aggregates the access histories of all users to its pages and computes the access probabilities accordingly. The only difficulty at the server is that it is not straightforward to find out from which page a request was initiated. The best way to get this information is to require the client to include it in the file request. However, if we do not wish to change the current http protocol used to request files, we can have the server keep track of the last page request from each of a certain number of users who accessed it most recently. When a new request from a tracked user arrives, the server assumes it was initiated from the previous page requested by that user if such a link exists.
Clearly, the access probabilities generated by the client site indicate the user's personal interests, while those generated by the server site represent the popularity of the files over many users that have accessed that server. If a client has not visited a page often enough to obtain reliable access probabilities, the server's access probabilities are likely to be more accurate. Access probabilities from the server and client can be merged in the following way at the client site. If a page has been visited fewer than five times by the client, and the access probabilities of its links are available at the server, then the probabilities available at the server are be used. Otherwise, the access probabilities from the client are used. More sophisticated algorithms may be developed to do this merging. The algorithm just described in this section is an essential component of a complete prediction algorithm for web browsing. More functions may be added for better prediction. The prediction algorithm demonstrates that to predict a user's behavior in web browsing, it is not sufficient to just look at the sequence of requests independently, one must take advantage of the underlying link relations between pages to achieve better performance.
The Threshold Module
The prefetching scheme of the present invention tries to optimize the tradeoff between system resource (network link, server etc.) usage and latency, by predicting which files are likely to be needed soon and choosing some of them to download beforehand. The prediction module accomplishes the first part of this task as we discussed above. In the threshold module, we determine the prefetch threshold for the server in real time to determine which files to prefetch. Unlike the prediction module, the algorithm used in the threshold module is the same for all applications. To optimize the tradeoff between system resource usage and latency, we choose to measure the system performance in terms of cost which is comprised of the delay cost, αT, expressed in cost per unit time ($/time) and the system resource cost, αB, expressed as cost per unit of system resource ($/packet). The delay cost indicates how much the user suffers waiting for files. The system resource cost includes the cost of processing the packets at the end nodes and that of transmitting them from the source to the destination. The goal of the algorithm is to determine which files to prefetch to minimize the average cost of requesting a file.
Previous work on prefetch uses either a fixed threshold for all servers or prefetches a fixed number of files each time. The problem with these approaches is that they do not consider factors like system load and capacity, which can greatly affect the performance of prefetching. For example, we should be more cautious in prefetching files when the system load is high because the additional load of prefetching can overload the system. In our algorithm, we compute the prefetch thresholds based on the network conditions in real time. Unless indicated otherwise, we assume that prefetches triggered by the previous request always finish before the user sends out the next request. In addition, we assume that when a prefetched file is requested for the first time, it is always up-to-date. We also assume infinite storage space at the client, so prefetched files are never deleted. These assumptions imply that the first request to a prefetched file will always result in a hit.
The Single User System
In a single user system, the total cost c of requesting a file is the sum of the system resource cost and the delay cost of waiting for the file to arrive.2 Therefore, if the user requests a file that is not available in the local computer, the total cost of retrieving the file is
where s is the file size, t is the transmission time, t0 is the startup time required to deliver any file, and b is the capacity of the path to the server (packets/time unit). Assuming the cost of using a file stored on the local disk is negligible, if the requested file had previously been prefetched and saved on the local cache, then the cost associated with this request equals the system resource cost, because the delay cost is zero.
2 We assume the processing delay is zero after the file has been received.
Consider the situation in which the user has just started using a new file, and currently there are L distinct files in the system with access probability greater than zero. The average cost, C, of satisfying all user requests stemming from this new file being used without any prefetching, is the summation of the costs to retrieve each of the L files times the access probability of the corresponding file,3 i.e.,
where pi is the access probability of file i, t0i is the start up time for retrieving ith file, and bi is the capacity of the path to the server which contains the ith file.
3 A file can be viewed more than once. Since we have assumed that the cost of a request which does not invoke file transfer is negligible, when the file is requested again, if the copy the user viewed last time is still available on the local cache and up-to-date, the cost for this request is zero regardless of whether the first request was satisfied by a prefetched file or not. Therefore, we do not need to consider this case in the cost function. If there is not an up-to-date copy of the file that is available locally, the request is treated as a new request.},
If instead, m files among all the L candidate files are prefetched, say i1, i2, . . . , im, this average cost becomes
where ij ε{1, . . . ,L}, j=1 . . . L, and for any j1≠j2,ij1≠ij2. Note that these L files could be on different servers and, they are the only files that may be prefetched because we never prefetch files with an access probability of zero.
Comparing (3) and (4), we conclude that the average cost is minimized if and only if we prefetch all and only those files that satisfy
where s0i=bi�t0i, and bi is the capacity of the path to server i. We define the prefetch threshold
In FIG. 2, the prefetch threshold (H) is plotted as a function of the available bandwidth b, for several values of
Note that, the ratio
indicates how valuable time is compared to the system resources.
FIG. 2 shows that, for fixed
more files should be prefetched from a server to which the capacity of the path is smaller, because it takes longer for the user to fetch the file himself. In addition, the larger the ratio
that is, the more expensive time is relative to the system resources, the lower the prefetch threshold is for fixed bandwidth.
The Multi-user System
In a single user system, the available bandwidth to each server is always the full capacity of the path. In a multi-user system where system resources are shared among users, prefetching increases the delay of other users' normal (e.g., nonprefetch) requests. Therefore, different criteria must be used to determine which files to prefetch in such a system. The multi-user system described here consists of a single server and multiple users who share the same server and the network link as shown in FIG. 3. Users issue requests for files on the shared server. Each user's local system can prefetch files while the user is working. We can model this prefetch system as an M/G/1 Round-Robin processor-sharing system with two Poisson inputs, shown as a simple model in FIG. 4, where the server S in the diagram represents both the network link and the server in the real system. The server S handles two kinds of requests (inputs): normal requests λ1, which are those user requests that can't be satisfied by the prefetched files in the local computer, and prefetch requests λ2, which are the requests sent by the prefetch program. All requests to the server are of the same priority and they join the same queue waiting for service. We assume that those user requests that do not invoke a file transfer consume very little resources and are negligible. Thus, if a prefetched file can satisfy a user request, no cost is added to the system. We start with a special kind of system in which, at any time, the. access probability of each file is either exactly p(p>0) or 0, where p is fixed within one system but can vary for different systems. Files with access probability zero may actually be requested by the user but they are never prefetched. This implies that for a given system and its p, all the prefetched files will be requested by the user with the same probability p. For simplicity, we initially assume that the startup time t0 is zero. The result for the system with nonzero startup time is given below. Let us now derive the prefetch threshold step by step.
a) The Cost Function C
For a given system, let λ be the arrival rate of the file requests from the users when no prefetch is applied. We assume that prefetch does not affect the user's behavior regarding the likelihood of accessing files. In other words, when prefetching is employed, users still issue requests at rate λ in the same pattern, although they can get some files faster due to prefetching. Let the arrival rate of normal requests and prefetch requests be λ1 and λ2 respectively. Hence the rate at which user requests are satisfied by the prefetched files is λ−λ1, which is simply pλ2 because prefetched files are eventually requested by the user with probability p, where p is the access probability of the prefetched files. Thus λ1+p�λ2=λ or
where λ1+λ2 must be less than b/s in order to keep the system in a stable state.
In a Round-Robin processor-sharing system, the average response time for requests requiring an average of x time units of processing is
where ρ is the system load, s is the average file size, and b is the system capacity [5, 6]. For the system shown in FIG. 4, ρ=s(λ1+λ2)/b. This implies that, in a multi-user system, the cost of a normal request, which is the sum of the system resource cost and the delay cost, becomes
where b>(λ1+λ2)s. Notice that in equation (8), the effect of prefetching on the entire system is considered by including λ2 in the formula. As more files are prefetched, the cost of normal requests increases because prefetching increases the system load, hence the delay of retrieving files increases. The average cost of a prefetch request is (9).
Since users issue requests with rate λ and some of them (pλ2) are satisfied by prefetched files, the rest (λ1) are sent to the server as normal requests; by equations (6), (8), and (9), we obtain that the average cost of an explicit user request is
This equation for the average cost C is plotted in FIG. 5 as a function of λ2 for several values of p. Note that for equation (10), the valid range of λ2 is
b) The Optimum Value of the Prefetch Rate λ2.
Assume p and λ are known, we wish to find the value of the prefetch rate λ2 which minimizes the average cost of each request in the system. Once λ2 is determined, λ1 can be computed by λ1=λ−pλ2 according to (6).
From equation (10), clearly, at p=1, C is minimized when λ2=λ, i.e. all the files which have access probability 1 should be prefetched. On the other hand, if p=0, C is minimized when λ2=0, therefore no files should be prefetched. For 0<p<1, we consider the following. From equation (10), we take the derivative of C with respect to λ2 to obtain
Differentiating (11) again, we get
In a stable system,
must be less than b. Therefore, equation (12) shows that for
is always less than zero. This implies that equation (10) is maximized at
when pb>λs. Solving
for λ2, we obtain the critical value λ′2, which is given by
Since function (10) is maximized at λ′2, where
for pb>λs, it follows that the cost decreases λ2 increases for λ2>λ′2. Specifically if λ′2≦0 for the given p, λ, and
then for any λ2 in the range
the higher the λ2, i.e., the more that files with access probability p are prefetched, the lower the cost. Thus, for the given p, λ2 and
if λ′2<0, prefetching all the files with access probability p will minimize the cost.
Notice that we have assumed the access probability of each file in the system is either p or 0. In addition, we assumed that files with access probability 0 may actually be requested, which implies that the rate at which files with access probability p appear in the system can be any value between 0 and 0 and
For example, if files with access probability zero are never requested by the user, then λ2 is equal to
If all the files have access probabilities 0, then λ2=0 because we never prefetch the files with access probability 0. Therefore, our conclusion may be stated as follows:
For given p, λ, and
independent of the rate at which files with access probability p appear in the system, if λ′2<0, then prefetching all the files with access probability p minimizes the cost.
The number of files that are actually prefetched is determined by the rate at which files with access probability p appear in the system, we do not need to know that to minimize the cost.
For given p, λ, and
if λ′2≧{fraction (λ/p)}, the cost increases as λ′2 increases for λ2<{fraction (λ/p)}, therefore no files should be prefetched. If 0<λ′2<{fraction (λ/p)}, since the access probabilities of files in the system vary for different clients and with time in a real system, it is very hard to determine if λ2 would be greater than λ′2 by prefetching all the files with access probability p. Therefore, the lower cost can not be guaranteed at all times, and we choose not to prefetch any file in this case.
The above result is for the case when pb>λs. If pb≦λs, (11) shows that
for all λ2, which means that the cost increases monotonically λ2 increases, therefore no files should be prefetched.
c) The Prefetch Threshold H
Let us now find the prefetch threshold H for the system with pb≦λs such that for p≧H, λ′2≦0 and the cost is minimized by prefetching all the files with access probabilities p. From equation (13), we obtain that λ′2≦0, i.e. (10) is maximized at λ2<0. if and only if
We then set the prefetch threshold to be
It's easy to prove that H is always greater than ρ. Thus, if p>H, then p>ρ, i.e., pb>λs. Therefore, equation (14) indicates that if the access probability p is greater than or equal to the threshold H, then λ′2≦0 according to (13). Moreover, following our previous analysis this implies that prefetching all the files with access probability p minimizes the cost for p≧H. The threshold H is plotted in FIG. 6 as a function of system utilization ρ for several different values of r where
and b=100.
FIG. 6 shows that as system load ρ increases, the prefetch threshold H tends to increase as well, which means that fewer files should be prefetched. But the increase is not monotonic for small values of
The reason for this is that, in those cases, when the load is low, prefetching does not save much time. As the load increases, it takes longer to transmit files and prefetch can save more time, therefore the threshold decreases. As the load continues to increase, prefetching files will add relatively long delay to the normal user requests, so the threshold needs to be increased again. We can prove that the threshold may decrease as p increases from zero, if and only if
and for fixed
the threshold is minimized at
Furthermore, by comparing the prefetch threshold at ρ=0 and at
we can show that for any
the maximum drop in the prefetch threshold value,
In both single and multi-user systems, for fixed
the higher the system capacity, the higher the prefetch threshold, because the savings of time is less in a faster system. However, only in the multi-user system is the prefetch threshold affected by system load.
d) The Upper Bound for the Prefetch Thresholds in Systems with Arbitrary Access Probability Distribution.
Up to now, we have been considering a system in which, at any time, the access probability of each file is either p or 0, where p is fixed within one system. The following theorem indicates that for an arbitrary distribution of access probabilities, where the access probability of each file in the system can be any value between 0 and 1, expression (15) gives an upper bound for the optimum prefetch threshold of this system. In other words, for any system, regardless of the actual distribution of the access probabilities, prefetching files whose access probability is greater than the system's prefetch threshold computed from (1 5) can always reduce the cost.
Theorem 1
Consider a system in which b, s, and λ and
are known. Let f(q) be the rate at which files with access probability q appear in the system, where
and 0<q≦1. Expression (15),
is an upper bound for the optimum prefetch threshold of this system.
This theorem can be proved based on our previous result. The details of the proof are given in appendix A. Unlike the system we studied previously, we assume that in this general system, files with access probability zero are never requested, hence we do not care about the value of f(0). As an example, we will next examine the case when
Studies have shown that a small percentage of the files available on a given server usually account for a large portion of accesses to the server [3, 4]. This implies that, in general, a small number of files in the system have large access probabilities, while most of the files have small access probabilities. To model this, we choose a simple function for f(q), namely we assume that the rate at which files with access probability q appear in the system is given by
where q ε(0,1] and λ is the arrival rate of the user requests.
In this example system, if we set the prefetch threshold as H(0<H≦1) and prefetch all the files with access probability greater than or equal to H, then
Among them,
are eventually used on average, hence λ=Hλ. Similar to our previous analysis, we compute the average cost of each user request as
Equation (16) is plotted in FIG. 7 as a function of the prefetch threshold H for different values of user request arrival rate λ. Taking the derivative of equation (16) with respect to H yields
FIG. 7 shows that the cost is minimized at
Let us evaluate
for several system loads and
to determine the optimum value of H in each case such that the cost is minimized. The results are compared with the upper bound obtained using (15) in FIG. 8, where the upper bounds are shown as smooth lines and the results for
are shown as points connected with lines.
e) The Prefetch Threshold for the System with Nonzero Start Up Delay
So far, we have been studying the system with zero startup time. For the system with a startup time t0 greater than zero, we can prove in a similar way that the prefetch threshold should be set to the following
In summary, the prefetch threshold module works in the following way. For given λ and
and a file with access probability pi>0, compute H using equation (17). The file is prefetched if and only if pi is greater than or equal to the H obtained.
f) The Prefetch Threshold for More General Systems.
Up to now, we have been assuming that all users in the system have the same αT and αB. In the real world, people value their time differently; therefore, αT can vary from user to user. Since generally the same network carrier company supports users who are sharing the same network, we can assume that αB is the same throughout the system. In addition, after some users have started prefetching files, others can't use (15) to determine the prefetch thresholds. This is because the distribution of access probabilities in the system is very complex, and a user may be unable to find the user request rate λ, from the current λ1 and λ2. In the following, we study the system with users who have different αT's and in which some users have already started prefetching files. Again, we assume the startup time is zero.
Assume there are n users in the system and the cost of a time unit for user i is αTi. In addition, we assume that user i issues requests at rate λi. Accordingly, the rate of normal requests from user i is λi
Assume that for each user in the system except user k, the current prefetch request rate λi
for all possible values of λk
When λ′k2<0, we can compute the prefetch threshold Hk, which is given by
Since user k has not prefetched any file, we have that λk
and then (19) is equivalent to
Similar to the proof for the previous system, we can show that for fixed λi
Experimental Results
Up to this point we have explained the algorithms behind the operation of our invention. We have presented a prediction algorithm for web browsing that can be used on both the server and client. It is important to understand how the access probabilities from the server and client should be used, and how this use affects the system performance. Now, we show the experimental results obtained from the UCLA (University of California Los Angeles Computer Science (CS) department web server's log file taken during the period from April 11th to June 5th of 1996. The log consists of more than 300,000 actual user accesses. In the experiments, we concentrated on two representative pages: the CS department home page and the home page for TAs (teaching assistants). More precisely, only when one of these two pages was being viewed, was the prediction algorithm activated and the program used to prefetch files linked to the page. And only when a file linked to one of these two pages was requested, did the program check if it had been prefetched. The CS department home page contains links to research, students, faculty, and other general information home pages. These links are not updated very often. The TA home page has links to all the class home pages, which are updated frequently to include new assignments, handouts, etc. Therefore, simulations on these two pages indicate how well our prediction algorithm works on pages that are revisited frequently by some particular users and on other pages that are generally not revisited frequently. To study how the access probabilities from the server and the client affect the performance of prediction, we tested three cases. 1) Using only the access probabilities from the client site. 2) Using only the access probabilities from the server site. 3) Merging the access probabilities from server and client as designed in our original algorithm. Namely, assume A is the current page; if CA<5$, then use the access probabilities from the server for the links on page A, otherwise use the access probabilities from the client. A fixed prefetch threshold was used in each experimental run and varied for different runs. All the files with access probability greater than or equal to the prefetch threshold were prefetched. We measured several different system parameters. If the user requested a page, and the request was satisfied by a prefetched copy of the file, we scored the result as a hit. The hit rate is defined as the ratio of the number of hits over the total number of user requests. For a fixed number of user requests, the higher the hit rate, the more time is saved by prefetching. The successful prediction rate is the probability of a prefetched file being eventually used. A high successful prediction rate indicates that less bandwidth is wasted due to prefetching unused files. FIGS. 9-12 show the successful prediction rate and hit rate obtained for the pages linked to the CS home page and the TA home page respectively with prefetch thresholds between 0.01-0.9 for the three cases described above.
As shown in FIGS. 9 and 10 for both home pages, using only access probabilities on the client site yields. successful prediction rates of around 70% when the threshold is just slightly higher than zero. As the threshold increases, the successful prediction rate tends to increase. In FIG. 9, the tails of the top two curves drop because there were very few files prefetched at those threshold values, and the sample size was very small. Each curve ends at the point where no file is prefetched for larger prefetch thresholds. Although the successful prediction rates are lower when the access probabilities from the server were used, the result is good given that these probabilities are based on the accesses from hundreds of other clients who are totally unrelated to the user. Without the access probabilities from the server, no prefetch is possible when the. user visits a page for the first few times. This is further supported by the hit rate distribution shown in FIGS. 11 and 12.
From FIGS. 11 and 12 we can see that, if the prediction algorithm is run only on the client site, the hit rate is not as good as the successful prediction rate. The reason for this is, in many cases, the user had not visited a page enough times and no file was prefetched from the page. On the other hand, by using only access probabilities from the server or merging those from server and client, we obtain much higher hit rates. In addition, for small prefetch thresholds, these two curves are very close because prefetches invoked due to high access probabilities at the client site only contribute a small portion of the total number of prefetches.
In FIGS. 11 and 12, the hit rate of the pages linked to TA home page is lower than 40% when the prefetch threshold is zero. This is because, although the TA home page is the main place where requests to class home pages are generated, some students access a class home page using bookmarks or from pages other than the TA home page, such as the instructor's home page. In those cases no prefetch was performed in our experiment since we did not apply the prefetch algorithm to pages other than the TA and CS home pages. The same problem exists for pages linked to the CS home page but is less significant. For the same reason, the hit rate in a real system should be higher than what is shown in FIGS. 11 and 12.
FIG. 13 shows the relation between the prefetch threshold and the average number of files prefetched for each user request, which indicates the amount of traffic increase in the entire system due to prefetching. When only the access probabilities from the client was used, this average number is very low, since the prediction was very accurate, and if the user had not visited the page at least 5 times, no link on it was prefetched. More files were prefetched for the other two cases, but still the average number of files prefetched for each user request is low. Comparing FIGS. 11 and 12 with FIG. 13, we can see that for a hit rate of more than 60%, the average number of files prefetched for each user request is less than two.
Implementation—a Prefetch Program
We have developed a program on PC Windows� system based on the real time prefetch scheme described in the last few sections. The program is integrated with the Netscape� browser through the Netscape� Client API (Application Programming Interface). When executed on a PC for the first time, it needs to register with the machine's Netscape� program as an http protocol handler. After that, each time the browser is opened, the prefetch program is started automatically. When the prefetch function is activated, the user may use the browser as usual. The Netscape� window looks the same, except that some icons will be added to the page being viewed to alert the user regarding the status of the links on that page. (see below)
In our program, whenever a new page is displayed, the status of each link on this page is checked by measuring the sum of the time needed to connect to the server and the time between sending out a header request and receiving the response from the server. The value obtained in this way is not very accurate and may vary with time. However, in general, it does indicate the quality of the link at that time.
If the user has downloaded some pages from the server recently, say in the last ten minutes, the average speed at which the files were downloaded is a better estimation of the actual link condition [1]. This link quality information is provided to the user through an icon placed next to the corresponding link. This can potentially reduce traffic on congested links, because most people would choose a faster link if several options are available. FIG. 15 shows the icons currently used in our program.
Basically, the mouth shape of an icon indicates whether a link is fast, slow, or in-between, and the hat indicates if a copy of the file is cached on the local computer. For example, the first icon 22 in FIG. 15 has a "smiley" face indicating that the connection is good. Requests to this server are expected to be satisfied very fast. The icon 24 below it shows not only that the link is fast, but also that the file is available on the local disk (presence of the hat). The last icon 26 in the second row indicates that the file is cached on the local disk, but it may be slow if you follow that link further to access other pages on that server. The icon 28 at the bottom indicates an error, for example the server is not reachable or the file was not found. After a file is prefetched, the icon next to the corresponding link will be switched to a face wearing a hat with the same mouth shape. FIG. 16 is a sample screen which demonstrates how the icons work.
One interesting thing we found from using this program is that the user tends to go to pages that have been prefetched, even though they would not have been interested in them had these pages not been prefetched. This is because prefetched files are fast to load, which means it does not take the user much time in case the page is not interesting. Moreover, if prefetching is carried out based on access probabilities from the server, then the user may read them out of curiosity, since prefetched pages are presumably popular among other users according to our prediction algorithm.
Many alterations and modifications may be made by those having ordinary skill in the art without departing from the spirit and scope of the present invention. The words used in this specification to describe the invention and its various embodiments are to be understood not only in the sense of their commonly defined meanings, but to include by special definition in this specification structure, material or acts beyond the scope of the commonly defined meanings. Thus if an element can be understood in the context of this specification as including more than one meaning, then its use in a claim must be understood as being generic to all possible meanings supported by the specification and by the word itself. The definitions of the words or elements of the following claims are, therefore, defined in this specification to include not only the combination of elements which are literally set forth, but all equivalent structure, material or acts for performing substantially the same function in substantially the same way to obtain substantially the same result.
In addition to the equivalents of the claimed elements, obvious substitutions now or later known to one with ordinary skill in the art are defined to be within the scope of the defined elements. The claims are thus to be understood to include what is specifically illustrated and described above, what is conceptually equivalent, what can be obviously substituted and also what essentially incorporates the essential idea of the invention. Those skilled in the art will appreciate that various adaptations and modifications of the just-described preferred embodiment can be configured without departing from the scope and spirit of the invention. The illustrated embodiment has been set forth only for the purposes of example and that should not be taken as limiting the invention. Therefore, it is to be understood that, within the scope of the appended claims, the invention may be practiced other than as specifically described herein.
This appendix constitutes a proof of Theorem 1.
Theorem 1
Consider a system in which b, s, and λ and
are known. Let f(q) be the rate at which files with access probability q appear in the system, where
and 0<q≦1. Expression (15),
is an upper bound for the optimum prefetch threshold of this system.
Proof: We assume f(q) is continuous. The proof is similar for f(q) discrete. Since f(q) is the rate at which files with access probability q appear in the system, for any h(0<h≦1), if all and only those files with access probability greater than or equal to h are prefetched, then the arrival rate of the prefetch requests is
hence, the normal requests arrive with rate
When the prefetch request rate is λ2, the average cost of each user request is given by
where, the same as in our previous analysis,
Assume that, by plugging b,s,λ, and
into (15), we obtain a value H′. Now we consider another system with the same b,s,λ, and
When the user is using a file, for each file in the new system, we set its access probability to H′ if and only if it is at least H′ when the same file is being used in the original system, otherwise we set the probability to 0. Since two system have the same b,s,λ, and
the prefetch threshold for the new system is H′ by (15). This implies that the average cost of a user request can be minimized by prefetching all the files with access probability H′. In this new system, let {overscore (λ)}2 be the corresponding prefetch request rate at which the cost is minimized. By our definition of the new system and the results above, the result is given by
Let Cnew(λ2) be the average cost of viewing a page when the prefetch rate is λ2. The analysis section above shows that
Based on equations (21) and (22), we take the derivative of equation (23) with respect to λ2 to obtain
Comparing equation (24) and (25) term wise yields the results
for 0≦λ2≦{overscore (λ)}2.
Since for 0≦λ2≦{overscore (λ)}2, H′≦h≦1. This implies that for H′≦h≦1 the average cost of viewing a file decreases as h decreases. Therefore the prefetch threshold which is going to minimize the cost in the original system must be less than or equal to H′. In other words, H′ obtained from (15) is the upper bound of the prefetch thresholds for the general systems with the same b,s,λ, and
[1] H. Balakrishnan, S. Seshan, M. Stemm, and R. H. Katz "Analyzing Stability in Wide-Area Network Performance," Proceedings of ACM SIGMETRICS Conference on Measurement & Modeling of Computer Systems, Seattle, Wash., USA, June 1997.
[2] A. Bestavros, "Speculative Data Dissemination and Service to Reduce Server Load, Network Traffic and Service Time for Distributed Information Systems," Proceedings of ICDE'96: The 1996 International Conference on Data Engineering, New Orleans, La., March 1996.
[3] A. Bestavros, "WWW Traffic Reduction and Load Balancing Through Server-Based Caching," IEEE Concurrency: Special Issue on Parallel and Distributed Technology, vol. 5, January-March 1997, pp. 56-67.
[4] J. S Gwertzman, "Autonomous Replication Across Wide-area Internetworks," Thesis, Harvard College, Cambridge, Mass., 1995.
[5] L. Kleinrock, Queueing Systems Vol 1: Theory, John Wiley & Sons, New York, N.Y., 1975.
[6] L. Kleinrock, Queueing Systems Vol 2: Computer Applications, John Wiley & Sons, New York, N.Y., 1975.
[7] E. Markatos, C. Chronaki, "A Top-10 Approach to Prefetching on the Web," Technical Report 173, ICS-FORTH, http://www.ics.forth.gr/proj/arch-vlsi/www.html, August 1996.
[8] V. N. Padmanabhan, J. C. Mogul, "Using Predictive Prefetching to Improve World Wide Web Latency," Computer Communication Review, July 1996, pp. 22-36.
[9] PeakJet Software Homepage, http://www.peak-media.com/PeakJet/PeakJet.html.
|Cited Patent
|Filing date
|Publication date
|Apr 28, 1995
|Sep 1, 1998
|Digital Equipment Corporation
|Method for predictive prefetching of information over a communications network
|Jun 7, 1995
|Sep 22, 1998
|Open Market, Inc.
|Method of providing internet pages by mapping telephone number provided by client to URL and returning the same in a redirect command by server
|May 7, 1997
|Mar 2, 1999
|International Business Machines Corporation
|System and method for predictive caching of information pages
|Jul 11, 1997
|Aug 31, 1999
|International Business Machines Corporation
|Parallel file system and method with quota allocation
|Jul 27, 1994
|Nov 2, 1999
|Instant Video Technologies Inc.
|System for distribution of interactive multimedia and linear programs by enabling program webs which include control scripts to define presentation by client transceiver
|Jan 15, 1998
|Jul 4, 2000
|Microsoft Corporation
|Method and apparatus for utility-directed prefetching of web pages into local cache using continual computation and user models
|Nov 26, 1997
|Oct 17, 2000
|Intel Corporation
|Method and apparatus for cache line prediction and prefetching using a prefetch controller and buffer and access history
|Aug 24, 1999
|Nov 21, 2000
|Wolfe; Mark A.
|Document retrieval system employing a preloading procedure
|Mar 26, 1997
|Jan 30, 2001
|International Business Machines Corporation
|Precaching data at an intermediate server based on historical data requests by users of the intermediate server
|Feb 6, 1998
|Jan 30, 2001
|Microsoft Corporation
|Method and apparatus for display of information prefetching and cache status having variable visual indication based on a period of time since prefetching
|Baskett et al., "The AO Inversion Model of Program Paging Behavior", Computer Science DepartmenT-Stanford University, California, pp. 1-30, Nov. 1976.*
|Baskett et al., "The AO Inversion Model of Program Paging Behavior", Computer Science DepartmenT—Stanford University, California, pp. 1-30, Nov. 1976.*
|Bestavros, Azer, "Speculative Data Dissemination and Service to Reduce Server Load, Network Traffic and Service Time in Distributed Information Systems", Proceedings of ICDE 96: The International Conference on Data Engineering, LouisIana, pp. 1-8, Mar. 1996.
|Citing Patent
|Filing date
|Publication date
|Dec 10, 1999
|Apr 22, 2003
|Sun Microsystems, Inc.
|Client controlled pre-fetching of resources
|Feb 23, 1999
|Sep 2, 2003
|Parsec Sight/Sound, Inc.
|System and method for manipulating a computer file and/or program
|Oct 19, 1998
|Jun 15, 2004
|International Business Machines Corporation
|Multi-target links for navigating between hypertext documents and the like
|Jul 19, 2000
|Aug 30, 2005
|International Business Machines Corporation
|Method and system for indicating document traversal direction in a hyper linked navigation system
|Nov 30, 2000
|Sep 20, 2005
|Nec Corporation
|Content supply apparatus for transmitting the content to a portable terminal in transmitted divided units and prefetching other contents from the transmitted divided units
|Sep 30, 1998
|Jan 31, 2006
|Lucent Technologies Inc.
|Method and apparatus for prefetching internet resources based on estimated round trip time
|May 3, 2000
|Feb 28, 2006
|Microsoft Corporation
|Method and system for accessing web pages in the background
|Oct 18, 2000
|Apr 4, 2006
|Rose Blush Software Llc
|Method for queued overlap transfer of files
|Apr 8, 2002
|Jul 11, 2006
|Microsoft Corporation
|Caching techniques for streaming media
|Nov 15, 1999
|Jul 25, 2006
|Trilogy Development Group, Inc.
|Dynamic content caching framework
|Mar 1, 2004
|Sep 12, 2006
|Pericom Semiconductor Corp.
|Dynamic PCI-bus pre-fetch with separate counters for commands of commands of different data-transfer lengths
|Jul 22, 2003
|Jan 16, 2007
|International Business Machines Corporation
|Isolated ordered regions (IOR) prefetching and page replacement
|Apr 22, 2003
|Feb 13, 2007
|Secure Resolutions, Inc.
|Software distribution via stages
|Apr 17, 2002
|Mar 20, 2007
|Honda Giken Kogyo Kabushiki Kaisha
|Computer system, a method and a program for providing a Web page appropriate to a user
|Mar 30, 2001
|Aug 21, 2007
|Xerox Corporation
|Systems and methods for identifying user types using multi-modal clustering and information scent
|Mar 31, 2006
|Mar 18, 2008
|Microsoft Corporation
|Decision-theoretic methods for identifying relevant substructures of a hierarchical file structure to enhance the efficiency of document access, browsing, and storage
|Dec 24, 2003
|Apr 1, 2008
|Intel Corporation
|Adaptive caching
|Apr 22, 2003
|Jul 15, 2008
|Secure Resolutions, Inc.
|Software administration in an application service provider scenario via configuration directives
|Jul 12, 2004
|Jul 7, 2009
|Netsuite, Inc.
|Phased rollout of version upgrades in web-based business information systems
|Jul 29, 2003
|Nov 10, 2009
|DMTTLicensing, LLC
|System and method for manipulating a computer file and/or program
|Nov 15, 2005
|Apr 6, 2010
|Microsoft Corporation
|UserRank: ranking linked nodes leveraging user logs
|Jun 20, 2001
|May 11, 2010
|At&T Intellectual Property I, L.P.
|System and method for server-based predictive caching of back-end system data
|Aug 26, 2004
|Jul 6, 2010
|International Business Machines Corporation
|System and method for look ahead caching of personalized web content for portals
|Mar 31, 2006
|Aug 3, 2010
|Spring Communications Company L.P.
|Mobile device catalog and caching and architecture
|May 25, 2004
|Feb 1, 2011
|Symantec Operating Corporation
|Probabilistic data locating in sparse data images
|Jan 30, 2004
|Apr 26, 2011
|Roke Manor Research Limited
|Method for secure communication over a public data network via a terminal that is accessible to multiple users
|Feb 21, 2006
|May 3, 2011
|Strangeloop Networks, Inc.
|Identifying, storing, and retrieving context data for a network message
|Feb 23, 2007
|May 10, 2011
|Microsoft Corporation
|HTTP acceleration by prediction and pre-fetching
|Jun 4, 2009
|Jun 28, 2011
|Netsuite, Inc.
|Phased rollout of version upgrades in web-based business information systems
|Jan 24, 2007
|Sep 6, 2011
|Microsoft Corporation
|Customizing a menu in a discovery interface
|Jul 9, 2004
|Sep 20, 2011
|Microsoft Corporation
|System and method for dynamically generating a selectable search extension
|Jan 31, 2008
|Oct 11, 2011
|Strangeloop Networks, Inc.
|In-line network device for storing application-layer data, processing instructions, and/or rule sets
|Jun 27, 2006
|Jan 24, 2012
|Qurio Holdings, Inc.
|High-speed WAN to wireless LAN gateway
|Jan 24, 2007
|Feb 7, 2012
|Microsoft Corporation
|Customizing application page loading in a discovery interface
|Mar 6, 2009
|Feb 14, 2012
|Microsoft Corporation
|System and method for virtual folder sharing including utilization of static and dynamic lists
|Aug 6, 2007
|Mar 20, 2012
|Xerox Corporation
|Systems and methods for identifying user types using multi-modal clustering and information scent
|Jan 12, 2007
|Apr 24, 2012
|Strangeloop Networks, Inc.
|Asynchronous context data messaging
|Feb 28, 2006
|Jun 19, 2012
|Rose Blush Software Llc
|Method for queued overlap transfer of files
|Mar 30, 2007
|Jun 26, 2012
|Microsoft Corporation
|Virtual address bar user interface control
|Sep 26, 2011
|Jul 10, 2012
|Limelight Networks, Inc.
|Acceleration of web pages access using next page optimization, caching and pre-fetching
|Jun 21, 2006
|Aug 14, 2012
|Qurio Holdings, Inc.
|Application state aware mediating server
|Sep 26, 2011
|Aug 21, 2012
|Limelight Networks, Inc.
|Acceleration and optimization of web pages access by changing the order of resource loading
|Aug 2, 2010
|Nov 27, 2012
|Limelight Networks, Inc.
|Systems and methods thereto for acceleration of web pages access using next page optimization, caching and pre-fetching techniques
|May 29, 2012
|Jan 1, 2013
|Limelight Networks, Inc.
|Java script reductor
|May 14, 2012
|Jan 1, 2013
|Limelight Networks, Inc.
|Systems and methods thereto for acceleration of web pages access using next page optimization, caching and pre-fetching techniques
|Dec 29, 2006
|May 21, 2013
|Akamai Technologies, Inc.
|Site acceleration with content prefetching enabled through customer-specific configurations
|Apr 28, 2008
|Jun 11, 2013
|Yahoo! Inc.
|Providing relevant non-requested content to a mobile device
|Jun 7, 2011
|Jul 9, 2013
|NetSuite Inc.
|Simultaneous maintenance of multiple versions of a web-based business information system
|May 29, 2012
|Jul 23, 2013
|Limelight Networks, Inc.
|Indiscriminate virtual containers for prioritized content-object distribution
|Jan 30, 2012
|Aug 13, 2013
|Radware Ltd.
|Asynchronous context data messaging
|Sep 29, 2003
|Sep 3, 2013
|International Business Machines Corporation
|Incentive-based website architecture
|Mar 26, 2012
|Oct 1, 2013
|Ebay Inc.
|Method and system to pre-fetch data in a network
|Jul 13, 2010
|Oct 8, 2013
|Microsoft Corporation
|System and method for user modification of metadata in a shell browser
|Sep 6, 2011
|Dec 17, 2013
|Radware, Ltd.
|In-line network device for storing application-layer data, processing instructions, and/or rule sets
|Dec 14, 2010
|Dec 24, 2013
|Microsoft Corporation
|Address bar user interface control
|May 3, 2012
|Apr 15, 2014
|Rose Blush Software Llc
|Method for queued overlap transfer of files
|Apr 22, 2005
|Apr 22, 2014
|Microsoft Corporation
|Save preview representation of files being created
|Jun 6, 2006
|May 20, 2014
|Yahoo! Inc.
|Providing relevant non-requested content to a mobile device
|Feb 3, 2014
|Jun 24, 2014
|Nextbit Systems Inc.
|Generating prefetching profiles for prefetching data in a cloud based file system
|Feb 21, 2012
|Jul 29, 2014
|Blackberry Limited
|Method for pre-fetching data chunks of an email attachment on a portable electronic device
|Jul 3, 2013
|Oct 14, 2014
|International Business Machines Corporation
|Incentive-based website architecture
|Jun 10, 2010
|Oct 28, 2014
|Qualcomm Incorporated
|Pre-fetching information based on gesture and/or location
|Dec 19, 2011
|Nov 4, 2014
|Qurio Holdings, Inc.
|High-speed WAN to wireless LAN gateway
|Jan 21, 2011
|Dec 9, 2014
|Nec Corporation
|Data access location selecting system, method, and program
|May 24, 2012
|Dec 23, 2014
|At&T Intellectual Property I, L.P.
|Methods and systems for electronic data exchange utilizing centralized management technology
|Nov 21, 2006
|Jan 27, 2015
|Blackberry Limited
|Adjustable download rate for a portable electronic device
|Oct 9, 2009
|Feb 3, 2015
|Ricoh Co., Ltd.
|Method and apparatus for secure and oblivious document matching
|Jul 26, 2005
|Feb 10, 2015
|International Business Machines Corporation
|Parsing emails
|Aug 21, 2008
|Mar 3, 2015
|Microsoft Corporation
|Metadata editing control
|Jun 10, 2013
|Apr 14, 2015
|NetSuite Inc.
|Simultaneous maintenance of multiple versions of a web-based business information system
|Jul 19, 2013
|Apr 21, 2015
|Limelight Networks, Inc.
|Dynamically selecting between acceleration techniques based on content request attributes
|May 29, 2012
|Jun 16, 2015
|Limelight Networks, Inc.
|Chronological-progression access prioritization
|Nov 21, 2006
|Jun 30, 2015
|Blackberry Limited
|Method for receiving email attachment on a portable electronic device
|Sep 2, 2011
|Jul 21, 2015
|International Business Machines Corporation
|Performing index scans in a database
|Jun 20, 2012
|Sep 29, 2015
|Google Inc.
|Notifications user interface
|Aug 28, 2013
|Dec 22, 2015
|Paypal, Inc.
|Method and system to pre-fetch data in a network
|Apr 30, 2013
|Jan 19, 2016
|Qualcomm Incorporated
|Web acceleration based on hints derived from crowd sourcing
|Sep 7, 2012
|Mar 22, 2016
|Radware, Ltd.
|Mobile resource accelerator
|Dec 19, 2008
|May 10, 2016
|Velocee Ltd.
|Optimizing content and communication in multiaccess mobile device exhibiting communication functionalities responsive of tempo spatial parameters
|Aug 30, 2005
|Jun 7, 2016
|Microsoft Technology Licensing, Llc
|System and method for filtering and organizing items based on metadata
|Apr 26, 2010
|Jun 7, 2016
|Microsoft Technology Licensing, Llc
|System and method for filtering and organizing items based on common elements
|Sep 9, 2004
|Aug 16, 2016
|Hitachi Maxell, Ltd.
|Program, recording medium, and reproducing apparatus
|Nov 27, 2012
|Sep 27, 2016
|International Business Machines Corporation
|Managing cache at a computer
|Aug 17, 2011
|Oct 11, 2016
|Salesforce.Com, Inc.
|Method and system for providing information to a mobile handheld device from a database system
|Jan 24, 2014
|Oct 18, 2016
|Netapp, Inc.
|Methods for combining access history and sequentiality for intelligent prefetching and devices thereof
|Mar 28, 2011
|Nov 1, 2016
|Google Inc.
|Smart cache warming
|Oct 13, 2014
|Nov 1, 2016
|Qurio Holdings, Inc.
|High-speed WAN to wireless LAN gateway
|Apr 8, 2011
|Nov 8, 2016
|University Of Washington Through Its Center For Commercialization
|Systems and methods for file access auditing
|Jan 25, 2012
|Jan 10, 2017
|Radware Ltd.
|System and method for presenting content in a client/server environment
|May 18, 2011
|Jan 17, 2017
|Radware Ltd.
|Accelerating HTTP responses in a client/server environment
|Aug 9, 2013
|Feb 7, 2017
|Google Inc.
|Preloading content for requesting applications
|May 7, 2014
|May 30, 2017
|Razer (Asia-Pacific) Pte. Ltd.
|Optimizing gaming applications accessed by electronic devices
|Sep 30, 2013
|Jun 13, 2017
|Razer (Asia-Pacific) Pte. Ltd.
|Data caching among interconnected devices
|Nov 30, 2000
|Jun 7, 2001
|Satoshi Shimura
|Content supply apparatus and machine readable recording media for recording a program
|Apr 16, 2001
|Jan 17, 2002
|Mark Vange
|System and method for network caching
|Aug 20, 2001
|Sep 5, 2002
|Thomas Schaeck
|Server-side optimization of content delivery to clients by selective in-advance delivery
|Apr 17, 2002
|Nov 7, 2002
|Michitada Kameoka
|Computer system, a method and a program for providing a Web page appropriate to a user
|Mar 30, 2001
|Jan 23, 2003
|Xerox Corporation
|Systems and methods for identifying user types using multi-modal clustering and information scent
|Aug 9, 2002
|Oct 23, 2003
|Secure Resolutions, Inc.
|Singularly hosted, enterprise managed, plural branded application services
|Apr 8, 2002
|Nov 20, 2003
|Microsoft Corporation
|Caching techniques for streaming media
|Jan 31, 2003
|Dec 4, 2003
|Khan Mohammed Noshad
|Configurable data processor with multi-length instruction set architecture
|Apr 22, 2003
|Dec 18, 2003
|Secure Resolutions, Inc.
|Executing software in a network environment
|Apr 22, 2003
|Dec 25, 2003
|Secure Resolutions, Inc.
|Software administration in an application service provider scenario via configuration directives
|Apr 22, 2003
|Jan 8, 2004
|Secure Resolutions, Inc.
|Distributed server software distribution
|Apr 22, 2003
|Jan 29, 2004
|Secure Resolutions, Inc.
|Software distribution via stages
|Jul 29, 2003
|Feb 5, 2004
|Hair Arthur R.
|System and method for manipulating a computer file and/or program
|Nov 1, 2002
|May 6, 2004
|Sethi Bhupinder S.
|Method for prefetching Web pages to improve response time networking
|Apr 22, 2003
|Aug 5, 2004
|Secure Resolutions, Inc.
|Fault tolerant distributed computing applications
|Mar 11, 2004
|Dec 23, 2004
|International Business Machines Corporation
|Profiling data in a data store
|Jul 22, 2003
|Jan 27, 2005
|Ting Edison Lao
|Isolated ordered regions (ior) prefetching and page replacement
|Jan 30, 2004
|Jan 27, 2005
|Beesley Richard Craig
|Secure network browsing
|Sep 29, 2003
|Mar 31, 2005
|Selby David A.
|Incentive-based website architecture
|Sep 9, 2004
|Apr 21, 2005
|Hitachi, Ltd.
|Program, recording medium, and reproducing apparatus
|Jun 22, 2004
|May 19, 2005
|Doug Dillon
|Systems and methods for accelerating data retrieval
|Dec 24, 2003
|Jun 30, 2005
|Komarla Eshwari P.
|For adaptive caching
|Apr 19, 2005
|Aug 25, 2005
|Microsoft Corporation
|Extensible creation and editing of collections of objects
|Aug 1, 2005
|Dec 8, 2005
|Microsoft Corporation
|Accessing web pages in the background
|Jul 12, 2004
|Jan 12, 2006
|David Lipscomb
|Phased rollout of version upgrades in web-based business information systems
|Feb 28, 2006
|Jul 27, 2006
|Rose Blush Software Llc
|Method for queued overlap transfer of files
|Mar 31, 2006
|Aug 3, 2006
|Microsoft Corporation
|Decision-theoretic methods for identifying relevant substructures of a hierarchical file structure to enhance the efficiency of document access, browsing, and storage
|Apr 27, 2006
|Nov 23, 2006
|International Business Machines Corporation
|Method and apparatus for processing user's files
|Jun 10, 2005
|Dec 14, 2006
|Nokia Corporation
|System and method for creating and utilizing context-sensitive popularity data
|Jul 26, 2005
|Feb 1, 2007
|Yen-Fu Chen
|Method for parsing emails
|Jul 26, 2005
|Feb 15, 2007
|Yen-Fu Chen
|Method for managing email response history
|Dec 21, 2006
|May 10, 2007
|Secure Resolutions, Inc.
|Software distribution via stages
|Nov 15, 2005
|May 17, 2007
|Microsoft Corporation
|UserRank: ranking linked nodes leveraging user logs
|Dec 29, 2006
|Jul 5, 2007
|Akamai Technologies, Inc.
|Site acceleration with content prefetching enabled through customer-specific configurations
|Mar 30, 2007
|Jul 19, 2007
|Microsoft Corporation
|Virtual Address Bar User Interface Control
|Feb 21, 2006
|Aug 30, 2007
|Kent Alstad
|Storing and retrieving user context data
|Jan 12, 2007
|Sep 6, 2007
|Kent Alstad
|Asynchronous Context Data Messaging
|Mar 15, 2007
|Sep 20, 2007
|Digital River, Inc.
|Page Builder System and Method
|Aug 6, 2007
|Nov 29, 2007
|Xerox Corporation
|Systems and methods for identifying user types using multi-modal clustering and information scent
|Nov 21, 2006
|May 22, 2008
|Dan Dumitru
|Adjustable Download Rate for a Portable Electronic Device
|Nov 21, 2006
|May 22, 2008
|Dan Dumitru
|Method for Receiving Email Attachment on a Portable Electronic Device
|Jan 31, 2008
|May 22, 2008
|Strangeloop Networks, Inc.
|In-Line Network Device for Storing Application-Layer Data, Processing Instructions, and/or Rule Sets
|Jan 24, 2007
|May 29, 2008
|Microsoft Corporation
|Customizing application page loading in a discovery interface
|Jan 24, 2007
|May 29, 2008
|Microsoft Corporation
|Customizing a menu in a discovery interface
|Jan 22, 2007
|Jul 24, 2008
|Jennings Raymond B
|Methods and Apparatus For Improving Interactions Between Multi-Server Web Environments and Web Browsers
|Jan 23, 2007
|Jul 24, 2008
|Microsoft Corporation
|Providing dynamic content in a user interface in an application
|Apr 28, 2008
|Aug 21, 2008
|Yahoo! Inc.
|Providing relevant non- requested content to a mobile device
|Feb 23, 2007
|Aug 28, 2008
|Microsoft Corporation
|HTTP acceleration by prediction and pre-fetching
|Aug 10, 2007
|Feb 12, 2009
|Strangeloop Networks, Inc.
|Cache expiry in multiple-server environment
|Feb 3, 2006
|Mar 12, 2009
|Matsushita Electric Industrial Co., Ltd.
|Communication method, moving picture reproduction device, and internet connection device
|Aug 6, 2008
|Oct 8, 2009
|Strangeloop Networks Inc.
|Partial Content Caching
|Jun 4, 2009
|Oct 22, 2009
|Netsuite, Inc.
|Phased rollout of version upgrades in web-based business information systems
|Apr 20, 2009
|Nov 5, 2009
|Strangeloop Networks, Inc.
|Extensible, Asynchronous, Centralized Analysis And Optimization Of Server Responses To Client Requests
|Oct 4, 2008
|Apr 8, 2010
|Microsoft Corporation
|Face alignment via component-based discriminative search
|Dec 19, 2008
|Jun 24, 2010
|David Haas
|Optimizing content and communication in multiaccess mobile device exhibiting communication functionalities responsive of tempo spatial parameters
|May 1, 2009
|Nov 4, 2010
|International Buisness Machines Corporation
|Prefetching content from incoming messages
|Jul 13, 2010
|Nov 4, 2010
|Microsoft Corporation
|System and method for user modification of metadata in a shell browser
|Jul 6, 2010
|Nov 11, 2010
|Brian Mark Shuster
|Method, apparatus and system for hosting information exchange groups on a wide area network
|Aug 2, 2010
|Feb 3, 2011
|FasterWeb, Ltd.
|Systems and Methods Thereto for Acceleration of Web Pages Access Using Next Page Optimization, Caching and Pre-Fetching Techniques
|Aug 2, 2010
|Feb 3, 2011
|FasterWeb, Ltd.
|Systems and Methods for Acceleration and Optimization of Web Pages Access by Changing the Order of Resource Loading
|Dec 14, 2010
|Apr 7, 2011
|Microsoft Corporation
|Address bar user interface control
|Oct 9, 2009
|Apr 14, 2011
|Stork David G
|Method and apparatus for secure and oblivious document matching
|Feb 24, 2011
|Jun 16, 2011
|Microsoft Corporation
|Utilizing virtual folders
|Mar 18, 2011
|Sep 22, 2011
|Strangeloop Networks Inc.
|Automated Optimization Based On Determination Of Website Usage Scenario
|Jun 10, 2010
|Dec 15, 2011
|Qualcomm Incorporated
|Pre-fetching information based on gesture and/or location
|Aug 17, 2011
|Aug 16, 2012
|Salesforce.Com, Inc.
|Method and system for providing information to a mobile handheld device from a database system
|Jan 21, 2011
|Feb 14, 2013
|Nec Corporation
|Data access location selecting system, method, and program
|Sep 9, 2011
|Mar 14, 2013
|Microsoft Corporation
|Content User Experience
|Nov 27, 2012
|Apr 4, 2013
|International Business Machines Corporation
|Managing cache at a computer
|Oct 12, 2012
|Apr 18, 2013
|Autodesk, Inc.
|Real-time scrubbing of online videos
|Apr 8, 2011
|Aug 1, 2013
|Tadayoshi Kohno
|Systems and methods for file access auditing
|Nov 6, 2013
|May 15, 2014
|Electronics And Telecommunications Research Institute
|Router and operating method thereof
|Dec 20, 2012
|Jun 26, 2014
|Alcatel-Lucent Usa Inc.
|Methods and systems for loading content in a network
|Mar 31, 2014
|Jul 31, 2014
|Ebay Inc.
|Method and system to pre-fetch data in a network
|Mar 31, 2014
|Jul 31, 2014
|Ebay Inc.
|Method and system to pre-fetch data in a network
|Jun 12, 2013
|Dec 18, 2014
|Microsoft Corporation
|Prefetching content for service-connected applications
|Jul 31, 2014
|Feb 5, 2015
|Opanga Networks, Inc.
|Pre-delivery of content to a user device
|Oct 20, 2014
|Apr 23, 2015
|Seungil Kim
|Apparatus and method for loading web page
|Jan 24, 2014
|Jul 30, 2015
|Netapp, Inc.
|Methods for combining access history and sequentiality for intelligent prefetching and devices thereof
|Aug 24, 2015
|Dec 17, 2015
|Akamai Technologies, Inc.
|Site acceleration with content prefetching enabled through customer-specific configurations
|Dec 17, 2004
|Dec 2, 2009
|Self-adaptive caching
|Oct 24, 2012
|Jul 8, 2015
|Incoming Pty Ltd
|Mobile content delivery system with recommendation-based pre-fetching
|U.S. Classification
|709/203, 709/219
|International Classification
|Cooperative Classification
|European Classification
|Aug 27, 1998
Owner name: REGENTS OF THE UNIVERSITY OF CALIFORNIA, CALIFORNI
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:JIANG, ZHIMEI;KLEINROCK, LEONARD;REEL/FRAME:009421/0968
Effective date: 19980813
|Oct 8, 2002
|Certificate of correction
|Nov 23, 2005
|Maintenance fee reminder mailed
|May 8, 2006
|Reinstatement after maintenance fee payment confirmed
|Jul 4, 2006
|Expired due to failure to pay maintenance fee
Effective date: 20060507
|Jul 25, 2006
|Surcharge for late payment
|Jul 25, 2006
|Fee payment
Year of fee payment: 4
|Sep 25, 2006
|Patent reinstated due to the acceptance of a late maintenance fee
Effective date: 20060927
|Nov 9, 2009
|Fee payment
Year of fee payment: 8
|Nov 7, 2013
|Fee payment
Year of fee payment: 12


text:
What is JotForm?
JotForm is a free online form builder which helps you create online forms without writing a single line of code. No sign-up required.
At JotForm, we want to make sure that you're getting the online form builder help that you need. Our friendly customer support team is available 24/7.
We believe that if one user has a question, there could be more users who may have the same question. This is why many of our support forum threads are public and available to be searched and viewed. If you'd like help immediately, feel free to search for a similar question, or submit your question or concern.
currency picker widget not workingAsked by Innovate2012 on May 10, 2015 at 06:35 PM
I was trying to install the currency picker widget on a form and unable to get it functioning.
The form name is:
Clone of Equi-Tape Advantage Product Order Form
Your assistance is most appreciated.
Thank you,
JotForm Support
Hi Yvonne,
I was able to reproduced the problem also when I made a test on my end.
After adding the Currency Picker widget to the form, the configuration wizard was not triggered. So the widget could be setup properly.
There must be an issue with the widget at this time. Unfortunately, I could not find an alternative workaround that could work as a currency picker.
I will submit a bug ticket report to our higher team support regarding this finding on the Currency Picker Widget.
We will notify you here for any update on the status or when fixed.
I suggest to not use the widget for now since it is not working at all.
JotForm Support
The currency picker has been fixed, and it should work properly now.
We apologize for the inconvenience caused.
Please let us know if you have further concerns.

subset: commoncrawl


text:
All her life, Robin Miller, writing as Robin Caroll, has been writing. Whether in diaries, journals, short stories, poetry, or fiction, she's been drawn to the storytelling aspect in life. She loves everything about books--the way they look, the way they smell, the way they feel. The author of 9 books and counting, Robin and her family proudly live in the South, with all its hospitality and days-of-ole traditions.
The "Art" of Writing
Okay, so I'm not artistically inclined. At all. My stick people aren't even recognizable. Seriously. Just ask my 7 and 9 yr olds--they'll tell you Mommy can't draw. Or paint a picture. Or sculpt. Or do pottery. Or knit. Nope, Robin can't do any of that. My creativity is limited to writing stories and scrapbooking. And when I look at the spaces I have that I "create" in, I noticed something...I do my best when I'm surrounded by a mess.
Thus, the mess you see in the picture of my desk. I have several writing books open, papers everywhere with notes on research all over the place, and general disorder prevails. But I do my best work in the mess.
I've seen writers' desks that are pristine. Not even neat piles of books or notes marring the clean surface. Just a keyboard and monitor. That would drive me up a wall. So I have to wonder...why is it I can't work unless everything's all over the place? After thinking about it some, I came to a conclusion.
My life is chaotic, so I can't function within the confines of neatness. I have children--they are constantly around, talking and making noise. Thus, I can't write in silence. I write for two publishers, so I'm always on deadline. Thus, I can't take the time to clean up my desk, and if I did, I'd never be able to find vital information when I needed it. I'm the conference director for ACFW and that involves almost daily interruptions. Sometimes hourly. Thus, I can't isolate myself and focus strictly on one thing at a time.
And I realized something else...I write romantic suspense, which means I'm going to put a lot of conflict and tension in my stories. (And as many dead bodies as I can work in) My characters' lives aren't neat and orderly. They might think they are, but I assure you they aren't.
I now accept that I thrive in disarray. Something about clutter and piles comforts my inner muse. Opens up my creativity. Lets the imagination wander.
So don't ever feel bad that your desk is cluttered or you have piles of papers and books around you. Embrace it. Enjoy it. You just might realize you're one of the few, the proud, the "creating in the disorderly."
by Robin Caroll
And PR representative Sadie Thompson is on the case. When she's assigned to investigate the damage to her employer's oil rigs, she knows it's her chance. Finally, she can prove she's left her "bad girl" past behind her. Yet someone wants the evidence to disappear—and is willing to threaten Sadie and Caleb, her recently paroled half brother, to make it happen. Caleb's parole officer, Jon Garrison, is watching them both closely, waiting for one of them to slip up. He doesn't trust Sadie—can she trust him? She needs Jon's help, and has nowhere else to turn….
Wednesday, June 24, 2009
Guest blogger ~ Robin Caroll
6 comments:
Great article! My desk is also a mess. I'll clean it every once in a while, but, in a matter of less than a week, it's messy again. I couldn't keep my office clean if I tried! Blackmail sounds like it's a good book!ReplyDelete
This comment has been removed by the author.ReplyDelete
Thanks, Robin. It's nice to know I'm not alone in a messy desk. I try to keep it clean, but things keep piling up. I might need that note, and that slip of paper has a great inspirational quote. Yeah, things pile up. And multiply. :DReplyDelete
But what if it's my husband's desk that's cluttered?ReplyDelete
LOL...for a long time, I thought I was the only one who could "function" amid a mess. I've since learned a lot more people than I thought do that. I do TRY to clear it off in between books, but I'm accepting it will be a mess again within days.ReplyDelete
And my husband's desk is MUCH neater than mine. Then again, he isn't "creating" over there. :D
Cool post Robin, thanks for sharing. It's funny that you posted on this topic because I just posted about how I feel more free to create in a clean space. Thanks God for diversity! Here's the link to my blog if you want to check it out http://lifeink.wordpress.com/2009/06/16/messes/.ReplyDelete
Maybe I should try crossing over :).


text:
Pluto`s 2 moons to get new names through contest
Astronomers have launched a campaign asking the public for suggestions to name the two moons of Pluto, discovered over the past two years.
London: Astronomers have launched a campaign asking the public for suggestions to name the two moons of Pluto, discovered over the past two years.
Pluto is the Roman equivalent of the Greek's Hades, lord of the underworld, and its three bigger moons have related mythological names: Charon, the ferryman of Hades; Nix for the night goddess; and the multi-headed monster Hydra.
The two unnamed moons - no more than 20 miles across - will also take their names from the underworld myth. At the moment they go by the bland titles of P4 and P5.
Online voting will last two weeks, ending on February 25.
Twelve choices are available at the website http://www.plutorocks.com and more suggestions are welcome, but they need to come from Greek or Roman mythology and deal with the underworld, the Telegraph reported.
Among the choices suggested so far are: Hercules, the hero who slew Hydra; Obol, the coin put in the mouths of the dead as payment to Charon; Cerebrus, the three-headed dog guarding the gates of the underworld; Orpheus, the musician and poet who used his talents to get his wife, Eurydice, out of the underworld only to lose her by looking back: Eurydice; and Styx, the river to the underworld.
As of Monday afternoon, Styx was leading. The vote tally is updated hourly.
Mark Showalter, senior research scientist at SETI Institute's Carl Sagan Center in California and other astronomers, who discovered the two mini-moons using the Hubble Space Telescope will make the winning selections.
NASA's New Horizons spacecraft is en route to Pluto, arriving in 2015 on the first robotic flyby ever of the planetoid.
The winning moon names will need final approval by the International Astronomical Union.


text:
Find. Book. Pitchup.
- We make it a doddle to book campsites, glamping sites and caravan parks throughout the UK, Europe and the Americas.
- Trusted by over 1m holidaymakers from 99 countries.
- Choose and book in minutes, with instant confirmation and no booking fees.
Restaurant nearby: Touring caravan pitches and touring sites in IrvineView results on a map
3 bookable sites with touring pitches within 40 miles of your location
Tarbert, Argyll, Scotland Show on map (A)
|Electric hardstanding touring pitch
|4 x
|From £25/€27.86/A$41.04/US$32.49/CA$40.77/CHF30.76/kr268.53/kr207.99/kr261.23/kr3,378/$572.08/$20,833/PEN105.84/NZ$43.61/R420.17/zł119.05/R$102.17/Kč724.64/RSD3,333 per night
Glendaruel, Argyll, Scotland Show on map (B)Last booked
|Electric hardstanding touring pitch
|6 x
|From £20/€22.29/A$32.83/US$25.99/CA$32.62/CHF24.61/kr214.82/kr166.39/kr208.99/kr2,703/$457.67/$16,667/PEN84.67/NZ$34.89/R336.13/zł95.24/R$81.73/Kč579.71/RSD2,667 per night
Stirling, Stirlingshire, Scotland Show on map (C)Last booked
|Fully-serviced hardstanding touring pitch
|4 x
|From £19/€21.17/A$31.19/US$24.69/CA$30.98/CHF23.38/kr204.08/kr158.07/kr198.54/kr2,568/$434.78/$15,833/PEN80.44/NZ$33.15/R319.33/zł90.48/R$77.65/Kč550.72/RSD2,533 per night
Let us help you find more search results…
Want to see more? We're only showing the sites that are bookable on Pitchup.com.
Show campsites and holiday parks that aren't bookable through Pitchup.com...


text:
All the best,
The FEI Team
3 Ways To Find Forgotten Innovation
Amazon's Customer Centric Focus: Looking at the customer and innovation
Is Innovation More Than a Buzzword? Consumers are willing to pay 21% more for innovative brands
Building a Culture of Innovation: Innovate or die
|Steve Blank
4 Innovation Lessons From The History of Warfare
Trends In Online Advertising: Mobile will be key in the future
Disruption Does Not Define Success: 5 Principles that do
|John Crombie
The morning for the 2015 FEI EMEA conference started well with everyone turning up on time. A full day workshop was running in parallel with the Opening and morning presentations, and yet the room filled to capacity with more than 120 attending, and extra chairs were needed to be brought in to cater for the enthusiastic attendance.
A brief welcome from the Summit Chair, Hannes Erler (Swarovski) and a succinct introduction to our first speaker by Mike Hatrick (Climate-KIC) had us quickly move into the excellent selection of speakers lined up for the day, none who disappointed.
Separate notes are provided from the team on the speaker presentations. However with two speakers talking about Space during the day, that certainly was the topic that caught the attention of the attendees and many conversations were focused on the opportunities before us in this area. The understanding that New Space activities are shifting from science fiction to mainstream business took many of us by surprise, in a good way, and lots of excitement and discussion followed.
The other key theme for the day was about Passion & Purpose. The importance of this for both individuals and the organisation was mentioned a number of times by our speakers.
The end of the first day had us all 'getting connected' with the ChiefHumourOfficer.com team before networking and dinner. We all formed small informal groups and went off to explore Vienna to find somewhere for dinner, which was great for those who had flown in that morning and came straight into the conference.
contribution by Dr. Claire McGowan, CEO for SODA Inc. a business incubator based in NZ, and founder of www.ipmarket.com, an online community for entrepreneurs interested in IP.


text:
Choosing a Care Provider
If you are choosing care for yourself or a husband, wife, friend or relative, your first step should be to find out about the different types of care that are available. You will then be able to make an informed decision about the best care option for your specific circumstances, taking into account your care needs and, just as important, your personal preferences.
Everyone has different needs: Two people with the same care needs might be suited to entirely different types of care because of their individual preferences about the environment in which they would like that care to be received
Within this site, there are listed a number of UK registered nursing and caring agencies, all you have to do is enter a the area you want
Care Homes provide a Haven in the Community
- Maintaining a Registered Care Home Status
- Quality Assurance
- Working closely with other agents
- Direct referrals
- Referrals from Care Managers
Where next?
Welcome to the Website of South Woodham Ferrers First Responders. On the following pages you can learn about the First Responders and what they do in your community... Sites., South Woodham Ferrers First Responders Facts & Stats


text:
Construction Consumer Products Metals & Materials Safety Environment Transportation Chemicals Energy Medical Quality
Filtration Products for Stormwater Treatment
While there are many commercially available stormwater treatment products currently on the market, there is no universal testing standard that would allow the performance of these products to be accurately compared. A proposed new ASTM International standard will fill this need, providing a test method for stormwater treatment products that use filtration as a primary treatment process.
WK36628, Test Method for Measuring Effectiveness of Filtration Products for Stormwater Treatment, is currently being developed by Subcommittee C27.70 on Precast Concrete Products for Stormwater Management, part of ASTM International Committee C27 on Precast Concrete Products.
According to Peter Weiss, Ph.D., associate professor, Valparaiso University, and a C27.70 member, WK36628 will specifically consider how to determine the hydraulic characteristics of a filtration system by experimentally determining the hydraulic conductivity of the filter within the unit.
"The proposed standard will allow users to determine the hydraulic capacity of the filter system within the unit," says Weiss. "Users will be able to estimate how a stormwater treatment product that uses filtration as a primary means of treatment will perform in the field."
In addition to manufacturers of stormwater treatment products that utilize filtration to treat stormwater, the proposed standard will be used by experimental laboratories that are hired by manufacturers to perform independent tests on their products.
All interested parties are invited to participate in the standards developing activities of Subcommittee C27.70.
CONTACT Technical Information: Peter T. Weiss, Ph.D., P.E., Valparaiso University • Valparaiso, Ind. • Phone: 219-464-5220 | ASTM Staff: Joseph Hugo • Phone: 610-832-9740 | Upcoming Meeting: Dec. 4-5 • December Committee Week • Atlanta, Ga.


text: To get from L'Aquila to Castelvetrano by train you can catch one of the 1 trains that everyday travel between these two cities. The first train to Castelvetrano leaves from L'Aquila at 16:55 and the last train departs at 16:55. If you choose a local train the trip lasts on average 20:16 hours. For your trip from L'Aquila to Castelvetrano by train you can choose to leave from one of L'Aquila main stations: L'Aquila On Wanderio you can compare all schedules, fares and railway companies to Castelvetrano and book the best itinerary starting from L'Aquila.


text:
SE-DI2 has two individual channels of active direct interface. This pedal can work with 9V battery or 48V phantom power from linked amp or console. Link switch can select individual 2 ch mode or two balanced output link mode. Each channel has gain attenuator switch. Ground LIFT switch can isolate the ground level between amps or console. but phantom power not applied on ground lift mode.
myFXDB user reviews
No reviews at myFXDB yet
Most recent forum threads
No forum threads about this effect yet.
You can post questions, reviews, etc. in the main forum or data and pictures in the data dump forum.
Link to this page
Here's some code to post a link with image on forums, eBay, websites,...
|BB Code
|HTML Code
(sites, eBay,...)


text:
Flip through Channel Magazine online
Want to know more about where to get a copy of Channel? Click here.
Community News
Takapuna Beach looks set to go off this summer, with the new beachside hospitality complex opening, to add to the already quality range of eating and drinking out venues. A big drawcard looks set to be Tokyo Bay - new Japanese restaurant in the middle of The Strand complex, leading the charge to open this month. Tokyo Bay director Mark Smith has gone out on a limb by calling this 'the best spot for a restaurant in New Zealand'. It's hard to disagree. It's great to see Takapuna being 'turned around' to maximise the stunning beachscape and how well it is being done. This new spot will certainly be the hot place to meet, eat and drink this summer in Takapuna and should compliment the nearby stylish McKenzies Precinct perfectly, offering yet more hospitality options of the highest order here on the Shore. See you there!
Channel Magazine: Issuu 50 December 2014 | January 2015


text:
Women's Blue Clara Whispering Silk-satin Bikini Briefs
Crafted from lustrous silk satin and scalloped lace, Stella McCartney 's Clara Whispering bikini briefs are testament to the British designer's modern feminine aesthetic. Adored for its rich colour palette, this piece has a low rise and is partially lined with cotton for comfort and breathability. Color: blue


text:
Mango Agua Fresca
Recipe by Sharon123
This is a light, refreshing drink very popular in central America. A great thirst quencher! The recipe was inspired by Maria Gonzales, a street food vendor and Whole Planet Foundation borrower, who lives in León, Nicaragua, via the Whole Foods store.
Top Review by Gaia22
As offered, this drink really was light & refreshing! This is not a smoothie, but a perfectly balanced drink with the mango sweetness mellowed by the water & perked up by the lime juice for an everyday refreshing beverage. I used a very ripe sweet Honey Haitian Mango too. It was super fast & easy to make. I feel the future cravings for this refreshment on hot humid Summer days already! Thanks for sharing another fantastic beverage recipe! [Made & Reviewed for Everyday is a Holiday Tag]
See Discussion:3 Reviews
Ingredients Nutrition
- 1 ripe mango, peeled, pitted and cut into chunks
- 354.88 ml cold water (try this with club soda for a bubbly drink!)
- 2.46 ml freshly squeezed lime juice (or more to taste)
- 2.46 ml honey (to taste, or agave nectar)
- lime wedge (to garnish)
- mint leaf (to garnish)
Directions See How It's Made
- In a blender, combine mango and water and blend until smooth. Pour through a strainer into ice-filled glasses. You should end up with about 1 cup of liquid. Stir in lime juice and agave. Garnish with lime and mint, and serve.


text:
Available in a variety of colours, Proporta is offering you a second skin free with your Soft Feel Silicone Case (Apple 4G iPod nano). Second skins give you the opportunity to mix and match the colour of your dual protection and are colour-matched to the exact colours of the Apple 4G iPod nano range.
Click here to view the entire range of Proporta Soft Feel Silicone Cases (Apple 4G iPod nano).
- Free second skin for your Proporta Soft Feel Silicone Case
- Available in a range of colour options (matched to the 4G iPod nano range)
- Protection from impacts, scratches, dust and dirt
- Access all ports and controls inside the case
All items delivered to a UK address will be sent using the Royal Mail postal service, absolutely free of charge if your order is over £30. For orders under £20, shipping costs £2.95 per order. Other faster options are also available:
The free 'standard shipping' option takes between 2-4 working days from the time of dispatch, although we usually find it takes less.
All of our international orders are sent by standard mail worldwide. However, if you would like your order to be tracked, we will happily arrange for it to be sent via other recorded means. You can select the delivery option you would like at the checkout.
Please be aware that your order must be placed before 1pm to take advantage of the Next Day delivery option and this only applies to weekdays.
Returns Address
We hope you won't have to but sometimes it just can't be helped and you'll need to return an item. To make this as easy as possible, we have a freepost address label available to download / print at www.proporta.co.uk/returns
Alternatively you can send it back to the address below (but you'll need stamp):
Proporta - Returns Department
Unit 3 Woodingdean Business Park
Sea View Way
To check full details of our returns policy, please visit our Help and Support pages


text:
Enter your email
Sounds like a goody. :) Will have to look into that, may just spark some story ideas.
I don't use it too often, just because most of my settings are international and historical, but it came in handy for researching the Chicago scenes in my fantasy Dreamers.
Minibox 3 Column Blogger Template by James William at
2600 Degrees


text:
Need direct lab tests in Henderson, NV? Simply order direct lab tests online and get tested at a lab in Henderson, NV (Find More Locations):
Why would I get a Direct Labs Test?
A Direct Labs Test is a process by which people can order labs directly online. People in Henderson, NV order a Direct Labs Test for general screening or to track their health over time with lab testing.
How much does a Direct Labs Test cost?
Our prices to order a Direct Labs Test in Henderson, NV start at under $50. To get started, please CLICK HERE.
What does a test report look like?
For a sample report of a popular panel available at our Direct Labs Test in Henderson, NV, please CLICK HERE.
We are delighted to offer a Direct Labs Test in Henderson, NV.
Direct Labs Test in other cities near Henderson, NV:Arden | Boulder City | Enterprise | Indian Springs | Jean | Las Vegas | Nellis Afb | North Las Vegas | Paradise | Sloan | Sunrise Manor | The Lakes | Whitney | Winchester