2,215 research outputs found

    Joint Release from Reps. Udall, Rhodes and Steiger

    No full text
    Document: Joint Release from Reps. Udall, Rhodes and Steiger, February 27, 196

    A comparison of methods for discrete L_1 curve-fitting

    No full text
    We study discrete L_1, curve-fitting of n points in k dimensional space. Execution times for the algorithms of Barrodaie-Roberts (BR), Bartels-Conn-Sinclair (BCS), and Bloomfieid-Steiger (BS) - three of the best LAD curve-fitting procedures - are compared over a variety of deterministic and random curve-fitting problems. Analysis of the results allows us to make surprisingly precise statements about the computational complexity of these algorithms. In particular, BR is in a different complexity ciass than BCS and BS as the number of points,n, increases. All algorithms are linear in'the dimension, k, andBS is less complex than BCS.Technical report DCS-TR-9

    Considerations for the acute management of aneurysmal subarachnoid hemorrhage

    No full text
    Contains fulltext : 194333.pdf (Publisher’s version ) (Open Access)Radboud University, 27 augustus 2018Promotores : Bartels, R.H.M.A., Steiger, H.J. Co-promotores : Boogaarts, H.D., Beseoglu, K.143 p

    Steiger et al 2007 ProcRSoc Data

    No full text
    This is a Microsoft Excel spreadsheet containing the data for Steiger et al (2007) The smell of parents: breeding status influences cuticular hydrocarbon pattern in the burying beetle Nicrophorus vespilloides. A gas chromatographic analysis of the cuticular lipids of different groups of N. vespilloides individuals of both sexes was performed. Data represent raw peak areas for each of 91 peaks quantified by GC. For compound identity of peaks please see publication

    Pseudoproxies for the paper "A pseudoproxy assessment of data assimilation for reconstructing the atmosphere–ocean dynamics of hydroclimate extremes"

    No full text
    <p>Pseudoproxies for the paper “A pseudoproxy assessment of data assimilation for reconstructing the atmosphere–ocean dynamics of hydroclimate extremes” by Steiger and Smerdon 2017.</p> <p>If you have further questions, address them to the author Nathan J. Steiger.</p&gt

    Ontwerp van een houten steiger als losplaats voor een visserijhaven in Lagos, Nigeria

    No full text
    Voor de visserijhaven van Lagos, Nigeria, waarvoor het masterplan in het deelontwerp verkeerswaterbouwkunde is opgesteld, wordt de losplaats constructief ontworpen. Uitgangspunt is geweest dat voor de constructie zoveel mogelijk gebruik wordt gemaakt van de locaal aanwezige materialen en uitvoeringscapaciteit. De arbeidsintensieve bouwwijze en het gegeven dat Azobé in Nigeria zelf groeit hebben doen besluiten voor een houten steiger te kiezen. Deze steiger is doorgerekend voornamelijk op stootbelasting als gevolg van de botsing van een merend schip. Omdat op de steiger ook de vishal is geprojecteerd mogen de versnellingen niet te groot worden. Het lijkt zinvol om de steiger te beschermen door een fenderconstructie of een apart meersysteem. Deze mogelijkheden zijn verder onderzocht, waarbij vooral de stijfheid van de onderdelen belangrijk is. Gekomen wordt tot een keuze, waarna de constructie in een tekening is vastgelegd.constructieve waterbouwkundeHydraulic EngineeringCivil Engineering and Geoscience

    An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D

    No full text
    Let C be a set of n axis-aligned cubes of arbitrary sizes in ℝ³. Let U be their union, and let κ be the number of vertices on ∂U; κ can vary between O(1) and O(n²). We show that U can be computed in O(n log³ n + κ) time if C is in general position. The algorithm also computes the union of a set of fat boxes (i.e., boxes with bounded aspect ratio) within the same time bound. If the cubes in C are congruent or have bounded depth, the running time improves to O(n log² n), and if both conditions hold, the running time improves to O(n log n)

    Steiger et al 2013 Proc R Soc Sagebrush Data

    No full text
    This is a Microsoft Excel spreadsheet containing the data for Steiger et al (2013) Sexual selection on cuticular hydrocarbons of male sagebrush crickets in the wild. Column headings are either self explanatory or further details are at the bottom of the table. Data contained in columns D to AY represents area for CHC peaks 1-48 expressed in proportional values after dividing by a pentadecane standard

    Art Complex Het Steiger: Adaptive reuse of a Dominican church complex in Rotterdam

    No full text
    This study explores the potential application of architectural considerations from three Dominican priories—St. Dominic Church, Sainte-Marie de La Tourette, and the Dominican Motherhouse— emphasising their reflection of divine transcendence as a design narrative for the adaptive reuse of St. Dominic Church to multifunctional Art Complex Het Steiger. St. Dominic Churchʼs introverted design offers opportunities for reinterpretation, emphasising hierarchy and contemplative qualities. Sainte-Marie de La Touretteʼs mystical themes suggest diverse lighting interventions and preserving a mystical atmosphere in Het Steiger. The Dominican Motherhouse poses challenges regarding user groups, spatial hierarchies, and integrating circulation and exhibition spaces in Het Steigerʼs redesign. These priories contribute nuanced design strategies, offering valuable considerations for Het Steigerʼs transformation into a harmonious coexistence of existing and new architectural layers.Architecture, Urbanism and Building Sciences | Heritage & Architectur

    Single-face non-crossing shortest paths in planar graphs

    No full text
    The student, Alexander Steiger, submitted this Thesis for approval on 2017-07-12 at 16:52.We consider the following problem: Given an n-vertex undirected planar-embedded graph with a simple boundary cycle, non-negative edge lengths, and k pairs of terminals {(s_1,t_1),(s_2,t_2),...,(s_k,t_k)} specified on the boundary, find non-crossing shortest paths connecting all pairs of terminals (if any such paths exist). We present an algorithm to find such paths in O(n log log k) time which improves upon the previous best runtime of O(n log k) by Takahashi, Suzuki, and Nishizeki [Algorithmica 1996].Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-09-29 without embargo termsThe student, Alexander Steiger, accepted the attached license on 2017-07-08 at 13:28.This Thesis was approved for publication on 2017-07-13 at 16:18.DSpace SAF Submission Ingestion Package generated from Vireo submission #11343 on 2017-09-29 at 11:28:27Made available in DSpace on 2017-09-29T17:56:33Z (GMT). No. of bitstreams: 2 STEIGER-THESIS-2017.pdf: 358042 bytes, checksum: 449148067e5460bcf49e4b924ac6c43e (MD5) LICENSE.txt: 4214 bytes, checksum: 448b59ad5fe37a5e627970f7187ac3b2 (MD5) Previous issue date: 2017-07-1
    corecore