Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector

We consider two-stage recourse models with integer restrictions in the second stage. These models are typically non-convex and hence, hard to solve. There exist convex approximations of these models with accompanying error bounds. However, it is unclear how these error bounds depend on the distributions of the second-stage cost vector q. In this paper, we derive parametric error bounds whose dependence on the distribution of q is explicit: they scale linearly in the expected value of the ${?}_1$-norm of q.     

Simultaneous determination of 75 abuse drugs including amphetamines,benzodiazepines, cocaine,opioids, piperazines,zolpidem and metabolites in human hair samples using liquid chromatography–tandem mass spectrometry

A liquid chromatography–tandem mass spectrometric method for the simultaneous determination of 75 abuse drugs and metabolites, including 19 benzodiazepines, 19 amphetamines, two opiates, eight opioids, cocaine, lysergic acid diethylamide, zolpidem, three piperazines and 21 metabolites in human hair samples, was developed and validated. Ten‐milligram hair samples were decontaminated, pulverized using a ball mill, extracted with 1 mL of methanol spiked with 28 deuterated internal standards in an ultrasonic bath for 60 min at 50°C, and purified with Q‐sep dispersive solid‐phase extraction tubes. The purified extracts were evaporated to dryness and the residue was dissolved in 0.1 mL of 10% methanol. The 75 analytes were analyzed on an Acquity HSS T3 column using gradient elution of methanol and 0.1% formic acid and quantified in multiple reaction monitoring mode with positive electrospray ionization. Calibration curves were linear (r ≥ 0.9951) from the lower limit of quantitation (2–200 pg/mg depending on the drug) to 2000 pg/mg. The coefficients of variation and accuracy for intra‐ and inter‐assay analysis at three QC levels were 4.3–12.9% and 89.2–109.1%, respectively. The overall mean recovery ranged from 87.1 to 105.3%. This method was successfully applied to the analysis of 11 forensic hair samples obtained from drug abusers.     

Simultaneous Visualization of Endogenous Homocysteine,Cysteine, Glutathione,and their Transformation through Different Fluorescence Channels

Studying numerous biologically important species simultaneously is crucial to understanding cellular functions and the root causes of related diseases. Direct visualization of endogenous biothiols in biological systems is of great value to understanding their biological roles. Herein, a novel multi‐signal fluorescent probe was rationally designed and exploited for the simultaneous sensing of homocysteine (Hcy), cysteine (Cys), and glutathione (GSH) using different emission channels. This probe was successfully applied to the simultaneous discrimination between and visualization of endogenous Hcy, Cys, GSH, and their transformation in living cells.     

On approximations of the de Rham complex and their cohomology

For a commutative algebra R, its de Rham cohomology is an important invariant of R. In the paper, an infinite chain of de Rham-like complexes is introduced where the first member of the chain is the de Rham complex. The complexes are called approximations of the de Rham complex. Their cohomologies are found for polynomial rings and algebras of power series over a field of characteristic zero.     

Computing upward topological book embeddings of upward planar digraphs

We describe a unified approach for studying book, point-set, and simultaneous embeddability problems of upward planar digraphs. The approach is based on a linear time strategy to compute an upward planar drawing of an upward planar digraph such that all vertices are collinear. Besides having impact in relevant application domains of graph drawing and computational geometry, the presented results open new research directions in the area of upward planarity with constraints of the positions of the vertices.     

Spectral analysis of Pk Finite Element matrices in the case of Friedrichs–Keller triangulations via Generalized Locally Toeplitz technology

In the present article, we consider a class of elliptic partial differential equations with Dirichlet boundary conditions and where the operator is div(?a( x )?·), with a continuous and positive over $\stackrel{￣}{\mathrm{\Omega }}$, Ω being an open and bounded subset of ${\mathbb{R}}^d$, d≥1. For the numerical approximation, we consider the classical ${\mathbb{P}}_k$ Finite Elements, in the case of Friedrichs–Keller triangulations, leading, as usual, to sequences of matrices of increasing size. The new results concern the spectral analysis of the resulting matrix‐sequences in the direction of the global distribution in the Weyl sense, with a concise overview on localization, clustering, extremal eigenvalues, and asymptotic conditioning. We study in detail the case of constant coefficients on Ω=(0,1)² and we give a brief account in the more involved case of variable coefficients and more general domains. Tools are drawn from the Toeplitz technology and from the rather new theory of Generalized Locally Toeplitz sequences. Numerical results are shown for a practical evidence of the theoretical findings.     

关于不定方程x3-1=749y2

利用同余式、平方剩余、Pell方程的解的性质、递归序列证明了:不定方程x³-1=749y²仅有整数解(x,y)=(1,0).     

Tensor method for optimal control problems constrained by fractional three-dimensional elliptic operator with variable coefficients

We introduce the tensor numerical method for solving optimal control problems that are constrained by fractional two- (2D) and three-dimensional (3D) elliptic operators with variable coefficients. We solve the governing equation for the control function which includes a sum of the fractional operator and its inverse, both discretized over large 3D $n\times n\times n$ spacial grids. Using the diagonalization of the arising matrix-valued functions in the eigenbasis of the one-dimensional Sturm–Liouville operators, we construct the rank-structured tensor approximation with controllable precision for the discretized fractional elliptic operators and the respective preconditioner. The right-hand side in the constraining equation (the optimal design function) is supposed to be represented in a form of a low-rank canonical tensor. Then the equation for the control function is solved in a tensor structured format by using preconditioned CG iteration with the adaptive rank truncation procedure that also ensures the accuracy of calculations, given an $\epsilon$-threshold. This method reduces the numerical cost for solving the control problem to $O(n\log n)$ (plus the quadratic term $O(n^2)$ with a small weight), which outperforms traditional approaches with $O(n^3\log n)$ complexity in the 3D case. The storage for the representation of all 3D nonlocal operators and functions involved is also estimated by $O(n\log n)$. This essentially outperforms the traditional methods operating with fully populated $n^3\times n^3$ matrices and vectors in ${?}^{n^3}$. Numerical tests for 2D/3D control problems indicate the almost linear complexity scaling of the rank truncated preconditioned conjugate gradient iteration in the univariate grid size n.