Generation of 3D City Models Using Domain-Specific Information Fusion

Author(s):  
Jens Behley ◽  
Volker Steinhage
2021 ◽  
Vol 13 (16) ◽  
pp. 8782
Author(s):  
Edmund Widl ◽  
Giorgio Agugiaro ◽  
Jan Peters-Anders

Worldwide, cities are nowadays formulating their own sustainability goals, including ambitious targets related to the generation and consumption of energy. In order to support decision makers in reaching these goals, energy experts typically rely on simulation models of urban energy systems, which provide a cheap and efficient way to analyze potential solutions. The availability of high-quality, well-formatted and semantically structured data is a crucial prerequisite for such simulation-based assessments. Unfortunately, best practices for data modelling are rarely utilized in the context of energy-related simulations, so data management and data access often become tedious and cumbersome tasks. However, with the steady progress of digitalization, more and more spatial and semantic city data also become available and accessible. This paper addresses the challenge to represent these data in a way that ensures simulation tools can make use of them in an efficient and user-friendly way. Requirements for an effective linking of semantic 3D city models with domain-specific simulation tools are presented and discussed. Based on these requirements, a software prototype implementing the required functionality has been developed on top of the CityGML standard. This prototype has been applied to a simple yet realistic use case, which combines data from various sources to analyze the operating conditions of a gas network in a city district. The aim of the presented approach is to foster a stronger collaboration between experts for urban data modelling and energy simulations, based on a concrete proof-of-concept implementation that may serve as an inspiration for future developments.


Solar Energy ◽  
2017 ◽  
Vol 146 ◽  
pp. 264-275 ◽  
Author(s):  
Laura Romero Rodríguez ◽  
Eric Duminil ◽  
José Sánchez Ramos ◽  
Ursula Eicker

2021 ◽  
Vol 86 ◽  
pp. 101584
Author(s):  
Ankit Palliwal ◽  
Shuang Song ◽  
Hugh Tiang Wah Tan ◽  
Filip Biljecki

Author(s):  
Yufei Li ◽  
Xiaoyong Ma ◽  
Xiangyu Zhou ◽  
Pengzhen Cheng ◽  
Kai He ◽  
...  

Abstract Motivation Bio-entity Coreference Resolution focuses on identifying the coreferential links in biomedical texts, which is crucial to complete bio-events’ attributes and interconnect events into bio-networks. Previously, as one of the most powerful tools, deep neural network-based general domain systems are applied to the biomedical domain with domain-specific information integration. However, such methods may raise much noise due to its insufficiency of combining context and complex domain-specific information. Results In this paper, we explore how to leverage the external knowledge base in a fine-grained way to better resolve coreference by introducing a knowledge-enhanced Long Short Term Memory network (LSTM), which is more flexible to encode the knowledge information inside the LSTM. Moreover, we further propose a knowledge attention module to extract informative knowledge effectively based on contexts. The experimental results on the BioNLP and CRAFT datasets achieve state-of-the-art performance, with a gain of 7.5 F1 on BioNLP and 10.6 F1 on CRAFT. Additional experiments also demonstrate superior performance on the cross-sentence coreferences. Supplementary information Supplementary data are available at Bioinformatics online.


2004 ◽  
Vol 02 (01) ◽  
pp. 215-239 ◽  
Author(s):  
TOLGA CAN ◽  
YUAN-FANG WANG

We present a new method for conducting protein structure similarity searches, which improves on the efficiency of some existing techniques. Our method is grounded in the theory of differential geometry on 3D space curve matching. We generate shape signatures for proteins that are invariant, localized, robust, compact, and biologically meaningful. The invariancy of the shape signatures allows us to improve similarity searching efficiency by adopting a hierarchical coarse-to-fine strategy. We index the shape signatures using an efficient hashing-based technique. With the help of this technique we screen out unlikely candidates and perform detailed pairwise alignments only for a small number of candidates that survive the screening process. Contrary to other hashing based techniques, our technique employs domain specific information (not just geometric information) in constructing the hash key, and hence, is more tuned to the domain of biology. Furthermore, the invariancy, localization, and compactness of the shape signatures allow us to utilize a well-known local sequence alignment algorithm for aligning two protein structures. One measure of the efficacy of the proposed technique is that we were able to perform structure alignment queries 36 times faster (on the average) than a well-known method while keeping the quality of the query results at an approximately similar level.


2011 ◽  
Vol 48 (2) ◽  
pp. 124-130 ◽  
Author(s):  
Mathias Jahnke ◽  
Jukka Matthias Krisp ◽  
Holger Kumke
Keyword(s):  

2016 ◽  
Vol 22 (50) ◽  
pp. 369-372
Author(s):  
Yoshitami NONOMURA ◽  
Wataru SHIBAYAMA

Sign in / Sign up

Export Citation Format

Share Document