Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent stefano-zacchiroli.
- item-3 previous item-2.
- 498 creator chun-song-wang.
- 498 creator hai-xun-wang.
- 498 creator jiang-ming-yang.
- 498 creator ning-gu.
- 498 creator qi-wei-zhang.
- 498 creator yi-ming-liu.
- 498 type InProceedings.
- 498 label "Lock-Free Consistency Control for Web 2.0 Applications".
- 498 sameAs 498.
- 498 abstract "Online collaboration and sharing is the central theme of many webbased services that create the so-calledWeb 2.0 phenomena. Using the Internet as a computing platform, many Web 2.0 applications set up mirror sites to provide large-scale availability and to achieve load balance. However, in the age of Web 2.0, where every user is also a writer and publisher, the deployment of mirror sites makes consistency maintenance aWeb scale problem. Traditional concurrency control methods (e.g. two phase lock, serialization, etc.) are not up to the task for several reasons. First, large network latency between mirror sites will make two phase locking a throughput bottleneck. Second, locking will block a large portion of concurrent operations, which makes it impossible to provide large-scale availability. On the other hand, most Web 2.0 operations do not need strict serializability – it is not the intention of a user who is correcting a typo in a shared document to block another who is adding a comment, as long as consistency can still be achieved. Thus, in order to enable maximal online collaboration and sharing, we need a lock-free mechanism that can maintain consistency among mirror sites on theWeb. In this paper, we propose a flexible and efficient method to achieve consistency maintenance in the Web 2.0 world. Our experiments show its good performance improvement compared with existing methods based on distributed lock.".
- 498 hasAuthorList authorList.
- 498 hasTopic World_Wide_Web.
- 498 isPartOf proceedings.
- 498 keyword "collaboration".
- 498 keyword "consistency maintenance".
- 498 keyword "mirror data".
- 498 keyword "web 2.0".
- 498 title "Lock-Free Consistency Control for Web 2.0 Applications".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasLastItem item-6.
- item-1 type ListItem.
- item-1 hasContent jiang-ming-yang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent hai-xun-wang.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ning-gu.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent yi-ming-liu.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent chun-song-wang.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent qi-wei-zhang.
- item-6 previous item-5.
- 50 creator bingjun-sun.
- 50 creator c-lee-giles.
- 50 creator prasenjit-mitra.
- 50 type InProceedings.
- 50 label "Mining, Indexing, and Searching for Textual Chemical Molecule Information on the Web".
- 50 sameAs 50.
- 50 abstract "Current search engines do not recognize chemical entities (chemical names and formulae). A scientist, who seeks to search for information related to molecules from text documents cannot do so in any meaningful way except performing exact keyword search. We outline how a chemical-entity-aware search engine can be built and demonstrate empirically that it supports various chemical entity search with full document retrieval and also improves the relevance of the returned documents for search queries involving chemical entities. Our search engine first extracts chemical entities from text, performs novel indexing suitable for chemical names and formulae, and supports different query models that a scientist may require. We apply a hierarchical model of conditional random fields (HCRFs) for chemical formula tagging that considers long-term dependencies at the higher levels of documents like the sentence level. We propose an algorithm of independent frequent subsequence mining (IFSM) to discover sub-terms of chemical names and estimate their probabilities of occurrence. We also propose an unsupervised hierarchical text segmentation (HTS) method to represent a sequence with a tree structure based on discovered independent frequent subsequences. An index pruning method is proposed based on HTS. Query models with corresponding ranking functions are introduced for chemical name searches. Furthermore, we show that index pruning can reduce the index size and also query time without changing the returned ranked results much. Finally, experiments also show that our approaches out-perform traditional methods for document search with ambiguous chemical terms.".
- 50 hasAuthorList authorList.
- 50 hasTopic World_Wide_Web.
- 50 isPartOf proceedings.
- 50 keyword "chemical entity extraction".
- 50 keyword "hierarchical text segmentation".
- 50 keyword "independent frequent subsequence".
- 50 keyword "similarity search".
- 50 keyword "substring search".
- 50 title "Mining, Indexing, and Searching for Textual Chemical Molecule Information on the Web".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent bingjun-sun.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent prasenjit-mitra.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent c-lee-giles.
- item-3 previous item-2.
- 506 creator shumeet-baluja.
- 506 creator yushi-jing.
- 506 type InProceedings.
- 506 label "PageRank for Image Search".
- 506 sameAs 506.
- 506 abstract "In this paper, we cast the image-ranking problem into the task of identifying ``authority" nodes on an inferred visual similarity graph and propose VisualRank to analyze the visual link structure that can be created among a group of images. Through an iterative procedure based on the PageRank computation, a numerical weight is assigned to each image; this measures its relative importance to the other images being considered. The incorporation of visual signals in this process differs from the majority of large-scale commercial-search engines in use today. Commercial search-engines often solely rely on the text clues of the pages in which images are embedded to rank images, and often entirely ignore the content of the images themselves as a ranking signal. To quantify the performance of our approach in a real-world system, we conducted a series of experiments based on the task of retrieving images for 2000 of the most popular products queries. Our experimental results show significant improvement, in terms of user satisfaction and relevancy, in comparison to the most recent Google Image Search results.".
- 506 hasAuthorList authorList.
- 506 hasTopic World_Wide_Web.
- 506 isPartOf proceedings.
- 506 keyword "Graph algorithm".
- 506 keyword "PageRank".
- 506 keyword "Visual Similarity".
- 506 title "PageRank for Image Search".
- authorList type List.
- authorList hasFirstItem item-1.