电力市场中合同电量与竞争电量交易比例的研究

在单边开放的区域电力市场中,合理的合同电量与竞争电量交易比例是保证电力市场有效运行的一个重要环节。竞争电量所占的比例将主要取决于当前发电公司的市场行为。首先使用BP神经网络对电力需求弹性系数进行了预测,然后以长期电力市场均衡为目标函数,考虑贵州电网发电机组的可用容量与负荷预测的误差,以及贵州输电线路的可靠性诸因素,推导出合同电量与竞争电量交易比例,经过与南方区域电力市场目前运营规则规定的交易比例比较,该比例是合理的,可以规避电力市场价格波动等带来的风险。     

网络教学中的预测分析

阐述了开发网络教学系统的系统构成及开发工具,在此基础上提出了基于Web技术的辅助教学系统及预测分析模块,介绍了预测分析模块的工作原理及其构成预测分析模块的量化数据的来源,包括课程资源、讨论答疑、作业提交、测验考试资源等.另外,综述了预测分析的功能特色,应用效果,以及网络教学评价前景和发展.     

Small-world and the growing properties of the Chinese railway network

By using the tools of statistical physics and recent investigations of the scaling properties of different complex networks, the structural and evolving properties of the Chinese railway network (CRN) is studied. It has been verified that the CRN has the same small-world properties of the Indian railway network (IRN). According to the class of small-world networks, we believe the CRN is a single scale. In addition, a novel result is obtained. Measurements on the CRN indicate that the rate at which nodes acquire links depends on the node’s degree and follows a power law.      

The Problem of Capacity Addition in Multi-user Elastic Demand Communication Networks

In this paper we consider some properties on prices under flow control in a network that is to be shared by noncooperative users. Each user is faced with an optimization problem which is formulated as the minimization of its own criterion subject to constraint on the flows of the other users. The operating points of the network are the Nash equilibria of the underlying routing game. Our objective is to study the behavior of prices of all users when the network designer needs to allocate capacities to network links. For parallel links topologies, we show that degradation of the performances such as prices will not take place, as well as the users may find it beneficial to improve their requests     

网络环境下高校图书馆管理模式的新趋势

论述网络环境下高校图书馆管理的主要模式:以读者用户为中心的管理模式、一切从方便读者出发的服务模式、以人为本的管理模式,塑造人本取向、主动参与的行为和塑造为教学科研服务的全校信息中心和学术机构的形象,以适应网络环境和我国市场经济的变化。     

网络环境下高校图书馆馆员创新素质的再探讨

论述了网络环境下创新素质的形成、内容及其培养途径，阐述了高校图书馆培养具有创新素质的人才对读者服务工作的重要意义。     

Parking Capacity and Pricing in Park'n Ride Trips: A Continuous Equilibrium Network Design Problem

In this paper we consider the problem of designing parking facilities for park'n ride trips. We present a new continuous equilibrium network design problem to decide the capacity and fare of these parking lots at a tactical level. We assume that the parking facilities have already been located and other topological decisions have already been taken.The modeling approach proposed is mathematical programming with equilibrium constraints. In the outer optimization problem, a central Authority evaluates the performance of the transport network for each network design decision. In the inner problem a multimodal traffic assignment with combined modes, formulated as a variational inequality problem, generates the share demand for modes of transportation, and for parking facilities as a function of the design variables of the parking lots. The objective is to make optimal parking investment and pricing decisions in order to minimize the total travel cost in a subnetwork of the multimodal transportation system.We present a new development in model formulation based on the use of generalized parking link cost as a design variable.The bilevel model is solved by a simulated annealing algorithm applied to the continuous and non-negative design decision variables. Numerical tests are reported in order to illustrate the use of the model, and the ability of the approach to solve applications of moderate size.     

自由曲面光学虚拟制造与检测系统的探讨

自由曲面光学产品设计、制造与检测的工艺流程，通常采取试凑法逐次逼近。由于加工 检测 再加工，循环往复，既费时，成本又高，产生了瓶颈问题。为了解决此弊端，本文运用虚拟制造技术，提出光学虚拟制造的基本构想，即虚拟制造系统结构模型，给出光学系统虚拟原型的构成和光学系统成像质量虚拟检测系统的构成，讨论光学成像质量的仿真检测以及敏度分析方法。研究结果表明：运用虚拟制造与检测技术，可缩短研发周期，降低成本，优化工艺并提高产品质量。     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

On Numerical Solution of Shape Inverse Problems

The new method is proposed for the numerical solution of a class of shape inverse problems. The size and the location of a small opening in the domain of integration of an elliptic equation is identified on the basis of an observation. The observation includes the finite number of shape functionals. The approximation of the shape functionals by using the so-called topological derivatives is used to perform the learning process of an artificial neural network. The results of computations for 2D examples show, that the method allows to determine an approximation of the global solution to the inverse problem, sufficiently closed to the exact solution. The proposed method can be extended to the problems with an opening of general shape and to the identification problems of small inclusions. However, the mathematical theory of the proposed approach still requires futher research. In particular, the proof of global convergence of the method is an open problem.