Abstract: Systems and methods for category-based search are described. In one described system, a computer program identifies an article having an attribute, determines a category associated with the article based at least in part on the article attribute, and stores in a data store a data record comprising a category-article pair identifier associated with the category and the article. A search query is received and executed on a data store comprising the association data record. In response, the association data record is received from the data store. Search results may be constructed and displayed using the association data record.

Abstract: A search authoring tool for mapping queries to assets for use in an information retrieval system has a query-to-asset mappings database, a search authoring engine, and a search evaluation engine. The query-to-asset mappings database is built from search author input and user mappings. The search authoring engine is adapted to receive operator input and to generate one or more new query-to-asset mappings based on the received operator input. The search evaluation engine is adapted to compare the one or more new query-to-asset mappings to the existing mappings to determine if the one or more new query-to-asset mappings will cause performance degradation of the information retrieval system.

Abstract: Methods, apparatus, and products are disclosed for parallel execution of operations for a partitioned binary radix tree that include: receiving, in a parallel computer, an operational entry for the PBRT, the PBRT comprising a plurality of logical pages that contain a plurality of entries, each logical page included in a tier and containing one or more subentries corresponding to the tier of the logical page containing the subentry, each entry is composed of a subentry from each logical page on an entry path; processing in parallel, on the parallel computer, each logical page in each tier, including: identifying a portion of the operational entry that corresponds to the tier of the logical page, and performing an operation on the logical page in dependence upon the identified portion of the operational entry for the tier; and selecting operation results from the logical pages on the entry path for the operational entry.

Abstract: A framework registers the entry names of entry interfaces respectively included in modules. The framework acquires operation names (static entries) of operation interfaces included in the module by calling the entry interface based on the entry name. The framework calls the operation interfaces based on the operation names. And the module executes generation of the module itself to be connected to the framework, a process inherent in the module, and deletion of the module itself connected to the framework.

Abstract: A module possessing a class descriptor declares for the module the supported classes. The installation of the module triggers the examination class information model hierarchies possessed by the container on which the module is installed. Finding the established class information model hierarchies to be lacking with respect to the newly installed supported classes, a query is made to ascertain child-parent information for the newly installed supported classes. Using this information, an ancestry of each class is achieved so as to sparsely populate an information model hierarchy for each newly installed supported class.

Abstract: The present invention provides a search method and system for matching a commodity to one or more applications for using the commodity. A plurality of properties associated with the commodity are identified. A collection of documents for searching for a plurality of combinations of said properties is then defined, wherein the combination includes a single property or multiple properties. The defined collection of documents is searched for all occurrences of the combination of properties, and the hits retrieved for those documents that include the properties. The hits are then associated with one or more subclasses of a classification scheme, and reviewed for those hits that include the properties of the commodity but not the commodity, wherein subclasses not including hits that include the commodity are matched as applications for the commodity.

Abstract: A method for managing fixed-area video segments from fixed-area security cameras using a media asset management system includes collecting the fixed-area video segments from the fixed-area security cameras, associating corresponding geospatial data with each fixed-area video segment, and creating a search thesaurus including search descriptors with cross-references therebetween. At least one respective search descriptor from the search thesaurus is associated with each fixed-area video segment. The method further includes storing each fixed-area video segment, its geospatial data and its at least one search descriptor on the media asset management system for later search and retrieval, such as by a security organization. The search descriptors may be geospatial search descriptors that are cross-referenced in a hierarchical relationship.

Abstract: A method for enumerating an asset includes receiving an enumeration request for enumerating an asset, obtaining a data acquisition (DAQ) definition associated with the enumeration request, translating the enumeration request from an information model format to a DAQ format, wherein the DAQ definition complies with the DAQ format, identifying an actual uniform resource identifier (URI) from the DAQ definition based on the enumeration request, where the URI identifies an enumeration mechanism, triggering a protocol handler associated with the enumeration mechanism, and obtaining information about at least one instance of the asset from the protocol handler.

Abstract: An image retrieval technique employing a novel hierarchical feature/descriptor vector quantizer tool—‘vocabulary tree’, of sorts comprising hierarchically organized sets of feature vectors—that effectively partitions feature space in a hierarchical manner, creating a quantized space that is mapped to integer encoding. The computerized implementation of the new technique(s) employs subroutine components, such as: A trainer component of the tool generates a hierarchical quantizer, Q, for application/use in novel image-insertion and image-query stages. The hierarchical quantizer, Q, tool is generated by running k-means on the feature (a/k/a descriptor) space, recursively, on each of a plurality of nodes of a resulting quantization level to ‘split’ each node of each resulting quantization level. Preferably, training of the hierarchical quantizer, Q, is performed in an ‘offline’ fashion.

Abstract: Expression-based data may comprise data that is processed by a validation expression for example. After a validation expression is created it may then be performed with respect to one or more data values or data records. A validation expression returns a Boolean result that signifies a success or failure result. A validation expression can define complex intra-record tests and inter-record tests with unlimited complexity. In order to improve processing of validations, the system uses virtual data known as calculation fields. Calculation fields are stored in memory at runtime and not in a database thereby eliminating the necessity of selecting and updating records in the database. A dirty bit identifying fields and attributes that need to be calculated based on a dependent data may be used to defer calculation to a later time when the calculation field is displayed or a sort operation occurs for example.

Abstract: A system and method that facilitate data access in a software development environment is provided. The system generates strongly typed objects that encapsulate raw, untyped data access logic and groups together like database commands in a common data access component. The system provides a mapping between database types and common language runtime data types including the impedance mismatch of null representations. The system configures data access component(s) that are employed at design-time to facilitate access to data object(s) by application(s) and allows a user of the configured data access component(s) to improve developer productivity and/or reduce the quantity of runtime errors introduced into code. The data access component can be instanced on multiple forms components and/or with the developer's own class(es). Thus, change(s) to a query and/or interface are accomplished within the data access component and be available to the forms components and/or object(s) that utilize the data access component.

Abstract: Systems and methods that enable consistent navigation (for a database and memory environment) in object relational mapping. This typically ensures fidelity of object graph via restrictions on collections of persistent objects (e.g., entity sets, entity refs . . . ). Moreover, a tracking component can detect changes as they occur, and only a copy of the objects that have changed can be created, to optimize operation.