Results 51 to 60 of about 1,782,235 (292)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survivorship care plans (SCPs) summarize cancer treatment and guide risk‐based follow‐up for cancer survivors, yet remain difficult to create, share, and use. Stakeholder perspectives are needed to inform usable approaches.
Molly S. Talman +4 more
wiley +1 more source
On dots in boxes, or Permutation pattern classes and regular languages [PDF]
, 2015 This thesis investigates permutation pattern classes in a language theoretic context. Specifically we explored the regularity of sets of permutations under the rank encoding. We found that the subsets of plus- and minus-(in)decomposable permutations of
Hoffmann, Ruth
core +2 more sources
Using Data Mining Algorithms to Discover Regular Sound Changes among Languages [PDF]
MATEC Web of Conferences, 2019 This paper presents a method of using association rule data mining algorithms to discover regular sound changes among languages. The method presented has a great potential to facilitate linguistic studies aimed at identifying distantly related cognate ...
Revesz Peter Z.
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survivors of pediatric brain tumors (PBTs) can experience long‐term social difficulties, impacting quality of life. Beyond medical and environmental factors, family psychosocial risk may play a role in social outcomes by shaping the caregiving environment and may provide intervention options.
Renske H. Houben +4 more
wiley +1 more source
Non-Deterministic Kleene Coalgebras [PDF]
Logical Methods in Computer Science, 2010 In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems.
Alexandra Silva +2 more
doaj +1 more source
Numeration Systems on a Regular Language [PDF]
Theory of Computing Systems, 2000 Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable.
Lecomte, Pierre, Rigo, Michel
openaire +4 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
The Bridge Between Regular Cost Functions and Omega-Regular Languages [PDF]
, 2016 In this paper, we exhibit a one-to-one correspondence between omega-regular languages and a subclass of regular cost functions over finite words, called omega-regular like cost functions.
Fijalkow, Nathanaël, Colcombet, Thomas
core +1 more source
Regular Separability of One Counter Automata [PDF]
Logical Methods in Computer Science, 2019 The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other.
Wojciech Czerwiński, Sławomir Lasota
doaj +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source