网络资源建设的思考

在现在的教育教学活动过程中,以网络教育形式来传递教育教学信息,愈发显得重要。以网络基础开展的教育教学活动中,资源建设对整个教学的进展起着至关重要的作用     

局域网中基于ASP的办公信息的采集

办公事务中经常要求采集各种信息，传统的做法是印发数据表、填写数据表、再把数据录入到微机数据库保存和处理；现利用Windows98的PWS和Access数据库，以Weh浏览器和Web服务器交互访问的方式，将局域网上收集的信息直接保存到数据库中．     

求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．     

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

The double loop network(DLN)is a circulant digraph with n nodes and outdegree 2.It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems.Given the number n of nodes,how to construct a DLN which has minimum diameter?This problem has attracted great attention.A related and longtime unsolved problem is:for any given non-negative integer k,is there an infinite family of k-tight optimal DLN?In this paper,two main results are obtained:(1)for any k≥0,the infinite families of k-tight optimal DLN can be constructed,where the number n(k,e,c)of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c.(2)for any k≥0, an infinite family of singular k-tight optimal DLN can be constructed.     

网络教学中的预测分析

阐述了开发网络教学系统的系统构成及开发工具,在此基础上提出了基于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.