Search results for "SJ"
showing 10 items of 2539 documents
On the use of Digital Image Correlation (DIC) for evaluating the tensile behaviour of BFRCM strips
2019
Abstract. Fibre Reinforced Cementitious Matrix (FRCM) composites are becoming largely adopted for retrofitting masonry structures. These materials offer several advantages in comparison to Fibre Reinforced Polymer (FRP) composites, such as good resistance to fire and high temperatures, vapour permeability, possibility to be applied on wet surfaces, higher compatibility with the masonry substrate. However, the tensile behavior of FRCM materials is more complex compared to FRP composites, due to the limited tensile strength of the cement-based matrix. For this reason, FRCM materials require appropriate tensile characterization and, in this context, the use of non-conventional measurement syst…
What a Friend We Have in Facebook : Norwegian Christian Churches’ Use of Social Media
2021
This study examines how Christian churches in Norway use social media. The key finding is that the churches do not take extensive advantage of the opportunities for two-way communication offered by the platforms, but primarily use their social media channels to promote church activities or broadcast content without inviting a dialogue. Based on the churches’ own stated appreciation for building relationships, as well as existing research from media and communication studies, media and religion studies, and studies within strategic communication, this article argues for a stronger focus on the ritual and relational aspects of online communication from the church organizations. Pais Open Acce…
Combinations of discourse markers with repairs and repetitions in English, French and Spanish
2020
Abstract Discourse markers have a central role in planning and repairing processes of speech production. They relate with fluency and disfluency phenomena such as pauses, repetitions and reformulations. Their polyfunctionality is challenging and few form-function mappings are stable cross-linguistically. This study combines a functional and a structural approach to discourse markers and their combination with and within repetitions and self-repairs in native English, French and Spanish, in order to establish the inter-relation between these three fluency-related devices and to find potentially universal patterns of use. Qualitative coding and quantitative analyses of categories of markers a…
Uncertainty measures—Problems concerning additivity
2009
Additivity of an uncertainty measure on an MV-algebra has a clear meaning. If the divisibility is dropped, we come up to a so-called Girard algebra. There we discuss strong resp. weak additivity based on so-called divisible disjoint unions resp. on additivity for all sub-MV-algebras. We obtain a description of those extensions from additive measures on an MV-algebra to the canonical Girard algebra extension of pairs which are strongly additive and valuation measures. Finally, we prove the non-existence of strongly additive measure extensions, if the underlying MV-algebra is a finite chain with more than two non-trivial elements.
Perturbations of surjective convolution operators
2002
Let μ 1 and μ 2 be (ultra)distributions with compact support which have disjoint singular supports. We assume that the convolution operator f → μ 1 *f is surjective when it acts on a space of functions or (ultra)distributions, and we investigate whether the perturbed convolution operator f→ (μ 1 + μ 2 ) * f is surjective. In particular we solve in the negative a question asked by Abramczuk in 1984.
Every triangle-free induced subgraph of the triangular lattice is(5m,2m)-choosable
2014
A graph G is (a,b)-choosable if for any color list of size a associated with each vertex, one can choose a subset of b colors such that adjacent vertices are colored with disjoint color sets. This paper proves that for any integer m>=1, every finite triangle-free induced subgraph of the triangular lattice is (5m,2m)-choosable.
The support localization property of the strongly embedded subspaces of banach function spaces
2015
[EN] Motivated by the well known Kadec-Pelczynski disjointifcation theorem, we undertake an analysis of the supports of non-zero functions in strongly embedded subspaces of Banach functions spaces. The main aim is to isolate those properties that bring additional information on strongly embedded subspaces. This is the case of the support localization property, which is a necessary condition fulflled by all strongly embedded subspaces. Several examples that involve Rademacher functions, the Volterra operator, Lorentz spaces or Orlicz spaces are provided.
A Polynomial Quantum Query Lower Bound for the Set Equality Problem
2004
The set equality problem is to tell whether two sets A and B are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorphism problem. It was an open problem to find any ω(1) query lower bound when sets A and B are given by quantum oracles. We will show that any error-bounded quantum query algorithm that solves the set equality problem must evaluate oracles \(\Omega(\sqrt[5]{\frac{n}{\ln n}})\) times, where n=|A|=|B|.
The Separable Complementation Property and Mrówka Compacta
2017
We study the separable complementation property for $C(K_{\cal A})$ spaces when $K_{\cal A}$ is the Mr\'owka compact associated to an almost disjoint family ${\cal A}$ of countable sets. In particular we prove that, if ${\cal A}$ is a generalized ladder system, then $C(K_{\cal A})$ has the separable complementation property ($SCP$ for short) if and only if it has the controlled version of this property. We also show that, when ${\cal A}$ is a maximal generalized ladder system, the space $C(K_{\cal A})$ does not enjoy the $SCP$.
Conjunction and Disjunction Among Conditional Events
2017
We generalize, in the setting of coherence, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. Given a prevision assessment on the conjunction of two conditional events, we study the set of coherent extensions for the probabilities of the two conditional events. Then, we introduce by a progressive procedure the notions of conjunction and disjunction for n conditional events. Moreover, by defining the negation of conjunction and of disjunction, we show that De Morgan’s Laws still hold. We also show that the associative and commutative properties are satisfied. Finally, we examine in detail the conjunction for a family \(\mathcal F\) of t…