POSITIVE SOLUTIONS OF SINGULAR SUBLINEAR SECOND ORDER BOUNDARY VALUE PROBLEMS

1.IntroductionBoundaryvaluepr0blemsconcerningthegeneralizedEmden-F0wlerequationsx p(t)x'=O,(1)wherep(t)eC(O,1),p(t)20f0rtE(O,1),AER,havebeenstudiedbymanyauthors(see[1-51andthereferencestherein).InthispaperwetreattheDirichletproblem(1)withax(0)-bx'(0)=O,c…     

群决策的交互式TOPSIS方法及其应用

建立了一种多轮交互逐步逼近满意解的多属性群体决策的综合方法,对决策方案采用扩展的 TOPSIS(technique for order preference by similarity to ideal solution)法进行定性评价排序,以克服一类难以建立解析模型,分析求解困难的多属性群决策问题;设计了群体满意度等软指标来分析计算,判断群体一致性的达成,最终得出群体满意的方案排序.通过应用实例,说明了该方法的有效性和可行性,初步提出了可作为建立一类实际的群决策支持系统的方法和技术框架.     

The M/PH/1 queue with working vacations and vacation interruption

We study an M/PH/1 queue with phase type working vacation and vacation interruption where the vacation time follows a phase type distribution. The server serves the customers at a lower rate in a vacation period. The server comes back to the regular busy period at a service completion without completing the vacation. Such policy is called vacation interruption. In terms of quasi birth and death process and matrix-geometric solution method, we obtain the stationary queue length distribution. Moreover we obtain the conditional stochastic decomposition structures of queue length and waiting time when the service time distribution in the regular busy period is exponential.     

语境驱动的仿真模型测试方法论

组合模型的有效性验证是利用模型组合实现仿真系统快速开发的迫切需求,也是组合仿真理论和方法研究的一个重要问题.在分析组合模型抽象层次的基础上讨论了不同层次组合有效性的研究内容,并针对组合模型的行为从测试的角度提出了语境驱动的仿真模型测试方法论,重点讨论了方法论中语境的概念、语境驱动的测试框架生成以及测试框架的嵌入和运行时刻检验等内容,目的是判断仿真模型及其组合行为是否忠实反映了设计信息,实现了行为无错的演化.     

Preface

Different from traditional tax audit, supervision with self-audit is a combination of audit by the taxpayer himself and audit by the tax authority. This paper mainly studies a taxpayer’s optimal policy of tax evasion under supervision with self-audit and its related properties, in order to deduce some effective suggestions and theoretical bases to restrain tax evasion. Assuming that only a certain proportion of evaded tax can be discovered when the audit is executed, the authors first formulate a static model with self-audit. This model is divided into two stages. At the first stage, taxpayers declare their taxes, then the tax authority chooses audit objects, based on a known probability, and announces the result; if the taxpayer is chosen, he will enter the second stage, during which he has a chance to pay the evaded tax and the corresponding late fees and then is audited by the tax authority. The authors show the existence and uniqueness of the optimal amount of tax evasion at the first stage and the optimal proportion to self-expose at the second stage. The authors also discuss the related properties of the interior solution, and do elasticity analyses on some parameters. Besides, the authors extend the static model into the corresponding two-period model, and study the existence and uniqueness of the solution of the extended model. Finally, under the assumption that tax evasion can only be discovered with a certain probability when the audit is executed, the authors formulate another static model with self-audit and investigate its properties. This research is partially supported by the National Natural Science Foundation of China under Grant Nos. 60674082, 70221001, and 70731003.     

Tax Evasion: Models with Self-Audit

Different from traditional tax audit, supervision with self-audit is a combination of audit by the taxpayer himself and audit by the tax authority. This paper mainly studies a taxpayer＇s optimal policy of tax evasion under supervision with self-audit and its related properties, in order to deduce some effective suggestions and theoretical bases to restrain tax evasion. Assuming that only a certain proportion of evaded tax can be discovered when the audit is executed, the authors first formulate a static model with self-audit. This model is divided into two stages. At the first stage, taxpayers declare their taxes, then the tax authority chooses audit objects, based on a known probability, and announces the result; if the taxpayer is chosen, he will enter the second stage, during which he has a chance to pay the evaded tax and the corresponding late fees and then is audited by the tax authority. The authors show the existence and uniqueness of the optimal amount of tax evasion at the first stage and the optimal proportion to self-expose at the second stage. The authors also discuss the related properties of the interior solution, and do elasticity analyses on some parameters. Besides, the authors extend the static model into the corresponding two-period model, and study the existence and uniqueness of the solution of the extended model. Finally, under the assumption that tax evasion can only be discovered with a certain probability when the audit is executed, the authors formulate another static model with self-audit and investigate its properties.     

Primary Structural and Quantitative Analysis of Infeasible Solution to Job shop Scheduling Problem

1　IntroductionTheJobShopSchedulingProblemisawell-knownNP-hardproblem,whichattractslotsofmathematiciansallovertheworldspendingmuchtimeandenergyinthisfield.Uptonowtherearemanyefficientheuristicalgorithms,whichhadalreadybeendeveloped,buttheinfeasiblesolutioncertainlypossessesthemajorityofsearchspacewhichhasinfluencedtheefficiencyofthesealgorithms.Atthemoment,noonehasbeenfoundtobededicatingtothequantitativeanalysisoftheinfeasiblesolutionproblem.InthispaperthestructureofinfeasiblesolutiontoJSS…     

单重延误休假的M~x/G(M/G)/1可修排队系统分析(Ⅰ)—— 一些排队指标

考虑具有单重延误休假的MxG(MG)1可修排队系统,其中休假时间、服务时间、修理时间和延误休假时间都为任意分布(不一定是连续型),采用一种较简洁的方法,我们获得队长的瞬态解、平稳解和队长的随机分解表达式,同时给出了一些特殊情形下队长的随机分解结果     

递推加权最小二乘算法的研究

通常在使用递推加权最小二乘算法时,需要设计矩阵列满秩.从极限理论的角度出发,对设计矩阵列不满秩时加权最小二乘估计的递推算法进行了理论证明和分析,得出了在任意第n步,未知参数估计值收敛于由前n组数据所决定的极小范数加权最小二来解,并且此解是唯一的,仿真结果同样验证了该结论的正确性.     

一种多目标优化问题的混合优化算法

利用分布估计算法(EDA)的全局搜索性能及差分进化(DE)算法的局部优化能力,提出了一种多目标优化问题的混合智能求解方法DE-EDA.DE-EDA的子代个体由两部分构成,一部分按差分进化算法生成,另一部分则是通过对分布估计算法的概率模型进行随机采样生成.利用模拟退火技术在线调整尺度因子Pr,即在进化的初期选择较大的Pr,以保证EDA起主导作用,由EDA引导DE搜索向Pareto前端,增加全局搜索能力,然后在进化的过程中逐渐降低Pr,使得DE逐渐占据主导作用,确保解精确收敛到Pareto前端.通过4组基准函数来测试算法性能,并与NSGA-Ⅱ和DE算法进行实验比较,结果表明该方法不仅解的多样性和分布性好,而且能够有效提高种群进化的收敛速度,是一种求解多目标优化问题的有效方法.