A Simple HPLC/DAD Method Validation for the Quantification of Malondialdehyde in Rodent’s Brain

In the present study, a HPLC/DAD method was set up to allow for the determination and quantification of malondialdehyde (MDA) in the brain of rodents (rats). Chromatographic separation was achieved on Supelcosil LC-18 (3 μm) SUPELCO Column 3.3 cm × 4.6 mm and Supelco Column Saver 0.5 μm filter by using a mobile phase acetonitrile (A) and phosphate buffer (20 mM, pH = 6) (B). Isocratic elution was 14% for (A) and 86% for (B). The injection volume (loop mode) was 100 μL with an analysis time of 1.5 min. Flow rate was set at 1 mL/min. The eluted compound was detected at 532 nm by a DAD detector by keeping the column oven at room temperature. The results indicated that the method has good linearity in the range of 0.2–20 μg/g. Both intra- and inter-day precision, expressed as RSD, were ≤15% and the accuracies ranged between ±15%. The lower limit of quantification (LLOQ), stability, and robustness were evaluated and satisfied the validation criteria. The method was successfully applied in a study of chronic toxicology following different treatment regimens with haloperidol and metformin.     

Radial limit of lacunary Fourier series with coefficients in non-commutative symmetric spaces

Let be a rearrangement invariant space, an arbitrary set and a von Neumann algebra with a semifinite normal faithful trace. It is proved that the associated symmetric space of measurable operators has -RNP if and only if has -RNP extending in this way some previous results by Q. Xu.

     

On the Harnack principle for strongly elliptic systems with nonsmooth coefficients

In this paper we prove the following theorem (for notation and definitions, see the paragraphs below): “Let Ω ⊆ ℝⁿ be a domain, m ∈ ℕ, and λ, q > 0. Then, there exists r (= r(λ, q)) > 1 such that for every 0 < p < q, whenever are weak solutions of a strongly elliptic system with m equations of ellipticity λ satisfying ∈ 𝒫_r a.e. and Ω′ ⊆ Ω subdomain, the following inequalities hold: where C (= C(n,m,λ,q,p,Ω,Ω′)) is a positive constant.” © 1999 John Wiley & Sons, Inc.     

Continuity Corrections for Discrete Distributions Under the Edgeworth Expansion

The approximation of discrete distributions by Edgeworth expansion series for continuity points of a discrete distribution F _n implies that if t is a support point of F _n, then the expansion should be performed at a continuity point . When a value is selected to improve the approximation of , and especially when a single term of the expansion is used, the selected is defined to be a continuity correction. This paper investigates the properties of the approximations based on several terms of the expansion, when is the value at which the infimum of a residual term is attained. Methods of selecting the estimation and the residual terms are investigated and the results are compared empirically for several discrete distributions. The results are also compared with the commonly used approximation based on the normal distribution with . Some numerical comparisons show that the developed procedure gives better approximations than those obtained under the standard continuity correction technique, whenever is close to 0 and 1. Thus, it is especially useful for p-value computations and for the evaluation of probabilities of rare events.     

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> estimates for the biest I. The Walsh case

We prove L^p estimates (Theorem 1.8) for the Walsh model of the biest, a trilinear multiplier with singular symbol. The corresponding estimates for the Fourier model will be obtained in the sequel [11] biest of this paper.     

Graded group schemes and graded group varieties

We define graded group schemes and graded group varieties and develop their theory. Graded group schemes are the graded analogue of a?ne group schemes and are in correspondence with graded Hopf algebras. Graded group varieties take the place of infinitesimal group schemes. We generalize the result that connected graded bialgebras are graded Hopf algebra to our setting and we describe the algebra structure of graded group varieties. We relate these new objects to the classical ones providing a new and broader framework for the study of graded Hopf algebras and a?ne group schemes.     

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures

In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and dynamic shortest paths. Although research on these problems spans over more than three decades, in the last couple of years many novel algorithmic techniques have been proposed. In this survey, we will make a special effort to abstract some combinatorial and algebraic properties, and some common data-structural tools that are at the base of those techniques. This will help us try to present some of the newest results in a unifying framework so that they can be better understood and deployed also by non-specialists.     

Uniform estimates on multi-linear operators with modulation symmetry

In a previous paper [20] in this series, we gaveL ^p estimates for multi-linear operators given by multipliers which are singular on a non-degenerate subspace of some dimensionk. In this paper, we give uniform estimates when the subspace approaches a degenerate region in the casek = 1, and when all the exponentsp are between 2 and ∞. In particular, we recover the non-endpoint uniform estimates for the bilinear Hubert transform in [12]. Dedicated to Tom Wolff