Computational error analysis of periodic solutions for singular semilinear parabolic problems

By using the monotone method, a theoretical and computational method is given to find, to the degree of accuracy desired, approximate solutions of a class of singular semilinear parabolic problems. So that the error between the actual solution and its approximation is within a given error tolerance, the number of iterations is determined. Since each iterate is in terms of an infinite series, the number of terms to be retained in each iterate is determined so that its error from the exact iterate is within a given error tolerance. An improved rate of convergence is then given to show that it is possible to reduce the number of terms retained in each iterate. An algorithm is also described to obtain numerical solutions. For illustration of the computational methods developed, a numerical example is given.     

AR（p）模型中的缺失数据估计

运用EM算法,对含有缺失数据的AR（p）模型进行参数估计,通过最大似然准则就非左端缺失的情况进行插补.最后,用蒙特卡洛方法给出实验分析,表明如下结果：（i）误差与AR模型的阶数正相关,与缺失比例正相关;（ii）当AR模型的特征根模长相对较小时,误差与数据长度负相关,且误差被控制在了标准差的30％以内;（iii）当模长中等时,误差基本控制在1个标准差左右;（iv）当模长较大时,误差与数据长度正相关,而且误差也相对较大.     

Truncated Smoothing Newton Method for l_∞ Fitting Rotated Cones

In this paper, the rotated cone fitting problem is considered. In case the measured data are generally accurate and it is needed to fit the surface within expected error bound, it is more appropriate to use l∞ norm than l2 norm. l∞ fitting rotated cones need to minimize, under some bound constraints, the maximum function of some nonsmooth functions involving both absolute value and square root functions. Although this is a low dimensional problem, in some practical application, it is needed to fitting large...     

3PLS物流设施网络评价的模糊数据包络方法

3PLS物流设施布局直接关系到企业的战略和运作两个层面,对若干初始方案进行评价是保证物流设施布局方案有效性的前提.针对物流设施布局方案评价问题的同质性和模糊性特征,利用三角模糊数表示评价过程中的模糊不确定因素,并提出基于模糊数据包络方法的方案评价框架.通过对算例的评价应用,说明了方法的合理性和有效性.     

一种改进的蚁群算法及其在TSP中的应用

蚁群算法是一种求解复杂组合优化问题的新的拟生态算法,也是一种基于种群的启发式仿生进化算法,属于随机搜索算法的一种,并用于较好地解决TSP问题.然而此算法也有它自己的缺陷,如易于陷入局部优化、搜索时间长等.通过对基本蚁群算法的介绍及相关因素的分析,提出了一种改进的蚁群算法,用于解决TSPLAB问题的10个问题,并与参考文献中的F-W、NCSOM、ASOM算法进行比较,计算机仿真结果表明了改进算法的有效性.如利用改进的蚁群算法解决lin105问题,其最优解为14382.995933(已知最优解为14379),相对误差是0.0209%,计算出的最小值几乎接近于已知最优解.     

A probabilistic programming model for blending aggregates

The paper introduces the formulation of a probabilistic programming model to find the optimum mix proportion of aggregates to meet the specific grading requirement in order to minimize the cost which consists of the material cost and the expected penalty cost. The model is probabilistic since the gradation, which is the major parameter, is a random variable. A linear programming model is first formulated. Using the LP solution as initial value, a direct search technique is then employed to solve the problem. The model is expected to be applicable to any problem of aggregates blending. In this paper, however, the mixing aggregates of an asphalt mixing plant is exemplified to test the applicability of the model.     

The Place of Logic in Reasoning

Reasoning is a goal-oriented activity. The logical steps are at best the median part of a full reasoning: before them, a language has to be defined, and a model of the goal in this language has to be developed; after them, their result has to be checked in the real world with respect to the goal. Both the prior and the subsequent steps can be conducted rationally; none of them has a logical counterpart. Furthermore, Logic aims at prescribing what a correct reasoning is. But correct with respect to what? If the answer is: with respect to truth, the next question is whether the truth in everyday life, physics, economy, is the same as the truth that logicians have in mind. Resorting to Logic is justified only if an idealization in terms of true propositions in the logical sense is compatible with the goal. If such an idealization is legitimate, so is the use of classical Logic. If not, there is no authority forbidding to skew Logic in order to better reflect the nature of the reasoning required for the task.     

A probabilistic inventory model for deteriorating items with lead time equal to one scheduling period

A probabilistic inventory model for continuously deteriorating items is developed, in which the lead time is assumed to be of one scheduling period, shortages are not allowed, time is treated as discrete variable, and deterioration is assumed to be a constant fraction of the on hand inventory. The developed model is related to the EOQ model for deteriorating items. An example is given to illustrate the derived results.     

基于熵的群决策专家选择研究

群决策是研究多人如何做出统一的有效抉择.在群决策中专家决策水平直接反应到决策结论上,是影响事业的成败关键,因此专家的选择对于群决策而言是至关重要的.建立了评价群决策专家的指标集,从专家选择角度定义了理想专家,给出了专家选择的熵模型,并通过一个例子说明该模型的有效性.     

The ANALYZE rulebase for supporting LP analysis

This paper describes how to design rules to support linear programming analysis in three functional categories: postoptimal sensitivity, debugging, and model management. The ANALYZE system is used to illustrate the behavior of the rules with a variety of examples. Postoptimal sensitivity analysis answers not only the paradigmWhat if …? question, but also the more frequently askedWhy …? question. The latter is static, asking why some solution value is what it is, or why it is not something else. The former is dynamic, asking how the solution changes if some element is changed. Debugging can mean a variety of things; here the focus is on diagnosing an infeasible instance. Model management includes documentation, verification, and validation. Rules are illustrated to provide support in each of these related functions, including some that require reasoning about the linear program's structure. Another model management function is to conduct a periodic review, with one of the goals being to simplify the model, if possible. The last illustration is how to test new rule files, where there is a variety of ways to communicate a result to someone who is not expert in linear programming.     

旋转锥面$l_\infty$拟合的截断光滑化牛顿法

In this paper, the rotated cone fitting problem is considered. In case the measured data are generally accurate and it is needed to fit the surface within expected error bound, it is more appropriate to use l∞ norm than 12 norm. l∞ fitting rotated cones need to minimize, under some bound constraints, the maximum function of some nonsmooth functions involving both absolute value and square root functions. Although this is a low dimensional problem, in some practical application, it is needed to fitting large amount of cones repeatedly, moreover, when large amount of measured data are to be fitted to one rotated cone, the number of components in the maximum function is large. So it is necessary to develop efficient solution methods. To solve such optimization problems efficiently, a truncated smoothing Newton method is presented. At first, combining aggregate smoothing technique to the maximum function as well as the absolute value function and a smoothing function to the square root function, a monotonic and uniform smooth approximation to the objective function is constructed. Using the smooth approximation, a smoothing Newton method can be used to solve the problem. Then, to reduce the computation cost, a truncated aggregate smoothing technique is applied to give the truncated smoothing Newton method, such that only a small subset of component functions are aggregated in each iteration point and hence the computation cost is considerably reduced.     

Non-Convex Strong Duality Via Subdifferential

In this article, the strong duality is treated. It is shown that the strong duality is equivalent to the non-emptiness of the subdifferential of a sort map involving the constraint functions. It is also noted that this technique is useful to verify the Assumption S. Indeed, the linearity of a constraint function h is not required as usually seen in the literature. Moreover, it is shown that this condition is easer to verify in the applications. We apply this new principle to the bi-obstacle problem, to the elastic-plastic torsion problem and to the continuum model of transportation.     

On hypothesis testing with a partitioned random alternative

It is common in statistical practice that one needs to make a choice among m + 1 mutually exclusive claims on distributions.When m=1,it is done by the (traditional) hypothesis test.In this paper,a generalization to the case m > 1 is proposed.The fundamental difference with the case m=1 is that the new alternative hypothesis is a partition of m multiple claims and is data-dependent.Data is used to decide which claim in the partition is to be tested as the alternative.Thus,a random alternative is involved.The...     

Economic lot scheduling with deliberated and controlled coproduction

This paper presents an algorithm to define the optimal parameters for deliberated and controlled coproduction in an economic lot scheduling problem setting (DCCELSP). Coproduction is said to be deliberated and controlled because it is possible to decide whether or not to coproduce when all the parameters associated with the process are known. The aim is to determine how to produce two products most economically where deliberated coproduction is an option. For this purpose, a procedure for defining optimal lot periods is introduced. Two models are proposed for this procedure and a numerical illustration is provided to gain insight into their dynamics. The cost advantages of coproduction were found to depend on the relationship between setup and holding costs, production rates, and demand for products. The more similar these system parameters are and the higher the machine usage ratio is, the more favourable coproduction is. Additionally, if coproduction is not deliberated appropriately, costs soar.     

双参数指数分布的可靠寿命的广义置信下限

基于双参数指数分布定数截尾数据,利用Weerahanandi给出的广义置信区间的概念,建立了可靠寿命的广义置信下限,并从理论上证明了我们给出的广义置信下限是精确的,即基于广义置信下限的区间估计的覆盖率等于要求的置信水平.广义置信下限需要通过数值方法得到,但是计算方法是简单直接的.在小样本情形下,通过对基于广义置信下限的置信区间与Engelhardt-Bain近似置信区间覆盖率的模拟比较,发现广义置信下限更令人满意.     

A Study on Abnormality in Variational and Optimal Control Problems

In this paper, a variational problem is considered with differential equality constraints over a variable interval. It is stressed that the abnormality is a local character of the admissible set; consequently, a definition of regularity related to the constraints characterizing the admissible set is given. Then, for the local minimum necessary conditions, a compact form equivalent to the well-known Euler equation and transversality condition is given. By exploiting this result and the previous definition of regularity, it is proved that nonregularity is a necessary and sufficient condition for an admissible solution to be an abnormal extremal. Then, a necessary and sufficient condition is given for an abnormal extremal to be weakly abnormal. The analysis of the abnormality is completed by considering the particular case of affine constraints over a fixed interval: in this case, the abnormality turns out to have a global character, so that it is possible to define an abnormal problem or a normal problem. The last section is devoted to the study of an optimal control problem characterized by differential constraints corresponding to the dynamics of a controlled process. The above general results are particularized to this problem, yielding a necessary and sufficient condition for an admissible solution to be an abnormal extremal. From this, a previously known result is recovered concerning the linearized system controllability as a sufficient condition to exclude the abnormality.     

Self-triggered filter design for a class of nonlinear stochastic systems with Markovian jumping parameters

This paper is concerned with the self-triggered filtering problem for a class of Markovian jumping nonlinear stochastic systems. The event-triggered mechanism (ETM) is employed between the sensor and the filter to reduce unnecessary measurement transmission. Governed by the ETM, the measurement is transmitted to the filter as long as a predefined condition is satisfied. The purpose of the addressed problem is to synthesize a filter such that the dynamics of the filtering error is bounded in probability (BIP). A sufficient condition is first given to ensure the boundedness in probability of the filtering error dynamics, and the characterization of the desired filter gains is then realized by means of the feasibility of certain matrix inequalities. Furthermore, a self-triggered mechanism is designed to guarantee the filtering error dynamics to be BSP with excluded Zeno phenomenon. In the end, numerical simulation is carried out to illustrate the usefulness of the proposed self-triggered filtering algorithm.     

基于模糊数的模糊事件概率的结构元表示

Zadeh[1]定义了在概率清晰和事件模糊条件下,模糊事件的概率表示.不过,用[1]表示概率,求解繁杂且困难.为此,利用结构元理论,定义了模糊数事件概率的表达式.不仅证明其与经典定义等价,且证明了模糊数事件复合表达形式.最后,给出了关于模糊数不等式的概率的表达式.通过算倒可看出,运用本方法求解模糊数事件概率比较简捷.     

连续区间数的中位算子及其灵敏度分析

研究决策信息以区间数形式给出的方案决策问题。考虑到区间数非均匀分布的特点,为避免区间极端值在区间数确定中产生较大误差,本文将中位数概念运用到区间数的确定上,提出OIP(Ordered Interval Point)有序中位算子。取单位区间单调函数(BUM函数)为二分之一所表示的值为权重,将区间数确定为一个实数,并研究算子单调性和有界性的初等运算性质。通过比较OIP算子与COWA算子对态度参数和区间长度的反应灵敏度,获得了在一定条件下OIP算子对态度参数反应更稳健,对区间长度反应更灵敏的结论。最后用算例证明该算子的可行性和有效性。     

(<Emphasis Type="Italic">T</Emphasis>, <Emphasis Type="Italic">S</Emphasis><Subscript><Emphasis Type="Italic">i</Emphasis></Subscript>) Policy Inventory Model for Deteriorating Items with Time Proportional Demand

An EOQ model is reconsidered here in which the demand rate is changing linearly with time and the deterioration is assumed to be a constant fraction of the onhand inventory. The planning horizon is finite and known and the replenishment periods are assumed to be constant. The problem is to find the optimal number of replenishments, which are instantaneous. When there is no deterioration, the model developed is related to the corresponding model for nondeteriorating items. An example followed by sensitivity analysis is given to illustrate the derived results.