Network tomography based on 1-D projections

Network tomography has been regarded as one of the most promising methodologies for performance evaluation and diagnosis of the massive and decentralized Internet. This paper proposes a new estimation approach for solving a class of inverse problems in network tomography, based on marginal distributions of a sequence of one-dimensional linear projections of the observed data. We give a general identifiability result for the proposed method and study the design issue of these one dimensional projections in terms of statistical efficiency. We show that for a simple Gaussian tomography model, there is an optimal set of one-dimensional projections such that the estimator obtained from these projections is asymptotically as efficient as the maximum likelihood estimator based on the joint distribution of the observed data. For practical applications, we carry out simulation studies of the proposed method for two instances of network tomography. The first is for traffic demand tomography using a Gaussian Origin-Destination traffic model with a power relation between its mean and variance, and the second is for network delay tomography where the link delays are to be estimated from the end-to-end path delays. We compare estimators obtained from our method and that obtained from using the joint distribution and other lower dimensional projections, and show that in both cases, the proposed method yields satisfactory results.Comment: Published at http://dx.doi.org/10.1214/074921707000000238 in the IMS Lecture Notes Monograph Series (http://www.imstat.org/publications/lecnotes.htm) by the Institute of Mathematical Statistics (http://www.imstat.org

Partitions of the polytope of Doubly Substochastic Matrices

In this paper, we provide three different ways to partition the polytope of doubly substochastic matrices into subpolytopes via the prescribed row and column sums, the sum of all elements and the sub-defect respectively. Then we characterize the extreme points of each type of convex subpolytopes. The relations of the extreme points of the subpolytopes in the three partitions are also given

Investigating the technology catching-up trajectory of Chinese Hi-Tech SMEs: an integrated framework from industry-, resource-, and institution-based view

Accepted for WLICSMB 2010Purpose This paper intends to review the literatures on the technology catching-up trajectory of latecomers in order to understand the innovation strategies of Chinese Hi-Tech SMEs (Gu & Tse, 2010; Xie & White, 2006; Chen & Qu, 2003; Lee & Lim, 2001; Kim, 1997). It also tries to construct an integrated framework to investigate their innovation strategies and the impact on organizational performance from the Industry-, Resource-, and Institution-based view (Peng, Wang, & Jiang, 2008). Design/methodology/approach The authors have reviewed papers published in the leading journals in the R&D field and proposed an integrated conceptual framework of innovation strategies of Chinese Hi-Tech firms based on Peng, Wang and Jiang (2008)’s institution-based view framework to examine the innovation strategy from Industry-, firm-specific Resource-based, and Institution-based View Originality/Value This paper pays attention to the institution factors in shaping Chinese SMEs to develop innovative capabilities. Chinese firms have comparative advantages, such as better comprehending Chinese local market, better understanding of local business environment comparing to MNEs. Our paper argues that by developing effective innovation strategies and improving innovative capabilities, Chinese SMEs will be able to survive from the severe competitions from state-owned enterprises and foreign firms in China

Capacity Bounds for Two-Hop Interference Networks

This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two relay nodes serve as intermediaries between the transmitters and receivers. Each hop, one from the transmitters to the relays and the other from the relays to the receivers, is modeled as a Gaussian interference channel, thus the network is essentially a cascade of two interference channels. For this network, achievable symmetric rates for different parameter regimes under decode-and- forward relaying and amplify-and-forward relaying are proposed and the corresponding coding schemes are carefully studied. Numerical results are also provided.Comment: 8 pages, 5 figures, presented in Allerton Conference'0

A Fuzzy Petri Nets Model for Computing With Words

Motivated by Zadeh's paradigm of computing with words rather than numbers, several formal models of computing with words have recently been proposed. These models are based on automata and thus are not well-suited for concurrent computing. In this paper, we incorporate the well-known model of concurrent computing, Petri nets, together with fuzzy set theory and thereby establish a concurrency model of computing with words--fuzzy Petri nets for computing with words (FPNCWs). The new feature of such fuzzy Petri nets is that the labels of transitions are some special words modeled by fuzzy sets. By employing the methodology of fuzzy reasoning, we give a faithful extension of an FPNCW which makes it possible for computing with more words. The language expressiveness of the two formal models of computing with words, fuzzy automata for computing with words and FPNCWs, is compared as well. A few small examples are provided to illustrate the theoretical development.Comment: double columns 14 pages, 8 figure