3,043 research outputs found

    The Competition for Shortest Paths on Sparse Graphs

    Get PDF
    Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. A distributed linearly-scalable routing algorithm is devised. The ground state of such systems reveals non-monotonic complex behaviors in both average path-length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers.Comment: 4 pages, 4 figure

    Vowels of Hong Kong English: from an acoustic perspective

    Get PDF
    Thesis (B.Sc)--University of Hong Kong, 2007.A dissertation submitted in partial fulfilment of the requirements for the Bachelor of Science (Speech and Hearing Sciences), The University of Hong Kong, June 30, 2007.Also available in print.published_or_final_versionSpeech and Hearing SciencesBachelorBachelor of Science in Speech and Hearing Science

    Capacity Analysis of Linear Operator Channels over Finite Fields

    Full text link
    Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over finite fields are studied. Both the Shannon capacity CC and the subspace coding capacity CSSC_{\text{SS}} are analyzed. By establishing and comparing lower bounds on CC and upper bounds on CSSC_{\text{SS}}, various necessary conditions and sufficient conditions such that C=CSSC=C_{\text{SS}} are obtained. A new class of LOCs such that C=CSSC=C_{\text{SS}} is identified, which includes LOCs with uniform-given-rank transfer matrices as special cases. It is also demonstrated that CSSC_{\text{SS}} is strictly less than CC for a broad class of LOCs. In general, an optimal subspace coding scheme is difficult to find because it requires to solve the maximization of a non-concave function. However, for a LOC with a unique subspace degradation, CSSC_{\text{SS}} can be obtained by solving a convex optimization problem over rank distribution. Classes of LOCs with a unique subspace degradation are characterized. Since LOCs with uniform-given-rank transfer matrices have unique subspace degradations, some existing results on LOCs with uniform-given-rank transfer matrices are explained from a more general way.Comment: To appear in IEEE Transactions on Information Theor

    Empirical studies on the network of social groups: the case of Tencent QQ

    Full text link
    Participation in social groups are important but the collective behaviors of human as a group are difficult to analyze due to the difficulties to quantify ordinary social relation, group membership, and to collect a comprehensive dataset. Such difficulties can be circumvented by analyzing online social networks. In this paper, we analyze a comprehensive dataset obtained from Tencent QQ, an instant messenger with the highest market share in China. Specifically, we analyze three derivative networks involving groups and their members -- the hypergraph of groups, the network of groups and the user network -- to reveal social interactions at microscopic and mesoscopic level. Our results uncover interesting behaviors on the growth of user groups, the interactions between groups, and their relationship with member age and gender. These findings lead to insights which are difficult to obtain in ordinary social networks.Comment: 18 pages, 9 figure

    A systems design study introducing a collection point for baggage transfer services at a railway station in the UK

    Get PDF
    Railway transport has shown a steady growth in passenger numbers over the past 20 years across the UK. Passengers travel with luggage. It has been forecasted that there will be a reduction of “luggage racks-to-seats” ratio in the future passenger train fleet. There are currently no baggage transfer systems at any of the train stations as part of the urban rail transit system in the UK. Hence, the purpose of this study is to investigate the possibility of having a baggage transfer service at Newcastle Central Station, which can serve different travel destinations. A simulation modelling study of different parts of the baggage check-in shop within the railway station is offered. Check-in point, movement of luggage around Newcastle Central, baggage reclaims and storage areas have been contemplated and evaluated using SIMUL8 event-based simulation package. The results for the simulation model developed show that a baggage transfer service at Newcastle Central Station is possible with a mixture of walk-in and online check-in options
    • …
    corecore