On Cesari's property (Q)

In the present paper, we generalize, within the family of convex-valued multifunctions, a selection theorem of Cole (Ref. 1). This then leads us to prove some new results concerning Cesari's property (Q) and to the introduction of the Cesari limit of sets, which is then compared to the Kuratowski-Mosco limit.This work was done while the author was a visiting professor at the University of Pavia, Pavia, Italy. Financial support was provided by CNR and by NSF Grant No. 84-03135.     

基于透光性能分析的微藻光生物反应器构筑板材选型

利用配备人工光源的光生物反应器(AL-PBR)培养微藻是实现微藻快速增殖,进而满足相关产业需求的重要手段。为指导AL-PBR的构筑材质选型,完善了现有方法,比选了7种市售透明板材。考虑到微藻在不同入射光波段的光生态学,应综合分析板材在光合有效辐射波段(400~700nm)、红光波段(630~700nm)、蓝光波段(430~480nm)和中波紫外线波段(UV-B,280~320nm)的透光性能。前三波段的平均透射率越高越好,UV-B波段反之。测定结果表明:如果AL-PBR以太阳光作为外部光源,现阶段宜采用进口聚碳酸酯板和普通玻璃板作为构筑材质,且前者更佳;如果以单色LEDs灯或荧光灯作为外部光源,宜选用聚甲基丙烯酸甲酯板。     

Selecting distances in arrangements of hyperplanes spanned by points

In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k, , determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(nlog²n) runtime algorithm using parametric search partly different from the usual approach [N. Megiddo, J. ACM 30 (1983) 852]. We establish a connection between this problem in 3-d and the well-known 3SUM problem using an auxiliary problem of counting the number of vertices in the arrangement of n planes that lie between two sheets of a hyperboloid. We show that the 3-d problem is almost 3SUM-hard and solve it by an O(n²log²n) runtime algorithm. We generalize these results to the d-dimensional (d4) space and consider also a problem of enumerating distances.     

电子政务系统中面向公众的个性化信息服务模型

电子政务作为Internet的主要应用领域，已受到世界各国的普遍关注。面对公众各种服务需求日趋个性化，如何打破政府职能机构的条块分割，构建一个一体化的虚拟政府，集成各类信息资源，为公众提供“一站式”的、个性化的服务，是当前电子政务理论和实践的热点课题。本文首先提出一个面向公众的“一站式”服务总体框架；其次，将个性化信息服务的概念引入到电子政务系统中，构建一个个性化信息服务模型；最后，运用数据挖掘技术对模型中的关键技术加以实现。     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

Gated Polling Systems with Lévy Inflow and Inter-Dependent Switchover Times: A Dynamical-Systems Approach

We study asymmetric polling systems where: (i) the incoming workflow processes follow general Lévy-subordinator statistics; and, (ii) the server attends the channels according to the gated service regime, and incurs random inter-dependentswitchover times when moving from one channel to the other. The analysis follows a dynamical-systems approach: a stochastic Poincaré map, governing the one-cycle dynamics of the polling system is introduced, and its statistical characteristics are studied. Explicit formulae regarding the evolution of the mean, covariance, and Laplace transform of the Poincaré map are derived. The forward orbit of the maps transform – a nonlinear deterministic dynamical system in Laplace space – fully characterizes the stochastic dynamics of the polling system. This enables us to explore the long-term behavior of the system: we prove convergence to a (unique) steady-state equilibrium, prove the equilibrium is stationary, and compute its statistical characteristics.     

基于径向基函数网络的虚拟物流企业伙伴选择方法研究

在对虚拟物流企业系统研究的基础上 ,针对虚拟物流企业伙伴选择问题的特点 ,给出了一个面对虚拟物流企业伙伴选择问题的较为全面的选择过程框架 .并提出了一个基于径向基函数网络算法的虚拟物流企业伙伴选择模型 ,实例仿真说明了该算法和模型的有效性 .     

Falling and explosive,dormant, and rising markets via multiple‐regime financial time series models

A multiple‐regime threshold nonlinear financial time series model, with a fat‐tailed error distribution, is discussed and Bayesian estimation and inference are considered. Furthermore, approximate Bayesian posterior model comparison among competing models with different numbers of regimes is considered which is effectively a test for the number of required regimes. An adaptive Markov chain Monte Carlo (MCMC) sampling scheme is designed, while importance sampling is employed to estimate Bayesian residuals for model diagnostic testing. Our modeling framework provides a parsimonious representation of well‐known stylized features of financial time series and facilitates statistical inference in the presence of high or explosive persistence and dynamic conditional volatility. We focus on the three‐regime case where the main feature of the model is to capturing of mean and volatility asymmetries in financial markets, while allowing an explosive volatility regime. A simulation study highlights the properties of our MCMC estimators and the accuracy and favourable performance as a model selection tool, compared with a deviance criterion, of the posterior model probability approximation method. An empirical study of eight international oil and gas markets provides strong support for the three‐regime model over its competitors, in most markets, in terms of model posterior probability and in showing three distinct regime behaviours: falling/explosive, dormant and rising markets. Copyright © 2009 John Wiley & Sons, Ltd.     

Robust optimization and portfolio selection: The cost of robustness

Robust optimization is a tractable alternative to stochastic programming particularly suited for problems in which parameter values are unknown, variable and their distributions are uncertain. We evaluate the cost of robustness for the robust counterpart to the maximum return portfolio optimization problem. The uncertainty of asset returns is modelled by polyhedral uncertainty sets as opposed to the earlier proposed ellipsoidal sets. We derive the robust model from a min-regret perspective and examine the properties of robust models with respect to portfolio composition. We investigate the effect of different definitions of the bounds on the uncertainty sets and show that robust models yield well diversified portfolios, in terms of the number of assets and asset weights.