Abstract: A method and system for performing a data stream query. A data stream query requiring a join operation on multiple data streams is approximated without performing the join operation. It is determined whether conditions of the query are proper to accurately approximate the join operation, and if the conditions are proper the join operation is approximated. The join operation is approximated by independently aggregating values of the data streams and comparing the independently aggregated values.

Abstract: Extensible reconfigurable media appliance for security and entertainment captures images digitally for storage. Digital effects and filters are applied to incoming video stream on-the-fly or to video data stored in memory. Digital effects and filters are dynamically stored, modified, updated or deleted, providing extensible reconfigurable effects studio. Digital media appliance communicates wirelessly with other media appliances, computers, security systems, video storage, email, chat, cellular services or PDAs to provide seamless integration of captured video stream.

Abstract: The disclosed embodiments provide rapid access to information stored on a personal computing device even though the personal computing device is powered off or otherwise in a low-power consumption state such as a sleep state or hibernation state. An software component gathers user data in a location such as a non-volatile memory associated with a host computer. A browser component accesses the stored data and makes it available to the user when the host computer is powered down or otherwise in a state of low power consumption.

Abstract: A set of probabilities may indicate the chance of finding the latest version of a data item in any particular data image layer of a data image. A client may use the set of probabilities to request the data item from one or more layers that have a higher probability of having that version of the data item. A client may query more recently created layers to determine whether they have a version of the data item. If any of the more recently created data image layers has a version of the data item, a client may request the data item from the most recent of the more recently created layers and may discard any data returned from the originally requested layer. A client may update the historical probabilities based on which layers contain versions of the data item.

Abstract: A printing apparatus manages identifiers of accounting destinations of print jobs. With a Web browser, a client can set update settings (update rules) of an identifier list saved in an identifier saving unit (of a device. An identifier update unit obtains an identifier list from another device, and updates the identifier list by adding or synchronizing identifiers included in the obtained identifier list in accordance with the update settings.

Abstract: A system and method for providing private inference control is presented. A query count and database including records are maintained. Each record includes attributes, wherein the attributes form inference channels. A data structure is constructed including ciphertext keys, which each relate to one attribute and record. A seed for a pseudorandom function and a secret key for non-malleable encryption are chosen. A query is specified by providing indices identifying one record and attribute by homomorphic encryption. A secure function evaluation is executed upon the inference channels, seed, secret key, query count, and the set of ciphertext keys. An output is generated including the pseudorandom function and an updated set of ciphertext keys subject to sum-consistency of the set of ciphertext keys and a non-inference enabling query. A table of entries is formed by combining each attribute for each record with an output from the pseudorandom function. The entry is provided.

Abstract: A system and method for the customization of media content metadata that is transmitted to any one of a plurality of end user devices of differing types. The system is adapted to modify individual records or even individual fields from the entire gamut of available metadata into a metadata feed which is optimally suited for display upon the type of end user device. Additionally, the system is also able to modify the records or individual fields from a list of all metadata instances according to pre-recorded user preferences. The result is a system that optimally utilizes the current connection path in order to reduce congestion thereon, or to alleviate any user potential frustration caused by sporadic performance of the overloaded interconnection path.

Abstract: A method of consolidating genealogy records includes partitioning the records using at least one index file to form one or more partitions, sorting the records in a partition based on a data element in the records, comparing records within a sort range, based on the comparison, identifying same person records, consolidating information in the same person records, receiving a request from a user to view at least a portion of the consolidated information for a particular group of same person records, and sending a file that includes the portion to the user.

Abstract: Image data (44) assigned to a specific language is included in a second data file (28) at a specific position. A first data file includes a position information data specifying the position of the image data. A processing unit obtains the image data assigned to the specific language based on the position information data in the first data file. An image is displayed on the screen based on the obtained image data (44). The language is set in the first data file for generation of the image. A change of the position information data in the first data file enables a facilitated change of language included in the display image data.

Abstract: The claimed subject matter relates to an architecture that can facilitate query comprehension that are constructed in a compositional manner. In accordance therewith, the query comprehensions can be assembled together in virtually in order without common requirements that force query operators of a query expression to follow ordering/syntactic rules. In addition, the architecture can provide for query expressions that arbitrarily composable and which can be terminated at any point. If the query expression terminates without a Select or Return clause at the end, the architecture can facilitate generation of an implicit Select or Return, and output results.

Abstract: A data provider application programming interface (API) is configured for use with a game content editing application. An asset relationship management file, which is generated with the data provider API, includes information such as relationship references and annotations and is updated by the data provider API when a digital asset is edited. The asset relationship management file is then stored in a data store. An asset relationship graph is generated, based on the asset relationship management file in the data store. The asset relationship graph includes asset graph nodes that map dependency relationships between asset files. A graph API is also described. The graph API is configured for accessing the relationship graph through a server process to expose dependency relationships and annotations to a client process, such as an application. Thus, the effect of changes to one asset on other assets can readily be evaluated.

Abstract: Embodiments of the invention include a method for encoding a tree. The method includes receiving an input tree of many nodes organized in a parent-child hierarchy with parent nodes being coupled to one or more child nodes. A node ID is assigned to each of the nodes of the input tree. A representation between each parent node and child node associated with the parent node can be generated and a tree code can be computed from prime numbers in the natural sequence of numbers and the assigned node Ids. Finally, the tree code representative of the input tree is stored.

Abstract: A system and method is described which provides for context checking of an operating environment. A context manager controls the execution of context checks requested by applications or processes. In one embodiment, the context check modules are defined as self-contained modules located in a database. When the data base is opened, these modules are loaded and registered with the context manager. Upon occurrence of certain user actions, the context manager will issue an event to cause the appropriate modules to perform a context check of certain context of the environment. The resulting context information is stored in memory by the context manager and provided to the applications by the context manager when needed. One advantage is that the context checks performed can be changed simply by adding or deleting modules from the database.

Abstract: A method and system that allows efficient shredding of large instances of hierarchical data structures into relational data structures. Large instances of hierarchical data structures, which are able to be larger than the random access storage of a computer used to shred them into relational data structures, are incrementally shredded into a temporary storage. When the amount of data shredded into the temporary storage reaches or exceeds a predetermined commit count, the data in the temporary storage is transferred to a relational data structure maintained by a relational database manager. A Document Type Description annotation is provided to allow the end user to specify execution order for SQL commands and to specify commit count values.

Abstract: An input lookup key is hashed and the hashed key divided into stride bits into a multi-level Trie structure. A compression function logically combines the stride bits to generate the compressed index bits into the stride tables. The bucket in the last stride table found by the hashed key may have several keys that collide at the same hash value. Discriminant bits are read from the key and select a stored key in the bucket table for verification of its result. Since the hashed key is a compression of the longer input key, more information is contained per bit of the hashed key than in the long key. The multi-stride lookup is performed first on the hashed key, allowing a faster convergence to the lookup result. The first stride can index a single hash table, with the remaining hash bits and discriminant bits used to select from among colliding keys.

Abstract: Methods, systems, and machine-readable mediums are disclosed for managing data centers. In one embodiment, a method is disclosed which comprises receiving, at an interface for a data center management system, a grid location input for a first asset, the grid location input having a grid location value corresponding to a grid location in a data center managed by the data center management system. A first vertical position input for the first asset is also received at the interface, the first vertical position input having a first vertical position value indicating a vertical position. The method further comprises mapping the first asset to the grid location value and mapping the first asset to the first vertical position value.

Abstract: Retention of complex objects is disclosed. An indication is received that retention applied to a root object of a complex object is to be extended to child objects, such as attachments or included files or other content. A snapshot of at least the child objects is stored and the retention that is applied to the root object is extended to the snapshot. Retention of the snapshot ensures that the child objects are retained, so long as and in the same manner as the root object, in the form (e.g., version) in which they are stored at the time retention is applied to the snapshot.

Abstract: The need for upload security arises during content sharing between users in communication link with each other and a server. In one embodiment, providing the upload security involves the server identifying a mobile device that sends an upload message destined to a user. Providing the upload security further involves the server accessing opt-in parameters predetermined by the user, determining if the identity of the sending mobile device is included in the opt-in parameters, and, if so, allowing the upload to the user's account, otherwise blocking the upload. The opt-in parameters include the identity of mobile devices that are authorized by the user to upload data to the user's account. In one embodiment, the communication link includes a wireless carrier network with capability for security screening of the upload message before it reaches the server based on the identity of the wireless carrier network.

Abstract: Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for testing accessibility of a data processing system program according to accessibility criteria. The data processing system program includes a plurality of objects, at least one object of the plurality of objects usable as a user interface between the data processing system program and a user. The data processing system implemented method includes identifying the at least one object of the data processing system program pertaining to the user interface, determining if the identified at least one object satisfies the accessibility criteria by examining an accessibility description for the identified at least one object, and producing an indication that the identified at least one object does not satisfy the accessibility criteria if the identified object does not contain an accessibility description.

Abstract: A method for assigning relative quality scores to a collection of linked documents is presented. The method includes constructing a spring network according to a connectivity graph of a linked database and determining the strength of inter-nodal springs based on the link structure of the network and the displacements on end-nodes. The method may further include computing the displacements of the nodes in a spring network through an iterative process and obtaining the quality scores for documents from the converged displacements of nodes. The method may also include obtaining the relative quality scores for groups of documents. The method may further include assigning topic-specific quality scores to documents in a linked database.

Abstract: A client computer system of a cluster may send a request to create a file in a cluster file system. A server may create a file in response to the information and allocate space in a storage to the file. If a request to write to the file is received within a predetermined amount of time, the write may complete without requiring that additional operations be performed to allocate space to the file. If a write to the file is not received within the predetermined amount of time, the space allocated to the file when it was created may be de-allocated. The file system may additionally or alternatively perform a method for opening a file while delaying an associated truncation of space allocated to the file. If a request to write to the file is received within a predetermined amount of time, the write may be performed in the space already allocated to the file.

Abstract: Described are various methods and apparatuses that provide for variants for multiple resource types and efficiently managing these resources by use of common variables and an organized file structure. A file structure is organize by a common variables, such as the $lang variable, and includes resource references such that once the common variable is defined, similar resources can be referenced using the same instruction by the use of modifying the common variable. Multiple resource types, including text, images as well as other resource types may be managed using the file structure disclosed herein.

Abstract: Methods and systems for extraction and summarization of sentiment information related to a particular research subject are disclosed. A method includes accessing sources of information that contain sentiment information that is related to the research subject and extracting the sentiment information from the sources of information as opinions related to the research subject. Opinion categories related to features of the research subject are identified. From this information a summarization of the sentiment information that is related to the particular research subject that includes the identified opinion categories is generated. Subsequently, access is provided to the summarization for graphical presentation.

Abstract: The semiconductor integrated circuit includes a memory for storing secret data, a memory BIST circuit for executing a memory. BIST, a first selector for switching between a path for a memory isolation test via an external terminal and a path from the memory BIST circuit, a second selector for switching between a path from the output of the first selector and a path from a normal circuit and having an output coupled to the memory, and a third selector for switching between a path from the output of the memory and a path for receiving a pseudo signal and receiving a check completion signal outputted from the memory BIST circuit as a selection signal. In this semiconductor integrated circuit, after the memory is initialized by executing the memory BIST, the memory can be accessed from the external terminal via the path for the memory isolation test.

Abstract: A digital music library builder including an analog-to-digital converter for converting analog audio into digital audio, an optical character processor for recognizing characters within an image, a meta-data extractor for identifying meta-data for a song within the recognized characters, an audio parser for marking the start and end of a song within the digital audio, and a database manager for associating the identified meta-data with the marked song, within a digital music library. A method is also described and claimed.

Abstract: An article is extracted from a document using a decision combiner to process a plurality of reading order alternatives. The text flow analysis generates the plurality of reading order alternatives of separate body text regions.

Abstract: The present invention relates to methods for defining content at the point of purchase of a digital display device (“DDD”), such as a digital picture frame, and for managing content for the DDD. These methods may include the following steps of: defining content for a DDD by a first DDD content provider at a point of purchase; associating a frame content ID with the defined content; and programming the DDD of the DDD with the frame content ID prior to shipping of the DDD.

Abstract: A vast amount of information currently accessible over the Web, and in corporate networks, is stored in a variety of databases, and is being exported as XML data. However, querying this totality of information in a declarative and timely fashion is problematic because this set of databases is dynamic, and a common schema is difficult to maintain. The present invention provides a solution to the problem of issuing declarative, ad hoc XPath queries against such a dynamic collection of XML databases, and receiving timely answers. There is proposed a decentralized architectures, under the open and the agreement cooperation models between a set of sites, for processing queries and updates to XML data. Each site consists of XML data nodes. (which export their data as XML, and also pose queries) and one XML router node (which manages the query and update interactions between sites). The architectures differ in the degree of knowledge individual router nodes have about data nodes containing specific XML data.