Abstract: A mobile device scans a machine-readable code on a collection container; a Web page is downloaded to the device from a Web application which generates or retrieves a unique identifier for the device. The device then scans a can and the can's unique identifier is transmitted to the Web application to determine if the can had been scanned. If not, the device is alerted and a credit for the device's unique identifier is updated in a database. Or, the device scans a card to obtain a user unique identifier and then scans the can. The device scans a machine-readable code of the collection container to obtain a unique identifier for that collection container. Or, a user scans the card using an embedded scanning device of a collection container before scanning a can. The embedded device includes the unique identifier of the collection container which is sent to the Web application.

Abstract: The present invention relates to a multi-aziridine crosslinker composition, characterized in that the multi-aziridine crosslinker composition is an aqueous dispersion having a pH ranging from 8 to 14 and comprises a multi-aziridine compound in dispersed form, wherein said multi-aziridine compound has: a. from 2 to 6 of the following structural units A: whereby R1 is H, R2 and R4 are independently chosen from H or an aliphatic hydrocarbon group containing from 1 to 4 carbon atoms, R a is an aliphatic hydrocarbon group containing from 1 to 4 carbon atoms, m is 1, b. one or more linking chains wherein each one of these linking chains links two of the structural units A; and c. a molecular weight in the range from 500 to 10000 Daltons wherein the molecular weight is determined using MALDI-TOF mass spectrometry according to the description.

Abstract: The present invention relates to a multi-aziridine compound having: ?a) from 2 to 6 of the following structural units (A): whereby R1 is H, R2 and R4 are independently chosen from H or an aliphatic hydrocarbon group containing from 1-4 carbon atoms, R3 is an aliphatic hydrocarbon group containing from 1-4 carbon atoms, R??H or an aliphatic hydrocarbon group containing from 1 to 4 carbon atoms; R? and R?? are independently chosen from an aliphatic hydrocarbon group containing from 1 to 4 carbon atoms, a cycloaliphatic hydrocarbon group containing from 4 to 12 carbon atoms or an aromatic hydrocarbon group containing from 6 to 12 carbon atoms, b) one or more linking chains wherein each one of these linking chains links two of the structural units A; and c) a molecular weight in the range from 600 Daltons to 5000 Daltons.

Abstract: The present invention relates to a multi-aziridine compound having: a) from 2 to 6 of the following structural units (A): whereby R?, R? are as defined herein m is an integer from 1 to 6; b) one or more linking chains wherein each one of these linking chains links two of the structural units A; and c) a molecular weight in the range from 840 Daltons to 5000 Daltons. The multi-aziridine compound can be used for example for crosslinking of for example carboxylic acid functional polymers dissolved and/or dispersed in an aqueous medium.

Abstract: The present invention relates to a multi-aziridine crosslinker composition, characterized in that the composition is an aqueous dispersion having a pH ranging from 9 to 14 and comprising a multi-aziridine compound in dispersed form, wherein said multi-aziridine compound has: a. from 2 to 6 of the following structural units A: (A) whereby R1, R2, R3 and R4 are H; m is 1, R? and R? are according to (1) or (2): (2) R??H or an aliphatic hydrocarbon group containing from 1 to 14 carbon atoms, and R?=an alkyl group containing from 1 to 4 carbon atoms, CH2-O—(C?O)—R?? or CH2-O—R??, whereby R?? is an alkyl group containing from 4 to 12 carbon atoms and R?? is an alkyl group containing from 1 to 14 carbon atoms, (2) R? and R? form together a saturated cycloaliphatic hydrocarbon group containing from 5 to 8 carbon atoms; b. one or more linking chains wherein each one of these linking chains links two of the structural units A; and c. a molecular weight in the range from 600 to 10000 Daltons.

Abstract: A unique bag identifier is generated for digital objects to be stored in object storage. A unique download identifier is generated for downloading of these objects and a unique upload identifier is generated for uploading of the objects; all three identifiers are associated in a database. The identifiers are distributed verbally, by electronic mail, by text message, etc. Any holder of these identifiers may access the digital objects without a user account and without installing an application on a computing device other than using a browser. A QR code or alphanumeric code is displayed on a computing device in order to allow another device to access the objects. Objects may be uploaded via electronic mail. Uploading or downloading is protected by an owner-generated password. Digital objects are sealed by calculating their hashes, placing these hashes in a file and calculating a hash for that file. This file hash is submitted to a block chain and a transaction identifier is returned.

Abstract: A server executes in a virtual machine and facilitates execution of lightweight plug-in functions that respond to user interface commands from a client device. The functions augment the commands with additional processing even though they may not implement a user interface, they generate data in real time, they access any data repository or data source, can be written in any programming language, and they perceive that they have infinite storage. The client device need not have custom software and implements a traditional file-folder user interface using standard applications. Folders and file contents displayed on the client device need not exist until specifically requested by the user. Plug-in functions have their own root file system but may share a network namespace. Data may be input to a function using a folder name or a micro Web server. Two functions share a database connection to a remote computer.

Abstract: A unique bag identifier is generated for digital objects to be stored in object storage. A unique download identifier is generated for downloading of these objects and a unique upload identifier is generated for uploading of the objects; all three identifiers are associated in a database. The identifiers are distributed verbally, by electronic mail, by text message, etc. Any holder of these identifiers may access the digital objects without a user account and without installing an application on a computing device other than using a browser. A QR code or alphanumeric code is displayed on a computing device in order to allow another device to access the objects. Objects may be uploaded via electronic mail. Uploading or downloading is protected by an owner-generated password. Digital objects are sealed by calculating their hashes, placing these hashes in a file and calculating a hash for that file. This file hash is submitted to a block chain and a transaction identifier is returned.

Abstract: A server executes in a virtual machine and facilitates execution of lightweight plug-in functions that respond to user interface commands from a client device. The functions augment the commands with additional processing even though they may not implement a user interface, they generate data in real time, they access any data repository or data source, can be written in any programming language, and they perceive that they have infinite storage. The client device need not have custom software and implements a traditional file-folder user interface using standard applications. Folders and file contents displayed on the client device need not exist until specifically requested by the user. Plug-in functions have their own root file system but may share a network namespace. Data may be input to a function using a folder name or a micro Web server. Two functions share a database connection to a remote computer.

Abstract: A environment and method are provided for increasing the storage capacity of a data storage environment. Additional storage clusters may be added to the storage environment without affecting the performance of each individual storage cluster. When data is written to the storage environment, a selection may be made as to which storage cluster is to store the data. When data is read from the storage environment, it may be determined which storage cluster stores the data and the data may be retrieved from that storage cluster.

Abstract: One embodiment is a system for locating content on a storage system, in which the storage system provides a location hint to the host of where the data is physically stored, which the host can resubmit with future access requests. In another embodiment, an index that maps content addresses to physical storage locations is cached on the storage system. In yet another embodiment, intrinsic locations are used to select a storage location for newly written data based on an address of the data. In a further embodiment, units of data that are stored at approximately the same time having location index entries that are proximate in the index.

Abstract: One embodiment is a system for locating content on a storage system, in which the storage system provides a location hint to the host of where the data is physically stored, which the host can resubmit with future access requests. In another embodiment, an index that maps content addresses to physical storage locations is cached on the storage system. In yet another embodiment, intrinsic locations are used to select a storage location for newly written data based on an address of the data. In a further embodiment, units of data that are stored at approximately the same time having location index entries that are proximate in the index.

Abstract: Access to content addressable data on a network is facilitated using digital information storing devices or data repositories (“silos”) that monitor broadcast data requests over the network. A number of silos automatically monitor both data requests and data itself that are broadcast over a network. The silos selectively store data. Each silo responds to data requests broadcast over the network with data the silo has previously intercepted. A content addressable file scheme is used to enable the data repositories to reliably identify data being requested. When a data request is received, each silo evaluates whether it has all or a portion of the data being requested and responds to requests when it has the data. Requests for data are implemented by broadcasting a cryptographic hash data identifier of the data file needed. The data identifier is used by a silo to determine which data to receive and store.

Abstract: Representing a number of assets on an originating computer begins with selecting the assets to be represented. Cryptographic hash asset identifiers are generated; each of the asset identifiers is computed using the contents of a particular asset. The asset identifier is a content-based or content-addressable asset name for the asset and is location independent. An asset list is generated that includes the asset identifiers computed from the assets. A cryptographic hash asset list identifier is generated that is computed from the asset list. The asset list identifier is stored for later retrieval. The assets selected are also stored for safekeeping either locally or on a computer network. In the event of loss of the files from the originating computer, the asset list identifier is retrieved. Using the asset list identifier, the original asset list is found and retrieved from its safe location.

Abstract: Representing a number of assets on an originating computer begins with selecting the assets to be represented. Cryptographic hash asset identifiers are generated; each of the asset identifiers is computed using the contents of a particular asset. The asset identifier is a content-based or content-addressable asset name for the asset and is location independent. An asset list is generated that includes the asset identifiers computed from the assets. A cryptographic hash asset list identifier is generated that is computed from the asset list. The asset list identifier is stored for later retrieval. The assets selected are also stored for safekeeping either locally or on a computer network. In the event of loss of the files from the originating computer, the asset list identifier is retrieved. Using the asset list identifier, the original asset list is found and retrieved from its safe location.

Abstract: Access to content addressable data on a network is facilitated using digital information storing devices or data repositories (“silos”) that monitor broadcast data requests over the network. A number of silos automatically monitor both data requests and data itself that are broadcast over a network. The silos selectively store data. Each silo responds to data requests broadcast over the network with data the silo has previously intercepted. A content addressable file scheme is used to enable the data repositories to reliably identify data being requested. When a data request is received, each silo evaluates whether it has all or a portion of the data being requested and responds to requests when it has the data. Requests for data are implemented by broadcasting a cryptographic hash data identifier of the data file needed. The data identifier is used by a silo to determine which data to receive and store.

Abstract: Access to content addressable data on a network is facilitated using digital information storing devices or data repositories (“silos”) that monitor broadcast data requests over the network. A number of silos automatically monitor both data requests and data itself that are broadcast over a network. The silos selectively store data. Each silo responds to data requests broadcast over the network with data the silo has previously intercepted. A content addressable file scheme is used to enable the data repositories to reliably identify data being requested. When a data request is received, each silo evaluates whether it has all or a portion of the data being requested and responds to requests when it has the data. Requests for data are implemented by broadcasting a cryptographic hash data identifier of the data file needed. The data identifier is used by a silo to determine which data to receive and store.

Abstract: Access to content addressable data on a network is facilitated using digital information storing devices or data repositories (“silos”) that monitor broadcast data requests over the network. A number of silos automatically monitor both data requests and data itself that are broadcast over a network. The silos selectively store data. Each silo responds to data requests broadcast over the network with data the silo has previously intercepted. A content addressable file scheme is used to enable the data repositories to reliably identify data being requested. When a data request is received, each silo evaluates whether it has all or a portion of the data being requested and responds to requests when it has the data. Requests for data are implemented by broadcasting a cryptographic hash data identifier of the data file needed. The data identifier is used by a silo to determine which data to receive and store.

Abstract: Representing a number of assets on an originating computer begins with selecting the assets to be represented. Cryptographic hash asset identifiers are generated; each of the asset identifiers is computed using the contents of a particular asset. The asset identifier is a content-based or content-addressable asset name for the asset and is location independent. An asset list is generated that includes the asset identifiers computed from the assets. A cryptographic hash asset list identifier is generated that is computed from the asset list. The asset list identifier is stored for later retrieval. The assets selected are also stored for safekeeping either locally or on a computer network. In the event of loss of the files from the originating computer, the asset list identifier is retrieved. Using the asset list identifier, the original asset list is found and retrieved from its safe location.

Abstract: An algorithm (such as the MD5 hash function) is applied to a file to produce an intrinsic unique identifier (IUI) for the file (or message digest). The file is encrypted using its IUI as the key for the encryption algorithm. An algorithm is then applied to the encrypted file to produce an IUI for the encrypted file. The encrypted file is safely stored or transferred within a network and is uniquely identifiable by its IUI. The encrypted file is decrypted using the IUI of the plaintext file as the key. The IUI serves as both a key to decrypt the file and also as verification that the integrity of the plaintext file has not been compromised. IUIs for any number of such encrypted files may be assembled into a descriptor file that includes meta data for each file, the IUI of the plaintext file and the IUI of the encrypted file. An algorithm is applied to the descriptor file to produce an IUI for the descriptor file.