Utz-Uwe Haus

Utz-Uwe Haus
HPE Switzerland · HPE HPC/AI EMEA Research Lab

Dr. rer. nat.

About

80
Publications
4,166
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1,172
Citations
Additional affiliations
November 2020 - present
Position
  • Head
January 2020 - October 2020
Position
  • Master's Student
June 2015 - December 2019
Cray, Basel, Switzerland
Position
  • Researcher

Publications

Publications (80)
Article
Full-text available
Modeling decision-dependent scenario probabilities in stochastic programs is difficult and typically leads to large and highly non-linear MINLPs that are very difficult to solve. In this paper, we develop a new approach to obtain a compact representation of the recourse function using a set of binary decision diagrams (BDDs) that encode a nested co...
Article
Full-text available
It is well known that (reduced, ordered) binary decision diagrams (BDDs) can sometimes be compact representations of the full solution set of Boolean optimization problems. Recently they have been suggested to be useful as discrete relaxations in integer and constraint programming (Hoda et al. 2010). We show that for every independence system there...
Article
Associating categories with measured or observed attributes is a central challenge for discrete mathematics in life sciences. We propose a new concept to formalize this question: Given a binary matrix of objects and attributes, determine all attribute sets characterizing object sets of cardinality t1t1 that do not characterize any object set of siz...
Article
We call a matrix completely mixable if the entries in its columns can be permuted so that all row sums are equal. If it is not completely mixable, we want to determine the smallest maximal and largest minimal row sum attainable. These values provide a discrete approximation of of minimum variance problems for discrete distributions, a problem motiv...
Article
Robust optimization problems are conventionally solved by reformulation as non-robust problems. We propose a direct method to separate split cuts for robust mixed-integer programs with polyhedral uncertainty sets. The method generalizes the well-known cutting plane procedure of Balas. Computational experiments show that applying cutting planes dire...
Article
Full-text available
Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is a crucial step in charting their usefulness. Gaussian boson sampling (GBS), in which photons are measured from a highly entangled Gaussian state, is a leading approach in pursuing quantum advantage. State-of-the-art GBS expe...
Chapter
Among the broad variety of challenges that arise from workloads in a converged HPC and Cloud infrastructure, data movement is of paramount importance, especially oncoming exascale systems featuring multiple tiers of memory and storage. While the focus has, for years, been primarily on optimizing computations, the importance of improving data handli...
Preprint
Full-text available
Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is a crucial step in charting their usefulness. Gaussian Boson Sampling (GBS), in which photons are measured from a highly entangled Gaussian state, is a leading approach in pursuing quantum advantage. State-of-the-art quantum...
Technical Report
Full-text available
Traditional compiler optimization theory distinguishes three separate classes of cache miss -- Cold, Conflict and Capacity. Tiling for cache is typically guided by capacity miss counts. Models of cache function have not been effectively used to guide cache tiling optimizations due to model error and expense. Instead, heuristic or empirical approach...
Conference Paper
Full-text available
It is well known that (reduced, ordered) binary decision diagrams (BDDs) can sometimes be compact representations of the full solution set of Boolean optimization problems. Recently they have been suggested to be useful as discrete relaxations in integer and constraint programming (Hoda, van Hoeve, and Hooker 2010). We show that for every independe...
Article
Logical models for cellular signaling networks are recently attracting wide interest: Their ability to integrate qualitative information at different biological levels, from receptor-ligand interactions to gene-regulatory networks, is becoming essential for understanding complex signaling behavior. We present an overview of Boolean modeling paradig...
Data
Experimental strategy. (A) Workflow. Mice were trained in a shuttle box to discriminate between rising and falling FM tones. Six or 24 h after avoidance training, mice were sacrificed and striatum (STR), hippocampus (HIP), frontal cortex (FC), and auditory cortex (AC) were removed. Synaptic proteins (PSD-enriched fraction) were collected for each b...
Data
Correlation plots of relative synaptic levels of frontal cortex proteins. Mean abundances relative to NV of frontal cortex proteins monitored 6 h (left) and 24 h (right) after behavioural experiments are plotted on a double logarithmic scale, comparing AV and FS (upper part), AV and TS (middle part), and FS and TS (lower part). Each data point repr...
Data
Analysis of regulated protein networks after aversive learning-summary of all brain areas and time points. Network analysis was performed using Ingenuity Pathway Analysis ™ (IPA). IPA of all proteins with significantly altered levels in the AV group reveals that the majority of these proteins form a complex network. Proteins identified to be regula...
Data
Correlation plots of relative synaptic levels of striatal proteins. Mean abundances relative to NV of striatal proteins monitored 6 h (left) and 24 h (right) after behavioural experiments are plotted on a double logarithmic scale, comparing AV and FS (upper part), AV and TS (middle part), and FS and TS (lower part). Each data point represents a uni...
Data
Correlation plots of relative synaptic levels of auditory cortex proteins. Mean abundances relative to NV of auditory cortex proteins monitored 6 h (left) and 24 h (right) after behavioural experiments are plotted on a double logarithmic scale, comparing AV and FS (upper part), AV and TS (middle part), and FS and TS (lower part). Each data point re...
Data
Analysis of regulated protein networks after aversive learning - comparison of protein regulation in striatum (STR), hippocampus (HIP), frontal cortex (FC), auditory cortex (AC). Proteins found to be down-regulated are indicated in blue. Time points after training (6 h and 24h) are pooled. The protein names are as given in the legend to Figure S7.
Data
MIAPE-compliant MSI-description Table S3 Mean protein abundances in active groups relative to naïve animal groups.
Data
Cluster analysis was performed using the mathematical software package "DanteR" (Pacific Northwest National Laboratory/http://omics.pnl.gov). Log2 of mean values of relative protein levels (FS/NV, TS/NV and AV/NV) were clustered using the K-means algorithm (K=15) on Euclidean distance metrics without data scaling. Protein accession numbers (Swisspr...
Data
Correlation plots of relative synaptic levels of hippocampal proteins. Mean abundances relative to NV of auditory cortex proteins monitored 6 h (left) and 24 h (right) after behavioural experiments are plotted on a double logarithmic scale, comparing AV and FS (upper part), AV and TS (middle part), and FS and TS (lower part). Each data point repres...
Data
Analysis of regulated protein networks after aversive learning - comparison of protein regulation in the various brain regions at 6 h or 24 h after aversive learning. STR - striatum, HIP - hippocampus, FC - frontal cortex, AC - auditory cortex, down-regulated proteins are indicated in blue. The protein names are as given in the legend to Figure S7.
Article
Full-text available
Changes in synaptic efficacy underlying learning and memory processes are assumed to be associated with alterations of the protein composition of synapses. Here, we performed a quantitative proteomic screen to monitor changes in the synaptic proteome of four brain areas (auditory cortex, frontal cortex, hippocampus striatum) during auditory learnin...
Article
Full-text available
Chemical synapses are highly specialized cell-cell contacts for communication between neurons in the CNS characterized by complex and dynamic protein networks at both synaptic membranes. The cytomatrix at the active zone (CAZ) organizes the apparatus for the regulated release of transmitters from the presynapse. At the postsynaptic side, the postsy...
Conference Paper
Full-text available
For a Boolean Matrix A a binary vector v is called t- frequent if Av has at least t entries of value supp (v). Given two parameters t1 < t2 the t1-frequent but t2-infrequent vectors of a matrix represent a Boolean function that has two domains of (opposite) monotonicity. These functions were studied for the purpose of data analysis and abstract con...
Article
Full-text available
Elementary modes (EMs) and minimal cut sets (MCSs) provide important techniques for metabolic network modeling. Whereas EMs describe minimal subnetworks that can function in steady state, MCSs are sets of reactions whose removal will disable certain network functions. Effective algorithms were developed for EM computation while calculation of MCSs...
Article
Full-text available
Motivated by fundamental problems in chemistry and biology we study cluster graphs arising from a set of initial states $S\subseteq\Z^n_+$ and a set of transitions/reactions $M\subseteq\Z^n_+\times\Z^n_+$. The clusters are formed out of states that can be mutually transformed into each other by a sequence of reversible transitions. We provide a sol...
Data
The merged network of TCR/CD4/CD28 and IL-2R signaling. The top layer represents input nodes. The bottom layer represents the output, i.e. molecules including transcription factors that become activated. Solid black arrows indicate activating interactions with a black circle denoting AND-connections. For clarity, activating influences with arrows p...
Data
STAT activation after TCR stimulation of mouse T cells. Primary mouse T cells and mouse T-cell blasts were stimulated as indicated in Protocol S1 and analyzed by Western blotting for the activation of STAT3 and STAT5. Irrelevant lanes have been cut out from the blots. (TIF)
Data
IL-2R signaling does not affect TCR expression. Human T-cell blasts were either stimulated with IL-2 for 30 min or left untreated. The level of TCR (CD3) and IL-2Rα (CD25) surface expression were measured by flow cytometry. Unstained cells are indicated with the broken line, untreated cells are represented with the grey line, and stimulated cells i...
Data
Full-text available
List of network components. The components of the merged TCR-IL-2R network including biological names and interpretation of the ON state. (PDF)
Data
A feasible negative feedback loop. Usually the cycle of FYN, PAG, CSK, and LCKP1 would lead to an infeasible solution as the activating interactions (solid lines) between the four proteins demand that they are in the same state. This is in conflict with the inhibition of LCKP1 by CSK (dotted red line) which requires that one of them is active and t...
Data
Determination of CD25 and Annexin V/PI by FACS staining. After resting for 24 hr and before restimulation with IL-2, T-cell blasts were stained with a FITC-coupled anti-CD25 antibody to determine the percentage of CD25-positive cells (A) or a FITC-coupled Annexin V antibody and propidium iodide to determine the number of viable cells (B). (TIF)
Data
Dose response of IL-2. Human T-cell blasts were stimulated by the indicated dilutions of IL-2 [10,000 U]. Cell lysates were analyzed by Western blotting for phosphorylated ERK and STAT3. β-actin was analyzed as loading control. (TIF)
Data
The reversible SFK inhibitor PP2 does not fully block AKT. The blot is a longer exposure of the blots of Figure 3B and 4B demonstrating that the irreversible PI3K inhibitor WM is more efficient than PP2 in blocking SFK-dependent AKT-phosphorylation following IL-2 stimulation. (TIF)
Data
The TCR/CD4/CD28 signaling network. To a large extent the signaling network was published previously in a different graphical layout [3]. The top layer represents input nodes. The bottom layer represents the output, i.e. molecules including transcription factors that become activated. Solid black arrows indicate activating interactions with a black...
Data
Stimulation of mouse T cells. Method describing the isolation, culture, and stimulation of primary mouse T cells and mouse T-cell blasts. (PDF)
Data
Full-text available
Model merging as an IFFSAT problem. Restating the problem of merging two networks as a projection of a larger network, including a formal proof of the algorithmic complexity. (PDF)
Data
Full-text available
Protocol for Boolean model merging. A step-by-step protocol for the semi-automated merging of Boolean networks. (PDF)
Data
Full-text available
List of clauses for the merged network. The implication formulas for each component of the merged network are provided along with references supporting the interactions. (PDF)
Data
Activation states of the merged network upon different stimuli. Lists the state vectors for the merged network with TCR and IL-2R stimulation alone or in combination. (PDF)
Article
Full-text available
T cells orchestrate the adaptive immune response, making them targets for immunotherapy. Although immunosuppressive therapies prevent disease progression, they also leave patients susceptible to opportunistic infections. To identify novel drug targets, we established a logical model describing T-cell receptor (TCR) signaling. However, to have a mod...
Article
This paper focuses on combinatorial feasibility and optimization problems that arise in the context of parameter identification of discrete dynamical systems. Given a candidate parametric model for a physical system and a set of experimental observations, the objective of parameter identification is to provide estimates of the parameter values for...
Article
Full-text available
We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity $i\in{1,2}$ can be split into a bounded number $k_i$ of equally-sized chunks that can be routed on different paths. We show that in contrast to the single-commodity case this problem is NP-hard, and hard to approximate to wi...
Article
Full-text available
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1's on each row are consecutive. A Minimal Conflicting Set is a set of rows that does not have the C1P, but every proper subset has the C1P. Such submatrices have been considered in comparative genomics applications, but very little is known...
Article
The determination of all chemical reaction networks composed of elementary reactions for a given net chemical reaction is one of the fundamental problems in chemistry, since the decomposition elucidates the reaction mechanism. It is essential in a wide range of applications: from the derivation of rate laws in physical chemistry to the design of la...
Conference Paper
Full-text available
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1’s on each row are consecutive. A Minimal Conflicting Set is a set of rows that does not have the C1P, but every proper subset has the C1P. Such submatrices have been considered in comparative genomics applications, but very little is known...
Article
Full-text available
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so...
Article
Full-text available
The authors have declared that no competing interests exist. This work was supported by the German Federal Ministry of Education and Research (HepatoSys and FORSYS-Centre MaCS (Magdeburg Centre for Systems Biology)), the Ministry of Education and Research of Saxony-Anhalt (Research Center “Dynamic Systems”), and the Helmholtz Alliance on Systems B...
Article
Full-text available
A simple model of signal transduction networks in molecular biology consists of CNF formulas with two and three literals per clause. A necessary condition for correctness of the network model is satisfiability of the formulas. Deciding satisfiability turns out to be NP-complete. However, for a subclass that still is of practical interest, a linear...
Article
Full-text available
In this paper, we present a method to determine globally optimal schedules for cyclically operated plants where activities have to be scheduled on limited resources. In cyclic operation, a large number of entities is processed in an identical time scheme. For strictly cyclic operation, where the time offset between entities is also identical for al...
Article
Full-text available
A simple model of signal transduction networks in molecular biology consists of CNF formulas with two and three literals per clause. A necessary condition for correctness of the network model is satisfiability of the formulas. Deciding satisfiability turns out to be NP-complete. However, for a subclass that still is of practical interest, a linear...
Article
Full-text available
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock-out sets of reactions required to block a given behavior. We describe an algorithm that improves the computation of these knock-out sets when the elementary modes (minimal functional subsystems) of the network are given. We also...
Article
Polyhedral relaxation is a powerful tool for determining global bounds on optimal solutions in chemical process synthesis. Combined reaction distillation processes are considered as a challenging application example. To reduce complexity of the resulting mixed integer linear optimization problems, model reduction by means of wave functions is propo...
Conference Paper
Full-text available
1. Abstract Successful mixed integer nonlinear programming algorithms rely on computing tight over- and under- estimators for nonlinear functions. With the advances of mixed integer linear programming, polyhedral approximations over subregions of the original feasible domain have proven to be a successful tool in recent years. Of course, the smalle...
Article
This paper introduces an exact mathematical approach based on combinatorial optimization to analyze continuous linear countercurrent chromatographic processes. The analysis is based on a given set of input parameters including, in particular, purity requirements and number of plates per zone. As an outcome of the analysis either a proof of infeasib...
Article
Full-text available
Cellular decisions are determined by complex molecular interaction networks. Large-scale signaling networks are currently being reconstructed, but the kinetic parameters and quantitative data that would allow for dynamic modeling are still scarce. Therefore, computational studies based upon the structure of these networks are of great interest. Her...
Data
Full-text available
List of Compounds in the Logical T Cell Model Model name corresponds to the name in Figure 1 and Table S2. Common abbreviations are those usually used in the literature, while name is the whole name. Type classifies the molecules, if applies, as follows: K = Kinase, T = Transcription Factor, P = Phosphatase, A = Adaptor Protein, R = Receptor, G = G...
Data
Hyperarcs of the Logical T Cell Signaling Model (see Figure 1 and Methods) Exclamation mark (“!”) denotes a logical NOT, and dots within the equations indicate AND operations. The names of the substances in the explanations are those used in the model and Figure 1; the biological names are displayed in Table S1. In the case where two pools of a mol...
Article
In this paper a new approach for computing global bounds on optimal solutions of mixed-integer nonlinear programs is presented. These type of problems frequently arise in optimal design of chemical processes. The approach is based on a hierarchy of polyhedral relaxations leading to mixed-integer linear programs, which can be solved rigorously. Appl...
Article
This paper considers the problem of approximating a given crystallite orientation distribution function (codf) by a set of texture components. Problems of this type arise for example if the codf has to be reconstructed from discrete orientations or if one looks for a physical interpretation of the codf. The same problem is encountered if crystallog...
Article
This paper is concerned with computer-aided optimal design of combined reaction−distillation processes. The production of solvent 2,3-dimethylbutene-1 by isomerization of 2,3-dimethylbutene-2 is considered as an innovative benchmark problem. Possible process candidates are a reactive distillation column, a reactor coupled to a nonreactive distillat...
Article
This paper is concerned with the computer-aided optimal design of reaction-distillation processes. The production of solvent 2,3-dimethylbutene-1 by isomerization of 2,3-dimethylbutene-2 is considered as an innovative benchmark problem. Possible process candidates are a reactive distillation column, a reactor coupled to a nonreactive distillation c...
Poster
T-cells are able to distinguish foreign antigens among the myriads of self-antigens presented in our body, and organize a directed response against them. While the central sensor for this recognition process is the T-cell receptor (TCR), which binds to peptide-MHC complexes, other signals are also sensed by additional receptors, giving rise to a co...
Article
Full-text available
. This paper introduces an exact primal augmentation algorithm for solving general linear integer programs. The algorithm iteratively substitutes one column in a tableau by other columns that correspond to irreducible solutions of certain linear diophantine inequalities. We prove that various versions of our algorithm are finite. It is a major conc...
Conference Paper
We present a new “primal” algorithm for the stable set problem. It is based on a purely combinatorial construction that can transform every graph into a perfect graph by replacing nodes with sets of new nodes. The transformation is done in such a way that every stable set in the perfect graph corresponds to a stable set in the original graph. The a...
Article
Full-text available
Some operations are described that transform every graph into a perfect graph by replacing nodes with sets of new nodes. The transformation is done in such a way that every stable set in the perfect graph corresponds to a stable set in the original graph. These operations can be used in an augmentation procedure for finding a maximum weighted stabl...
Article
Full-text available
this paper we will discuss how to e#ciently apply the Integral Basis Method to arbitrary binary integer programming problems. It turns out that the procedure is most effective if started at a solution quite close to optimality. If combinatorial problems were to be solved, one could apply any problem-specific heuristic to derive such a solution. Our...
Article
Full-text available
An immediate generalization of the classical McKay correspondence for Gorenstein quotient spaces
Article
Full-text available
This paper deals with algorithmic issues related to the design of an augmentation algorithm for general and 0/1-integer programs. We recall the approach of integer pivoting and introduce the family of Gomory-Young augmentation vectors that can be derived from a simplex tableau. Furthermore, a technique of combining Gomory-Young vectors and combinat...
Article
Full-text available
This paper introduces an exact algorithm for solving integer programs, neither using cutting planes nor enumeration techniques. It is a primal augmentation algorithm that relies on iteratively substituting one column by columns that correspond to irreducible solutions of certain linear diophantine inequalities. We demonstrate the algorithm's potent...
Article
Full-text available
An immediate generalization of the classical McKay correspondence for Gorenstein quotient spaces $\Bbb{C}^{r}/G$ in dimensions $r\geq 4$ would primarily demand the existence of projective, crepant, full desingularizations. Since this is not always possible, it is natural to ask about special classes of such quotient spaces which would satisfy the a...

Network