Axioms for generalized graphs, illustrated by a Cantor–Bernstein proposition

The notion of a graph type is introduced by a collection of axioms. A graph of type (or -graph) is defined as a set of edges, of which the structure is specified by . From this, general notions of subgraph and isomorphism of -graphs are derived. A Cantor-Bernstein (CB) result for -graphs is presented as an illustration of a general proof for different types of graphs. By definition, a relation on -graphs satisfies the CB property if and imply that A and B are isomorphic. In general, the relation ‘isomorphic to a subgraph’ does not satisfy the CB property. However, requiring the subgraph to be disconnected from the remainder of the graph, a relation that satisfies the CB property is obtained. A similar result is shown for -graphs with multiple edges. Received: 25 October 1996 / 5 February 1998     

Simple multi-visit attribute grammars

An attribute grammar is simple multi-visit if each attribute of a nonterminal has a fixed visit-number associated with it such that, during attribute evaluation, the attributes of a node which have visit-number j are computed at the jth visit to the node. An attribute grammar is l-ordered if for each nonterminal a linear order of its attributes exists such that the attributes of a node can always be evaluated in that order (cf. the work of Kastens).An attribute grammar is simple multi-visit if and only if it is l-ordered. Every noncircular attribute grammar can be transformed into an equivalent simple multi-visit attribute grammar which uses the same semantic operations.For a given distribution of visit-numbers over the attributes, it can be decided in polynomial time whether the attributes can be evaluated according to these visit-numbers. The problem whether an attribute grammar is simple multi-visit is NP-complete.     

A comparison of pebble tree transducers with macro tree transducers

The n-pebble tree transducer was recently proposed as a model for XML query languages. The four main results on deterministic transducers are: First, (1) the translation of an n-pebble tree transducer can be realized by a composition of n+1 0-pebble tree transducers. Next, the pebble tree transducer is compared with the macro tree transducer, a well-known model for syntax-directed semantics, with decidable type checking. The -pebble tree transducer can be simulated by the macro tree transducer, which, by the first result, implies that (2) can be realized by an (n+1)-fold composition of macro tree transducers. Conversely, every macro tree transducer can be simulated by a composition of 0-pebble tree transducers. Together these simulations prove that (3) the composition closure of n-pebble tree transducers equals that of macro tree transducers (and that of 0-pebble tree transducers). Similar results hold in the nondeterministic case. Finally, (4) the output languages of deterministic n-pebble tree transducers form a hierarchy with respect to the number n of pebbles.This revised version was published online in September 2003 with corrections to type sizes.Received: 16 January 2003, Sebastian Maneth: Present address: Swiss Institute of Technology Lausanne, Programming Methods Laboratory (LAMP), 1015 Lausanne, Switzerland, e-mail (sebastian.maneth@epfl.ch)     

High density hydrophilic and hydrophobic brush coatings using a polymeric primer layer

Polymer brush coatings, consisting of polymer chains covalently attached to a surface and being less than a hundred nanometer thick, allow the creation of functional surfaces without altering the inherent bulk properties or appearance of a product. Surface properties depend on the type and length of the polymer used, as well as on the grafting density of the polymer brush. By making use of a polymeric primer layer that is covalently linked to the substrate and creates a uniform and highly functionalized surface, polymer brush coatings with high grafting densities can be created. In this paper we report the preparation of hydrophilic as well as hydrophobic brush coatings on different substrates through the use of a poly(acrylic acid) primer layer. In addition, hydrophilic poly(ethylene glycol) brush coatings thus produced were shown to decrease adhesion of marine bacteria.     

Pragmatic software tools for water reuse evaluation in a factory

The optimal use of process water becomes increasingly important since natural water resources are heavily solicited by a growing economy. Two steps can be considered in the process water optimization. A first step is the inventory of the different process streams in the process water network. Pure mathematical modeling of a dynamic water network is extremely complicated and expensive. As an approximation, the use of a steady-state network node model within commercial software is accepted to set up a water balance. Sophisticated software tools are available but common solver software may offer an alternative. A second step is the water “pinch” which searches for an optimal use of process water by combining sources and sinks, taking into account contaminant concentrations of process streams. Sophisticated pinch software can be applied but it is also possible to implement a simplified combinatory approach. Such approach can be pragmatically programmed in e.g., Visual Basic. Such tool allows for a first evaluation of the complex combinatory sources–sinks problem, enabling a low cost and easy-to-handle first interpretation of possible water-reuse opportunities. This could stimulate a further enhanced analysis with more advanced software tools and therefore promote a sustainable use of process water in the industrialized world.     

Parameter identification and modeling of the biochemical methane potential of waste activated sludge

Anaerobic digestion is widely used in waste activated sludge treatment. In this paper, partial least-squares (PLS) is employed to identify the parameters that are determining the biochemical methane potential (BMP) of waste activated sludge. Moreover, a model is developed for the prediction of the BMP. A strong positive correlation is observed between the BMP and volatile fatty acids and carbohydrate concentrations in the sludge. A somewhat weaker correlation with COD is also present. Soluble organics (sCOD, soluble carbohydrates and soluble proteins) were shown not to influence the BMP in the observed region. This finding could be most-valuable in the context of application of sludge pretreatment methods. The obtained model was able to satisfactory predict the BMP.     

The impact of social comparison information on motivation in patients with diabetes as a function of regulatory focus and self-efficacy.

Objective: Our aim was to determine whether the impact of upward and downward social comparison information on individuals' motivation to manage their diabetes is dependent on their regulatory focus (promotion or prevention focus) and self-efficacy. Design: The hypotheses were examined in a cross-sectional study. Patients with diabetes (N = 234) read a fictitious interview with a fellow patient, either an upward or a downward target, and they filled out questionnaires. Main Outcome Measures: Motivation to work on diabetes regulation. Results: High promotion-focused patients reported more motivation than low promotion-focused patients when confronted with the upward target (positive role model). High prevention-focused patients reported more motivation than low prevention-focused patients when confronted with the downward target (negative role model). This latter finding was qualified by patients' self-efficacy, as it applied only to patients with relatively high levels of self-efficacy. Conclusion: The current study highlights the importance of considering individual differences when using role models to encourage self-care activities in persons with diabetes. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Strongly Typed Rewriting For Coupled Software Transformation

Coupled transformations occur in software evolution when multiple artifacts must be modified in such a way that they remain consistent with each other. An important example involves the coupled transformation of a data type, its instances, and the programs that consume or produce it. Previously, we have provided a formal treatment of transformation of the first two: data types and instances. The treatment involved the construction of type-safe, type-changing strategic rewrite systems. In this paper, we extend our treatment to the transformation of corresponding data processing programs.The key insight underlying the extension is that both data migration functions and data processors can be represented type-safely by a generalized abstract data type (GADT). These representations are then subjected to program calculation rules, harnessed in type-safe, type-preserving strategic rewrite systems. For ease of calculation, we use point-free representations and corresponding calculation rules.Thus, coupled transformations are carried out in two steps. First, a type-changing rewrite system is applied to a source type to obtain a target type together with (representations of) migration functions between source and target. Then, a type-preserving rewrite system is applied to the composition of a migration function and a data processor on the source (or target) type to obtain a data processor on the target (or source) type. All rewrites are type-safe.