19,261 research outputs found
A -vertex Kernel for -packing
The -packing problem asks for whether a graph contains
vertex-disjoint paths each of length two. We continue the study of its
kernelization algorithms, and develop a -vertex kernel
Branch and bound method for regression-based controlled variable selection
Self-optimizing control is a promising method for selection of controlled variables (CVs) from available measurements. Recently, Ye, Cao, Li, and Song (2012) have proposed a globally optimal method for selection of self-optimizing CVs by converting the CV selection problem into a regression problem. In this approach, the necessary conditions of optimality (NCO) are approximated by linear combinations of available measurements over the entire operation region. In practice, it is desired that a subset of available measurements be combined as CVs to obtain a good trade-off between the economic performance and the complexity of control system. The subset selection problem, however, is combinatorial in nature, which makes the application of the globally optimal CV selection method to large-scale processes difficult. In this work, an efficient branch and bound (BAB) algorithm is developed to handle the computational complexity associated with the selection of globally optimal CVs. The proposed BAB algorithm identifies the best measurement subset such that the regression error in approximating NCO is minimized and is also applicable to the general regression problem. Numerical tests using randomly generated matrices and a binary distillation column case study demonstrate the computational efficiency of the proposed BAB algorithm
Subset measurement selection for globally self-optimizing control of Tennessee Eastman process
The concept of globally optimal controlled variable selection has recently been proposed to improve self-optimizing control performance of traditional local approaches. However, the associated measurement subset selection problem has not be studied. In this paper, we consider the measurement subset selection problem for globally self-optimizing control (gSOC) of Tennessee Eastman (TE) process. The TE process contains substantial measurements and had been studied for SOC with controlled variables selected from individual measurements through exhaustive search. This process has been revisited with improved performance recently through a retrofit approach of gSOC. To extend the improvement further, the measurement subset selection problem for gSOC is considered in this work and solved through a modification of an existing partially bidirectional branch and bound (PB3) algorithm originally developed for local SOC. The modified PB3 algorithm efficiently identifies the best measurement candidates among the full set which obtains the globally minimal economic loss. Dynamic simulations are conducted to demonstrate the optimality of proposed results
Retrofit self-optimizing control of Tennessee Eastman process
This paper considers near-optimal operation of the Tennessee Eastman (TE) process by using a retrofit self-optimizing control (SOC) approach. Motivated by the factor that most chemical plants in operation have already been equipped with a workable control system for regulatory control, we propose to improve the economic performance by controlling some self-optimizing controlled variables (CVs). Different from traditional SOC methods, the proposed retrofit SOC approach improves economic optimality of operation through newly added cascaded SOC loops, where carefully selected SOC CVs are maintained at constant by adjusting set-points of the existing regulatory control loops. To demonstrate the effectiveness of the retrofit SOC proposed, we adopted measurement combinations as the CVs for the TE process, so that the economic cost is further reduced comparing to existing studies where single measurements are controlled. The optimality of the designed control architecture is validated through both steady state analysis and dynamic simulations
Episodic jet power extracted from a spinning black hole surrounded by a neutrino-dominated accretion flow in gamma-ray bursts
It was suggested that the relativistic jets in gamma-ray bursts (GRBs) are
powered via the Blandford-Znajek (BZ) mechanism or the annihilation of
neutrinos and anti-neutrinos from a neutrino cooling-dominated accretion flow
(NDAF). The advection and diffusion of the large-scale magnetic field of a NDAF
is calculated, and the external magnetic field is found to be dragged inward
efficiently by the accretion flow for a typical magnetic Prandtl number P_m=1.
The maximal BZ jet power can be ~10^53-10^54 erg/sec for an extreme Kerr black
hole, if an external magnetic field with 10^14 Gauss is advected by the NDAF.
This is roughly consistent with the field strength of the disk formed after a
tidal disrupted magnetar. The accretion flow near the black hole horizon is
arrested by the magnetic field if the accretion rate is below than a critical
value for a given external field. The arrested accretion flow fails to drag the
field inward and the field strength decays, and then the accretion re-starts,
which leads to oscillating accretion. The typical timescale of such episodic
accretion is in an order of one second. This can qualitatively explain the
observed oscillation in the soft extend emission of short-type GRBs.Comment: 8 pages, to appear in ApJ, references update
- …