NETWORK MODELLING AND SEMANTIC 3D CITY MODELS: TESTING THE MATURITY OF THE UTILITY NETWORK ADE FOR CITYGML WITH A WATER NETWORK TEST CASE
Bibliographic record
Abstract
Abstract. Recent advances in semantic 3D city modelling and a demand from utility network operators for multi-utility data models integration have contributed to the emergence of an open Application Domain Extension (ADE) of the CityGML data model tailored to multiple types of utility networks. This extension, called the Utility Network ADE, is still in active development. However, work is already well underway to create data samples and to develop methods of modelling thereupon. In this paper, a mapping of the Utility Network ADE data model to a relational database schema is introduced. A sample of a freshwater network using the Utility Network ADE and based on data from the city of Nanaimo, Canada, is also presented. This sample has also been imported into a relational database schema built upon the 3DCityDB (a database implementation of CityGML) extended with a schema of the Utility Network ADE. Further to this, a series of basic network analysis functions have been defined and implemented in SQL to interact with the database so as to carry out sample atomic processes involved in network modelling, such as reading semantic properties of elements, calculating composite physical parameters of the network as a whole, and performing simple topological routing to serve as a guiding example for further and more complex development. A brief outlook is also presented, suggesting areas with high potential for future research and development of this nascent data model.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".