Abstract: Methods, systems and articles of manufacture are provided for migrating entity relationship data residing in an object oriented program environment to a relational database schema. Further, functionality is provided to facilitate more efficient searching and reconstruction of the entity relationship data in the relational database.

Abstract: A user can define a filter to applied be to one or more datasets. The filter includes a specification of a field to filter. Upon applying the filter to a dataset, if the specified field cannot be found in the dataset, a field in the dataset is selected as a default field to filter. Selecting what field in the dataset should be the default field is based on evaluating a set of rules. The default field is then filtered according to the filter criteria.

Abstract: A system is provided for managing data sets in a cloud processing and/or federated environment. In an embodiment, the system described herein may be used in connection with cloud processing of big data sets. The term “big data,” as used herein, may be generally defined to describe data sets so large and complex that they become difficult to work with using on-hand database management tools. The system described herein enables the persistent storage of semantic technology statements for big data sets for processing in a cloud processing and/or federated environment.

Abstract: Implementing query classification includes receiving a core term from a search query responsive to execution of a first module. The first module searches a table for the core term and yields a first result. The query classification also includes receiving a second result from the search query responsive to execution of a second module. The second module searches an index of terms that are mapped to documents and corresponding categories in the index. The second result is indicative of one of the corresponding categories in the index based on a probability score. Upon determining the first result is a category associated with the core term in the table, the query classification also includes calculating a weighted average for the first result and the second result. The calculation yields a third result. The query classification further includes transmitting the third result to a computer device that generated the query.

Abstract: Some embodiments provide a method for defining a data structure for representing a media file imported into a media-editing application. The method defines a reference to an original version of a media file. The method defines references to one or more transcoded versions of the media file. Each of the transcoded versions has a different resolution. The method defines a set of metadata storing information regarding the media file. In some embodiments, the media file includes both audio and video. The method defines a video clip data structure for the media file that references the first data structure and an audio clip data structure for the media file that also references the asset data structure. The method defines a media clip data structure that contains the video clip data structure and the audio clip data structure. The media clip data structure is for editing into a composite video presentation.

Abstract: In one aspect, photon queries are answered using systems and methods of traversal of collections of photon queries through an acceleration structure, to identify photons meeting a specification of a given query. Such systems and methods can be extended to satisfying similarity queries in an n-dimensional parameter space. Queries can be associated with code (or pointers to code) that are run to achieve closure of that query. Queries can cause further queries to be emitted. Arbitrary data can be passed from one query to another; for example, parameters defined internally to the code modules themselves (e.g., the parameters do not need to have a definition or meaning to the systems or within the methods).

Abstract: Techniques for enhancing content are disclosed. In some embodiments, enhancing content includes automatically identifying a set of modifications to the existing content of a page that would result in the page satisfying a set of search properties and applying at least a subset of the set of modifications to the page. Furthermore, techniques for enhancing link structure are disclosed. In some embodiments, enhancing link structure includes automatically determining a constrained link structure for a set of pages that satisfies a set of one or more constraints and that is at least in part different from an existing link structure of the set of pages and making one or more modifications to the existing link structure to at least in part realize the constrained link structure for the set of pages.

Abstract: A user interface including one or more references to content is customized. Several user profiles are provided from which a user may be associated. Each user profile includes user profile information. The user profile associated with a user to whom a user interface will be provided is accessed. A user interface is configured for the user, based at least in part upon the user profile accessed as being associated with the user. Access to content is enabled based on user manipulation of the configured user interface.

Abstract: System and methods for anonymizing data is disclosed. The method includes intercepting a communication, identifying sensitive data in the communication and transmitting data to an anonymization engine for masking. Masked data is received from the anonymization engine and transmitted to a client device.

Abstract: Data representing capabilities of devices in a data is aggregated on a cluster-basis. Information representing capability attributes of devices in the data center is received. The information representing the capability attributes is analyzed to generate data that groups devices based on similarity of at least one capability attribute. Aggregation data is stored that represents the grouping of the devices based on similarity of the at least one capability attribute and identifies the devices in corresponding groups.

Abstract: Receive a plurality of data management policies from a user. Store in a memory the data management policies in association with a context and an identifier of the user. Receive personal data of the user collected in one or more contexts by one or more collection devices. Determine whether the personal data complies with one or more of the data management policies with respect to collecting personal data of the user. If the personal data complies with the data management policies with respect to collecting personal data on the user, then storing in the memory the personal data in association with the identifier of the user. Provide a centralized interface to the user for managing the personal data stored in the memory.

Abstract: A process and system are directed to generating a medium without user involvement in supplying the content. A user makes a series of increasingly granular selections to specify the type of medium to be built, such as a webpage. A query-reply communications protocol is used to identify relevant content for building the webpage from network resources. A resource is queried to determine whether the resource contains any relevant content. The response from the resource, if affirmative, includes the requested content. The query communications are formulated to conduct a keyword type search of the resource. The resource response includes the search results.

Abstract: A method and apparatus for generating a data structure. A plurality of entity reference relationship structures is accessed. Each entity reference relationship structure establishes a relationship between a different pair of entity structures of a plurality of entity structures. Each path from a first vertex to a second vertex that corresponds to a second entity structure is determined. For each path, all coupled sets of pairs of entity instance identifiers, wherein each coupled set comprises a pair of entity instance identifiers from each entity reference relationship structure corresponding to the path are identified. For each coupled set, a first entity instance identifier in the each coupled set that refers to the first entity structure and a second entity instance identifier in the each coupled set that refers to the second entity structure are stored in association with one another in a new entity reference relationship structure.

Abstract: A computer implemented system and method are provided for refining category scores for pages of a sequence of document pages that potentially includes document boundaries. The method uses initial category scores provided by a categorizer that considers one page at a time or concatenated pairs of pages (called bipages). The category scores represent the probability that a page belongs to a particular category. The method uses anisotropic diffusion to refine the initial page category scores using the scores of neighboring pages as a function of the probability that there is a boundary between the pages. The method may be performed iteratively.

Abstract: Managing a shared file system comprising a directory and files stored on a multiple storage devices shared by plural processing nodes, is provided. A plurality of parallel directory traversal records are partitioned into a plurality of ranges to allow for the records in each range to be written independently in parallel by plural processing nodes during parallel directory traversal. Parallel operations are performed comprising parallel directory traversal of all directory paths and files in the shared file system.

Abstract: A computing system. The system comprises enterprise computers, each enterprise computer executing at least one instance of an enterprise application and executing one logging agent associated with each instance of the enterprise application; logging computers each executing at least one instance of a logging distribution application that is configured to receive logs from the logging agent application instances; and a centralized log repository computer that executes a log file manager. Each of the logging agent applications analyze a processing load of the logging computers and transmit logs to a logging computer that the logging agent application adaptively selects based on the analysis by the logging agent application of the processing load of the logging computers, wherein each logging distribution application is configured to forward logs received from logging agent applications to the centralized log repository computer, and wherein the log file manager writes the logs into log files.

Abstract: The PORTAL-DOORS System has been designed as a distributed network system with hierarchical authorities for entity registering and attribute publishing of mobile metadata. An alternate bootstrapping design with self-referencing and self-describing features has been implemented with an integrated model for the combined registry-directories that co-exists with the independent model for the separate registries and directories. The concept of multilevel metadata about metadata has been implemented with the use of entity, record, infoset, representation and message metadata. This multilevel metadata about metadata improves the efficiency of search and analysis of the metadata content within the networked system. The methods facilitate search of varying scope both within and across the registries, directories and registry-directories focused on different problem oriented domains. Maintaining the integrity of these problem oriented domains serves to improve the efficiency of search throughout the system.

Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.

Abstract: A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents.

Abstract: Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results.