Abstract: a method for distributed edge computing (DEC) includes obtaining a request from a computational resource provider (CRP) offering computational resources of the CRP; validating the computation resources of the CRP; offering the computation resources of the CRP to a computational resource consumer (CRC); obtaining a reservation request from the CRC for a portion of the computation resources of the CRP; and installing CRC software on the CRP for DEC, where the CRP is configured to receive produced data related to the CRC software from a first localized device, the computational resources process the produced data, and forward processed data to a second localized device that has requested the processed data.

Abstract: a method for distributed edge computing (DEC) includes obtaining a request from a computational resource provider (CRP) offering computational resources of the CRP; validating the computation resources of the CRP; offering the computation resources of the CRP to a computational resource consumer (CRC); obtaining a reservation request from the CRC for a portion of the computation resources of the CRP; and installing CRC software on the CRP for DEC, where the CRP is configured to receive produced data related to the CRC software from a first localized device, the computational resources process the produced data, and forward processed data to a second localized device that has requested the processed data.

Abstract: A method for characterising the structure or sub-structure of a glycan or glycan derivative, experimentally derives the mass of an unidentified glycan molecule and compares the mass of the unidentified glycan molecule with identified and characterised glycan structures to select candidate structures for the glycan molecule. Next the mass of fragments of the glycan molecule is experimentally derived and theoretical fragmentation of the selected candidates is conducted. The mass of the fragments of the unidentified glycan molecule is matched with the mass of fragments theoretically derived from the candidate structures. Next scoring occurs to produce ranked confidence scores for each of the candidate structures by comparing the masses of the experimentally derived fragments with the masses of the theoretically derived fragments. Two scoring methods are disclosed namely segmentation and correspondence scoring.

Abstract: This invention concerns 2 Dimensional structure queries. Each structure comprises an array of nodes connected together by linkages to form one or more branches, or children, extending from a root, or reducing terminus. Each structure is represented using a sequence code generated to represent all the paths through the structure starring from the distal end, or leaf, of each branch and extending back to the root. The sequence code is governed by rules which guarantee there is a single unique representation for any structure. In particular one aspect of the invention concerns a database of 2 Dimensional structures, such as carbohydrate molecular structures. In another aspect the invention concerns a process for constructing such a database. Perhaps most importantly, in a further aspect the invention concerns a process for searching such a database to find all the structures that contain a given substructure within them.