Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Hashing

Over and beyond the representations of chemical structures presented so far, there are others for specific applications. Some of the representations discussed in this section, e.g., fragment coding or hash coding, can also be seen as structure descriptors, but this is a more philosophical question. Structure descriptors are introduced in Chapter 8. [Pg.70]

Hash coding is an established method in computer science, e.g., in registration procedures [94, 95. In chemoinformatics the structure input occurs as a sequence of characters (names) or numbers (which may also be obtained, e.g., from a connection table (see Section 2.4) by conversion of a structure drawing). Both names and numbers may be quite large and may not be usable as an address... [Pg.72]

Figure 2-65. This fingerprint was received by hashing, whereas only one part of all the substructures is specified in the illustration. The asterisk indicates the address of a collision in the bit string, generated by the algorithm. Figure 2-65. This fingerprint was received by hashing, whereas only one part of all the substructures is specified in the illustration. The asterisk indicates the address of a collision in the bit string, generated by the algorithm.
The ciphered code is indicated with a defined length, i.e., a fixed hit/byte length. A hash code of 32 bits could have 2 (or 4 294 976 296) possible values, whereas one of 64 bits could have 2 values, However, due to tbe fixed length, several diverse data entries could assign the same hash code ( address collision ), The probability of collision rises if the number of input data is increased in relation to the range of values (bit length). In fact, the limits of hash coding are reached with about 10 000 compounds with 32 bits and over 100 million with 64 bits, to avoid collisions in databases [97. ... [Pg.73]

Thus the hash code is not used as a direct way to access data rather it serves as an index or key to the filed data entry (Figure 2-66). Since hash coding receives unique codes by reducing multidimensional data to only one dimension, information gets lo.st. Thi.s los.s prevents a recon.struction of the complete data from the hash code. [Pg.74]

The hash code has specific characteristics and provides numerous possibilities for use ... [Pg.75]

Hash codes of molecules which are already pre-computed are suitable for use in fiill structure searches in database applications. The compression of the code of a chemical structure into only one number also makes it possible to compute in advance the transformation results for a whole catalog. The files can be stored and kept complete in the core memory during execution of the program, so that a search can be accomplished within seconds. [Pg.75]

Atomic and bond hash codes are helpful in structure manipulation programs, e.g., in reaction prediction or in synthesis design [99]. [Pg.75]

The stereochemistry is usually expressed in structure diagrams by wedged and hashed bonds. A wedge indicates that the substituent is in ont of a reference plane and a hashed bond indicates that the substituent is pointing away om the viewer (behind the reference plane). This projection is applied both to tetrahe-... [Pg.75]

A molecule editor can draw a chemical structure and save it, for example as a Molfile. Although it is possible to include stereochemical properties in the drawing as wedges and hashed bonds, or even to assign a stereocenter/stereogroup with its identifiers R/S or E/Z), the connection table of the Molfile only represents the constitution (topology) of the molecule. [Pg.82]

The problem of perception complete structures is related to the problem of their representation, for which the basic requirements are to represent as much as possible the functionality of the structure, to be unique, and to allow the restoration of the structure. Various approaches have been devised to this end. They comprise the use of molecular formulas, molecular weights, trade and/or trivial names, various line notations, registry numbers, constitutional diagrams 2D representations), atom coordinates (2D or 3D representations), topological indices, hash codes, and others (see Chapter 2). [Pg.292]

Hashed fingerprints, structural keys 2D structure See Section 12.2... [Pg.685]

S. D. Broadhurst and L. J. Hash, The Scrap Mica Resources of North Carolina Bulletin No. 66, North Carolina Department of Conservation and Development, 1953, p. 6. [Pg.294]

C. M. Butt and C. Hash, Proceedings of the 3rd International Drip Trickle Irrigation Congress, N ov. 1985, ASAE, St. Joseph, Mich., 1985. [Pg.159]

The Hash thermolysis of the dioxolene (124) gave diphenylketene among the products (Scheme 107) (70CC206), and it is conceivable that diphenyloxirene is the precursor of this product. [Pg.128]

Fire Hazards - Hash PoirU (deg. F) 60 OC 55 CC Flammable Limits in Air (%) 6.2 - 15.6 Fire Extinguishing Agents Foam, carbon dioxide, dry chemical Fire Extinguishing AgetUs Not To Be Used Water may be ineffective Special Hazards of Combustion Products Toxic and irritating gases... [Pg.167]

The heat transfer section of a plant was filled with oil after maintenance by opening a vent at the highest point and pumping oil into the system until it overflowed out of the vent. The overflow should have been collected in a bucket, but sometimes a bucket was not used, or the bucket was overfilled. Nobody worried about small spillages because the Hash point of the oil was above ambient temperature and its boiling point and auto-ignition temperature were both above 300°C. [Pg.257]

Hash-fire modeling is largely underdeveloped in the literature there are large gaps in the information base. Hardly any information is available concerning flash-fire radiation the only data available have resulted from experiments conducted to meet other objectives. Many items have not yet received sufficient attention. [Pg.154]

Clearly, from Table 9.12, the more dangerous case not involving hashing liquid is the 10% filled vessel. [Pg.334]


See other pages where Hashing is mentioned: [Pg.72]    [Pg.72]    [Pg.72]    [Pg.73]    [Pg.73]    [Pg.74]    [Pg.74]    [Pg.129]    [Pg.138]    [Pg.191]    [Pg.295]    [Pg.661]    [Pg.661]    [Pg.662]    [Pg.692]    [Pg.694]    [Pg.701]    [Pg.91]    [Pg.27]    [Pg.547]    [Pg.134]    [Pg.6]    [Pg.113]    [Pg.149]    [Pg.143]   
See also in sourсe #XX -- [ Pg.72 ]

See also in sourсe #XX -- [ Pg.191 ]

See also in sourсe #XX -- [ Pg.79 ]

See also in sourсe #XX -- [ Pg.7 , Pg.78 , Pg.79 ]

See also in sourсe #XX -- [ Pg.66 ]

See also in sourсe #XX -- [ Pg.9 ]

See also in sourсe #XX -- [ Pg.9 ]

See also in sourсe #XX -- [ Pg.365 ]

See also in sourсe #XX -- [ Pg.4 , Pg.2769 ]




SEARCH



Collision fixed-size hash functions

Collision hash functions

Cryptographic hash function

Fingerprint hash function

Fingerprint hashed

Fischer projections hashed-wedged line structures

Fixed-size hash function

Geometric hashing

Hash calculation

Hash code

Hash coding algorithm

Hash collision

Hash data type

Hash function

Hash function algorithms

Hash ignition

Hash oil

Hash point

Hash ring

Hash table

Hash vacuum photolysis

Hash vacuum pyrolysis

Hash vacuum thermolysis

Hash-coding

Hashed bonds

Hashed methods

Hashed wedge

Hashed wedge stereochemical

Hashed-wedged line notation

Hashed-wedged line structures

Hashes

Hashing Data

Hashing function

Hashing key

Hashing methods

Hashing scheme

Message hashing

Molecular hash codes

Molecular hash key

Update and retrieval in direct access files using hash algorithm

Wedge/hash bonds

© 2024 chempedia.info