Funciones de la lectura en la enseñanza del inglés profesional y académico y estrategias de comprensión lectora.

Sin resumenThis article analyses the role of reading in the teaching of English for Professional and Academic Purposes from a communicative perspective, considering it as an interactive process hetween reader and text. Re reader is a university student who needs to develop his linguistic abilities in English as a vehicle for the transmission of scientific knowledge. The text, with a structure proper of scientifie genres, represents for the Spanish speaking student a stimulus for the learning of Academic English as well as a source of information. Severa) pedagogical activities, 69 Pilar Durán Escribano Funciones de la lectura en la enseñanza del inglés profesional... related to the methodology of teaching reading strategies: previous, simultaneous and after the reading process, are proposed

Interface growth in two dimensions: A Loewner-equation approach

The problem of Laplacian growth in two dimensions is considered within the Loewner-equation framework. Initially the problem of fingered growth recently discussed by Gubiec and Szymczak [T. Gubiec and P. Szymczak, Phys. Rev. E 77, 041602 (2008)] is revisited and a new exact solution for a three-finger configuration is reported. Then a general class of growth models for an interface growing in the upper-half plane is introduced and the corresponding Loewner equation for the problem is derived. Several examples are given including interfaces with one or more tips as well as multiple growing interfaces. A generalization of our interface growth model in terms of ``Loewner domains,'' where the growth rule is specified by a time evolving measure, is briefly discussed.Comment: To appear in Physical Review

Maude: specification and programming in rewriting logic

Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object level. Reflection is systematically exploited in Maude endowing the language with powerful metaprogramming capabilities, including both user-definable module operations and declarative strategies to guide the deduction process. This paper explains and illustrates with examples the main concepts of Maude's language design, including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views. We also explain how Maude supports reflection, metaprogramming and internal strategies. The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques. We conclude with some remarks about applications, work on a formal environment for Maude, and a mobile language extension of Maude

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a rectangular grid such that two vertices are adjacent if and only if the corresponding paths share at least one edge of the grid. For a nonnegative integer $k$, $B_k$-EPG graphs are defined as EPG graphs admitting a model in which each path has at most $k$ bends. Circular-arc graphs are intersection graphs of open arcs of a circle. It is easy to see that every circular-arc graph is a $B_4$-EPG graph, by embedding the circle into a rectangle of the grid. In this paper, we prove that every circular-arc graph is $B_3$-EPG, and that there exist circular-arc graphs which are not $B_2$-EPG. If we restrict ourselves to rectangular representations (i.e., the union of the paths used in the model is contained in a rectangle of the grid), we obtain EPR (edge intersection of path in a rectangle) representations. We may define $B_k$-EPR graphs, $k\geq 0$, the same way as $B_k$-EPG graphs. Circular-arc graphs are clearly $B_4$-EPR graphs and we will show that there exist circular-arc graphs that are not $B_3$-EPR graphs. We also show that normal circular-arc graphs are $B_2$-EPR graphs and that there exist normal circular-arc graphs that are not $B_1$-EPR graphs. Finally, we characterize $B_1$-EPR graphs by a family of minimal forbidden induced subgraphs, and show that they form a subclass of normal Helly circular-arc graphs