以太网光桥的研究

根据有关网络技术和具体的实验,提出一种以太网光桥的实现方案,并对光桥的几个性能参数进行了分析讨论。     

A note on LeCam’s bound for the distance between the Poisson binomial and the Poisson distribution

n possibly different success probabilities p ₁, p ₂, ..., p _n is frequently approximated by a Poisson distribution with parameter λ = p ₁ + p ₂ + ... + p _n . LeCam's bound p ² ₁ + p ² ₂ + ... + p _n ² for the total variation distance between both distributions is particularly useful provided the success probabilities are small. The paper presents an improved version of LeCam's bound if a generalized d-dimensional Poisson binomial distribution is to be approximated by a compound Poisson distribution. Received: May 10, 2000; revised version: January 15, 2001     

国家财政对农业投入的分析与预测——基于状态空间模型的实证分析

国家财政对农业的投入是影响农业发展的重要因素。收集了建国以来国家财政对农业投入的数据,分析构造出状态空间模型,应用卡尔曼滤波估计出状态向量,挖掘出隐藏在数据内部的变化特征,分析国家财政对农业投入的实际情况,并对未来几年的农业投入进行预测。     

低碳视角下农业集约化、绿色化与资源再生化 的实现机制研究

在实现"碳达峰碳中和"目标的重要历史机遇期,推动实现农业集约化、绿色化和资源再生化,构建资源节约型、绿色低碳型、生态循环型的农业发展模式,对于农业可持续发展具有重要意义。以2000-2018年我国31个省份为研究对象,通过面板向量自回归模型(PVAR),刻画资源消耗、农业产出、农业碳排放之间的动态传导机制。结果表明:(1)东部农业"碳达峰"节点出现较早,东北、西部相对较晚;2018年农业碳排放居前三的省份为湖南、黑龙江、河南,居后三的为北京、天津、上海;(2)资源消耗和农业产出之间呈现"低投入高产出"的农业集约化生产模式,但影响力微弱;农业产出和农业碳排放之间"高产出高排放"的情形长期面临农业绿色化的严峻考验;农业碳排放与资源消耗之间呈现"低排放低投入"的资源再生化现象,影响力短期微弱长期较强;(3)推动实现农业集约化、绿色化、资源再生化的关键在于探索降低农业碳排放的多重路径。因此,应强化农业集约化生产,充分发展资源再生化模式,探索形成农业绿色化格局新路径,以此来加快实现碳减排目标,推动农业可持续发展。     

翻译中心智距离存在的客观性

翻译难是一个众所周知的事实。难的原因有多种,涉及许多内在和外在诸因素,其中有一个不容忽视的成因是译者与原作者之间客观地存在着“心智距离”,即译者在语际传译过程中,受自身诸种内在因素的制约,不可能真正地深入到原作者的内心中去,与原作者同思维、共呼吸,与原作者的意旨彻底复合。当代西方流行的接受美学理论为这一现象作了很好的佐证。     

A hybrid ARIMA and support vector machines model in stock price forecasting

Traditionally, the autoregressive integrated moving average (ARIMA) model has been one of the most widely used linear models in time series forecasting. However, the ARIMA model cannot easily capture the nonlinear patterns. Support vector machines (SVMs), a novel neural network technique, have been successfully applied in solving nonlinear regression estimation problems. Therefore, this investigation proposes a hybrid methodology that exploits the unique strength of the ARIMA model and the SVMs model in forecasting stock prices problems. Real data sets of stock prices were used to examine the forecasting accuracy of the proposed model. The results of computational tests are very promising.     

Minimum power assignment in wireless ad hoc networks with spanner property

Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research efforts have focused on finding the minimum power assignment to guarantee the connectivity or fault-tolerance of the network. In this paper, we study a new problem of finding the power assignment such that the induced communication graph is a spanner for the original communication graph when all nodes have the maximum power. Here, a spanner means that the length of the shortest path in the induced communication graph is at most a constant times of the length of the shortest path in the original communication graph. Polynomial time algorithm is given to minimize the maximum assigned power with spanner property. The algorithm also works for any other property that can be tested in polynomial time and is monotone. We then give a polynomial time approximation method to minimize the total transmission radius of all nodes. Finally, we propose two heuristics and conduct extensive simulations to study their performance when we aim to minimize the total assigned power of all nodes. The author is partially supported by NSF CCR-0311174.     

Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks

Energy conservation in mobile ad hoc networks is of paramount importance because most mobile nodes usually have very limited energy supply. Previous research on this issue focused on the design at the network or MAC or physical layer. In this paper, we study this problem from the new perspective of node mobility, i.e., analyzing the impact of node movement on energy conservation. In particular, armed with the inherent resource heterogeneity in mobile ad hoc networks, we propose a novel resource-aware movement strategy to make better use of some powerful nodes to achieve energy conservation. We also formulate the resource-aware movement as a NP-complete distance-constrained least-cost (DCLC) routing problem and propose an efficient heuristic solution. Extensive simulations have been used to demonstrate the effectiveness of the proposed schemes.     

Inapproximability and approximability of maximal tree routing and coloring

Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g^1−ε)-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O√|E(G)|, which matches the theoretical bounds. Supported in part by the NSF of China under Grant No. 70221001 and 60373012.     

动态车辆路径问题排队模型分析

分析了一类动态车辆路径问题,其中顾客需求以泊松流形式出现,现场服务时间服从一般分布.提出解决该问题的两种策略:顺序服务策略和中点改进策略,利用排队论、几何概率论等领域的知识分别求出了这两种策略的系统时间,并通过仿真数据实验验证了这两种策略的有效性.