Abstract: Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

Abstract: Edge-based recognition systems and methods are presented. Edges of the object are identified from the image data based on co-circularity of edgels, and edge-based descriptors are constructed based on the identified edges. The edge-based descriptors along with additional perception metrics are used to obtain a list of candidate objects matched with the edge-based descriptors. Through various filtering processes and verification processes, false positive candidate objects are further removed from the list to determine the final candidate object.

Abstract: A method for reconciling transactions iteratively by segregating data into homogeneous data sets. The method includes acquiring transactions from two or more systems and comparing with a set of configurable predefined matching rules. Applying, based on the result of the comparison, one or more rules on the acquired transactions. The transactions of the two or more systems are scanned and a user defined function is applied on the transactions of the two systems. A value of the user defined function is calculated. If the value of the user defined function is residual value, a configurable criteria is applied on the value of the user defined function. A residual transaction is created in one of the systems and the value of the user defined function is recalculated. If the value of the user defined function is null value, indicates the transactions are reconciled.

Abstract: The present invention relates generally to gathering, verifying, and providing information in an easy-to-understand format. Representations are obtained and evaluated to extract selected content or content information from which certain synthesized information can be gathered, collected, estimated, calculated, or determined. In addition, supplemental synthesized information may be gathered, collected, estimated, calculated, or determined.

Abstract: A search system includes a storage system that stores a plurality of sets of application-specific rules. Each of the sets is associated with a respective application and defines a template for generating function identifiers that identify functions of the respective application. A search module receives a search query prepared by a remote device, identifies at least one entity type indicated by the search query, and retrieves a first set of application-specific rules corresponding to the identified entity type. The search module generates at least one unparameterized function identifier using the retrieved first set of application-specific rules and the search query and parameterizes the at least one unparameterized function identifier using the search query. Parameterizing the at least one unparameterized function identifier includes populating at least one parameter field with a parameter value. The search module generates search results based on the parameterized function identifier.

Abstract: An extensive computer based online math research system (the “Research System”) having as its foundation an Ontology of mathematics, and utilizing unique and intensive computer support, coordination, data structuring, data storage, computer processing, retrieval capabilities, and data-mining capabilities, and an Ontology editing system that runs on computer software with computer processors and data storage capabilities (the “Ontology Editor System”). The Research System also includes a methodology to enable online reference and data manipulation of the Ontology, and an Internet based search of the concepts of mathematics and applications of mathematics to the sciences on the basis of the Ontology.

Abstract: Examples are generally directed towards a file server having a unified file system associated with a unified slice map volume. In one example, the unified file system stores file system metadata and sparse volume metadata within the unified slice map volume. The unified file system performs a unified set of functions using the file system metadata and sparse volume metadata in the unified slice map volume.

Abstract: Systems and methods for photograph mapping are disclosed herein. In one embodiment a first digital image and at least one user-generated datum is received from at least one user. The first image is geographically organized according to the at least one datum. The first image is associated with at least one location and at least one direction. The first image is provided from a first person perspective to a user in response to a request.

Abstract: Systems and methods are disclosed for replicating data. An example method includes receiving at a server a current data index and current data. The server is coupled to a first node and a second node, and the current data is responsive to a request from a client. The method also includes replicating the current data and the current data index to the second node. The method further includes receiving at the server a heartbeat message including the current data index and a client identifier. The heartbeat message is from the second node, and the client identifier identifies the client. The method also includes in response to receiving the heartbeat message, sending a notification indicating that the current data has been replicated to the second node to a load balancer.

Abstract: Techniques are described for using stored function instantiations, together with user queries. In one example, a method includes receiving a query from a user that contains one or more parameters. The method further includes comparing one or more parameters of the query with one or more parameters of one or more stored function instantiations. The method further includes determining a pre-existing function instantiation from the one or more stored function instantiations that have one or more parameters in common with the query. The method further includes identifying one or more parameters that are not in common between the query and the pre-existing function instantiation. The method further includes modifying the pre-existing function instantiation into a repurposed function instantiation that incorporates the one or more parameters from the query that are not in common between the query and the pre-existing function instantiation.

Abstract: A database system may include a storage device to store a plurality of database tables. At least a portion of the database tables may be column-partitioned. The database system may also include a processor in communication with the storage device and a row-column subsystem executable by the processor to receive a request to locate a row of a column-partitioned database table. The row in the request may be used to provide a response to a query. The row-column subsystem may be further executable to determine if referenced column values of the requested row are stored in a cache associated with the row-column subsystem. The row-column subsystem may be further executable to retrieve the referenced column values of the row in the request from the cache in response to the determination that the column values are in the cache. The row-column subsystem may be further executable to provide the referenced column values for evaluation with respect to query conditions of the query.

Abstract: An approach is described of query processing via a lambda application including a batch processing layer and a speed processing layer. The approach may improve speed and efficiency with respect to computation of query results associated with the batch processing layer. A method pertaining to such approach may include receiving a query including an initial timeframe and computing partial query results within the initial timeframe. The partial query results within the initial timeframe may include a result for data associated with the speed processing layer and results for a first set of data segments associated with the batch processing layer. The method further may include combining the partial query results within the initial timeframe into a final query result. The method further may include computing partial query results outside of the initial timeframe including results for a second set of data segments associated with the batch processing layer.

Abstract: Systems and computer implemented methods for patent mapping are provided. In one embodiment, a system comprises a database of patent portfolios and a database of patents, each patent stored in the database of patents associated with one or more patent portfolios stored in the database of patent portfolios, and one or more specially-configured modules, each including a computer processor executing on software, to perform certain operations. The operations include highlighting claim terms associated with a patent concept across a number of patent claims; storing the associations; and displaying one or more mapped patent claims and the highlighted claim terms associated with the patent concept to a user in a graphic user interface.

Abstract: A computer system for identifying and associating metadata across related media with the same content.

Abstract: An embodiment of the invention provides a method for control for persistent search results and iterative searching where a query from a user is received via a web browser and a web search for the query is performed with a processor. Search results of the web search are displayed in a toolbar of the web browser, wherein at least one of the search results in the toolbar includes a refinement option. The refinement option can include a show me more like this refinement option and/or a show me less like this refinement option. A selected refinement option is received from the user with a user interface; and, refined search results are displayed in the toolbar based on the selected refinement option.

Abstract: In one example embodiment, a computer system includes at least one processor and a memory storing a data graph and instructions. The instructions, when executed by the at least one processor, cause the system to generate a template sentence based on a fact including a first node, a second node and a string, wherein the first node and the second node exist in the data graph and the string represents a fact that is absent from the data graph, search the internet for a document including the template sentence, and upon determining the internet includes the document with the template sentence, infer the fact by generating a series of connections between nodes and edges of the data graph that together with the first node and the second node are configured to represent the fact, the series of connections defining a path, in the data graph, from the first node to the second node.

Abstract: Methods, systems, and media are provided for delivering clustered search results for recent and non-recent events by maintaining the identification (ID) numbers of the respective clustered documents beyond the “fresh” life span of the clustered documents. When clusters are formed according to similar content, an ID number and associated attributes are assigned to each of the clusters. This provides a mechanism to track and retrieve the respective clusters for subsequent delivery of search results. The respective ID numbers of the clusters are maintained, even after the documents are no longer considered “fresh.” These similar-content clusters are further subdivided according to publication date. This provides individual subdivided clusters for similar content events that occurred at different time spans, which are delivered along with individual non-clustered search results in a SERP.

Abstract: A method and system that organizes and transmits data between systems is provided. The system and method also includes monitoring, using the monitoring data of a configuration data object, an identified monitoring location to detect a presence of at least one image file received from an image processing device and detecting, at the monitoring location, a presence of a metadata file associated with the at least one image file and determining if a sufficient amount of metadata is included in the metadata file. In response to detecting a sufficient amount of metadata is included in the metadata file, automatically transmitting the at least one image file and metadata file to the destination location identified in the destination data and creating a table in a database based on the structure data and storing the at least one type of metadata therein.

Abstract: A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, where the master node is the root node in a tree. The master node may distribute query plans and query metadata to other nodes in the cluster. These additional nodes may request additional metadata from each other or the master nodes as necessary.

Abstract: A method, system and/or non-transitory computer readable medium is used with a service repository that stores service definitions for services. A query facility inspects service definitions in the service repository. The query facility determines, from the inspection, first attributes associated with a first service and different second attributes associated with a second service, the first and second attributes being related to syntactic and semantic aspects of the first and second services. Responsive to a service oriented request which indicates the first service, the query facility determines a composability of the first and second services in accordance with a service oriented query (SOQ) framework, based on the first and second attributes and rules regarding composability of attributes, the rules being in accordance with the SOQ framework, the composability of the first and second services being determined with respect to both the syntactic and semantic aspects of the first and second services.