Abstract: A server system receives a first request for a data item from a web application on a client device, wherein the first request includes an identifier of the data item. In response to the first request, the server system calculates a first checksum of the data item and sends the data item and the first checksum to the web application, for storage in the local database. The server system receives a second request for the data item from the web application, calculates a second checksum of the data item and compares the first and second checksums. The server system, determines that the data item has been updated by comparing the first checksum to the second checksum; and in response to determining that the data item has been updated, the server system a reply to the web application a indicating that the data item has been updated.

Abstract: Disclosed herein is an information processing apparatus including: a sensor information acquisition section configured to acquire sensor information outputted from a sensor for detecting a user motion and sensor information outputted from a sensor for obtaining a user current location; an action pattern detection block configured to analyze sensor information indicative of a user motion to detect an action pattern corresponding to the acquired sensor information from a plurality of action patterns obtained by classifying user's actions that are executed in a comparatively short time; a keyword conversion block configured to convert, on the basis of the sensor information indicative of a current location, the information into at least one keyword associated with the current location; and a text extraction block configured to extract a text for user presentation from a plurality of texts on the basis of the detected action pattern and the generated at least one keyword.

Abstract: An apparatus, system, and method of searching are disclosed. When a search result includes a plurality of images being obtained from the same document, the plurality of images being obtained from the same document is displayed, one by one, in the order determined based on priority order information.

Abstract: The saving device for image sharing saves images offered by a sharer of the images for image sharing and accessibly shares in an album form among at least one share. The device includes a sharee layout storing means configured to store first layout information of a sharee's album, a shared area determining means configured to determine a shared area to be shared in the sharee's album from a sharer's album, and a layout changing means configured to automatically change a layout of the shared area based on the first layout information of the at least one sharee. An image sharing system includes the device, and an image sharing method uses the device.

Abstract: Ranking systems are described. In an embodiment a large scale data center has peta bytes of items and a query engine is provided to find the top k most frequently occurring items. In embodiments, samples are taken from the data center at least until a specified number of samplings is met, or until a stopping rule is met. In examples, the samples form a sample sketch which is used to find the top k most frequently occurring items without the need to examine every item in the data center. In other examples, the number of samplings or stopping rule is varied to provide ranks or frequencies. In other embodiments the ranking system operates on items having values to find separators which divide the items into bins such that the proportion of the items in each bin is different. For example, a data set may be apportioned to different types of processor.

Abstract: A system automatically creates a list from items in existing lists. The system receives one or more example items corresponding to the list and assigns weights to the items in the existing lists based on the one or more example items. The system then forms the list based on the items and the weights assigned to the items.

Abstract: A method of reporting search results of a collection of data is disclosed. The method includes obtaining a hash function and a pattern of data for which to search within the collection of data and searching the collection of data for one or more strings of data that match the pattern. In response to finding one or more strings of data that match the pattern, the method further includes hashing each string that matches the pattern of data with the hash function and creating one or more rows of a results table. Each row of the results table corresponds to one string of data that matches the pattern of data and includes the corresponding hashed string of data.

Abstract: The saving device for image sharing saves images offered by a sharer of the images for image sharing and accessibly shares in an album form among at least one share. The device includes a sharee layout storing means configured to store first layout information of a sharee's album, a shared area determining means configured to determine a shared area to be shared in the sharee's album from a sharer's album, and a layout changing means configured to automatically change a layout of the shared area based on the first layout information of the at least one sharee. An image sharing system includes the device, and an image sharing method uses the device.

Abstract: A system and method for managing search results available from a network resource using a data feed is disclosed herein as incorporating a processor programmed to retrieve user unsorted search results matching search terms provided by a user, transmit the search results along with a user selectable sorting identifier over the network for display on a graphical user interface and further programmed to sort each search result according to the user selected sorting identifier, update the sorting status of each search result, and transmit for display on the graphical user interface the search results in accordance with the sorting status and the user selected sorting identifier.

Abstract: One or more aspects of the disclosure relate to techniques for accessing a file stored in a clustered computing network, where the file is stored in the clustered computing network in a plurality of related volumes that stem from a particular (e.g., parent) volume. In the method, a request to retrieve the file from the particular volume is received at the client. The client then determines whether the file is stored in a client memory so as to be identified with the particular volume. If the file is not stored in the client memory so as to be identified with the particular volume, then the file is retrieved from a different but related volume.

Abstract: A system performs user intention modeling for interactive image retrieval. In one implementation, the system uses a three stage iterative technique to retrieve images from a database without using any image tags or text descriptors. First, the user submits a query image and the system models the user's search intention and configures a customized search to retrieve relevant images. Then, the system extends a user interface for the user to designate visual features across the retrieved images. The designated visual features refine the intention model and reconfigure the search to retrieve images that match the remodeled intention. Third, the system extends another user interface through which the user can give natural feedback about the retrieved images. The three stages can be iterated to quickly assemble a set of images that accurately fulfills the user's search intention.

Abstract: Techniques are described herein for providing protocol extensions to the WS-Enumeration protocol. A selection protocol extension to the WS-Enumeration protocol enables retrieval of partial representations of objects from a directory server. The partial representations include attributes of the objects that are designated via the selection protocol extension. A sorting protocol extension to the WS-Enumeration protocol enables sorting of objects (or partial representations thereof) to be retrieved from a directory server. The selection and sorting protocol extensions are defined in respective XML elements that are distinct from an XML element that defines an object request including a query filter for selecting objects in the directory server. The selection and sorting protocol extensions may be used independently from each other. The computer languages utilized by the aforementioned XML elements need not necessarily be the same. For instance, a different computer language may be used for each.

Abstract: The present invention embodiments pertain to managing and exchanging documents. A descriptor is added to an original document, wherein the descriptor includes at least one document identifier representing a logical subject of the document. Modifications to a document being sent or received are identified based on comparing the descriptor of the sent or received document and the descriptor of the original document. The modifications are introduced into the original document to become a single master document of consolidated information relating to the same logical subject.

Abstract: Surrogate heuristic identification is described, including a memory configured to store data associated with an image, and a processor configured to select a portion of an image, and the portion is standardized, to identify a characteristic associated with the image, to use the characteristic to generate a data representation, the data representation being used to provide heuristic data, and to process the heuristic data to generate a fingerprint configured to compare against one or more stored fingerprints associated with other images.

Abstract: A system automatically creates a list from items in existing lists. The system receives one or more example items corresponding to the list and assigns weights to the items in the existing lists based on the one or more example items. The system then forms the list based on the items and the weights assigned to the items.

Abstract: A system and method for obfuscating a database's schema while preserving its functionality by modifying the original table names, column names, table order, column order, and/or data character set such that the standard order of the original characters is maintained.

Abstract: A method for providing symbolic access to a plurality of objects stored in a data storage is provided. An associative array comprising a plurality of associative array keys and a plurality of associative array values may be generated. A data array comprising a plurality of data array elements may be generated, such that each object stores a sortable property value of the object and an original offset of the object. A mapping table to map original offsets to modified offsets is generated. The mapping table includes a plurality of mapping table elements, and each associative array value is used as an offset into the mapping table, and each mapping table element storing a modified offset, each modified offset is a numeric value used as an offset into the data array.

Abstract: Techniques for query processing in a multi-site search engine are described. During an indexing phase, each site of a multi-site search engine indexes a set of assigned web resources and each site calculates, for each term in the set of assigned web resources, a site-specific upper bound ranking score on the contribution of the term to the search engine ranking function for a query containing the term. During a propagation phase, all sites exchange their site-specific upper bound ranking scores with each other. In response to a site receiving a query, the site determines the set of locally matching resources and compares the ranking score of a locally matching resource with the site-specific upper bound ranking scores for the terms of the query that were received during the propagation phase and determines whether to communicate the query to other sites.

Abstract: An efficient way is provided to represent and exchange knowledge and/or partial knowledge across nodes when synchronizing between any two nodes. A first node sends a second node its knowledge and/or partial knowledge, including objects and versions of those objects. The second node compares its knowledge and/or partial knowledge with the knowledge and/or partial knowledge of the first node, and then sends the first node any latest versions of objects of which the first node is unaware. In addition, the second node sends its knowledge and/or partial knowledge to the first node. The first node then performs a similar object-by-object version comparison to determine any conflicts due to independent evolution of objects and any changes that should be sent to the second node in order to bring the objects of the second node up to date with the knowledge and/or partial knowledge of the first node.

Abstract: A hierarchical arrangement of nodes is provided to represent Extensible Markup Language (XML) data. In response to a keyword search query containing query keywords, sets of nodes in the hierarchical arrangement are identified for respective query keywords. A smallest of the sets of nodes is identified, and starting with the smallest of the sets of nodes, a stack-based algorithm is applied to identify exclusive lowest common ancestor (ELCA) nodes of the hierarchical arrangement.