27,087 research outputs found

    Face pairing graphs and 3-manifold enumeration

    Full text link
    The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the combinatorial structure of such a triangulation that can be deduced from its face pairing graph. These results are then applied to the enumeration of closed minimal P^2-irreducible 3-manifold triangulations, leading to a significant improvement in the performance of the enumeration algorithm. Results are offered for both orientable and non-orientable triangulations.Comment: 30 pages, 57 figures; v2: clarified some passages and generalised the final theorem to the non-orientable case; v3: fixed a flaw in the proof of the conical face lemm

    Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find

    Full text link
    Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most ten tetrahedra.Comment: 37 pages, 34 figure

    Improved RNA pseudoknots prediction and classification using a new topological invariant

    Get PDF
    We propose a new topological characterization of RNA secondary structures with pseudoknots based on two topological invariants. Starting from the classic arc-representation of RNA secondary structures, we consider a model that couples both I) the topological genus of the graph and II) the number of crossing arcs of the corresponding primitive graph. We add a term proportional to these topological invariants to the standard free energy of the RNA molecule, thus obtaining a novel free energy parametrization which takes into account the abundance of topologies of RNA pseudoknots observed in RNA databases.Comment: 9 pages, 6 figure

    Estimation and detection of transmission line characteristics in the copper access network

    Get PDF
    The copper access-network operators face the challenge of developing and maintaining cost-effective digital subscriber line (DSL) services that are competitive to other broadband access technologies. The way forward is dictated by the demand of ever increasing data rates on the twisted-pair copper lines. To meet this demand, a relocation of the DSL transceivers in cabinets closer to the customers are often necessary combined with a joint expansion of the accompanying optical-fiber backhaul network. The equipment of the next generation copper network are therefore becoming more scattered and geographically distributed, which increases the requirements of automated line qualification with fault detection and localization. This scenario is addressed in the first five papers of this dissertation where the focus is on estimation and detection of transmission line characteristics in the copper access network. The developed methods apply model-based optimization with an emphasis on using low-order modeling and a priori information of the given problem. More specifically, in Paper I a low-order and causal cable model is derived based on the Hilbert transform. This model is successfully applied in three contributions of this dissertation. In Paper II, a class of low-complexity unbiased estimators for the frequency-dependent characteristic impedance is presented that uses one-port measurements only. The so obtained characteristic impedance paves the way for enhanced time domain reflectometry (a.k.a. TDR) on twisted-pair lines. In Paper III, the problem of estimating a nonhomogeneous and dispersive transmission line is investigated and a space-frequency optimization approach is developed for the DSL application. The accompanying analysis shows which parameters are of interest to estimate and further suggests the introduction of the concept capacitive length that overcomes the necessity of a priori knowledge of the physical line length. In Paper IV, two methods are developed for detection and localization of load coils present in so-called loaded lines. In Paper V, line topology identification is addressed with varying degree of a priori information. In doing so, a model-based optimization approach is employed that utilizes multi-objective evolutionary computation based on one/two-port measurements. A complement to transceiver relocation that potentially enhances the total data throughput in the copper access network is dynamic spectrum management (DSM). This promising multi-user transmission technique aims at maximizing the transmission rates, and/or minimizing the power consumption, by mitigating or cancelling the dominating crosstalk interference between twisted-pair lines in the same cable binder. Hence the spectral utilization is improved by optimizing the transmit signals in order to minimize the crosstalk interference. However, such techniques rely on accurate information of the (usually) unknown crosstalk channels. This issue is the main focus of Paper VI and VII of this dissertation in which Paper VI deals with estimation of the crosstalk channels between twisted-pair lines. More specifically, an unbiased estimator for the square-magnitude of the crosstalk channels is derived from which a practical procedure is developed that can be implemented with standardized DSL modems already installed in the copper access network. In Paper VII the impact such a non-ideal estimator has on the performance of DSM is analyzed and simulated. Finally, in Paper VIII a novel echo cancellation algorithm for DMT-based DSL modems is presented

    Definition, implementation and validation of energy code smells: an exploratory study on an embedded system

    Get PDF
    Optimizing software in terms of energy efficiency is one of the challenges that both research and industry will have to face in the next few years.We consider energy efficiency as a software product quality characteristic, to be improved through the refactoring of appropriate code pattern: the aim of this work is identifying those code patterns, hereby defined as Energy Code Smells, that might increase the impact of software over power consumption. For our purposes, we perform an experiment consisting in the execution of several code patterns on an embedded system. These code patterns are executed in two versions: the first one contains a code issue that could negatively impact power consumption, the other one is refactored removing the issue. We measure the power consumption of the embedded device during the execution of each code pattern. We also track the execution time to investigate whether Energy Code Smells are also Performance Smells. Our results show that some Energy Code Smells actually have an impact over power consumption in the magnitude order of micro Watts. Moreover, those Smells did not introduce a performance decreas
    corecore