Abstract: System and method for managing the configuration of resources in an enterprise. Embodiments of the present invention gather, store, and maintain institutional knowledge of configurations of IT resources of an enterprise. A configuration database serves as a temporal record of the configurations of the resources. The configuration database can reflect a dimensional model of the enterprise configuration where various configuration items are linked together. A configuration change can be analyzed and approved, and then reflected in a change to a configuration item (CI) which imposes an appropriate change to other configuration items based on upstream, downstream, peer relationships and/or views. A system according to an embodiment of the invention can also include a change database, an inventory database, a problem database, and/or a service level management subsystem to ensure changes to an enterprise's configuration are consistent with service level agreements and/or operating level agreements.

Abstract: Inherently tacky, elastomeric, solvent-dispersible, solvent-insoluble, polymeric microspheres prepared using a cationic emulsifier. The tacky microspheres are particularly adapted for use as a low tack microsphere glue that can be applied to a sheet material substrate whereby the latter is provided with a reusable adhesive surface.

Abstract: Inherently tacky, elastomeric, solvent-dispersible, solvent-insoluble, polymeric microspheres prepared using a non-ionic emulsifier. The tacky microspheres are particularly adapted for use as a low tack microsphere glue that can be applied to a sheet material substrate whereby the latter is provided with a reusable adhesive surface.

Abstract: a plurality of binary logic trees converts a pattern to a signature word. Each logic has addressable test-node words with branch, status and pattern-bit address fields. The status field has flags for indicating a desired value of a pattern bit and for identifying leaf-node logic words for setting the signature bits. The logics are interrelated to each other by a set of reference words having a substantially constant intrapair Hamming distance. The signature is converted to one or more identifying codes by generating one of the reference words from the signature and comparing it with the signature. If one code is used, the comparison gives the correct code for the pattern. For plural codes, the codes are checked for consistency with each other and are used to complete a correct identifying code. Computer-program implementations are described for accomplishing all the above functions.