Lower Bounds for the Rate of Convergence of Dynamic Reconstruction Algorithms for Distributed-Parameter Systems

We obtain lower bounds for the rate of convergence of reconstruction algorithms for distributed-parameter systems of parabolic type. In the case of a pointwise constraint on control for known reconstruction algorithms, we establish a lower bound on the rate of convergence, which shows that, given certain conditions, for each solution of the system one can choose such a collection of measurements so that the reconstruction error will not be less than a certain value. In the case of unbounded controls, we obtain lower bounds for a possible reconstruction error for each trajectory as well as for a given set of trajectories. For a system of special form, we construct an algorithm for which we obtain upper and lower bounds for accuracy having identical order for a specific choice of matching of the parameters.     

A new hybrid method for solving a generalized equilibrium problem, solving a variational inequality problem and obtaining common fixed points in Banach spaces, with applications

The purpose of this paper is to prove by using a new hybrid method a strong convergence theorem for finding a common element of the set of solutions for a generalized equilibrium problem, the set of solutions for a variational inequality problem and the set of common fixed points for a pair of relatively nonexpansive mappings in a Banach space. As applications, we utilize our results to obtain some new results for finding a solution of an equilibrium problem, a fixed point problem and a common zero-point problem for maximal monotone mappings in Banach spaces.     

BATE curve in assessment of clinical utility of predictive biomarkers

In this paper,for time-to-event data,we propose a new statistical framework for casual inference in evaluating clinical utility of predictive biomarkers and in selecting an optimal treatment for a particular patient.This new casual framework is based on a new concept,called Biomarker Adjusted Treatment Effect (BATE) curve.The BATE curve can be used for assessing clinical utility of a predictive biomarker,for designing a subsequent confirmation trial,and for guiding clinical practice.We then propose semi-parametric methods for estimating the BATE curves of biomarkers and establish asymptotic results of the proposed estimators for the BATE curves.We also conduct extensive simulation studies to evaluate finite-sample properties of the proposed estimation methods.Finally,we illustrate the application of the proposed method in a real-world data set.     

树的稳定子集和稳定指标

一个实矩阵的符号稳定性问题在经济学、生态学等诸多领域中都有应用背景．本文利用[1]中给出的不可约矩阵的符号稳定性的有关结论，将一个实矩阵的符号稳定性判定问题转化为一个等价的图论问题，即判定无向树中一个点子集的稳定性问题．本文引入了树的稳定子集的概念并给出了稳定子集的递归判别方法．本文还提出井研究了树的稳定指标，即树中所有稳定子集的最小基数，证明了关于稳定指标的一个min—max型定理，井给出了n阶树的稳定指标的最好上界及达到上界的极树的完全刻划。     

On the general nonlinear self-adjoint spectral problem for differential-algebraic systems

We consider a general self-adjoint spectral problem, nonlinear with respect to the spectral parameter, for linear differential-algebraic systems of equations. Under some assumptions, we present a method for reducing such a problem to a general self-adjoint nonlinear spectral problem for a system of differential equations. In turn, this permits one to pass to a problem for a Hamiltonian system of ordinary differential equations. In particular, in this way, one can obtain a method for computing the number of eigenvalues of the original problem lying in a given range of the spectral parameter.     

Error estimates for shooting methods in two-point boundary value problems for second-order equations

This paper is concerned with a procedure for estimating the global discretization error arising when a boundary value problem for a system of second order differential equations is solved by the simple shooting method, without transforming the original problem in an equivalent first order problem. Expressions of the global discretization error are derived for both linear and nonlinear boundary value problems, which reduce the error estimation for a boundary value problem to that for an initial value problem of same dimension. The procedure extends to second order equations a technique for global error estimation given elsewhere for first order equations. As a practical result the accuracy of the estimates for a second order problem is increased compared with the estimates for the equivalent first order problem.     

Necessary and sufficient existence conditions for a boundary control of vibrations of a string and a spherical layer for small times

We find necessary and sufficient conditions for the existence of a boundary control of vibrations of a string or a spherical layer for critical and subcritical times. We completely analyze the existence of a boundary control of vibrations of a spherical layer by a force on two spheres. We find necessary and sufficient existence conditions for the control. Along with the control problem for vibrations of a spherical layer, we consider a similar control problem for string vibrations.     

Diffusion in poro‐plastic media

A model is developed for the flow of a slightly compressible fluid through a saturated inelastic porous medium. The initial‐boundary‐value problem is a system that consists of the diffusion equation for the fluid coupled to the momentum equation for the porous solid together with a constitutive law which includes a possibly hysteretic relation of elasto‐visco‐plastic type. The variational form of this problem in Hilbert space is a non‐linear evolution equation for which the existence and uniqueness of a global strong solution is proved by means of monotonicity methods. Various degenerate situations are permitted, such as incompressible fluid, negligible porosity, or a quasi‐static momentum equation. The essential sufficient conditions for the well‐posedness of the system consist of an ellipticity condition on the term for diffusion of fluid and either a viscous or a hardening assumption in the constitutive relation for the porous solid. Copyright © 2004 John Wiley & Sons, Ltd.     

Propagation of a plane wave to a materially uniform but inhomogeneous body

We produce the equations of small deformations superimposed upon large for materially uniform but inhomogeneous bodies and specialize to an isotropic material and to a homogeneous finite elastic deformation. By assuming the small deformation to be a plane wave, a set of equations for the amplitude of the wave is produced which is accompanied by an additional set of conditions. By requiring a non-trivial solution for the amplitude, we obtain the secular equation and from it a set of necessary and sufficient conditions for having a real wave speed. The second set of conditions that have to be satisfied is due to the materials inhomogeneity. Essentially, the present analysis enhances the approach of Hayes and Rivlin for materially uniform but inhomogeneous bodies. The outcome is that for such bodies the restrictions on the constitutive law for having real wave speeds for an isotropic material subjected to a pure homogeneous deformation involves the field of the inhomogeneity as well.     

Project Planning and Prioritization in the Social Services–an OR Contribution

This paper describes a study carried out for the Social Services Department of a UK County Council towards the development of a system for the evaluation and prioritization of project-based work. There are three major components of the study; an activity analysis to investigate how managers in the department spend their time, with a view to establishing a time budget for the project work; a pilot study to introduce a simple system for project planning and workload balancing with a specialist team; and the development of a multiple criteria model for the evaluation and prioritization of projects. We envisaged a Decision Support System which integrated all of these elements; however, this was never developed; instead, the resultant benefits were of a very different nature. We reflect on the reasons for this and the implications for the success of the study.     

Sequence of operations analysis for dynamic data structures

This paper introduces a rather general technique for computing the average-case performance of dynamic data structures, subjected to arbitrary sequences of insert, delete, and search operations. The method allows us effectively to evaluate the integrated cost of various interesting data structure implementations, for stacks, dictionaries, symbol tables, priority queues, and linear lists; it can thus be used as a basis for measuring the efficiency of each proposed implementation. For each data type, a specific continued fraction and a family of orthogonal polynomials are associated with sequences of operations: Tchebycheff for stacks, Laguerre for dictionaries, Charlier for symbol tables, Hermite for priority queues, and Meixner for linear lists. Our main result is an explicit expression, for each of the above data types, of the generating function for integrated costs, as a linear integral transform of the generating functions for individual operation costs. We use the result to compute explicitly integrated costs of various implementations of dictionaries and priority queues.     

Stackelberg–Nash exact controllability for the Kuramoto–Sivashinsky equation

This paper deals with a hierarchical control problem for the Kuramoto–Sivashinsky equation following a Stackelberg–Nash strategy. We assume that there is a main control, called the leader, and two secondary controls, called the followers. The leader tries to drive the solution to a prescribed target and the followers intend to be a Nash equilibrium for given functionals. It is known that this problem is equivalent to a null controllability result for an optimality system consisting of three non-linear equations. One of the novelties is a new Carleman estimate for a fourth-order equation with right-hand sides in Sobolev spaces of negative order, which allows to relax some geometric conditions for the observation sets for the followers.     

Tensor factorization and Spin construction for Kac-Moody algebras

In this paper we discuss the “Factorization phenomenon” which occurs when a representation of a Lie algebra is restricted to a subalgebra, and the result factors into a tensor product of smaller representations of the subalgebra. We analyze this phenomenon for symmetrizable Kac-Moody algebras (including finite-dimensional, semi-simple Lie algebras). We present a few factorization results for a general embedding of a symmetrizable Kac-Moody algebra into another and provide an algebraic explanation for such a phenomenon using Spin construction. We also give some application of these results for semi-simple, finite-dimensional Lie algebras.We extend the notion of Spin functor from finite-dimensional to symmetrizable Kac-Moody algebras, which requires a very delicate treatment. We introduce a certain category of orthogonal g-representations for which, surprisingly, the Spin functor gives a g-representation in Bernstein-Gelfand-Gelfand category O. Also, for an integrable representation, Spin produces an integrable representation. We give the formula for the character of Spin representation for the above category and work out the factorization results for an embedding of a finite-dimensional, semi-simple Lie algebra into its untwisted affine Lie algebra. Finally, we discuss the classification of those representations for which Spin is irreducible.     

Optimal execution with weighted impact functions: a quadratic programming approach

In this paper, we develop optimal trading strategies for a risk averse investor by minimizing the expected cost and the risk of execution. Here we consider a law of motion for price which uses a convex combination of temporary and permanent market impact. In the special case of unconstrained problem for a risk neutral investor, we obtain a closed form solution for optimal trading strategies by using dynamic programming. For a general problem, we use a quadratic programming approach to get approximate dynamic optimal trading strategies. Further, numerical examples of optimal execution strategies are provided for illustration purposes.     

The Clique Complex and Hypergraph Matching

The width of a hypergraph is the minimal for which there exist such that for any , for some . The matching width of is the minimal such that for any matching there exist such that for any , for some . The following extension of the Aharoni-Haxell matching Theorem [3] is proved: Let be a family of hypergraphs such that for each either or , then there exists a matching such that for all . This is a consequence of a more general result on colored cliques in graphs. The proofs are topological and use the Nerve Theorem. Received June 14, 1999     

Optimal Design of the Time-Dependent Support of Bang–Bang Type Controls for the Approximate Controllability of the Heat Equation

We consider the nonlinear optimal shape design problem, which consists in minimizing the amplitude of bang–bang type controls for the approximate controllability of a linear heat equation with a bounded potential. The design variable is the time-dependent support of the control. Precisely, we look for the best space–time shape and location of the support of the control among those, which have the same Lebesgue measure. Since the admissibility set for the problem is not convex, we first obtain a well-posed relaxation of the original problem and then use it to derive a descent method for the numerical resolution of the problem. Numerical experiments in 2D suggest that, even for a regular initial datum, a true relaxation phenomenon occurs in this context. Also, we implement a simple algorithm for computing a quasi-optimal domain for the original problem from the optimal solution of its associated relaxed one.     

Real time disruption management for a two-stage batch production–inventory system with reliability considerations

In this research, a two-stage batch production–inventory system is introduced. In this system, the production may be disrupted, for a given period of time, either at one or both stages. In this paper, firstly, a mathematical model has been developed to suggest a recovery plan for a single occurrence of disruption at either stage. Secondly, multiple disruptions have been considered, for which a new disruption may or may not affect the recovery plan of earlier disruptions. We propose a new approach that deals with a series of disruptions over a period of time, which can be implemented for disruption recovery on a real time basis. In this approach, the model formulated for single disruption has been integrated to generate initial solutions for individual disruptions and the solutions have been revised for multiple dependent disruptions with changed parameters. With the proposed approach, an optimal recovery plan can be obtained in real time, whenever the production system experiences either a sudden disruption or a series of disruptions, at different points in time. Some numerical examples and a real-world case study are presented to explain the benefits of our proposed approach.     

First passage time to detection in stochastic population dynamical models for HIV-1

The detection of HIV-1 levels in human hosts is cast as a first exit time problem for a multidimensional diffusion process. We consider a four-component model for early HIV-1 dynamics including uninfected CD4+ T-cells, latently infected cells, actively infected cells, and HIV-1 virions. An analytical framework is presented for the distribution of the time at which a given virion level is attained. A one-dimensional diffusion approximation for a branching process leads to an estimate for the distribution of the virion density and an expression for the mean detection time for any given detection threshold.     

Competence-driven project portfolio selection,scheduling and staff assignment

This paper presents a new model for project portfolio selection, paying specific attention to competence development. The model seeks to maximize a weighted average of economic gains from projects and strategic gains from the increment of desirable competencies. As a sub-problem, scheduling and staff assignment for a candidate set of selected projects must also be optimized. We provide a nonlinear mixed-integer program formulation for the overall problem, and then propose heuristic solution techniques composed of (1) a greedy heuristic for the scheduling and staff assignment part, and (2) two (alternative) metaheuristics for the project selection part. The paper outlines experimental results on a real-world application provided by the E-Commerce Competence Center Austria and, for a slightly simplified instance, presents comparisons with the exact solution computed by CPLEX.     

Implicit construction of multiple eigenvalues for trees

We are generally concerned with the possible lists of multiplicities for the eigenvalues of a real symmetric matrix with a given graph. Many restrictions are known, but it is often problematic to construct a matrix with desired multiplicities, even if a matrix with such multiplicities exists. Here, we develop a technique for construction using the implicit function theorem in a certain way. We show that the technique works for a large variety of trees, give examples and determine all possible multiplicities for a large class of trees for which this was not previously known.