Multilingual films do not always travel well across borders. When translated, multilingualism may become neutralised and washed out. In subtitling, multiple languages used in the original are usually not marked in any...
详细信息
Multilingual films do not always travel well across borders. When translated, multilingualism may become neutralised and washed out. In subtitling, multiple languages used in the original are usually not marked in any way in the target subtitles. This results in neutralisation and linguistic homogenisation, whereby target viewers may not even realise that different languages are spoken in the film. In this study, we test a new solution aimed to help preserve the multilingual nature of films in interlingual subtitling: the strategy of colour coding. To gauge the impact of colour coding on viewers, we conducted a survey-based reception study on a group of 52 Polish hearing speakers who watched a multilingual film with interlingual subtitles in two versions: one where subtitles were coloured, i.e. each language was marked with a different colour, and the other, control condition, where the subtitles were traditionally white. We measured participants' immersive tendency, immersion, comprehension, and cognitive load. While colour coding did not have a significant impact on immersion, we found that individuals with a lower tendency for immersion reported higher immersion levels when watching coloured subtitles. Our results may contribute to the discussion how to render the multilingual nature of films in interlingual subtitling.
Does the choice of colour-coding scheme affect the usability of metro maps, as measured by the accuracy and speed of navigation? Using colour to differentiate lines or services in maps of metro rail networks has been ...
详细信息
ISBN:
(纸本)9783319913766;9783319913759
Does the choice of colour-coding scheme affect the usability of metro maps, as measured by the accuracy and speed of navigation? Using colour to differentiate lines or services in maps of metro rail networks has been a common practice around the world for many decades. Broadly speaking, there are two basic schemes: 'route colouring', in which each end-to-end route has a distinct colour, and 'trunk colouring', in which each major trunk has a distinct colour, and the individual routes inherit the colour of the main trunk that they run along. A third, intermediate scheme is 'shaded colouring', in which each trunk has a distinct colour, and each route has a distinct shade of that colour. In this study, 285 volunteers in the US were randomised to these three colour-coding schemes and performed seventeen navigational tasks. Each task involved tracing a route in the New York City subway map. Overall, we found that route colouring was significantly more accurate than the trunk-and shaded-colouring schemes. A planned subset analysis, however, revealed major differences between specific navigational hazards: route colouring performed better only against certain navigational hazards;trunk colouring performed best against one hazard;and other hazards showed no effect of colour coding. Route colouring was significantly faster only in one subset.
Understanding spatial correlation is vital in many fields including epidemiology and social science. Lee et al. (Stat Comput 31(4):51, 2021. https://***/10.1007/s11222-021-10025-7) recently demonstrated that improved ...
详细信息
Understanding spatial correlation is vital in many fields including epidemiology and social science. Lee et al. (Stat Comput 31(4):51, 2021. https://***/10.1007/s11222-021-10025-7) recently demonstrated that improved inference for areal unit count data can be achieved by carrying out modifications to a graph representing spatial correlations;specifically, they delete edges of the planar graph derived from border-sharing between geographic regions in order to maximise a specific objective function. In this paper, we address the computational complexity of the associated graph optimisation problem. We demonstrate that this optimisation problem is NP-hard;we further show intractability for two simpler variants of the problem. We follow these results with two parameterised algorithms that exactly solve the problem. The first is parameterised by both treewidth and maximum degree, while the second is parameterised by the maximum number of edges that can be removed and is also restricted to settings where the input graph has maximum degree three. Both of these algorithms solve not only the decision problem, but also enumerate all solutions with polynomial time precalculation, delay, and postcalculation time in respective restricted settings. For this problem, efficient enumeration allows the uncertainty in the spatial correlation to be utilised in the modelling. The first enumeration algorithm utilises dynamic programming on a tree decomposition of the input graph, and has polynomial time precalculation and linear delay if both the treewidth and maximum degree are bounded. The second algorithm is restricted to problem instances with maximum degree three, as may arise from triangulations of planar surfaces, but can output all solutions with FPT precalculation time and linear delay when the maximum number of edges that can be removed is taken as the parameter.
Medication errors in anaesthesia remain a leading cause of patient harm. Compared with conventional methods, use of the international colour-code standard on syringes and medication trays allows significantly more err...
详细信息
Medication errors in anaesthesia remain a leading cause of patient harm. Compared with conventional methods, use of the international colour-code standard on syringes and medication trays allows significantly more errors to be detected, and does so under conditions of cognitive load. Testing methods from experimental psychology provide important new insights for human factors research in anaesthesia and health care.
Background: Anaesthetic drug administration is complex, and typical clinical environments can entail significant cognitive load. colour-coded anaesthetic drug trays have shown promising results for error identificatio...
详细信息
Background: Anaesthetic drug administration is complex, and typical clinical environments can entail significant cognitive load. colour-coded anaesthetic drug trays have shown promising results for error identification and reducing cognitive load. Methods: We used experimental psychology methods to test the potential benefits of colour-coded compartmentalised trays compared with conventional trays in a simulated visual search task. Effects of cognitive load were also explored through an accompanying working memory-based task. We hypothesised that colour-coded compartmentalised trays would improve drug-detection error, reduce search time, and reduce cognitive load. This comprised a cognitive load memory task presented alongside a visual search task to detect drug errors. Results: All 53 participants completed 36 trials, which were counterbalanced across the two tray types and 18 different vignettes. There were 16 error-present and 20 error-absent trials, with 18 trials presented for each preloaded tray type. Syringe errors were detected more often in the colour-coded trays than in the conventional trays (91% vs 83%, respectively;P=0.006). In signal detection analysis, colour-coded trays resulted in more sensitivity to the error signal (2.28 vs 1.50, respectively;P<0.001). Confidence in response accuracy correlated more strongly with task performance for the colour-coded tray condition, indicating improved metacognitive sensitivity to task performance (r=0.696 vs r=0.447). Conclusions: colour coding and compartmentalisation enhanced visual search efficacy of drug trays. This is further evidence that introducing standardised colour-coded trays into operating theatres and procedural suites would add an additional layer of safety for anaesthetic procedures.
Promptly calling for assistance in an anaesthetic emergency is important. However, emergency call systems are not present in all locations where anaesthesia is administered, and in those that do have an emergency call...
详细信息
Promptly calling for assistance in an anaesthetic emergency is important. However, emergency call systems are not present in all locations where anaesthesia is administered, and in those that do have an emergency call system, the call button is often obscured by other equipment or in an unfamiliar location. Placing a red stripe from the ceiling, down the wall, to the emergency call button significantly reduces delays in activating an emergency call, demonstrating a simple but effective system change to the layout of operating theatres.
In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. Panchromatic Graphs: For fixed k is an element of N, a k-panchromatic ...
详细信息
ISBN:
(纸本)9781665420556
In this paper, we show how one may (efficiently) construct two types of extremal combinatorial objects whose existence was previously conjectural. Panchromatic Graphs: For fixed k is an element of N, a k-panchromatic graph is, roughly speaking, a balanced bipartite graph with one partition class equipartitioned into k colour classes in which the common neighbourhoods of panchromatic k-sets of vertices are much larger than those of k-sets that repeat a colour. The question of their existence was raised by Karthik and Manurangsi [Combinatorica 2020]. Threshold Graphs: For fixed k is an element of N, a k-threshold graph is, roughly speaking, a balanced bipartite graph in which the common neighbourhoods of k-sets of vertices on one side are much larger than those of (k + 1)-sets. The question of their existence was raised by Lin [JACM 2018]. Concretely, we provide probability distributions over graphs from which we can efficiently sample these objects in near linear time. These probability distributions are defined via varieties cut out by (carefully chosen) random polynomials, and the analysis of these constructions relies on machinery from algebraic geometry (such as the Lang-Weil estimate, for example). The technical tools developed to accomplish this might be of independent interest. As applications of our constructions, we show the following conditional time lower bounds on the parameterized set intersection problem where, given a collection of n sets over universe [n] and a parameter k, the goal is to find k sets with the largest intersection. Assuming ETH, for any computable function F : N -> N, no n(o(k))-time algorithm can approximate the parameterized set intersection problem up to factor F(k). This improves considerably on the previously best-known result under ETH due to Lin [JACM 2018], who ruled out any n(o(root k)) time approximation algorithm for this problem. Assuming SETH, for every epsilon > 0 and any computable function F : N -> N, no n(k-epsilon)-ti
暂无评论