Wolfgang Pauli Institute (WPI) Vienna

Home Practical Information for Visitors Events People WPI Projects
Login Thematic Programs Pauli Fellows Talks Research Groups

[List only upcoming talks]
[List all past talks]

Talks of the past month


Czirok, Andras (University of Kansas) Lecture room HS 13, 2nd floor Fri, 3. Jul 15, 15:30
Contribution of cell contractility to mesothelioma nodule formation
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Szakacs, Gergely (Medical University Vienna) Lecture room HS 13, 2nd floor Fri, 3. Jul 15, 14:20
Modeling in vitro selection of drug resistant cancer cells using a cellular automaton model
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Menche, Jörg (CEU Budapest) Lecture room HS 13, 2nd floor Fri, 3. Jul 15, 13:30
Human diseases in the interactome
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Berger, Walter (Medical University Vienna) Lecture room HS 13, 2nd floor Fri, 3. Jul 15, 11:00
Activity of defense: modeling the anticancer drug response
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Perthame, Benoit (University of Paris 6) Lecture room HS 13, 2nd floor Fri, 3. Jul 15, 10:10
The derivation of free-­‐
boundary (incompressible) models for tumor growth and the Hele-­‐
Shaw asymptotic
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Marciniak-­‐Czochra, Anna (University of Heidelberg) Lecture room HS 13, 2nd floor Fri, 3. Jul 15, 9:00
Mathematical models of clonal selection and therapy resistance in acute leukemias
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Gerner, Christopher (Institute for Analytical Chemistry, Univ. Wien) Lecture room HS 13, 2nd floor Thu, 2. Jul 15, 16:20
Investigation of anticancer drug effects via proteome and metabolome profiling: do we really understand what these drugs are doing?
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Levy, Doron (University of Maryland) Lecture room HS 13, 2nd floor Thu, 2. Jul 15, 15:30
Modeling the immune response to chronic myeloid leukemia
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Sykacek, Peter (Department of Biotechnology, BOKU, Vienna) Lecture room HS 13, 2nd floor Thu, 2. Jul 15, 14:20
Probabilistic models in translational cancer research: converting low level leads to comprehensible predictions
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Clairambault, Jean (INRIA, Rocquencourt) Lecture room HS 13, 2nd floor Thu, 2. Jul 15, 13:30
Drug resistance in cancer: biology, medicine, and modeling
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Saut, Olivier (CNRS, INRIA, Bordeaux) Lecture room HS 13, 2nd floor Thu, 2. Jul 15, 11:00
Data assimilation in tumor growth modeling: towards patient calibrated models using imaging devices
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Grebien, Florian (Boltzmann Institute for Cancer Research, Vienna) Lecture room HS 13, 2nd floor Thu, 2. Jul 15, 10:10
Functional studies of leukemia oncoproteins using integrated approaches
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

Anderson, Alexander (Moffitt Cancer Center) Lecture room HS 13, 2nd floor Thu, 2. Jul 15, 9:00
An integrated approach to understanding tumor-­‐
stromal interactions in cancer progression and treatment
  • Thematic program: Models in Cancer Therapy (MATHCANC-14) (2014)
  • Event: Workshop on "Models in Cancer Therapy" (2015)

QingLin Tang (University of Singapore) WPI, OMP 1, Seminar Room 08.135 Thu, 25. Jun 15, 10:00
Computing ground states of spin 2 Bose-Einstein condensates by the normalized gradient flow
In this talk, an efficient and accurate numerical method will be proposed to compute the ground state of spin-2 Bose-Einstein condensates (BECs) by using the normalized gradient flow (NGF) or imaginary time method (ITM). The key idea is twofold. One is to find the five projection or normalization conditions that are used in the projection step of NGF/ITM, while the other one is to find a good initial data for the NGF/ITM. Based on the relations between chemical potentials and the two physical constrains given by the conservation of the totlal mass and magnetization, these five projection or normalization conditions can be completely and uniquely determined in the context of the the discrete scheme of the NGF discretized by back-Euler finite difference (BEFD) method, which allows one to successfully extend the most powerful and popular NGF/ITM to compute the ground state of spin-2 BECs. Additionally, the structures and properties of the ground states in a uniform system are analysed so as to construct efficient initial data for NGF/ITM. Extensive numerical results on ground states of spin-2 BECs with ferromagnetic/nematic/cyclic interaction and harmonic/optical lattice potential in one/two dimensions are reported to show the efficiency of our method and to demonstrate some interesting physical phenomena.
  • Thematic program: Blow-up and Dispersion in nonlinear Schrödinger and Wave equations (BLOW-14) (2014)
  • Event: Working group on "Efficient numerics for NLS" (2015)

Suciu, Dan (University of Washington) Zemanek seminar room; TU Wien Sat, 6. Jun 15, 11:35
Query Compilation: the View from the Database Side
We study knowledge compilation for Boolean formulas that are given as groundings of First Order formulas. This problem is motivated by probabilistic databases, where each record in the database is an independent probabilistic event, and the query is given by a SQL expression or, equivalently, a First Order formula. The query’s probability can be computed in linear time in the size of the compilation representation, hence the interest in studying the size of such a representation. We consider the “data complexity” setting, where the query is fixed, and the input to the problem consists only of the database instance. We consider several compilation targets, of increasing expressive power: OBDDs, FBDDs, and decision-DNNFs (a subclass of d-DNNFs). For the case of OBDDs we establish a dichotomy theorem for queries in restricted languages FO(\exists, \wedge, \vee) and FO(\forall, \wedge, \vee): for each such query the OBDD is either linear in the size of the database, or grows exponentially, and the complexity can be determined through a simple analysis of the query expression. For the other targets we describe a class of queries for which (a) the decision-DNNF is exponentially large in the size of the database, and (b) the probability of the query can be computed in polynomial time in the size of the database. This suggests that the compilation target decision-DNNF is too weak to capture all tractable cases of probabilistic inference. Our lower bound for decision-DNNF’s relies on a translation into FBDD’s, which is of independent interest. Joint work with Paul Beame, Abhay Jha, Jerry Li, and Sudeepa Roy.
  • Thematic program: Logic and Complexity (LOCO-14) (2014)
  • Event: Symposium on New Frontiers in Knowledge Compilation (2015)

Olteanu, Dan (University of Oxford) Zemanek seminar room; TU Wien Sat, 6. Jun 15, 10:05
Factorized Databases.
will overview recent work on compilation of join queries (First Order formulas with conjunction and existential quantification) into lossless factorized representations. The primary motivation for this compilation is to avoid redundancy in the representation of results (satisfying assignments) of queries in relational databases. The relationship between a relation encoded as a set of tuples and an equivalent factorized representation is on a par with the relationship between propositional formulas in disjunctive normal form and their equivalent nested formulas obtained by algebraic factorization. For any fixed join query, we give asymptotically tight bounds on the size of their factorized results by exploiting the structure of the query, and we quantify the size gap between factorized and standard relational representation of query results. Factorized databases allow for constant-delay enumeration of represented tuples and provide efficient support for subsequent queries and analytics, such as linear regression. Joint work with Jakub Zavodny.
  • Thematic program: Logic and Complexity (LOCO-14) (2014)
  • Event: Symposium on New Frontiers in Knowledge Compilation (2015)

Kratsch, Stefan (Universität Bonn) Zemanek seminar room; TU Wien Sat, 6. Jun 15, 9:15
Kernelization: Efficient Preprocessing for NP-hard Problems
Efficient preprocessing is a widely applied opening move when faced with a combinatorially hard problem. The framework of parameterized complexity and its notion of kernelization offer a rigorous approach to understanding the capabilities of efficient preprocessing. In particular, it is possible to prove both upper and lower bounds on the output sizes that be achieved by polynomial-time algorithms. Crucially, using the perspective of parameterized complexity, these bounds are given in relation to problem-specific parameters, whereas unless P = NP there can be no efficient algorithm that shrinks every instance of an NP-hard problem. The talk will give an introduction to kernelization and cover several different problems like \textsc{Point Line Cover}, \textsc{$d$-Hitting Set}, and \textsc{Planar Steiner Tree}. We will discuss some recent examples of kernelizations that may be of particular interest to this meeting. Finally, we will briefly address the basic intuition behind lower bounds for kernelization.
  • Thematic program: Logic and Complexity (LOCO-14) (2014)
  • Event: Symposium on New Frontiers in Knowledge Compilation (2015)
© WPI 2001-2008. Email : wpi@mat.univie.ac.at webmaster [Printable version]