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.     

基于模糊神经网络的自适应PID控制器

提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。     

网络环境下农业信息机构服务方式创新的思考

网络环境下，信息具有存贮数字化、传播网络化的特点。农业信息机构的信息服务创新要围绕信息的这两个特点，重点放在网络的应用及网上农业信息资源的开发利用上，把网络优势变为服务优势。     

论网络时代高校图书馆的思想道德教育

网络对大学生的思想道德修养具有重要而深刻的影响。高校图书馆应充分认识到加强大学生思想道德教育的重要意义和自己在其中应负的责任，采取积极有效的措施，培养和提高大学生的思想道德素质。     

基于VBA三角网格土石方开挖的三维模型

利用VBA技术实现对离散高程点的三角构网,快速定位三角形。将其用于土方开挖边线处理,在此基础上重新构网。实际计算结果表明,将三角网格用于土方工程填挖量计算,可以提高计算精度并可实现填挖后的三维显示。