Queue Size Distribution of Geo/G/1 Queue Under the Min(N,D)-Policy

This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D,whichever occurs first(Min(N,D)-policy).By using renewal process theory and total probability decomposition technique,the authors study the transient and equilibrium properties of the queue length from the beginning of the arbitrary initial state,and obtain both the recursive expression of the z-transformation of the transient queue length distribution and the recursive formula for calculating the steady state queue length at arbitrary time epoch n~+.Meanwhile,the authors obtain the explicit expressions of the additional queue length distribution.Furthermore,the important relations between the steady state queue length distributions at different time epochs n~-,n and n~+ are also reported.Finally,the authors give numerical examples to illustrate the effect of system parameters on the steady state queue length distribution,and also show from numerical results that the expressions of the steady state queue length distribution is important in the system capacity design.     

复杂系统的演化过程,n(n-1)律,自聚集

研究一类复杂系统的演化过程,给出一个网络模型,由此导出f(n)=n(n-1),用以在某种程度上定性地描写演化过程中聚集与功能变化的规律。这里n表示agents的聚集数量。熟知的关系式1+1>2是n=2时的特例。当n为小数时,n的增减对系统整体功能的影响显著,此情况将称为“小n机制”。当n充分大时,系统的整体功能将有大跃升,并可用n2度量,称此为“n2效应”。一般情况下,n(n-1)描写聚集-相互作用-功能跃升的模式,用此模式可对不同领域的演化过程作某种解释。     

A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK

In this paper, a new routing algorithm is given for the shuffle-exchange permutation network （SEPn）. The length of the path between any two nodes given by our algorithm is not more than 11/16n^2＋O（n）, i.e., the diameter of SEPn is at most 11/16n^2＋ O（n）. This improves on a 1/8（9n^2- 22n＋24） routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 1/2n^2-n.     

吉林西部盐碱化苇塘养殖生态工程研究——牛心套保湿地盐碱水环境对虾生长与阳离子组成的关系

采用盐碱水生长试验,研究凡纳滨对虾（Litopenaeus vannamei）生长与水环境K＋、Ca^2＋、Mg^2＋、Na^＋/K^＋和M/D（离子系数）的关系,探讨盐碱化苇塘养殖对虾技术。结果表明,在碱度、盐度和pH分别为10.32 mmol.L-1～38.50 mmol.L-1,0.102%～0.334%及8.5～9.5的盐碱水中,幼虾27 d的体质量特定生长率（SGRW）无显著性差异（P〉0.05）,平均为（3.16±0.41）%.d-1。SGRW与阳离子组成因子的简单相关性都存在其他因子不显著（P〉0.05）的影响效应。SGRW分别与K＋质量浓度的偏相关性不显著（P〉0.05）,与Ca^2＋、Mg^2＋质量浓度的偏相关性显著（P〈0.05）,与Na^＋/K^＋、M/D（离子系数）的偏相关性极显著（P〈0.01）。SGRW分别与M/D及Mg^2＋质量浓度的偏回归关系显著（P〈0.05）,与Na＋/K＋极显著（P〈0.01）,与K^＋、Ca^2＋不显著（P〉0.05）。盐碱水环境中Mg^2＋、Na^＋/K＋及M/D（离子系数）共同影响对虾的生长;添加CaCl有利于苇塘养虾。     

一种针对大规模数据集的快速分组算法

基于空间点集的连通性构造的等价关系,提出一种针对大规模数据集的快速分组算法。该算法的本质仍是基于等价关系的集合划分算法,但在关系矩阵传递闭包的构造算法中,提出一种快速的实现方法。与传统等价关系的构造方法相比,新算法需要较少的存储空间,而且算法复杂度由O(n3)降为O(km2)(k n,m≈n)。在医学断层图像表面重建的应用中证实,新算法具有重要的应用价值。     

STRONG UNIFORM CONSISTENCY RATES FOR CONDITIONAL FUNCTION ESTIMA TORS WITH ■-MIXING SAMPLE

Strong uniform consistency rates are given for kernel type estimatorsof the conditional function with (?)-mixing sample.Especially,for nonparametricestimators of kernel density,the regression function when Y is bounded,conditionaldf's,L-smoothing and M-smoothing,we obtain the same rate O((n/log n)~(-1/3))as in the i.i.d.sample established by H(?)rdle,Janssen and Serfling.     

The Structure of Departure Process and Optimal Control Strategy N~* for Geo/G/1 Discrete-Time Queue with Multiple Server Vacations and Min(N,V)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n~+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0~+, n~+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.     

Recursive Solution of Queue Length Distribution for Geo/G/1 Queue with Delayed Min(N,D)-Policy

In this paper we consider a discrete-time Geo/G/1 queue with delayed Min(N, D)-policy.Using renewal process theory, total probability decomposition technique and z-transform, we study the transient and equilibrium properties of the queue length from an arbitrary initial state, and obtain both the recursive expressions of the transient state queue length distribution and the steady state queue length distribution at arbitrary time epoch n~+. Furthermore, we derive the important relations between equilibrium queue length distributions at different time epochs n~-, n and n~+. Finally, we give some numerical examples about capacity decision in queueing systems to demonstrate the application of the analytical results reported in this paper.     

机场停机位分配问题的图着色模型及其算法

停机位分配作业关系到整个机场的系统运作,其作用相当重要。通过对停机位分配的分析,把停机位的分配转化为图着色,建立停机位分配问题的图着色模型,并引入时间片算法确定航班使用机位的时间冲突集合,根据"先到先服务"的原则给出了停机位分配的顶点序列着色算法,该算法的计算复杂性为O(n2k2),最后将该算法应用于一个算例。     

IDENTIFICATION FOR WIENER SYSTEMS WITH INTERNAL NOISE*

This paper considers identification of Wiener systems for which the internal variables and output are corrupted by noises. When the internal noise is a sequence of independent and identically distributed （lid） Gaussian random variables, by the Weierstrass transformation （WT） the system under consideration turns to be a Wiener system without internal noise. The nonlinear part of the latter is nothing else than the WT of the nonlinear function of the original system, while the linear subsystem is the same for both systems before and after WT. Under reasonable conditions, the recursive identification algorithms are proposed for the transformed Wiener system, and strong consistency for the estimates is established. By using the inverse WT the nonparametric estimates for the nonlinearity of the original system are derived, and they are strongly consistent if the nonlinearity in the original system is a polynomial, Similar results also hold in the case where the internal noise is non-Gaussian. Simulation results are fully consistent with the theoretical analysis.     

一个批处理机随机E/ T 调度问题研究

对批处理机随机E/T(earliness and tardiness)调度问题,假设各批的加工时间独立同分布;各工件的交付期相互独立,并与加工时间独立;目标是极小化所有工件的提前与延迟时间和的均值.在加工时间和工件的交付期都服从指数分布的条件下,得到了最优调度的几个性质,基于这些性质用动态规划给出了一个求问题最优解的算法,此算法的时间复杂度为O(n2B2)(B相似文献   

含结点等待费用的离散时变最短路径

研究了结点等待费用、弧费用和弧通过时间均为离散时变函数的最短路径问题.基于动态规划原理,给出了一种标号更新算法,可在O(n3M3)时间复杂度内求出所有结点到指定终点的最小费用路径,其中n为网络结点数、M为时间间隔数.     

二值序列偶及其在低相关区序列偶集中的应用

利用差集偶与二值序列偶的等价关系,证明了异相自相关值为-1的二值序列偶等价对应的差集偶存在的必要条件,并结合特征多项式法构造出(3+2d,2,2+d,2,1)型和(6λ-5,3λ-1,2λ-1,λ+1,λ)型几类差集偶。由该差集偶获得的二值序列偶可应用于低相关区序列偶集的构造,即通过对二值序列偶的循环移位变换构造出低相关值为-1,低相关区长为移位长度L_cz,序列偶数量小于最大低相关区长度N-1与移位长度L_cz之比的最大整数的低相关区序列偶集。     

单增序列灰色GM(1,1)模型解之间的误差分析

针对单调增长原始数据序列, 文章在理论上讨论白化型与内涵型GM(1,1)(grey forecasting model)模型解之间的相对误差. 在推导出两个模型解之间的相对误差上界表达式的基础上, 作者研究了相对误差上界函数的性质, 讨论了相对误差一致上界关于原始数据序列长度n的单调性. 结果表明当发展系数位于[-1/(n+1),0]内时, 白化型与内涵型GM(1,1)模型解之间的相对误差上界是0.9%,可以合理使用白化模型代替内涵模型; 而发展系数在区间[-2/(n+1),0]内时, 这两个模型解之间的相对误差可能达到8.64%, 此时白化模型代替内涵模型须较谨慎地使用.     

基于物理效应分析和非线性度量混合建模策略

对于存在多变量、非线性的现代复杂系统,混合建模策略是获得准确、可靠模型的有效手段之一。在现有混合建模方法中,缺乏对先验模型和非参数模型建模目标的清晰界定,且在分析非参数模型时,对线性化方法的选择也缺乏统一的标准。针对上述问题,以四旋翼飞行器为应用对象,提出一种基于物理效应分析和非线性度量的混合建模策略,根据各类物理效应对飞行姿态的影响程度界定先验模型和非参数模型的建模目标,并根据各类物理效应的非线性程度运用模糊推理算法选择合适的线性化方法。实验结果证明了混合模型的可靠性和建模准确性。     

负顾客、带启动期和备用服务员的M/M/1休假排队系统

考虑一类有正、负顾客, 带启动期和有备用服务员的M/M/1休假排队系统. 负顾客一对一抵消队尾的正顾客(若有), 若系统中无正顾客, 到达的负顾客自动消失, 负顾客不接受服务.系统中两个服务员, 其中一个在岗工作时另外一个备用.上岗服务员若因为某种原因休假, 备用服务员立即替换上岗.当系统变空时, 系统关闭.用拟生灭过程和矩阵几何解方法, 得到了稳态队长的分布, 此外, 证明了稳态条件下队长的条件随机分解并得到了附加队长的分布. 最后, 通过两个数值例子说明该模型可以较好的模拟一些实际问题.     

基于非线性输入控制实现受扰混沌系统同步

针对一类受扰混沌系统的同步控制,采用具有扇区非线性输入的自适应滑膜变结构控制器,设计了相应的控制律和自适应律。在该控制器的作用下,实现了驱动系统和响应系统的同步控制,且不受扇区非线性输入、参数失配及外部干扰的影响,具有有很强的鲁棒性。所设计的控制策略简单,易于实现,而且没有强加在系统上的限制条件,因此应用范围较广。理论分析和数值仿真证明了该方法的有效性。     

我国人口量度变化率的非参数统计分析──兼评人口控制政策实施绩效及目标

我国人口量度变化率的非参数统计分析──兼评人口控制政策实施绩效及目标范金（扬州大学工学院，２２５００１）ＮｏｎｐａｒａｍｅｔｒｉｃＳｔａｔｉｓｔｉｃＡｎａｌｙｓｉｓｏｆＣｈｉｎａ＇ｓＦａｎＪｉｎ（ＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｌｏｇｙｏｆＹａｎｇ...     

合成孔径雷达相干与非相干干扰性能分析

推导了合成孔径雷达(synthetic aperture radar,SAR)非相干干扰、一维卷积干扰和二维相干干扰成像前后的功率表达式,建立了成像处理增益(imaging processing gain,IPG)关于SAR系统参数和干扰区面积的关系模型和干信比(interference-signal power rate, ISR)方程。分析结果表明,在一定范围内,相干干扰的IPG随干扰区面积增大而减小,当一维卷积干扰的干扰区宽度大于SAR成像前距离分辨率时,其IPG与非相干干扰相同,当二维相干干扰的干扰区宽度和长度分别大于SAR成像前距离分辨率和方位分辨率时,其IPG与非相干干扰之比等于方位过采样率,3种干扰的ISR与IPG具有相同特性。仿真验证分析了所得出的结论。     

复杂网络中节点重要度评估的节点收缩方法

首先定义了网络的凝聚度,在此基础上提出了一种评估复杂网络节点重要度的节点收缩方法,认为最重要的节点就是将该节点收缩后网络的凝聚度最大,其算法的时间复杂性为O(n3).该方法综合考虑了节点的连接度以及经过该节点最短路径的数目,克服了节点删除法的弊端.最后的实验分析表明该方法直观、有效且运算速度快,对于大型复杂网络可以获得理想的计算能力.