NUK - logo

Search results

Basic search    Expert search   

Currently you are NOT authorised to access e-resources NUK. For full access, REGISTER.

19 20 21 22 23
hits: 221
201.
  • The Sloan Digital Sky Survey Quasar Catalog: Twelfth data release
    Malanushenko, Viktor; Merloni, Andrea; Oravetz, Daniel ... 01/2017
    Dissertation

    We present the Data Release 12 Quasar catalog (DR12Q) from the Baryon Oscillation Spectroscopic Survey (BOSS) of the Sloan Digital Sky Survey III. This catalog includes all SDSS-III /BOSS objects ...
Check availability
202.
  • Canonical tree-decompositions of finite graphs II. Essential parts
    Carmesin, Johannes; Diestel, Reinhard; Hamann, Matthias ... arXiv (Cornell University), 04/2014
    Paper, Journal Article
    Open access

    In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on ...
Full text
203.
  • Canonical tree-decompositions of finite graphs I. Existence and algorithms
    Carmesin, Johannes; Diestel, Reinhard; Hamann, Matthias ... arXiv (Cornell University), 04/2014
    Paper, Journal Article
    Open access

    We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, ...
Full text
204.
  • Modeling of Catalytic Membr... Modeling of Catalytic Membrane Reactors Operated with Liquids under Nonstationary Conditions
    Garayhi, Abdul Rahman; Flügge-Hamann, Uta; Keil, Frerich Johannes Chemical engineering & technology, 01/1998, Volume: 21, Issue: 1
    Journal Article
    Peer reviewed

    In membrane reactors, a reaction mixture or a part of it passes through a membrane. The membrane can selectively separate a mixture of different compositions. The membrane can be catalytically active ...
Full text
205.
  • k$-Blocks: a connectivity invariant for graphs
    Carmesin, Johannes; Diestel, Reinhard; Hamann, Matthias ... arXiv (Cornell University), 05/2013
    Journal Article
    Open access

    SIDMA 28 (2014), 1876-1891 A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by fewer than $k$ other vertices. The block number $\beta(G)$ ...
Full text
206.
Full text

PDF
207.
  • (k\)-Blocks: a connectivity invariant for graphs
    Carmesin, Johannes; Diestel, Reinhard; Hamann, Matthias ... arXiv.org, 11/2015
    Paper
    Open access

    A \(k\)-block in a graph \(G\) is a maximal set of at least \(k\) vertices no two of which can be separated in \(G\) by fewer than \(k\) other vertices. The block number \(\beta(G)\) of \(G\) is the ...
Full text
208.
  • Doxycycline‐Induced Express... Doxycycline‐Induced Expression of Transgenic Human Tumor Necrosis Factor α in Adult Mice Results in Psoriasis‐like Arthritis
    Retser, Eugen; Schied, Tanja; Skryabin, Boris V. ... Arthritis and rheumatism, September 2013, Volume: 65, Issue: 9
    Journal Article
    Open access

    Objective To generate doxycycline‐inducible human tumor necrosis factor α (TNFα)–transgenic mice to overcome a major disadvantage of existing transgenic mice with constitutive expression of TNFα, ...
Full text

PDF
209.
Full text

PDF
210.
  • Detailed analysis of networ... Detailed analysis of network losses in a million customer distribution grid with high penetration of distributed generation
    Heckmann, W; Hamann, L; Braun, M ... 22nd International Conference and Exhibition on Electricity Distribution (CIRED 2013), 2013
    Conference Proceeding
    Open access

    Understanding network losses is important regarding energy efficiency and grid regulation. A method was developed to determine grid losses for each voltage level of a distribution grid and to ...
Full text
19 20 21 22 23
hits: 221

Load filters