Photobioreactor culture of photosynthetic soybean cells

Photosynthetic suspension cultures of higher plants offer an alternative approach to biomass production, potentially yielding cellulosic material and protein on a continuous year-round basis. A bench-top hybrid photobioreactor was developed to study photomixotrophic and photoautotrophic growth of Glycine max as a model system. Maximum biomass doubling times for photomixotrophic and photoautotrophic growth were 1.87 and 3.92 d, respectively. The presence of exogenous sugars resulted in photomixotrophic growth, reduced chlorophyll levels, and a reduction in photosynthetically-evolved oxygen. Depletion of carbohydrates from the medium coincided with the beginning of stationary phase and an increase in oxygen evolution by the cells. A second growth phase, prolonging cell viability, could be initiated by increasing the carbon dioxide from 2 to 5%, just before the onset of stationary phase. Biomass from bioreactor cultured cells proved resistant to enzymatic attack without pretreatment. Composition of the biomass was 7.8% lignin, 20.7% α-cellulose, 23% hemicellulose, 5.5% starch, 14.5% protein and 6.5% nucleic acids.     

EFFECTS OF SOURCE PROPERTIES ON CUTOFF FREQUENCY f_(max)

The cutoff frequency f_(max) of radiation from earthquakes is one of the important parameters for studying the source process. By theoretical analysis and numerical experiments on acceleration Fourier spectrum it is suggested that f_(max) mainly depends on the lower values of slip rise time. This result can be used to explain the observational fact that the greater the earthquake magnitude, the smaller the value of f_(max).     

Existence of stationary turbulent flows with variable positive vortex intensity

We prove the existence of stationary turbulent flows with arbitrary positive vortex circulation on non-simply connected domains. Our construction yields solutions for all real values of the inverse temperature with the exception of a quantized set, for which blow-up phenomena may occur. Our results complete the analysis initiated in Ricciardi and Zecca (2016).     

极大加可约矩阵的谱与周期时间向量的关系

提出了极大加代数上可约矩阵特征值的缺失值及冗余值的概念,得到了相应的定理;对特征值与周期时间向量分量之间的关系作了深入的研究.     

Packing and covering with linear programming: A survey

This paper considers the polyhedral results and the min–max results on packing and covering problems of the decade. Since the strong perfect graph theorem (published in 2006), the main such results are available for the packing problem, however there are still important polyhedral questions that remain open. For the covering problem, the main questions are still open, although there has been important progress. We survey some of the main results with emphasis on those where linear programming and graph theory come together. They mainly concern the covering of cycles or dicycles in graphs or signed graphs, either with vertices or edges; this includes the multicut and integral multiflow problems.     

A simplex-like method to compute the eigenvalue of an irreducible (max,+)-system

In this paper, we present an alternative method to compute the eigenvalue of an irreducible (max,+)-system. The method resembles the well-known simplex method in linear programming in the sense that the eigenvalue and a corresponding eigenvector are obtained by going along the boundary of a polygon-like set, while increasing the number of equalities in some (max,+)-algebraic eigenvalue–eigenvector expression, until only equalities are left over. The latter is unlike the normal linear programming approach where, going along the boundary of a polygon-like set, a linear functional is optimized.     

Two optimization problems in linear regression with interval data

We consider a linear regression model where neither regressors nor the dependent variable is observable; only intervals are available which are assumed to cover the unobservable data points. Our task is to compute tight bounds for the residual errors of minimum-norm estimators of regression parameters with various norms (corresponding to least absolute deviations (LAD), ordinary least squares (OLS), generalized least squares (GLS) and Chebyshev approximation). The computation of the error bounds can be formulated as a pair of max–min and min–min box-constrained optimization problems. We give a detailed complexity-theoretic analysis of them. First, we prove that they are NP-hard in general. Then, further analysis explains the sources of NP-hardness. We investigate three restrictions when the problem is solvable in polynomial time: the case when the parameter space is known apriori to be restricted into a particular orthant, the case when the regression model has a fixed number of regression parameters, and the case when only the dependent variable is observed with errors. We propose a method, called orthant decomposition of the parameter space, which is the main tool for obtaining polynomial-time computability results.     

On MAXCUT in strictly supercritical random graphs,and coloring of random graphs and random tournaments

We use a theorem by Ding, Lubetzky, and Peres describing the structure of the giant component of random graphs in the strictly supercritical regime, in order to determine the typical size of MAXCUT of in terms of ɛ. We then apply this result to prove the following conjecture by Frieze and Pegden. For every , there exists such that w.h.p. is not homomorphic to the cycle on vertices. We also consider the coloring properties of biased random tournaments. A p‐random tournament on n vertices is obtained from the transitive tournament by reversing each edge independently with probability p. We show that for the chromatic number of a p‐random tournament behaves similarly to that of a random graph with the same edge probability. To treat the case we use the aforementioned result on MAXCUT and show that in fact w.h.p. one needs to reverse edges to make it 2‐colorable.