Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Ulrik Terp"'
Publikováno v:
BMC Nursing, Vol 21, Iss 1, Pp 1-13 (2022)
Abstract Background Stress related psychological problems are growing in nursing education and constitute an essential challenge for educators. This makes research about strategies and interventions to meet these problems important. Stress management
Externí odkaz:
https://doaj.org/article/14c493c35ad844c39fba30e4739b2a52
Autor:
Rasmussen, Ulrik Terp
In this dissertation we study regular expression based parsing and the use of grammatical specifications for the synthesis of fast, streaming string-processing programs. In the first part we develop two linear-time algorithms for regular expression b
Externí odkaz:
http://arxiv.org/abs/1704.08820
Publikováno v:
Health Education & Behavior. 46:922-929
Background. Stress-related problems are an increasing challenge within nurse education since it affects learning, professional development, and mental health negatively. Despite this, knowledge is scarce regarding nursing students’ experiences of b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c776bc0f5e2c8094e0a2dad6f147d57
https://doi.org/10.1177/1090198119865319
https://doi.org/10.1177/1090198119865319
Publikováno v:
Nurse Educator. 44:E1-E5
Nursing students' exposure to stress negatively affects both academic and clinical performance and potentially their future as professional nurses. This pilot study measured the effects of a 10-week cognitive behavioral therapy-based stress managemen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fa7208b48f15ebdacfc4f61e7fa3191
https://doi.org/10.1097/nne.0000000000000492
https://doi.org/10.1097/nne.0000000000000492
Autor:
Fritz Henglein, Ulrik Terp Rasmussen
Publikováno v:
PEPM
Tabular top-down parsing and its lazy variant, Packrat, are linear-time execution models for the TDPL family of recursive descent parsers with limited backtracking. Exponential work due to backtracking is avoided by tabulating the result of each (non
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37317a7bab7b179b379bb670a612d942
https://doi.org/10.1145/3018882.3018889
https://doi.org/10.1145/3018882.3018889
Autor:
Sebastian Paaske Tørholm, Bjørn Bugge Grathwohl, Kristoffer Aalund Søholm, Ulrik Terp Rasmussen, Fritz Henglein
Publikováno v:
POPL
We present and illustrate Kleenex, a language for expressing general nondeterministic finite transducers, and its novel compilation to streaming string transducers with essentially optimal streaming behavior, worst-case linear-time performance and su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81e78016073afd23748d0329741f89f7
https://doi.org/10.1145/2837614.2837647
https://doi.org/10.1145/2837614.2837647
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2014 ISBN: 9783319108810
ICTAC
ICTAC
We study the problem of streaming regular expression parsing: Given a regular expression and an input stream of symbols, how to output a serialized syntax tree representation as an output stream during input stream processing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::110071c5d4abf357087bd99b0caf0991
https://doi.org/10.1007/978-3-319-10882-7_14
https://doi.org/10.1007/978-3-319-10882-7_14
Publikováno v:
Implementation and Application of Automata ISBN: 9783642392733
CIAA
CIAA
We present new algorithms for producing greedy parses for regular expressions (REs) in a semi-streaming fashion. Our lean-log algorithm executes in time O(mn) for REs of size m and input strings of size n and outputs a compact bit-coded parse tree re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de1d7a936ae69fe6dea6354ada7de874
https://doi.org/10.1007/978-3-642-39274-0_7
https://doi.org/10.1007/978-3-642-39274-0_7
Autor:
Ulrik Terp Rasmussen, Andrzej Filinski
Publikováno v:
LFMTP
Formalizing proofs by logical relations in the Twelf proof assistant is known to be notoriously difficult. However, as demonstrated by Schurmann and Sarnat [In Proc. of 23rd Symp. on Logic in Computer Science, 2008] such proofs can be represented and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e61744ffcff57ab494a237cdf47c05e5
https://doi.org/10.1145/2503887.2503891
https://doi.org/10.1145/2503887.2503891
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.