Sat, 26 Jul 2008 06:25:25 BST CiteULike: egh's library [240 articles] http://www.citeulike.org/user/egh CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/egh/article/2087320 <i>(2003)</i><br /><br />Information extraction can be defined as the task of automatically extracting instances of specified classes or relations from text. We consider the case of using machine learning methods to induce models for extracting relation instances from biomedical articles. We propose and evaluate an approach that is based on using hierarchical hidden Markov models to represent the grammatical structure of the sentences being processed. Our approach first uses a shallow parser to construct a... Hierarchical hidden markov models for information extraction M Skounakis M Craven S Ray (2003) 2007-12-11T00:46:26-00:00 2003 hmm work http://www.citeulike.org/user/egh/article/341515 <i>J. ACM, Vol. 11, No. 4. (October 1964), pp. 481-494.</i> Derivatives of Regular Expressions Janusz Brzozowski doi:10.1145/321239.321249 J. ACM, Vol. 11, No. 4. (October 1964), pp. 481-494. 2005-10-05T19:47:54-00:00 1964 J. ACM 0004-5411 11 4 481 494 ACM Press regular_expressions work http://www.citeulike.org/user/egh/article/1988173 <i>First monday, Vol. 12, No. 8. (6 August 2007)</i> e-Exclusion and Bot Rights: Legal aspects of the robots exclusion standard for public agencies and other public sector bodies with Swedish examples Nicklas Lundblad First monday, Vol. 12, No. 8. (6 August 2007) 2007-11-26T19:59:59-00:00 2007 First monday 12 8 robotstxt work http://www.citeulike.org/user/egh/article/1904819 <i>ACM Trans. Program. Lang. Syst., Vol. 12, No. 3. (July 1990), pp. 463-492.</i> Linearizability: a correctness condition for concurrent objects Maurice Herlihy Jeannette Wing doi:10.1145/78969.78972 ACM Trans. Program. Lang. Syst., Vol. 12, No. 3. (July 1990), pp. 463-492. 2007-11-13T01:24:47-00:00 1990 ACM Trans. Program. Lang. Syst. 0164-0925 12 3 463 492 ACM work http://www.citeulike.org/user/egh/article/1772873 <i>(2001)</i><br /><br />The rise of ubiquitous computing has created a need for wide-area durable storage. We propose a model and interface for such an archival system, that stores data in a durable, verifiable, available, and self-maintainable manner. We argue that such a system can be created by using novel techniques of erasure codes, secure hashing, and decentralized wide-area location infrastructures to distribute fragments across the wide-area on an arbitrary set of servers. This model allows files to remain... Silverback: A global-scale archival system H Weatherspoon C Wells P Eaton B Zhao J Kubiatowicz (2001) 2007-10-16T07:31:35-00:00 2001 no-tag http://www.citeulike.org/user/egh/article/1772863 <i>No. UCB/CSD-01-1141. (April 2001)</i><br /><br />In today's chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components' within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an... Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing BY Zhao JD Kubiatowicz AD Joseph No. UCB/CSD-01-1141. (April 2001) 2007-10-16T07:29:35-00:00 2001 UCB/CSD-01-1141 p2p tapestry http://www.citeulike.org/user/egh/article/1697646 <i>(25 Sep 2007)</i><br /><br />ossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of $n$ and $\sqrtn$ respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy $ε$ using $O(\fracn^1.5\sqrt\log n \log ε^-1)$ radio transmissions, which yields a $\sqrt\fracn\log n$ factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields. Geographic Gossip: Efficient Averaging for Sensor Networks Alexandros Dimakis Anand Sarwate Martin Wainwright (25 Sep 2007) 2007-09-26T15:53:26-00:00 2007 distributed gossip http://www.citeulike.org/user/egh/article/1677757 <i>(2003)</i><br /><br />This paper studies the problem of loadbalancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or available capacity observed at the serving entities. We show that these techniques do not work well in the peer-to-peer context; either they do not address peer node heterogeneity, or... Practical Load Balancing for Content Requests in Peer-to-Peer Networks M Roussopoulos M Baker (2003) 2007-09-20T01:03:05-00:00 2003 distributed p2p work http://www.citeulike.org/user/egh/article/1677338 <i>ACM Comput. Surv., Vol. 26, No. 2. (June 1994), pp. 145-185.</i> RAID: high-performance, reliable secondary storage Peter Chen Edward Lee Garth Gibson Randy Katz David Patterson doi:10.1145/176979.176981 ACM Comput. Surv., Vol. 26, No. 2. (June 1994), pp. 145-185. 2007-09-19T22:10:34-00:00 1994 ACM Comput. Surv. 0360-0300 26 2 145 185 ACM Press raid storage work http://www.citeulike.org/user/egh/article/1567373 <i>(1988), pp. 109-116.</i> A case for redundant arrays of inexpensive disks (RAID) David Patterson Garth Gibson Randy Katz doi:10.1145/50202.50214 (1988), pp. 109-116. 2007-08-15T16:04:19-00:00 1988 109 116 ACM Press raid storage work http://www.citeulike.org/user/egh/article/1671508 <i>IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 4. (1996), pp. 515-521.</i><br /><br />Searching over heterogeneous information sources is difficult because of the non-uniform query languages. Our approach is to allow a user to compose Boolean queries in one rich front-end language. For each user query and target source, we transform the user query into a subsuming query that can be supported by the source but that may return extra documents. The results are then processed by a filter query to yield the correct final result. In this paper we introduce the architecture and... Boolean Query Mapping Across Heterogeneous Information Sources Chen Héctor Molina Andreas Paepcke IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 4. (1996), pp. 515-521. 2007-09-19T00:07:52-00:00 1996 IEEE Transactions on Knowledge and Data Engineering 8 4 515 521 work http://www.citeulike.org/user/egh/article/933736 <i>Commun. ACM, Vol. 21, No. 8. (August 1978), pp. 613-641.</i> Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs John Backus doi:10.1145/359576.359579 Commun. ACM, Vol. 21, No. 8. (August 1978), pp. 613-641. 2006-11-06T17:17:47-00:00 1978 Commun. ACM 0001-0782 21 8 613 641 ACM Press functional programming work http://www.citeulike.org/user/egh/article/1671417 <i>No. UCB/EECS-2006-183. (18 December 2006)</i> The landscape of parallel computing research: a view from Berkeley Krste Asanovic Ras Bodik Bryan Catanzaro Joseph Gebis Parry Husbands Kurt Keutzer David Patterson William Plishker John Shalf Samuel Williams Katherine Yelick No. UCB/EECS-2006-183. (18 December 2006) 2007-09-19T00:03:27-00:00 2006 UCB/EECS-2006-183 parallel work http://www.citeulike.org/user/egh/article/1671412 <i>(2006)</i> Overcoming the brittleness bottleneck using Wikipedia: enhancing text categorization with encyclopedic knowledge Evgeniy Gabrilovich Shaul Markovitch (2006) 2007-09-18T23:58:33-00:00 2006 text_categorization work http://www.citeulike.org/user/egh/article/1433559 <i>(2007), pp. 366-375.</i> Subject metadata enrichment using statistical topic models David Newman Kat Hagedorn Chaitanya Chemudugunta Padhraic Smyth doi:10.1145/1255175.1255248 (2007), pp. 366-375. 2007-07-04T17:21:41-00:00 2007 366 375 ACM Press topic_models work http://www.citeulike.org/user/egh/article/1643031 <i>(1978)</i> NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM DP Reed (1978) 2007-09-11T00:06:01-00:00 1978 Massachusetts Institute of Technology no-tag http://www.citeulike.org/user/egh/article/1615749 <i>(31 Aug 2007)</i><br /><br />When Kurt Goedel layed the foundations of theoretical computer science in 1931, he also introduced essential concepts of the theory of Artificial Intelligence (AI). Although much of subsequent AI research has focused on heuristics, which still play a major role in many practical AI applications, in the new millennium AI theory has finally become a full-fledged formal science, with important optimality results for embodied agents living in unknown environments, obtained through a combination of theory a la Goedel and probability theory. Here we look back at important milestones of AI history, mention essential recent results, and speculate about what we may expect from the next 25 years, emphasizing the significance of the ongoing dramatic hardware speedups, and discussing Goedel-inspired, self-referential, self-improving universal problem solvers. 2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years Juergen Schmidhuber (31 Aug 2007) 2007-09-03T07:06:17-00:00 2007 ai http://www.citeulike.org/user/egh/article/1615727 <i>(31 Aug 2007)</i><br /><br />We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in compressed texts. Pattern Matching in Trees and Strings Philip Bille (31 Aug 2007) 2007-09-03T06:39:10-00:00 2007 no-tag http://www.citeulike.org/user/egh/article/1610951 <i>(2007)</i> Disk and tape storage cost models Richard Moore Jim D'Aoust Robert Mcdonald David Minor (2007) 2007-08-31T15:55:16-00:00 2007 digital_preservation work http://www.citeulike.org/user/egh/article/1602186 <i>(21 Dec 2006)</i><br /><br />In this paper, we propose an approach to providing the benefits of isolation in service-oriented applications where it is not feasible to hold traditional locks for ACID transactions. Our technique, called "Promises", provides an uniform view for clients which covers a wide range of implementation techniques on the service side, all allowing the client to check a condition and then later rely on that condition still holding. Isolation Support for Service-based Applications: A Position Paper Paul Greenfield Alan Fekete Julian Jang Dean Kuo Surya Nepal (21 Dec 2006) 2007-08-29T00:24:02-00:00 2006 distributed work http://www.citeulike.org/user/egh/article/1602184 <i>(2004), pp. 2-10.</i> Architecting an extensible digital repository Anoop Kumar Ranjani Saigal Robert Chavez Nikolai Schwertner doi:10.1145/996350.996354 (2004), pp. 2-10. 2007-08-29T00:22:55-00:00 2004 2 10 ACM Press digital_repository work http://www.citeulike.org/user/egh/article/1537202 <i>(2003)</i><br /><br />In 1986 Jim Gray published his landmark study of the causes of failures of Tandem systems and the techniques Tandem used to prevent such failures [6]. Seventeen years later, Internet services have replaced fault-tolerant servers as the new kid on the 24x7-availability block. Using data from three large-scale Internet services, we analyzed the causes of their failures and the (potential) effectiveness of various techniques for preventing and mitigating service failure. We find that (1) operator... Why do Internet services fail, and what can be done about it D Oppenheimer A Ganapathi D Patterson (2003) 2007-08-06T02:46:25-00:00 2003 reliability work http://www.citeulike.org/user/egh/article/1525429 <i>(1986), pp. 3-12.</i><br /><br />An analysis of the failure statistics of a commercially available fault-tolerant system shows that administration and software are the major contributors to failure. Various approaches to software fault-tolerance are then discussed -- notably process-pairs, transactions and reliable storage. It is pointed out that faults in production software are often soft (transient) and that a transaction mechanism combined with persistent processpairs provides fault-tolerant execution -- the key to... Why Do Computers Stop and What Can Be Done About It? Jim Gray (1986), pp. 3-12. 2007-07-31T15:55:04-00:00 1986 3 12 reliability work http://www.citeulike.org/user/egh/article/1602132 <i>(2001), pp. 174-187.</i><br /><br />This paper presents LBFS, a network file system designed for low bandwidth networks. LBFS exploits similarities between files or versions of the same file to save bandwidth. It avoids sending data over the network when the same data can already be found in the server's file system or the client's cache. Using this technique, LBFS achieves up to two orders of magnitude reduction in bandwidth utilization on common workloads, compared to traditional network file systems A Low-Bandwidth Network File System Athicha Muthitacharoen Benjie Chen David Mazieres (2001), pp. 174-187. 2007-08-29T00:15:39-00:00 2001 174 187 network_file_system storage work http://www.citeulike.org/user/egh/article/1602129 <i>Trans. Storage, Vol. 2, No. 4. (November 2006), pp. 424-448.</i> Improving duplicate elimination in storage systems Deepak Bobbarjung Suresh Jagannathan Cezary Dubnicki doi:10.1145/1210596.1210599 Trans. Storage, Vol. 2, No. 4. (November 2006), pp. 424-448. 2007-08-29T00:14:24-00:00 2006 Trans. Storage 1553-3077 2 4 424 448 ACM Press storage work http://www.citeulike.org/user/egh/article/1601830 <i>(2002)</i><br /><br />In this thesis, we present the design and implementation of Herodotus, a peer-to-peer web archival system. Like the Wayback Machine, a website that currently offers a web archive, Herodotus periodically crawls the world wide web and stores copies of all downloaded web content. Unlike the Wayback Machine, Herodotus does not rely on a centralized server farm. Instead, many individual nodes spread out across the Internet collaboratively perform the task of crawling and storing the content. This... Herodotus: A peer-to-peer web archival system T Burkard (2002) 2007-08-28T20:27:47-00:00 2002 p2p web_archiving web_crawling work http://www.citeulike.org/user/egh/article/1399401 <i>(18 Jun 2007)</i><br /><br />Building on ideas from linguistics, psychology, and social sciences about the possible mechanisms of human decision-making, we propose a novel theoretical framework for the citation analysis. Given the existing trend to investigate citation statistics in the context of various forms of power and Zipfian laws, we show that the popular models of citation have poor predictive ability and can hardly provide for an adequate explanation of the observed behavior of the empirical data. An alternative model is then derived, using the apparatus of statistical mechanics. The model is applied to approximate the citation frequencies of scientific articles from two large collections, and it demonstrates a predictive potential much superior to the one of any of the citation models known to the authors from the literature. Some analytical properties of the developed model are discussed, and conclusions are drawn. Directions for future work are also given at the paper's end. We cite as we communicate: A communication model for the citation process Victor Kryssanov Evgeny Kuleshov Frank Rinaldo Hitoshi Ogawa (18 Jun 2007) 2007-06-20T00:17:32-00:00 2007 citation work http://www.citeulike.org/user/egh/article/1601797 <i>ACM Transactions on Internet Technology, Vol. ~, No. ~. (~ 2001)</i><br /><br />We o#er an overview of current Web search engine design. After introducing a generic search engine architecture, we examine each engine component in turn. We cover crawling, local Web page storage, indexing, and the use of link analysis for boosting search performance. The most common design and implementation techniques for each of these components are presented. We draw for this presentation from the literature, and from our own experimental search engine testbed. Emphasis is on... Searching the Web Arvind Arasu Junghoo Cho Hector Molina Andreas Paepcke Sriram Raghavan ACM Transactions on Internet Technology, Vol. ~, No. ~. (~ 2001) 2007-08-28T20:23:51-00:00 2001 ACM Transactions on Internet Technology ~ ~ search web_search work http://www.citeulike.org/user/egh/article/1524072 <i>(2001), pp. 396-406.</i><br /><br />We identify crucial design issues in building a distributed inverted index for a large collection of Web pages. We introduce a novel pipelining technique for structuring the core index-building system that substantially reduces the index construction time. We also propose a storage scheme for creating and managing inverted files using an embedded database system. We suggest and compare different strategies for collecting global statistics from distributed inverted indexes. Finally, we present... Building a distributed full-text index for the Web Sergey Melnik Sriram Raghavan Beverly Yang Hector Molina (2001), pp. 396-406. 2007-07-31T06:06:22-00:00 2001 396 406 distriuted indexing search work http://www.citeulike.org/user/egh/article/1601788 <i>SIGMOD Rec., Vol. 29, No. 1. (March 2000), pp. 80-92.</i> Beyond document similarity: understanding value-based search and browsing technologies Andreas Paepcke Hector Garcia-Molina Gerard Rodriguez-Mula Junghoo Cho doi:10.1145/344788.344828 SIGMOD Rec., Vol. 29, No. 1. (March 2000), pp. 80-92. 2007-08-28T20:18:20-00:00 2000 SIGMOD Rec. 0163-5808 29 1 80 92 ACM Press digital_libraries work http://www.citeulike.org/user/egh/article/1601770 <i>No. CS-TR-97-1581. (1997)</i><br /><br />We outline the five main research thrusts of the Stanford Digital Library project, and we describe technical details for two specific efforts that have been realized in prototype implementations. First, we describe how we employ distributed object technology to cope with interoperability among emerging digital library services. In particular, we describe how we use CORBA objects as wrappers to handle differences in service interaction models, and we sketch an information access protocol... Towards Interoperability in Digital Libraries: Overview and Selected Highlights of the Stanford Digital Library Project Andreas Paepcke Steve Cousins Hector Molina Scott Hassan Steven Ketchpel Martin Roscheisen Terry Winograd No. CS-TR-97-1581. (1997) 2007-08-28T20:13:56-00:00 1997 CS-TR-97-1581 digital_libraries work http://www.citeulike.org/user/egh/article/1601766 <i>(2007), pp. 2-2.</i> Failure trends in a large disk drive population Eduardo Pinheiro Wolf-Dietrich Weber Luiz Barroso (2007), pp. 2-2. 2007-08-28T20:11:38-00:00 2007 2 2 USENIX Association harddisk storage work http://www.citeulike.org/user/egh/article/1601760 <i>(2004), pp. 337-345.</i> Grid systems deployment & management using Rocks FD Sacerdoti S Chandra K Bhatia (2004), pp. 337-345. 2007-08-28T20:07:47-00:00 2004 337 345 IEEE Computer Society clustering grid_computing rocks work http://www.citeulike.org/user/egh/article/1601752 <i>(12 Apr 2007)</i><br /><br />The rise of the social media sites, such as blogs, wikis, Digg and Flickr among others, underscores the transformation of the Web to a participatory medium in which users are collaboratively creating, evaluating and distributing information. The innovations introduced by social media has lead to a new paradigm for interacting with information, what we call 'social information processing'. In this paper, we study how social news aggregator Digg exploits social information processing to solve the problems of document recommendation and rating. First, we show, by tracking stories over time, that social networks play an important role in document recommendation. The second contribution of this paper consists of two mathematical models. The first model describes how collaborative rating and promotion of stories emerges from the independent decisions made by many users. The second model describes how a user's influence, the number of promoted stories and the user's social network, changes in time. We find qualitative agreement between predictions of the model and user data gathered from Digg. Social Information Processing in Social News Aggregation Kristina Lerman (12 Apr 2007) 2007-08-28T20:02:11-00:00 2007 work http://www.citeulike.org/user/egh/article/1592750 <i>(2001)</i><br /><br />The AXD 301 ATM Switch is the flagship in Ericsson s line of Datacom products. A fault tolerant and highly scalable backbone ATM switch, AXD 301 has enabled Ericsson to take the lead in the migration of public telephony networks to becoming true multiservice networks, offering both quality voice and broadband data services on the same backbone. Telecom-class products exhibit some very special characteristics, which are fast becoming essential even in other products, such as traditional datacom... Four-fold increase in productivity and quality -- industrial-strength functional programming in telecom-class products U Wiger (2001) 2007-08-25T19:17:52-00:00 2001 functional programming work http://www.citeulike.org/user/egh/article/1586897 <i>(2004)</i><br /><br />The LOCKSS system is a tool librarians can use to preserve long-term access to content published on the web. It has three main functions. It collects the content by crawling the publisher 's web sites, it distributes the content by acting as a proxy for reader's browsers, and it preserves the content through a cooperative process of damage detection and repair. The system uses the hard disk holding the copy used for access as a preservation medium; the cooperative damage detection and repair... Using Hard Disks For Digital Preservation D Rosenthal M Roussopoulos T Giuli P Mani M Baker (2004) 2007-08-23T23:45:05-00:00 2004 digital-archives preservation http://www.citeulike.org/user/egh/article/1234238 <i>(18 Feb 2007)</i><br /><br />Purpose: To provide a critical review of Bergman's 2001 study on the Deep Web. In addition, we bring a new concept into the discussion, the Academic Invisible Web (AIW). We define the Academic Invisible Web as consisting of all databases and collections relevant to academia but not searchable by the general-purpose internet search engines. Indexing this part of the Invisible Web is central to scientific search engines. We provide an overview of approaches followed thus far. Design/methodology/approach: Discussion of measures and calculations, estimation based on informetric laws. Literature review on approaches for uncovering information from the Invisible Web. Findings: Bergman's size estimate of the Invisible Web is highly questionable. We demonstrate some major errors in the conceptual design of the Bergman paper. A new (raw) size estimate is given. Research limitations/implications: The precision of our estimate is limited due to a small sample size and lack of reliable data. Practical implications: We can show that no single library alone will be able to index the Academic Invisible Web. We suggest collaboration to accomplish this task. Originality/value: Provides library managers and those interested in developing academic search engines with data on the size and attributes of the Academic Invisible Web. Exploring the academic invisible web Dirk Lewandowski Philipp Mayr (18 Feb 2007) 2007-04-18T14:58:18-00:00 2007 digital_libraries http://www.citeulike.org/user/egh/article/398265 <i>Comput. Linguist., Vol. 16, No. 2. (June 1990), pp. 79-85.</i> A statistical approach to machine translation Peter Brown John Cocke Stephen Della Pietra Vincent Della Pietra Fredrick Jelinek John Lafferty Robert Mercer Paul Roossin doi:10.3115/991365.991407 Comput. Linguist., Vol. 16, No. 2. (June 1990), pp. 79-85. 2005-11-17T09:52:43-00:00 1990 Comput. Linguist. 0891-2017 16 2 79 85 MIT Press statistical translation http://www.citeulike.org/user/egh/article/1586892 <i>(2002)</i><br /><br />In this paper we study how we can design an effective parallel crawler. As the size of the Web grows, it becomes imperative to parallelize a crawling process, in order to finish downloading pages in a reasonable amount of time. We first propose multiple architectures for a parallel crawler and identify fundamental issues related to parallel crawling. Based on this understanding, we then propose metrics to evaluate a parallel crawler, and compare the proposed architectures using 40 million pages ... Parallel crawlers J Cho Garcia Molina (2002) 2007-08-23T23:40:27-00:00 2002 distributed web_crawling http://www.citeulike.org/user/egh/article/185522 <i>(7 March 2005)</i><br /><br />This paper introduces the write-once/read-many XMLtape/ARC storage approach for Digital Objects and their constituent datastreams. The approach combines two interconnected file-based storage mechanisms that are made accessible in a protocol-based manner. First, XML-based representations of multiple Digital Objects are concatenated into a single, valid XML file named an XMLtape. The creation of indexes for both the identifier and the creation datetime of the XML-based representation of the Digital Objects, facilitates OAI-PMH-based access. Second, ARC files, as introduced by the Internet Archive, are used to contain the constituent datastreams of the Digital Objects in a concatenated manner. An index for the identifier of the datastream facilitates OpenURL-based access. The interconnection between XMLtapes and ARC files is provided by conveying the identifiers of ARC files associated with an XMLtape as administrative information in the XMLtape, and by including OpenURL references to constituent datastreams of a Digital Object in the XML-based representation of that Digital Object. File-based storage of Digital Objects and constituent datastreams: XMLtapes and Internet Archive ARC files Xiaoming Liu Lyudmila Balakireva Herbert Van de Sompel (7 March 2005) 2005-05-06T22:46:42-00:00 2005 digital_libraries storage work http://www.citeulike.org/user/egh/article/422083 <i>ACM Trans. Comput. Syst., Vol. 23, No. 3. (August 2005), pp. 219-252.</i> Gossip-based aggregation in large dynamic networks M&\#225;rk Jelasity Alberto Montresor Ozalp Babaoglu doi:10.1145/1082469.1082470 ACM Trans. Comput. Syst., Vol. 23, No. 3. (August 2005), pp. 219-252. 2005-12-05T10:46:10-00:00 2005 ACM Trans. Comput. Syst. 0734-2071 23 3 219 252 ACM Press distributed gossip work http://www.citeulike.org/user/egh/article/1189172 <i>(2003)</i> Gossip-Based Computation of Aggregate Information David Kempe Alin Dobra Johannes Gehrke (2003) 2007-03-27T12:37:43-00:00 2003 IEEE Computer Society computation distributed gossip work http://www.citeulike.org/user/egh/article/853208 <i>J. Neurosci., Vol. 26, No. 38. (20 September 2006), pp. 9606-9608.</i><br /><br />10.1523/JNEUROSCI.3161-06.2006 As We May Read Paul Ginsparg doi:10.1523/JNEUROSCI.3161 J. Neurosci., Vol. 26, No. 38. (20 September 2006), pp. 9606-9608. 2006-09-21T15:46:54-00:00 2006 J. Neurosci. 26 38 9606 9608 no-tag http://www.citeulike.org/user/egh/article/1584540 <i>(2007), pp. 28-28.</i> TFS: a transparent file system for contributory storage James Cipar Mark Corner Emery Berger doi:10.1145/1060289.1060291 (2007), pp. 28-28. 2007-08-23T00:45:51-00:00 2007 28 28 USENIX Association distributed storage work http://www.citeulike.org/user/egh/article/789900 <i>ACM Trans. Inter. Tech., Vol. 6, No. 2. (May 2006), pp. 153-186.</i> Stanford WebBase components and applications Junghoo Cho Hector Garcia-Molina Taher Haveliwala Wang Lam Andreas Paepcke Sriram Raghavan Gary Wesley doi:10.1145/1149121.1149124 ACM Trans. Inter. Tech., Vol. 6, No. 2. (May 2006), pp. 153-186. 2006-08-08T14:53:57-00:00 2006 ACM Trans. Inter. Tech. 1533-5399 6 2 153 186 ACM Press crawling web web_crawling work http://www.citeulike.org/user/egh/article/1584527 <i>(1997), pp. 147-171.</i><br /><br />. We propose an architecture for Digital Library repositories where one or more data stores persistently hold the digital objects (e.g., documents), and interact with clients that perform indexing, replication, intellectual property management, revenue management, and other functions. One of the most critical components in such stores is the awareness mechanism, used to notify clients of inserted, deleted or changed objects. In this paper we survey the various awareness schemes (including... Awareness Services for Digital Libraries Arturo Crespo Hector Molina (1997), pp. 147-171. 2007-08-23T00:31:27-00:00 1997 147 171 digital_libraries work http://www.citeulike.org/user/egh/article/1584520 <i>(2007), pp. 550-559.</i> Software Development Environments for Scientific and Engineering Software: A Series of Case Studies Jeffrey Carver Richard Kendall Susan Squires Douglass Post doi:10.1109/ICSE.2007.77 (2007), pp. 550-559. 2007-08-23T00:25:03-00:00 2007 550 559 IEEE Computer Society software_engineering work http://www.citeulike.org/user/egh/article/1584518 <i>(2007), pp. 376-385.</i> Organizing the OCA: learning faceted subjects from a library of digital books David Mimno Andrew Mccallum doi:10.1145/1255175.1255249 (2007), pp. 376-385. 2007-08-23T00:22:15-00:00 2007 376 385 ACM Press classification facets topic_models work http://www.citeulike.org/user/egh/article/1584479 <i>Bell system technical journal, Vol. 27 (1948)</i> A mathematical theory of communication CE Shannon Bell system technical journal, Vol. 27 (1948) 2007-08-22T23:55:00-00:00 1948 Bell system technical journal 27 information-theory work http://www.citeulike.org/user/egh/article/1584473 <i>(2005)</i> Deep store : an archival storage system architecture Lawrence You Kristal Pollack Darrell Long (2005) 2007-08-22T23:49:54-00:00 2005 distributed storage work