Patent application number | Description | Published |
20080307189 | Data partitioning via bucketing bloom filters - Multiple Bloom filters are generated to partition data between first and second disjoint data sets of elements. Each element in the first data set is assigned to a bucket of a first set of buckets, and each element in the second data set is assigned to a bucket of a second set of buckets. A Bloom filter is generated for each bucket of the first set of buckets. The Bloom filter generated for a bucket indicates that each element assigned to that bucket is part of the first data set, and that each element assigned to a corresponding bucket of the second set of buckets is not part of the first data set. Additionally, a Bloom filter corresponding to a subsequently received element can be determined and used to identify whether that subsequently received element is part of the first data set or the second data set. | 12-11-2008 |
20090054123 | INFORMATION COLLECTION DURING GAME PLAY - Systems and methods allow an on-line game to extract information relevant to a specific need of a game platform or service platform. The specific need relates to management and use of digital content, and is addressed by designing and playing an on-line collaborative game. The rules of the game intend to solve a specific task dictated by the specific need. Players' responses to the game generate a wealth of information related to a specific task objective, such as ranking, sorting, and evaluating a set of digital content items. To compel participation in a game, players can be rewarded with monetary value rewards. As a game illustration, an image selection game (ISG) that exploits human contextual inference is described in detail. The information extracted from ISG is a list of key-image associations, relevant for the task of image sorting and ranking. | 02-26-2009 |
20090070354 | MINIMAL PERFECT HASH FUNCTIONS USING DOUBLE HASHING - Technologies are described herein for constructing a minimal perfect hash function. According to embodiments, a hash table is constructed by double hashing each of the strings in a set of strings. A computed double hash value is utilized to identify an empty location in the hash table for each string. A signature for each string is stored in the empty location of the hash table identified for the string. In order to obtain a minimal perfect hash value for an input string, the input string is iteratively double hashed until a location is identified in the hash table that contains a signature corresponding to the input string. The minimal perfect hash value is an integer value identifying the location in the hash table that contains the signature corresponding to the input string. | 03-12-2009 |
20090150375 | Detecting zero-result search queries - A processing device and method may be provided for determining whether a zero search result may be produced with respect to a search for a document including all words of a word group. An index, with respect to words included in a group of documents, may be searched for documents including all words of the word group when a zero search result is determined not likely to occur with respect to the search for the document including all of the words of the word group. A method for creating multiple types of data structures corresponding to word grouping collections may further be provided to store occurrence information indicating a likelihood of a presence of a document including all words of a word group. | 06-11-2009 |
20090248657 | WEB SEARCHING - Mislabeled URLs are identified and corrected based upon a click relevance ranking computed from user data comprising user click information. The click relevance ranking is formed by applying a set of relevance ordering rules to user log data aggregated by query and URL and by mapping the results of the relevance ordering rules into a linear ordering. For a given query, the aggregated user log data comprises a relative total number of impression, a relative total number of clicks received and a rank associated with the query/URL pair at the time of the total number of impressions and total number of clicks received. The click relevance ranking is used to identify and correct mislabeled query/URL pairs of other rankings according to a number of disclosed methods. | 10-01-2009 |
20100178985 | ARRANGEMENT FOR BUILDING AND OPERATING HUMAN-COMPUTATION AND OTHER GAMES - A game description language is provided for human computation games, as well as a game platform or generator component that can generate the code base for the game. The game description language and schema framework can be used to represent the game logic and synchronization patterns of a human computation game. The automated code generation tool takes a file, e.g., a file made from the above game description language, or the like, as an input and generates a code base for the corresponding human computation game. These tools allow a prototype of a human computation game to be generated within minutes. | 07-15-2010 |
20110016116 | WEB SEARCHING - A human or hand-labeled ranking of URL results for a search query is compared against actual click data for the respective query/URL pairs (e.g., which URLs were actually clicked on by users when the URLs were presented to users when the search query was run in the real world). The human ranking or ordering of the URL results (e.g., pre-existing relevance ranking) for the query can then be adjusted, if necessary, based upon the real world click data (e.g., click relevance ranking). The modified pre-existing relevance ranking can be used in providing future search results. | 01-20-2011 |
20110161308 | EVALUATING PREFERENCES OF CONTENT ON A WEBPAGE - Systems, methods, and computer storage media having computer-executable instructions embodied thereon that facilitate evaluation of digital content preferences are provided. A user is presented with items of digital content and permitted to manipulate the arrangement of the digital content items in the context of a layout area. Based on the user's manipulation of the digital content items, a user preference regarding an arrangement of digital content, such as a location preference, a position preference, and/or a usage preference, is identified. In embodiments, such a user preference can be utilized to later display digital content to a user in accordance therewith. | 06-30-2011 |
20120135809 | ARRANGEMENT FOR BUILDING AND OPERATING HUMAN-COMPUTATION AND OTHER GAMES - A game description language is provided for human computation games, as well as a game platform or generator component that can generate the code base for the game. The game description language and schema framework can be used to represent the game logic and synchronization patterns of a human computation game. The automated code generation tool takes a file, e.g., a file made from the above game description language, or the like, as an input and generates a code base for the corresponding human computation game. These tools allow a prototype of a human computation game to be generated within minutes. | 05-31-2012 |
20120323907 | WEB SEARCHING - A human or hand-labeled ranking of URL results for a search query is compared against actual click data for the respective query/URL pairs (e.g., which URLs were actually clicked on by users when the URLs were presented to users when the search query was run in the real world). The human ranking or ordering of the URL results (e.g., pre-existing relevance ranking) for the query can then be adjusted, if necessary, based upon the real world click data (e.g., click relevance ranking). The modified pre-existing relevance ranking can be used in providing future search results. | 12-20-2012 |
Patent application number | Description | Published |
20150178516 | RESTRICTING ACCESS TO CONTENT - Various embodiments restrict or enable access to content items of an account based on login information or content request properties. For example, a synchronized online content management system can receive a request including one or more content request properties from a client device to access a user account. Access rules for the user account can be obtained and applied based on the content request properties to generate an access status. In one instance, the client device is provided with full account access if the access status indicates that the client device is an authorized device. In another instance, if the client device is an unauthorized device, at least one aspect of access to the user account is restricted. | 06-25-2015 |
20150188886 | IDENTIFYING AND BLOCKING PROHIBITED CONTENT ITEMS IN A CONTENT MANAGEMENT SYSTEM - To identify whether a content item is prohibited, a content management system can generate a content item fingerprint for the content item and then compare the generated content item fingerprint to a blacklist of content item fingerprints for prohibited content items. If the generated content item fingerprint matches any of the content item fingerprints included in the blacklist, the content management system can determine that the content item is prohibited. The content management system can deny requests to share prohibited content items and/or requests to assign prohibited content items to a user account on the content management system. The content management system can generate the content item fingerprint using the content item as input in a fingerprinting algorithm that was used to generate the content item fingerprints on the blacklist. | 07-02-2015 |
20150249647 | ADVANCED SECURITY PROTOCOL FOR BROADCASTING AND SYNCHRONIZING SHARED FOLDERS OVER LOCAL AREA NETWORK - A method, system, and manufacture for securely broadcasting shared folders from one client device to other client devices and synchronizing the shared folders over a local area network. A first client device, associated with a content management system, generates a secure identifier for a shared folder, using a shared secret key that is associated with the shared folder. The first client device announces the secure identifier over a local area network to other client devices on the local area network including a second client device. The first client device receives a synchronization request for the shared folder from the second client device. After authenticating, using the shared secret key, that the second client device has authorization to access the shared folder, the first client device synchronizes the shared folder with the second client device over the local area network. | 09-03-2015 |
20150358297 | SECURE PEER-TO-PEER DATA SYCHRONIZATION - The disclosed embodiments relate to a feature of a content-item-uploading system that facilitates secure, peer-to-peer distributed sharing of a version of a content item by a user that created the version of the content item (e.g., by modifying a previous version of the content item or by creating a new content item). During operation, the system receives a cryptographic key from the user. In response, the system provides the cryptographic key to recipients in the system. Subsequently, the recipients can use the cryptographic key for secure, peer-to-peer distributed sharing of the version of the content item among the user and the recipients in a shared network without synchronization conflicts with previous versions of the content item in the system. | 12-10-2015 |
20160036802 | PLACING A USER ACCOUNT IN ESCROW - Disclosed are systems, methods, and non-transitory computer-readable storage media for placing a user account in escrow to remove it from an administered account. An employee and/or an employer can select to remove a user account from an administered account associated with the employer. To ensure that the each party, the employer and employee, has an opportunity to retain their content stored in the removed user account, the user account can be placed into escrow, requiring login credentials of both the user and the administrator (employer) to access the user account. The user account can therefore not be accessed unless both the employer and employee each login to the account at the same time. By placing the user account in escrow, both parties can be assured that they can access the content items in the user account, and that the other party cannot access the content without their knowledge. | 02-04-2016 |
20160094529 | Identifying Related User Accounts Based on Authentication Data - In some embodiments, upon detecting malicious activity associated with a user account, a content management system can identify other user accounts related to the malicious user account. The content management system can identify related user accounts by comparing authentication information collected for the malicious user account with authentication information collected for other user accounts. Authentication information can include IP address information, geographic information, device type, browser type, email addresses, and/or referral information, for example. The content management system can compare the content items associated with the malicious user account to content items associated with other user accounts to determine relatedness or maliciousness. After identifying related malicious user accounts, the content management system can block all related malicious user accounts. | 03-31-2016 |
20160105283 | SYSTEM AND METHOD FOR ROTATING CLIENT SECURITY KEYS - Systems, methods, and non-transitory computer-readable storage media for rotating security keys for an online synchronized content management system client. A client having a first security key as an active security key may send a request to a server for a new security key as a replacement for the first security key. The server may receive the request and generate a candidate security key. The server can issue the candidate security key to the client device. After receiving the candidate security key, the client may send a key receipt confirmation message to the server. In response to the confirmation message, the server may mark the candidate key as the new security key for the client and discard the client's old security key. The server may send an acknowledgment message to the client device. In response, the client may also mark the candidate key as its new active key. | 04-14-2016 |
20160110559 | IDENTIFYING AND BLOCKING PROHIBITED CONTENT ITEMS IN A CONTENT MANAGEMENT SYSTEM - To identify whether a content item is prohibited, a content management system can generate a content item fingerprint for the content item and then compare the generated content item fingerprint to a blacklist of content item fingerprints for prohibited content items. If the generated content item fingerprint matches any of the content item fingerprints included in the blacklist, the content management system can determine that the content item is prohibited. The content management system can deny requests to share prohibited content items and/or requests to assign prohibited content items to a user account on the content management system. The content management system can generate the content item fingerprint using the content item as input in a fingerprinting algorithm that was used to generate the content item fingerprints on the blacklist. | 04-21-2016 |