Search results for "DPR"
showing 10 items of 303 documents
Co-participatory multimodal intergenerational storytelling : preschool children’s relationship with modality creating elder inclusion
2021
The COVID-19 crisis has highlighted elderly people as a vulnerable and excluded community, and connecting to the younger social media generation requires a shift in intergenerational storytelling performance. Recent research on multimodality has emphasized its benefits for the interactional process in storytelling. This study examines three aspects of storytelling – participation, multimodality, and emotional interaction – and uses co-creation and multimodal discourse analysis to investigate two questions: (1) To what extent can intergenerational storytelling benefit older people’s community engagement? (2) In a globalized world, how do children’s relationships with modalities create new l…
Why braille reading is important and how to study it /Por qué es importante la lectura en braille y cómo estudiarla
2016
AbstractDespite its relevance in theoretical and practical terms, braille reading has received little attention from researchers. Awareness of the pros and cons of the different procedures used to examine braille reading is needed to facilitate the realization of systematic studies and to improve teaching methods in braille reading. This study provides a critical examination of braille reading methods and highlights key points for future studies on tactile reading.
Studying social media as semiotic technology: a social semiotic multimodal framework
2018
How do we study social media technology? While social semiotics provides an extensive toolkit for analysing multimodal texts and semiotic practices, the study of social media as semiotic technology poses a significant challenge to existing research methodologies. In this article, we present a social semiotic framework that allows us to describe in analytical details the multimodal meaning potentials offered by digital social media technology and connect these to multimodal text-making and semiotic practices while underscoring the role of technology. Our framework is organized around seven interrelated and inherently informed dimensions: (1) multimodality, (2) practice, (3) the social, (4) m…
Sphingomonas fennica sp. nov. and Sphingomonas haloaromaticamans sp. nov., outliers of the genus Sphingomonas.
2007
Bacterial isolates obtained from polychlorophenol-contaminated sites in Finland (strain K101T) and from a Dutch drinking water well (strain A175T) were characterized taxonomically. 16S rRNA gene sequence analysis, determination of DNA G+C content, physiological characterization, estimation of the ubiquinone and polar lipid patterns and fatty acid content revealed that strains K101T and A175T were similar to Sphingomonas wittichii RW1T but also showed pronounced differences. The DNA G+C contents of the two novel strains were 63.6 and 66.1 mol%, respectively. On the basis of these results, two novel species of the genus Sphingomonas are described, for which the names Sphingomonas haloaromatic…
OPTIMAL AIRLINE SEAT INVENTORY CONTROL FOR MULTI-LEG FLIGHTS
2005
Abstract For large commercial airlines, efficiently setting and updating seat allocation targets for each passenger category on each multi-leg flight is an extremely difficult problem. This paper presents static and dynamic models of airline seat inventory control for multi-leg flights with multiple fare classes, which allow one to maximize an expected contribution to profit. The dynamic model uses the most recent demand and capacity information and allows one to allocate seats dynamically and anticipatory over time.
An Efficient Algorithm for the Generation of Z-Convex Polyominoes
2014
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.
Approximate convex hull of affine iterated function system attractors
2012
International audience; In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In additio…
The computational complexity of the relative robust shortest path problem with interval data
2004
Abstract The paper deals with the relative robust shortest path problem in a directed arc weighted graph, where arc lengths are specified as intervals containing possible realizations of arc lengths. The complexity status of this problem has been unknown in the literature. We show that the problem is NP -hard.
Balls into non-uniform bins
2014
Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…
Deciding reachability for planar multi-polynomial systems
1996
In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a finite number of (polyhedral) regions. To each of these regions is assigned some vector field which governs the dynamical behaviour of the system within this region. We prove the decidability of point to point and region to region reachability problems for planar hybrid systems for the case when trajectories within the regions can be described by polynomials of arbitrary degree.