电信运营市场上过度进入的供给分析

本文在分析光纤主干网和本地接入服务市场上电信运营商的供给行为的基础上,首先证明了拥有主干网的运营商愿意租出自己的部分光纤,接着分析证明了上述两市场上使投资更倾向于过度的乘数效应,并进一步证明网络外部性使乘数效应更加明显.旨在对我国电信运营市场发展给出一些参考意见.     

神经网络在大型复杂武器装备质量综合评价排序中的应用

从大型复杂武器装备系统的具体特点出发,运用基于神经网络的评价方法,构建了大型复杂武器装备质量综合评价模型。实证分析的结果表明该方法得出的结果与实际情况相符。     

四种多变量校准方法在FTIR多组分分析中的性能比较

本文对四种多变量校准方法－－经典最小二乘法（CLS），偏最小二乘法（PLS），卡尔曼滤波法（KFM）以及人工神经网络法（ANN）－－在多组分浓度分析方面的性能进行了比较。选择五种红外谱图严重混叠的大气有机毒物－－1，3－丁二烯，苯，邻二甲苯，氯苯和丙烯醛－－作为分析对象。分别计算各种方法对该5组分体系的平均预测误差MPE和平均相对误差MRE进行比较。结果表明，偏最小二乘法在处理这类问题中是最稳健的方法。     

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

首先将无线传感器网络的路由问题转化成求解最小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.     

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.     

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.