Patent•
Secure data interchange
27 Oct 2000-
TL;DR: A secure data interchange system enables information about bilateral and multilateral interactions between multiple persistent parties to be exchanged and leveraged within an environment that uses a combination of techniques to control access to information, release of information, and matching of information back to parties as mentioned in this paper.
Abstract: A secure data interchange system enables information about bilateral and multilateral interactions between multiple persistent parties to be exchanged and leveraged within an environment that uses a combination of techniques to control access to information, release of information, and matching of information back to parties. Access to data records can be controlled using an associated price rule. A data owner can specify a price for different types and amounts of information access.
Citations
More filters
Patent•
14 Jun 2016
TL;DR: Newness and distinctiveness is claimed in the features of ornamentation as shown inside the broken line circle in the accompanying representation as discussed by the authors, which is the basis for the representation presented in this paper.
Abstract: Newness and distinctiveness is claimed in the features of ornamentation as shown inside the broken line circle in the accompanying representation.
1,500 citations
Patent•
17 Jun 2005
TL;DR: In this paper, the authors present a data processing system having a business object model reflecting the data used during a business transaction, which is suitable for use across industries, across businesses, and across different departments within a business within a transaction.
Abstract: Methods and systems consistent with the present invention provide a data processing system having a business object model reflecting the data used during a business transaction. Consistent interfaces are generated from the business object model. These interfaces are suitable for use across industries, across businesses, and across different departments within a business during a business transaction.
1,431 citations
Patent•
01 Feb 2011
TL;DR: In this paper, the authors described improved capabilities for selecting advertisements to be delivered to mobile communication facilities using a monetization platform that may act as an advertising hub, which can interact with an ad exchange to collect relevant advertisements for delivery to the mobile communications facilities.
Abstract: In embodiments of the present invention improved capabilities are described for selecting advertisements to be delivered to mobile communication facilities using a monetization platform that may act as an advertising hub. The monetization platform may interact with an ad exchange to collect relevant advertisements for delivery to the mobile communication facilities. The monetization platform may also facilitate the selection of advertisements through the ad exchange by associating advertisement requests with user, user profile or other mobile communication type information. Methods and systems of the present invention are described for aggregating mobile communication facility user profile data, including user profile data obtained from a mobile communication facility, the user's Internet usage, offline user data, and settop entertainment facility data relating to the user.
887 citations
Patent•
04 Apr 2005
723 citations
Patent•
11 Feb 2009
TL;DR: In this article, a machine-implemented social networking system builds up and repeatedly refreshes a hierarchy tree containing topic nodes, each topic node can link to an on-topic real-time chat room whose occupants are currently discussing the topic of the node.
Abstract: A machine-implemented social networking system builds up and repeatedly refreshes a hierarchy tree containing topic nodes. New nodes are added as new topics emerge in online public forums. Each topic node can link to an on-topic real time chat room whose occupants are currently discussing the topic of the node. A chat room can be pointed to by more than one node if the room is discussing multiple topics. Rooms can migrate from node to node as room topic dynamically changes. A system user who explicitly or inferentially wishes to be invited into a chat room which is on-topic with what the user is currently focused upon can do so by use of a node-seeking automated process. The process operates in the background and seeks out nodes of the hierarchy tree that currently have topics appearing to be the same as or similar to what topics the user appears to have in mind. Content browsing experience of the user is enhanced by addition of an invitations displaying subsystem that automatically invites him or her to co-compatible chat rooms currently discussing the topic(s) the user appears to have in mind. One of the many topics that a user may inferentially have in mind is that of being at a given location as reported by the user's GPS and wondering what best to do at that location and time.
718 citations
References
More filters
TL;DR: As a result of this grant, the researchers have now published on CDROM a corpus of over 4 million words of running text annotated with part-of- speech (POS) tags, which includes a fully hand-parsed version of the classic Brown corpus.
Abstract: : As a result of this grant, the researchers have now published oil CDROM a corpus of over 4 million words of running text annotated with part-of- speech (POS) tags, with over 3 million words of that material assigned skeletal grammatical structure This material now includes a fully hand-parsed version of the classic Brown corpus About one half of the papers at the ACL Workshop on Using Large Text Corpora this past summer were based on the materials generated by this grant
8,377 citations
Book•
01 Jan 19495,898 citations
TL;DR: The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable- to-block codes designed to match a completely specified source.
Abstract: A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.
5,844 citations
01 Sep 1952
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Abstract: An optimum method of coding an ensemble of messages consisting of a finite number of members is developed. A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
5,221 citations
PARC1
TL;DR: Tapestry is intended to handle any incoming stream of electronic documents and serves both as a mail filter and repository; its components are the indexer, document store, annotation store, filterer, little box, remailer, appraiser and reader/browser.
Abstract: The Tapestry experimental mail system developed at the Xerox Palo Alto Research Center is predicated on the belief that information filtering can be more effective when humans are involved in the filtering process. Tapestry was designed to support both content-based filtering and collaborative filtering, which entails people collaborating to help each other perform filtering by recording their reactions to documents they read. The reactions are called annotations; they can be accessed by other people’s filters. Tapestry is intended to handle any incoming stream of electronic documents and serves both as a mail filter and repository; its components are the indexer, document store, annotation store, filterer, little box, remailer, appraiser and reader/browser. Tapestry’s client/server architecture, its various components, and the Tapestry query language are described.
4,299 citations