Abstract: Systems and methods are described for automating the creation of data marts within an enterprise. Data is maintained in a plurality of data sources that include at least a relational database and a multidimensional database. The system includes a business intelligence server that provides a virtual logical semantic model to integrate all of the plurality of data sources. The user specifies a list of levels and measures on the virtual logical semantic model. The list of levels and measures can span data from multiple data sources. The user can also specify a location in the plurality of data sources that will store the aggregate matrix. Once the list of levels and measures are specified, the business intelligence server generates a multidimensional cube to store the data for the aggregate matrix and stores the multidimensional cube in the data source location.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing a plurality of items, each item including digital content, for each item of the plurality of items, generating a quality score to provide a plurality of quality scores, each quality score indicating a quality of an associated item and being based on at least one of a status score and a content score, the status score being associated with an author user of a respective item and the content score being associated with digital content provided in the respective item, determining an order of items based on respective quality scores, and transmitting instructions to display items to a user based on the order.

Abstract: A computer-implemented method can include translating a search query from a first language to a second language, comparing the translated query with content in the second language, and identifying content in the second language relevant to the translated query based on the comparing. Also, a computer-implemented method can include translating content in a second language at one or more network locations into a first language, comparing the translated content with a search query written in the first language, and identifying, from the translated content, content relevant to the query based on the comparing.

Abstract: A content search device includes a feature quantity computing unit that computes a feature quantity of at least any one of an image feature, an acoustic feature and a semantic feature included in each piece of content data, and that stores feature quantity data. The device also includes an unknown feature quantity computing unit that computes an unknown feature quantity of each feature type not associated with a content identifier in the feature quantity data by use of the feature quantity of the feature type associated with the content identifier, and that stores the unknown feature quantity as a feature estimated value in the feature quantity data. The device further includes a distance computing unit that computes a distance indicating a similarity between each two pieces of content data based on the feature quantities and the feature estimated values stored in the feature quantity data.

Abstract: A method and system for automatically and transparently managing a directory in a database system to preferentially use of objects in an in-memory database instead of copies of the objects in disk-based databases, in order to speed up application response times. The methods and systems selectively add or update LDAP entries to leverage advantage of the database objects in the in-memory database, so that the LDAP entries point to the in-memory database instead of disk-based databases.

Abstract: A distributed search system can include a group of nodes assigned to different partitions. Each partition can store indexes for a group of documents. Nodes in the same partition can independently processing document-based records to construct the indexes. One of the nodes can process a stored checkpoint to produce a repartitioned checkpoint. The group of nodes can respond to search requests during the construction of the repartitioned checkpoint. The repartitioned checkpoint can be loaded into the group of nodes to repartition the group of nodes.

Abstract: A method and system are presented for configuring a search algorithm for solving a combinatorial optimization problem. The search algorithm has a number of procedural components. Each procedural component is configured using a respective data structure. The data structure has a tree structure, including traversal split nodes, each of which represents a choice to be made when configuring the procedural component of the search algorithm. Configuring the procedural component corresponds to traversing the tree structure, and the traversal is performed automatically. At each of the traversal split nodes, the choice of which direction to take through the tree structure is made randomly, using a respective probabilistic function. Thus, a population of candidate algorithms is generated. These are evaluated, and the probabilistic functions modified.

Abstract: Various systems and methods for restoring data using indexes. For example, one method involves receiving a request that includes a restore criterion. The method involves identifying a storage object in a backup storage device that meets the restore criterion, in response to the request. Detecting the identity of the storage object involves sending a query with the restore criterion to a client computing device that includes an index. The method also involves responding to the request with information identifying the storage object.

Abstract: In production applications that process and transfer secure and sensitive customer data, the heap dump files of these applications, which may be useful for debugging production issues and bugs, may contain secure and sensitive information. Thus, to make the useful debugging information available in heap dumps from production applications without compromising secure client data to those assigned to debugging and fixing production issues, these heap dumps may be scrubbed of sensitive information without scrubbing information that is useful for debugging.

Abstract: System and method for suffix tree creation for large input data/text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string as well as the partially constructed suffix tree. The end result enables the indexing of very large input strings and at the same time maintain a bounded working set size and a fixed memory footprint. The method is employed for serial processing. Further, a scalable parallel suffix tree construction is realized that is suitable for implementation on parallel distributed memory systems that use effective collective communication and in-network caching. The methodology is also applied for suffix link recovery in both serial and parallel implementations.

Abstract: An apparatus for collecting dump data collection receives an on demand data (ODD) dump request, pauses one or more scan loops, transfers dump data to an ODD dump buffer space, unpauses the scan loops, and offloads dump data from the ODD dump buffer space to the storage device. The apparatus may also prioritize dump data for transfer to the ODD dump buffer space, load balance dump data for transfer to the ODD dump buffer space, and schedule offloading of the dump data from the ODD dump buffer space to non-volatile storage.

Abstract: A method for generating a bigram database may include receiving domain names, tokenizing the domain names, generating token bigrams from the tokenized domain names, filtering the token bigrams, ranking the token bigrams, and storing the filtered and ranked token bigrams in a bigram database. A method for suggesting alternative domain names may include receiving a requested domain name, tokenizing the requested domain name to divide the requested domain name into a series of tokens, retrieving token bigrams for tokens of the requested domain name, generating alternative domain name suggestions based on the token bigrams and the requested domain name, ranking the alternative domain name suggestions, and outputting at least one of the alternative domain name suggestions.

Abstract: Embodiments of the present invention provide a way to combing websites that can be edited over the Internet using distributed revision control. This also makes it possible to use writable web sites while not being connected to the Internet. In some embodiments, the present invention is applied to wikis. When a wiki reconnects, differences are automatically sent over and changes from other wikis are merged automatically. Wikis may also be synchronized on a periodic or event driven basis. Embodiments of the present invention may also be used for load balancing between wikis, or to share information with users who can only occasionally connect to the Internet.

Abstract: Method optimally links humans and information using correlations that detect shared interests. It then uses the probabilistic pathways established by iterating over these links to optimally connect individuals to the information they are most interested in. In so doing, this invention leverages the collective assessments of individuals whose perspectives most closely match the observer's perspectives to dramatically improve the personalized prioritization of information flows, information discovery, navigation and the efficient dissemination of information. This invention is particularly useful in providing an objective method to organize and assess information based on human subjectivity. Since human subjectivity plays an important factor in accessing the importance of nearly all forms of information, it dramatically improves the efficiency of connecting humans to the information they personally find the most valuable.

Abstract: According to the present invention, techniques for performing security functions in computer storage subsystems in order to prevent illegal access by the host computers according to logical unit (LU) identity are provided. In representative embodiments management tables can be used to disclose the Logical Unit in the storage subsystem to the host computers in accordance with the users operational needs. In a specific embodiment, accessibility to a storage subsystem resource can be decided when an Inquiry Command is received, providing systems and apparatus wherein there is no further need to repeatedly determine accessibility for subsequent accesses to the Logical Unit. Many such embodiments can maintain relatively high performance, while providing robust security for each LU.

Abstract: A method of pre-processing an XQuery on a XML data base and may comprise parsing the XQuery to obtain an abstract syntax tree and typing the abstract syntax tree to provide at least one pointer into a schema for XML documents of the XML data base. The typing step may involve the use of schema and accumulated instance data of the XML data base. Use of the accumulated instance data in addition to schema data allows for reduction of the set of pointers to a smaller set, which in turn reduces the number of documents to be examined when the query is executed.

Abstract: A method and system for generating and storing definitions from a multi-level database of unique industry-specific terms, organizing the words, phrases and their exhaustive numerical definitions in a digital dictionary, and providing the architecture to create new files and label existing files with metadata from the dictionary so as to provide a common, secure platform to better manage elements in and related to the industry. An example of an industry in which the method and system may be used is the healthcare industry. The system addresses every facet of the industry including quality control, performance, reimbursement, licensing and credentials, managing organizations and patient's health records. The unique digital language, deep definitions and consistent terminology also form the basis for many novel product concepts designed to improve efficiency and quality. A practice management product for radiology is also described.

Abstract: Method/system for visualizing biological information. The system receives a user query relating to biological information and determines which database contains related biological information. A database query is sent to the database and the result indicates biological/chemical entities and relations. A network is created based on the result; biological/chemical entities are mapped to network nodes and relations to network connections. A distance matrix indicates a multi-dimensional distance for several pairs of network nodes. A dimensionality reduction function is adjusted based on a research context, to bias the search toward a relevant focus. The number of dimensions in the distance matrix is lowered by the dimensionality reduction function. Neighbors of a selected node are searched (2-18) based on the distance matrix to elucidate a biological role of the selected node. A re-created network is visualized (2-20) based on the adjusted dimensionality reduction function.

Abstract: Ontology system providing enhanced search capability receives a search request specifying nodes and edges of interest and determines a set of matching ontologies stored in a knowledge store. The ontology system also generates a ranking for each of the matching ontologies based on the extent of matching. Data indicating the matching ontologies and corresponding rank is sent as a search result.

Abstract: A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety or sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be submitted at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.