Production and Emulsifying Effect of Polyglycerol and Fatty Acid Esters with Varying Degrees of Esterification

Esters with acyl groups can be formed by the esterification of polyglycerol. The purpose of the present study was to produce fatty acid esters [hexanoic (caproic), octanoic (caprylic), decanoic (capric), dodecanoic (lauric), tetradecanoic (myristic), hexadecanoic (palmitic), octadecanoic (stearic)] and polyglycerol (average number‐of degrees of polymerization of 5) with varying degrees of esterification and to examine their emulsifying properties. A number of fundamental catalysts of polyglycerol acylation reactions by methyl esters of carboxylic acid were studied, and sodium methoxide was found to be the best choice. The temperature rate of transesterification increased from 180 to 220 °C with the fatty acid chain alkyl residue. Synthesized mono‐, di‐, tri‐, tetra‐, and heptaesters of various fatty acids and polyglycerol provided the highest hydroxyl values from 15 to 815 mg KOH g^?1 and saponification values from 82 to 321 mg KOH g^?1. The emulsifying properties were assessed for all polyglycerol and fatty acid esters, with results showing maximum emulsifying effect for tri‐ and tetraesters of capric, lauric, and caprylic acids. Regardless of the hydrophilic–lipophilic balance value (HLB) of polyglycerol esters and carboxylic acid, a 4:1 ratio of sunflower oil to water formed a water‐in‐oil type emulsion. When mixing oil and water in a 1:1 ratio, mono‐ and diesters of polyglycerol formed an oil‐in‐water type emulsion, heptaesters formed a water‐in‐oil type emulsion, and tri‐ and tetraesters formed both of types of emulsions, depending on the length of the acid hydrocarbon radicals.     

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layouts. We consider this extension from three main viewpoints: graph searching, tree decompositions, and elimination orderings. The three graph parameters pathwidth, profile, and bandwidth related to linear layouts can be defined by variants of graph searching using a standard fugitive. Switching to an inert fugitive, the two former parameters are extended to treewidth and fill-in, and our first viewpoint considers the analogous tree-like extension that arises from the bandwidth variant. Bandwidth also has a definition in terms of ordered path decompositions, and our second viewpoint extends this in a natural way to ordered tree decompositions. In showing that both extensions are equivalent we employ the third viewpoint of elimination trees, as used in the field of sparse matrix computations. We call the resulting parameter the treespan of a graph and prove some of its combinatorial and algorithmic properties.     

Approximating minimum cocolorings

A cocoloring of a graph G is a partition of the vertex set of G such that each set of the partition is either a clique or an independent set in G. Some special cases of the minimum cocoloring problem are of particular interest.We provide polynomial-time algorithms to approximate a minimum cocoloring on graphs, partially ordered sets and sequences. In particular, we obtain an efficient algorithm to approximate within a factor of 1.71 a minimum partition of a partially ordered set into chains and antichains, and a minimum partition of a sequence into increasing and decreasing subsequences.     

Computing Optimal Steiner Trees in Polynomial Space

Given an n-node edge-weighted graph and a subset of k terminal nodes, the NP-hard (weighted) Steiner tree problem is to compute a minimum-weight tree which spans the terminals. All the known algorithms for this problem which improve on trivial O(1.62 ⁿ )-time enumeration are based on dynamic programming, and require exponential space. Motivated by the fact that exponential-space algorithms are typically impractical, in this paper we address the problem of designing faster polynomial-space algorithms. Our first contribution is a simple O((27/4) ^k n ^O(logk))-time polynomial-space algorithm for the problem. This algorithm is based on a variant of the classical tree-separator theorem: every Steiner tree has a node whose removal partitions the tree in two forests, containing at most 2k/3 terminals each. Exploiting separators of logarithmic size which evenly partition the terminals, we are able to reduce the running time to $O(4^{k}n^{O(\log^{2} k)})$ . This improves on trivial enumeration for roughly k<n/3, which covers most of the cases of practical interest. Combining the latter algorithm (for small k) with trivial enumeration (for large k) we obtain a O(1.59 ⁿ )-time polynomial-space algorithm for the weighted Steiner tree problem. As a second contribution of this paper, we present a O(1.55 ⁿ )-time polynomial-space algorithm for the cardinality version of the problem, where all edge weights are one. This result is based on a improved branching strategy. The refined branching is based on a charging mechanism which shows that, for large values of k, convenient local configurations of terminals and non-terminals exist. The analysis of the algorithm relies on the Measure & Conquer approach: the non-standard measure used here is a linear combination of the number of nodes and number of non-terminals. Using a recent result in Nederlof (International colloquium on automata, languages and programming (ICALP), pp. 713–725, 2009), the running time can be reduced to O(1.36 ⁿ ). The previous best algorithm for the cardinality case runs in O(1.42 ⁿ ) time and exponential space.     

DNA Break Mapping Reveals Topoisomerase II Activity Genome-Wide

Genomic DNA is under constant assault by endogenous and exogenous DNA damaging agents. DNA breakage can represent a major threat to genome integrity but can also be necessary for genome function. Here we present approaches to map DNA double-strand breaks (DSBs) and single-strand breaks (SSBs) at the genome-wide scale by two methods called DSB- and SSB-Seq, respectively. We tested these methods in human colon cancer cells and validated the results using the Topoisomerase II (Top2)-poisoning agent etoposide (ETO). Our results show that the combination of ETO treatment with break-mapping techniques is a powerful method to elaborate the pattern of Top2 enzymatic activity across the genome.     

Personality subtypes of young moped drivers, their relationship to risk-taking behavior and involvement in road crashes in an Austrian sample

Objective

This study aimed to identify subtypes of young moped drivers and analyze how these subtypes are involved in risk preferences and road crashes.

Design

A group of Austrian teenage moped drivers (213, 28% girls) completed an online questionnaire about moped usage, injuries, driving style, inattention, impulsivity, and personality according to the Five-Factor Model of Personality and Cloninger's model of personality.

Results

A cluster analysis yielded four types of moped drivers. One type was characterized by a high level of neuroticism, the second type was characterized by a risky personality and a risky driving style, the third type had a more cautious driving style, and the fourth type was characterized by a risky personality and high levels on inattention and impulsivity.

Conclusions

Our conclusions suggest that young moped drivers should not be perceived as a homogenous group, according to measures of injury prevention and intervention.