Pre-Grant Publication Number: 20080155392
Collaborate on the process of community review for this application. Posting will not be forwarded to the USPTO.
Flagging a post as an ACTION ITEM signals further research. Flagging SPAM and ABUSE helps to manage discussion.
Placing double brackets around a reference to a claim or prior art will create a hyperlink to the original
ex. [[claim 1]] and [[prior art 2]].

Discussion (9)
Show without Noise
0 days left









Minimal Web patch generation for incremental Web caching
Tay, T.T. Zhang, Y.
Electr. & Comput. Eng. Dept., Nat. Univ. of Singapore, Singapore;
From the Abstract it looks pretty close, but I can't find a free copy of it.
An excerpt: Minimal web patch generation for incremental web caching T.T. Tay and Y. Zhang
Abstract: The principle of web caching is to keep frequently requested items close to where they are needed. The cache may reside in local computers, dedicated cache proxies, or clients that share their local caches. Frequent updates on the original web server shorten the useful lifetime of cache contents. If the update is minor, the stale cache still contains valuable information. An incremental update and delivery scheme, which allows the client to fetch a patch from the original web server to update the stale cache, can improve the caching performance. The paper focuses on the minimal patch generation problem.Web objects are transformed into ordered labelled trees, and the patch is generated in tree space. The paper models the web patch problem as a minimal set cover problem with dynamic weights. This problem can be solved using available solutions of the fixed weighted minimal set cover problem by imposing appropriate conditions.
.............Cache copies can reside on the client machines, dedicated web servers [2] or dedicated cache proxies (e.g. [3]) deployed at the edges of a network such as in gateways or firewall
hosts. Co-operative caching architectures of dedicated cache proxies fall into three major categories: hierarchical, distributed and hybrid [4–10]. In [11, 12], we proposed a
new peer distributed web caching system where each client performs an additional cache server service to share its local cache storage with peers. This system utilises the client
computer’s perishable computation power and the cache storage to improve cache effectiveness in terms of increased cache storage and shorten response time. Cache consistency problem is a key issue in web caching
....................For the incremental update scheme of [12] to be effective, the size of the patch update must be small in relation to the size of the web object. In this paper, we investigate methods to generate the smallest possible patches to update stale web objects to their most current versions. To do this, we convert web objects to ordered labelled trees and generate
web patches in tree space.
Please upload the article as a prior art reference, as the prior art uploads and their annotations are what ultimately get forwarded to the patent examiner. If you have any other questions or comments about the site or Peer-to-Patent process, do not hesitate to get in touch. Thanks for your participation!
Regards,
Joe Merante
Peer-to-Patent Development Analyst
joe.merante@communitypatent.org
Thanks for the information.
I was hoping there was a way to share information via an upload besides using Prior Art.
I did know that only the prior art is passed to patent examiners.
I see a problem with not being able to share documents via the site. IMHO, the article does not apply to this application. If I upload it via Prior Art, there is more input required from me besides uploading the article, such as designating a Claim and an excerpt from the article.
Any suggestions?
Thanks, Diane Willis
Given potential copyright implications, some of the document sharing features are limited at this point. If there is a reference that you aren't certain applies as prior art, it can be uploaded as Research along with any notes, or referenced as a url in Discussion. Or if Prior Art, and you don't have time to look through all of the claims or aren't sure of some, it can be uploaded as Prior Art with just one claim briefly annotated, then other users can go in and annotate the rest (I realize this doesn't solve the problem of sharing your uploaded pdf). I've forwarded your comments and feedback along to our team to try and find a solution. Thanks again for all of your participation, I noticed a recent prior art upload of yours on a different application as well.
Joe
After reading the article, IMHO, I don't think the article applies.
I will upload the document in Prior Art. Then you can make comments in the Annotations section of that Prior Art if you'd like.
Regards, Diane Willis
Essentially I believe this is an overglorified difference tool for HTML that is used to display differences from a web browser. It would not handle anything that is no HTML from the description and also assumes inner-html from a browser contains all HTML/Document info for the page.
The initaliztion and actuation of this proposal is extremely vague. This would appear to cover all methods of detecting any tampering with a web based site/document. My personal opinion would be to request a more detailed re-submisson for consideration.