Bioanalysis of acetylcarnitine in cerebrospinal fluid by HILIC–mass spectrometry

Acetyl‐l ‐carnitine (ALCAR) is a potential biomarker for the modulation of brain neurotransmitter activity, but is also present in cerebrospinal fluid (CSF). Recent studies have utilized hydrophilic interaction liquid chromatography–tandem mass spectrometry (HILIC‐MS/MS) based assays to detect and quantify ALCAR within biofluids such as urine, plasma and serum, using various sample pretreatment procedures. In order to address the need to quantify ALCAR in CSF on a high‐throughput scale, a new and simple HILIC‐MS/MS assay has been successfully developed and validated. For rapid analysis, CSF sample pretreatment was performed via ‘dilute and shoot’ directly onto an advanced HILIC column prior to MS/MS detection. This newly developed HILIC‐MS/MS assay shows good recoveries of ALCAR without the need for chemical derivatization and multistep sample extraction procedures. The employment of this assay is suitable for the high‐throughput bioanalysis and quantification of ALCAR within the CSF of various animal models and human clinical studies. Copyright © 2015 John Wiley & Sons, Ltd.     

Sobolev Stability of Plane Wave Solutions to the Nonlinear Schrödinger Equation

This article explores the questions of long time orbital stability in high order Sobolev norms of plane wave solutions to the NLSE in the defocusing case.     

Synthesis and structural characterization of (η5-Dp)Ru(PPh3)2H (Dp = C8H9−, 1,2-dihydropentalenyl)

Transition Metal Chemistry - (η5-Dp)Ru(PPh3)2H (Dp?=?C8H9?, 1,2-dihydropentalenyl) was synthesized in 90% yield by reaction of (η5-Dp)Ru(PPh3)2Cl with sodium formate....     

The Hausdorff dimension of graphs of Weierstrass functions

The Weierstrass nowhere differentiable function, and functions constructed from similar infinite series, have been studied often as examples of functions whose graph is a fractal. Though there is a simple formula for the Hausdorff dimension of the graph which is widely accepted, it has not been rigorously proved to hold. We prove that if arbitrary phases are included in each term of the summation for the Weierstrass function, the Hausdorff dimension of the graph of the function has the conjectured value for almost every sequence of phases. The argument extends to a much wider class of Weierstrass-like functions.

     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

Splittings of finitely generated groups over two-ended subgroups

We describe a means of constructing splittings of a one-ended finitely generated group over two-ended subgroups, starting with a finite collection of codimension-one two-ended subgroups. In the case where all the two-ended subgroups have two-ended commensurators, we obtain an annulus theorem, and a form of the JSJ splitting of Rips and Sela. The construction uses ideas from the work of Dunwoody, Sageev and Swenson. We use a particular kind of order structure which combines cyclic orders and treelike structures. In the special case of hyperbolic groups, this provides a link between combinarorial constructions, and constructions arising from the topological structure of the boundary. In this context, we recover the annulus theorem of Scott and Swarup. We also show that a one-ended finitely generated group which contains an infinite-order element, and such that every infinite cyclic subgroup is (virtually) codimension-one is a virtual surface group.

     

On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002