3,157 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

    Single Molecule Mechanics on Surface

    Get PDF
    This thesis explores the mechanics of single molecule machines on a surface, aiming to understand the principles underlying synthetic single molecular machines. The study utilizes scanning tunneling microscopy (STM) at ultra-low temperatures and high vacuum conditions to investigate individual small molecules adsorbed on a substrate. In the first part, the transmission of rotation between single molecule-gears is examined, employing a star-shaped pentaphenylcyclopentadiene molecule manipulated by STM. The second part focuses on a zwitterionic and chiral molecule's dual functionality as a molecule-rotor or a molecule-vehicle (nanocar), with motion driven by tunneling electrons. The third part explores the origin of unidirectional rotation in a single molecule-rotor, analyzing the effects of thermal and electronic excitations on rotation dynamics. Overall, this work contributes to the fundamental understanding of nanoscale mechanical molecular devices and their potential applications

    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
    • …
    corecore