A metadiscursividade no romance, um erro emocional, de Cristovão Tezza

A metadiscursividade faz-se presente nas obras literárias como um mecanismo discursivo que ajuda a entender o fazer literário do autor e a estabelecer interaçao com o leitor. Os estudos linguístico literários interessam-se pela metadiscursividade que os escritores constroem em suas obras e pelas explicaçoes que eles dao ao seu modo de criaçao. O objetivo deste trabalho é analisar o metadiscurso no romance Um erro emocional, de Cristovao Tezza, à luz dos estudos de Borillo (1985) e Koch (2008) sobre a metadiscursividade e das reflexoes de Bakhtin (1992) sobre o romance. Esse pensador da linguagem considera o romance o gênero dos gêneros e mostra que a obra romanesca aceita diferentes formas de expressao linguística, contempla o entrecruzar de vozes sociais e acolhe uma grande diversidade de estilos. Ao refletir sobre o romance, o filósofo russo eleva-o a uma categoria literária superior em relaçao a outros gêneros, pelo seu caráter de inconclusibilidade e exigência de renovaçao formal permanente. Espera-se com este trabalho, verificar aproximaçoes entre as reflexoes bakhtinianas e a metadiscursividade no fazer literário de Cristovao Tezza, no romance Um erro emocional

Motivos de la canción popular aseguran el código simbólico del romance : El caso de La Samaritana

Uno de los romances de la tradición moderna más difundidos en los repertorios hispánicos -y no hispánicos-, es el de La Samaritana. Se trata de un romance vulgar, repetido casi literalmente una y otra vez por cientos de transmisores, que en determinadas zonas peninsulares se tradicionalizó y originó una serie de versiones distintas, las cuales, sometidas al proceso de la tradición, perviven en variantes. Mediante los pliegos de cordel y sobre todo, por tratar la presencia de Jesús, gozó de una gran divulgación en la Península y ha llegado hasta nuestros días aún con cierto vigor. El código simbólico se ensancha y enriquece, manifestando con nitidez la interacción del romance con la canción lírica

El valor de la lectura o cómo eludir el engaño. La trascendencia del romance de la esposa infiel como una lucha indicial

Mediante el estudio de la tradición americana del romance de La esposa infiel, se resalta la importancia que en dicho romance tiene la lucha, por el desciframiento y el encubrimiento de indicios, librada entre el hombre y la mujer. A partir de tal planteo, se propone que su núcleo de interés radica en la problemática del engaño en general y la necesidad de descubrirlo.

El romance y su empleo ideológico : El caso de "La tierra de Alvargonzález" de Antonio Machado

La poesía según Machado debe hacer manifiesto el fluir temporal y la interacción del poeta con su época a partir de un código simple, lo que implica el rechazo de toda pretensión aristocratizante. El pueblo debe ser el receptor privilegiado. Es por esto que aboga por el uso de una "palabra integral", próxima al lenguaje hablado y por el empleo de formas estróficas de clara raigambre popular. Tal es el caso de "La tierra de Alvargonzález", que remeda la primaria función cultural de cualquier narración tradicional: la de ser ejemplos de vida. El deseo de dignificar cierta veta vulgar del romancero, los romances de ciego o pliegos de cordel, que -no olvidemos- son importaciones de la cultura letrada, se cifra en un lenguaje complejo en su factura, mas no en su comprensión, que combina motivos y estrategias de tradición popular con símbolos de procedencia modernista. En la profundización ?modernizadora? de algunas de sus posturas ideológicas, anuda el uso de un molde estrófico de tradición oral, el romance, con una serie de reflexiones de carácter noventaiochista. De este modo, el arte no es sólo expresión estética, sino -como querían los hombres de la generación del 98- un bastidor en el que se enhebran también cuestiones de índole histórica y social

Essentials in Ontology Engineering: Methodologies, Languages, and Tools

In the beginning of the 90s, ontology development was similar to an art: ontology developers did not have clear guidelines on how to build ontologies but only some design criteria to be followed. Work on principles, methods and methodologies, together with supporting technologies and languages, made ontology development become an engineering discipline, the so-called Ontology Engineering. Ontology Engineering refers to the set of activities that concern the ontology development process and the ontology life cycle, the methods and methodologies for building ontologies, and the tool suites and languages that support them. Thanks to the work done in the Ontology Engineering field, the development of ontologies within and between teams has increased and improved, as well as the possibility of reusing ontologies in other developments and in final applications. Currently, ontologies are widely used in (a) Knowledge Engineering, Artificial Intelligence and Computer Science, (b) applications related to knowledge management, natural language processing, e-commerce, intelligent information integration, information retrieval, database design and integration, bio-informatics, education, and (c) the Semantic Web, the Semantic Grid, and the Linked Data initiative. In this paper, we provide an overview of Ontology Engineering, mentioning the most outstanding and used methodologies, languages, and tools for building ontologies. In addition, we include some words on how all these elements can be used in the Linked Data initiative.

Independence in CLP Languages

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution.

Modular extensions for modular (Logic) languages

We address the problem of developing mechanisms for easily implementing modular extensions to modular (logic) languages. By(language) extensions we refer to different groups of syntactic definitions and translation rules that extend a language. Our use of the concept of modularity in this context is twofold. We would like these extensions to be modular, in the sense above, i.e., we should be able to develop different extensions mostly separately. At the same time, the sources and targets for the extensions are modular languages, i.e., such extensions may take as input sepárate pieces of code and also produce sepárate pieces of code. Dealing with this double requirement involves interesting challenges to ensure that modularity is not broken: first, combinations of extensions (as if they were a single extensión) must be given a precise meaning. Also, the sepárate translation of múltiple sources (as if they were a single source) must be feasible. We present a detailed description of a code expansion-based framework that proposes novel solutions for these problems. We argüe that the approach, while implemented for Ciao, can be adapted for other Prolog-based systems and languages.

Towards execution time estimation in abstract machine-based languages

Abstract machines provide a certain separation between platformdependent and platform-independent concerns in compilation. Many of the differences between architectures are encapsulated in the speciflc abstract machine implementation and the bytecode is left largely architecture independent. Taking advantage of this fact, we present a framework for estimating upper and lower bounds on the execution times of logic programs running on a bytecode-based abstract machine. Our approach includes a one-time, programindependent proflling stage which calculates constants or functions bounding the execution time of each abstract machine instruction. Then, a compile-time cost estimation phase, using the instruction timing information, infers expressions giving platform-dependent upper and lower bounds on actual execution time as functions of input data sizes for each program. Working at the abstract machine level makes it possible to take into account low-level issues in new architectures and platforms by just reexecuting the calibration stage instead of having to tailor the analysis for each architecture and platform. Applications of such predicted execution times include debugging/veriflcation of time properties, certiflcation of time properties in mobile code, granularity control in parallel/distributed computing, and resource-oriented specialization.

High-level languages for small devices: A case study

In this paper we study, through a concrete case, the feasibility of using a high-level, general-purpose logic language in the design and implementation of applications targeting wearable computers. The case study is a "sound spatializer" which, given real-time signáis for monaural audio and heading, generates stereo sound which appears to come from a position in space. The use of advanced compile-time transformations and optimizations made it possible to execute code written in a clear style without efñciency or architectural concerns on the target device, while meeting strict existing time and memory constraints. The final executable compares favorably with a similar implementation written in C. We believe that this case is representative of a wider class of common pervasive computing applications, and that the techniques we show here can be put to good use in a range of scenarios. This points to the possibility of applying high-level languages, with their associated flexibility, conciseness, ability to be automatically parallelized, sophisticated compile-time tools for analysis and verification, etc., to the embedded systems field without paying an unnecessary performance penalty.

Towards a high-level implementation of flexible parallelism primitives for symbolic languages

An abstract is not available.

Independence and search space preservation in dynamically scheduled constraint logic languages

This paper performs a further generalization of the notion of independence in constraint logic programs to the context of constraint logic programs with dynamic scheduling. The complexity of this new environment made necessary to first formally define the relationship between independence and search space preservation in the context of CLP languages. In particular, we show that search space preservation is, in the context of CLP languages, not only a sufficient but also a necessary condition for ensuring that both the intended solutions and the number of transitions performed do not change. These results are then extended to dynamically scheduled languages and used as the basis for the extension of the concepts of independence. We also propose several a priori sufficient conditions for independence and also give correctness and efficiency results for parallel execution of constraint logic programs based on the proposed notions of independence.

New ICT Literacies and Holistic Approaches for the Effective Learning of Languages in Tertiary Education

Abstract: This paper summarizes the evolution of different subjects of English for Specific Purposes and English for Academic and Professional Purposes. The aim here is to show a continuum of changes that have not started and nished in one subject alone but affect the whole curriculum. After the discussion section where advantages and drawbacks of the changes introduced are analyzed, we arrive at some conclusions regarding this ve year period of development in the approach to the teaching and learning of the specific or academic English language in the Escuela Universitaria de Ingeniería Técnica de Telecomunicación, Universidad Politécnica de Madrid. Resumen: Este trabajo resume la evolución que han experimentado distintas asignaturas de Inglés para Fines Especí cos e Inglés para Fines Académicos y Profesionales. El objetivo principal es mostrar cómo el esfuerzo por mejorar las asignaturas afecta al currículo como un todo y no sólo a cada una de las asignaturas. Tras el análisis de algunas de las ventajas e inconvenientes de los cambios introducidos, se alcanzan algunas conclusiones sobre la evolución que han sufrido este tipo de asignaturas durante los últimos cinco años en la Escuela Universitaria de Ingeniería Técnica de Telecomunicación, Universidad Politécnica de Madrid.