The Double Face of Ketamine—The Possibility of Its Identification in Blood and Beverages

The purpose of this study was to develop and validate a high-sensitivity methodology for identifying one of the most used drugs—ketamine. Ketamine is used medicinally to treat depression, alcoholism, and heroin addiction. Moreover, ketamine is the main ingredient used in so-called “date-rape” pills (DRP). This study presents a novel methodology for the simultaneous determination of ketamine based on the Dried Blood Spot (DBS) method, in combination with capillary electrophoresis coupled with a mass spectrometer (CE-TOF-MS). Then, 6-mm circles were punched out from DBS collected on Whatman DMPK-C paper and extracted using microwave-assisted extraction (MAE). The assay was linear in the range of 25–300 ng/mL. Values of limits of detection (LOD = 6.0 ng/mL) and quantification (LOQ = 19.8 ng/mL) were determined based on the signal to noise ratio. Intra-day precision at each determined concentration level was in the range of 6.1–11.1%, and inter-day between 7.9–13.1%. The obtained precision was under 15.0% (for medium and high concentrations) and lower than 20.0% (for low concentrations), which are in accordance with acceptance criteria. Therefore, the DBS/MAE/CE-TOF-MS method was successfully checked for analysis of ketamine in matrices other than blood, i.e., rose wine and orange juice. Moreover, it is possible to identify ketamine in the presence of flunitrazepam, which is the other most popular ingredient used in DRP. Based on this information, the selectivity of the proposed methodology for identifying ketamine in the presence of other components of rape pills was checked.     

Clique-cutsets beyond chordal graphs

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes.     

Evaluation of Bookkeeper mass deacidification based on historical book papers

Cellulose - Bookkeeper, the most widely used deacidification process based on MgO particles, was systematically evaluated on two sets of nonvaluable historical paper samples. Established analytical...     

Graphs with No Induced Five‐Vertex Path or Antipath

We prove that a graph G contains no induced ‐vertex path and no induced complement of a ‐vertex path if and only if G is obtained from 5‐cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class‐preserving operation introduced here.     

Amalgams and χ‐Boundedness

A class of graphs is hereditary if it is closed under isomorphism and induced subgraphs. A class of graphs is χ‐bounded if there exists a function such that for all graphs , and all induced subgraphs H of G, we have that . We prove that proper homogeneous sets, clique‐cutsets, and amalgams together preserve χ‐boundedness. More precisely, we show that if and are hereditary classes of graphs such that is χ‐bounded, and such that every graph in either belongs to or admits a proper homogeneous set, a clique‐cutset, or an amalgam, then the class is χ‐bounded. This generalizes a result of [J Combin Theory Ser B 103(5) (2013), 567–586], which states that proper homogeneous sets and clique‐cutsets together preserve χ‐boundedness, as well as a result of [European J Combin 33(4) (2012), 679–683], which states that 1‐joins preserve χ‐boundedness. The house is the complement of the four‐edge path. As an application of our result and of the decomposition theorem for “cap‐free” graphs from [J Graph Theory 30(4) (1999), 289–308], we obtain that if G is a graph that does not contain any subdivision of the house as an induced subgraph, then .     

Correction to: Aziridine-2-Carboxylic Acid Derivatives and Its Open-Ring Isomers as a Novel PDIA1 Inhibitors

Chemistry of Heterocyclic Compounds -     

Attractors for Second-Order Evolution Equations with a Nonlinear Damping

We study long-time dynamics of abstract nonlinear second-order evolution equations with a nonlinear damping. Under suitable hypotheses we prove existence of a compact global attractor and finiteness of its fractal dimension. We also show that any solution is stabilized to an equilibrium and estimate the rate of the convergence which, in turn, depends on the behaviour at the origin of the function describing the dissipation. If the damping is bounded below by a linear function, this rate is exponential. Our approach is based on far reaching generalizations of the Ceron–Lopes theorem on asymptotic compactness and Ladyzhenskayas theorem on the dimension of invariant sets. An application of our results to nonlinear damped wave and plate equations allow us to obtain new results pertaining to structure and properties of global attractors for nonlinear waves and plates.     

Substituent effect on inter-ring interaction in paracyclophanes

Molecular Diversity - The theoretical calculations, namely multipole-derived charge analysis, quantum theory of atom in molecules, and non-bonding interaction (NCI), were performed for...