SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Brand T) ;mspu:(conferencepaper)"

Sökning: WFRF:(Brand T) > Konferensbidrag

  • Resultat 1-9 av 9
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Andreani, P., et al. (författare)
  • The European ALMA Regional Centre: a model of user support
  • 2014
  • Ingår i: Proceedings of SPIE - The International Society for Optical Engineering. - : SPIE. - 0277-786X .- 1996-756X. - 9780819496171 ; 9149, s. Art. no. 91490Y-
  • Konferensbidrag (refereegranskat)abstract
    • The ALMA Regional Centres (ARCs) form the interface between the ALMA observatory and the user community from the proposal preparation stage to the delivery of data and their subsequent analysis. The ARCs provide critical services to both the ALMA operations in Chile and to the user community. These services were split by the ALMA project into core and additional services. The core services are financed by the ALMA operations budget and are critical to the successful operation of ALMA. They are contractual obligations and must be delivered to the ALMA project. The additional services are not funded by the ALMA project and are not contractual obligations, but are critical to achieve ALMA full scientific potential. A distributed network of ARC nodes (with ESO being the central ARC) has been set up throughout Europe at the following seven locations: Bologna, Bonn-Cologne, Grenoble, Leiden, Manchester, Ondrejov, Onsala. These ARC nodes are working together with the central node at ESO and provide both core and additional services to the ALMA user community. This paper presents the European ARC, and how it operates in Europe to support the ALMA community. This model, although complex in nature, is turning into a very successful one, providing a service to the scientific community that has been so far highly appreciated. The ARC could become a reference support model in an age where very large collaborations are required to build large facilities, and support is needed for geographically and culturally diverse communities.
  •  
2.
  • Dobbins, Trevor David, 1965, et al. (författare)
  • Human-centred, scalable, combat system design for littoral operations
  • 2015
  • Ingår i: International Conference on Warship 2015: Future Surface Vessels; Bath; United Kingdom; 10 June 2015 through 11 June 2015. - 9781909024410 ; , s. 103-113
  • Konferensbidrag (refereegranskat)abstract
    • Combat operations in the littoral and amphibious environments present unique challenges to both the warfighters, and the system designers. High-tempo navigation, in shallow / congested waters, and in degraded visual environments, increases the stresses on the individuals and teams before combat related tasks are considered. All combat tasks require the crew, and the crafts systems, to have the appropriate level of situation awareness and decision making capability. This Joint Cognitive System (JCS) supports the interoperability needed to achieve successful operational outcomes, particularly in joint operations. Resilience, is essential in the high-tempo coastal environment. Littoral / amphibious craft, being typically small and fast, and by necessity lean manned must be efficient and optimised. Understanding the crew's roles, tasks and competences provides the definitions required for the information architectures and flow, both intra and inter vessel, that supports the JCS and defines the vessel's Combat System. The JCS, and therefore the Combat System, can be scaled with the vessels size, as a number of the crews / systems functions remain the same. Designing the combat JCS from a human-centred perspective, provides an essential foundation for designing the vessel and delivering the required littoral / amphibious capability.
  •  
3.
  • Dobbins, T, et al. (författare)
  • Information architecture for fast response craft - Command & control & human systems integration
  • 2013
  • Ingår i: RINA, Royal Institution of Naval Architects - International Conference on SURV 2013, Surveillance Search and Rescue Craft. - 9781909024137 ; , s. 117-120
  • Konferensbidrag (refereegranskat)abstract
    • Command & Control (C2) is required for safe and effective maritime operations. To facilitate effective decision-making and C2, it is essential that the crew can access the required information. It is therefore essential that the appropriate information architecture is used. Navigation, being an essential aspect of C2, has seen a radical change from paper charts and individual instruments to computer systems capable of sophisticated data fusion to provide enhanced situational awareness. The development of the required information architecture is not a software/engineering issue, but rather lies within the human factors domain as it requires an understanding of how humans perceive information, how they use mental models and subsequently make safe and effective decisions. © 2013: The Royal Institution of Naval Architects.
  •  
4.
  • Forsberg, Ulrika, et al. (författare)
  • Spectroscopic Tools Applied to Element Z = 115 Decay Chains
  • 2014
  • Ingår i: EPJ Web of Conferences. - : EDP Sciences. - 2100-014X .- 2101-6275. - 9782759811755 - 9782759811762 ; 66, s. 02036-02036
  • Konferensbidrag (refereegranskat)abstract
    • Nuclides that are considered to be isotopes of element Z = 115 were produced in the reaction 48Ca + 243Am at the GSI Helmholtzzentrum für Schwerionenforschung Darmstadt. The detector setup TASISpec was used. It was mounted behind the gas-filled separator TASCA. Thirty correlated α-decay chains were found, and the energies of the particles were determined with high precision. Two important spectroscopic aspects of the offline data analysis are discussed in detail: the handling of digitized preamplified signals from the silicon strip detectors, and the energy reconstruction of particles escaping to upstream detectors relying on pixel-by-pixel dead-layer thicknesses.
  •  
5.
  •  
6.
  • van den Brand, Jan, et al. (författare)
  • Minimum Cost Flows, MDPs, and ?1-Regression in Nearly Linear Time for Dense Instances
  • 2021
  • Ingår i: Proceedings of the Annual ACM Symposium on Theory of Computing. - New York, NY, USA : Association for Computing Machinery (ACM). ; , s. 859-869
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we provide new randomized algorithms with improved runtimes for solving linear programs with two-sided constraints. In the special case of the minimum cost flow problem on n-vertex m-edge graphs with integer polynomially-bounded costs and capacities we obtain a randomized method which solves the problem in O(m + n1.5) time. This improves upon the previous best runtime of O(m ?n) [Lee-Sidford'14] and, in the special case of unit-capacity maximum flow, improves upon the previous best runtimes of m4/3 + o(1) [Liu-Sidford'20, Kathuria'20] and O(m ?n) [Lee-Sidford'14] for sufficiently dense graphs. In the case of ?1-regression in a matrix with n-columns and m-rows we obtain a randomized method which computes an ?-approximate solution in O(mn + n2.5) time. This yields a randomized method which computes an ?-optimal policy of a discounted Markov Decision Process with S states and, A actions per state in time O(S2 A + S2.5). These methods improve upon the previous best runtimes of methods which depend polylogarithmically on problem parameters, which were O(mn1.5) [Lee-Sidford'15] and O(S2.5 A) [Lee-Sidford'14, Sidford-Wang-Wu-Ye'18] respectively. To obtain this result we introduce two new algorithmic tools of possible independent interest. First, we design a new general interior point method for solving linear programs with two sided constraints which combines techniques from [Lee-Song-Zhang'19, Brand et al.'20] to obtain a robust stochastic method with iteration count nearly the square root of the smaller dimension. Second, to implement this method we provide dynamic data structures for efficiently maintaining approximations to variants of Lewis-weights, a fundamental importance measure for matrices which generalize leverage scores and effective resistances. 
  •  
7.
  • Bernstein, A., et al. (författare)
  • Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
  • 2022
  • Ingår i: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). - : Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
  • Konferensbidrag (refereegranskat)abstract
    • Designing efficient dynamic graph algorithms against an adaptive adversary is a major goal in the field of dynamic graph algorithms and has witnessed many exciting recent developments in, e.g., dynamic matching (Wajc STOC'20) and decremental shortest paths (Chuzhoy and Khanna STOC'19). Compared to other graph primitives (e.g. spanning trees and matchings), designing such algorithms for graph spanners and (more broadly) graph sparsifiers poses a unique challenge since there is no fast deterministic algorithm known for static computation and the lack of a way to adjust the output slowly (known as “small recourse/replacements”). This paper presents the first non-trivial efficient adaptive algorithms for maintaining many sparsifiers against an adaptive adversary. Specifically, we present algorithms that maintain 1. a polylog(n)-spanner of size Õ(n) in polylog(n) amortized update time, 2. an O(k)-approximate cut sparsifier of size Õ(n) in Õ(n1/k) amortized update time, and 3. a polylog(n)-approximate spectral sparsifier in polylog(n) amortized update time. Our bounds are the first non-trivial ones even when only the recourse is concerned. Our results hold even against a stronger adversary, who can access the random bits previously used by the algorithms and the amortized update time of all algorithms can be made worst-case by paying sub-polynomial factors. Our spanner result resolves an open question by Ahmed et al. (2019) and our results and techniques imply additional improvements over existing results, including (i) answering open questions about decremental single-source shortest paths by Chuzhoy and Khanna (STOC'19) and Gutenberg and Wulff-Nilsen (SODA'20), implying a nearly-quadratic time algorithm for approximating minimum-cost unit-capacity flow and (ii) de-amortizing a result of Abraham et al. (FOCS'16) for dynamic spectral sparsifiers. Our results are based on two novel techniques. The first technique is a generic black-box reduction that allows us to assume that the graph is initially an expander with almost uniform-degree and, more importantly, stays as an almost uniform-degree expander while undergoing only edge deletions. The second technique is called proactive resampling: here we constantly re-sample parts of the input graph so that, independent of an adversary's computational power, a desired structure of the underlying graph can be always maintained. Despite its simplicity, the analysis of this sampling scheme is far from trivial, because the adversary can potentially create dependencies between the random choices used by the algorithm. We believe these two techniques could be useful for developing other adaptive algorithms.
  •  
8.
  • Dobbins, Trevor David, 1965, et al. (författare)
  • Search & rescue and maritime security in the arctic - System design challenges and solutions
  • 2015
  • Ingår i: International Conference on Ice Class Vessels; London; United Kingdom. - 9781909024397 ; , s. 17-22
  • Konferensbidrag (refereegranskat)abstract
    • The increasing prevalence of voyages within the Arctic region is highlighting the growing need to understand the implications of delivering Search And Rescue (SAR) and Maritime Security (MARSEC) within the Arctic. Operating within this hostile environment requires specific system capabilities and resilience. This capability is not delivered by a single type or class of vessel, but rather a system-of-systems, including multinational cooperation. The issue of the large distances between safe havens is recognized, particularly the problem of it taking a long time for help to reach a vessel in distress assuming communication is possible. Therefore vessels need to be designed and outfitted with systems and equipment to support the crew and passengers for many days in harsh conditions, as well as the capability to help other vessels in distress, e.g. greater capability for deployable rescue craft assets. Therefore Arctic SAR and MARSEC operations require resilient System-of-Systems solutions, with embedded Human Systems Integration (HSI), to support safe and effective Arctic voyages.
  •  
9.
  • Khuyagbaatar, J., et al. (författare)
  • Fission in the landscape of heaviest elements: Some recent examples
  • 2016
  • Ingår i: Nobel Symposium NS 160 – Chemistry and Physics of Heavy and Superheavy Elements. - : EDP Sciences. - 9782759890118 ; 131
  • Konferensbidrag (refereegranskat)abstract
    • The fission process still remains a main factor that determines the stability of the atomic nucleus of heaviest elements. Fission half-lives vary over a wide range, 10^−19 to 10^24 s. Present experimental techniques for the synthesis of the superheavy elements that usually measure α-decay chains are sensitive only in a limited range of half-lives, often 10^5 to 10^3 s. In the past years, measurement techniques for very short-lived and very long-lived nuclei were significantly improved at the gas-filled recoil separator TASCA at GSI Darmstadt. Recently, several experimental studies of fission-related phenomena have successfully been performed. In this paper, results on 254−256Rf and 266Lr are presented and corresponding factors for retarding the fission process are discussed.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-9 av 9

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy