Search results for "ECK"
showing 10 items of 2091 documents
Synthesis and structural characterization of ethylene copolymers containing double-decker silsesquioxane as pendant groups and cross-linkage sites by…
2018
Abstract The copolymers of ethylene with the double-decker silsesquioxane (DDSQ) were synthesized by copolymerization with the use of metallocene and bis(phenoxy-imine) catalysts. The influence of the kind of the catalyst and polyreaction conditions on the performance of copolymerization as well as on the properties of the copolymers was studied. Depending on polyreaction parameters, the DDSQ contents in the copolymer varied in the range of 0.93–11.53 wt% which determined the compositions and the structural properties of copolymers. DDSQ incorporated into the polymer chain could constitute pendant groups in the main chain or it could act as a cross-linking agent. The ethylene/DDSQ copolymer…
Evaluating the extent of patient-centred care in a selection of ESC guidelines
2019
AIMS: Patient-centred care (PCC) is the cornerstone for healthcare professionals to promote high quality care for patients with cardiovascular conditions. It is defined as 'Providing care that is respectful of, and responsive to, individual patient preferences, needs and values, and ensuring that patient values guide all clinical decisions'. PCC can improve patient outcomes and allow patients and healthcare professionals to manage care collaboratively using best available evidence. However, there is no clear understanding how extensively guidelines incorporate PCC recommendations. The aim of the study was to evaluate the incorporation of PCC into a selection of guidelines published by the E…
The Magical Treasure and Its Guardians
2012
On 17 June 1499, John and Agnes Clerk from Great Ashfield as well as their young daughter Marion had to answer charges before the consistory court of Norwich. The ecclesiastical court had learned that the girl worked as a healer and a soothsayer, and that she claimed she could locate buried treasures. Marion admitted everything immediately, even with an air of self-importance. She said that she got her abilities from God, the Virgin Mary and from the fairies. The ecclesiastical judge seems to have amused himself asking the girl about the details. The fairies, Marion explained, were little people who gave her information whenever she needed it. They did not believe in Jesus and the Holy Spir…
Why are viral genomes so fragile? The bottleneck hypothesis
2021
If they undergo new mutations at each replication cycle, why are RNA viral genomes so fragile, with most mutations being either strongly deleterious or lethal? Here we provide theoretical and numerical evidence for the hypothesis that genetic fragility is partly an evolutionary response to the multiple population bottlenecks experienced by viral populations at various stages of their life cycles. Modelling within-host viral populations as multi-type branching processes, we show that mutational fragility lowers the rate at which Muller’s ratchet clicks and increases the survival probability through multiple bottlenecks. In the context of a susceptible-exposed-infectious-recovered epidemiolog…
Supporting Autonomous Navigation of Visually Impaired People for Experiencing Cultural Heritage
2020
In this chapter, we present a system for indoor and outdoor localization and navigation to allow the low vision users in experiencing cultural heritage in autonomy. The system is based on the joint utilization of dead-reckoning and computer vision techniques on a smartphone-centric tracking system. The system is explicitly designed for visually impaired people, but it can be easily generalized to other users, and it is built under the assumption that special reference signals, such as colored tapes, painted lines, or tactile paving, are deployed in the environment for guiding visually impaired users along pre-defined paths. Differently from previous works on localization, which are focused …
Sequentializing Parameterized Programs
2012
We exhibit assertion-preserving (reachability preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequential programs. The salient feature of the sequential program is that it tracks the local variables of only one thread at any point, and uses only O(k) copies of shared variables (it does not use extra counters, not even one counter to keep track of the number of threads). Sequentialization is achieved using the concept of a linear interface that captures the effect an unbounded block of processes have on the shared state in a k-round schedule. Our transformation utilizes linear interfaces to sequentialize the progra…
Factorizations of the Fibonacci Infinite Word
2015
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from elementary properties of the Fibonacci numbers.
Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities
2016
One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such task…
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
2020
AbstractIn model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubborn sets shows that a combination of several conditions on the reduction is sufficient to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a solution together with an updated correctness proof. Furthermore, we analyse in whi…
On prefix normal words and prefix normal forms
2016
A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their factors. We prove that the language of prefix normal words is not context-free and is strictly contai…