Big Chemical Encyclopedia

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

Articles Figures Tables About

Some Simple Networks

Planar motifs of irregular shape can be used in infinite numbers to construct planar patterns completely covering the whole available surface. [Pg.367]

Canadian crystallographer Frangois Brisse has designed a series of two-dimensional space-group drawings related to Canada [8-23]. The series was [Pg.367]

MacGillavry s book [8-22]. Reproduced with permission from the International Union of Crystallography, (b) The unit cell consisting of a fish and a boat. [Pg.369]

A comprehensive and in-depth treatise of tilings and patterns has been published by Griinbaum and Shephard [8-28]. [Pg.371]


Table 3. Truth Tables for Some Simple Networks"... Table 3. Truth Tables for Some Simple Networks"...
Values of tear energy obtained in this way for some simple mbbery solids are discussed in Section 1.4.4, and compared with theoretical estimates for a network of long dexible molecules with C-C... [Pg.11]

ANNs are built by linking together a number of discrete nodes (Figure 2.5). Each node receives and integrates one or more input signals, performs some simple computations on the sum using an activation function, then outputs the result of its work. Some nodes take their input directly from the outside world others may have access only to data generated internally within the network, so each node works only on its local data. This parallels the operation of the brain, in which some neurons may receive sensory data directly from nerves, while others, deeper within the brain, receive data only from other neurons. [Pg.14]

In general, it appears that the fraction of configurations in the various topological classes can be determined for models in which one of the elements is a fixed curve and the other is a random coil. The detailed calculations are intricate and difficult, however, and some simple generalizations are needed which could be used as a step towards building classification effects into the network theories. Classification for the case of two random coils and for self-entanglement are unsolved problems at the present time. [Pg.122]

With particularly simple networks, some rearrangement of equations sometimes can be made to simplify the solution. Example 6.7 is of such a case. [Pg.100]

Figure 9.1 Schematic representation of some of the simple network architectures structurally characterised for metal-organic polymers (a) 2D honeycomb, (b) ID ladder, (c) 3D octahedral, (d) 3D hexagonal diamondoid, (e) 2D square grid, and (f) ID zigzag chain (reprinted from Section Key Reference The American Chemical Society). Figure 9.1 Schematic representation of some of the simple network architectures structurally characterised for metal-organic polymers (a) 2D honeycomb, (b) ID ladder, (c) 3D octahedral, (d) 3D hexagonal diamondoid, (e) 2D square grid, and (f) ID zigzag chain (reprinted from Section Key Reference The American Chemical Society).
Many reactions in industrial practice have non-simple networks. Their variety is so great that standard recipes for elucidation cannot be stated What works in one case will not in another. Only some strategies that might be useful can be suggested. Some of the more common ones will be shown in this section and be illustrated with examples. [Pg.179]

Although the TAP reactor equations can be solved analytically for some simple systems, more complicated reation networks require numerical solutions. Cleaves et al (35) show that useful relations can be found between quantities such as conversion and residence time and the moments of the response of the TAP reactor, analytically obtained from the solutions of the linear system described previously. [Pg.344]

In this section we discuss some simple properties of reaction networks and give a few examples to show the consequences of various postulated network features. Section 2.6 and Chapters 6 and 7 will introduce the more difficult problem of reasoning from observations to realistic reaction models. [Pg.15]

In this section some general considerations of interest regarding non-Gaussian statistical theory are made with the aim of bringing the simple network model discussed in Section 3,2 closer to a real network (2,4). [Pg.106]

In both the affine and phantom network models, chains are only aware that they are strands of a network because their ends are constrained by crosslinks. Strand ends are either fixed in space, as in the affine network model, or allowed to fluctuate by a certain amplitude around some fixed position in space, as in the phantom network model. Monomers other than chain ends do not feel any constraining potential in these simple network models. [Pg.265]

Even though Eq. (5) is more realistic than Eq. (3) as a model for biological systems, this equation still is highly oversimplified. Yet this equation has remarkable mathematical properties that facilitate theoretical analysis. Moreover, there is an expectation, demonstrated in some simple examples like those discussed above, that the qualitative dynamics in the model system wiU be preserved in more realistic versions, for example when the discontinuous step functions are replaced by continuous sigmoidal functions [33, 34, 37]. As mentioned above, synthetic gene networks have been created that show some of the simple types of dynamical behavior found in our class of networks—in particular, bistability (two fixed points) [26] and oscillation in an inhibitory loop [27]. [Pg.158]

Water.—An accurate, scale, two-dimensional model of the structure of liquid water at 20°C and 1 atm has been constructed. The model shows that (i) the distinction between mixture and continuum modes may be meaningless, (ii) clusters largely impinge upon other clusters and do not swim in monomeric water, and (iii) by minor alterations in the hydrogen bonding, the cluster model may readily be transformed into a broken down ice-type structure or a more attenuated random network. A new model for liquid water has been developed on the basis of the intermolecular potential function proposed by Ben Naim and Stillinger and some simple and clearly... [Pg.568]

In some simple cases of an amorphous elastomeric network adhered to a hard substrate, it has been found (62,106,107) that the fracture energy obeys the following equation ... [Pg.334]


See other pages where Some Simple Networks is mentioned: [Pg.22]    [Pg.367]    [Pg.22]    [Pg.367]    [Pg.650]    [Pg.205]    [Pg.730]    [Pg.248]    [Pg.145]    [Pg.48]    [Pg.93]    [Pg.212]    [Pg.79]    [Pg.567]    [Pg.31]    [Pg.48]    [Pg.281]    [Pg.89]    [Pg.131]    [Pg.85]    [Pg.51]    [Pg.107]    [Pg.247]    [Pg.67]    [Pg.1634]    [Pg.131]    [Pg.99]    [Pg.146]    [Pg.89]    [Pg.88]    [Pg.497]   


SEARCH



© 2024 chempedia.info