[書籍][B] TDA user's manual

G Rohwer, U Pötter - 1999 - obcourses.sauder.ubc.ca
2 Data Handling 2.1 Variables 2.2 Creating New Variables 2.3 Removing Variables 2.4
Recoding Variables 2.5 Dummy Variables 2.6 String Variables 2.7 Namelists 2.8 Temporary …

Hierarchical structures of communication in a network organization

A Oberg, P Walgenbach - Methoden in der Betriebswirtschaftslehre, 2009 - Springer
The concept of the network organization is presented in the popular management literature
as a counter-model to the bureaucratic organization, and one that would increase the …

[HTML][HTML] Resolving prime modules: The structure of pseudo-cographs and galled-tree explainable graphs

M Hellmuth, GE Scholz - Discrete Applied Mathematics, 2024 - Elsevier
The modular decomposition of a graph G is a natural construction to capture key features of
G in terms of a labeled tree (T, t) whose vertices are labeled as “series”(1),“parallel”(0) or …

A unified pedestrian routing model for graph-based wayfinding built on cognitive principles

PM Kielar, DH Biedermann, A Kneidl… - … A: transport science, 2018 - Taylor & Francis
The wayfinding behavior of pedestrians in street and building networks can be predicted by
computer simulations based on routing models. To model realistic routing behavior, it is …

Graph Learning in Machine‐Readable Plant Topology Data

J Oeing, K Brandt, M Wiedau, G Tolksdorf… - Chemie Ingenieur …, 2023 - Wiley Online Library
Digitalization shows that data and its exchange are indispensable for a versatile and
sustainable process industry. There must be a shift from a document‐oriented to a data …

Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs

M Hellmuth, GE Scholz - International Computing and Combinatorics …, 2023 - Springer
The class of Galled-tree Explainable (GaTEx) graphs has just recently been discovered as a
natural generalization of cographs. Cographs are precisely those graphs that can be …

[PDF][PDF] Development of an extended routing scheme in reference to consideration of multi-dimensional flow relations between hydrological model entities

B Pfennig, H Kipka, M Wolf, M Fink, P Krause… - Proc. 18th World IMACS …, 2009 - Citeseer
Unlike to so called lumped models in which the quantification of several processes results
from a statistical relation between system input and system output for the whole catchment …

Synthesis of Structurally Restricted b-bounded Petri Nets: Complexity Results

R Tredup - … Problems: 13th International Conference, RP 2019 …, 2019 - Springer
Let b ∈ N^+ b∈ N+. A b-bounded Petri net (b-net) solves a transition system (TS) if its
reachability graph and the TS are isomorphic. Synthesis (of b-nets) is the problem of finding …

Direct methods for optimal control

TJ Böhme, B Frank, TJ Böhme, B Frank - Hybrid systems, optimal control …, 2017 - Springer
In this chapter another type of methods to solve optimal control problems is discussed. Direct
methods transform the original problem via a discretization of the control and the state …

[PDF][PDF] Generating sequences of construction tasks

W Huhnt - Proceedings of 22nd of W78 conference on information …, 2005 - itc.scix.net
Construction processes require preparation phases where among others the sequence of
construction tasks has to be developed. This sequence of tasks cannot be transferred …