We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
Cancer immunotherapy aims at stimulating the immune system to react against cancer stealth capabilities. It consists of repeatedly injecting small doses of a tumor-associated molecule one wants the immune system to recognize, until a consistent immune response directed against the tumor cells is observed.
We have applied the theory of optimal control to the problem of finding the optimal schedule of injections of an immunotherapeutic agent against cancer. The method employed works for a general ODE system and can be applied to find the optimal protocol in a variety of clinical problems where the kinetics of the drug or treatment and its influence on the normal physiologic functions have been described by a mathematical model.
We show that the choice of the cost function has dramatic effects on the kind of solution the optimization algorithm is able to find. This provides evidence that a careful ODE model and optimization schema must be designed by mathematicians and clinicians using their proper different perspectives. 相似文献
We consider a Bolza optimal control problem with state constraints. It is well known that under some technical assumptions every strong local minimizer of this problem satisfies first order necessary optimality conditions in the form of a constrained maximum principle. In general, the maximum principle may be abnormal or even degenerate and so does not provide a sufficient information about optimal controls. In the recent literature some sufficient conditions were proposed to guarantee that at least one maximum principle is nondegenerate, cf. [A.V. Arutyanov, S.M. Aseev, Investigation of the degeneracy phenomenon of the maximum principle for optimal control problems with state constraints, SIAM J. Control Optim. 35 (1997) 930–952; F. Rampazzo, R.B. Vinter, A theorem on existence of neighbouring trajectories satisfying a state constraint, with applications to optimal control, IMA 16 (4) (1999) 335–351; F. Rampazzo, R.B. Vinter, Degenerate optimal control problems with state constraints, SIAM J. Control Optim. 39 (4) (2000) 989–1007]. Our aim is to show that actually conditions of a similar nature guarantee normality of every nondegenerate maximum principle. In particular we allow the initial condition to be fixed and the state constraints to be nonsmooth. To prove normality we use J. Yorke type linearization of control systems and show the existence of a solution to a linearized control system satisfying new state constraints defined, in turn, by linearization of the original set of constraints along an extremal trajectory. 相似文献
A convergent-barrel (CB) cold spray nozzle was designed through numerical simulation. It was found that the main factors influencing significantly particle velocity and temperature include the length and diameter of the barrel section, the nature of the accelerating gas and its pressure and temperature, and the particle size. Particles can achieve a relatively low velocity but a high temperature under the same gas pressure using a CB nozzle compared to a convergent-divergent (CD) nozzle. The experiment results with Cu powder using the designed CB nozzle confirmed that particle deposition can be realized under a lower gas pressure with a CB nozzle. 相似文献
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(pm) (any positive integer m) with the period 3n (n and pm − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura
algorithm, we can determine the linear complexity of any sequence over GF(pm) with the period 3n (n and pm − 1 are coprime) more efficiently. 相似文献
Temperature effects on deposition rate of silicon nitride films were characterized by building a neural network prediction model. The silicon nitride films were deposited by using a plasma enhanced chemical vapor deposition system and process parameter effects were systematically characterized by 26−1 fractional factorial experiment. The process parameters involved include a radio frequency power, pressure, temperature, SiH4, N2, and NH3 flow rates. The prediction performance of generalized regression neural network was drastically improved by optimizing multi-valued training factors using a genetic algorithm. Several 3D plots were generated to investigate parameter effects at various temperatures. Predicted variations were experimentally validated. The temperature effect on the deposition rate was a complex function of parameters but N2 flow rate. Larger decreases in the deposition rate with the temperature were only noticed at lower SiH4 (or higher NH3) flow rates. Typical effects of SiH4 or NH3 flow rate were only observed at higher or lower temperatures. A comparison with the refractive index model facilitated a selective choice of either SiH4 or NH3 for process optimization. 相似文献
In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical
taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In
this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding
the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed.
A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented
for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct
times and follow-up has an impact on the evolution of patients.
相似文献
The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented. 相似文献