Abstract: An uninterruptible power supply (UPS) apparatus is disclosed that can receive power from different electrical utility configurations. The input stage of the UPS includes a three phase rectifier bridge design having three legs configured for connection to the different electrical utility configurations. An advantage that may be realized in the practice of some disclosed embodiments of the UPS input stage is that a single UPS can have the flexibility to be used with different electrical utility configurations having different voltages and phases.

Abstract: Described is using context information obtained from entity mentions in likely relevant documents to extract entity mentions from documents that are ambiguous with respect to their relevance to a domain. A list of entities is input into an entity extraction mechanism, which processes a large collection of documents to determine data (counts) corresponding to frequency of entity mentions. Infrequently mentioned entities are specific entities, while frequently mentioned entities are non-specific (generic or ambiguous) entities. The context surrounding mentions of the specific entities is processed to obtain interesting context terms (words, phrases or both) for the domain. The interesting context terms are then compared against the contexts of non-specific entity mentions to determine whether each non-specific entity mention is relevant to the domain. A result set containing only relevant documents or relevant mentions collection is output.

Abstract: Described is using context information obtained from entity mentions in likely relevant documents to extract entity mentions from documents that are ambiguous with respect to their relevance to a domain. A list of entities is input into an entity extraction mechanism, which processes a large collection of documents to determine data (counts) corresponding to frequency of entity mentions. Infrequently mentioned entities are specific entities, while frequently mentioned entities are non-specific (generic or ambiguous) entities. The context surrounding mentions of the specific entities is processed to obtain interesting context terms (words, phrases or both) for the domain. The interesting context terms are then compared against the contexts of non-specific entity mentions to determine whether each non-specific entity mention is relevant to the domain. A result set containing only relevant documents or relevant mentions collection is output.

Abstract: This document describes technology that can be embodied in a method that includes accessing a file representing at least one spreadsheet, and analyzing the file to identify a plurality of components of the spreadsheet. The plurality of components includes at least two of: (i) a component representing content of the at least one spreadsheet, (ii) a component representing one or more formulae associated with the at least one spreadsheet, (iii) a component representing one or more macros, (iv) a component representing one or more queries, and (v) a component representing links associated with the at least one spreadsheet. The method also includes creating, based on the components of the spreadsheet, a plurality of files that together represents the at least one spreadsheet, and storing the plurality of files at a storage location. Each of the plurality of files corresponds to a particular component.

Abstract: An information retrieval system converts unstructured ad-hoc search queries into structured search instructions that retrieve data in a structured relational database or an unstructured database. Data from the database is uploaded into a distributed in-memory database system. Tokens are automatically generated based on attributes, measures, and other metadata extracted from the relational database. The tokens are then compared with the non-structured ad-hoc user search queries. The information retrieval system uses the tokens to identify or predict what structured data is associated with user search queries. The tokens guide the user through a set of search terms that the system then uses to generate the structured query instructions. The structured query instructions retrieve specific data and answers from in the database system.

Abstract: A set of documents is filtered for entity extraction. A list of entity strings is received. A set of token sets that covers the entity strings in the list is determined. An inverted index generated on a first set of documents is queried using the set of token sets to determine a set of document identifiers for a subset of the documents in the first set. A second set of documents identified by the set of document identifiers is retrieved from the first set of documents. The second set of documents is filtered to include one or more documents of the second set that each includes a match with at least one entity string of the list of entity strings. Entity recognition may be performed on the filtered second set of documents.

Abstract: A set of documents is filtered for entity extraction. A list of entity strings is received. A set of token sets that covers the entity strings in the list is determined. An inverted index generated on a first set of documents is queried using the set of token sets to determine a set of document identifiers for a subset of the documents in the first set. A second set of documents identified by the set of document identifiers is retrieved from the first set of documents. The second set of documents is filtered to include one or more documents of the second set that each includes a match with at least one entity string of the list of entity strings. Entity recognition may be performed on the filtered second set of documents.

Abstract: An uninterruptible power supply (UPS) apparatus is disclosed that can receive power from different electrical utility configurations. The input stage of the UPS includes a three phase rectifier bridge design having three legs configured for connection to the different electrical utility configurations. An advantage that may be realized in the practice of some disclosed embodiments of the UPS input stage is that a single UPS can have the flexibility to be used with different electrical utility configurations having different voltages and phases.

Abstract: This patent application relates to taxonomy editing. One implementation involves a taxonomy editor configured to generate a visual representation of a taxonomy associated with a set of scientific papers. The taxonomy editor includes a properties module configured to identify properties relating to an individual node of the taxonomy and a statistics module configured to determine trends relating to the individual node. The taxonomy editor further includes a similarity module configured to evaluate keyword similarity relative to individual scientific papers associated with the individual node. The taxonomy editor also includes a suggestion module configured to utilize the properties, the trends and the keyword similarity to identify potential modifications to the taxonomy. The taxonomy editor is further configured to present at least some of the potential modifications, the properties, the trends, and the keyword similarity concurrently with the visual representation of the taxonomy.

Abstract: Techniques are described for incorporating different types of input available to administrators responsible for assigning reviewers (persons) to objects to be reviewed. A plurality of types of assignment ranking algorithms is provided. Each ranking algorithm can output a different set of candidate assignments (reviewer-review object pairs) with corresponding ranks/weights (measures of how well object fit reviewers). Some ranking algorithms may automatically generate assignments by using information about review objects and reviewers to find matches therebetween. Other algorithms might simply rank or weigh suggested matches (e.g., from manual input). The ranked/weighted assignments from the various algorithms are combined to produce a final result set of suggested assignments of reviewers. In one embodiment, a bidding algorithm, referral algorithm, and a relevance algorithm may be used, and intermediate results therefrom are combined for a final result.

Abstract: Techniques are provided for monitoring the state or status of virtual data centers. In one embodiment, a method includes receiving state information representing the state of hardware devices supporting instantiations of virtual data centers operating within a physical data center. The state information is mapped to hardware devices supporting a selected instantiation of a virtual data center to identify state information for the selected instantiation of a virtual data center. An assessment is then made, based on the state information for the selected instantiation of a virtual data center, regarding a degree to which the selected instantiation of a virtual data center is operating in accordance with predetermined policy. A user is then notified of the assessment via, e.g., a color-coded dashboard representation of the selected instantiation of a virtual data center or a color-coded aspect of the selected instantiation of a virtual data center.

Abstract: The claimed subject matter provides a system and method for automatic allocation of tenants to database services. An exemplary method comprises determining a query plan based on a workload for each tenant. A distance metric is created based on the query plan for each tenant, and tenants are clustered based on the distance metric into a predetermined number of clusters which is equal to the predetermined number of databases.

Abstract: Techniques are described for incorporating different types of input available to administrators responsible for assigning reviewers (persons) to objects to be reviewed. A plurality of types of assignment ranking algorithms is provided. Each ranking algorithm can output a different set of candidate assignments (reviewer-review object pairs) with corresponding ranks/weights (measures of how well object fit reviewers). Some ranking algorithms may automatically generate assignments by using information about review objects and reviewers to find matches therebetween. Other algorithms might simply rank or weigh suggested matches (e.g., from manual input). The ranked/weighted assignments from the various algorithms are combined to produce a final result set of suggested assignments of reviewers. In one embodiment, a bidding algorithm, referral algorithm, and a relevance algorithm may be used, and intermediate results therefrom are combined for a final result.

Abstract: Architecture for finding related entities for web search queries. An extraction component takes a document as input and outputs all the mentions (or occurrences) of named entities such as names of people, organizations, locations, and products in the document, as well as entity metadata. An indexing component takes a document identifier (docID) and the set of mentions of named entities and, stores and indexes the information for retrieval. A document-based search component takes a keyword query and returns the docIDs of the top documents matching with the query. A retrieval component takes a docID as input, accesses the information stored by the indexing component and returns the set of mentions of named entities in the document. This information is then passed to an entity scoring and thresholding component that computes an aggregate score of each entity and selects the entities to return to the user.

Abstract: Described is using context information obtained from entity mentions in likely relevant documents to extract entity mentions from documents that are ambiguous with respect to their relevance to a domain. A list of entities is input into an entity extraction mechanism, which processes a large collection of documents to determine data (counts) corresponding to frequency of entity mentions. Infrequently mentioned entities are specific entities, while frequently mentioned entities are non-specific (generic or ambiguous) entities. The context surrounding mentions of the specific entities is processed to obtain interesting context terms (words, phrases or both) for the domain. The interesting context terms are then compared against the contexts of non-specific entity mentions to determine whether each non-specific entity mention is relevant to the domain. A result set containing only relevant documents or relevant mentions collection is output.

Abstract: This patent application relates to taxonomy editing. One implementation involves a taxonomy editor configured to generate a visual representation of a taxonomy associated with a set of scientific papers. The taxonomy editor includes a properties module configured to identify properties relating to an individual node of the taxonomy and a statistics module configured to determine trends relating to the individual node. The taxonomy editor further includes a similarity module configured to evaluate keyword similarity relative to individual scientific papers associated with the individual node. The taxonomy editor also includes a suggestion module configured to utilize the properties, the trends and the keyword similarity to identify potential modifications to the taxonomy. The taxonomy editor is further configured to present at least some of the potential modifications, the properties, the trends, and the keyword similarity concurrently with the visual representation of the taxonomy.

Abstract: Systems and methods (“utility”) for providing a computer system with a mechanism to record live data on a continuous basis which may be analyzed subsequent to a fault condition is provided. The utility uses the existing DRAM memory of a computer system as a retentive DRAM (RDRAM) device that may be used to store the data. To accomplish this, software and firmware is provided for continuously refreshing the DRAM memory across resets that are due to fault conditions. Further, non-maskable interrupts (NMI) are used to flag a variety of fault conditions to the computer system. To make the utility platform independent, a standardized power and configuration interface is used to implement a computer system reset that preserves the contents of the RDRAM.

Abstract: Systems and methods (“utility”) for providing a computer system with a mechanism to record live data on a continuous basis which may be analyzed subsequent to a fault condition is provided. The utility uses the existing DRAM memory of a computer system as a retentive DRAM (RDRAM) device that may be used to store the data. To accomplish this, software and firmware is provided for continuously refreshing the DRAM memory across resets that are due to fault conditions. Further, non-maskable interrupts (NMI) are used to flag a variety of fault conditions to the computer system. To make the utility platform independent, a standardized power and configuration interface is used to implement a computer system reset that preserves the contents of the RDRAM.

Abstract: The subject disclosure pertains to exploitation of sequence information in a workload for the purpose of performance tuning. An optimal or exhaustive approach to tune sequences by mapping to a shortest path problem is provided as well as powerful techniques that result in optimal or nearly optimal solutions. Also disclosed is greedy approach that is much more efficient than the optimal approach and yet also generates solutions of comparable quality. Further yet, systems and methods are provided that facilitate extraction of sequence information and implementation of recommendations.

Abstract: The described implementations relate to query portals. One technique analyzes search results generated by a web search engine responsive to a user search query. The technique also dynamically generates a query portal that lists the search results as well as entities identified from the search results.