Abstract: Aspects of the invention relate to a computer-implemented method of improving the efficiency of an electronic collateralisation search engine that uses assets distributed on one or more remotely-located asset depositories. The method comprises selecting from a database of asset records of the remotely-located assets of a collateral giver, a subset of asset records having asset characteristics that satisfy a collateral giver's one or more predefined threshold criteria. Restricting a received search of collateral giver's asset records, which match a collateral receiver's query, to the subset of collateral giver's asset records.

Abstract: A system, method, and computer-readable medium for resolving an identity of an entity, comprising parsing entity identifier information associated with the entity to provide an entity identifier element, the entity identifier information comprising temporal information; classifying the entity identifier element to provide a classified entity identifier element; normalizing the classified entity identifier element to provide a classified and normalized entity identifier element; and, associating the classified and normalized entity identifier element and the temporal information with the entity to resolve the identity of the entity at a particular point in time.

Abstract: Systems and methods for analyzing input data records are provided in which a master process initiates a plurality of concurrent first processes each of which comprises, for each data record in at least a subset of a plurality of input data records, creating a parsed representation of the data record and independently applying a procedural language query to the parsed representation to extract one or more values. A respective emit operator is applied to at least one of the extracted one or more values thereby adding corresponding information to a respective intermediate data structure. The respective emit operator implements one of a predefined set of statistical information processing functions. The master process also initiates a plurality of second processes each of which aggregates information from a corresponding subset of intermediate data structures to produce aggregated data that is, in turn, combined to produce output data.

Abstract: Methods and systems disclosed herein relate generally to generating and using graph models to perform entity-specific mappings to investigatory events. More specifically, data-reliability metrics are used to selectively use proxy nodes in graph-model trajectories during generation of the mappings.

Abstract: For improving data placement optimization in a computing storage environment, an application layer and/or a user are allowed to attach anticipated usage metadata and directive metadata to a file. The anticipated usage metadata contains a plurality of attributes describing characteristics of the file and the directive metadata contains directives comprising storage instructions for the file. Additionally, a set of metadata is added to the file at a time of creation. The core metadata includes characteristics such as an importance factor as to how essential the anticipated usage metadata and directive metadata should be followed when determining file placement with the computing storage environment.

Abstract: The embodiments relate to generating hierarchical patterns based on a corpus of text. The corpus is analyzed, which includes extracting a set of features of the corpus. A set of grammatical patterns are generated based on the extracted features. The set of grammatical patterns includes at least one grammatical pattern generated from an internal pattern and at least one grammatical pattern generated from an external pattern. The grammatical patterns of the set are organized into a hierarchy and/or are ranked. The hierarchy and/or ranking are visually displayed.

Abstract: An enhanced multidimensional data management system significantly reduces the resources required to convert a spreadsheet into an enterprise collaborative system. A spreadsheet may be imported as is without modifications. Additional information that cannot be automatically inferred about the data model used in the spreadsheet is obtained. Dimensions, timescale, and measure data are clearly defined and located. The spreadsheet is kept in the system in the form of both a spreadsheet and as a multidimensional data structure such as an online analytical processing (OLAP) cube or structure. This duality allows the spreadsheet to be manipulated as if it was an OLAP cube, modifying iterations within the dimensions, and the OLAP cube to be computed as if it was a spreadsheet.

Abstract: A distributed data processing system for a database composed of data records organized into tables for responding to a request to split an index in a consistent and concurrent fashion. A request to split an index atom at any given node is processed by a designated “chairman” for that index atom. The chairman splits its index by maintaining a lower portion thereof and by moving the contents of an upper portion to a newly created index atom as the right sibling. Each other node takes appropriate steps to assure orderly transfer of this information from the chairman consistently and concurrently across the distributed database processing system.

Abstract: Embodiments of the invention are directed to a decentralized block chain regulation architecture. The invention utilizes the collective nature of block chain communication to perform key regulatory and control functions. Instead of relying on a centralized regulatory source, the present system allows the block chain structures themselves to simultaneously function as both regulated and regulatory chains for one another to form an interconnected network of decentralized, regulatory chains. Further, the system allows for control of non-compliant block chains, wherein regulatory chains may issue commands to the non-compliant chains, rewrite data, overwrite an incorrect consensus, or deactivate a chain and remove it from a block chain environment before propagation of an error.

Abstract: A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage devices, for data processing. One of the methods includes determining, by a storage system from an index log file, information of a data log file stored in a storage device. The data log file includes one or more of block data, transaction data, or state data generated by a blockchain network. The storage system determines whether the data log file needs a rewritten placement. In response to determining that the data log file needs a rewritten placement, the storage system determines a source storage location of the data log file, reads the data log file from the source storage location, rewrites the data log file to a destination storage location; and generates a destination index log file that indicates the destination storage location corresponding to the data log file.

Abstract: Techniques for providing consumer device interfaces are discussed herein. Some embodiments may include a system, including processing circuitry configured to: connect with a consumer device via a network; provide a search interface to the consumer device; receive one or more search parameters from the consumer device via the network; determine card scores for candidate cards based on the one or more search parameters, wherein each card includes an electronic marketing message indicating one or more items; determine a card score ranking based on the card scores; determine whether the consumer device is a mobile device; and in response to determining that the consumer device is a mobile device: determine mobile card layout; generate a mobile interface based on the mobile card layout; and provide one or more of the candidate cards to the mobile interface based on the card score ranking and the mobile card layout.

Abstract: Columnar storage provides many performance and space saving benefits for analytic workloads, but previous mechanisms for handling single row update transactions in column stores suffer from poor performance. A columnar data layout facilitates both low-latency random access capabilities together with high-throughput analytical access capabilities, simplifying Hadoop architectures for use cases involving real-time data. In disclosed embodiments, mutations within a single row are executed atomically across columns and do not necessarily include the entirety of a row. This allows for faster updates without the overhead of reading or rewriting larger columns.

Abstract: A method for identifying correlated datasets comprises receiving a natural language query from a user, extracting electronic metadata from a plurality of computerized datasets, correlating the electronic metadata with the natural language query using natural language processing, calculating a correlation score between the natural language query and each of the plurality of electronic datasets, and returning a result to the user, wherein the result includes one or more datasets of the plurality of electronic datasets with a correlation score greater than or equal to a threshold.

Abstract: A computer-implemented semantic analysis system for ranking search results has instructions including the steps: receive a query about a first document authored by a person; read in data identifying the first document; read in a second document about the person authored after the first document; identify indicator terms in the second document related to whether or not there is a significant discrepancy between the second document and the first document; read in weighting factors for the identified indicator terms; determine an aggregate weighting factor that decreases with an increasing number of indicator terms found; and calculate a score of how much of a discrepancy there is between the second document and the first document using the weighting factors. When multiple first documents are returned for multiple persons, present the links in order from high score to low score.

Abstract: Embodiments are directed to a computer implemented method of processing multiple versions of documents. The method includes importing a new version of a document. The method further includes determining that a section of the document can be imported from a previous version of the document. The method further includes creating a table of contents entry for the section and indexing the new version of the document. Another embodiment can be directed to a computer implemented method of implementing searches across multiple versions of a document. After receiving a search query, the search query can be performed across multiple versions of the document. Duplicates can be analyzed and removed. If there are no results from a target version, search results from a prior version of a document are analyzed to find a result from the target version.

Abstract: The invention relates to a method and apparatus for recording and maintaining stored information system object relationship information. Information contained within a stored information system (including system catalogs, referential constraints, triggers, table hierarchies, column references, indexes, stored program packages, system catalogs, stored procedures, stored queries, log/trace files of dynamically executed code, etc.) are searched to identify dependency relationships between objects. This object relationship information is stored and maintained in an information base. Information within the information based may be organized based upon subsets of objects that support a common application, service, or capability.

Abstract: A method of operating a geo-fence pre-caching system that includes a cache server and caches is provided. The method includes receiving from a user device and at a cache server a query wrapper including a cache identifier and a location of the user device. The cache server is implemented in a cloud-based network. The method includes selecting a cache based on the cache identifier. The method includes mapping the location to a first geographical area and accessing a cache entry of a cache record based on the first geographical area. The cache entry indicates the first geographical area. The method includes, based on content of the cache entry, accessing cache entries corresponding to geographical areas adjacent to the first geographical area. The content of the cache entry links to the cache entries. The method includes retrieving and formatting content included in the cache entries for presentation at the user device.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for deleting a node in a blockchain network are provided. One of the methods includes: obtaining, by a first consensus node of the blockchain network, a transaction comprising a request for deleting a second consensus node of the blockchain network; in response to that consensus verification of the transaction succeeds, executing the transaction and sequentially numbering in a node list a plurality of remaining consensus nodes of the blockchain network excluding the second consensus node; and performing view change for the remaining consensus nodes to participate in future consensus verification.

Abstract: Systems and methods are provided for analyzing documents. In one implementation, a computer implemented method is provided for analyzing a patent application and providing a visual representation. According to the method, a selection is received from a user to view claims of the patent application in a claim tree hierarchy and a computer displays the claims in the claim tree hierarchy on a display. The claim tree hierarchy visually depicts relationships between the claims. The method identifies one or more words of at least one of the claims that constitutes an element and displays, in the claim tree hierarchy, the words constituting the element in association with the claim.