text:
A method and system for caching objects and replacing cached objects in an object-transfer environment maintain a dynamic indicator (Pr(f)) for each cached object, with the dynamic indicator being responsive to the frequency of requests for the object and being indicative of the time of storing the cached object relative to storing other cached objects. In a preferred embodiment, the size of the object is also a factor in determining the dynamic indicator of the object. In the most preferred embodiment, the cost of obtaining the object is also a factor. A count of the frequency of requests and the use of the relative time of storage counterbalance each other with respect to maintaining a cached object in local cache. That is, a high frequency of requests favors maintaining the object in cache, but a long period of cache favors evicting the object. Thus, cache pollution is less likely to occur.
1. A method of caching objects and replacing cached objects comprising:
receiving a plurality of objects from remote sites via network connections, the objects being directed to target devices,
storing at least some of the objects in local cache, thereby providing cached objects that are accessible without reconnecting to the remote sites;
maintaining dynamic indicators for at least some of the cached objects, where different dynamic indicators correspond to different cached objects, each dynamic indicator being responsive to a frequency of requests for a corresponding cached object by the target devices and being indicative of a time of storing the corresponding cached object in the local cache relative to storing other cached objects in the local cache such that a determination for each dynamic indicator is at least partially based on a storage occurrence of the corresponding cached object relative to storage occurrences of other cached objects; and
selectively replacing cached objects with recently received objects based upon the dynamic indicators such that the cached objects are removed from the local cache on the basis of frequencies of requests and relative times of storing said cached objects.
2. A method according to
3. A method according to
4. A method according to
5. A method according to
6. A method according to
7. A method according to
8. A method according to
9. A method according to
10. A method according to
11. A method of caching objects and replacing cached objects comprising:
establishing a protocol for replacing objects stored in local cache, the protocol being dependent upon indications of frequency of requests (Fr) for an object (f), cost (Cost) of acquiring the object from at least one source, and a time (Clock) of accessing the object in the local cache, such that each object has a priority key (Pr(f)) that is indicative of
storing a plurality of the objects in the local cache, each object having an assigned priority key Pr(f);
adjusting the indication of frequency Fr(f) for a specific object upon receiving a request for the specific object; and
selectively replacing the objects in the local cache with recently received objects based upon the protocol.
12. A method according to
13. A method according to
14. A method of caching objects and replacing cached objects comprising:
establishing a protocol for replacing objects stored in local cache, the protocol being dependent upon indications of frequency of requests (Fr) for an object (f) and a time (Clock) of accessing the object in the local cache, such that each object has a priority key (Pr(f)) that is indicative of
storing a plurality of the objects in the local cache, each object having an assigned priority key Pr(f);
adjusting said indication of frequency Fr(f) for a specific object upon receiving a request for said specific object; and
selectively replacing the objects in the local cache with recently received objects based upon the protocol.
15. A method according to
16. A method according to
17. A method of caching objects and replacing cached objects comprising:
establishing a protocol for replacing objects stored in local cache of a proxy cache, the protocol being dependent upon indications of frequency of requests (Fr) for an object (f), size (Size) of the object and duration (Clock) of storing the object in the local cache, such that each object has a priority key (Pr(f)) that is indicative of
storing a plurality of the objects in the local cache, each object having an assigned priority key Pr(f);
adjusting the indication of frequency Fr(f) for a specific object upon receiving a request for the specific object; and
selectively replacing the objects in the local cache with recently received objects based upon the replacement protocol.
19. A method according to
21. A method according to
22. A method according to
23. A system for caching objects and replacing cached objects comprising:
switching means for providing connectivity between a plurality of remote servers of objects and a plurality of clients requesting the objects;
local cache means for selectively storing objects requested by the clients via the switching means; and
replacement protocol controller means for governing caching of objects based on values of dynamic indicators that are specific to corresponding objects in the local cache means, each dynamic indicator being responsive to a frequency of requests for the corresponding object by the plurality of clients and a clock indicative of a relative time of storing the corresponding object in the local cache means in relation to storing other objects, the replacement protocol controller means replacing cached objects with recently requested objects in an order determined by the dynamic indicators.
24. A system according to
25. A system according to
The invention relates generally to retaining objects in cache and, more particularly, to methods and systems for implementing a protocol for replacing cached objects with recently received objects.
With the growth of the World Wide Web, an increasingly large fraction of available bandwidth on the Internet is used to transfer Web documents. Access to the Web documents is generally structured around the HyperText Transfer Protocol (HTTP), which is a request-and-response protocol. When a user at a client device, such as a personal computer, designates a particular Web page, at least one request is generated. The number of requests is dependent upon the sophistication of the designated Web page. Often, a Web page is formed of a number of files, such as text files, graphics files, audio files and video files. Each one of the files is referred to as an "object." A multi-object page is aesthetically pleasing, but each object requires a separate request and a separate response. Therefore, each request-and-response round trip time plays a role in determining the total time a user must wait to view the complete designated Web page.
The total latency in downloading a Web page or other Internet document (e.g., a FTP file) depends upon a number of factors, including the transmission speeds of communication links between a client device and a server on which the file is stored, delays that are incurred at the server in accessing the document, and delays incurred at any-device located between the client device and the server. The intermediate devices may include proxies and routers. If there are a number of objects embedded within a Web page, the delays occur for each object.
Web proxies serve as intermediaries between browsers on a client side of an Internet connection and servers on the opposite side. An important benefit of a Web proxy is the ability of the proxy to cache objects. The caching operations of the Web proxy will be described with reference to FIG. 1. When a client device 12 generates a request 14 for a particular object, the cache of a proxy 16 is searched to determine whether the object is stored at the proxy. If the object is not found in the cache, the request is directed to a server 18 via the Internet 20. In FIG. 1, the requested object 10 is indicated in phantom. As an example, the object 10 may be a HTML file. A response 22 from the server is directed through the proxy 16 to the client device 12. Preferably, the object 10 that is contained within the response 22 is cached at the proxy 16. At a later time, either the same client device or a different client device 24 may generate a request 26 for the same object. The object 10 is in the cache of the proxy, allowing the object to be forwarded to the client device 24 directly from the proxy, as shown by response 28. This eliminates delays encountered in communicating between the proxy 16 and the server 18.
The first request 14 resulted in a "cache miss," since the requested object 10 was not retained in cache of the proxy 16. On the other hand, the second request 26 resulted in a "cache hit." By storing copies of objects, the proxy 16 can reduce the number of requests that are directed to servers 18, as well as the volume of traffic on Internet backbones as a result of transmitting the responses in the form of a number of packets that must be reassembled at the client device 12.
Ideally, the cache at the proxy 16 can retain all of the objects that are transferred through the proxy. However, the typical storage capacity for the proxy is in the range of 256 megabytes to 1 terabyte, with most Web proxy capacity being at the lower half of the range. Therefore, it is important to form a replacement strategy for determining which objects are evicted from cache when a recently received object is to be cached within exhausted storage space. Two important metrics that are used to measure proxy cache performance are cache hit rate and byte hit rate. The cache hit rate is the percentage of all user requests 14 and 26 that are satisfied by the proxy 16, rather than by access to the original server 18. Byte hit rate is the percentage of all network traffic, measured in bytes, transferred directly from the proxy cache, instead of across the external network.
There are a number of replacement strategies that have been proposed by the scientific community with regard to Web proxy caching. Some of the strategies are relatively simple and easy to implement, while others rely heavily upon setting parameters and are difficult to implement. A well organized survey of currently known Web replacement strategies is provided by Pei Cao and Sandy Irani in an article entitled, "Cost-Aware WWW Proxy Caching Algorithms," Proceedings of USENIX Symposium on Internet Technologies and Systems, Monterey, Calif., pages 193-206, December, 1997. The article describes ten previously known replacement algorithms.
According to the least-recently-used (LRU) algorithm, when an eviction is required in order to store a recently received object, the previously cached object that was requested least recently is evicted. This is a traditional strategy and operates well for CPU caches and virtual memory systems. However, it does not work as well for proxy caching, since time accesses for Web traffic often exhibit very different patterns. For example, some Web pages may be popular only during certain times of the day or certain days of the month.
A second known strategy is the least-frequently-used (LFU) algorithm that replaces the object which has been accessed the least number of times. This strategy attempts to keep more popular objects and replace rarely used objects. However, some objects can build a high frequency count over a short period of time and be rarely accessed after the subject matter is no longer "hot." Such objects often remain within cache long after network performance is enhanced by retaining the documents in cache. The traditional LFU strategy does not provide any mechanism to remove such documents, leading to "cache pollution." Typical examples are objects of a Web site dedicated to a one-time, high-profile event.
A third strategy is to evict the largest document stored in cache. This size strategy attempts to maximize the cache hit rate by evicting one large object, rather than a number of small objects. However, some of the small objects may never be accessed again. This third strategy does not provide any mechanism to evict such documents, leading to cache pollution.
A fourth strategy identified in the Cao and Irani article is referred to as an LRU-threshold strategy. This strategy is equivalent to the LRU policy, but it does not cache documents larger than a certain threshold size.
Another refinement of the LRU strategy is the log (size) +LRU strategy that replaces the document which has the largest log (size) and is the least recently used among the same log (size) documents. A hyper-G strategy is a refinement of the LFU strategy with last access time and size considerations. Yet another strategy is referred to as the Pitkow/Recker strategy that replaces the least recently used document, unless all of the documents were accessed on that particular day. In this case, the largest document is replaced. This strategy attempts to monitor the daily time access patterns specific to the Web documents. This replacement strategy has been proposed as one to run at the end of a day, in order to free space occupied by "old" least-recently accessed documents.
An eighth strategy is the lowest-latency-first policy that removes the document with the lowest download latency. The strategy is directed to minimizing average latency.
A ninth identified strategy is a hybrid policy that also targets reducing the average latency. For each object, a utility value of retaining the object in cache is computed. Objects with the smallest utility value are replaced. The utility value is designed to capture the utility of retaining a given object in the cache. The value is based upon a number of factors, including the time to connect with the server, the bandwidth of the server, the number of times that the object has been requested since it was brought into the cache, and the size of the object.
The last strategy identified in the Cao and Irani article is the lowest relative value (LRV) strategy that includes the cost and size of an object in the calculation of a value that estimates the utility of keeping a document in cache. The replacement algorithm evicts the object with the lowest value.
A refinement of the LFU strategy not identified in the Cao and Irani article has been proposed for caching, but not specifically proxy caching. The strategy places two limitations on the counts of object requests in the caching LFU algorithm: AMaX, which places an upper limit on the average request count for all objects in the cache; and MRefs, which imposes an upper limit on the request count that can be assigned to a single object. Whenever the average request count for objects in the cache surpasses AMaX, the request count of each object in the cache is reduced by a factor of two. While this refinement may improve proxy performance, further improvements are desired. Implementation of the strategy requires a reoccurring "walk through" of the entire cache storage space in order to adjust the request count of each cached object. Thus, the processing requirements can be significant.
Cao and Irani propose a replacement strategy for web proxies which incorporates size of the cached objects into a previously known Greedy-Dual algorithm. The original Greedy-Dual algorithm dealt with the case in which pages in a cache (memory) had the same size, but had different costs to fetch them from the storage. The original algorithm associated a value H with each cached page p. Initially, when a page was brought to the cache, H was defined to be the cost of bringing the page into the cache (i.e., H=Cost). When a replacement was needed, the object with the lowest H value, minH, was replaced and all of the H values of the remaining objects were reduced by minH. If an object was accessed again, its current value H was restored to the original cost of obtaining the object to the cache. Thus, the H values of recently accessed pages maintained a large amount of the original cost, compared to objects that had not been accessed for a significant period of time.
In comparison, the Greedy-Dual-Size algorithm introduced the size of the object into the determination of the H value, so that H=Cost/Size, where Size is measured in bytes. To provide a high cache hit ratio, the Cost function of each object may be set to 1. In such a way, larger objects have a smaller H value than small objects, and are therefore more likely to be replaced if they are not referenced again in the near future. Setting the Cost to 1 favors small documents over large documents, especially those that are rarely referenced. Because there are a larger number of objects within the cache, the cache hit ratio will remain relatively high. However, the byte hit ratio may be sacrificed. A relatively high cache hit ratio and high byte hit ratio may be obtained by setting the Cost function for each object to 2+Size/536, which is the estimated number of network packets sent and received to satisfy a cache miss for the requested object. This setting of the Cost function provides a greater H value for larger objects than for smaller ones. It allows the objects having a small size to be replaced more readily than the larger objects, especially if the larger objects are often referenced. If a large object is seldom referenced, it will be replaced as a result of the steady decrease in the H value.
The Greedy-Dual-Size algorithm out performs previously known caching strategies with regard to a number of performance metrics, including cache hit ratio and byte hit ratio. However, the Greedy-Dual-Size algorithm does have at least one shortcoming, namely, that the algorithm does not take into account how many times the cached object was accessed in the past. An example is provided in how the Greedy-Dual-Size algorithm handles a hit and a miss for two different documents of the same size. When initially the documents are brought to the cache, both documents receive the same value of H=Cost/Size. The first document (doc 1), which was accessed a number of times in the past, will have the same value as the second document (doc 2) that is accessed from cache for the first time. Thus, in a worst case scenario, the frequently accessed doc 1 will be replaced, instead of the once-used doc 2, when it is time to replace one of the documents with an object having a higher H value.
What is needed is a method for systematically caching objects and replacing cached objects such that currently popular requested objects are likely to be stored in local cache but previously popular objects are readily replaced, thereby providing high cache hit and byte hit ratios. Ideally, such a method should have application not only to proxy cache management, but also to other types of cache management as well. The present invention solves these needs and provides further related advantages.
The present invention provides a method and a system for caching objects and replacing cached objects in an object transfer environment using a dynamic indicator for each object; the dynamic indicator is dependent upon frequency of requests for the object as well as upon time of storing the cached object relative to other cached objects. In one embodiment, frequency of requests is a factor that allows the dynamic indicator to exceed its original value, with relative time of storage providing a balance that reduces the possibility of cache pollution. In another embodiment, the size of the object is a factor in determining the dynamic indicator, and still further, in another embodiment, cost of obtaining the object (e.g., use of network resources) is also used as a factor.
The method and the system may be used to establish a replacement strategy for caching objects in local cache of a proxy connected to the Internet. The objects are received from servers via the Internet, and are directed to target devices, such as personal computers. The method and system may also be used in other cache management environments, such as for CPU cache management (e.g., "data compaction" for removing objects from localized cache). In at least some of these applications, objects can selected for eviction from cache even when the capacity of cache has not been reached, such as during times of processor inactivity.
In one embodiment, the dynamic indicator (Pr) of an object (f) is a function of the current relative storage time (Clock) of the object, the size of the object (Size(f)), the frequency of requests (Fr(f)) for the object, and the cost of the object (Cost(f)). In this embodiment, the dynamic indicator may be determined such that
The indicator Pr(f) is "dynamic" with respect to the parameter Fr(f), since the value Fr(f) is adjusted each time that the object (f) is requested. The parameter Clock is a dynamic value that preferably is increased each time an object is evicted from local cache, and that is fixed for each object during storage in local cache. That is to say, later-cached objects will have a higher value of Clock (and therefore Pr(f)) than earlier cached objects. The clock function, therefore, is indicative of the "strength" of previously evicted objects. As a result of this mechanism, objects that have not been accessed for long periods of time are susceptible to eviction even if the frequency counts of the objects are high. Optionally, the determination of the dynamic indicator can be modified by including a coefficient (Alpha) as a multiple of the File frequency (Fr(f)).
If desired, the dynamic indicator and its determination can be simplified by eliminating one or both of the Cost and Size functions. If both of the functions are removed from the determination of Pr(f), the Clock and frequency functions will remain to provide a balance that favors current popularity over past popularity. For example, if the Size function is removed, but the Cost function is utilized, the algorithm (i.e., Pr(f)=Clock+Fr(f)�Cost(f)) operates well to provide a solution for conventional storage and cache paging concerns, in addition to use within a network environment.
In the practice of the method, if a request for the object (f) is received at a proxy from a client device, the local cache is searched to determine if the object is stored in local cache. For a cache hit, the object is served to the requesting client device. After the value of Fr(f) is adjusted, the dynamic indicator for the object (f) is re-computed. On the other hand, if the request results in a cache miss, the object is accessed from the remote server on which the object is stored. The object is served to the client device and a calculation of the dynamic indicator is initiated with using a frequency indication of "one," i.e., Fr(f)=1. A determination may then be made as to whether a replacement of a cached object is dictated by the caching strategy. This determination may involve a number of factors (e.g., factors that act to prevent the object from replacing a cached object that is likely to subsequently have a greater frequency count), or may merely involve a calculation of whether the object can be cached without replacing a previously cached object. When a replacement is dictated, an identification may be made of which file or files are to be evicted.
To prevent Clock and the frequency count Fr(f) from entering an overflow situation, an offset procedure may be implemented; when Clock has reached a predefined upper limit, an offset may be computed and the next assigned Clock value is reduced by the offset. Simultaneously, the dynamic indicators of all of the cached objects may be reduced by the offset.
To prevent the object frequency count from overflow and to guarantee the algorithm properties and performance, the count preferably stops at an upper limit (e.g., 108). Such a high value of the object's frequency count will generally guarantee that the dynamic indicator for the cached object will inhibit replacement of the object. On the other hand, if the object frequency count has reached the upper limit and it has not been accessed for a long time, eventually Clock will exceed the upper limit, and all the newly accessed objects will have higher Pr(f) values, allowing the replacement of the cached object. Such an approach prevents the cache from becoming polluted with "hot" files which become "out of interest" and rarely or never are accessed again.
FIG. 1 is a schematic view of a known system for implementing a request-and-response protocol for providing objects, such as Web documents, to client devices.
FIG. 2 is a block diagram of components of a proxy that are relevant to a cache replacement method and system in accordance with the preferred embodiment.
FIG. 3 is a block diagram of components of the cache controller of FIG. 2 in accordance with the preferred embodiment.
FIG. 4 is a process flow diagram for implementing the cache replacement strategy in accordance with the preferred embodiment.
With reference to FIG. 2, the preferred embodiment will be described and illustrated primarily as it applies within a network environment. However, the system and method may be used in other applications, such as CPU or other cache management, garbage collection, etc.
In FIG. 2, a proxy 30 is shown as including a client-side communication device 32 and a network-side communication device 34. The communication devices may be any of a variety of available devices for routing communications using known switching mechanisms that are implemented in computer hardware or software. For example, the client-side communication device 32 may be an array of modems for channeling Web page objects to personal computers via conventional telephone lines 36. On the other hand, the network-side communication device 34 may be switching circuitry for connection to a network 38 via Ti lines 40. In the preferred embodiment, the network 38 is the global communications network referred to as the Internet.
The proxy 30 is able to access Web pages and other files stored on remote servers, not shown, via the network 38. As previously described with reference to FIG. 1, a request 14 from a client device 12 is initially satisfied by a response from a remote server 18. If desired, the object transferred in response to the request may be retained within proxy storage, so that a second request 26 may be satisfied directly from the proxy, as indicated by the response 28 in FIG. 1. Similarly, the proxy 30 of FIG. 2 includes local cache 42 for retaining objects. The objects that are stored may be components of a Web page, such as audio files, HTML files, graphic files or video files. The objects may also be other files that are transferred via the Internet, such as File Transfer Protocol (FTP) transfers.
A cache controller 44 determines the content of the local cache 42. Some objects are un-cachable, such as secured objects and file forms that are completed by inputs from a user at a client device prior to transfer from a server to the client device. In the preferred embodiment, the cache controller 44 has the ability to distinguish cachable and non-cachable objects. As will be explained more fully below with reference to FIG. 4, a more important role of the cache controller is to determine which objects are to be evicted from the local cache 42 when a replacement condition has been detected, such as when cache capacity has been exhausted. Thus, when a recently received object is eligible for caching, the controller 44 determines whether previously cached objects are to be evicted from storage 42 and identifies which objects are to be evicted, if any. If it is determined that a recently received object is likely to be less "popular" than presently cached objects, the recently received object remains un-cached.
The replacement strategy that is implemented by the cache controller 44 in determining which objects are to be stored in local cache 42 and which objects are to be evicted can be reduced to comparisons of dynamic indicators (Pr) which are functions of relative times (Clock) of cache and frequencies (Fr) of requests for objects. In this simplest form, the dynamic indicator of each object (f) may be determined by the relation
A specific advantage of this first embodiment is its simplicity, i.e., no adjustments or fine tuning are required and for that very reason this first embodiment will be preferred in many applications. The quantity "Clock" can be any function that differentiates storage time of different objects. Preferably, the quantity Clock is not a mere time stamp of entering the object (f) into cache, but rather, a number which is larger for files that have been received relatively recently. The quantity Clock may be thought of as indicative of the "strength" of previously evicted objects, since it increases in accordance with caching activity. For example, in one embodiment, each time that a cached object is evicted from local cache 42, Clock may be increased by the value of the dynamic indicator of the evicted object. That is,
Since a current Clock value is used to calculate each Pr(f) value, the values of Pr(f)evicted are related to Clockold. Therefore, an alternative to Equation 3 is
The replacement strategy of Equation 2 provides a high byte hit ratio, since it is independent of the size (Size) of the files. In a second embodiment, however, the cost of acquiring an object (Cost) is also considered. The cost of an object may be exclusively related to the use of network resources to download the object from a remote server, but may also have a monetary value (e.g., pay-per-view files).
In a third embodiment, the dynamic indicator of a particular object (f) is determined using the relation
This formulation achieves a relatively higher cache hit ratio than the formulation of Equation 2 because it factors size of the objects into the replacement strategy. Alpha is an optional term that can be used to vary the relative weight of the various terms of Equation 5. Alternatively, Alpha can be adjusted to weight the influence of object types, caching times, protocols used for object retrieval, and/or object sources.
As will be discussed below, Clock is preferably computed based on an initial value of zero. Consequently, Equations 3-4 and 5 will weight all dynamic indicators in a manner that is directly proportional to Alpha, e.g., the particular choice of a constant, non-zero and positive Alpha as a weighting factor is unimportant. However, if another valuation of Clock is used, or if additional terms are added to the right side of Equation 5, then a constant Alpha may be effective to tune the importance of size or cost relative to other terms. If desired, Alpha can also vary in a manner to prioritize certain objects as opposed to others for insertion into the local cache. For example, prediction information may be available for frequency of objects, e.g., certain objects may have attributes which at the time of retrieval indicate that the objects will be popular. As an example of weighting the influence of the types of objects, since HTML and image objects tend to receive the most requests in a WWW environment, objects of these types may be assigned an Alpha of "2," while objects of all other types may be assigned an Alpha of "1." Alternatively or additionally, in a time-dependent implementation, the assignment of Alpha may be made dependent upon the times at which objects are requested; if objects that are requested during off-peak hours are more likely to be requested only by the single user, Alpha may be defined to be a lower value during off-peak hours than during peak hours. In the protocol-dependent implementation, an object of a particular protocol (e.g., HTTP) may be given an Alpha greater than objects that are retrieved using "less popular" protocols (e.g., FTP or Gopher). In the source-dependent implementation, the value of Alpha assigned to an object is adjusted according to the "popularity" of objects from particular sources (e.g., objects from a particular WWW server).
Referring now to FIG. 3, possible components of the cache controller 44 of FIG. 2 are shown to include a request counter 46 and a clock incrementer 48. As will be readily understood by persons skilled in the art, the components of the cache controller may be formed primarily or exclusively in computer software. The request counter 46 detects each request for an object and adjusts the dynamic indicator for the object. If the requested object is one that has not previously been stored in local cache, then the dynamic indicator is determined using a value of "one," i.e., Fr(f)=1.
An incrementer 48 is used to determine the value of Clock. Clock is a running value that may start at 0 and increment for each evicted file (fevicted) by the value of the dynamic indicator of the evicted object. At the time an object is received, it is assigned the current value of Clock. Thus, the first object that is stored in local cache will have a Clock value of "0." Clock will not be changed for any subsequently cached objects until an object is evicted to provide storage space. Once an object is evicted, the incrementer 48 then determines a new clock value according to Equation 3 or Equation 4, and objects then received are assigned the new clock values and so on. Other valuations that provide an indication of relative timing of storage of an object may be substituted.
An offset mechanism 52 (implemented in hardware or software) may be used to prevent Clock from reaching an excessive value. As previously noted, Clock is re-computed each time that an object is evicted from local cache 42. The offset mechanism 52 may be enabled to monitor the value of Clock assigned by the incrementer 48 and to trigger an offset adjustment process when Clock reaches a preselected number. The preselected number is not critical to the invention.
In addition to subtracting an offset, the offset mechanism 52 preferably also subtracts the offset from each one of the priority indicators that are stored in the Pr database 50. In the preferred embodiment, the database 50 is arranged to provide a priority queue of dynamic indicators, but care must be taken to avoid the creation of negative dynamic indicators through subtraction of the offset.
The offset mechanism 52 is also used to monitor the frequency counts for the cached objects. In the preferred embodiment, the frequency count of an object has a maximum value, so that the count does not overflow. For example, when the count reaches an upper limit, it remains unchanged. A value of the object frequency count will generally guarantee that the object will remain in local cache 42 for a fair amount of time. However, if the object is not accessed for a long time period, eventually Clock will exceed the upper limit of object frequency count, and all the newly accessed objects will be cached with a higher dynamic indicator, allowing the previously "hot" object to be replaced. Such an approach prevents cache pollution with hot files which are now out of interest and seldom or never accessed.
In the third embodiment in which both of the size of the cached object (Size) and the cost of obtaining the object (Cost) are employed in the replacement strategy, both of a size identification mechanism 54 and a cost identification mechanism 56 are also used. Means for calculating Size and Cost include any mechanisms conventionally used for performing such calculations in the art, and need not be explained in extensive detail herein. Outputs from the request counter 46, the incrementer 48, and the size and cost identification mechanisms 54 and 56 provide the relevant measures to the Pr database 50 for calculation of the dynamic indicators. A replacement controller 58 accesses the information in the Pr database 50 to execute the replacement strategy.
FIG. 4 is a process flow of steps that occur when a request for a particular object is received at the proxy 30 of FIG. 2 from a client device (not seen in FIG. 4). In step 60, the request for object (f) is received. Step 62 determines whether there is a cache hit or a cache miss. If the object (f) is cached, local cache 42 is accessed and the client device is served at step 64. That is, a cache hit allows the requested object to be directed to the target client without requiring contact with a server from which the object was originally obtained via a network connection. In step 66, the frequency count for object (f) found in local cache is updated. Typically, the update is executed by incrementing the Fr(f) value by 1. As seen in Equation 2 and Equation 5, incrementing the Fr(f) value changes the dynamic indicator Pr(f).
If at determination step 62 a cache miss is identified for the requested object (f), the appropriate server is accessed at step 68 and the client device is served using known techniques at step 70. In step 72, the dynamic indicator is calculated for the object (f). If Equation 5 is utilized, each of the request counter 46, the incrementer 48, and the size and cost identification mechanisms 54 and 56 are employed in step 72. The request count will be at a minimum of 1, and the values of Clock will be dependent upon factors that include the number of cache replacements that previously occurred.
As previously noted, the replacement strategy may be used in applications other than HTTP proxy caching. For example, the strategy may be implemented during times of system inactivity to provide "data compaction" for cache management, especially in an environment where the cost of making cache space available is relatively high. The strategy may be implemented in server cache management, CPU cache management, or other types of cache management. Some of the remaining steps (i.e., steps 74-96) of FIG. 4 may be advantageously applied to these systems.
Steps 74, 76 and 78 determine whether a replacement condition for evicting a cached object is present. The replacement condition may be a condition in which the object (f) cannot be cached without exhausting cache space, but more complex conditions may be relevant. For example, some proxy caches will invoke a replacement policy when the cache utilization exceeds a specified value (e.g., X% of all cache space, with X≦100%). Moreover, the execution of the replacement policy may free up more space than is needed to cache the most recently requested object (f). For example, when the replacement strategy is invoked, many caches will remove objects until a second threshold is reached (e.g., Y% of the cache space is utilized, with Y≦X). Another approach is to perform replacements periodically in order to "smooth" out the processing work load (i.e., periodically perform a manageable amount of work, rather than more extensive work each time that the upper threshold is reached). Therefore, the determination step 74 may require a computation of the storage requirements for caching object (f). If it is determined that the recently received object (f) can be cached without evicting any cached objects, the object (f) is stored in cache at step 80. The calculation of the amount of used cache is then updated at step 82 using the formula
In step 74, if it is determined that the recently received object (f) will cause the replacement strategy to be invoked (e.g., Usedold+Size(f)>X% of Capacity), step 76 identifies the cached object or objects with the lowest Pr values that enable caching of the recently received object (f) when evicted from cache. If replacement is relevant because more than X% of capacity is exhausted, the first k files (k≈1) with the lowest dynamic indicator values are chosen to satisfy the condition Usednew≦Y% of capacity, where
In the execution of step 76 of identifying the objects (f1, f2, . . . fk), the recently received object (f) having the Pr(f) value computed in step 72 may be considered. If the objects that are stored in local cache have a high frequency of requests (Fr), the recently received object may be the only object or one of the objects identified in the step 76. In this situation, the recently received object is not cached. None of the previously cached objects is evicted. Nevertheless, Clock is preferably updated at step 84 using Equation 3 or Equation 4.
Since the Clock value for a recently received object (f) is likely to be higher than the values of Clock of many of the previously cached objects, the recently received object will likely not be identified in step 76. A negative response at the decision step 78 will trigger the step 86 of evicting the k files identified in step 76. Clock is then updated at step 88, using Equation 3 or Equation 4. When k>1, the updated Clock may be determined by the formula
The recently received object (f) is cached at step 90 and the value of Usednew is calculated at step 92 using Equation 7. Alternatively, Clocknew can be calculated using the equation
Returning to step 88, the update of Clock may trigger the Clock offset process described above with reference to the offset mechanism 52 of FIG. 3. Each time that Clock is updated at step 84 or 88, the determination step 94 is triggered. The offset mechanism 52 detects a condition in which the threshold of Clock is reached. If in step 94 it is determined that the threshold has not been reached, the offset mechanism 52 is returned to an inactive condition. On the other hand, if the threshold has been reached, Clock and all of the dynamic indicators stored in the Pr database 50 are reduced by an offset value when the threshold is reached, as indicated by step 96 in FIG. 4.
Importantly, in some applications it may always be desired to place a newly received object into cache at the expense of objects having the smallest dynamic indicators. In such applications, upon receiving a new object, a sufficient number of objects have the smallest dynamic indicators are identified for eviction in order to make room for the newly received object.
Having thus described several exemplary implementations of the invention, it will be apparent that various alterations, modifications, and improvements will readily occur to those skilled in the art. Such alterations, modifications, and improvements, though not expressly described above, are nonetheless intended and implied to be within the spirit and scope of the invention. Accordingly, the foregoing discussion is intended to be illustrative only; the invention is limited and defined only by the following claims and equivalents thereto.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
The next generation G11 7 Series shows off more of its lighting – laser headlights, LED headlights and some of its tail lights.
BMW M235i takes on the Opel Astra OPC and Subaru WRX STi.
Watch the official Formula E Safety Car, the BMW i8, move like you've never seen – pulling out some impressive drifts and slides.
Dinan has just announced its DINANTRONICS performance tune Stage 1 for the F80 M3, F82 M4 and F83 M4.
Full release is inside, but here are the specs.
Peak Horsepower: 516
Peak Torque: 489
Labor Hours/Installation Hours: 1.50
The BMW i8 represents a significant shift in the way people view hybrid sports cars. EVO's Henry Catchpole takes a look at the recent history of hybrid and electric cars, and ponders what the future holds for the performance car.
A beautiful Silverstone F80 M3 shoot.
Here's our newest product / model information for the upcoming BMW X2, 7 Series and FWD models, courtesy of ynguldyn.
F47 X2 will come to the U.S. as 25i with sdrive and xdrive.
The complete family of BMW FWD vehicles at the moment looks as follows:
- F45 hatchback
- F46 MPV (not for the U.S.)
- F49 X1 LWB (China only?)
- F52 1 series something or other
A few things to expect in the G11/G12 7 series:
CAR's technical editor Nicol Louw and journalist Wilhelm Lutjeharms compares the new F80 BMW M3 with Alfa Romeo's 4C. Although they are two totally different cars, they both cost around the R1 million mark. How do they perform back-to-back? Watch the video inside to find out.
Some more close-ups of the BMW M4 GTS prototype at BMW M's test center at the Nurburgring.
Check out this great little home homage to the 1M coupe by a 1M owner.
BIMMERPOST moderator Dackelone tours the Italian Alps:
Well… for the last few years, every summer – some of us Euro 1Addicts have met for an awesome driving tour experience. One that we will never forget! The last two years – we have met and driven the infamous Stelvio Pass. You can see our past Stelvio 1.0 and Stelvio 2.0 tours under my signature. But for this year, we all wanted to try something different. Enter Sella 1.0
First off, I want to say I could … CONTINUED
The DTM has a new champion: Marco Wittmann (DE) of BMW Team RMG wrapped up the title in the Drivers' Championship in the eighth round of the ten-race season at the Lausitzring (DE). Sixth place on Sunday was sufficient for the 24-year-old, at the wheel of the Ice-Watch BMW M4 DTM, to ensure he can no longer be caught by his rivals. Wittmann started from seventh place, and once again produced a flawless race in difficult conditions to pick up eight points at the … CONTINUED
BMW combines high performance with a time-honoured brand of driving pleasure and consummate everyday usability – that was the confirmation provided once again by the readers' poll conducted by German motoring magazine "sport auto". Five class wins and a second place represented an outstanding return for the BMW Group's brands in the "sport auto Award 2014". The BMW M3 Sedan and BMW M4 Coupe were among the biggest voter favourites, with the two BMW M Division models asserting their superiority in the classes for … CONTINUED
SimonMotorSport's 800hp BMW M5 at the Challenge 2014 Rally.
When the inaugural season of the new FIA Formula E Championship gets underway in Beijing (CN) on 13th September, BMW will also be involved as the Official Vehicle Partner. The BMW i8, the low-emission hybrid, will be employed as the safety car in the forward-looking all-electric single-seater series. Two fully-electric and therefore zero-emission BMW i3 models will take on the role of the medical car and extraction car respectively.
"From 2014, the International Automobile Federation (FIA) is breaking new ground with the FIA Formula E … CONTINUED
We've recently shown you spy photos of the BMW M2 front end styling under camouflage and the styling is said to be form-follows-function.
Here's a look at how the prototype M2′s front end design compares to some recent M cars.
If BMW insider Scott26 proves accurate, the decision behind switching to FWD or retaining RWD for the next generation 2 Series based on the UKL platform is still being debated within BMW. Per Scott26:
Interesting update – UKL platform is a modular chassis and can be adapted/subtracted as FWD or RWD.
Full decision on the next 2 Series is not final yet (full decision will be taken by the end of the year) and can use the UKL chassis but can adapted for RWD. (BMW … CONTINUED
Some sweet BMW toys assembled for this photo shoot.

subset: commoncrawl


text:
Find the droids you're looking for on Star Wars Reads Day
Local bookstores and libraries plan to make sure the force of literacy is strong on Saturday, when they offer Star Wars Reads Day events.
More than 1,000 sites around the country are participating in Star Wars Reads Day, an event cooked up by Lucasfilm in conjunction with its many publishing partners. "Star Wars" books have been published at all age and reading levels; some of the adult tie-in novels have been bestsellers. This event is aimed at encouraging young Jedi to read. »Read Full Blog Post
Singers blend magically in MSO's Baroque music concert
A pared-down MSO, two remarkable voices and an extremely communicative conductor joined forces in an absolutely captivating evening of Baroque music on Friday.
Guest conductor Nicholas McGegan led about 40 Milwaukee Symphony Orchestra strings, plus harpsichord/continuo organ, through an engaging program of Handel, Pergolesi and Scarlatti. They were joined by soprano Yulia Van Doren and countertenor Daniel Taylor. »Read Full Article


text:
Fun Facts
This "Fun Facts" section of our site features Fun Facts and Information on products and inventions and interesting invention history of the items that we use every day.
Some of our fun facts articles are:
- History Of The Bikini - World's Skimpiest Invention
- The Slightly Gross History of Lipstick
- Top 50 Best Quotes About Success
- X-Ray Glasses Become Reality
- History of X Ray Glasses
Subscribe here to get our updates to our "Fun Facts" articles.
RIP YouTube [2005-2013], The End Of An Eraby Ron Callari
Back To The Future: X Ray Glassesby Michael Daisy
Microsoft Reveals Big Themes For 2013by dendory
Color Me Stop And Go: The History Of The Traffic Lightby Michael Daisy
You see them hanging around, here and there. They're everywhere, part of the landscape, it seems but you never really pay close attention to them until you blow through a red one. Here's some interesting facts about traffic lights...
Burger King's Twitter Hacked: Hilarity Ensuesby dendory
The World's First Computer: The Antikythera Mechanismby Tech Light
If someone were to ask you to name the world's oldest computer, you'd probably mention The Babbage Engine, Konrad Zuse's Z3 or The UK's Colossus. If you were asked when humanity built the first computing device, your estimates wouldn't go higher than a few hundred years or so.
What if I told you that there exists a computer system that was operational almost two thousand years ago?
Five Innovations That Changed Video Gamesby Tech Light
Lava Me Tender: Big Rack Rock Invades Japanese Beach!by Steve Levenstein
2010 Ig Nobel Prizes To 10 Strange & Funny Scientific Studiesby Myra Per-Lee
Read this, if you want to die laughing...
Celebrating its 20th anniversary of Ig Nobel Awards on September 30 at Harvard University, Improbable Research granted 10 Ig Awards to some of the most hilarious scientific studies you will ever hear about. They are laughable, but then they make you think, which is the main objective of the Ig Nobels. So, laugh and then think as you read about these winning discoveries.
8 Really Wacky Inventions From Time Magazine's 50 Worstby Myra Per-Lee
Time Magazine just published its list of the 50 Worst Inventions. Some of these inventions are really old, like the crinoline and tanning beds. Others aren't even around any more, like the Ford Pinto and the Pontiac Aztek. And many, like Agent Orange, plastic shopping bags, and DDT, historically really called for a more timely worst inventions list. But some of Time's 50 Worst Inventions are worth a look just for being so darned ... wacky!


text:
International Interzum Guangzhou Fair
- Event Date: Start Date: 2015/03/28 End Date: 2015/04/01
- Venue: China Import & Export Fair Pazhou Complex
- Location: Guangzhou, China
- Industry: Furniture
Interzum Guangzhou Fair Detailed Information
- Summary
- Interzum Guangzhou is one of the largest furniture production trade fairs in Asia and the definitive one-stop platform for participants to meet buyers, manufacturers and suppliers from all vertical sectors of the furniture manufacturing, production and design industries.
- General Information
- Interzum Guangzhou 2010 will expand from the last time. It is regarded as Asia's most comprehensive woodworking machinery and accessory fair.
- Attendee Information
- The trade fair will attract over 750 exhibitors from around 20 countries and regions to network and do business. The total exhibition space is expected to hit 230,000 sqm together with CIFF.
- Exhibitor Information
- Interzum Guangzhou will be held once again in conjunction with the China International Furniture Fair (CIFF) from 28th March to 1st April, 2014 at the China Import and Export Fair Pazhou Complex.
Interzum Guangzhou Fair Organizer Information
- Show Organizer: Koelnmesse Co Ltd
- Contact Person: Rachel
- Contact Address: Rm 3311, 183 Tianhe Nth Road, Guangzhou, Guangdong
- Telephone: 86-20-8755 2468ext10
- Fax: 86-20-8755 2970
Interzum Guangzhou Fair 2015 Related Trade Shows:
Furniture and Interiors
( 24-May-2015 - 27-May-2015 )
High activity of companies, representing ceramics, sanitary engineering, bathroom furniture and accessories.
International Office Furniture Expo Japan
( 04-Jul-2015 - 06-Jul-2015 )
For 3 days, Office Furniture Japan will prove to be one of the largest platforms for meeting leading players from furniture industry.
Furnitex Expo
( 19-Jul-2015 - 22-Jul-2015 )
Furnitex is a prestigious show that offers a complete collection of furnishing items that come from the best manufacturing industries of Australia.
Woodworking IWF Fair Atlanta
( 22-Aug-2015 - 25-Aug-2015 )
Woodworking IWF Fair Atlanta will be held in USA from 2012-08-22 to 2012-08-22. The event, held by International Woodworking Fair - a professional trade show organizer, is to showcase the latest products, service, trends in agriculture indust
CamboWood Fair
( 25-Aug-2015 - 28-Aug-2015 )
Co-located Exhibitions: Cambodia Plastics, Rubber, Packaging, Printing and Foodtech Industry Fair CamboPlas CamboPack CamboFoodtech.
Interzum Guangzhou Fair 2015 Related Trade Shows:
Furniture Technologies Components Textiles, Ambienta Expo Zagreb, ZOW Russia, Guangzhou Wooden House Fair, Office Furniture Japan, Furniture Club Exhibition Moscow, Primus Furniture Industry, Furniture Interiors Ukraine, Baltic Furniture, Wood Guangzhou, Index Design Exhibition, Furnitex, Primus Furniture Industry, SibFurniture Exhibition, IWF Atlanta, Homex Household Expo, China International Street Furniture Exhibition, CamboWood, Furnima Expo
High Pressure Lam...
Size 1220mm×1830m...
Lucky Enterprise ...
Club chair (TSF-5...
This nice chair will uphols...
Resin Chiavari Ch...
* Professional Manufacturer...
Jimo City Haidong...
Office Furniture
MODEL: AH-04# reddish brow...
Yiheban Furniture...
supermarket shelf wall u...


text:
Be Weary of Politicians With a Sudden Change of Heart
I was quite disappointed in 2006 when Republicans slipped the Unlawful Internet Gambling Enforcement Act into the unrelated SAFE Port Act (yet that isn't stopping them from hypocritically attacking others for possibly using the same method to undo it), thus passing the liberty-reducing legislation without significant notice at the time. Government has no business reaching into my computer and telling me what I can spend my money on, and Republicans really ought to know better. Such legislative moralizing only legitimizes the power of government to force people to behave a certain way, a power which Democrats in turn exploit to control ever other aspect of my life (how can conservatives argue effectively against prohibitions on smoking or eating fatty foods if they turn around and support the very same authority in other instances?) .
It's fine to be opposed to gambling. What's not fine is using government to impose your opposition on everyone else. If you think people shouldn't gamble, exercise your first amendment rights and try to persuade them. I recognize that I am not in the majority in conservative circles on this issue (though not for long, I'd say, based on the apparent differences between younger and older conservatives on the issue), but as far as I'm concerned, using the force of government in this situation is a violation of conservative principle.
Long story short, it's a bad bill that ought to be overturned.
With that said, recent news offers an important lesson: how something is done can be just as important as whether it should be done.
Harry Reid has been consistently opposed to ending the online gambling prohibition, but not for any principled reason. He simply didn't want the casinos in his state to face the competition. Now he's singing a different tune.
Today Harry Reid wants to use the lame-duck session to pass legislation undoing the ban.: I should be thrilled, right? A long time opponent has seen the light! But I'm not, and he hasn't. You see, Harry Reid wants to make internet gambling legal, but will only offer initial licenses to "to casinos and racetrack operators that have been in businesses at least five years." The best and most popular online poker sites, however, are not affiliated with existing casinos. Harry Reid wants to put them out of business, and ensure his buddies in Nevada get a critical first shot in establishing themselves in the legal online poker business first.
This is a cynical payoff to a business which was instrumental in getting Reid reelected, and he shouldn't be allowed to get away with it.
I believe in promoting freedom, including the freedom to do something which might even harm myself. But this isn't how it should be done. This is crony capitalism under the guise of promoting freedom. I'm not falling for it.
Brian Garst regularly blogs at Conservative Compendium.
Also see...
Facebook61.3kTwitter111Email1 Close-quarters combat just got a little more deadly with the introduction of this gas-injection knife. It allows you to inject compressed gasses into whatever you stab, effectively blowing it...Read More
Brian Garst
Brian Garst is the Director of Government Affairs for the Center for Freedom and Prosperity, a non-profit think tank dedicated to preserving tax competition and free markets. He also blogs at BrianGarst.com.
Related Articles
Prime Time Slime: Larry King Says Sarah Palin Should Pose for Playboy
FacebookTwitterEmail I know. I had forgotten that show was still on the air, too. Well, I suppose even Michael Moore
Conservative Groups Beg DC Republicans Not To Surrender To Obama Yet Again
FacebookTwitterEmail Republicans like Peter King, John McCain, Lindsey Graham, Devin Nunes and Lamar Alexander worked overtime to undermine the fight
Talk about Biting the Hand that Fed You: Obama's Attack on America's Students
FacebookTwitterEmail : : : : Whether we like to actually admit it, the youth of our nation voted en masse for President Barack


text:
Preppers In Texas
100 - 500 downloadsAdd this app to your listsTweets por @Appszoom
Preppers In Texas. Want to connect with others in Texas who are wise enough to prepare for a disaster? See what other every day people are doing to get ready. Don't be left without a plan. Get this app now before it's too late. Preppers In Texas.
Recently changed in this version
Comments and ratings for Preppers In Texas
- There aren't any comments yet, be the first to comment!


text:
Randy Beler will serve another term as Chair of the Chinook School Division Board.
The Chinook School Division's board of directors has re-elected Randy Beler and Larry Caswell as Chair and Vice Chair respectively.
Beler has been chair since October 2009, and is honoured to serve another session as board chair.
"To be selected as Chair and Vice-Chair positions, that's quite an honour. In one breath it's very flattering, but in the second it's very humbling to be selected by your peers," says Beler. "I'm very grateful for the opportunity".
As for the board's priority at this point, he says a new school in Swift Current in the primary goal.
Beler was a trustee with the Swift Current School Division for eleven years before joining the new Chinook board in 2005, while Caswell represents the northern central section of the school divsion that includes Abbey, Cabri, Hazlet, Stewart Valley and Success.
Donovan Fehr spoke with Randy Beler about being chosen to continue on as Chair of the Chinook Board...
A beef on a bun barbeque will be taking place before the big show at the Cody Snyder PBR Invitational tonight, with proceeds being donated
The Saskatchewan Blue Cross MS Walk takes place tomorrow at the Ashley Park Community Hall. Community Engagement Coordinator with the MS
Saskatchewan had the highest March on record in terms of whole sale trade in the province, even surpassing the nationally posted figures a
The Canadian Cancer Society are hosting Spice Up Your Life this weekend, an event to teach how to cook with cancer-fighting ingredients at
The Southwest Crisis Centre has introduced a new 50/50 raffle to coincide with their classic Duck Derby fundraiser. Heather Lennox, Execu
Photo courtesy of Shaunavon Fire and Rescue. Shaunavon Fire Crews responded to a farm and grass fire on Thursday May 21st a
Premier Brad Wall yesterday named a new Deputy Premier and a new Finance Minister as part of a small cabinet shuffle resulting from Ken Kr
Frontier Days is on the way and the Swift Current Ag and Ex are looking for volunteers to work the event. Single volunteers and volunteer
With spring now upon us and summer just around the corner, mosquitoes are once again coming out in full force. Doctor David Torr, Medical
Police issued more than 2000 tickets during the month of April as part of the traffic safety spotlight on vulnerable road users. A total
He's walking across Canada to make positive change, one step at a time. Yesterday, Robin Edgar-Haworth was in Swift Current at Living Sky
Madison Kovar has been named the 2015 Frontier Days Amabassador by the Swift Current Ag & Ex. Kovar is an active twelfth grade studen
A plume of smoke rose over Waldeck early this morning. At the town's Trans-Canada Highway turnoff, a west-bound truck was engulfed in fla
The Chaplin Nature Centre is taking flight with their shorebird survey and festival. Over 100,000 shorebirds come in droves to Chaplin La
The Old Man on His Back Prairie Heritage and Conservation Area Ranch opened up to the public over the long weekend. "There's an interpret
Construction is expected to be taking place at Market Square throughout the week as part of an expansion to the popular venue. The City i
A large area of the Southwest will be experiencing a power outage tomorrow morning, May 21st. Sask Power has announced a planned
Great Plains College Swift Current campus is having an Open House tonight. Members of the public that are interested in the programs offe
Traffic along the highways in Swift Current is busier than ever before and pedestrians are still struggling to stay safe. There are no si
Tonight, Write Out Loud returns to the Lyric Theatre with an author who tells the uncomfortable history of ethnic cleansing in the Southwe
The Swift Current Kinetic Exhibition Park has completed their expanded Magnus Newland Arena. The area is now 150 by 200 feet which are th
Ticks are back in season, and nature lovers need to be on the lookout for the parasitic arachnids. "Ticks are very much found on the grou
Swift Current celebrates Pride 2015 on Friday, June 5th at the Lyric Theatre. The night begins will performances by Maverick students, fo
The investigation into the death of a 74 year old Regina woman in the Santa Maria Seniors Home sparked questions about long-term care in S
With summer on the way it is important to make sure to be safe in the sun.Whether it's wearing lighter clothes to keep cool or applying su


text:
Leader of the Opposition V.S. Achuthanandan has demanded that the government decision to reduce ration rice by six kg a month for below poverty line (BPL) cardholders and 4.5 kg a month for above poverty line (APL) cardholders be withdrawn.
Talking to reporters here on Friday, Mr. Achuthanandan said the decision would undermine public distribution system (PDS) and cause hefty increase in price of rice. The APL cardholders would not go to ration shops for just six kg of rice for which they were eligible in a month now.
Mr. Achuthanandan recalled that the State government had not been able to press the Centre to restore quotas of grains slashed as part of cutting subsidies. Union Minister of State K.V. Thomas and Minister for Food and Civil Supplies Anoop Jacob were making conflicting statements on reduction in quotas. So, Chief Minister Oommen Chandy should clarify the position.
CPI legislature party leader C. Divakaran also expressed concern that the price of rice would go up in the coming days. While Prof. Thomas said that Kerala had not lifted the rice allocated to it, Mr. Jacob was maintaining that the State was not getting its quota.
Mr. Divakaran also called for strong measures to end corruption in the Kerala State Civil Supplies Corporation (Supplyco). Officials who had been charge-sheeted were still continuing in service in Supplyco, he said.
RSP leader A.A. Azeez said it was cruel to cut the quota of rice for the State when it was facing severe drought and price rise. However, the Ministers from the State were remaining silent.
He said the RSP State committee would picket the Secretariat on April 17 in protest against the anti-people policies of the State and Central governments.
Keywords: Kerala, PDS, UDF, LDF, V.S. Achuthanandan, Protest rally


text:
10,000 - 50,000 downloads
- Gorgeous graphics
- Load of items
- Loading, loading, loading
+ By Griptonite Games Inc
"I put a spell on U!"
Reviewed by Peter Warrior / Oct 16, 2012
A charming date sim
This is the Korean version of Enchant U. You can read the original review on the English version below for your convenience.
In Enchant U you play the role of [insert name here], a widely customizable blonde/ginger/brunette with somehow dual personality, a dark past and a brilliant future in sight. You have just started college and you have to ehem, study or at least pretend to do so, go shopping for new, vanity items and, hold tight, engage quests and break some hearts here and there.
Graphics and animations are gorgeous, though we'd like there to be far more cutscenes and backgrounds -your character may be shown in a library in a quest to save people from a crashed car- and, if there's no harm in asking, maybe some voices. If we have to remark upon a flaw, it would be the continuous loadings every time we move through the menuses or try to do anything. It slows down the game even more than the energy-based system, which in short, makes you to play a while in the morning and a while in the evening.
This game is clearly oriented to a teenage audience. However, in my humble opinion, the obligation of buying items to advance and the overall tone of the game is too typical of a kinf of demodé feminism, in which gals are only worried about shoes, shoes, shoes and hassle guys ad nauseam. Any 21st century behaviour has been obliterated as far as we have played. There's no way to interact with a non playing character of the same genre beyond befriending her, and mates are merely extras in the film as they have no lines to say. Fatness is a capital sin and you'd better not run out of money. Quests are based on luck and coins, never skill or knowledge, and leave only one option to choose: be noble or be wicked.
Therefore, a technically remarkable game, which I'm sure that I'd like it more if its main character was more like Sabrina and less as Bewitched. Perhaps Griptonite has tried to adapt this game to the widest possible audience, but got trapped in cliches that should be already banished.
Enchant U is a typical university… or is it? Dark and exciting secrets hide behind classmates, sororities, and party life! Only YOU can reveal the mysteries of Enchant U and your secret heritage!
Choose from over 200 dazzling clothing items in different hot fashion brands.
With twenty-four spectacular styles and stunning colors ranging from blonde to blue!
Shop for fantastic tops, pants, skirts, dresses, high heels, handbags and more!
Be NOBLE or WICKED! Let out your inner PRINCESS, or be as NAUGHTY as you'd like!
Build up a list of HANDSOME MEN who adore you.
Pick the most gorgeous guy to be your boyfriend, then go on adventurous dates with your favorite man!
It's time to shop, party, and bewitch the guys in ENCHANT U!
Enchant U free to play, but you can choose to pay real money for some extra items.
Use of this application is governed by Glu Mobile's Terms of Use. Collection and use of personal data are subject to Glu Mobile's Privacy Policy. Both policies are available at www.glu.com. Additional terms may also apply.
FOLLOW US at
Twitter @glumobile
Some lists where this application appears: Analizadas por Mar GP, Reviewed by Peter Warrior.
- There aren't any comments yet, be the first to comment!


text:
Search the collections
Where is it from?
- A Place & Date Depicted Abbotsford, Australia
- A Organisation Depicted Abbotsford, Australia
- B Photographer Elwood, Australia
Photograph - Kodak Australasia Pty Ltd, Camera Assembly, Abbotsford, Victoria, circa 1950s Reg. No: MM 96615
- Summary:
- Black and white, silver gelatin photograph of camera assembly, Kodak Australasia, Abbotsford, Victoria, circa 1950s.
The camera assembly plant was in the Duke Street building in Abbotsford. The camera being assembled is a Box Brownie II.
Kodak manufactured and distributed a wide range of photographic products to Australasia, such as film, paper, chemicals, cameras and miscellaneous equipment. Its client base included amateur and professional photographers, as well as specialist medical and graphic art professionals who used photography, x-ray and other imaging techniques.
This photograph is part of the Kodak collection of products, promotional materials, photographs and working life artefacts collected from Kodak Australasia in 2005, when the Melbourne manufacturing plant at Coburg closed down.
- Description:
- Black and white, silver gelatin photograph printed on medium weight paper, landscape format with a white border.
- Description Of Content:
- The photograph shows a camera being assembled. To the left of the image is a pair of hands holding the body of a camera and using a micro-screwdriver to tighten a screw. A pair of pliers is on a table to the right of the camera being assembled. To the right is a small tray with the parts for the camera, screws and small plates with 'CLOSE UP" printed on them. There is a row of camera lenses and far right, four cameras stacked with the front in view. To the rear on the left, seven cameras waiting for the specific parts to be assembled.
- Acquisition Information:
- Donation from Kodak (Australasia) Pty Ltd, 2005
- Acknowledgement:
- Courtesy of Kodak (Australasia) Pty Ltd.
Courtesy of Kodak (Australasia) Pty Ltd.
|196 mm (Height), 245 mm (Width)
More information
|Tagged with:
|photographic equipment, cameras, manufacturing, factories, photography, making history - kodak collection
|Themes this item is part of:
|Images & Image Making Collection, Working Life & Trades Collection, Kodak Heritage Collection, Baker & Rouse, Baker & Rouse, Abbotsford Workshops, Kodak Australasia
|Primary Classification:
|Secondary Classification:
|Photographic Products
|Tertiary Classification:
|factory interior views
|Back, handwritten, pencil" 'Camera assembly - Abbotsford'
Back, bottom right, stamp, green ink: 'PRINT No. CF.60020/DACRE & PAULINE STUBBS/ PHOTOGRAPHY/ 2 COLEDRIDGE STREET,/ ELWOOD, VICTORIA,/ XA2486 AUSTRALIA.'
|Model Name/Number:
|Box Brownie II
|Photograph: Black & White
|Place & Date Depicted:
|Kodak (Australasia) Pty Ltd, Abbotsford, Victoria, Australia, 1950-1959
|Organisation Depicted:
|Kodak (Australasia) Pty Ltd, Abbotsford, Victoria, Australia, 1950-1959
|Dacre & Pauline Stubbs Photography, Elwood, Victoria, Australia, 1950-1959
This item is part of the following themes:
Similar items
Previous Page
| More


text:
The silent deep; the discovery, ecology and conservation of the deep sea.
The silent deep; the discovery, ecology and conservation of the deep sea.
Koslow, Tony.
U. of New South Wales Press
270 pages
Ecologist Koslow describes the discovery and ecology of deep sea environments, including the fauna of the deep sea floor, the bizarre populace of the mid-ocean depths, coldwater corals, fisheries, and other elements of an almost unexplored world. He also discusses the human impact on those environments from dumping and pollution to mining, deepwater fisheries, and the threat from climate change. Written for a general audience, the book is intended for anyone interested in ocean science and conservation and scientific discovery. Drawings and color and black-and-white photographs illustrate the strange collection of oceanic environments and their unusual inhabitants. A very helpful glossary is included.
([c]20082005 Book News, Inc., Portland, OR)
Reader Opinion
|Printer friendly Cite/link Email Feedback
|SciTech Book News
|Article Type:
|Book Review
|Mar 1, 2008
|Previous Article:
|Scientific methods to evaluate potential reduced-risk tobacco products.
|Next Article:
|Farming in a changing climate; agriculture adaptation in Canada.


text:
Just another day without any luck. I had been searching the desert for weeks, looking for any lost relics or treasures. I began to give up, when I see a pyramid in the distance. This must be the new pyramid I have been hearing rumors about. I see people entering it cautiously, so I decide to follow them.
Forums → Forum Games →
(Game) Cursed! New Rule Added! See page 5. page 2 (locked)
146 posts


text:
Expressing concern over a report on the Sri Lankan army's "continued occupation" of traditional Tamil homeland, DMK on Saturday said it showed that the scene has not changed despite a change of guard in the island
Expressing concern over a report on the Sri Lankan army's "continued occupation" of traditional Tamil homeland, DMK on Saturday said it showed that the scene has not changed despite a change of guard in the island
There will be several showers in the Western, Sabaragamuwa and Central provinces and in the Galle and Matara districts while thundershowers will also develop at several places in the Eastern and Uva provinces during the
Three persons were taken into custody yesterday in connection with the theft of over 30 high voltage batteries from telephone towers in the Gampaha District, police said. They said some 33 batteries were later recover
Two persons were killed in separate wild elephant attacks at locations in Amparai and Sigiriya yesterday, police said today. According to police the incidents were reported from Bakmitiyawa in Damana Amparai and Digam
The Central Bank of Sri Lanka (CB) said on Friday that it successfully launched and priced a US$650 million 10-year International Sovereign Bond (Issue) at a yield of 6.125 per cent per annum which drew interest worth $
Sunshine Holdings PLC posted a consolidated revenue of Rs. 16.3 billion in FY15, an improvement of 11.1 per cent year-on-year (YoY). Key business segments, particularly Healthcare and Agribusiness, grew above industry av
Colombo equities saw some marginal returns on Friday at midday trading session after Thursday's profit taking, analysts said. They said that political uncertainties will be the deal breaker in investor participation
The Colombo bourse on Wednesday saw marginal returns in early trade with analysts saying that good corporate results released recently are mooting traders to shift from their wait-and-see mode. The benchmark All Share
A Chinese restaurant in Hong Kong inspired by the popular Japanese cartoon character Hello Kitty has attracted a strong following of customers although it will officially open next month. The Chinese restaurant is sit
Royal handed out a 49-0 drubbing to Trinity in the second match at the Royal Complex. Captured here are images of the final day of the Bradby encounter.
Nobel Prize winner John Nash - whose life was portrayed in the film A Beautiful Mind - has been killed in a taxi crash in New Jersey with his wife Alicia, Sky News reported. The Princeton University mathematician was
Sri Lanka will host the Yonex Sunrise International Badminton Challenge Championship 2015 for the 2nd successive year scheduled to be played from June 2 to 6 at the Sugathadasa Stadium Indoor Sports Complex.
The 5th Li-Ning Mercantile Badminton Association Inter Firm Team Doubles Badminton Championship 2015, organised by the Mercantile Badminton Association and sponsored by Li-Ning will be held at the MBA Headquarters and In
The Masters Basketball Sri Lanka (MBSL) will conduct the 2nd Schools Old Boys and Old Girls Semi League Tournament, commencing during the weekend June 5 and 6, 2015 at the MCA Basketball Court in Colombo. Th
WASHINGTON (REUTERS, AFP) - The chief US negotiator in Iran nuclear talks, Wendy Sherman, will leave the State Department shortly after the June 30 deadline for the talks between Teheran and six major powers to reach agr
WASHINGTON (Reuters) - By releasing video of Beijing's island reclamation work and considering more assertive maritime actions, the United States is signalling a tougher stance over the South China Sea and trying to sp
SYDNEY -- Nearly a year after embarking on a multi-million dollar quest to solve one of aviation's greatest unsolved mysteries, authorities and search teams are being criticized over their approach to finding Flight MH37
Felix Kiprono said his dream is to marry 16-year-old Malia Obama - and he is ready to meet her father to discuss the matter when the president visits Kenya in July, foreign meida reported. He is offering up 50 cows,
BANGKOK REUTERS: A Burmese woman working in Thailand hired a man to sedate and smuggle her 3-month-old baby across the border to relatives in Myanmar, researchers said, describing a common "service" for desperate mig
WANG KELIAN, Malaysia, May 27, 2015 (AFP) - Malaysia's government has expressed shock at finding human-trafficking camps and graves near the Thai border, but for local villagers like Sani Hashim the human clues were rig


text:
Jim Cheshier
Tampa, Fl
with the Arson Pearl
Shot my 2nd career 300 last weekend (11/15/14) using my wife's Hammer Arson Pearl!
Aaron Purucker
Gowen, Mi
with the Bad Ass
Aaron Ray Monroe
Guflport , Mississippi
with the Black Widow Pearl
Im 18 years old now and I shot my first 300 at the age of 17 as a youth bowling with the Black Widow Pearl. Should have been back to back but dang 10 pin. but oh well better luck next time
Aaron Reed
Lodi, Ca
with the No Mercy
Was a 205+ average bowler but got cancer and had both hips & shoulders replaced with metal so just trying to get back into it now.
Adam Lombardi
Pittsburgh, Pa
with the Black Widow Legend
Adam Smit
Ripon, Wi
with the Black Widow Assassin
Been throwing a roto grip for a couple years, now I was recommended the Black Widow Assassin. I bowled with it for about a week before my 300. Great ball. It fits my style of throwing perfectly
Agustin Maldonado (AUGIE)
Pensacola, Fl
with the Deadly Aim
Last year March I bought the First Blood and got a 290 in April. This year in March got the Deadly Aim and got my 300 in April. Hammer what are you putting in production next year in March because I might get it? A lot of people at that center bowl with DV8 or Storm. When everyone asked what I had I told them the everything in my arsenal is Hammer bowling balls except my WD and that was the DEADLY AIM. LOVE THE BALL THANK YOU HAMMER.
Agustin Maldonado (Augie)
Pensacola, Fl
with the Deadly Aim
Hammer Thank you again for such a great ball. Today I shot my first 800. I shot an 801 with a 289, 278, and 234. Just a few months ago I got my 300 and now my 800. I am going to the Wolf Pattern Regional in Pensacola. Wish me luck.
Windsor , Alaska
240-245-300 (785)
with the Absolut Hook
Im 17 and only been bowling for 4 years, throw nothing but Hammer and I love it!! Buying the Black Widow Assassin soon to improve my arsenal! NOTHING HITS LIKE A HAMMER!!
Al Biskup
Roscoe, Illinois
with the First Blood
Hammer fanatic for over 25 years going back to the Blue Pearl. This was my 6th 300 others were thrown with Blue 3D offset Maxxx, Red Sledge Hammer, Black Widow (original). Blazing Violet 3D offset high rev 2X back to back weeks and latest but hopefully not last First Blood.
Al Biskup
Roscoe, Illinois
with the First Blood
this was my first 800 ever with games of 277 279 277 . I'm proud to say that Hammer is my only choice for equipment for 25 years plus. as we all know Nothing Hits Like HAMMER
Al Hammons
Topeka, Ks
with the Taboo Deep Purple


text:
Linguistik-Klassifikation: Sprachtypologie / Language typology
Document Type
- Part of a Book (54) (remove)
- English (54) (remove)
- Syntax (12)
- Phonologie (10)
- Sprachtypologie (10)
- Semantik (9)
- Verb (9)
- Adjunkt <Linguistik> (8)
- Kontrastive Linguistik (8)
- Morphologie <Linguistik> (8)
- Prosodie (8)
- Spracherwerb (8)
- Towards a Typological Classification of Modern Greek (2007)
- In the area of the Modern Greek verb, phenomena which consistently appear are headmarking, many potential slots before and/or after the verb root, noun and adverb incorporation, addition of adverbial elements by means of affixes, a large inventory of bound morphemes, verbal words as minimal sentences, etc. These features relate Modern Greek to polysynthesis. The main bulk of this paper is dedicated to the comparison of affixal and incorporation patterns between Modern Greek and the polysynthetic languages Abkhaz, Cayuga, Chukchi, Mohawk, and Nahuatl. Ultimately, a typological outlook for Modern Greek is proposed.
- Stage levels, states, and the semantics of the copula (1999)
- The paper investigates the issue whether the stage-level/individual level contrast introduced by Carlson 1977 requires the assumption of two homonymous copulas depending on the categorization of the predicative. We argue that instead of a uniform stage-level/individual level distinction we have to distinguish several similar but independent contrasts, none of which crucially depend on the semantics of the copula. In the second part of the paper, we concentrate on one group of phenomena-the distribution of weak subjects-and propose an explanation in terms of an interaction between topic/comment structure and aspectual properties of the predicate.
- "John his" book vs. "John's book" : Possession marking in English (2000)
- The unusual development of the PDE [present-day English] s-genitive can be historically motivated, if the 's form is supposed to be not a mere leftover of the Old English (henceforth OE) casemarking, but the outcome of the merging of two patterns: the inflectional genitive ending (levelled to -s) and the construction "John his book" (henceforth 'possessive-linked genitive') during the Middle and the Early Modem English phases. As my corpus analysis will show, the semantic and syntactic constraints ruling the occurrence of the 's pattern in the time interval of the rise of the 's-pattern (1400 - 1650) are the same ones as those ruling the occurrence of the possessive-linked genitive. This hypothesis is further confirmed by cross-language comparison (with the other West Germanic languages, especially Afrikaans).
- Towards an explanation of copula effects (2000)
- This paper deals with a series of semantic contrasts between the copula "be" and the preposition "as", two functional elements that both head elementary predication structures. It will be argued that the meaning of "as" is a type lowering device shifting the meaning of its complement NP from generalized quantifier type to property type (where properties are conceived as relations between individuals and situations), while the copula "be" induces a type coercion from (partial) situations to (total) possible worlds. Paired with van der Sandt's 1992 theory of presupposition accommodation, these assumptions will account for the observed contrasts between "as" and "be".
- Real Adjuncts in Instrumental Russian (2000)
- An adjunct-DP in the free instrumental case occurs in a number of surface positions where the DP is syntactically optional. does not depend on any element in the sentence, and has a number of different interpretations. We introduce Bailyn's proposal which postulates a uniform syntactic environment for all the uses of instr. This calls for a uniform semantics of these DPs which can nevertheless accomodate the different interpretations. Starting with the hypothesis of Roman Jakobson about the semantics of the instrumental case we formulate a semantic interpretation theory based on abduction. We give a uniform semantics for three different adjunct uses of instr in this framework. In the concluding part of the paper we discuss some possible alternatives and ramifications as well as questions and objections raised with respect to the treatment proposed in this paper.
- Reinterpretations in Adverbal Modification : A General Approach (2000)
- This paper is concerned with the fact that a number of adverbal modifications involve a systematic reinterpretation of at least one of the expressions connected by the operation in question. It offers an approach in which such transfers of meaning turn out to be a result of contextually controlled enrichments of an underspecified as well as a strictly compositionally structured semantic representation. The approach proposed is general for three reasons: First, it takes into account not only reinterpretations in temporal but also such in non-temporal modification. Second, it allows considering so-called secondary predications as a particular kind of adverbal modification. Third, it explains the respective reinterpretations within a uniform formal framework of meaning variation.
- The Dual Analysis of Adjuncts/Complements in Categorial Grammar (2000)
- The distinction between COMPLEMENTS and ADJUNCTS has a long tradition in grammatical theory, and it is also included in some way or other in most current formal linguistic theories. But it is a highly vexed distinction, for several reasons, one of which is that no diagnostic criteria have emerged that will reliably distinguish adjuncts from complements in all cases – too many examples seem to "fall into the crack" between the two categories, no matter how theorists wrestle with them. In this paper, I will argue that this empirical diagnostic "problem" is, in fact, precisely what we should expect to find in natural language, when a proper understanding of the adjunct/complement distinction is achieved: the key hypothesis is that a complete grammar should provide a DUAL ANALYSIS of every complement as an adjunct, and potentially, an analysis of any adjunct as a complement. What this means and why it is motivated by linguistic evidence will be discussed in detail.
- Semantic Features and the Distribution of Adverbs (2000)
- This paper proposes that we can predict which adverbs cannot adjoin to the right in headinitial languages by means of a particular semantic property, that of being a "subjective" adverb, one which maps an event or proposition onto a scale with the high degree of indeterminacy and context-dependence. Such adverbs, such as 'probably' or 'luckily', cannot adjoin to the right with non-manner readings, while other adverbs (like 'politically', 'often', or 'deliberately') may. This supports the view that the distribution of adverbs depends heavily, and subtly, on their lexicosemantic properties.
- Adverbials with Floating and Fixed Semantic Scope (2000)
- The present study offers the analysis of the role of adverbials in the semantic structure of a sentence. To clarify this role new notions "Adverbials with floating and fixed semantic scope" are proposed. This classification also can clarify the role of adverbials from the point of view of the division into arguments vs. adjuncts.
- Syntactic Requirements on Adjuncts (2000)
- The paper proposes structural constraints for different adjunct classes in German and English. Approaches in which syntax has only the task to provide adjunct positions and in which principles of scope are supposed to explain the distribution of adjuncts are rejected as incomplete. The syntactic requirements are not as rigid as other approaches require, such that there is just one possible position for a given adjunct. Rather the syntactic constraints may be fulfilled in different positions.


text:
ANAHEIM – To illustrate just where baseball has come in 2014, look no further than the job titles of two men with newly created positions in the Angels clubhouse.
Rick Eckstein, major league player information coach.
Nick Francona, coordinator of major league information.
Both owe their jobs to General Manager Jerry Dipoto's plan to capitalize on the current information boom in a way he hopes can be translated to victories.
Information on tendencies of players has been available in increasing volume for years. What the Angels are doing is adding personnel to help convert that information to something useful for coaches and players.
"With the advances that have been made in technology and the information we have access to, we are paying to make sure we have cutting-edge information," Dipoto said. "Now we have to provide it in a premium, cutting-edge way, and that's what we're doing. Taking the next step."
The differences are already apparent to the players, in the form of meetings that are more detailed and involve a few more people. All players now have access to subscription-based software that provides stats and video on their iPads.
The increased use of data is manifesting itself in the way the Angels position themselves defensively. The Angels plan to make more frequent, more drastic defensive shifts.
"It's going to be a lot more shifting," outfielder Kole Calhoun said. "We'll see how it goes. … Obviously there is a bunch of information we can use to our advantage, and the plan is to use it this year."
Dipoto said he's wanted to make better use of the statistical information available since he took over as general manager in 2011.
"We took two small steps in 2012 and 2013," Dipoto said, "and we're now ready to take the big one."
The big step, however, is not necessarily dumping reams of additional information on the players. In many cases, the players might get less. The difference is how the information gets to them.
In the past, the Angels' front office generated advance scouting material that would be delivered to the clubhouse, left up to the coaching staff to interpret and relay to the players.
"Now we have two people (in the clubhouse) whose job is to make sure this information is accurate and digested and that everyone is connected to it," Dipoto said.
Eckstein and Francona act every day as liaisons between the clubhouse and the front office number-crunchers. They came to their new jobs from vastly different backgrounds, which is the idea.
Eckstein, 41, is the older brother of former Angels shortstop David Eckstein. The elder Eckstein coached in college and the minors, eventually becoming a major league hitting coach with the Washington Nationals. He interviewed for the Angels third-base coach job, which went to Gary DiSarcina. Dipoto and Manager Mike Scioscia then approached Eckstein with the idea for this hybrid position.
"I took a step back and thought about it," Eckstein said, "and it sounded pretty interesting."
Francona, 28, is the son of longtime major league manager Terry Francona. He has a business degree from the University of Pennsylvania and he served in combat in Afghanistan as the commander of a Marine sniper unit.
While the most intriguing part of Francona's job is watching replays during the game to let Scioscia know if a play should be challenged, the bulk of his work is helping to create strategies before the game. Francona works closely with Jeremy Zoll and Jonathan Strangio, who watch video and sift through numbers from team offices. They generate a packet of info the Angels use to construct a game plan for each opponent.


text:
Jenny Lewis at First Avenue, 8/3/14
Categories: Concert Review, Last Night
|Photo by Youa Vang
with Apache Relay
First Avenue, Minneapolis
Sunday, August 3, 2014
Jenny Lewis has provided the sound to so many projects over the past 15 years in many other bands. On Sunday night she was back in Minneapolis to show that she has enough charm to carry a night heavy with anticipation on her tiny shoulders -- weird bathrobe and all.
Opening with her newest single "Just One of the Guys," Lewis showcased her songwriting skills. Her writing is subtle, yet very declarative in how she sees herself now that's she's older and more mature. The line from the opening track "I'm just another lady without a baby" keys into the essence of her newest album. When she wails it out, it doesn't come off as remorseful or self-pitying; she sings it more as a matter of fact, and she sings it with a smile.
In an industry that is very much about looks, concerns about growing older are out there. But in typical Jenny Lewis fashion, she brushed them aside. Perhaps that's why she has such a huge following of young women who connect to what she is saying.
|Photo by Youa Vang
"Head Under Water" is the most hook-laden track off her new album, housing a sanguine refrain: "There's a little bit of magic, everybody has it/ There's a little bit of sand left in the hourglass." The track was something that Jenny said she really gravitated towards when writing and was her opener until this tour. Another track off The Voyager, "Late Bloomer," was a highlight. The song is pulled along by Jenny's voice, and it's fantastic narrative songwriting.
1 | 2 | Next Page >>
Sponsor Content


text:
Green Acres Farm
Great Chicken, Great People, Great Farm!
By: John Mascaro (Nov 9, 2010)
We've been buying chicken from Green Acres Farm for over 2 years now and very much appreciate the care and dedication which which Kimberly and Mark Casson bring to their organic birds. In our case, we're lucky to have them so close to our own home, but any family will benefit from Green Acre's naturally raised & fed poultry, many of which we've seen raised from chicks!
As to prices: it's the old saying...you get what you pay for. You want "the real deal" in organic and naturally raised, truly "free roaming" birds, you gotta be willing to invest in your health and nutrition and the well being of your family. Compare prices and you will not find too many other farms with such reasonable offerings within many miles. And forget about the store-bought birds: low prices, yes; as organic and healthy as Green Acres....not necessarily. You can either pay a little more for your organic food and better health now or pay a little more for health care and medication later. We choose the former.
As the TV show once said: "Green Acres Is The Place for Me!"
Comments on this Review:
No comments posted...