基于Web技术的网络拓扑图生成方法的研究

综合采用提取路由表和地址转发表的方法，对网络逻辑拓扑结构和物理拓扑结构进行自动探索，提出了用于优化显示网络拓扑图的一种显示算法，采用Java技术实现了基于Web的网络拓扑图，并对在实现过程中遇到的问题进行了探讨。试验结果表明，由此生成的网络拓扑图准确、美观、能够实现跨平台和跨区域的管理。     

公交车调度问题的数学模型

对 2 0 0 1年全国大学生数学建模竞赛的 B题——公交车调度问题进行了分析 ,建立了调度的目标规划模型及 0— 1规划模型 .在假设各站上、下车人数服从均匀分布的条件下 ,通过对模型的求解 ,求出了公交公司的最小运行车辆数 5 2辆 ,并给出了发车时刻表 ,其中上行方向运行 2 2 5班次 ,下行方向运行 2 2 0班次 .该模型简单 ,求解容易 ,能较好地考虑各方利益     

Tensor-product monotonicity preservation

This paper studies systems of tensor-product functions for which the functions they span are monotonic in any direction when their control nets are monotonic in that direction. It is shown that Bernstein polynomials and B-splines have this property but that totally positive systems in general, such as certain trigonometric and rational bases, do not. This revised version was published online in August 2006 with corrections to the Cover Date.     

Transitivity is neither hereditary nor finitely productive

We construct a transitive space that is the union of two subspaces homeomorphic to the (non-transitive) Kofner plane. Moreover, we show that the product of two transitive spaces need not be transitive. Finally, we observe that results of E.K. van Douwen establish that, under b = c, there exists a locally countable locally compact non-transitive zero-dimensional space. It follows that under b = c neither a locally transitive nor a compact space need be transitive.     

A Petri net approach to the modelling and analysis of flexible manufacturing systems

In this paper we present an approach for modelling and analyzing flexible manufacturing systems (FMSs) using Petri nets. In this approach, we first build a Petri net model (PNM) of the given FMS in a bottom-up fashion and then analyze important qualitative aspects of FMS behaviour such as existence/absence of deadlocks and buffer overflows. The basis for our approach is a theorem we state and prove for computing the invariants of the union of a finite number of Petri nets when the invariants of the individual nets are known. We illustrate our approach using two typical manufacturing systems: an automated transfer line and a simple FMS.A shorter version of this paper was presented at the 1st ORSA/TIMS Special Interest Conference on FMSs, University of Michigan, Ann Arbor, August 1984.     

基于EMD-GA-BP与EMD-PSO-LSSVM的中国碳市场价格预测

由于碳交易市场价格的波动性大及相互影响关系的复杂性,本文试图构建碳价格长期和短期的最优预测模型。考虑到碳交易价格波动的趋势性和周期性特点,基于经验模态分解算法(EMD)、遗传算法(GA)—神经网络(BP)模型、粒子群算法(PSO)—最小二乘支持向量机(LSSVM)模型及由它们构建的组合预测模型,对中国碳市场交易价格进行短期预测和长期预测。实证分析中将影响碳交易价格的不同宏观经济因素和碳价格时间序列因素做为输入变量,分别代入组合模型进行预测。研究结果表明,在短期预测中,EMD-GA-BP模型预测效果优于GA-BP模型和PSO-LSSVM模型;而在长期预测中,组合模型EMD-PSO-LSSVM模型预测效果优于只考虑碳价格波动趋势性或周期性预测效果。     

Epistemic irrelevance in credal nets: The case of imprecise Markov trees

We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory of probability. Focusing on directed trees, we show how to combine the given local uncertainty models in the nodes of the graph into a global model, and we use this to construct and justify an exact message-passing algorithm that computes updated beliefs for a variable in the tree. The algorithm, which is linear in the number of nodes, is formulated entirely in terms of coherent lower previsions, and is shown to satisfy a number of rationality requirements. We supply examples of the algorithm’s operation, and report an application to on-line character recognition that illustrates the advantages of our approach for prediction. We comment on the perspectives, opened by the availability, for the first time, of a truly efficient algorithm based on epistemic irrelevance.     

基于POT方法的极值理论在基金净值预测中的应用

为对基金净值数据进行建模,根据基金净值样本数据的尾部特点,建立极大,极小值分布的GPD模型,运用POT方法确定临界值,进而对参数进行估计,并对模型进行检验.最后,运用建立的模型对一些极值点进行预测.所得结果很好地描述了数据特点,对极值点的预测符合实际.     

MOOCs来袭 我们准备好了吗?

MOOCs正以其巨大的浪潮冲击着当今的高等教育.本文根据国内外MOOCs的发展现状,综合分析了MOOCs的优势及其对教学模式带来的影响,结合我们正在开展的大学物理MOOCs建设,提出了在课程改革中需要重点关注的四个方面,以期有助于更好地迎接MOOCs的挑战.