22 research outputs found

    Finite element modeling of tidal flow and bed -load transport in the Great Bay Estuarine system, New Hampshire

    Get PDF
    Current, sea level and bed-load transport are investigated in the Great Bay Estuary, New Hampshire---a shallow, well-mixed system with low freshwater input. Main channel tidal currents are over 2 m/sec, and its dynamic balance is dominated by the pressure gradient and bottom friction. Current and sea level forced by the M2, M4, M6 tides at the estuary mouth are simulated by two numerical models---a three-dimensional, harmonic model that solves the linearized shallow water equations (FUNDY5); and a vertically averaged, time stepping, non-linear model (ADAM). ADAM makes use of a kinematic assumption (that is, the local and advective accelerations are neglected) and accounts for flooding and dewatering over tidal flats by employing a groundwater component. FUNDY5 is used as a preliminary diagnostic tool to identify the general properties of the estuarine flow and to identify grid problems. ADAM is used as a prognostic model to simulate the tidal hydrodynamics of the estuarine system. The accuracy of the hydrodynamic predictions is evaluated by comparison with ten tidal elevation and four cross-section averaged current measurements. The results show that the kinematic assumption holds for the lower and middle sections of the estuary but fails in the upper sections, due in part to the increased importance of accelerations in these sections. Residuals (time averages) of currents are also investigated and yielded flood directed pathways over the shallow flats and ebb directed pathways in the deep channels. Currents simulated by ADAM are then used to model bed-load transport in the vicinity of a rapidly growing shoal located in the main channel of the lower system. Consisting of coarse sediments, the shoal must be dredged every 5--9 years. Two approaches are taken---an Eulerian parametric method in which elemental bed-load flux vectors are calculated at each time step; and a Lagrangian particle tracking approach in which a finite number of sediment particles are released at different times in the M2 cycle and tracked. Both methods yield pathways and accumulations in agreement with the observed shoal formation and the long-term rate of sediment accumulation in the shoal area

    Proactive-reactive, robust scheduling and capacity planning of deconstruction projects under uncertainty

    Get PDF
    A project planning and decision support model is developed and applied to identify and reduce risk and uncertainty in deconstruction project planning. It allows calculating building inventories based on sensor information and construction standards and it computes robust project plans for different scenarios with multiple modes, constrained renewable resources and locations. A reactive and flexible planning element is proposed in the case of schedule infeasibility during project execution

    Employing Incremental Outlines for OpenStreetMap Data Updating

    Get PDF
    The updating of changing information plays a significant role in ensuring the quality of OpenStreetMap, which is usually completed by mapping the whole changing objects with a high degree of uncertainty. The incremental object-based approach provides opportunities to reduce the unreliability of data, while challenges of data inaccuracy and redundancy remain. This paper provides an incremental outline-based approach for OpenStreetMap data updating to solve this issue. First, incremental outlines are delineated from the changed objects and distinguished through a spatial classification. Then, attribute information corresponding to incremental outlines is proposed to assist in describing the physical changes. Finally, through a geometric calculation based on both the spatial and attribute information, updating operations are constructed with a variety of rules to activate the data updating process. The proposed approach was verified by updating an area in the OpenStreetMap datasets. The result shows that the incremental outline-based updating approach can reduce both the time and storage costs compared to incremental objects and further improve data quality in the updating process. Document type: Articl

    Propagating Updates of Residential Areas in Multi-Representation Databases Using Constrained Delaunay Triangulations

    No full text
    Updating topographic maps in multi-representation databases is crucial to a number of applications. An efficient way to update topographic maps is to propagate the updates from large-scale maps to small-scale maps. Because objects are often portrayed differently in maps of different scales, it is a complicated process to produce multi-scale topographic maps that meet specific cartographical criteria. In this study, we propose a new approach to update small-scale maps based on updated large-scale maps. We first group spatially-related objects in multi-scale maps and decompose the large-scale objects into triangles based on constrained Delaunay triangulation. We then operate the triangles and construct small-scale objects by accounting for cartographical generalization rules. In addition, we apply the Tabu Search algorithm to search for the optimal sequences when constructing small-scale objects. A case study was conducted by applying the developed method to update residential areas at varied scales. We found the proposed method could effectively update small-scale maps while maintaining the shapes and positions of large-scale objects. Our developed method allows for parallel processing of update propagation because it operates grouped objects together, thus possesses computational advantages over the sequential updating method in areas with high building densities. Although the method proposed in this study requires further tests, it shows promise with respect to automatic updates of polygon data in the multi-representation databases

    Robust and affordable localization and mapping for 3D reconstruction. Application to architecture and construction

    Get PDF
    La localización y mapeado simultáneo a partir de una sola cámara en movimiento se conoce como Monocular SLAM. En esta tesis se aborda este problema con cámaras de bajo coste cuyo principal reto consiste en ser robustos al ruido, blurring y otros artefactos que afectan a la imagen. La aproximación al problema es discreta, utilizando solo puntos de la imagen significativos para localizar la cámara y mapear el entorno. La principal contribución es una simplificación del grafo de poses que permite mejorar la precisión en las escenas más habituales, evaluada de forma exhaustiva en 4 datasets. Los resultados del mapeado permiten obtener una reconstrucción 3D de la escena que puede ser utilizada en arquitectura y construcción para Modelar la Información del Edificio (BIM). En la segunda parte de la tesis proponemos incorporar dicha información en un sistema de visualización avanzada usando WebGL que ayude a simplificar la implantación de la metodología BIM.Departamento de Informática (Arquitectura y Tecnología de Computadores, Ciencias de la Computación e Inteligencia Artificial, Lenguajes y Sistemas Informáticos)Doctorado en Informátic

    Propagating Updates of Residential Areas in Multi-Representation Databases Using Constrained Delaunay Triangulations

    No full text
    Updating topographic maps in multi-representation databases is crucial to a number of applications. An efficient way to update topographic maps is to propagate the updates from large-scale maps to small-scale maps. Because objects are often portrayed differently in maps of different scales, it is a complicated process to produce multi-scale topographic maps that meet specific cartographical criteria. In this study, we propose a new approach to update small-scale maps based on updated large-scale maps. We first group spatially-related objects in multi-scale maps and decompose the large-scale objects into triangles based on constrained Delaunay triangulation. We then operate the triangles and construct small-scale objects by accounting for cartographical generalization rules. In addition, we apply the Tabu Search algorithm to search for the optimal sequences when constructing small-scale objects. A case study was conducted by applying the developed method to update residential areas at varied scales. We found the proposed method could effectively update small-scale maps while maintaining the shapes and positions of large-scale objects. Our developed method allows for parallel processing of update propagation because it operates grouped objects together, thus possesses computational advantages over the sequential updating method in areas with high building densities. Although the method proposed in this study requires further tests, it shows promise with respect to automatic updates of polygon data in the multi-representation databases

    Proactive-reactive, robust scheduling and capacity planning of deconstruction projects under uncertainty

    Get PDF
    A project planning and decision support model is developed and applied to identify and reduce risk and uncertainty in deconstruction project planning. It allows calculating building inventories based on sensor information and construction standards and it computes robust project plans for different scenarios with multiple modes, constrained renewable resources and locations. A reactive and flexible planning element is proposed in the case of schedule infeasibility during project execution

    Aeronautical engineering: A continuing bibliography with indexes (supplement 322)

    Get PDF
    This bibliography lists 719 reports, articles, and other documents introduced into the NASA scientific and technical information system in Oct. 1995. Subject coverage includes: design, construction and testing of aircraft and aircraft engines; aircraft components, equipment, and systems; ground support systems; and theoretical and applied aspects of aerodynamics and general fluid dynamics

    Algorithm Engineering for Realistic Journey Planning in Transportation Networks

    Get PDF
    Diese Dissertation beschäftigt sich mit der Routenplanung in Transportnetzen. Es werden neue, effiziente algorithmische Ansätze zur Berechnung optimaler Verbindungen in öffentlichen Verkehrsnetzen, Straßennetzen und multimodalen Netzen, die verschiedene Transportmodi miteinander verknüpfen, eingeführt. Im Fokus der Arbeit steht dabei die Praktikabilität der Ansätze, was durch eine ausführliche experimentelle Evaluation belegt wird
    corecore