Acknowledgements I would like to express my deepest appreciation to my supervisors Professor Hans-Jürgen Schmeisser and Professor Winfried Sickel for their support and many hints and comments. I thank also Professor Hans Triebel for many valuable discussions on the topic of this work.

BACKGROUND & AIMS Restrained food consumption may alter metabolic function and contribute to eventual weight gain; however, sex differences in these relationships have not been assessed. The objective of this study was to examine the relationship between restrained eating and insulin resistance and the influence of body mass index and sex on this relationship in a large community sample of both...

<abstract><p>Let $ G be a graph with vertex set V(G) $. A function f:V(G)\rightarrow \{0, 1, 2\} is Roman dominating on if every v\in for which f(v) = 0 adjacent to at least one u\in such that f(u) 2 The domination number of the minimum weight \omega(f) \sum_{x\in V(G)}f(x) among all functions f In this article we study direct product graphs and rooted graphs. Specifically, give sev...

Let G be a graph with no isolated vertex and let N(v) the open neighbourhood of v∈V(G). f:V(G)→{0,1,2} function Vi={v∈V(G):f(v)=i} for every i∈{0,1,2}. We say that f is strongly total Roman dominating on if subgraph induced by V1∪V2 has N(v)∩V2≠∅ v∈V(G)\V2. The domination number G, denoted γtRs(G), defined as minimum weight ω(f)=∑x∈V(G)f(x) among all functions G. This paper devoted to study it ...

We have found that refinement of protein NMR structures using Rosetta with experimental NMR restraints yields more accurate protein NMR structures than those that have been deposited in the PDB using standard refinement protocols. Using 40 pairs of NMR and X-ray crystal structures determined by the Northeast Structural Genomics Consortium, for proteins ranging in size from 5-22 kDa, restrained ...

Given an undirected graph G = (V,E) and a weight function w : E → R, the Minimum Dominating Tree problem asks to find a minimum weight sub-tree of G, T = (U,F ), such that every v ∈ V \U is adjacent to at least one vertex in U . The special case when the weight function is uniform is known as the Minimum Connected Dominating Set problem. Given an undirected graph G = (V,E) with some subsets of ...

When, as teenagers, we visited the historic site of Vaison-la-Romaine in Southern France, the discovery of Roman capitals buried under the foundations of a mediaeval church was really astounding. How, besides reusing full blocks of the antique architecture, the builders dared reduce the most worked Roman stones to the humble function of backfill? Have new builders become totally disrespectful t...