Über eine neue Synthese von α-Alkyladipinsäuren

Ohne Zusammenfassung     

Sodium dodecyl sulfate versus acid-labile surfactant gel electrophoresis: comparative proteomic studies on rat retina and mouse brain

A long-chain derivative of 1,3-dioxolane sodium propyloxy sulfate, with similar denaturing and electrophoretic properties as SDS, and facilitated protein identification following polyacrylamide gel electrophoresis (PAGE) for Coomassie-stained protein bands, has been tested. Comparative acid-labile surfactant/sodium dodecyl sulfate two-dimensional (ALS/SDS 2-D)-PAGE experiments of lower abundant proteins from the proteomes of regenerating rat retina and mouse brain show that peptide recovery for mass spectrometry (MS) mapping is significantly enhanced using ALS leading to more successful database searches. ALS may influence some procedures in proteomic analysis such as the determination of protein content and methods need to be adjusted to that effect. The promising results of the use of ALS in bioanalytics call for detailed physicochemical investigations of surfactant properties.     

Chemical Functionalization of Exfoliated Graphene

Graphene is turning out to be the material that will effectively kick‐start a new era for nanotechnology. The impressive properties of this atom‐thick carbon layer are taking shape and form with early reports of successful applications based on it. The turning point for this material will be its low‐cost mass production. In this report a chemist’s perspective on the production methods for graphene and the subsequent functionalization processes is discussed.     

Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs

An antimagic labeling of a graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, . . . , q} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel conjectured that that every connected graph, except K ₂, is antimagic. Recently, using completely separating systems, Phanalasy et al. showed that for each k 3 2, q 3 \binomk+12{k\geq 2,\,q\geq\binom{k+1}{2}} with k|2q, there exists an antimagic k-regular graph with q edges and p = 2q/k vertices. In this paper we prove constructively that certain families of Cartesian products of regular graphs are antimagic.     

Universal behavior in the scattering of heavy, weakly interacting dark matter on nuclear targets

Particles that are heavy compared to the electroweak scale (M?mW), and that are charged under electroweak SU(2) gauge interactions display universal properties such as a characteristic fine structure in the mass spectrum induced by electroweak symmetry breaking, and an approximately universal cross section for scattering on nuclear targets. The heavy particle effective theory framework is developed to compute these properties. As illustration, the spin independent cross section for low-velocity scattering on a nucleon is evaluated in the limit M?mW, including complete leading-order matching onto quark and gluon operators, renormalization analysis, and systematic treatment of perturbative and hadronic-input uncertainties.