text:
US 20030005074 A1 Abstract A communications method utilizes memory areas to buffer portions of the media streams. These buffer areas are shared by user applications, with the desirable consequence of reducing workload for the server system distributing media to the user (client) applications. The preferred method allows optimal balancing of buffering delays and server loads, as well as optimal choice of buffer contents for the shared memory buffers.
Claims(1) 1. A method for reducing bandwidth utilization in a system for distributing digital continuous media information from one or more servers, where users of the system are connected to a shared continuous media buffer and the buffer is shared amongst the users based on usage, consisting of the steps of:
i.. The user requesting a continuous media stream from the server; ii. The server periodically sending encoded packets to the user representing portions of the media stream; iii. A buffer shared by multiple users capturing the packet into one or buffers for redistribution to the user. iv. Servicing later requests arriving within a bounded interval for the same buffer. Description [0001] The present application claims priority from U.S. Provisional application 60/199,567, filed Apr. 25, 2000. [0002] 1. Field of the Invention [0003] The present invention is in the field of digital communications systems, and more particularly, communications systems which transport continuous digital media such as audio and video. [0004] 2. Description of the Prior Art [0005] One of the most important forms of information in digital communications systems is continuous media, exemplified by digital audio and digital video. An example application would be transmission of a movie or live information between a service provider and a user. The traditional method of providing such a service is the broadcast network, exemplified by broadcast television or cable television. Models for future information systems use the concept of integrated services, where voice, video and structured information services such as the world-wide web (WWW) are delivered over a single logical transport service, the packet-switched Internet. [0006] To use such a system, the audio and video information must be encoded in digital form, and packetized. To reduce the use of network resources, the information might be first encoded in digital form and then compressed. The advantage of compression is a significant reduction in data volume, while the disadvantage is the complexity of the algorithms required for encoding and decoding the compressed information. For example, directly encoding NTSC signals from a television system requires about 100 megabits/second of bandwidth, meaning that a two hour video, at 720 megabytes per minute, would require about 100 gigabytes of storage. Encoding the signals using the MPEG 2 compression scheme typically reduces the bandwidth required to about 1.5 megabits/second, or 12 megabytes per minute. With such compression an entire 2 hour movie could be stored in about 1.5 gigabytes of storage. MPEG 2 is designed to require significantly more computation to encode than to decode, as it is presumed that service providers can afford to perform the expensive operations once, in order that the inexpensive decoding operations can be performed many times by receivers. This assumption is clearly true for a stored video, where the encoding is done once and then decoding is done whenever the video is viewed. [0007] When a system is constructed to distribute digitized continuous media to many users, there are a number of attractive opportunities for architectural techniques which can reduce system load in addition to any gains achieved by operations performed on the media such as efficient coding. In particular, a powerful technique is multicast, where the information is not sent to all possible recipients, but rather those who indicate interest, perhaps by subscription. To the degree that sharing can be achieved, e.g., the sharing of a viewing service which plays the video into the network, significant savings can be realized. For example, rather than sending multiple copies of the same video stream, each at 1.5 megabits/second to a significant population of users, the video might be sent once via multicast to the set. [0008] Multicasts are typically represented as acyclic directed graphs called trees, where the server lies at the root of the tree, there are a set of intermediate nodes interconnected by network links which transport information to leaf nodes, at which are located users. A key feature of the intermediate nodes is their ability to replicate information to several nodes in the direction of the information flow, so that eventually the information travels from the server to all interested leaves. [0009] This basic model assumes that the users are all interested in receiving the same information at the same time, e.g., a �scheduled� time for a broadcast event, such as a sports event or a concert. When users join the multicast at some later time, they may lose the first part of the event (which they may be interested in) as it is not saved (or �buffered�). For viewing of archived material, such as replays of videos on demand, the points at which users are interested and start the viewing will vary sufficiently that multiple time-skewed copies of the digital continuous media may be being served to users at any given time. [0010] The difficulties with this situation are two-fold. First, the server is busy sending and resending multiple multicast streams of essentially the same information. Second, the advantages of multicast accrue to the degree that information is replicated�unicast, or point-to-point transmission, can be consider a degenerate case of multicast, and in fact will be the case when there is no shared interest in a continuous media stream. Thus, to the degree in which we can aggregate demand for continuous media streams, we can optimize overall system performance. [0011] In accordance with the present invention, a communications method utilizes memory areas to buffer portions of the media streams. These buffer areas are shared by user applications, with the desirable consequence of reducing workload for the server system distributing media to the user (client) applications. The preferred method allows optimal balancing of buffering delays and server loads, as well as optimal choice of buffer contents for the shared memory buffers. [0012] The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself however, as well as a preferred mode of use, further objects and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein: [0013]FIG. 1 is a block diagram illustrating multicast over a network; [0014]FIG. 2 illustrates shared use of a buffer; [0015]FIG. 3 is a diagram illustrating use of a double buffer; and [0016]FIG. 4 is a timing diagram illustrating buffer sharing. [0017] It will be appreciated by those skilled in the art that the following description illustrates techniques that can be utilized in various types of systems. The preferred embodiment is described in the context of an internet system such as is generally known in the art. [0018] Multicast Traffic [0019] In a store-and-forward packet-switched network, multicast is effected by multicasting the packets of data as they arrive at a node in the multicast tree. In practice, the node is a switch, router or other device which receives a multicast packet on an input port, and sends the packet on one or more output ports in accordance with the topology of the graph describing the multicast of the data to users. A multicast from a server to a number of users is illustrated in FIG. 1. [0020] To perform this operation, the packet must be stored in a buffer memory. In practice, the buffer memory may contain a queue of multiple packets. In the continuous media case, a queue containing a sequence of packets represents a segment of the continuous media stream. When the queue consists of large numbers of packets, substantial storage of media can be achieved within the constraints of the node's memory capacity. [0021] While it is often the case that the buffering is mainly used to effect flow control, that is, to mitigate rate differences between senders and receivers, the presence of buffering capability in nodes allows other optimizations where the buffer capacity, e.g., the queued packets, can be shared or reused effectively. The advantage of sharing and reuse is that once the packet has been transmitted to a buffer, it need not be transmitted from the server to service a user if the user can be satisfied with the buffer contents rather than with an additional independent stream sent by the server. [0022] The difficulty in buffer reuse is independent start times for the multicast streams, as what is in the queue of packets destined to a particular user may not be the same data as that required by another user. To the degree that work (e.g., the transmission of data from one node to another) can be avoided through sharing, the system will perform better. An example of better performance would be more concurrent users operating with a reduction in bandwidth relative to similar systems. [0023] Shared Buffers [0024] Each segment of buffered continuous media represents the result of work done by the network to transport the digitized continuous media to the buffer. Thus, to the degree that the contents of the buffer can be shared, the work of transporting the continuous media to the buffer can be shared. An essential observation is that there is a clear relationship between buffer occupancy and time: each buffer segment of size B bytes represents a playout time of B/R seconds, where R is the encoding rate in bytes per second. A related observation was made in John H. Shaffer, �The Effects of High Speed Netwoks on Wide Area Distributed Systems�, Ph.D. Thesis, CIS, University of Pennsylvania, 1996. [0025] The central observation used in our approach is that if additional viewers arrive within B/R seconds of the start time of the original playout, these additional viewers can utilize the contents of the buffer segment rather than requiring additional network bandwidth for transmission. To be specific, if the arrival time of viewers V1 and V2 is separated by less than B/R, they can share a buffer segment. This is illustrated in FIG. 2. [0026] While a related idea was employed in U. Legezda, D. Wetherall and J. Guttag, �Active Reliable Multicast�, Proc. Infocomm 1998, SF, Calif. to reduce required bandwidth in a reliable multicast, the sharing was different, in that it was used for recovery of lost multicast packets rather than as a support mechanism for multicast of digital continuous media. The key basic point of our method is the use of a per-recipient pointer (an index) into the shared buffer to reflect the differences in start times. By use of this pointer, the buffer contents can be effectively shared. [0027] There are a variety of parameters which can be adjusted in the design of such a system. First, to the degree that whole instances of digital continuous media (for convenience, we will call these �files�) can be buffered, there is significant advantage to be had in that the buffer management algorithms are simplified. This is because the algorithms need to spend less effort managing the differences in buffer refresh rate caused by supporting multiple start times. This management cost is incurred if the whole file is not available, as to save bandwidth, the buffer contents must be retained until the last viewer is done with them, i.e., their pointer has advanced to the end of the buffer. This problem is easily addressed if the well-known technique of double-buffering is employed to manage two buffers of size B and the start time deltas are limited to B/R, as above. In the double-buffering technique, one buffer is drained by the viewers while the other is filled from the network, and this solution allows the time-separated viewers to share the 2*B space. The technique is illustrated in FIG. 3. [0028] The same effect can be achieved by limiting the time differences between V1 and V2 to B/(2*R). [0029] Optimal Sharing of a Single Buffer [0030] There are a variety of techniques for buffer management which can make use of the buffer capacity to better store continuous digital media. To review some of the techniques used in U.S. Pat. No. 5,754,938, issued May 19, 1998 to Herz et al, and U.S. application Ser. No. 09/024,278, filed Feb. 17, 1998, both hereby incorporated by reference hereinto, the buffer contents can be: [0031] 1. Selected based on statistical modeling of the user based on similarity measures derived from previous viewing. [0032] 2. Can be prefetched in advance of viewing demand in order to smooth demands on bandwidth. [0033] 3. Can be prefetched in anticipation if possible viewing demand based on similarity measures for the viewers sharing the buffer. [0034] 4. Can be retained in anticipation of new viewers requesting the stream based on similarity measures for users sharing the buffer. [0035] While we incorporate by reference the two Herz, et al. patents, we wish to expand slightly here on point 4. This point suggests that the contents of a buffer should be retained even after all current viewers have viewed the content if either there is no demand for the space it is occupying from other content requests, or if the likelihood that it will be used again soon is higher than the likelihood that any prefetched content will be used soon. In effect, the retention decision is one which takes advantage of the fact that a desirable prefetch is already in the buffer. Excepting this observation, the similarity measures and analysis are included by reference to the other patent and filing. [0036] The single buffer case is then optimized by the following algorithm, applied at each discrete time step in the buffer's existence: [0037] 1. If the buffer is being used by one or more viewers, examine another buffer. [0038] 2. If the buffer has been used recently, estimate the probability that it will be reused in the near future (e.g., a time interval such as B/R). If it is likely, examine another buffer and mark the buffer �RETAINED�. [0039] 3. If the buffer is marked �EMPTY�, and a non-�DOUBLED BUFFERED� buffer is being used by the maximum number of viewers, fetch the next B bytes of the continuous media stream into the new buffer to achieve double buffering and mark both buffers �DOUBLE BUFFERED�. [0040] 4. If the buffer is marked �EMPTY� and similarity measures show that prefetching more of the stream would optimize performance of the users of the buffer, mark the buffer �PREFETCHING� and request that a continuous media stream of B/R duration be sent to fill the buffer. [0041] 5. If a buffer is PREFETCHING and a buffer is required for on-demand traffic, mark the buffer �EMPTY�. [0042] 6. If the buffer has been used, and it is unlikely to be reused in the near future, mark it �EMPTY�. [0043] 7. If the buffer has not been used, mark it �EMPTY�. [0044] An interesting consequence of this algorithm is that highly popular data will be either completely prefetched or after prefetching and/or viewing, wholly retained. Thus, without explicitly requiring whole file caching, the system will naturally achieve it, and will do so on the basis of statistical usage and estimation measures. [0045] There are additional gains to be made because streams are generally served over relatively lengthy periods of time and are consumed sequentially. This is especially true for such data types as audio and video programming. Because the full stream is delivered to a particular point, it is possible to predict content demand quite precisely for the following minutes or even hours. Moreover, when geographically proximate nodes are conveying the same stream, even at a time shift, it is possible for them to economize on upstream bandwidth. [0046] For example, if node N1 in the network is relaying frames from the FIRST hour of Citizen Kane to one or more downstream users, then the probability is extremely high that it will eventually have to relay frames from the SECOND hour in Citizen Kane, and we can accurately estimate when it will have to do so. [0047] If some nearby node N2 happens to have such frames in a buffer (e.g., N2 is already relaying the second hour), then it is cheap for N1 to get those frames. This cheapness is temporary: N2 isn't going to keep the frames forever, so it may make sense for N1 to immediately copy N2's frames�that is, to prefetch them. [0048] In other words, N1 is getting its stream from the head end, but it is also monitoring N2's stream and caching it for later. Eventually N1 will be able to switch to the cache, at which point it can drop the head end. [0049] Note that the streams don't need to be transmitted at the same speed at which the user will consume them�with additional bandwidth, it would be possible, for example, to send a node the remaining head end of a video stream in a rapid burst. If multiple streams are being fed to a localized cluster of nodes, such a bursting strategy would allow the many streams to be rapidly collapsed into very few (if not one) shared streams, greatly decreasing bandwidth use by the locale. [0050] More complex probabilistic strategies are also possible, with each node participating in a self-organized market, requesting and taking bids for slices of bandwidth. [0051] Optimal System Design with Buffers and Servers [0052] It is obvious that the scheme can be applied to a server with a single buffer. When a more complex system, such as that in FIG. 1 is constructed, the buffers can be viewed as a shared resource and as multiple layers of intermediate capability. In such a system, we can use a hierarchical scheme, so that individual viewers using a single buffer are replaced by multiple viewers sharing a buffer, which in turn shares buffers in the multicast tree. Further, the buffers can cooperate amongst themselves to share caching capacity, and further, the similarity measures of the patents included by reference can be localized to the population of viewers near the particular buffer. In such a case, the population statistics are localized. Caches that are higher in the tree (nearer to the server) aggregate more and more traffic, but have better models of user demand from the aggregated demand of the buffers which are presenting aggregated demand to them. [0053] Additionally, multiple servers can be used. In this case, buffers may communicate with multiple servers based on the demands of their users, and prefetch information based both on user interest and aggregated interest, and capacity of the server being used. [0054] The advantage of these architectural advances for scaling is significant. Information in caches near the edges of the system is localized to the user interests represented by the similarity measures applied to the continuous digital media or descriptive information associated with it. Each level of buffering in the hierarchical multicast demand aggregates various levels of interest and optimism in prefetching data: data prefetched by many buffer caches on behalf of their clients/viewers will be more likely to be buffer resident where higher levels of aggregation ensue. [0055] VI Demand Aggregation of Data Streams as an Optimally Bandwidth Conserving Form of Pre-Fetching [0056] The following technical methodology describing similarity-informed pre-fetching (the subject of a co-pending patent application by the inventors of the presently disclosed invention) provides an underlying technical framework for the object of the novel innovative concept introduced within this section which is the aggregation of data streams based upon capitalizing upon aggregate demand prediction of a sub-population of users who are imminently likely to request a particular file (a standard file or a streaming file). Similarity-informed pre-fetching provides a fundamental technical basis for demand aggregation of down-loaded data streams with a few fundamental differences as are explained further below. [0057] Bandwidth is greater at the root end of a hierarchical node network system, in anticipation of a request, it is prudent to use the similarity measure to predictively cache files into local servers and further to narrow-cast selections into given distribution cells and (hierarchical) sub-cells through sub-servers based on what selections are most likely to be requested in each cell so as to significantly increase the utilization of bandwidth via this hierarchical narrow-cast configuration. The importance of this savings appears in proportion to the degree of granularity (smallness of the cell) in the narrow-cast architecture. This technique can also be used to make decisions for scheduling what data should be placed on dedicated channels. This may be more network-efficient if a file were popular enough to be continuously in the queue because upon submission of a request a file may be partially downloaded regardless of where in the length of the file the download began. The (initially) missed portion of the file can then be immediately picked up as the file narrow-cast starts over, thus completing the download in the same time period as if a special request for the file were made. Mobile users whose geographic locations are known can have files pre-cached (e.g. at night) into the servers which are presently physically closest to them at any given time. [0058] The present data distribution system employs the idea of pre-fetching, which has also been referred to as pre-caching, cache-pre-loading, or anticipation in the technical literature. The basic idea is that if good predictions of future data requirements are available, and there is excess data-fetching capability available, the data should be fetched aggressively in anticipation of future needs. If successful, this technique has two major benefits applicable to present and future networks. First, it can reduce (i.e., improve) response-time, a major performance advantage in interactive systems. Second, it can reduce congestion and other problems associated with network overload. To understand how the responsiveness of the system is improved, the unused bandwidth can be used to transmit information likely to be used in the future. For example, if a list is being traversed 1,2,3,4, it is likely that if object N has been requested, that object N+1 will be the next request. If N+1 is pre-fetched from the remote system, it will be available when the request is made with additional delays. All of the �UNUSED BANDWIDTH� can potentially be used to pre-fetch. [0059] Within the context of the pending patent on the pre-fetching concept entitled �Broadcast Data Distribution System with Asymmetric Uplink/Downlink Bandwidths� one of the key objectives is it involves the use of pre-fetching as a congestion control technique as if we pre-fetch successfully during more lightly loaded periods (such as TIME=0.42), we reduce the probability of data being requested in the futures, essentially trading the guarantee of a fully loaded network today for the promise of no congestion in the future. By fetching data in anticipation of future needs, we reduce (at least probabilistically) those future needs. [0060] Pre-fetching has been used in the computer operating systems field for several decades, and a variety of algorithms have been explored. A. J. Smith of Berkeley has reported that the only case where successful predictions about future requests for memory objects can be made is when accesses are sequential. More recent work for higher-level content such as World-Wide Web (WWW) hypertext has shown that user-authored links to other hypermedia documents can be followed with some success. [0061] The pre-fetching technology which the inventors of this disclosure have previously invented is based on unused slots being filled with pre-sent information based on our understanding of user interest using the similarity measures developed in the issued patent entitled �System for Generation of User Profiles for a System for Customized Electronic Identification of Desirable Objects� (U.S. Pat. No. 5,754,939) and used for our prioritization (see p. 18 of the above-referenced invention disclosure), a concept that they do not deal with, as they follow http: links based on observations about the high probability that these links will be followed by users. [0062] The pre-fetching invention may be usefully applied within the context of set-top box like devices such as personal digital assistants or network computers, or personal computers used as a form of set-top box as well as any type of �fat client� as a method of reducing response time as observed by users. This method used �links� to other documents embedded in an HTTP-format file as hints that those links should be followed in pre-fetching data; that is, the linked documents should be fetched in anticipation of the user's desire to follow the links to those documents. [0063] The present invention provides two enhancements to this scheme. First, it provides a technological means by which the pre-fetched data can be intermixed with on-demand data to provide overall improvements in response time to a large population of HTTP/WWW users, with reduced memory requirements. Second, t-he present invention, which views the down-link as a fixed capacity resource, provides a general scheduling method embodying techniques such as user preferences to pre-fetch when slots or bandwidth are underutilized, to preemptively reduce future demand for bandwidth. [0064] In addition, the similarity measures which suggest: [0065] 1. An anticipated behavioral similarity between different though metrically �similar� users may be used to further analyze other previous user's on-line behavior as well as, [0066] 2. Page similarity to other links, which the user has an explicitly or implicitly (predicted) affinity towards, may be a technique to further improve predictive accuracy as to which of the available links the user is probabilistically most likely to imminently select next (compare to aggregatively using the overall popularity of those links). [0067] The general technique of using similarity-informed pre-fetching is described at length in U.S. patent entitled �Pseudonymous Server For System For Customized Electronic Identification Of Desirable Objects�, U.S. Pat. No. 5,754,938 filed Oct. 31, 1995, issued May 19, 1998. [0068] The technique of data-streams is based upon a similar variation of the type of similarity-informed pre-fetching, which is performed on a relatively dynamic basis as suggested below. A couple of fundamental extensions to the basic technique are added, however. Unlike dynamic similarity-based pre-fetching, because there is a certain degree of predictive error, which invariably occurs though the present techniques attempt to anticipate imminently forthcoming file requests on the part of the user (and where the error rate exponentially increases in proportion to the length of the anticipatory period), the basic goal of this dynamic pre-fetching is increasing speed of user access to page requests at the expense of the additional bandwidth, which is consumed as a result. However, in the case of data stream aggregation the key objective is to minimize bandwidth utilization. This approach also results in the ability to not adversely affect speed of access to the data. Although its use is in no way limited, it is likely that the present approach to pre-fetching basic data stream aggregation may be particularly well suited for delivering data to the leaf end nodes of the network [0069] Compared to similarity-based pre-fetching, the key modification in the basic method (and certainly technical challenge) of pre-fetching based data stream aggregation is the following: [0070] In similarity-based dynamic pre-fetching (as suggested above), the similarity measurements of the predictive data model anticipates, on a dynamic basis, the forthcoming file request actions of the user. In fact the outputs, i.e., probabilities of a given user requesting any given file, can be measured as a function of time (T). If this measurement is based upon the entire subset of that user population which has at least some non-zero probability of imminently selecting that file, we, in turn, may determine the aggregate probability of that file to be requested by the entire user sub-population (i.e., which is serviced by a particular data distribution server) as a function of time. Of course, in accordance with the probabilistic model, this aggregate probability curve (of average likelihood of the user population to initiate the request) changes on a moment to moment basis changes in accordance with further behavioral feedback of the sub-population as time (t) approaches the average (probabilistically most likely) time for overall demand for that file to culminate (however, this value remains fixed for our purposes as once a pre-fetching decision has been made any subsequent probability shifts are irrelevant). The point in time at which a data stream is scheduled to initiate is T1 and the end is T2. There is another important relationship which is within a given average probability measure the actual time from the point in time which is that moment that the user population on average is anticipated to actually request the file. We will call this value Tb1. The end of that period is called Tb2. We want to also determine the average effective available memory of each relevant user's client's local buffer, however, this value is also affected by such variables which compete for this space such as how much of this memory had been pre-allowed to long-term pre-fetching (the relative proportions of such allocation of which would be determined through experimentation and may be network specific) and how much �risk diversification� is provided for i.e., the probability distribution for any given individual at any give instant in time (t) preceeding an actual request is very likely to contain secondarily another (or other) file(s) with some non-zero probability. Thus the total probability (and possibly relative probability) determines available buffer memory for the present anticipated file request. For purposes of the present estimation, this value is called ΔTb and is measured as the amount of time that the present effective available memory buffer for that client is able to receive the data stream associated with the present anticipated forthcoming request. [0071] We then want to select a time T to actually request the file for delivery to all the relevant users U based upon the average of the product of probability (of making the desired relevant file request) (Pb) and time such that T1's value is such that period. [0072] T1−T2 provides the maximum possible product of probability and time for all relevant clients' buffers collectively (that are able to concurrently co-exist within period T1−T2). (the fixed value describing the period of the data stream) Based upon these variables the key technical challenge of pre-fetching-based data stream aggregation is determining values of T1−T2 which achieve optimality in reducing bandwidth consumption in the multi-cast of that particular data stream. This is represented in FIG. 4 by our attempt to find a T1 value optimizing the area described by probability and time within the T1−T2 period. The following equation is provided: (T1−T2)={ΔTbPbZ+(ΔTb+1)(Pb+1)(Z+1)+. . . }(mean average) [0073] where Z is the percentage of Tb1−Tb2 which overlaps with T1-T2. [0074]FIG. 4 depicts graphically how a key objective of the above equation is to find a T1−T2 value which maximizes the (2 D) area under the various client buffers collectively in a probability time graph. [0075] Finally, in light of the present technique because the predictive models are prone to a certain degree of oversight, i.e., not anticipating the forthcoming request actions certain uses for a given file or not the accurate timing therefore (e.g., not anticipating the request action soon enough) there will invariably exist certain inefficiencies in the present model in which certain user request data streams are not properly (or not at all) aggregated, thus, we would like to provide yet another additional solution to more efficiently aggregate these inefficiently transmitted streams. The idea is that if a local client buffer has failed to initiate download of a stream (or has initiated it after its initialization, we can effectively re-transmit the �missed� portion of the stream to the new requester at a very fast rate (e.g., if it is streaming media content, considerably faster than real-time) up until the point in which the data received by the new requester �catches up� with the original stream at which time both the new requester and original requester(s) then share the same stream for the remainder of its duration. In such an event the bandwidth utilization specifically allocated to that missed portion of the file we could say becomes �bursty�. Due to the somewhat different mechanism of both data stream aggregation methods, in trying to achieve optimal bandwidth utilization the degree to which this additional approach to aggregation should be relied upon compared to the original pre-fetching based approach (that is to say from a probabilistic standpoint how speculatively do we want to pre-fetch versus rely upon effectively the present (�fall-back�) approach of using burstiness of transmission to compensate for the resulting �missed� requests of the predictive (anticipatory) approach. This balance between the degree of utilization of these two methods my also be a bit subjective in as much as if bandwidth is (presently) overly constrained, the system may automatically adjust by relying more heavily upon the original technique of pre-fetching based data stream aggregation (and certainly even more towards artificial delays in as much as bursty data stream aggregation while involving no delays in initiating does involve some degree of extra bandwidth utilization during the �bursts�. Of course, as part of this pre-fetching procedure and (relatedly) the ) the number of files provided a given probability distribution for forthcoming requests of those files must also be determined through further experimentation. [0076] In another form of data stream aggregation called �artificial delays�, described further below, speed of access to the user is invariably compromised in direct proportion to the degree of data stream aggregation which is desired for reducing bandwidth. In the presently described version of data stream aggregation (as is also true in the case of artificial delays), although it may be variable, on the average, the number of users serviced by the data distribution server as well as the degree of popularity of the particular file being presently requested by the user relative to that particular population of users, is directly proportional to the speed of access by the user to that particular requested file. Accordingly, non-dynamic pre-fetching (also detailed above), because it is both non-dynamic in nature and also achieves a reduction in overall network traffic can be used in combination with the present pre-fetching based data stream aggregation in order to provide an optimally efficient traffic reduced network environment, and as is further described below there are further bandwidth reduction optimization techniques which allow for the approach between the intermediate node and leaf end of the network while allowing for non-dynamic similarity-informed pre-caching and the most bandwidth efficient data stream aggregation technique, i.e., artificial delays to occur on nodes close to �trunk� portion of the network where the potential number of user connections represented is extremely large and thus potential for bandwidth conservation, using artificial delays is extremely great. On the other hand, if near the leaf end of the network further bandwidth conservation is desired, it is even possible to provide the technique of artificial delays in combination with static pre-caching and dynamic pre-fetching based data stream aggregation. And this approach may be particularly compelling in achieving substantial bandwidth conservation if the end-user population (or number of network �leaves�) is quite large. [0077] Artificial Delays [0078] This note discusses the notion of �artificial delays� in the queuing of requests for the satellite or cable system to which our set top boxes are attached. The idea is that by careful management of the queues, we can effect significant bandwidth savings for the system as a whole. If you will remember, the Server scheduling algorithm (I've attached the text for it from the DBS scheme I sent during the Summer at the end of this e-mail) goes like this: [0079] The client set-top box (of which there should be many) sends REQUESTs for information in cell-sized units to the server system. The server system applies a priority algorithm (see especially Step 10, below) to CHOOSE the next cell to send. By design of the relative priorities, we can get good responsiveness and reduced bandwidth needs, in spite of the low memory needs (and low cost) of the set top boxes. [0080] Imagine the scenario where there are MANY set tops connected to the server. This situation might be where the Cs are Clients and the S is a Server. Now clearly, there is a multiplicity of Clients, and by virtue of this multiplicity, we may be able to achieve a savings through appropriate delays. I again believe the similarity measure is the key to success here, and to novelty. Consider the cell requests for Clients C1, C4 and C5, shown below using letters to indicate particular cells as discussed in our disclosure text. [0081] C1: E-T-A-O-I-N-S-H-R-D-L-U . . . [0082] C4: N-A-T-I-O-N-A-L-V-E-L . . . [0083] C5: E-A-T-O-N-L-Y-S-U-D . . . [0084] We mark these cell request with times associated with their transmission intervals: [0085] T: [0086] I:0000000001111 [0087] M:1-2-3-4-5-6-7-8-9-0-1-2-3 . . . [0088] E: [0089] Now, for convenience, assume that all of the cell requests show above have the same priority. Then the server might actually send the following sequence of cells over the channel: [0090] S:E-N-E-T-A-A-A-T-T-O-I-O . . . [0091] Thus, we are servicing the cell requests C1-C4-C5-C1-C4-C5 . . . (in fact, the Server may notice the overlaps between requests by C1 and C5 in the first interval, C4 and C5 in the second interval, C4 and C5 in the third interval, and C1 and C5 in the fourth interval, giving: [0092] S:E-N-T-A-A-T-O-I-I-O-N-N . . . [0093] ) [0094] Imagine that the clients are always listening. Then, we can delay cell requests in the HOPE that the REPLYS can be MERGED, satisfying multiple set-top-box clients with the same REPLY. To make this concrete, consider delaying service by one period. So the output of the server then looks like: [0095] S:#-E-N-T-A-O-I-N-L-S-A-Y . . . [0096] What is going on here is very subtle. By delaying some clients service requests, we are INCREASING THE PROBABILITY that another such request will come in, which can we can fold into service of the equivalent delayed request. The cost is potentially in delay, but with enough overlap, the cell times are short enough for 48 byes on a DBS channel that we can probably delay significantly. [0097] Considering the problem theoretically for a moment, we can compute the gain for the an acceptable delay D as being the number of redundant transmissions which are eliminated due to a delay D. So, for delays of from 1 to 10 cell times the total number of DBS cells without redundancy checks is 30; the number required when this small optimization is applied is as shown below: [0098] Delay DBS CellsBandwidth Savings [0099] 02430/24=25% [0100] 11830/18=66% [0101] 21730/17=76% [0102] 31730/17=76% [0103] 41530/15=100% [0104] 51530/15=100% [0105] 61530/15=100% [0106] 71530/15=100% [0107] 81530/15=100% [0108] 91530/15=100% [0109] 101430/14=114% [0110] We compute the bandwidth gain against the dumb use of 30 cell times; the bandwidth gain comes from the fact that the synchronous satellite channel gives us a fixed bandwidth, giving a fixed number of cells per unit time, and we have just saved 16 cell times by use of the delay scheme. For this example, at this point no more gain is possible, since all the duplication has been eliminated. In some sense, this behaves like a compression scheme. The similarity algorithm increases the probability that these overlaps will occur�the ideal situation is we are waiting long enough so that the scheduled broadcast cell satisfies almost all requests for that cell within a significant time intervals (say several milliseconds). [0111] Optimal Stream-Handling Techniques as a Function of Node Location in the Network. [0112] The method by which streams are handled depends in part on a node's location in the network. [0113] A node close to the network's �trunk� will often be best served by artificial delays and pre-caching techniques, whereas nodes closer to the network's �leaves� more efficiently make use of demand aggregation and pre-fetching. [0114] The particular topology of a given network will determine the distance a node must be from the center in order for the �leaf� approaches to be more appropriate than the �trunk� approaches. [0115] Long-Term vs. Short-Term Pre-Caching Due to the relative importance of responsiveness compared to relative bandwidth savings opportunities at the edges (leaf ends) of the network compared to the trunk, dynamic pre-fetching (and pre-fetching-based data stream aggregation) may be efficiently utilized near the network edges while more static (long-term) pre-caching )may be more appropriate closer to the trunk nodes of the network. Also at this trunk level because the number of repetitive requests artificial delay based data aggregation is very efficient and because of the rather large storage capacity associated with this repetitive file traffic, long-term pre-caching is certainly ideal. [0116] Automatic Adaptive Shifting to Other Techniques [0117] E.g., if/when traffic congestion and slow down at the edges occurs, it may be prudent to shift the relative degree of utilization of one technique to another, e.g., in the present scenario the use of artificial delays may be able to significantly reduce delays through relieving congestion. Pre-fetching-based data stream aggregation may also provide useful advantages. [0118] As a result, different levels in the network have different traffic and storage characteristics (and relative responsiveness priorities). The selection and relative dependence upon one of the above techniques versus another may be different at these different levels and the desirable optimizations requiring different uses and priorities of these various techniques may change at any given level in the network and at any given time based upon these dynamically changing characteristics of the network traffic (to the extent that these dynamic characteristic changes are not pre-determinable using existing network traffic intelligence solutions). [0119] Likewise, because both probability and statistical confidence (degree of certainty) varies even between different files which are predictively anticipated (using pre-fetching-based data stream aggregation), the use of this method (the degree of reliance) of this method, may vary even between anticipated file requestion, e.g., it may be advantageous if the probability of a file being requested is low or the statistical confidence of a file (even the most �likely� file) to make the anticipatory period for requesting that file low (i.e., less speculative) in order to rely more upon bursty data stream aggregation (or artificial delays particularly in these latter two techniques the period of anticipation may be ideally further minimized if/when these other techniques are utilized with higher relative importance. [0120] Consideration for Pre-Fetching Based Data Stream Aggregation [0121] In addition, because data stream pre-fetching aggregation is a very important technique for providing bandwidth conservation (an important need for the leaf ends of the network), while also providing a high degree of responsiveness to requests, it may also be important to insure that the appropriate technique (or combination of techniques) as suggested above is utilized to insure that files reach this bandwidth bottleneck in the network, (e.g., the intermediate node just prior to leaf end node) such that pre-fetching data stream aggregation at this level can occur extremely efficiently without uneccessary efficiency consequences resulting from delays higher up in the network (e.g., this may be especially true in the case of the wireless network example). [0122] Additional Considerations [0123] 1. Streaming vs. Static Files [0124] This description has been focused mainly on streaming types of data. However, packet analysis at the backbone level could identify metrically close data transmissions of any sort (that is, streaming or static (�static� meaning non-streaming). Thus, when two proximate nodes download the same extremely large data file of a non-streaming sort, they could use a shared buffer to reduce their external need of bandwidth to a single connection. In the end, this architecture handles files of both the streaming and static types in very much the same way. [0125] 2. Tradeoffs between Bandwidth and Memory [0126] In all of these examples, there is a continuous tradeoff between bandwidth and memory: if a great deal of bandwidth is available, there is little need for localized buffers�every user can afford an individual real-time connection and therefore has no need to store any streams. On the other hand, if a great deal of memory is available, the permanent storage of all incoming streams to a local server would eventually reduce the need for external bandwidth. [0127] Exemplary Applications [0128] The network architecture described in this patent can be embodied in many relevant applications. Note that although a few are described here, the architecture is generally applicable to any situation in which multiple proximate (relative to the network) users will potentially access the same stream of data within some period of time. [0129] 1. Neighborhood Server [0130] A subdivision of homes is linked by high-bandwidth lines to a shared, local server which acts as the neighborhood's central portal to the Internet. Using residents' video preference profiles, the server predicts which movies or television programs are most likely to be requested as downloads, and buffers (for example) the first � hour of the 50 most likely selections to local memory. This could best be done during the day, when residents are more likely to be at work, temporally smoothing the neighborhood's demand for bandwidth. [0131] In the evening, if a resident happens to select a video stream which has already been front-loaded in the local server, he is sent data directly from the local buffer. If no other resident requests the same program, the single user is switched to an external stream when the buffer has been exhausted. However, if several residents select the same program at roughly the same time (that is, within the � hour buffer), the server continuously downloads (and buffers) a window of streamed data that spans the users' timings. For example, Resident A starts watching Citizen Kane; for the first � hour he is initially fed a stream from the local server. Suppose 5 minutes later Resident B also starts to watch Citizen Kane. When A reaches the end of the � hour buffer, the neighborhood server starts to draw Citizen Kane as a stream directly from the internet, pushing it to A directly, and then saving the stream to a continuously-refreshed five-minute buffer. B is fed from the end of the buffer, just before the stream is finally cleared from memory. In this way, rather than opening two high-bandwidth connections to the Internet, the local neighborhood server needs only open a single high-bandwidth connection and allocate enough memory in its local buffer to hold five minutes of video programming. When multiple residents watch the same programming at fairly similar times, this method greatly reduces the subdivision's overall need for external bandwidth. [0132] Note too that peer-to-peer (P2P) methods could be used to expand the neighborhood's available storage�the neighborhood server would be given permission by residents to temporarily make use of memory or hard disk space that they are not currently using on their own home machines. This would expand the number of stream front-ends that could be prefetched. [0133] 2. Demand Aggregation for Wireless Electronics [0134] Demand aggregation techniques would also be useful in the case of wireless devices�if many users in a particular locale exhibit similar data needs (such as Wall Street executives checking popular stock prices periodically), bandwidth could be conserved by continuously sending the information in a single stream to a server connected to the local wireless transmitter. [0135] 3. Optimization of Web Page Delivery [0136] While a user peruses a given Web page, it would be possible to prefetch many of the pages to which his current page is currently linked. Then, when the user clicks a hyperlink, because his selection is already in the local buffer it can be delivered almost instantly. Obviously, this could be made more sophisticated, with probabilistic methods used to determine which pages are most likely to next be chosen by the user, and thus which are the most logical candidates for prefetching. [0137] While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention. Referenced by
Legal Events
Rotate |


text:
The Petition for Tumblr to Add a Dislike Button
On Tumblr, users are able to "reblog" and "like" (and sometimes "answer" and/or "reply") text, photos, audio, and video posted by the people they are following. However, there is not a "dislike" option. While it is understandable that, logically, it makes more sense for people to simply do nothing with the post in question if they don't like it, it would also make sense for people to be able to actively show that they dislike it - or, more likely, that it makes them sad to see it, but that they are glad that they did. We, as Tumblr users, propose that a broken-heart-shaped "dislike" button be added to the list of available actions on the dashboard and on people's personal blog posts.
Recent signatures
Courtney, United States
2 years ago Comments: -
Paula Mitchell, United States
3 years ago Comments: -
Discount OEM Software, Ukraine
3 years ago Comments: 68CIXQ Great article post.Much thanks again. Awesome.
Petition highlights
There are no highlights yet.

subset: commoncrawl


text:
- Shopping Bag ( 0 items )
From the Publisher
Praise for DD Barant and THE BLOODHOUND FILES"Snappy writing, a page-turning story and fresh world-building make Dying Bites a satisfying meal of a book."—Kelley Armstrong, New York Times bestselling author of Men of the Otherworld and The Awakening
"Dying Bites is wacky, unpredictable, fresh and amazing. I would kill to write as well as D.D. Barant. Seriously."—Nancy Holder, author of Pretty Little Devils
"This engrossing debut adds another captivating protagonist to the urban fantasy ranks…Barant's well-developed world offers intriguing enhancements to mythology and history. Jace is remarkable, strong-willed and smart, and she sets an unstoppable pace. Look for the Bloodhound Files to go far."—Publishers Weekly (starred review)
"A heroine with plenty of guts, moxie and a sense of the absurd. [A] fresh and original take on urban fantasy…Huge kudos to Barant for spicing things up with a story that expertly integrates detective work, kick-butt action and a wacky sense of humor. Make sure you get in early on the outstanding new Bloodhound Files series."—RT Book Reviews
"D D Barant builds a strong world and fills it with fascinating characters that will delight and entertain. Dying Bites is a well-written urban fantasy with a gripping plot and a heroine who is quite believable with her very human flaws. I'm looking forward to seeing more in this captivating world."—Darque Reviews (starred read)
"Five stars. An exciting new series. It has humor, mystery, and adventure. A great book!"—Affair de Coeur
"Barant does an excellent job introducing a whole new world where vampires make up the majority of the population…quick and engrossing…a great new series."—The Romance Reader


text:
Now Playing
Loading stream...
Connect with Us
Podcasts & RSS Feeds
Oliver Wang | RSS | |
All Content |
View all podcasts & RSS feeds |
The Faces of 90.5 WESA
Behavioral Health Reporter
General Assignment Reporter
Director of Internships & Training; Executive Producer for Special News Projects
Host, Essential Pittsburgh
Senior News Editor
Reporter/Host, All Things Considered
Weekend Host and General Assignment Reporter
Host, Morning Edition & Speaking Volumes
90.5 WESA Production Director; Host & Operations Manager for JazzWorks
90.5 WESA Operations Manager & JazzWorks Host
Capitol Reporter
Oliver Wang
Oliver Wang is a music writer, scholar, and DJ based in California. Since 1994, he's written on popular music, culture, race, and America for outlets such as NPR, Vibe, Wax Poetics, Scratch, The Village Voice, SF Bay Guardian, and LA Weekly.
Wang begins work as an assistant professor in sociology at Long Beach State this fall; He also hosts the renowned audioblog soul-sides.com. For more information, visit o-dub.com.


text:
A new game development studio based in Edinburgh has acquired the rights to The Ship, the popular 2006 Half-Life 2 murder mystery mod.
Outerlight, the former developer of The Ship, closed down soon after it developed an XBLA game in what is thought to be a thorny partnership with Ubisoft.
But a new Scotland studio has acquired the game's rights and is working on a full sequel, a person familiar with the matter told CVG. A full reveal is expected in the coming months.
The Ship, which was one of the first third-party titles released on Valve's Steam platform, was set on a 1920s recreational cruise ship. The multiplayer title gave each player a different target to secretly assassinate, while also making each one a target for another player. The set-up resulted in a unique cats-and-mice gameplay dynamic.
News of development of the game's sequel comes after a government-associated report claimed that the Scottish games industry hires less than 200 people and does not turn a profit. Industry groups have laughed off the report.


text:
That's right everyone, a bikini hockey league. Cary Eskridge, a native of Tulsa, Okla. has dreamed of creating a bikini hockey league since the 2004 NHL lockout. Eskridge couldn't get it together in time back then, but now he's maki... Read Post
Has your year been ruined by the news that the Lingerie Football League would be going on hiatus? Well, then there's good news. An all new sports league featuring barely clothed women will soon becoming to TV. The Bikini Hockey Leag... Read Post
Thanks for failing me, UPROXX Network. The Bikini Hockey League had a Media Day and nobody got me in. The BIKINI HOCKEY LEAGUE. Not having the NHL is totally fine [...] The post So Who Failed To Invite Me To Bikini Hockey League's M... Read Post


text:
Status: Opens in 34 minutes
Know more about this business than we do? Cool! Please submit any corrections or missing details you may have.
Help us make it rightCall Today to Make an Appointment!
We are a luxurious yet affordable full service Day Spa located in historic Shrewsbury Borough. We offer a wide array of services including waxing, expert skin care and relaxing therapeutic massage services. All our technicians are licensed and certified with several years of experience in the skin care and massage therapy fields. Our goal is to offer you high end services for a price that will...
* Deep Tissue * Ear Candling * Gift Certificates * Hot Stone Massage * Shiatsu Treatments * Spa Body Treatments * Spa Packages * Swedish * Waxing * Wonderful results oriented Facials, Skin Care and Skin Resurfacing Treatments * Yoga and Wellness Classes
Be the first PennLive.com user to add photos or videos of Lotus on Main Day Spa
The masseuse and the owner lack professionalism and knowledge don't waste your time
After trying a new therapist every month for what seemed like years, I finally found a place that I look forward to returning! Although not super fancy, the massage therapist was out of this world. She took the time to understand my needs and actually worked the knots out. Michelle is probably hands down one of the most talented therapists I have ever experienced. The only reason I gave the...
"STEP OF OUT OR YOUR WORLD --- INTO OURS! Lotus on Main is a small "themed" day spa in Southern York County PA. Our rooms are themed after "high energy" centers around the world. Enjoy a relaxing massage or Reiki energy work in Tibet; enjoy a couples massage or body treatment in India; let our skin care specialists treat you to a customized, results-oriented facial in Japan! Our waiting area is...
www.LotusOnMain.com - Our goal is to bring you all of the luxury of a high end metropolitan day spa without the high prices and busy atmosphere.


text:
Walk Through Bethlehem
Walk Through Bethlehem 2014
December 5-7 and 12-14
Tours are from 6 - 9pm
We look forward to seeing you there!
Walk Through Bethlehem Promo from CrossRoads Ministries on Vimeo.
WTB 2013 Recap Video
Walk Through Bethlehem 2013 Recap from CrossRoads Ministries on Vimeo.
We are excited to bring you Walk Through Bethlehem for 2014! There are some wonderful new changes for this year that will make it a fresh experience for returning guests, and an wonderful new experience for first time guests. This is a free event. It is our gift to the community. As we get closer to the event there will be more updates, but you may always contact us for more information at (386) 760-4806. Read what people are saying about WTB Click here to download a copy of the promotional flyer |
Walk Through Bethlehem is an outdoor drama event that is offered free to our community during the Christmas season. We have been able to use this ministry for the glory of God since 2002 when it first began. It has been made possible thanks to hundreds of volunteers at our church.
The Walk Through Bethlehem set is a 22,000 square foot city that takes over three months to construct. Men give up their Saturday mornings to build the city. Several ladies in our church have sewn hundreds of authentic-looking costumes. The city includes several streets, twenty-three shops, four hundred costumed characters, hundreds of volunteers, and over 100 live animals, including two camels. In 2002 we had no idea of what to expect as far as attendance, or if anyone would come. We had 4,000 attend in the beginning, and it has only grown since with about 8-10,000 every year.
Each year it seems that God sends us more people to meet and to introduce to our Savior. What is significant is that we are able to give every person that attends the opportunity to hear about the Christ of Christmas and why He came. Walk Through Bethlehem is only an experience, but having a relationship with Christ is something that lasts forever. The experience will not change you, but Christ will!The Lord has truly blessed this ministry, and we look forward to the blessings He will bring this year as we take another Walk Through Bethlehem.
See you there!
There is no charge, and donations are not accepted. This is our gift to the community. Merry Christmas!


text:
My Profile
Palmdale, California
Member since May 2005
Flag This ProfileFlag as Inappropriate
Reviewed Ancho Chile and Lime Pork
Feb 3, 2013 in Recipes on Cooking Channel
"Truly I want to give it 4.5 stars but I can't see how to give the half star. The dish itself is truly amazing in its taste and its simplicity. I have pickled the onions because I too am taking it to a super bowl party this afternoon. The only reason I didn't give it 5 stars is because the cooking liquid needed more than just a little salt. I a""


text:
The Empire State Building opens, "Citizen Kane" premieres, Cheerios are introduced, Elvis gets hitched, President Bush delivers his "Mission Accomplished" speech, and President Obama announces the death of Osama bin Laden, all on this day.
The views expressed are not those of this site, this station or its affiliated companies. By posting your comments you agree to accept our terms of use. Your comment will not appear here until you verify your email address with Disqus. KETV NewsWatch 7 encourages users to report violations of our terms of use by flagging the inappropriate comment. Hold your mouse over the comment to reveal the flag on the right side, then click the flag.blog comments powered by Disqus


text:
recipe reviews for:
"Parmesan cheese gives this polenta a nice, subtle cheese flavor. Serve it immediately as a creamy side dish, or chill it so that the polenta can be sliced, then fried or grilled."
My Profile | Cooks I Like Reviews | Photos | Recipes | Menus | Blog
Cooking Level: Intermediate
Cooking Level: Expert
Cooking Level: Beginning
Big, bold food is always the best play. Get the top recipes now.
How much jalapeno and bacon will it take to fuel YOUR fans?
Delicious recipes, party ideas, and cooking tips! Get a year of Allrecipes magazine for $7.99!
See a foolproof method for creamy, lump-free polenta.
Jazz up creamy polenta with fresh corn kernels.
See how to make Thomas Jefferson's favorite comfort food.


text:
Results 1 to 3 of 3
- 11-02-2012, 02:37 PM Thread Author #1
What's wrong with with my phone?
Had this issue back in March while I still had warranty with Bell Canada. I was told it was fixed and that it was confirmed a software issue.
Now I have the exact same issue but I don't have warranty. Can anyone tell me what's wrong? I backed up my data, wiped it and I am restoring it right now. I was told by a Bell technician that a wipe should fix it, but it did not.
EDIT: Initially, if I locked then unlocked my phone, it would clear up, the problem only happened if my screen was locked and I pressed the red button of back button to illuminate it (0 button worked oddly enough). Now it's at the point where even if I lock and unlock for 5-10 min. I MAY get my screen back. Even when it's back, if I scroll around or type, the screen pixelates. So hard to text or call.
Phone Issues - ImgurLast edited by SillyNagger; 11-02-2012 at 02:48 PM.
Re: What's wrong with with my phone?
Call RIM technical support I guess. See what they have to say.
Stop with the Negative Waves! - 11-02-2012, 06:00 PM #3
Re: What's wrong with with my phone?
Looks like your liquid graphics are leaking. Not sure if that would be the video chip or not.
Sent from me using my fingers. Be pantless in 5K. Febreze - for more than smells.
Posted from my phone or pc or tablet that are no better than anyone else's
Woopie Doopie we have em fun -
Similar Threads
Help with clearing my phone
By C-4Nati in forum BlackBerry Curve 85xxReplies: 2Last Post: 04-25-2010, 09:42 AM -
IM Sorry But These Phones Are Riddled With Glitches My Phone Looks Like Klatoo!
By Bettermost in forum BlackBerry Bold 9700Replies: 39Last Post: 12-12-2009, 10:55 PM -
Help with updating my phone, it seems to be stuck
By ScottyPimpin in forum BlackBerry Bold 9000Replies: 3Last Post: 11-16-2009, 03:47 PM -
With MMS, my phone FINALLY feels like a normal phone
By sniffs in forum Apple iPhone/iPadReplies: 21Last Post: 09-30-2009, 05:01 PM -
Really frustrated with Vista, my phone, and OS's
By Coopsdeloops in forum BlackBerry StormReplies: 3Last Post: 09-13-2009, 01:25 PM


text:
I am in the market for a new rifle and have decided to look at the bushmaster series... i would mainly use the rifle for deer but will hunt other big game in near future... main question was that i see that cabelas offer a .450 caliber but have not heard anything on hear bout them to wether there a trustworthy caliber, or else the .308? thanks
Join FirearmsTalk.com Today - It's Free!
Are you a firearms enthusiast? Then we hope you will join the community. You will gain access to post, create threads, private message, upload images, join groups and more. Firearms Talk is owned and operated by fellow firearms enthusiasts. We strive to offer a non-commercial community to learn and share information.
Join FirearmsTalk.com Today! - Click Here
.308 has been around a long time. Can be loaded light or heavy depending on what you're looking to hunt. Elephant to rabbits can be taken with .308 depending on the loads used .308 Ammo is everywhere and cheap. Non standard ammo, is as a rule, expensive and hard to locate.
If you want an AR platform in .308, I believe you will have to go with DPMS, or Armalite. Someone please correct me if this is information is in error! That didn't take long!! It's wrong! Bushmaster builds an MOE .308 which is a mid length carbine They also build a Hunter and Vista Hunter with a 20" fluted barrel Bushy also builds the ORC, a 16" barrel carbine designed for the buyer who is going to add optics Larue has a .308 AR platform rifle they call the OBR
People get the government they deserve.
You can add Rock River Arms to the list of .308 AR10's - Rock River Arms: RRA LAR-8 .308/7.62. POF also has a .308 - POF-USA Patriot Ordnance Factory, Inc. As for AR's in .45 caliber you have the Bushmaster .450 or the Rock River Arms.458SOCOM
Member: NRA GOA ΜΟΛΩΝ ΛΑΒΕ Est sularas oth mithas "either way, you were guilty by association, so you were smited...." JD
you cant use a 450 458 556 6.8 upper on a 308. so if thats your plan it wont work. but colt also makes a 308. dunno anything about the colts. maagazines can be a big issue with 308 ARs as in finding cheap spares.
"Gun control: The theory that a woman found dead in an alley, raped and strangled with her panty hose, is somehow morally superior to a woman explaining to police how her attacker got that fatal bullet wound." L. Neil Smith The problem with being stupid is you cannot simply decide to stop doing dumb things... "I crapped my pants to avoid the draft!!" -Ted Nugent
Also keep in mind that there are 2 distinct classes of AR10 - DPMS and Armalite. The parts are not interchangeable, it's one of the other. Now the real question you should be asking yourself is ... why settle on just one AR when you can have 2? Get a AR15 and a AR10 - endless possibilities!
Well im not looking to really mod out the gun, i'm mainly just looking for a good hunting/target rifle, all im probably going to do is put on a scope, otherwise probably nothing more than that.
Well you will have to decide on what type of shooting you will be doing. The .308 really doesn't compare with the .450/.458 calibers and shooting would be drastically different between the two. Granted, either caliber will perform well in hunting applications and take down any game in NA. But don't expect more than 200yds out max of the .450 or .458SOCOM.


text:
Sat, Mar 26, 05 at 9:40
Help, I have Moonflower seedlings coming up like gangbusters all over my kitchen, however it's much too early to plant them outside yet, I'm in Zone 6. Some of my seedlings are in the little flats and I have a couple in Peat Pots. Now the ones in Peat Pots I'm thinking I can just transplant them pot and all right into a larger container, but the seedlings in the flats, I'm worried about. How can I transplant these babies and keep them healthy until it's time to plant them in a container on my deck? Appreciate any help I can get, I am so hoping that I'll have beautiful moonflowers climbing all over my porch deck this summer. |
Follow-Up Postings:
Do you have enough peat pots to "transplant" your seedlings into them? Or maybe leftover nursery pots from previous purchases? Just a thought. |
Please Note: Only registered members are able to post messages to this forum. If you are a member, please log in. If you aren't yet a member, join now!
Return to the Moon Garden Forum
Information about Posting
- You must be logged in to post a message. Once you are logged in, a posting window will appear at the bottom of the messages. If you are not a member, please register for an account.
- Please review our Rules of Play before posting.
- Posting is a two-step process. Once you have composed your message, you will be taken to the preview page. You will then have a chance to review your post, make changes and upload photos.
- After posting your message, you may need to refresh the forum page in order to see it.
- Before posting copyrighted material, please read about Copyright and Fair Use.
- We have a strict no-advertising policy!
- If you would like to practice posting or uploading photos, please visit our Test forum.
- If you need assistance, please Contact Us and we will be happy to help.
Learn more about in-text links on this page here


text:
I'm the new owner of a Kahr PM45, here is my 1st impressions / experiences.
Recoil is not bad, less than the PM40. I shot 140 rounds today with no discomfort to my hand.
I cleaned the pistol prior to shooting, as per owners manual.
Chronological details of shooting:
-10 rounds Remington 185 JHP, no problem.
-20 rounds Fed. 185 JHP, 4 failures to feed (bullet about 1/2 way in chamber, corrected by tapping back of slide).
-25 rounds Fed. 230 gr. HS, no problem.
Cleaned pistol.
-40 rounds Rem 185 JHP, no problem.
-15 rounds Fed. 230 HS, no problem.
-30 Fed. 185 JHP, 1 failure to feed.
The Fed. 185 JHP is the only ammo that I had a problem with during the 1st 140 rounds, it has an agressive hollow point design (seen in pic.) compared to the other two loads which look more rounded.
I already feel comfortable with the 230 HS or the Rem. 185, since they worked without a problem, even though I have not completed the recommended 200 round break in.
Chrono results, 5 shot average:
-Fed 230 HS @ 781 fps
-Fed 185 JHP @ 856 fps
-Rem. 185 JHP @ 889 fps
Summary: I thought I might have a problem with recoil, especially with 230 gr. bullets, but it ain't so. Based on two out of three loads tried during the "break in" I'm thinking the PM45 is going to work just fine. I'm planning on carrying it frequently after I get a holster.
I did all my shooting at 7 yards. The last 25 rounds I decided to shoot slow fire (two hand hold, no rest) with the Fed 185 JHP. I was able to put all 25 rounds into 2.5'' at 7 yards, which I thought was acceptable for a compact, lightweight 45acp.
Here's some comparison pics. with the PM45, PM40, and Glock 36.


text:
Upload Photo
How to work out in style
This spring, workout wear isn't just functional -- it's taken a fashion-forward turn, with daring prints, intricate details and look-at-me shades -- even in pants. Bold hues are huge, says Marissa Stephenson, fitness editor at Self magazine. Neons, jewel tones, coral and yellow are just some of the top shades for fitted jackets, tops, sports bras and, yes, even pants.
Your Instagram, Twitter snow photos
Long Island and New York City's top photos
Latest photos: See how snowstorm slammed LI
LI's car accidents
Recent LI fires
Where to watch the Super Bowl on LI
Uniondale fire displaces 5, official says
What can you buy for $375G, on and off LI?
LI pets play in the snow
Promotions, hires on Long Island
Watch: Scenes from the snowstorm
Best things to do this week on LI


text:
Last Minute cruises7 nights from £379 pp
Caribbean cruises13 nights from £739 pp
Cruises from the UK14 nights from £749pp
All Inclusive cruises7 nights from £539 pp
Balcony and Suite deals13 nights from £899 pp
Fly Cruise and Stay14 nights from £799 pp
Single cruises7 nights from £489
Top Luxury cruises12 nights from £1,479 pp
Family holiday deals from only £1179
As clear blue seas lap on white powder sand, you'll instantly realise why the Caribbean and cruising are such a delightful combination.
Caribbean Cruise dealsCruise the Med from Southampton or fly-cruise for culture, cities and beaches. Explore amazing hidden gems a stone's throw from the UK.
Med cruise dealsThe Far East & Asia both engages and excites in equal measure – once in a lifetime journeys, but we guarantee you'll want to go back!
Far East & Asia Cruise DealsAustralia, New Zealand and Indonesia give you the chance to experience a blend of beautiful golden beaches, stunning vibrant cities and breathtaking scenery. Explore the amazing natural wonder, the Great Barrier Reef.
Australasia Cruise Deals


text:
With the adjuster with Cup Camisole [HAPTIC selection] | |||||||||
Product description | The UV protection. Also the cooling measures. CoolPlus (cool) in 2013. Original series popular with UV-cut function ♪ every year of the popular cups with inner ★ one but, of course, OPEN shoulder top paired with a big success! adjusters with length adjustment is OK! Stretch with plenty of growth-that fabric so comfortable to wear even to Pat ☆ workout is recommended ◎ from own ventilation structure kept sweating even in clothing and air circulation optimal features ☆ me urging sweat absorption-quick drying even in hot summer サラサラ comfortable to wear! Cakes gone and textured feel excellent! | ||||||||
Material | Polyester 62% rayon 33% polyurethane 5% | ||||||||
Reference | Elasticity and | ||||||||
M size (cm) |
Size: L (cm) |
Notes | * This product is email flight support ships and not. ■ There may be slight error in the actual size for. ■ wash, separate from others because there is fear of fading. ■ avoid bleach and tumbler dryer use. ■ Please note subject to stain others by rubbing (especially wet with sweat or rain conditions). ■ washing after smoothing out well in the shade. ■ before washing in the tag of the product quality show sure to. ■ may look for shooting with a digital camera, on screen with the real slightly different color unwell. Please note that although the products the color as close as possible,. |
Remarks | [Camisole] [UV protection] [Cool] [With Cup Camisole] |
This product cannot be shipped to United States from the store.
Please contact the store for further information.


text:
Conn. Police: 'Very Horrific And Difficult Scene'
Press conference from the Connecticut State Police about the elementary school shooting in Newtown.
Copyright © 2012 NPR. For personal, noncommercial use only. See Terms of Use. For other uses, prior permission required.
We end this hour with an update on the school shooting in Newtown, Connecticut. Here's what we know. In total, 28 people are confirmed dead, including the gunman. And NPR has confirmed his identity. He was Adam Lanza, 20 years old. That's according to federal law enforcement officials. Earlier today, his brother Ryan was taken in for questioning. Ryan Lanza is not believed to be involved in the shootings.
The violence began at some point after nine o'clock this morning. The alleged shooter walked in to Sandy Hook Elementary, killing six adults and 20 children. Another adult was killed before the rampage at the Lanza family home. Among the dead was the gunman's mother, but we have not yet confirmed whether she died in that home or at the school.
CORNISH: Earlier today, President Obama addressed the tragedy, shedding tears as he spoke.
PRESIDENT BARACK OBAMA: As a country, we have been through this too many times, whether it's an elementary school in Newtown, or a shopping mall in Oregon, or a temple in Wisconsin, or a movie theater in Aurora, or a street corner in Chicago, these neighborhoods are our neighborhoods, and these children are our children. And we're going to have to come together and take meaningful action to prevent more tragedies like this regardless of the politics.
This evening, Michelle and I will do what I know every parent in America will do, which is hug our children a little tighter and we'll tell them that we love them and we'll remind each other how deeply we love one another. But there are families in Connecticut who cannot do that tonight and they need all of us right now. In the hard days to come, that community needs us to be at our best as Americans and I will do everything in my power as president to help.
CORNISH: President Obama speaking today at the White House.
SIEGEL: This is ALL THINGS CONSIDERED from NPR News.
Copyright © 2012 NPR. All rights reserved. No quotes from the materials contained herein may be used in any media without attribution to NPR. This transcript is provided for personal, noncommercial use only, pursuant to our Terms of Use. Any other use requires NPR's prior permission. Visit our permissions page for further information.
NPR transcripts are created on a rush deadline by a contractor for NPR, and accuracy and availability may vary. This text may not be in its final form and may be updated or revised in the future. Please be aware that the authoritative record of NPR's programming is the audio.
You must be signed in to leave a comment. Sign In / Register
Please keep your community civil. All comments must follow the NPR.org Community rules and terms of use, and will be moderated prior to posting. NPR reserves the right to use the comments we receive, in whole or in part, and to use the commenter's name and location, in any medium. See also the Terms of Use, Privacy Policy and Community FAQ.


text:
Bible in Basic English (BBE) | New International Version (NIV) |
1 And Jacob sent for his sons, and said, Come together, all of you, so that I may give you news of your fate in future times. | 1 Then Jacob called for his sons and said: "Gather around so I can tell you what will happen to you in days to come. |
The Bible in Basic English is in the public domain. (The Bible in Basic English Version Online) | Scripture quoted by permission. Quotations designated (NIV) are from THE HOLY BIBLE: NEW INTERNATIONAL VERSION®. NIV®. Copyright © 1973, 1978, 1984 by Biblica. All rights reserved worldwide. (New International Version Bible Online) |


text:
Fri, Jun 21, 13 at 11:28
I am! I have no plans for the weekend, other than the usual laundry and daily chores. I have a king size Civil War BOM on the frame and I plan to get lots of quilting done on it this weekend! Then I have to figure out what to use for the many, many yards of binding it will need. :) What's everyone else doing this weekend? Donna |
Follow-Up Postings:
- Posted by toolgranny (My Page) on Fri, Jun 21, 13 at 12:43
I am and as usual, it has to be applique for my job. So, I kit things up during the week. I would also like to get a quilt loaded on the frame but not sure I'll get there. I get so excited about new things I forget to go back and finish up the mundane projects, last month's "excited" things. |
It's funny how short our attention spans can be, isn't it? There's just something about diving into a new project... :) Donna |
Please Note: Only registered members are able to post messages to this forum. If you are a member, please log in. If you aren't yet a member, join now!
Return to the Quilting Forum
Information about Posting
- You must be logged in to post a message. Once you are logged in, a posting window will appear at the bottom of the messages. If you are not a member, please register for an account.
- Please review our Rules of Play before posting.
- Posting is a two-step process. Once you have composed your message, you will be taken to the preview page. You will then have a chance to review your post, make changes and upload photos.
- After posting your message, you may need to refresh the forum page in order to see it.
- Before posting copyrighted material, please read about Copyright and Fair Use.
- We have a strict no-advertising policy!
- If you would like to practice posting or uploading photos, please visit our Test forum.
- If you need assistance, please Contact Us and we will be happy to help.
Learn more about in-text links on this page here


text:
we had a wonderful pizza here and a great chicken dish as well, We will be back again soon. Keep up the great work, and you will do very well.
we had a wonderful pizza here and a great chicken dish as well, We will be back again soon. Keep up the great work, and you will do very well.
Never been inside the place. Have ordered delivery dozens of times. Very good pizza pie. Good selection of sandwiches,panini's etc. A little slower than ideal on the delivery time but the delivery cars have warmers which keep the food hot and when you call in the order and give your phone number, they already have your name, address and credit... More
Food is delicious, always fresh. Have had several dishes and appetizers. Kids love the pizza...and do their friends. Always comment how delicious it is...their favorite. Our go to place. Do not live in Oceanside but with heated ovens in the car, our food comes warmer than those delivered from our own town. Love it!
Ok since Jan 24 ,we have either ate in or ordered out from Cinelli's at least 10 times trying as much stuff on the menu as possible. everything is fantastic.these guys are always busy ,even when the restaurant is empty,they must be something right, they sure are. Rainy day here in NY July 28 ,been on a diet for 10... More
argued with costumer regarding order, never gets order correctly.
The food is very good, the staff is quite friendly, prices are more than reasonable and this is a great place to takeout food from, or to order a delivery from. However, the restaurant itself has floor to ceiling windows and glass doors, so it is very drafty and cold to sit in on cold days. If you want to... More
Ya know back in the mid 80's thru the early 90's i was living in Franklin Sq. and Elmont , Cinelli's always was a go to place all the time. moving back to Baldwin in the 90's soon after Cinelli's popped up right around the block from me in a new building in Oceanside. so since they built the place... More
I have gone many times and also ordered in numerous times. There portions are a good size, they have a very broad menu and a friendly staff including the drivers that deliver. It may not beat your mama's cooking...but for value, taste, service and courtesy....they are a not too distant second. Bon Appetite! jr
Have eaten at Cinellis a number of times and get takeout frequently, have always been very satisfied. We also do our holiday catering from them and have never been disappointed, would highly recommend them for any Italian food needs. By the way my son gets the burgers there and lives them, chicken tenders too!
Register now for free — and start getting automatic notification of new reviews, responding to traveler feedback, adding new photos to your listing and much more.
Manage your listing


text:
Butler discovers Bills come with a price [7:21 AM]
Boston Globe reports:
'While keeping his team competitive, Butler changed the face of the Bills from an aging team with fading talent into a young one on the rise that frankly would have reached the playoffs again this year if coach Wade Phillips had a brain in his head and played Doug Flutie at quarterback instead of Rob Johnson.'
Hawks flop start to finish [6:17 AM]
Everett Herald reports:
'When all was said and done, the Buffalo Bills piled up 579 yards on the way to a 42-23 victory over Seattle at Husky Stadium in the season finale.'
Watters ends his silence with goodbye? [6:16 AM]
Everett Herald reports:
'With a non-guaranteed base salary of $3 million in 2001, and with promising rookie Shaun Alexander playing well, Watters may be an offseason salary cap casualty.'
Rogers' TD hits the spot [6:12 AM]
Everett Herald reports:
'Rogers finished the game with 171 yards on four kickoff returns.'
Flutie-led offense buries Seahawks [5:37 AM]
Seattle Times reports:
'Actually, the Seahawks finished the season as the worst defensive team in the NFL, having clinched that honor before the game even started. But just in case the Seahawks didn't feel they had properly earned the title, they went out and gave up 579 yards of offense to the Bills - 1 yard short of the team record for defensive futility set on September 25, 1988.'
Return to sender [5:35 AM]
Seattle Times reports:
'"We saw some weaknesses in their cover, from looking at film, that we thought we could take advantage of," he said. Weaknesses? They were more than mere weaknesses, because that word would do an injustice to how well Rogers abused the Buffalo special teams.'
Ugly season could bear bright future [5:33 AM]
Seattle Times reports:
'It was lost in an October that was as bad as anything we saw in the 1990s. And Seattle saw a lot of bad football in the '90s.'
Watters creeps into 12th on rushing list [5:31 AM]
Seattle Times reports:
'"I told Doug, 'I should have eaten my Flutie Flakes this morning. You are on fire'," Seahawk cornerback Shawn Springs said.'
Flutie fabulous in finale [5:18 AM]
D and C reports:
'"That was the way we wanted to finish the season," said coach Wade Phillips, who may have seen his job saved by his team's performance.'
Flutie sends Bills a message for next season [5:15 AM]
D and C reports:
'Because of their salary cap problems, the Bills have to seriously consider cutting Flutie, who turns 39 next year, but to his credit, he made the decision a very difficult one with his play in the snow and wind against New England and last night's display against the Seahawks.'
Cap problems won't deter Bills' GM hopefuls [5:12 AM]
D and C reports:
'"We've lost in the past," strong safety Henry Jones said, "but we never lost someone like John Butler accompanying a losing streak."'
Offensive night to remember [5:09 AM]
D and C reports:
'The moment Doug Flutie took the field for the first time. You knew he was going to come to play, and did he ever.'
Bills 42, Seahawks 23 [5:07 AM]
AP reports:
'Buffalo Bills coach Wade Phillips didn't get much of an endorsement from his owner.'
Buffalo 42, Seattle 23 [5:05 AM]
Sportsticker reports:
'If Antowain Smith and Doug Flutie were playing their final game as members of the Buffalo Bills, they made it a memorable one.'
Johnson: Bills' quarterback controversy has taken its toll [9:24 AM]
Buffalo News reports:
'Does Johnson want to be in Buffalo next year? "Yeah I do . . . if I'm the guy," Johnson said. "Public sentiment is so for Doug and it will always be for Doug. And it makes it hard for the team when I go out there and get booed in warm-ups, or throw the ball away and get booed, and have a concussion and get cheered. I played my ass off for the city this year, I thought."'
Laugh Till It Hurts [9:22 AM]
Buffalo News reports:
'Marcellus Wiley is his own personal laugh track. He cannot help himself, working a room of friends or strangers with a smile, a joke, a wise crack. How can he be so upbeat in the face of a season gone wrong with the addition of front office and contract negotiation drama? Heck, try being the life of the party after 16 weeks of playing football.'
Johnson's elbow has tear [9:21 AM]
Buffalo News reports:
'"There is a slight tear in the ligament in my elbow," he said. "I've had it for two years now." Johnson said the initial prognosis is he will not need surgery to repair the tear, but he will see a specialist during the offseason to make sure.'
Heads could roll if Bills throw a stinker in Seattle [9:20 AM]
Buffalo News reports:
'Outlook: Flutie may be able to conjure up a win in what likely is his Bills finale. But win or lose, don't expect it to be pretty. . . . Bills, 24-23.'
Bills: We're focused on finale [8:08 AM]
D and C reports:
'If ever there was a run-for-the-bus game, this is it, though the Bills were saying all the right things this week as they prepared for their meeting with the Seahawks.'
Dismissal a relief for Butler [8:07 AM]
D and C reports:
'But daily contact with Wilson, who didn't necessarily tell him what to do, but who wanted to know every detail of what he was doing, wore Butler down.'
Bills/ Seahawks scouting report [8:07 AM]
D and C reports:
'It's hard to predict what might happen tonight in this meaningless season finale for the Bills and Seahawks. With both teams out of the playoffs, they're playing for pride and the chance to make one last final impression on their respective coaching staffs. Is that enough to warrant a well-played game?'
Bills' future uncertain [8:06 AM]
Toronto Star reports:
'To say there was an air of uneasiness in the Bills' locker room this week, especially after Butler's firing, is a huge understatement. The fact team owner Ralph Wilson Jr. decided to accompany the team west - he said it was to show his support for the team in Butler's absence, others say it's so he can fire coach Wade Phillips in person immediately after the game - hasn't helped ease tensions.'
Meaningless game? Tell that to the Bills hoping to keep jobs [8:05 AM]
Olean Times Herald reports:
'However, Phillips denies his job is on his mind. "I'm focused on this game, I'm coaching, I'm not even thinking (about my job)," he maintained. "(Owner) Ralph Wilson makes decisions based on what's best for the Buffalo Bills. I'm sure he'll make the right decision (on coaches)."'
Holmgren learns lesson in meaningless games [8:03 AM]
Olean Times Herald reports:
'Mike Holmgren isn't used to playing meaningless football games. The Seattle Seahawks' head coach has worked 15 seasons in the National Football League and not until this year had he ever had a team involved in a losing season.'
More than a game at stake [8:02 AM]
Seattle Post Intelligencer reports:
'Seahawks, 23-17.'
Seattle will pull out all the stops to contain Flutie [8:01 AM]
Seattle Times reports:
'"I think, probably, Flutie is one of the best scrambling, creating quarterbacks who has ever played the game," said Seahawk defensive coordinator Steve Sidwell, acknowledging the headaches Flutie can cause an opposing coach.'
Capsule preview: Seahawks vs. Bills [8:00 AM]
Seattle Times reports:
'Guard Ruben Brown was selected to his fifth straight Pro Bowl. Only Bill legends Bruce Smith (11), Andre Reed (7) and Steve Tasker (6) have earned more total Pro Bowl selections than Brown, a team captain this season.'
Holmgren plans another overhaul [7:57 AM]
Olympia Olympian reports:
'There is a very real possibility that the Seahawks' leading passer (Jon Kitna), receiver (Sean Dawkins) and rusher (Ricky Watters) could be gone after the season. Kitna is a free agent whom Holmgren is not expected to re-sign, while Dawkins and Watters might be let go in cost-cutting moves.'
Seahawks game preview [7:56 AM]
Olympia Olympian reports:
'Pick: Bills, 27-20.'
Bills at Seahawks [7:55 AM]
Spokane Spokesman Review reports:
'Buffalo has lost four straight. Make it five. Seattle 27, Bills 20.'
Page 1950 of 2127 pages « First < 1948 1949 1950 1951 1952 > Last »
Latest Buffalo Bills Discussions:
09/07 | @ Chicago Bears | 1:00 pm | |||
09/14 | Miami Dolphins | 1:00 pm | |||
09/21 | San Diego Chargers | 1:00 pm | |||
09/28 | @ Houston Texans | 1:00 pm | |||
10/05 | @ Detroit Lions | 1:00 pm | |||
10/12 | New England Patriots | 1:00 pm | |||
10/19 | Minnesota Vikings | 1:00 pm | |||
10/26 | @ New York Jets | 1:00 pm | |||
11/09 | Kansas City Chiefs | 1:00 pm | |||
11/13 | @ Miami Dolphins | 8:25 pm | |||
11/23 | New York Jets | 1:00 pm | |||
11/30 | Cleveland Browns | 1:00 pm | |||
12/07 | @ Denver Broncos | 4:05 pm | |||
12/14 | Green Bay Packers | 1:00 pm | |||
12/21 | @ Oakland Raiders | 4:25 pm | |||
12/28 | @ New England Patriots | 1:00 pm |
Latest News:
Latest Discussions:
Home | Join the Staff | Contact | Buffalo Bills Forums | Site information
Copyright © 1996-2008 Two Bills Drive. All rights reserved.
Reproduction of material from any page on this site without written permission is strictly prohibited.
Partner with USA TODAY Sports Media Group


text:
Log Out
Call in to speak with the host
(646) 727-3070
We will be talking sports and having fun doing it. Expected to be joined by Boxer and welterweiigth contender Devon Alexander, who will discuss his next fight and more. Also, New Orleans Saints linebacker Nate Bussey will stop by to discuss his season and more. And the great Willie Roaf will stop by to discuss the week that was in the NFL. Call 646-727-3070 and listen @ blogtalkradio.com/pgant
Sorry we couldn't complete your registration. Please try again.
Please enter your email to finish creating your account.
old-style code for hosted blogs
Player Size 300 x 295 400 x 370 640 x 550


text:
Environmental Management Services, Inc. (EMS) is an engineering, environmental consulting, remediation, a... more
Search for NUMBER1EXPERT Homes for Sale and Real Estate Agents throughout the USA and Canada. Only Top Se... more
Collins and Null Appraisals, Inc. is a full service appraisal office, experienced in appraisals of all ty... more
Top Trending Articles
How to Profit From Real Estate Investing
Real estate investing is complex and interesting. Read ... more
Real Estate Investing: How to Find the Right ...
A real estate mentor can show you how the investment ma... more
Great Advice for Marketing Real Estate in Tod...
You can market real estate effectively if you know the ... more
How to Turn a Profit When Investing in Proper...
Property investing is one of the best ways to make a pr... more
Simple Tips for Real Estate Agents to Sell a ...
A bank owned home needs to sell quickly. Learn how to s... more
My family and I used to love Domino's on hwy 98 hattiesburg but they have really gone downhill the last ... more
The worst mechanic ever, instead of fixing the real problem in your car, they will mess it up and charge ... more
I would not recommend his services. The main issue was during the handlement of our case he became more d... more
© 2015 Local Corporation - US Patent 7,231,405
Some data provided by Acxiom. Questions and Comments?


text:
Writing dissector
Take a closer look at your writing and how things repeat with this program.
Textanz provides users with a great way to look deeper into writing and ensure it doesn't repeat itself. By going further than a traditional word processor's tools, this simple program will find fans among people who love language.
The program's interface would be pretty hard to manage if not for the short onscreen tutorial. In only a few sentences, users are run through the various tabs that take up this program and are given enough direction to begin. If you are still confused, there is also an excellent Help file waiting. Checking our writing was a simple matter of opening a file or pasting work from the clipboard. From there users navigate various tabs to see the results of their work. The Phrase Frequency tab breaks down each phrase used more than once and lists how many times it was used. The Concordance Tab showcases unique words used and lists their frequency. Wordforms lists unique words, word length, and its dispersion. The Summary Tab lists things like total words, reading difficulty, average sentence length, longest and shortest word used, and more. The program boasts many features, and one of the best is the ability to click on any word in the list and be taken immediately to its location in the text. Another are the charts that can be run based on the calculations in each tab.
Writing fanatics will not have to run through the program's 40 free uses to discover that its excellent directions and fantastic results create a great tool for writers.


text:
Wed, Mar 19, 14 at 16:07
I have Frigidaire Affinity front load washer/dryer set. Currently in our laundry room, they are set up with the dryer on the left, washer on the right, and the coinciding power outlets behind them. I'd like to switch their positions to make it more user friendly, the washer on the left and dryer on the right however their power cords are not long enough. Does anyone know if they make longer power cords for this model than I can sub out the old ones for, or are their extension cords heavy duty enough for washers/dryers? Any advice would be appreciated! Many thanks! |
Follow-Up Postings:
Use single cords for each. Various lengths are available. Shouldn't be a problem. That's easy. Dryer vent may not be...how's that looking to you? Also length of water-supply hoses and drain hose for washer. Measured all that? |
- Posted by laundryvet (My Page) on Wed, Mar 19, 14 at 21:37
SQ sells extra long fill hoses. Visit anyone of their parts distributors. Drain will only reach so far, and machine performance for draining goes down with long drain lines that increase back pressure. Gwarstong has a good point, better figure out the vent for the dryer. |
Some washer/dryer sets have at least one with provision to reverse the door opening direction. Perhaps that would be a cheaper/quicker solution than physically reversing the whole units. |
Please Note: Only registered members are able to post messages to this forum. If you are a member, please log in. If you aren't yet a member, join now!
Return to the Laundry Room Forum
Information about Posting
- You must be logged in to post a message. Once you are logged in, a posting window will appear at the bottom of the messages. If you are not a member, please register for an account.
- Please review our Rules of Play before posting.
- Posting is a two-step process. Once you have composed your message, you will be taken to the preview page. You will then have a chance to review your post, make changes and upload photos.
- After posting your message, you may need to refresh the forum page in order to see it.
- Before posting copyrighted material, please read about Copyright and Fair Use.
- We have a strict no-advertising policy!
- If you would like to practice posting or uploading photos, please visit our Test forum.
- If you need assistance, please Contact Us and we will be happy to help.
Learn more about in-text links on this page here