Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

Approximation of bandlimited functions

Many signals encountered in science and engineering are approximated well by bandlimited functions. We provide suitable error bounds for the approximation of bandlimited functions by linear combinations of certain special functions—the prolate spheroidal wave functions of order 0. The coefficients in the approximating linear combinations are given explicitly via appropriate quadrature formulae.     

Approximation algorithms for dynamic resource allocation

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.     

Some necessary and sufficient conditions for Hypercyclicity Criterion

We give necessary and sufficient conditions for an operator on a separable Hilbert space to satisfy the hypercyclicity criterion. This paper is a part of the second author’s Doctoral thesis, written at Shiraz University under the direction of the first author.     

On Best Approximations from RS-sets in Complex Banach Spaces

The concept of an RS-set in a complex Banach space is introduced and the problem of best approximation from an RS-set in a complex space is investigated. Results consisting of characterizations, uniqueness and strong uniqueness are established,     

用于强磁场的快响应真空规的研制进展

研制了能在强磁场、强干扰环境下工作的快响应真空电离规(快规),用于对HL 2A装置偏滤器室和等离子体附近的中性粒子密度和通量进行原位测量。介绍了快规的结构、工作原理、设计要点以及实验结果。在无磁场的情况下,快规对气体压强的测量范围为6.4×10-6～0.15Pa,在1×10-5～0.15Pa范围内,快规收集极离子流与发射电子流之比与气压保持良好线性关系;在0 15T的磁场下,快规的规管常数未发生显著变化,在规管对称轴与磁力线的夹角小于15o时,规管常数的变化小于10%。     

PURIFICATION OF L-METHIONINE AND N-ACETYL-D-METHIONINE FROM THE MIXTURE OF ENZYMATICALLY DEACYLATED N-ACETYL-DL-METHIONINE

1. INTRODUCTION Methionine, namely 2-amido-4-thiomethyl butyric acid with a structure of CH3SCH2CH2CHCOOH, is one of the essential amino acids and has two natural enantionmers, D and L-methionine. The mixture of L- and D-isomers can be used as analeptics or nutritive additives to maintain the equilibrium of amino acids of feed [1,2]. L-methionine can release active methyl and accelerate the synthesis of choline, which further speeds up the conversion of the lipid accumulated in liv…     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.