Abstract: An example operation may include one or more of constructing a transaction proposal and sending the constructed transaction proposal to a plurality of endorsing nodes, by a client application of a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS), receiving a set of transaction responses from the plurality of endorsing nodes, by the client application of the computing system, the transaction responses each comprising a transaction validation function, assembling the received transaction responses into a transaction, by the client application of the computing system, and sending the transaction to an orderer node for distribution, by the client application of the computing system.

Abstract: An example operation may include one or more of constructing a transaction proposal, by a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS) that comprises ledger state addressing, oracles for addressing external data values, and user state addressing, the BNS providing a standard mechanism to name all blockchain resources using a universal resource indicator (URI).

Abstract: A computer system performs decentralized collection and aggregation of data. A plurality of requests for data are transmitted, by a data collection server, to a corresponding plurality of remote servers, wherein the plurality of remote server submit responses to the plurality of requests for data to a distributed data structure. The distributed data structure is accessed, by the data collection server, to retrieve the plurality of responses to the plurality of requests. The plurality of responses are aggregated, by the data collection server, into a message and the message is transmitted to an entity requesting data collection. Embodiments of the present invention further include a method and program product for performing decentralized collection and aggregation of data in substantially the same manner described above.

Abstract: Disclosed embodiments provide improvements in integration template generation. In embodiments, existing customer integration flows already created by users are analyzed using computer-implemented methods, and from these customer integration flows, templates are created that encapsulate the general patterns that are seen in existing customer integration flows. The customer integration flows are anonymized by removing proprietary and/or identifying data. The result is customer integration templates based on actual real-world usage, which can more accurately resemble the needs of customers as compared to traditional templates that are authored by someone envisioning how he thinks the applications will be linked together, but not based on how they actually are used. Disclosed embodiments can generate integration templates based on general patterns encountered by multiple users that serve as a good starting point for any user that wants to do similar integrations.

Abstract: A computer system performs decentralized collection and aggregation of data. A plurality of requests for data are transmitted, by a data collection server, to a corresponding plurality of remote servers, wherein the plurality of remote server submit responses to the plurality of requests for data to a distributed data structure. The distributed data structure is accessed, by the data collection server, to retrieve the plurality of responses to the plurality of requests. The plurality of responses are aggregated, by the data collection server, into a message and the message is transmitted to an entity requesting data collection. Embodiments of the present invention further include a method and program product for performing decentralized collection and aggregation of data in substantially the same manner described above.

Abstract: A method and system for mapping data elements between a source data structure and a target data structure. A source data element is mapped to a target data element by matching a source key and value pair to a target key and value pair. A parent source Soundex key for each parent element of the source data element is created. A parent target Soundex key for each parent element of a plurality of target data elements snatching the first Soundex key of the source data element is created. The parent source Soundex key for each parent element of the source data element is compared with each parent target Soundex key. The source data element is mapped to the target data element having the parent target Soundex key that matches the parent source Soundex key.

Abstract: Disclosed embodiments provide improvements in integration template generation. In embodiments, existing customer integration flows already created by users are analyzed using computer-implemented methods, and from these customer integration flows, templates are created that encapsulate the general patterns that are seen in existing customer integration flows. The customer integration flows are anonymized by removing proprietary and/or identifying data. The result is customer integration templates based on actual real-world usage, which can more accurately resemble the needs of customers as compared to traditional templates that are authored by someone envisioning how he thinks the applications will be linked together, but not based on how they actually are used. Disclosed embodiments can generate integration templates based on general patterns encountered by multiple users that serve as a good starting point for any user that wants to do similar integrations.

Abstract: The disclosure of the present invention presents a method and system for efficiently maintaining an object cache to a maximum size by number of entries, whilst providing a means of automatically removing cache entries when the cache attempts to grow beyond its maximum size. The method for choosing which entries should be removed provides for a balance between least recently used and least frequently used policies. A flush operation is invoked only when the cache size grows beyond the maximum size and removes a fixed percentage of entries in one pass.

Abstract: An example operation may include one or more of constructing a transaction proposal and sending the constructed transaction proposal to a plurality of endorsing nodes, by a client application of a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS), receiving a set of transaction responses from the plurality of endorsing nodes, by the client application of the computing system, the transaction responses each comprising a transaction validation function, assembling the received transaction responses into a transaction, by the client application of the computing system, and sending the transaction to an orderer node for distribution, by the client application of the computing system.

Abstract: An example operation may include one or more of constructing a transaction proposal, by a computing system, wherein inputs to the transaction proposal are named using a blockchain naming system (BNS) that comprises ledger state addressing, oracles for addressing external data values, and user state addressing, the BNS providing a standard mechanism to name all blockchain resources using a universal resource indicator (URI).

Abstract: A method and system for mapping data elements between a source data structure and a target data structure. A source data element is mapped to a target data element by matching a source key and value pair to a target key and value pair. A parent source Soundex key for each parent element of the source data element is created. A parent target Soundex key for each parent element of a plurality of target data elements snatching the first Soundex key of the source data element is created. The parent source Soundex key for each parent element of the source data element is compared with each parent target Soundex key. The source data element is mapped to the target data element having the parent target Soundex key that matches the parent source Soundex key.

Abstract: Systems, methods and tools for mapping data elements between a source data structure and a target data structure without the needing exactly matching values or a dictionary of synonyms. The embodiments of the present disclosure auto map data elements having similar phonetic sounds, even in the presence of one or more misspellings or alternative spellings. Embodiments of the present disclosure utilize Soundex algorithms to generate a key corresponding to each source and target data elements. Each Soundex key may be generated based on the phonetical sounds of the source and target data elements. By using phonetical sounds to generate the key, a Soundex algorithm allows for similarly sounding words, alternatively spelled words or misspelled words to generate the same Soundex key, creating equivalence between the naming of source and target data elements once the auto mapping function is implemented.

Abstract: The disclosure of the present invention presents a method and system for efficiently maintaining an object cache to a maximum size by number of entries, whilst providing a means of automatically removing cache entries when the cache attempts to grow beyond its maximum size. The method for choosing which entries should be removed provides for a balance between least recently used and least frequently used policies. A flush operation is invoked only when the cache size grows beyond the maximum size and removes a fixed percentage of entries in one pass.

Abstract: Systems, methods and tools for mapping data elements between a source data structure and a target data structure without the needing exactly matching values or a dictionary of synonyms. The embodiments of the present disclosure auto map data elements having similar phonetic sounds, even in the presence of one or more misspellings or alternative spellings. Embodiments of the present disclosure utilize Soundex algorithms to generate a key corresponding to each source and target data elements. Each Soundex key may be generated based on the phonetical sounds of the source and target data elements. By using phonetical sounds to generate the key, a Soundex algorithm allows for similarly sounding words, alternatively spelled words or misspelled words to generate the same Soundex key, creating equivalence between the naming of source and target data elements once the auto mapping function is implemented.

Abstract: The disclosure of the present invention presents a method and system for efficiently maintaining an object cache to a maximum size by number of entries, whilst providing a means of automatically removing cache entries when the cache attempts to grow beyond its maximum size. The method for choosing which entries should be removed provides for a balance between least recently used and least frequently used policies. A flush operation is invoked only when the cache size grows beyond the maximum size and removes a fixed percentage of entries in one pass.

Abstract: The disclosure of the present invention presents a method and system for efficiently maintaining an object cache to a maximum size by number of entries, whilst providing a means of automatically removing cache entries when the cache attempts to grow beyond its maximum size. The method for choosing which entries should be removed provides for a balance between least recently used and least frequently used policies. A flush operation is invoked only when the cache size grows beyond the maximum size and removes a fixed percentage of entries in one pass.

Abstract: A method and system are provided for navigation of a data structure. The method includes receiving an input path expression (104) for a query of a data structure (101) to locate one or more elements (110) in the data structure (101) at runtime. The input path expression (104) includes one or more path steps. The method includes accessing a schema (103) of the data structure (101) and obtaining information relating to the one or more elements (110). The path expression (104) is modified to specify an index in one or more of the path steps to limit the number of occurrences of an element located in a path step. In one embodiment, modifying the path expression (104) also expands any wildcard characters and specifies one or more full paths of the elements (110), wherein if there are two or more full paths they are combined by a union operator, and the modified path expression is used to query (111) the data structure (101) at runtime.

Abstract: A message brokering system includes a file input node configured to receive a file and divide the received file into a plurality of file portions for processing in the message brokering system, a plurality of transformation nodes configured to transform the plurality of file portions independently and in parallel, and a collector node configured to collect the plurality of transformed file portions and combine the plurality of transformed file portions into a single combined file based on header information associated with each of the plurality of file portions. The file input node is configured to divide the received file based on at least one user-configurable attribute, and the file input node is configure to associate the header information with the received file or each file portion of the plurality of file portions.

Abstract: A method and system are provided for navigation of a data structure. The method includes receiving an input path expression (104) for a query of a data structure (101) to locate one or more elements (110) in the data structure (101) at runtime. The input path expression (104) includes one or more path steps. The method includes accessing a schema (103) of the data structure (101) and obtaining information relating to the one or more elements (110). The path expression (104) is modified to specify an index in one or more of the path steps to limit the number of occurrences of an element located in a path step. In one embodiment, modifying the path expression (104) also expands any wildcard characters and specifies one or more full paths of the elements (110), wherein if there are two or more full paths they are combined by a union operator, and the modified path expression is used to query (111) the data structure (101) at runtime.

Abstract: The present invention provides a method and apparatus or system for determining an amount of coal tar that can enter, and subsequently be displaced from, a given type of soil for a range of depths of the soil. The method and apparatus also provide verification of the pressure at which coal tar can be displaced from a given type of soil. In particular, the method and apparatus simulate the hydrostatic pressure that a soil sample encounters in the subsurface of the ground. Accordingly, the method and apparatus provide a relationship between the concentration of coal tar in the soil and the pressure required to displace the coal tar from the soil, which allows for an estimation of the amount of coal tar that may be displaced at a particular location or site. Further, the method and apparatus are adaptable for use in the laboratory or the field.