On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

增强型延迟反馈法控制低维混沌系统的解析研究

基于时间延迟反馈控制混沌系统的方法,提出一种增强型控制方案,并利用分析延迟系统产生Hopf分支条件的方法,给出这种方案控制低维连续自治混沌系统时,在达到控制目标的条件下,控制参数的一般解析关系.将这一方案和分析方法应用到两个混沌模型中,结果表明:采用修正的方案可以明显地改善控制混沌的效果和质量;解析分析的结果与实际数值计算的结果一致. 关键词： 延迟反馈 混沌控制 Hopf分支     

On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization

In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints.     

Analysis of the manufacturing lead time in a production system with non-renewal batch input,threshold policy and post-operation

In this paper, we analyze the manufacturing lead time in a production system with BMAP (Batch Markovian Arrival process) input and post-operation operated under the N-policy. We use the factorization principle to derive the waiting time distribution (hence the manufacturing lead time) and the mean performance measures. A numerical example is provided.     

Mathematical topographical correction of XPS images using multivariate statistical methods

For rough heterogeneous samples, the contrast observed in XPS images may result from both changes in elemental or chemical composition and sample topography. Background image acquisition and subtraction are frequently utilized to minimize topographical effects so that images represent concentration variations in the sample. This procedure may significantly increase the data acquisition time. Multivariate statistical methods can assist in resolving topographical and chemical information from multispectral XPS images. Principal component analysis (PCA) is one method for identification of the highest correlation/variation between the images. Topography, which is common to all of the images, will be resolved in the first most significant component. The score of this component contains spatial information about the topography of the surface, whereas the loading is a quantitative representation of the topography contribution to each elemental/chemical image. The simple‐to‐use self‐modelling mixture analysis (Simplisma) method is a pure variable method that searches for the source of most differences in the data and therefore has the potential to distinguish between chemical and topographical phases in images. The mathematical background correction scheme is developed and validated by comparing results to the experimental background correction for samples with differing degrees of topography. Copyright © 2004 John Wiley & Sons, Ltd.     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

Evaluation formulas for Tornheim's type of alternating double series

In this paper, we give some evaluation formulas for Tornheim's type of alternating series by an elementary and combinatorial calculation of the uniformly convergent series. Indeed, we list several formulas for them by means of Riemann's zeta values at positive integers.

     

Second order parabolic equations in Banach spaces with dynamic boundary conditions

In this paper, we exhibit a unified treatment of the mixed initial boundary value problem for second order (in time) parabolic linear differential equations in Banach spaces, whose boundary conditions are of a dynamical nature. Results regarding existence, uniqueness, continuous dependence (on initial data) and regularity of classical and strict solutions are established. Moreover, several examples are given as samples for possible applications.