Engset multi‐rate state‐dependent loss models with QoS guarantee

We consider a single link loss system of quasi‐random input, described by the Engset multirate loss model (EnMLM). Blocked calls may once reattempt to be connected to the system requiring less bandwidth; then the system is described by the single retry model for finite sources (f‐SRM). The EnMLM and the f‐SRM are extended with the single threshold finite source model (f‐STM), where calls may attempt to be connected to the system with less bandwidth requirements, according to the link occupancy, before blocking occurs. We focus on CBP equalization in the EnMLM, f‐SRM and f‐STM, under the bandwidth reservation (BR) policy. For this analysis, we apply two approximate methods, the Roberts' method and the method of reverse transition rates (RTR), which lead to a recursive CBP calculation. We evaluate the accuracy of the above models under the BR policy by comparing the analytical with simulation CBP results, based on the relative approximation errors (RAE). The results are highly satisfactory because they show that the proposed models (formulas) lead to small RAE. Copyright © 2005 John Wiley & Sons, Ltd.     

Energy efficiency maximization resource allocation algorithm in wireless-powered backscatter communication network

In order to alleviate the energy consumption problem caused by the increasing number of Internet of things (IoT) nodes,an energy-efficient (EE) maximization based resource allocation algorithm was proposed for multi-carrier wireless-powered backscatter communication network.Firstly,a multivariable and nonlinear resource allocation model was formulated to jointly optimize transmit power,transmission time,reflection coefficient,and energy-harvesting allocation coefficient,where the maximum transmit power constraint of the power station and the minimum harvested energy constraint at the backscatter device were considered.Then,the original non-convex optimization problem was transformed into a convex one which was solved by using Dinkelbach’s method and the variable substitution approach.Furthermore,the analytical solution of the resource allocation problem was obtained based on Lagrange dual theory.Simulation results verify that the proposed algorithm has better EE by comparing it with the existing algorithm under pure backscatter mode and algorithm under the harvested-then-transmit mode.     

Allocation of jobs and identical resources with two pooling centers

We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above by the number of servers.      

Optimal asset allocation for pension funds under mortality risk during the accumulation and decumulation phases

In a financial market with one riskless asset and n risky assets whose prices are lognormal, we solve in a closed form the problem of a pension fund maximizing the expected CRRA utility of its surplus till the (stochastic) death time of a representative agent. We consider a unique asset allocation problem for both accumulation and decumulation phases. The optimal investment in the risky assets must decrease during the first phase and increase during the second one. We accordingly suggest it is not optimal to manage the two phases separately, and outsourcing of allocation decisions should be avoided in both phases. JEL: G23, G11 MSC 2000: 62P05, 91B28, 91B30, 91B70, 93E20     

Solving multiple-objective problems in the objective space

Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNP_q and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments.     

On the population monotonicity of independent set games

An independent set game is a cooperative game dealing with profit sharing in the maximum independent set problem. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition among its participants such that every participant is better off when the coalition expands. In this paper, we provide a necessary and sufficient characterization for independent set games admitting population monotonic allocation schemes. Moreover, our characterization can be verified efficiently.     

煤炭码头船货匹配下泊位动态分配多目标优化模型及算法

本文针对输出型煤炭码头船货匹配下泊位动态分配问题,构建了堆场-取装线-泊位-船舶联合分配优化数学模型,并设计了采用仿真推演策略解码的遗传算法求解。首先,综合考虑船舶、泊位、堆场、取装线、煤种、航道开放时间和装船作业规则等要素,以船舶在港时间最短和作业效率最大为目标建立了相应的多约束多目标优化模型。然后,综合多目标优化、遗传算法以及仿真推演技术,设计了相应的遗传算法求解,包括:组合式编码、采用仿真推演策略的解码方法,追加了具有合法性检查的染色体生成算法,设计了采用多种策略的遗传操作等。最后实例表明,本算法的执行效率高而且优化效果好。     

Estimation of a quantile in some nonstandard cases

A necessary condition for the asymptotic normality of the sample quantile estimator isf(Q(p))=F(Q(p))>0, whereQ(p) is thep-th quantile of the distribution functionF(x). In this paper, we estimate a quantile by a kernel quantile estimator when this condition is violated. We have shown that the kernel quantile estimator is asymptotically normal in some nonstandard cases. The optimal convergence rate of the mean squared error for the kernel estimator is obtained with respect to the asymptotically optimal bandwidth. A law of the iterated logarithm is also established.This research was partially supported by the new faculty award from the University of Oregon.     

一种基于电荷泵锁相环的快速啁啾发生器

调频连续波(FMCW)雷达常用于测量多个目标的距离和速度,被广泛用于自动驾驶场景中。FMCW雷达产生的线性调频波称为啁啾(Chirp),通常由锁相环(PLL)电路产生。由于带宽有限,传统锯齿啁啾下降时间过长,降低了雷达性能。文章提出了一种基于分段电流电荷泵的快速啁啾发生器设计方案。调频阶段采用最佳电荷泵电流,即最优环路带宽,可保证啁啾的线性度。啁啾下降阶段使用更大的电流,可缩短下降时间。仿真结果表明,啁啾发生器频率输出范围为19.25～20.25 GHz, 1.2 V电压下整体功耗为31.8 mW。PLL带宽为1.5 MHz时,锯齿形啁啾下降的最大调制速率为454 MHz/μs。与恒定电荷泵电流方式相比,下降时间缩短了80%。     

一种43 GHz超高带宽线性驱动电路设计

基于0.13μm SiGe BiCMOS工艺,设计了一种线性驱动电路。该电路具有高速和大摆幅的优势,能线性驱动行波马赫-曾德尔调制器(TW-MZM),可满足光通信系统100 Gbit/s单通道的应用需求。驱动电路包括连续时间线性均衡(CTLE)电路、可变增益放大(VGA)电路和基于Cascode结构改进优化的输出级电路,实现了增益可调,且避免发生由较大输出摆幅导致的晶体管击穿。仿真结果表明,电路的-3 dB带宽为43 GHz,其增益在15～25 dB内可调。在56 Gbaud NRZ/PAM4的输入信号下,测得的眼图形状良好,差分输出摆幅峰-峰值达4 V,电路整体功耗为1.02 W,面积为0.33 mm²。