Colorimetrische Bestimmung von Butylhydroxyanisol

Zusammenfassung In der Arbeit ist die ursprüngliche colorimetrische Bestimmung von BHA beschrieben. Die Methode beruht auf Nitrosierung und der anschließenden Bestimmung der Farbtiefe des Farbproduktes des Nitrosoderivates von BHA im alkalischen Medium.Es wurden die optimalen Bedingungen der Reaktion ermittelt, die Beständigkeit und ihre Eignung für die colorimetrische Bestimmung. Die Methode gehorcht dem Lambert-Beer-Gesetz bis zu einer Konzentration von 1 mg BHA in 25 ml. Die ausgearbeitete und vorgeschlagene Methode wurde durch die Analyse von Modellmustern im reinen Zustand, ebenso wie durch die Analyse der Modellmuster nach der Zugabe von BHA in Fett und Öl bestätigt. In allen Fällen ergab diese Methode gute und reproduzierbare Ergebnisse.Im Vergleich mit den bisher angewendeten Methoden ist sie weitaus schneller, denn eine Bestimmung dauert ungefähr nur 1 Std, und sie ist mit leicht zugänglichen Chemikalien bei Verwendung normaler Laboreinrichtungen durchführbar. Andere Antioxydantien, die zum Schutz der Öle und Fette verwendet werden, stört nur NDGA bei der Bestimmung. Dieser Einfluß kann jedoch mit geeigneten Extraktionsmethoden beseitigt werden (14).Mit der vorgeschlagenen Methode kann man 0,05 mg BHA in 25 ml mit einer Genauigkeit von ±5% sicher bestimmen.     

Response-monitoring dysfunction in schizophrenia: An event-related brain potential study.

Error-monitoring abnormalities may underlie positive symptoms of schizophrenia. Response-synchronized event-related potentials during picture-word matching yielded error- and correct-response-related negativity (ERN, CRN) and positivity (Pe, Pc) and preresponse lateralized readiness potentials (LRP) from 18 schizophrenic patients and 18 controls. Both groups responded faster to matches than nonmatches, although patients were generally slower and made more errors to nonmatches. Compared with controls, patients, particularly with paranoid subtype, had smaller ERNs and larger CRNs, which were indistinguishable. LRPs showed evidence of more response conflict before errors than before correct responses in controls but not patients. Despite ERN/CRN abnormalities, post-error slowing and Pe were normal in patients, suggesting a dissociation of ERN and error awareness. Anterior cingulate and dorsolateral prefrontal cortical dysfunction in schizophrenia are implicated. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

In this note, we give a proof that several vertex ordering problems can be solved in O ^∗(2 ⁿ ) time and O ^∗(2 ⁿ ) space, or in O ^∗(4 ⁿ ) time and polynomial space. The algorithms generalize algorithms for the Travelling Salesman Problem by Held and Karp (J. Soc. Ind. Appl. Math. 10:196–210, 1962) and Gurevich and Shelah (SIAM J. Comput. 16:486–502, 1987). We survey a number of vertex ordering problems to which the results apply.     

Exact Algorithms for Graph Homomorphisms

Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if G is k-colorable. During recent years the topic of exact (exponential-time) algorithms for NP-hard problems in general, and for graph coloring in particular, has led to extensive research. Consequently, it is natural to ask how the techniques developed for exact graph coloring algorithms can be extended to graph homomorphisms. By the celebrated result of Hell and Nesetril, for each fixed simple graph H, deciding whether a given simple graph G has a homomorphism to H is polynomial-time solvable if H is a bipartite graph, and NP-complete otherwise. The case where H is the cycle of length 5, is the first NP-hard case different from graph coloring. We show that for an odd integer , whether an input graph G with n vertices is homomorphic to the cycle of length k, can be decided in time . We extend the results obtained for cycles, which are graphs of treewidth two, to graphs of bounded treewidth as follows: if H is of treewidth at most t, then whether input graph G with n vertices is homomorphic to H can be decided in time .     

Parameterized complexity of connected even/odd subgraph problems

In 2011, Cai an Yang initiated the systematic parameterized complexity study of the following set of problems around Eulerian graphs: for a given graph G and integer k, the task is to decide if G contains a (connected) subgraph with k vertices (edges) with all vertices of even (odd) degrees. They succeed to establish the parameterized complexity of all cases except two, when we ask about:

•

a connected k-edge subgraph with all vertices of odd degrees, the problem known as k-Edge Connected Odd Subgraph; and     

Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs

The Hamiltonian Cycle problem is the problem of deciding whether an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. Finding an exact algorithm that solves it in ${\mathcal {O}}^{*}(\alpha^{n})$ time for some constant α<2 was a notorious open problem until very recently, when Björklund presented a randomized algorithm that uses ${\mathcal {O}}^{*}(1.657^{n})$ time and polynomial space. The Longest Cycle problem, in which the task is to find a cycle of maximum length, is a natural generalization of the Hamiltonian Cycle problem. For a claw-free graph G, finding a longest cycle is equivalent to finding a closed trail (i.e., a connected even subgraph, possibly consisting of a single vertex) that dominates the largest number of edges of some associated graph H. Using this translation we obtain two deterministic algorithms that solve the Longest Cycle problem, and consequently the Hamiltonian Cycle problem, for claw-free graphs: one algorithm that uses ${\mathcal {O}}^{*}(1.6818^{n})$ time and exponential space, and one algorithm that uses ${\mathcal {O}}^{*}(1.8878^{n})$ time and polynomial space.