SearcharxivSearch

arXiv subjects

Alejandro Pozo

Publications and source records attributed to Alejandro Pozo.

6 recordsLinked to original sources

Assessing Latency in ASR Systems: A Methodological Perspective for Real-Time Use

Automatic speech recognition (ASR) systems generate real-time transcriptions but often miss nuances that human interpreters capture. While ASR is useful in many contexts, interpreters-who already use ASR tools such as Dragon-add critical value, especially in sensitive settings such as diplomatic meetings where subtle language is key. Human interpreters not only perceive these nuances but can adjust in real time, improving accuracy, while ASR handles basic transcription tasks. However, ASR systems introduce a delay that does not align with real-time interpretation needs. The user-perceived latency of ASR systems differs from that of interpretation because it measures the time between speech and transcription delivery. To address this, we propose a new approach to measuring delay in ASR systems and validate if they are usable in live interpretation scenarios.

cs.SD

Empowering Database Learning Through Remote Educational Escape Rooms

Learning about databases is indispensable for individuals studying software engineering or computer science or those involved in the IT industry. We analyzed a remote educational escape room for teaching about databases in four different higher education courses in two consecutive academic years. We employed three instruments for evaluation: a pre- and post-test to assess the escape room's effectiveness for student learning, a questionnaire to gather students' perceptions, and a Web platform that unobtrusively records students' interactions and performance. We show novel evidence that educational escape rooms conducted remotely can be engaging as well as effective for teaching about databases.

cs.CY

Fostering the integration of European Open Data into Data Spaces through High-Quality Metadata

The term Data Space, understood as the secure exchange of data in distributed systems, ensuring openness, transparency, decentralization, sovereignty, and interoperability of information, has gained importance during the last years. However, Data Spaces are in an initial phase of definition, and new research is necessary to address their requirements. The Open Data ecosystem can be understood as one of the precursors of Data Spaces as it provides mechanisms to ensure the interoperability of information through resource discovery, information exchange, and aggregation via metadata. However, Data Spaces require more advanced capabilities including the automatic and scalable generation and publication of high-quality metadata. In this work, we present a set of software tools that facilitate the automatic generation and publication of metadata, the modeling of datasets through standards, and the assessment of the quality of the generated metadata. We validate all these tools through the YODA Open Data Portal showing how they can be connected to integrate Open Data into Data Spaces.

cs.DB

A splitting method for the augmented Burgers equation

In this paper we consider a splitting method for the augmented Burgers equation and prove that it is of first order. We also analyze the large-time behavior of the approximated solution by obtaining the first term in the asymptotic expansion. We prove that, when time increases, these solutions behave as the self-similar solutions of the viscous Burgers equation

math.NA

A semi-discrete large-time behavior preserving scheme for the augmented Burgers equation

In this paper we analyze the large-time behavior of the augmented Burgers equation. We first study the well-posedness of the Cauchy problem and obtain $L^1$-$L^p$ decay rates. The asymptotic behavior of the solution is obtained by showing that the influence of the convolution term $K*u_{xx}$ is the same as $u_{xx}$ for large times. Then, we propose a semi-discrete numerical scheme that preserves this asymptotic behavior, by introducing two correcting factors in the discretization of the non-local term. Numerical experiments illustrating the accuracy of the results of the paper are also presented.

math.NA

Large-time asymptotics, vanishing viscosity and numerics for 1-D scalar conservation laws

In this paper we analyze the large time asymptotic behavior of the discrete solutions of numerical approximation schemes for scalar hyperbolic conservation laws. We consider three monotone conservative schemes that are consistent with the one-sided Lipschitz condition (OSLC): Lax-Friedrichs, Engquist-Osher and Godunov. We mainly focus on the inviscid Burgers equation, for which we know that the large time behavior is of self-similar nature, described by a two-parameter family of N-waves. We prove that, at the numerical level, the large time dynamics depends on the amount of numerical viscosity introduced by the scheme: while Engquist-Osher and Godunov yield the same N-wave asymptotic behavior, the Lax-Friedrichs scheme leads to viscous self-similar profiles, corresponding to the asymptotic behavior of the solutions of the continuous viscous Burgers equation. The same problem is analyzed in the context of self-similar variables that lead to a better numerical performance but to the same dichotomy on the asymptotic behavior: N-waves versus viscous ones. We also give some hints to extend the results to more general fluxes. Some numerical experiments illustrating the accuracy of the results of the paper are also presented.

math.NA