马尔可夫骨架PERT网络的最长路径

本文利用马尔可夫骨架过程理论研究PERT网络模型，其中网络各弧线的长度是相互独立的随机变量。文中构造了一个马尔可夫骨架过程，利用其向后方程求解随机网络最长路径长度的分布函数。     

Relaxation techniques for strictly convex network problems

Gauss—Seidel type relaxation techniques are applied in the context of strictly convex pure networks with separable cost functions. The algorithm is an extension of the Bertsekas—Tseng approach for solving the linear network problem and its dual as a pair of monotropic programming problems. The method is extended to cover the class of generalized network problems. Alternative internal tactics for the dual problem are examined. Computational experiments — aimed at the improved efficiency of the algorithm — are presented.This research was supported in part by National Science Foundation Grant No. DCR-8401098-A01.     

Characterization of complex networks by higher order neighborhood properties

A concept of higher order neighborhood in complex networks, introduced previously [Phys. Rev. E 73, 046101 (2006)], is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each higher order neighborhood as a network in itself, represented by a corresponding adjacency matrix, and to settle a plenty of new parameters in order to obtain a best characterization of the whole network. Usual network indices are then used to evaluate the properties of each neighborhood. The identification of high order neighborhoods is also regarded as intermediary step towards the evaluation of global network properties, like the diameter, average shortest path between node, and network fractal dimension. Results for a large number of typical networks are presented and discussed.     

An exact algorithm for the network pricing problem

This work focuses on an improved exact algorithm for addressing an NP-hard network pricing problem. The method involves an efficient and partial generation of candidate solutions, a recursive scheme for generating improved upper bounds, and a column generation procedure for solving the network-structured subproblems. Its efficiency is assessed against both randomly generated instances involving three distinct topologies as well as instances based on real life situations in telecommunication and freight transportation.     

Identifying the community structure of the international-trade multi-network

We study the community structure of the multi-network of commodity-specific trade relations among world countries over the 1992-2003 period. We compare structures across commodities and time by means of the normalized mutual information index (NMI). We also compare them with exogenous community structures induced by geography and regional trade agreements. We find that commodity-specific community structures are very heterogeneous and much more fragmented than that characterizing the aggregate ITN. This shows that the aggregate properties of the ITN may result (and be very different) from the aggregation of very diverse commodity-specific layers of the multi-network. We also show that commodity-specific community structures, especially those related to the chemical sector, are becoming more and more similar to the aggregate one. Finally, our findings suggest that geography-induced partitions of our set of countries are much more correlated with observed community structures than partitions induced by regional-trade agreements. This result strengthens previous findings from the empirical literature on trade.     

Asymmetric flow networks

This paper provides a new model of network formation that bridges the gap between the two benchmark game-theoretic models by Bala and Goyal (2000a) – the one-way flow model, and the two-way flow model – and includes both as limiting cases. As in both the said models, a link can be initiated unilaterally by any player with any other in what we call an “asymmetric flow” network, and the flow through a link towards the player who supports it is perfect. Unlike those models, there is friction or decay in the opposite direction. When this decay is complete there is no flow and this corresponds to the one-way flow model. The limit case when the decay in the opposite direction (and asymmetry) disappears corresponds to the two-way flow model. We characterize stable and strictly stable architectures for the whole range of parameters of this “intermediate” and more general model. A study of the efficiency of these architectures shows that in general stability and efficiency do not go together. We also prove the convergence of Bala and Goyal’s dynamic model in this context.     

Experiments on 40 Gb/s Transmission with Wavelength Conversion: Results from the IST ATLAS Project

In this article we report the main experimental results obtained in the framework of the IST ATLAS project regarding the transmission at 40 Gb/s over long terrestrial links, including the frequency conversion of a signal. We report the single-channel 40 Gb/s transmission over a link 500 km long with an amplifier spacing of 100 km, both with G.652 fibers and G.653 fibers by periodically compensating the chromatic dispersion with dispersion-compensating fibers. We report the single-channel transmission at 40 Gb/s, also, after the wavelength conversion of a channel with both PPLN and semiconductor optical amplifier devices. In particular, 500 km distances are obtained with PPLN wavelength conversion and 300 km distances with semiconductor optical amplifiers. Some results have been reported for electronic devices operating at 40 Gb/s.     

Formulation and computation of general financial equilibrium

In this paper a model of competitive financial equilibrium is introduced, which yields the optimal composition of assets and liabilities in each sector's portfolio, as well as the market clearing prices for each instrument. The variational inequality formulation of the equilibrium conditions is then utilized to establish existence and uniqueness properties of the solution pattern. Finally, an algorithm is proposed for the computation of the equilibrium pattern; the algorithm resolves the problem into simple network subproblems which can then be solved in closed form. The algorithm is then applied to an example.     

Transition from spiral wave to target wave and other coherent structures in the networks of Hodgkin-Huxley neurons

Transition of spiral wave in the regular networks of Hodgkin-Huxley (H-H) neurons is simulated and discussed in detail when the effect of membrane temperature and forcing current is considered. Neurons are distributed in the sites of two-dimensional array, neurons are connected with complete nearest-neighbor connections, no-flux boundary conditions, appropriate initial values and physiological parameters are used to develop a stable rotating spiral wave. A statistic factor of synchronization is defined to discuss the transition and development of spiral wave in the two parameters space (membrane temperature T and forcing current I), and it is found that spiral wave keeps alive due to positive current forcing and the spiral wave can be removed completely when the temperature is increased to a threshold about T = 22.3 °C at a fixed current intensity. Periodical forcing current is imposed on the networks of neurons globally and locally, respectively. It is found that spiral wave could be suppressed by the new generated traveling wave or target wave when periodical forcing current is imposed on the border of networks of neurons, and the most effective frequency of the external forcing current is close to the intrinsic frequency of the spiral wave of the networks.     

Evolutionary Prisoner's Dilemma on heterogeneous Newman-Watts small-world network

We focus on the heterogeneity of social networks and its role to the emergence of prevailing cooperators and sustainable cooperation. The social networks are representative of the interaction relationships between players and their encounters in each round of games. We study an evolutionary Prisoner's Dilemma game on a variant of Newman-Watts small-world network, whose heterogeneity can be tuned by a parameter. It is found that optimal cooperation level exists at some intermediate topological heterogeneity for different temptations to defect. That is, frequency of cooperators peaks at a certain specific value of degree heterogeneity — neither the most heterogeneous case nor the most homogeneous one would favor the cooperators. Besides, the average degree of networks and the adopted update rule also affect the cooperation level.