OpenMP Implementation of Parallel Longest Common Subsequence Algorithm for Mathematical Expression Retrieval

Given a mathematical expression in LaTeX or MathML format, retrieval algorithm extracts similar expressions from a database. In our previous work, we have used Longest Common Subsequence (LCS) algorithm to match two expressions of lengths, [Formula: see text] and [Formula: see text], which takes [Formula: see text] time complexity. If there are [Formula: see text] database expressions, total complexity is [Formula: see text], and an increase in [Formula: see text] also increases this complexity. In the present work, we propose to use parallel LCS algorithm in our retrieval process. Parallel LCS has [Formula: see text] time complexity with [Formula: see text] processors and total complexity can be reduced to [Formula: see text]. For our experimentation, OpenMP based implementation has been used on Intel [Formula: see text] processor with 4 cores. However, for smaller expressions, parallel version takes more time as the implementation overhead dominates the algorithmic improvement. As such, we have proposed to use parallel version, selectively, only on larger expressions, in our retrieval algorithm to achieve better performance. We have compared the sequential and parallel versions of our ME retrieval algorithm, and the performance results have been reported on a database of 829 mathematical expressions.

Prácticas de textualidad digital de bachilleres al tomar notas sobre diccionarios en línea en la mediateca de lenguas

INTRODUCCIÓN. Este estudio caracteriza las prácticas de textualidad digital de 18 estudiantes de bachillerato al tomar notas en el procesador de textos Word, sobre diccionarios en línea, monolingües en español e inglés y bilingües, inglés-español y español-inglés. Los alumnos exploraron los diccionarios y, para conocerlos, realizaron la consulta del verbo en inglés get. El enfoque corresponde a la literacidad en la textualidad digital. MÉTODO. El estudio contempla la identificación de recursos multimedia y modalidades de textualidad en los diccionarios, y la descripción de la escritura digital en los apuntes. El análisis textual involucra criterios de informatividad identificados en los diccionarios: usos de la lengua, consultas digitales, diseños textuales, fuentes de intertextualidad, coherencia e interactividad, así como la cohesión digital en la redacción expositiva y descriptiva, la intertextualidad mediante ilustraciones, hipervínculos y referencias léxicas y gráficas. RESULTADOS. Los apuntes evidencian el predominio en la identificación de herramientas prácticas en los diccionarios, y menor atención en la coherencia y la interactividad, así como dificultades para integrar la redacción expositiva y descriptiva con las modalidades digitales de intertextualidad, hipertextualidad y referencialidad. DISCUSIÓN. La consideración e identificación de diversos aspectos de textualidad en los diccionarios exhiben la variedad en la intencionalidad y el desempeño mediante recursos digitales y multimodales. Sin embargo, es necesario el apoyo docente y la práctica para apreciar de manera integral la información, así como para la redacción digital en los apuntes. INTRODUCTION. This paper reports on the digital practices of 18 high school students’ when taking notes with the text processor Word about the characteristics of on-line dictionaries—Spanish and English monolingual dictionaries and English-Spanish and Spanish-English bilingual dictionaries. The students explored the dictionaries and, in order to get familiar with them, they worked with the English verb get. The approach implemented refers to literacy in digital textuality. METHOD. The study contemplates the identification of multimedia resources and textual modalities in the dictionaries and the description of digital writing in the notes. Classification and textual analysis involves the informativity criteria identified in the dictionaries: language use, digital searches, textual designs, intertextuality sources, coherence and interactivity, as well as digital cohesion in descriptive and expositive writing, intertextuality by means of images, hyperlinks and lexical and graphic references. RESULTS. The notes show a predominant use of practical tools in the dictionaries in comparison to coherence and interactivity. They also evidence difficulties to integrate expositive and descriptive writing with digital modalities of intertextuality, hypertextuality and referentiality. DISCUSSION. Consideration and identification of various aspects of textuality in dictionaries show various degrees of intentionality and performance through digital and multimodal resources. However, teaching and practice support is necessary to fully appreciate the information, as well as the digital writing in notes.

Lossless Semantic Round-Tripping in PENG ASP

The PENG ASP system supports the writing of textual specifications with the help of a smart text editor that possesses knowledge about the structure of the specification language. Specifications written in PENG ASP are incrementally translated into executable answer set programs and vice versa. That means the system allows for lossless semantic round-tripping between a human-readable specification and an answer set program. This functionality is achieved by a single bi-directional logic grammar that serves at the same time as a text processor and a text generator. We demonstrate that the PENG ASP system can be used to bridge the gap between a (seemingly) informal specification and an executable answer set program.

REALIZATION OF UNITARY MAPS VIA PROBABILISTIC PROGRAMMABLE QUANTUM PROCESSORS

We analyze probabilistic realizations of programmable quantum processors that allow us to realize unitary operations on qubits as well as on qudits. Programmable processors are composed of two inputs — the data register and the program register. In the input state of the program register information about the operation that is supposed to be performed on the data is encoded. At the output of the probabilistic processor a measurement over the program register is performed. An intrinsic property of probabilistic processors is that they sometimes fail, but we know when this happens. We present a complete analysis of two processors: (1) The so-called [Formula: see text] processor that is based on a simple controlled-NOT gate. (2) The so-called [Formula: see text] processor that utilizes the quantum-information-distributor circuit.