Search results for "BED"

showing 10 items of 1605 documents

Dubbing dialogues… naturally: a pragmatic approach to the translation of transition markers in dubbing

2012

Although research in Audiovisual Translation is said to have come of age in the past decade, there are still several key issues that have not received the scholarly attention they deserve. In the case of dubbing, the study of the naturalness of dubbed dialogue is a case in point. The aim of the present article is to analyse the use of transition markers in dubbing in order to look precisely at the naturalness of dubbed dialogue while taking into account the dubbing constraints at play. This analysis is carried out by comparing the dubbed dialogue (English-Spanish) of a popular American sitcom to the non-translated but prefabricated dialogue of a Spanish sitcom and finally to spontaneous con…

Discourse markersLinguistics and Languagemedia_common.quotation_subjectNaturalidadTraducció audiovisualKey issuesLanguage and LinguisticsEducationNaturalnessConversationMarcadores del discursoNaturalidad; Diálogo doblado; Marcadores del discurso; Marcadores de transiciónmedia_commonLiteratureNaturalnessUNESCO::CIENCIAS DE LAS ARTES Y LAS LETRASPoint (typography)business.industryTransition (fiction)Marcadores de transiciónPerspective (graphical)Naturalness; Dubbed dialogue; Discourse markers; Transition markersTranslation and InterpretingTraducción e InterpretaciónArtTraducció--RevistesPragmaticsLinguisticsTraducción audiovisual:CIENCIAS DE LAS ARTES Y LAS LETRAS [UNESCO]Transition markersDiálogo dobladoDubbed dialoguebusinessAudiovisual translationDiscourse markerMonTi: Monografías de Traducción e Interpretación
researchProduct

Planar maps whose second iterate has a unique fixed point

2007

Let a>0, F: R^2 -> R^2 be a differentiable (not necessarily C^1) map and Spec(F) be the set of (complex) eigenvalues of the derivative F'(p) when p varies in R^2. (a) If Spec(F) is disjoint of the interval [1,1+a[, then Fix(F) has at most one element, where Fix(F) denotes the set of fixed points of F. (b) If Spec(F) is disjoint of the real line R, then Fix(F^2) has at most one element. (c) If F is a C^1 map and, for all p belonging to R^2, the derivative F'(p) is neither a homothety nor has simple real eigenvalues, then Fix(F^2) has at most one element, provided that Spec(F) is disjoint of either (c1) the union of the number 0 with the intervals ]-\infty, -1] and [1,\infty[, or (c2) t…

Discrete mathematics37G10; 37G15; 34K18Algebra and Number TheoryApplied Mathematics37G15Dynamical Systems (math.DS)Fixed point37G10Homothetic transformationPlanar graphSet (abstract data type)symbols.namesakeMathematics - Classical Analysis and ODEsSimple (abstract algebra)Classical Analysis and ODEs (math.CA)FOS: MathematicssymbolsEmbeddingDifferentiable functionMathematics - Dynamical Systems34K18AnalysisEigenvalues and eigenvectorsMathematicsJournal of Difference Equations and Applications
researchProduct

Introduction to generalized topological spaces

2011

[EN] We introduce the notion of generalized topological space (gt-space). Generalized topology of gt-space has the structure of frame and is closed under arbitrary unions and finite intersections modulo small subsets. The family of small subsets of a gt-space forms an ideal that is compatible with the generalized topology. To support the definition of gt-space we prove the frame embedding modulo compatible ideal theorem. Weprovide some examples of gt-spaces and study key topological notions (continuity, separation axioms, cardinal invariants) in terms of generalized spaces.

Discrete mathematicsConnected spaceCompatible ideallcsh:Mathematicslcsh:QA299.6-433lcsh:AnalysisTopological spacelcsh:QA1-939Order generated by idealTopological vector spaceSeparation axiomSeparated setsModulo idealEmbeddingIdeal (order theory)FrameGeometry and TopologyGeneral topologyGeneralized topological spaceGeneralized topologyMathematicsgt-space
researchProduct

Sobolev embeddings, extensions and measure density condition

2008

AbstractThere are two main results in the paper. In the first one, Theorem 1, we prove that if the Sobolev embedding theorem holds in Ω, in any of all the possible cases, then Ω satisfies the measure density condition. The second main result, Theorem 5, provides several characterizations of the Wm,p-extension domains for 1<p<∞. As a corollary we prove that the property of being a W1,p-extension domain, 1<p⩽∞, is invariant under bi-Lipschitz mappings, Theorem 8.

Discrete mathematicsExtension operator010102 general mathematicsEberlein–Šmulian theoremMeasure density condition01 natural sciencesSobolev embeddingSobolev inequality010101 applied mathematicsSobolev spaceCorollarySobolev spaces0101 mathematicsInvariant (mathematics)AnalysisEdge-of-the-wedge theoremSobolev spaces for planar domainsMathematicsTrace operatorJournal of Functional Analysis
researchProduct

Embedding of partial spreads in spreads

1978

Discrete mathematicsGeneral MathematicsEmbeddingMathematicsArchiv der Mathematik
researchProduct

Irreducible components of Hurwitz spaces parameterizing Galois coverings of curves of positive genus

2014

Let Y be a smooth, projective, irreducible complex curve. A G-covering p : C → Y is a Galois covering, where C is a smooth, projective, irreducible curve and an isomorphism G ∼ −→ Aut(C/Y ) is fixed. Two G-coverings are equivalent if there is a G-equivariant isomorphism between them. We are concerned with the Hurwitz spaces H n (Y ) and H G n (Y, y0). The first one parameterizes Gequivalence classes of G-coverings of Y branched in n points. The second one, given a point y0 ∈ Y , parameterizes G-equivalence classes of pairs [p : C → Y, z0], where p : C → Y is a G-covering unramified at y0 and z0 ∈ p (y0). When G = Sd one can equivalently consider coverings f : X → Y of degree d with full mon…

Discrete mathematicsHurwitz quaternionHurwitz space Galois covering Braid groupGalois cohomologyInverse Galois problemGeneral MathematicsGalois groupSplitting of prime ideals in Galois extensionsEmbedding problemCombinatoricsHurwitz's automorphisms theoremGalois extensionSettore MAT/03 - GeometriaMathematics
researchProduct

A-Codes from Rational Functions over Galois Rings

2006

In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over Galois rings. Exponential sums over these rings help determine--or bound--the parameters of such codes.

Discrete mathematicsMathematics::Commutative AlgebraApplied MathematicsFundamental theorem of Galois theoryGalois groupRational functionExponential polynomialComputer Science ApplicationsEmbedding problemDifferential Galois theorysymbols.namesakeGalois rings Gray map codesComputer Science::Computer Vision and Pattern RecognitionComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONComputer Science::MultimediasymbolsSettore MAT/03 - GeometriaGalois extensionResolventMathematicsDesigns, Codes and Cryptography
researchProduct

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.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsVolterra operatorFunctional analysisDisjoint sequenceStrongly embedded subspaceFunction spaceGeneral MathematicsLorentz transformationVector measure integrationBanach function spaceLinear subspacesymbols.namesakesymbolsInterpolation spaceBirnbaum–Orlicz spaceLp spaceMATEMATICA APLICADAMathematics
researchProduct

Quantum Pushdown Automata

2000

Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [13]. In this paper we introduce the notion of quantum pushdown automata (QPA) in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [11]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity criteria of quantum Turing machines [4]. We show that QPA can recognize every regular language. Finally we present some simple languages recognized by QPA, two of them are not recognizable by deterministic pushdown automata and one seems to be not recognizable by probabilistic pushdown …

Discrete mathematicsNested wordComputer scienceDeterministic context-free grammarContext-free languagePushdown automatonNonlinear Sciences::Cellular Automata and Lattice GasesEmbedded pushdown automatonDeterministic pushdown automatonTuring machinesymbols.namesakeRegular languageDeterministic automatonProbabilistic automatonsymbolsQuantum finite automataAutomata theoryComputer Science::Formal Languages and Automata TheoryQuantum cellular automaton
researchProduct

A note on the packing of two copies of some trees into their third power

2003

Abstract It is proved in [1] that if a tree T of order n is not a star, then there exists an edge-disjoint placement of two copies of this tree into its fourth power. In this paper, we prove the packing of some trees into their third power.

Discrete mathematicsPermutationFourth powerApplied MathematicsA* search algorithmlaw.inventionPackingCombinatoricslawOrder (group theory)Tree (set theory)Power treeEmbeddingPlacementMathematicsApplied Mathematics Letters
researchProduct